A novel congestion control strategy in DTN Online publication date: Fri, 05-Dec-2014
by Qi-Lie Liu; Ying-Jun Pan; Yun Li; Ling Zhao
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 5, No. 4, 2012
Abstract: Delay tolerant networks (DTNs) are wireless networks where disconnections may occur frequently due to node mobility, power outages and propagation phenomena. To achieve date delivery, store-and-forward protocols are used in DTN and routing protocols based on epidemic message dissemination have been proposed, like epidemic routing. Under epidemic routing, messages can be delivered completely between every two nodes if every node buffer is big enough and the communication time is long enough after one node contacts another. But congestion will occur easily at a node if the buffer of this node is limited under epidemic routing in DTN. To solve this problem, a novel congestion control strategy is introduced. The strategy is called N-DC (drop the copying numbers over N). By using simulations based on a Random Waypoint model, the simulation results proved the improvement of this strategy.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com