skip to main content
research-article

Bird Flight-Inspired Routing Protocol for Mobile Ad Hoc Networks

Published:01 October 2011Publication History
Skip Abstract Section

Abstract

One of the major challenges in the research of mobile ad hoc networks is designing dynamic, scalable, and low cost (in terms of utilization of resources) routing protocols usable in real-world applications. Routing in ad hoc networks has been explored to a large extent over the past decade and different protocols have been proposed. They are based on a two-dimensional view of the ad hoc network geographical region, and are not always realistic. In this article, we propose a bird flight-inspired, highly scalable, dynamic, energy-efficient, and position-based routing protocol called Bird Flight-Inspired Routing Protocol (BFIRP). The proposed protocol is inspired by the navigation of birds over long distances following the great circle arc, the shortest arc connecting two points on the surface of a sphere. This sheds light on how birds save their energy while navigating over thousands of miles. The proposed algorithm can be readily applied in many real-world applications, as it is designed with a realistic three-dimensional view of the network’s geographic region. In the proposed algorithm, each node obtains its location coordinates (X, Y, Z), and speed from the GPS (Global Positioning System); whereas, the destination’s location coordinates (X, Y, Z), and speed are obtained from any other distributed localized service. Based on the location information, the source and each intermediate node choose their immediate neighbor as the next hop that has the maximum priority. The priority is calculated by taking into consideration the energy of the node, the distance between the node and the destination and the degree of closeness of the node to the trajectory of the great circle arc between the current node and the destination. The proposed algorithm is simulated in J-SIM and compared with the algorithms of Ad Hoc On Demand Distance Vector (AODV), and Most Forward Within Distance R (MFR) routing protocols. The results of the simulations show that the proposed BFIRP algorithm is highly scalable, and has low end-to-end delay compared to AODV. The algorithm is also simulated in various scenarios, and the results demonstrate that BFIRP is more efficient than AODV in energy and throughput by 20% and 15% respectively. It also shows satisfactory improvement over MFR in terms of throughput and routing overhead.

