Heuristic congestion control for message deletion in delay tolerant network

Authors:
Lertluck Leela-Amornsin;Hiroshi Esaki
Affiliations:
Graduate School of Information Science and Technology, Information and Communication Engineering, The University of Tokyo, Tokyo, Japan;Graduate School of Information Science and Technology, Information and Communication Engineering, The University of Tokyo, Tokyo, Japan
Venue:
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Year:
2010

Citing 12
Cited 1

Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Alternative custodians for congestion control in delay tolerant networks

Proceedings of the 2006 SIGCOMM workshop on Challenged networks
DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Bubble rap: social-based forwarding in delay tolerant networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Fast track article: Enabling opportunistic storage for mobile DTNs

Pervasive and Mobile Computing
Mobility entropy and message routing in community-structured delay tolerant networks

Proceedings of the 4th Asian Conference on Internet Engineering
The ONE simulator for DTN protocol evaluation

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Delay-tolerant networking: an approach to interplanetary Internet

IEEE Communications Magazine

Message Drop Control Buffer Management Policy for DTN Routing Protocols

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Delay tolerant network (DTN) challenges on large delay of communication, opportunistic and intermittent connectivity so that data can be transferred over vulnerable network. Most routing protocols in DTN basing on replicating routing work well over infinite buffer assumption but the performance drops when using with finite buffer due to the congestion problem. However, it is still lack of work on congestion control in DTN. Since simple congestion control policies can cause uselessly looping problem and cannot maintain high performance when nodes buffer become overflow, a new buffer management policy for DTN should be considered. In this paper, we identify the looping problem caused by using simple buffer management policies and propose the Effective Looping Control mechanism to solve such a problem. We also propose the Credit-based Congestion Control as for heuristically deleting messages when the buffer congested to retain high delivery rate with low number of replicas.