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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., et al.: Delay-tolerant networking: an approach to interplanetary internet. IEEE Communications Magazine, 128–136 (2003)
RFC4838: Delay-Tolerant Networking Architecture, IRTF DTN Research Group (2007)
Fall, K.: A delay-tolerant network architecture for challenged internets. In: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 27–34 (2003)
Fall, K., Hong, W., Madden, S.: Custody transfer for reliable delivery in delay tolerant networks, Technical Report IRB-TR-03-030, Intel Research, Berkeley, California (2003)
Juang, P., Oki, H., et al.: Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: ACM SIGOPS Operating Systems Review, pp. 96–107 (2002)
Small, T., Haas, Z.J., et al.: A sensor network for biological data acquisition. Sensor Networks
Carrilho, S., Esaki, H.: A Pub/Sub message distribution architecture for disruption tolerant networks. IEICE Transactions on Information and Systems, 1888–1896 (2009)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks (2000)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: ACM SIGCOMM workshop on Delay-Tolerant Networking, p. 259 (2005)
Lindgren, A., Doria, A., et al.: Probabilistic routing in intermittently connected networks. Computer Communication Review 7, 19–20 (2003)
Ochiai, H., Esaki, H.: Mobility entropy and message routing in community-structured delay tolerant networks. In: The 4th Asian Conference on Internet Engineering, pp. 93–102 (2004)
Balasubramanian, A., Levine, B., Venkataramani, A.: DTN routing as a resource allocation problem. In: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, p. 384 (2007)
Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: Social-based forwarding in delay tolerant networks. In: The 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 241–250 (2008)
Yuen, W.H., Schulzrinne, H.: Performance evaluation of time-based and hop-based TTL schemes in partially connected ad hoc networks. In: IEEE ICC’06 (2006)
Lindgren, A., Phanse, K.S.: Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks. In: IEEE COMSWARE (2006)
Krifa, A., Barakat, C., Spyropoulos, T.: Optimal buffer management policies for delay tolerant networks. In: IEEE SECON (2008)
Seligman, M.: Storage usage of custody transfer in delay tolerant networks with intermittent connectivity. In: ICWN (2006)
Jones, E.P., Ward, P.A.: Routing strategies for delay-tolerant networks. ACM Computer Communication Review, CCR (2006)
Keranen, A., Ott, J., Karkkainen, T.: The ONE simulator for DTN protocol evaluation. In: The 2nd International Conference on Simulation Tools and Techniques, p. 55 (2009)
Jain, S., Fall, K., Patra, R.: Routing in a Delay Tolerant Network Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 145–158 (2004)
Pitkanen, M.J., Ott, J.: Enabling opportunistic storage for mobile DTNs Pervasive and Mobile Computing, pp. 579–594 (2008)
Eisenman, S.B., Lane, N.D., et al.: Metrosense project: People-centric sensing at scale. In: First Workshop on World-Sensor-Web (2006)
Seligman, M., Fall, K., Mundur, P.: Alternative custodians for congestion control in delay tolerant networks. In: Proceedings of the 2006 SIGCOMM Workshop on Challenged Networks, p. 236 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leela-amornsin, L., Esaki, H. (2010). Heuristic Congestion Control for Message Deletion in Delay Tolerant Network. In: Balandin, S., Dunaytsev, R., Koucheryavy, Y. (eds) Smart Spaces and Next Generation Wired/Wireless Networking. ruSMART NEW2AN 2010 2010. Lecture Notes in Computer Science, vol 6294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14891-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-14891-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14890-3
Online ISBN: 978-3-642-14891-0
eBook Packages: Computer ScienceComputer Science (R0)