References

  1. <scp>Alerstam, T.</scp> 1993. Bird Migration. Cambridge University Press.Google ScholarGoogle Scholar
  2. <scp>Basagni, S., Chlamtac, I., Syrotiuk, V. R., and Woodward, B. A.</scp> 1998. A distance routing effect algorithm for mobility (DREAM). In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking. 76--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. <scp>Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J.</scp> 1999. Routing with guaranteed delivery in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. 48--55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. <scp>Brown, T. and Mohan, S.</scp> 1997. Mobility management for personal communication systems. IEEE Trans. Veh. Technol. 46, 2, 269--278.Google ScholarGoogle ScholarCross RefCross Ref
  5. <scp>Camara, D. and Loureiro, A. A. F.</scp> 2000. GPS/ant-like routing in ad hoc networks. In Proceedings of the Wireless Communications and Networking Conference. 1232--1236.Google ScholarGoogle Scholar
  6. <scp>Cao, Y. and Xie, S.</scp> 2003. A position based beaconless routing algorithm for mobile ad hoc networks. In Proceedings of the IEEE International Conference on Communications, Circuits and Systems. 303--307.Google ScholarGoogle Scholar
  7. <scp>Carvalho, M. M., Margi, C. B., Obraczka, K., and Garcia-Luna-Aceves, J. J.</scp> 2004. Modeling energy consumption in single-hop IEEE 802.11 ad hoc networks. In Proceedings of the International Conference on Computer Communications and Networks (ICCCN). 367--372.Google ScholarGoogle ScholarCross RefCross Ref
  8. <scp>Chang, J.-H. and Tassiulas, L.</scp> 2000. Energy conserving routing in wireless ad-hoc networks. In Proceedings of the Conference on Computer Communications. 22--31.Google ScholarGoogle Scholar
  9. <scp>Chen, C.-L. and Hsu, T.-P.</scp> 2004. A novel approach to great circle sailings: The great circle equation. J. Navigation. 57, 311--325.Google ScholarGoogle ScholarCross RefCross Ref
  10. <scp>Clausen, T. and Jacquet, P.</scp> 2003. Optimized link state routing protocol (OLSR). RFC Editor.Google ScholarGoogle Scholar
  11. <scp>Day, K., Arafeh, B., Touzene, A., and Al-Kindi, A.</scp> 2008. A 3D grid position-based routing protocol for mobile ad hoc networks. In Proceedings of the International Conference on Computer and Communication Engineering. 151--156.Google ScholarGoogle Scholar
  12. <scp>Ebert, J., Aier, S., Kofahl, G., Becker, A., Burns, B., and Wolisz, A.</scp> 2002. Measurement and simulation of the energy consumption of a WLAN interface. Tech. rep. TKN-02-010, Telecommunication Networks Group, Technical University Berlin.Google ScholarGoogle Scholar
  13. <scp>Floyd, S. and Jacobson, V.</scp> 1994. The synchronization of periodic routing messages. IEEE/ACM Trans. Netw. 2, 122--136. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. <scp>Haas, Z. J., Perlman, M. R., and Samar, P.</scp> 2002. The zone routing protocol (ZRP) for ad hoc networks. http://www.ietf.org/proceedings/02nov/I-D/draft-ietf-manet-zone-zrp-04.txt.Google ScholarGoogle Scholar
  15. <scp>Heissenbttel, M., Braun, T., Bernoulli, T., and Waelchli, M.</scp> 2004. BLR: Beacon-less routing algorithm for mobile ad hoc networks. Elsevier Comput. Comm. J. 27, 11, 1076--1086. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. <scp>Heissenbüttel, M. and Braun, T.</scp> 2005. Optimizing neighbor table accuracy of position-based routing algorithms. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM).Google ScholarGoogle Scholar
  17. <scp>Jain, R., Puri, A., and Sengupta, R.</scp> 2001. Geographical routing using partial information for wireless ad hoc networks. IEEE Pers. Commun. 8, 1, 16--28.Google ScholarGoogle ScholarCross RefCross Ref
  18. <scp>Johnson, D. B. and Maltz, D. A.</scp> 1996. Dynamic source routing in ad hoc wireless networks. In Mobile Computing. T. Imielinski, H. Korth Eds., Kluwer Academic Publishers, 153--181.Google ScholarGoogle Scholar
  19. <scp>Karp, B. and Kung, H. T.</scp> 2000. GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. 243--254. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. <scp>Ko, Y.-B. and Vaidya, N. H.</scp> 2000. Location-aided routing in mobile ad hoc networks. Wirel. Netw. 6, 4, 307--321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. <scp>Kuhn, F., Wattenhofer, R., and Zollinger, A.</scp> 2003. Worst-case optimal and average-case efficient geometric mobile ad hoc routing. In Proceedings of 4th International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc). 267--278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. <scp>Li, J., Jannotti, J., De Couto, D. S. J., Karger, D. R., and Morris, R.</scp> 2000. A scalable location service for geographic ad hoc routing. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking. 120--130. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. <scp>Liao, W.-H., Sheu, J.-P., and Tseng, Y.-C.</scp> 2001. GRID: A fully location-aware routing protocol for mobile ad hoc networks. Telecomm. Syst. J. 18, 37--60.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. <scp>Lin, X. and Stojmenovic, I.</scp> 1998. Geographic distance routing in ad hoc wireless networks. Tech. rep., SITE, University of Ottawa.Google ScholarGoogle Scholar
  25. <scp>Mauve, M., Widmer, J., and Hattenstein, H.</scp> 2001. A survey on position-based routing in mobile ad-hoc networks. IEEE Network 15, 6, 30--39. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. <scp>Murthy, S. and Garcia-Luna-Aceves, J. J.</scp> 1996. An efficient routing protocol for wireless networks. Mob. Netw. Appl. 1, 2, 183--197. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. <scp>Na, J. and Kim, C.-K.</scp> 2006. A novel geographic routing scheme for large wireless ad hoc networks. Comp. Netw., Int. J. Comput. Telecomm. Netw. 50, 17, 3434--3448. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. <scp>Nayak, A., Stojmenovic, I., and Kuruvila, J.</scp> 2005. Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer. IEEE Comm. Mag. 46, 2, 101--106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. <scp>Niculescu, D. and Nath, B.</scp> 2003. Trajectory based forwarding and its applications. In Proceedings of the 9th Annual International Conference on Mobile Computing and Networking. ACM Press, 260--272. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. <scp>Park, V. D. and Corson, M. S.</scp> 1997. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM). 7--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. <scp>Park, V. and Corson, S.</scp> 2001. Temporally-ordered routing algorithm (TORA). Functional Specification, IETF draft.Google ScholarGoogle Scholar
  32. <scp>Pei, G., Gerla, M., and Chen, T.-W.</scp> 2000. Fisheye state routing: A routing scheme for ad hoc wireless networks. In Proceedings of the IEEE International Conference on Communications (ICC). 70--74.Google ScholarGoogle Scholar
  33. <scp>Perkins, C. E. and Bhagwat, P.</scp> 1994. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. ACM SIGCOMM Comput. Comm. Rev. 24, 4, 234--244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. <scp>Perkins, C. E. and Royer, E. M.</scp> 1999. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computer Systems and Applications. IEEE Computer Society, 90--100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. <scp>Qabajeh, L. K., Kiah, L. M., and Qabajeh, M. M.</scp> 2009. A qualitative comparison of position-based routing protocols for ad hoc networks. IJCSNS Int. J. Comput. Sci. Netw. Secur. 9, 2, 131--140.Google ScholarGoogle Scholar
  36. <scp>Qiu, J.</scp> 2005. Ornithology: Flight of the navigators. Nature Int. Weekly J. Sci. 437, 804--806.Google ScholarGoogle Scholar
  37. <scp>Stojmenovic, I.</scp> 2002. Position-based routing in ad hoc networks. IEEE Comm. Mag. 40, 7, 128--134. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. <scp>Takagi, H. and Kleinrock, L.</scp> 1984. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Comm. 32, 3, 246--257.Google ScholarGoogle ScholarCross RefCross Ref
  39. <scp>Toh, C. K.</scp> 1997. Associativity-based routing for ad-hoc mobile networks. Wirel. Pers. Comm. 4, 2, 103--139. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. <scp>Uçan, F. and Altilar, D. T.</scp> 2008, Navigation and guidance planning for air vehicles. In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence. 534--538. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. <scp>Xu, Y., Lee, W.-C., Xu, J., and Mitchell, G.</scp> 2005. PSGR: Priority-based stateless geo-routing in highly dynamic sensor networks. In Proceedings of the IEEE International Conference on Mobile Ad hoc and Sensor Systems Conference. 673--680.Google ScholarGoogle Scholar

Index Terms

  1. Bird Flight-Inspired Routing Protocol for Mobile Ad Hoc Networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!