Abstract
How to achieve efficient data transmission in delay tolerant network (DTN) is an important issue to many wireless or mobile systems. In this study, we propose a new routing protocol to improve delivery rate and optimize delivery delay with low overhead in DTN. We extend the classic PROPHET routing protocol by a scheduling policy to increase delivery rate and reduce delivery delay in DTN. We try to improve the performance of traditional PROPHET from both storage and transmission. Moreover, we evaluate the performance of the scheduling protocol by ONE Simulator. The simulation result illustrates that the proposed protocol is able to achieve better performance compared with the classic protocols like PROPHET and Epidemic in several key aspects.
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
Burleigh, S., Hooke, A., Torgerson, L., et al.: Delay-tolerant networking: an approach to interplanetary internet. IEEE Commun. Mag. 41(6), 128–136 (2003)
Fall, K.: A delay-tolerant network architecture for challenged internets. In: SIGCOMM Proceedings of the Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, vol. 33(4), pp. 27–34. ACM (2003)
Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: SIGCOMM Proceedings of the Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, vol. 34(4), pp. 145–158. ACM (2004)
Vahdat, A., Becker, D.: Epidemic Routing for Partially Connected Ad Hoc Networks. Technical report (2000)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceeding of ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 252–259 (2005)
Lindgren, A., Doria, A.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–20 (2003)
Anna, S., Stavros, T.: Wireless mobile DTN routing with the extended minimum estimated expected delay protocol. Ad Hoc Netw. 42(15), 47–60 (2016)
Li, W.Z., Lin, F., Zhou, J.L., Wang, Y.: DTN routing with fixed stations based on the geographic grid approach in an urban environment. Wirel. Pers. Commun. 82(4), 2033–2049 (2015)
Lebrun, J., Chuah, C.N., Ghosal, D., Zhang, M.: Knowledge based opportunistic forwarding in vehicular wireless ad hoc networks. IEEE Veh. Technol. Conf. 4(4), 2289–2293 (2005)
Leguay, J., Friedman, T., Conan, V.: Evaluating mobility pattern space routing for DTNs. In: IEEE 25th International Conference on Computer Communications, pp. 1–10 (2006)
Musolesi, M., Hailes, S., Mascolo, C.: Adaptive routing for intermittently connected mobile ad hoc networks. In: Proceeding of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks, pp. 183–189. IEEE Computer Society (2005)
Nelson, S.C., Bakht, M., Kravets, R.: Encounter-Based Routing in DTNs. Infocom IEEE 13(1), 846–854 (2009)
Bulut, E., Geyik, S.C., Szymanski, B.K.: Utilizing correlated node mobility for efficient DTN routing. Pervasive Mob. Comput. 13(4), 150–163 (2014)
Satya, B.S., Nanaji, U.: Efficient implementation of conditional shortest path routing in delay tolerant networks. Int. J. Comput. Sci. Commun. Netw. 1(3), 252–257 (2011)
Burns, B., Brock, O., Levine, B.N.: MV routing and capacity building in disruption tolerant networks. In: 24th Annual Joint Conference of the IEEE Computer and Communications Socierties, vol. 1(4), pp. 398–408. Infocom IEEE (2005)
Spyropolous, T., Psounis, K., Raghavendra, C.S.: Single-copy routing in intermittently connected mobile networks. In: First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, IEEE Secon 2004, pp. 235–244 (2004)
Lenormant, F.: GTDM: a DTN routing on noncooperative game theory in a city environment. J. Sens. 2015, 1–9 (2015)
Keränen, A., Ott, J., Kärkkäinen, T.: The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques (2009)
Acknowledgments
This work is partially supported by Grants from the NSFC Program (NSFC61379121 and NSFC 61305148), the Science and Technology Department of Zhejiang Province Program (no. 2014C33097, 2014C33079, 2014C33099 and 2015C33062), the ZJNSF Program (no. LY14F020003).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Mao, Y., Zhou, C., Lloret, J. (2017). An Optimized Probabilistic Routing Protocol Based on Scheduling Mechanism for Delay Tolerant Network. In: Guo, S., Wei, G., Xiang, Y., Lin, X., Lorenz, P. (eds) Testbeds and Research Infrastructures for the Development of Networks and Communities. TridentCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 177. Springer, Cham. https://doi.org/10.1007/978-3-319-49580-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-49580-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49579-8
Online ISBN: 978-3-319-49580-4
eBook Packages: Computer ScienceComputer Science (R0)