BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior

ABSTRACT

In this paper we present BeeAdHoc, a new routing algorithm for energy efficient routing in mobile ad hoc networks. The algorithm is inspired by the foraging principles of honey bees. The algorithm mainly utilizes two types of agents, scouts and foragers, for doing routing in mobile ad hoc networks. BeeAdHoc is a reactive source routing algorithm and it consumes less energy as compared to existing state-of-the-art routing algorithms because it utilizes less control packets to do routing. The results of our extensive simulation experiments show that BeeAdHoc consumes significantly less energy as compared to DSR, AODV, and DSDV, which are state-of-the-art routing algorithms, without making any compromise on traditional performance metrics (packet delivery ratio, delay and throughput).

REFERENCES

• 1: Josh Broch , David A. Maltz , David B. Johnson , Yih-Chun Hu , Jorjeta Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.85-97, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288256]
• 2: G. Di Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communication networks. Journal of Artificial Intelligence, 9:317--365, December 1998.
• 3: Gianni Di Caro, Frederick Ducatelle, and Luca~Maria Gambardella. AntHocNet: an ant-based hybrid routing algorithm for mobile ad hoc networks. In Proceedings of Parallel Problem Solving from Nature (PPSN) VIII, LNCS 3242. Springer-Verlag, 2004.
• 4: Laura Marie Feeney, An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks, Mobile Networks and Applications, v.6 n.3, p.239-249, June 2001 [doi>10.1023/A:1011474616255]
• 5: Laura Marie Feeney and Martin Nilsson. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In Proceedings of IEEE INFOCOM, 2001.
• 6: Imed Bouazizi, ARA - The Ant-Colony Based Routing Algorithm for MANETs, Proceedings of the 2002 International Conference on Parallel Processing Workshops, p.79, August 18-21, 2002 [doi>10.1109/ICPPW.2002.1039715]
• 7: David B Johnson and David A Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, pages 153--181. Kluwer Academic Publishers, 1996.
• 8: Christine E. Jones , Krishna M. Sivalingam , Prathima Agrawal , Jyh Cheng Chen, A Survey of Energy Efficient Network Protocols for Wireless Networks, Wireless Networks, v.7 n.4, p.343-358, 08/01/2001 [doi>10.1023/A:1016627727877]
• 9: Charles E. Perkins , Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p.90, February 25-26, 1999
• 10: Charles E. Perkins , Pravin Bhagwat, Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers, Proceedings of the conference on Communications architectures, protocols and applications, p.234-244, August 31-September 02, 1994, London, United Kingdom
• 11: Larry L. Peterson , Bruce S. Davie, Computer networks: a systems approach, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2000
• 12: Martin Roth and Stephen Wicker. Termite: Emergent ad-hoc networking. In Proceedings of the Second Mediterranean Workshop on Ad-Hoc Networks, 2003.
• 13: E. Royer and C. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, 1999.
• 14: Ruud Schoonderwoerd , Janet L. Bruten , Owen E. Holland , Leon J. M. Rothkrantz, Ant-based load balancing in telecommunications networks, Adaptive Behavior, v.5 n.2, p.169-207, Fall 1996 [doi>10.1177/105971239700500203]
• 15: T.D. Seeley. The Wisdom of the Hive. Harvard University Press, London, 1995.
• 16: Suresh Singh , Mike Woo , C. S. Raghavendra, Power-aware routing in mobile ad hoc networks, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.181-190, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288286]
• 17: K. von Frisch. The Dance Language and Orientation of Bees. Harvard University Press, Cambridge, 1967.
• 18: H.F. Wedde, M. Farooq, and Y. Zhang. Beehive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior. In Proceedings of ANTS Workshop, LNCS 3172, pages 83--94. Springer Verlag, Sept 2004.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Distributed networks

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication
      C.2.2 Network Protocols
          Subjects: Routing protocols; Protocol architecture (OSI model)

General Terms:
Algorithms, Design, Theory

Keywords:
energy efficient routing, mobile ad hoc networks, self-organization, swarm intelligence