Abstract
Delay/disruption tolerant network (DTN) is originated from the pioneer research into interplanetary internet and later, researchers found that DTN can also be applied to many challenged networks. Several DTN routing protocols have been presented to improve the routing performance, since message delivery is difficult in such networks due to the absence of stable end-to-end paths. However, the protocols ignore the fact that the nodes in DTN like satellites and other wireless devices usually have very limited resources like battery, bandwidth, and storage. In this paper, we introduce four existing routing algorithms and two new routing algorithms we propose, and compare their performances of delivery ratio and latency in the case of limited buffer size under both ground and space environment. We obtain the curves of the network throughput varying with the network load, and find it showing a congestion phenomenon, from which we can compare the congestion control capacities of the routing protocols. Simulation results show that our newly proposed routing protocols can successfully cope with the congestion caused by storage constraints.
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
References
Jain, S., Chawla, M.: Survey of buffer management policies for delay tolerant networks, 1 (2014)
Yan, H., Zhang, Q., Sun, Y.: Local information-based congestion control scheme for space delay/disruption tolerant networks. Wirel. Netw. 21(6), 1–13 (2015)
Shen, J., Weiming, L.I., Zhang, S.: Research on application of DTN in space information network. Spacecraft Eng. (2015)
Balasubramanian, A., Levine, B., Venkataramani, A.: DTN routing as a resource allocation problem. SIGCOMM Comput. Commun. Rev. 37(4), 373–384 (2007)
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: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 252–259 (2005)
Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Age matters: efficient route discovery in mobile Ad Hoc networks using encounter ages. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 257–266 (2003)
Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 32–40 (2007)
Dimitriou, S., Tsaoussidis, V.: Effective buffer and storage management in DTN nodes. In: 2009 International Conference on Ultra Modern Telecommunications Workshops, pp. 1–3 (2009)
Zhang, X., Zhang, H., Gu,. Y.: Impact of source counter on DTN routing control under resource constraints. In: Proceedings of the Second International Workshop on Mobile Opportunistic Networking, pp. 41–50 (2010)
Silva, A.P., Burleigh, S., Hirata, C.M., et al.: A survey on congestion control for delay and disruption tolerant networks. Ad Hoc Netw. 25(PB), 480–494 (2015)
Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Pers. Ubiquit. Comput. 10(4), 255–268 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Cha, R., Chen, Y., Wan, L., Wang, J. (2018). Exploiting DTN Routing Algorithms Under Resource Constraints. In: Yu, Q. (eds) Space Information Networks. SINC 2017. Communications in Computer and Information Science, vol 803. Springer, Singapore. https://doi.org/10.1007/978-981-10-7877-4_19
Download citation
DOI: https://doi.org/10.1007/978-981-10-7877-4_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7876-7
Online ISBN: 978-981-10-7877-4
eBook Packages: Computer ScienceComputer Science (R0)