Yun Li
ABSTRACT
Delay-Tolerant Networks are wireless networks where disconnections may occur frequently due to node mobility, power outages and propagation phenomena. In order to achieve date delivery, store-and-forward protocols are used in DTN and routing protocols based on epidemic message dissemination has been proposed, such as Epidemic routing. Under Epidemic routing, packets can be delivered completely between every tow nodes if every node buffer is big enough and the communication time is long enough after one node contacts another one. But congestion will occur easily at a node if the buffer of this node is limited under Epidemic routing in DTN. In order to solve this problem, a congestion control strategy was introduced. If a node buffer is full and it needs to store a new packet, every packet in the node buffer will be checked, in order to find out the packets whose numbers of forwarding are over N and then erase them. If there is no packet whose number of forwarding is over N, the last packet will be erased. The strategy is called N-Drop. Using simulations based on a random waypoint model, the simulation results proved the improvement of our strategy.
- Vinton Cerf, Scott Burleigh, Adrian Hooke, Leigh Torgerson, Robert Durst, Keith Scott, Kevin Fall, and Howard Weiss. 2003 Delay-tolerant network architecture.DTN Research Group Internet Draft, March.Google Scholar
- S. Burleigh, A. Hooke, L. Torgerson, K, fall, V. Cerf, B. Durst, K. Scott, and H. Weiss. 2003. Delay-tolerant networking: An approach to interplanetary internet. IEEE Communications. (June 2003), 128--137. Google ScholarDigital Library
- Kevin Fall, Wei Hong, and Samuel Madden. 2003. Custody transfer for reliable delivery in delay tolerant networks. Intel Research, Berkeley, California.Google Scholar
- K. Fall. 2003. A Delay-Tolerant Network Architecture for Challenged Internets. Proceedings of the 2003 conference on Applications. Google ScholarDigital Library
- Amin Vahdat, and David Becker. 2000. Epidemic routing for partially-connected ad hoc networks. Technical Report CS-200006, Duke University.Google Scholar
- Ahmad, S., Awan, I., Waqqas, A., and Ahmad, B. Performance analysis of DSR & extended DSR protocols. 2008. Modeling & Simulation 2008. AICMS 08.Second Asia International Conference on 13--15 May 2008, 191--196. Google ScholarDigital Library
- Hong-Peng Wang, and Lin Cui. 2008. An enhanced AODV for mobile ad hoc network. Machine Learning and Cybernetics, 2008 International Conference on Volume 2, 12--15 July 2008, 1135--1140.Google Scholar
- JA. Davis, AH. Fagg, and BN. Levine. 2001. Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks. International Symposium on Wearable Computing. Google ScholarDigital Library
- A. Lindgren and K. S. Phanse. 2006. Evaluation of queuing policies and forwarding stratiogies for routing in intermittently connected networks. In Proc. of IEEE COMSWARE.Google Scholar
- The network simulator ns-2. http://www.isi.edu./nsnam/ns/.Google Scholar
Index Terms
- N-Drop: congestion control strategy under epidemic routing in DTN
Recommendations
A Novel Congestion Control Strategy in Delay Tolerant Networks
ICFN '10: Proceedings of the 2010 Second International Conference on Future NetworksDelay-Tolerant Networks(DTN) are wireless networks where disconnections may occur frequently due to node mobility, power outages and propagation phenomena. In order to achieve data delivery, store-and-forward protocols are used in DTN and routing ...
Directional forward epidemic routing for disruption tolerant networks
WiCOM'09: Proceedings of the 5th International Conference on Wireless communications, networking and mobile computingEpidemic Routing is an original and effective multicopy routing algorithm in disruption tolerant networks. However, its performance degrades significantly when network resources are limited. In this paper, we proposed a new routing scheme, called ...
Evaluating the capacity of resource-constrained DTNs
IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computingDue to their low network connectivity, sparsely-connected networks can support delay-tolerant applications only. Thus, such communication environments are examples of Delay-Tolerant Networks (DTNs). While in some DTN connectivity is predictable (e.g., ...
Comments