Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Khabbaz, M. J., Assi, C. M., & Fawaz, W. F. (2012). Disruption-tolerant networking: A comprehensive survey on recent developments and persisting challenges. IEEE Communications Surveys & Tutorials, 14(2), 607–640. CrossRef
Al-Fagih, A. E., & Hassanein, H. S. (2012) Routing schemes for delaytolerant networks—an applications perspective: Technical report 588, pp. 1–40.
Jones, E. P. C., Li, L., Schmidtke, J. K., & Ward, P. A. S. (2007). Practical routing in delay-tolerant networks. IEEE Transactions on Mobile Computing, 6(8), 943–959. CrossRef
Zhang, Z. (2006). Routing in intermittently connected mobile adhoc networks and delay-tolerant networks: Overview and challenges. IEEE Communications Surveys & Tutorials, 8(1), 24–37. CrossRef
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)
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).
Silva, D. R., Costa, A., & Macedo, J. (2012). Energy impact analysis on DTN routing protocols. ACM ExtremeCom Switzerland March 10–14, pp. 1–6.
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).
Lobiyal, D. K., & Savita, (2015). Location information in inter-contact based routing approach in delay tolerant network. Procedia Computer Science, 57(2015), 1367–1375.
Altman, E., Azad, A. P., Başar, T., & Pellegrini, F. D. (2013). Combined optimal control of activation and transmission in delay-tolerant networks. IEEE/ACM Transactions on Networking, 21(2), 482–494. CrossRef
Yang, S., Yeo, C. K., & Lee, F. B. S. (2013). Cooperative duty cycling for energy-efficient contact discovery in pocket switched networks. IEEE Transactions on Vehicular Technology, 62(4), 1815–1826. CrossRef
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.
Vahdat, A, & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Duke Univ., Duhram, NC, Tech. Rep. CS-2000-06
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.
Lindgren, A., Doria, A., & Schelen, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20. CrossRef
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
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).
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).
Uddin, M. Y. S., Ahmadi, H., & Abdelzaher, T. (2013). Intercontact routing for energy constrained disaster response networks. IEEE Transactions on Mobile Computing, 12(10), 1986–1998. CrossRef
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).
Hui, P., Crowcroft, J., & Yonek, E. (2011). Bubble rap: Social based forwarding in delay tolerant networks. IEEE Transactions on Mobile Computing, 11(11), 1576–1589. CrossRef
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).
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).
Mei, A., & Stefa, J. (2012). Give2get: Forwarding in social mobile wireless networks of selfish individuals. IEEE Transactions on Dependable and Secure Computing, 9(4), 569–582. CrossRef
Costa, P., Mascolo, C., Musolesi, M., & Picco, G. P. (2008). Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 26(5), 748–760. CrossRef
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).
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).
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.
Ross, S. M. (1996). Stochastic processes. New York: Wiley. MATH
Ko, Y. B., & Vaidya, N. H. (2000). Location-Aided Routing (LAR) in mobile ad hoc networks. Wireless Networks, 6(2000), 307–321. CrossRef
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.
- Location Based Contact Time Energy Efficient Routing (LCTEE) Approach for Delay Tolerant Networks
Daya Krishan Lobiyal
- Springer US