Location Based Contact Time Energy Efficient Routing (LCTEE) Approach for Delay Tolerant Networks
- 19 Downloads
Most of the routing algorithm developed for DTN are encounter based algorithms in which some nodes meet with high frequency but for short period of time. Therefore, encounters cannot guarantee transmission of large number of messages during a contact. These methods also suffer from high overheads caused by the unnecessary transmissions and long delays due to suboptimal choices for relay nodes. Therefore, in this paper, we considered a duration based utility instead of frequency to achieve high transmission throughput between nodes. Further, to reduce the overheads, we propose to send multiple copies of a message towards the destination using direction based routing. In addition, we also used threshold based buffer management scheme to reduce overheads and improve packet delivery probability. The simulation results show that our proposed strategy reduces overheads as compared to the previous existing strategies while maintaining comparable delivery probability.
KeywordsDelay tolerant networks (DTNs) Power control Opportunistic networks Overhead Contact duration
- 2.Al-Fagih, A. E., & Hassanein, H. S. (2012) Routing schemes for delaytolerant networks—an applications perspective: Technical report 588, pp. 1–40.Google Scholar
- 6.Shen, J., Moh, S., & Chung, I. (2008). Routing protocols in delay-tolerant networks: A comparative survey. In The 23rd international technical conference on circuits/systems, computers and commun. (pp. 1577–1580)Google Scholar
- 7.Puri, P., & Singh, M. P. (2013). A survey paper on routing in delay-tolerant networks. In International conference on information systems and computer networks (pp. 215–220).Google Scholar
- 8.Silva, D. R., Costa, A., & Macedo, J. (2012). Energy impact analysis on DTN routing protocols. ACM ExtremeCom Switzerland March 10–14, pp. 1–6.Google Scholar
- 9.Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, Portland, Oregon (pp. 145–158).Google Scholar
- 10.Lobiyal, D. K., & Savita, (2015). Location information in inter-contact based routing approach in delay tolerant network. Procedia Computer Science, 57(2015), 1367–1375.Google Scholar
- 14.Merugu, S., Ammar, M., & Zegura, E. (2004). Routing in space and time in networks with predictable mobility. Technical Report GIT-CC-04-7, Georgia Institute of Technology.Google Scholar
- 15.Vahdat, A, & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Duke Univ., Duhram, NC, Tech. Rep. CS-2000-06Google Scholar
- 16.Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proc. of the WDTN’2005 ACM SIGCOMM workshop on delay-tolerant networking (pp. 252–259). https://doi.org/10.1145/1080139.1080143.
- 18.Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proceedings of the 25th IEEE international conference on computer communications INFOCOM, Barcelona, April 23–29. https://doi.org/10.1109/INFOCOM.2006.228
- 19.Becker, C., & Schiele, G. (2001). New mechanisms for routing in ad hoc networks through world models. In 4th Plenary Cabernet Wksp., Pisa, 2001 (pp. 1–4).Google Scholar
- 20.Zhao, W., Ammar, M., & Zegura, E. (2004). A Message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of the 5th ACM international symposium on mobile ad hoc networking and computing, Roppongi Hills, Tokyo, May 24–26 (pp. 187–198).Google Scholar
- 22.Daly, E. M., & Haahr, M. (2007). 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, September 09–14 (pp. 32–40).Google Scholar
- 24.Zhang, Y., & Zhao, J. (2009). Social network analysis on data diffusion in delay tolerant networks. In Proceedings of the tenth ACM international symposium on mobile ad hoc networking and computing, LA, May 18–21 (pp. 345–346).Google Scholar
- 25.Bulut, E., & Szymanski, B. K. (2010). Friendship based routing in delay tolerant mobile social networks. In IEEE global telecommunication conference, December 6–10 (pp. 1–5).Google Scholar
- 28.Paulos, E., & Goodman, E. (2004). The familiar stranger: Anxiety comfort, and play in public places. In Proceedings of the SIGCHI conference on human factors in computing systems, Vienna, April 24–29 (pp. 223–230).Google Scholar
- 31.Chen, S., Zhang, J., & Gao, Q. (2010). An efficient hybrid routing based on contact history in delay tolerant networks. In Seventh international conference on wireless and optical communications networks, September 6–8 (pp. 1–6).Google Scholar
- 33.Gao, W., Li, Q., Zhao, B., & Cao, G. (2009). Multicasting in delay tolerant networks: A social network perspective. In Proceedings of the tenth ACM international symposium on mobile ad hoc networking and computing (pp. 299–308). https://doi.org/10.1145/1530748.1530790.
- 36.Keranen, A., Ott, J., & Karkkainen, T. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques. https://doi.org/10.4108/icst.simutools2009.5674.