An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks
Abstract
:Featured Application
Abstract
1. Introduction
- -
- The proposed protocol is described in more detail by completing the flowchart of the proposed protocol and using an example of a message delivery to illustrate the proposed protocol.
- -
- The performance of the proposed protocol is newly analyzed thoroughly using simulation and compared with four other protocols in terms of the delivery ratio, overhead ratio, and delivery latency.
- -
- Related works are significantly extended in this paper.
2. Related Works
3. Proposed Protocol
4. Performance Analysis
5. Conclusions
Author Contributions
Funding
Conflicts of Interest
References
- Fall, K. A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM ’03), Karlsruhe, Germany, 25–29 August 2003. [Google Scholar]
- Burleigh, S.; Hooke, A.; Torgerson, L.; Fall, K.; Cerf, V.; Durst, B.; Scott, K. Delay-tolerant networking: An approach to interplanetary internet. IEEE Commun. Mag. 2003, 41, 128–136. [Google Scholar] [CrossRef]
- Delay Tolerant Networking Research Group. Available online: https://irtf.org/concluded/dtnrg (accessed on 15 February 2018).
- Zhang, Z. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Commun. Surv. Tutor. 2006, 8, 24–37. [Google Scholar] [CrossRef]
- Martin-Campillo, A.; Crowcroft, J.; Yoneki, E.; Marti, R. Evaluating opportunistic networks in disaster scenarios. J. Netw. Comput. Appl. 2013, 36, 870–880. [Google Scholar] [CrossRef]
- Zhang, X.; Neglia, G.; Kurose, J.; Towsley, D. Performance modeling of epidemic routing. Comput. Netw. 2007, 51, 2867–2891. [Google Scholar] [CrossRef] [Green Version]
- Spyropoulos, T.; Psounis, K.; Raghavendra, C.S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the ACM SIGCOMM Workshop on Delay-tolerant Networking, Philadelphia, PA, USA, 26 August 2005. [Google Scholar]
- Lindgren, A.; Doria, A.; Davies, E.; Grasic, S. Probabilistic routing protocol for intermittently connected networks. ACM SIGMOBILE Mob. Comput. Commun. Rev. 2003, 7, 19–20. [Google Scholar] [CrossRef]
- Lee, E.H.; Seo, D.Y.; Chung, Y.W. An improved forwarding strategy in opportunistic network. In Proceedings of the Future Generation Communication and Networking, Jeju, Korea, 23–25 November 2016. [Google Scholar]
- Khabbaz, M.; Assi, C.M.; Fawaz, W.F. Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges. IEEE Commun. Surv. Tutor. 2012, 14, 607–640. [Google Scholar] [CrossRef]
- Cao, Y.; Sun, Z. Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges. IEEE Commun. Surv. Tutor. 2013, 15, 654–677. [Google Scholar] [CrossRef]
- Zhu, Y.; Xu, B.; Shi, X.; Wang, Y. A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects. IEEE Commun. Surv. Tutor. 2013, 15, 387–401. [Google Scholar] [CrossRef]
- Wei, K.; Kiang, X.; Xu, K. A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues. IEEE Commun. Surv. Tutor. 2014, 16, 556–578. [Google Scholar]
- Jain, S.; Chawla, M. Survey of Buffer Management Policies for Delay Tolerant Networks. J. Eng. 2014, 2014, 117–123. [Google Scholar] [CrossRef]
- Lee, K.H.; Park, T.M.; Kim, C.K. Social-community based DTN Routing. J. Korean Inst. Inf. Sci. Eng. 2011, 38, 366–373. [Google Scholar]
- Liu, Y.; Wang, J.; Zhang, S.; Zhou, H. A Buffer Management Scheme Based on Message Transmission Status in Delay Tolerant Network. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM), Kathmandu, Nepal, 5–9 December 2011. [Google Scholar]
- Kim, M.J.; Chung, Y.W. An improved message delivery scheme based on node density in delay tolerant network. J. Korean Inst. Inf. Technol. 2014, 12, 69–74. [Google Scholar] [CrossRef]
- Lee, H.J.; Nam, J.C.; Seo, W.K.; Choi, J.I.; Cho, Y.Z. An Efficient DTN Routing Protocol with Considering Contact Duration. In Proceedings of the KICS Annual Winter Conference, Jeongseon, Korea, 21–23 January 2015. [Google Scholar]
- Ababou, M.; Elkouch, R.; Mellafkih, M.; Ababou, N. AntProPHET: A new routing protocol for delay tolerant networks. In Proceedings of the 2014 14th Mediterranean Microwave Symposium, Marrakech, Morocco, 12–14 December 2015. [Google Scholar]
- Ouadrhiri, A.E.; Kamili, M.E.; Fenni, M.R.E.; Omari, L. Learning controlled forwarding strategy improving probabilistic routing in DTNs. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), Istanbul, Turkey, 6–9 April 2014. [Google Scholar]
- Huang, T.K.; Lee, C.K.; Chen, L.J. PRoPHET+: An adaptive PRoPHET-based routing protocol for opportunistic network. In Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications, Perth, WA, Australia, 20–23 April 2010. [Google Scholar]
- Lee, F.C.; Yeo, C.K. Probabilistic routing based on history of messages in delay tolerant networks. In Proceedings of the IEEE Vehicular Technology Conference, San Francisco, CA, USA, 5–8 September 2011. [Google Scholar]
- Sok, P.; Kim, K. Distance-based PRoPHET routing protocol in disruption tolerant network. In Proceedings of the International Conference on ICT Convergence (ICTC), Jeju, Korea, 14–16 October 2013. [Google Scholar]
- Sok, P.; Tan, S.; Kim, K. PRoPHET routing protocol based on neighbor node distance using a community mobility model in delay tolerant networks. In Proceedings of the IEEE International Conference on High Performance Computing and Communications & IEEE International Conference on Embedded and Ubiquitous Computing, Zhangjiajie, China, 13–15 November 2013. [Google Scholar]
- Gan, S.; Zhou, J.; Wei, K. HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks. J. Inf. Process. Syst. 2017, 13, 618–629. [Google Scholar]
- Baek, K.M.; Seo, D.Y.; Chung, Y.W. An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes. Appl. Sci. 2018, 8, 1344. [Google Scholar] [CrossRef]
- The Opportunistic Network Environment Simulator. Available online: http://www.netlab.tkk.fi/tutkimus/dtn/theone/ (accessed on 3 May 2018).
- Keranen, A.; Ott, J.; Karkkainen, T. The ONE simulator for DTN protocol evaluation. In Proceedings of the second International Conference on Simulation Tools and Techniques, Rome, Italy, 2–6 March 2009. [Google Scholar]
- Huang, H.; Mao, Y.; Zhang, X. Probability routing algorithm based on historical throughput in DTN network. In Proceedings of the International Conference on Consumer Electronics, Communications and Networks, Xianning, China, 20–22 November 2013. [Google Scholar]
- Lindgren, A.; Phanse, K. Evaluation of queueing policies and forwarding strategies for routing in intermittently connected networks. In Proceedings of the International Conference on Communication System Software and Middleware, New Delhi, India, 8–12 January 2006. [Google Scholar]
Parameter | Value |
---|---|
Area size (m2) | 4500 × 3400 [25,29] |
Number of rngSeeds | 5 |
Router | PRoPHET Router |
0.75 [30] | |
0.98 [30] | |
0 | |
0.25 [30] | |
NFmax | 5 |
Pmax (initial value) | 0 |
Movement model | pedestrian, car: Shortest Path Map Based Movement [25] tram: Map Route Movement [25] |
Speed (m/s) | pedestrian: U[0.5, 1.5] [25] car: U[2.7, 13.9] tram: U[7, 10] |
Number of total nodes | 126 (default) |
Number of pedestrian | 80 (default) |
Number of cars | 40 (default) |
Number of trams | 6 (default) |
Simulation time (s) | 216,000 |
Transmission range (m) | pedestrian, car: 10 (interface1) (default) [19] tram: 10 (interface1), 1000 (interface2) (default) [19] |
Packet transmission speed | 250 Kbyte/s [19] |
Buffer size (MBytes) | pedestrian, car: 50 (default) tram: 500 (default) |
Message interval (s) | U[25 s, 35 s] |
Message size (Bytes) | U[500 k~1 M] [30] |
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Share and Cite
Lee, E.H.; Seo, D.Y.; Chung, Y.W. An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks. Appl. Sci. 2018, 8, 2215. https://doi.org/10.3390/app8112215
Lee EH, Seo DY, Chung YW. An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks. Applied Sciences. 2018; 8(11):2215. https://doi.org/10.3390/app8112215
Chicago/Turabian StyleLee, Eun Hak, Dong Yeong Seo, and Yun Won Chung. 2018. "An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks" Applied Sciences 8, no. 11: 2215. https://doi.org/10.3390/app8112215
APA StyleLee, E. H., Seo, D. Y., & Chung, Y. W. (2018). An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks. Applied Sciences, 8(11), 2215. https://doi.org/10.3390/app8112215