Implementation of Reliable Routing in Wireless networks
Keywords:
Epidemic Routing, Routing Opportunistic networks, Probabilistic Routing.Abstract
Opportunistic networks are one of the most increasing evolutions of MANETs. In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a source and a destination. In opportunistic networks, path connecting to the mobile nodes never exits, mobile nodes transmit messages with each other when they get opportunity to transmit. Furthermore, nodes are not supposed to possess or acquire any information about the network topology. Routes are built dynamically, while messages are route between the source and the destination, and any possible node can opportunistically be used as next intermediate node, only if it is likely to bring the message nearer to the final destination. These features make opportunistic networks a challenging and promising field of research. In this paper we describe approach for routing in opportunistic networks, rendering old traditional routing protocols unable to deliver messages between hosts. Thus, there is a need for a new technique to route through such networks. We propose composite approach which combines concepts of Epidemic Routing and Probabilistic Routing techniques together with acknowledgement approach for better delivery. Our results show that composite routing protocol is able to provide better message delivery probability and less message delay.
References
[1] Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7(3):19–20, 2003.
[2] Amin Vahdat and David Becker. “Epidemic routing for partially connected ad hoc networks”. Technical Report CS-200006, Duke University, April 2000.
[3] Ting-Kai Huang, Chia-Keng Lee, Ling-Jyh Chen “PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Network”. IEEE Proceedings,2011.
[4] Werner Vogels, Robbert van Renesse, and Ken Birman. “The power of epidemics: robust communication for large-scale distributed systems”. in proceedings of first workshop on hot topics in networks (HotNets-I),28-29 October 2002, Princeton, New Jersey, USA, oct 2002.
[5] Allan Beaufour, Martin Leopold, and Philippe Bonnet. “Smart-tag based data dissemination”. in First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA02), June 2002.
[6] Natalie Glance, Dave Snowdon, and Jean-Luc Meunier. “Pollen: using people as a communication medium”, Computer Networks, vol. 35, no. 4,pp. 429–442, March 2001.
[7] Xiangchuan Chen and Amy L. Murphy. “Enabling disconnected transitive communication in mobile ad hoc networks”. in Proc. of Workshop on Principles of Mobile Computing, collocated with PODC’01, Newport, RI (USA), aug 2001, pp. 21–27.
[8] Chien-Chung Shen, Girish Borkar, Sundaram Rajagopalan, and C haiporn Jaikaeo. “Interrogation-based relay routing for ad hoc satellite networks”. in Proceedings of IEEE Globecom 2002, Taipei, Taiwan, November 17-21,2002.
[9] Qun Li and Daniela Rus. “Communication in disconnected ad-hoc networks using message relay”. Journal of Parallel and Distributed Computing, 2003.
[10] Matthias Grossglauser and David Tse. “Mobility increases the capacity of ad-hoc wireless networks”. IEEE/ACM Transactions on Networking, vol. 10, no. 4, Aug 2002.
[11] Ram Ramanathan, Richard Hansen, Prithwish Basu. “Prioritized epidemic routing for opportunistic networks”. MobiOpp’07, June 11, 2007, San Juan, Puerto Rico, USA. Copyright 2007 ACM 978-1-59593-688-2/07/0006.
[12] Anders Lindgren, Avri Doria, and Olov Schel´en. “Poster: Probabilistic routing in intermittently connected networks”. in Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), June 2003.
[13] Chung-Ming Huang, Kun-chan Lan and Chang-Zhou Tsai. “A Survey of opportunistic networks”. 22nd International Conference on Advanced Information Networking and Applications, Workshops, 978-0-7695-3096-3/08 IEEE DOI 10.1109/WAINA.2008.292.
[14] Elizabeth M. Royer and Chai-Keong Toh. “A Review of current routing protocols for ad hoc mobile wireless networks”. IEEE Personal Communications Magazine, vol. 6, no. 2, pp. 46–55, Apr. 1999.
[15] Leszek Lilien, Zille Huma Kamal, Vijay Bhuse, and Ajay Gupta. “Opportunistic networks: The concept and research challenges in privacy and security”.
[16] P. Marshall. The disruption tolerant networking program, 2005. http://www.darpa.mil /sto/ solicitations/DTN/briefs.htm.
[17] S. Burleigh et al. “Delay-tolerant networking: An approach to interplanetary internet”. IEEE , Communications Magazine, June, 2003.
[18] A. Pentland, R. Fletcher, and A. Hasson. “Daknet: Rethinking connectivity in developing nations”. IEEE Computer 37(1), 78-83, Jan 2004.
[19] P. Jacquet T. Clausen. “Optimized link state routing protocol (olsr)”. October 2003. Internet RFC 3626.
[20] E.W. Dijkstra. “A note on two problems in connection with graphs”. Numer. Math. 1:269, 271, 1959.
[21] Douglas B. Terry, Marvin M. Theimer, Karin Petersen, Alan J. Demers, Mike J. Spreitzer, and Carl H. Hauser. “Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System”. In Proceedings of the fifteenth ACM symposium on Operating systems principles, pages 172–183, December 1995.
[22] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. “Maxprop: Routing for vehicle-based disruption-tolerant networks”. In Proc. IEEE INFOCOM, pages 1–11, 2006.
[23] J. LeBrun, Chen-Nee Chuah, D. Ghosal, and M. Zhang. “Knowledge based opportunistic forwarding in vehicular wireless ad hoc networks”. In Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st, volume 4, pages 2289–2293 Vol. 4, May-1 June 2005.
[24] J. Leguay, T. Friedman, and V. Conan. “Evaluating mobility pattern space routing for dtns”. In INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pages 1–10,Barcelona, Spain, April 2006.
[25] Daddy Marasigan and Papa Rommel. “Mv routing and capacity building in disruption tolerant networks”. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies.Proceedings IEEE, volume 1, pages 398–408 vol. 1, March 2005.
[26] M. Musolesi, S. Hailes, and C. Mascolo. “Adaptive routing for intermittently connected mobile ad hoc networks”. In World of Wireless Mobile and Multimedia Networks, 2005. WoWMoM 2005. Sixth IEEE International Symposium on a, pages 183–189, June 2005.
[27] T. Spyropoulos, K. Psounis, and C. S. Raghavendra. “Single-copy routing in intermittently connected mobile networks”. In Sensor and Ad HocCommunications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on, pages 235–244,2004.
[28] Yong Wang, Sushant Jain, Margaret Martonosi, and Kevin Fall. “Erasure coding based routing for opportunistic networks”. In WDTN ’05:Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pages 229–236, New York, NY, USA, August 2005. ACM.
[29] J’org Widmer and Jean-Yves Le Boudec. “Network coding for efficient communication in extreme networks”. In WDTN ’05: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pages 284–291, New York, NY, USA, 2005. ACM.
[30] Chien-Shiu Lin, Wei-Shyh Chang, Ling-Jyh Chen, and Cheng-Fu Chou. “Performance study of routing schemes in delay tolerant networks”. In AINAW ’08: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops, pages 1702–1707, Washington, DC, USA, 2008. IEEE Computer Society.
Downloads
Published
Issue
Section
Categories
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Under this license, authors retain ownership of the copyright for their articles. By submitting to the International Journal of Advanced Research in Science, Management, and Technology (IJARSMT), authors grant the journal the right of first publication. Users are free to share, copy, and redistribute the material in any medium or format, and to adapt, remix, transform, and build upon the material for any purpose, including commercially, provided that appropriate credit is given to the original author(s) and the journal, a link to the license is provided, and any changes made are indicated.
