Skip to main content
SpringerLink
Log in
Book cover

Swarm Intelligence pp 101–160Cite as

Routing Protocols for Next-Generation Networks Inspired by Collective Behaviors of Insect Societies: An Overview

  • Chapter

Part of the book series: Natural Computing Series ((NCS))

Summary

In this chapter we discuss the properties and review the main instances of network routing algorithms whose bottom-up design has been inspired by collective behaviors of social insects such as ants and bees. This class of bio-inspired routing algorithms includes a relatively large number of algorithms mostly developed during the last ten years. The characteristics inherited by the biological systems of inspiration almost naturally empower these algorithms with characteristics such as autonomy, self-organization, adaptivity, robustness, and scalability, which are all desirable if not necessary properties to deal with the challenges of current and next-generation networks. In the chapter we consider different classes of wired and wireless networks, and for each class we briefly discuss the characteristics of the main ant- and bee-colony-inspired algorithms which can be found in literature. We point out their distinctive features and discuss their general pros and cons in relationship to the state of the art.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Appleby and S. Steward. Mobile software agents for control in telecommunications networks. BT Technology Journal, 18(1):68–70, 2000.

    Article  Google Scholar 

  2. O. Babaoglu, G. Canright, A. Deutsch, G.A. Di Caro, F. Ducatelle, L. M. Gambardella, N. Ganguly, M. Jelasity, R. Montemanni, A. Montresor, and T. Urnes. Design patterns from biology for distributed computing. ACM Transactions on Autonomous and Adaptive Systems, 1(1):26–66, 2006.

    Google Scholar 

  3. B. Baran and R. Sosa. A new approach for AntNet routing. In Proceedings of ICCCN, pages 303–308, Las Vegas, NV, USA, 2000. IEEE Press.

    Google Scholar 

  4. J. S. Baras and H. Mehta. A probabilistic emergent routing algorithm (PERA) for mobile ad hoc networks. In Proceedings of WiOpt, 2003.

    Google Scholar 

  5. D. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, USA, 1995.

    MATH  Google Scholar 

  6. D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, Englewood Cliffs, NJ, USA, 1992.

    MATH  Google Scholar 

  7. E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, Inc., New York, NY, USA, 1999.

    MATH  Google Scholar 

  8. E. Bonabeau, F. Henaux, S. Guérin, D. Snyers, P. Kuntz, and G. Theraulaz. Routing in telecommunications networks with ant-like agents. In Proceedings of IATA, pages 60–71, London, UK, 1998. Springer-Verlag.

    Google Scholar 

  9. J.A. Boyan and M.L. Littman. Packet routing in dinamically changing networks: A reinforcement learning approach. In J.D. Cowan, G. Tesauro, and J. Alspector, editors, Proceedings of NIPS6, pages 671–678. Morgan Kaufmann, San Francisco, CA, USA, 1994.

    Google Scholar 

  10. R. W. Brazier and M. D. Cookson. Intelligence design patterns. BT Technology Journal, 23(1):69–81, 2005.

    Article  Google Scholar 

  11. J. Broch, D. A. Maltz, D.B. Johnson, Y.C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of MobiCom, pages 85–97, New York, NY, USA, 1998. ACM Press.

    Google Scholar 

  12. R. BrÜntrup. Quality of service in von der natur inspirierten routing-algorithmen (in German). Master thesis, LSIII, University of Dortmund, Germany, August 2006.

    Google Scholar 

  13. D. Câmara and A. F. Loureiro. A novel routing algorithm for ad hoc networks. In Proceedings of HICSS. IEEE Press, 2000.

    Google Scholar 

  14. D. Câmara and A. F. Loureiro. GPS/Ant-like routing in ad hoc networks. Telecommunication Systems, 18(1–3):85–100, 2001.

    Article  MATH  Google Scholar 

  15. T. Camilo, C. Carreto, J. Sá Silva, and F. Boavida. An energy-efficient ant-based routing algorithm for wireless sensor networks. In Proceedings ANTS, volume 4150 of Lecture Notes in Computer Science, pages 49–59, Brussels, Belgium, 2006. Springer.

    Google Scholar 

  16. L. Carrillo, C. Guadal, J.-L. Marzo, G.A. Di Caro, F. Ducatelle, and L.M. Gambardella. Differentiated quality of service scheme based on the use of multiple classes of ant-like mobile agents. In Proceedings of CoNEXT, pages 234–235, Toulouse, France, October 24–27 2005. ACM Press.

    Google Scholar 

  17. L. Carrillo, J. L. Marzo, L. Fàbrega, P. Vilà, and C. Guadall. Ant colony behaviour as routing mechanism to provide quality of service. In Proceedings of ANTS, volume 3172 of Lecture Notes in Computer Science, pages 418–419, Berlin, 2004. Springer.

    Google Scholar 

  18. S. Chen and K. Nahrstedt. An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions. IEEE Network Magazine, Special issue on Transmission and Distribution of Digital Video, 12(6):64–79, 1998.

    Google Scholar 

  19. S. P. Choi and D.-Y. Yeung. Predictive Q-routing: A memory-based reinforcement learning approach to adaptive traffic control. In Proceedings of NIPS8, pages 945–951. MIT Press, 1996.

    Google Scholar 

  20. Cisco. Internetworking Technology Handbook, 2002.

    Google Scholar 

  21. T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot. Optimized link state routing protocol. In Proceedings of IEEE INMIC, pages 62– 68. IEEE Press, 2001.

    Google Scholar 

  22. M. E. Csete and J.C. Doyle. Reverse engineering of biological complexity. Science, 295(5560):1664–1669, March 2002.

    Google Scholar 

  23. S. S. Dhillon and P. Van Mieghem. Performance analysis of the AntNet algorithm. Computer Networks, 51(8):2104–2125, 2007.

    Article  MATH  Google Scholar 

  24. G. A. Di Caro. Ant Colony Optimization and its application to adaptive routing in telecommunication networks. PhD thesis, Faculté des Sciences Appliquées, Université Libre de Bruxelles, Brussels, Belgium, November 2004.

    Google Scholar 

  25. G. A. Di Caro and M. Dorigo. Adaptive learning of routing tables in communication networks. In Proceedings of the Italian Workshop on Machine Learning (IWML), 1997.

    Google Scholar 

  26. G. A. Di Caro and M. Dorigo. AntNet: A mobile agents approach to adaptive routing. Technical Report 97–12, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium, June 1997.

    Google Scholar 

  27. G. A. Di Caro and M. Dorigo. Ant colonies for adaptive routing in packet-switched communications networks. Technical Report 97-20.1, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium, March 1997.

    Google Scholar 

  28. G. A. Di Caro and M. Dorigo. Mobile agents for adaptive routing. In Proceedings of HICSS, volume 7, pages 74–83. IEEE Computer Society Press, 1998.

    Google Scholar 

  29. G. A. Di Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research (JAIR), 9:317–365, 1998.

    MATH  Google Scholar 

  30. G. A. Di Caro and M. Dorigo. Ant colonies for adaptive routing in packet-switched communications networks. In Proceedings of PPSN-V, volume 1498 of LNCS, pages 673–682. Springer, 1998.

    Google Scholar 

  31. G. A. Di Caro and M. Dorigo. Extending AntNet for best-effort Quality-of-Service routing. Proceedings of the First International Workshop on Ant Colony Optimization (ANTS’98), 1998.

    Google Scholar 

  32. G. A. Di Caro and M. Dorigo. Two ant colony algorithms for best-effort routing in datagram networks. In Proceedings of the 11th International Conference on Parallel and Distributed Computing Systems (PDCS), pages 541–546, 1998.

    Google Scholar 

  33. G. A. Di Caro, F. Ducatelle, and L. M. Gambardella. AntHocNet: an ant-based hybrid routing algorithm for mobile ad hoc networks. In Proceedings of PPSN-VIII, volume 3242 of LNCS, pages 461–470. Springer, 2004.

    Google Scholar 

  34. G. A. Di Caro, F. Ducatelle, and L. M. Gambardella. AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. European Transactions on Telecommunications, 16(5):443–455, 2005.

    Article  Google Scholar 

  35. G. A. Di Caro, F. Ducatelle, and L. M. Gambardella. Swarm intelligence for routing in mobile ad hoc networks. In Proceedings of the IEEE Swarm Intelligence Symposium, pages 76–83, Pasadena, USA, June 2005. IEEE Press.

    Google Scholar 

  36. G. A. Di Caro, F. Ducatelle, and L. M. Gambardella. Studies of routing performance in a city-like testbed for mobile ad hoc networks. Technical Report 07-06, IDSIA, Lugano, Switzerland, March 2006.

    Google Scholar 

  37. G. A. Di Caro, F. Ducatelle, and L. M. Gambardella. Swarm intelligence for routing in telecommunications networks. Journal of Swarm Intelligence, 2007. Submitted.

    Google Scholar 

  38. G. A. Di Caro, F. Ducatelle, and L. M. Gambardella. Theory and practice of Ant Colony Optimization for routing in dynamic telecommunications networks. In N. Sala and F. Orsucci, editors, Reflecting interfaces: the complex coevolution of information technology ecosystems. Idea Group, Hershey, PA, USA, 2007.

    Google Scholar 

  39. G. A. Di Caro and T. Vasilakos. Ant-SELA: Ant-agents and stochastic automata learn adaptive routing tables for QoS routing in ATM networks. In Proceedings of 2nd International Workshop on Ant Colony Optimization (ANTS’00), 2000.

    Google Scholar 

  40. S. Doi and M. Yamamura. BntNetL: Evaluation of its performance under congestion. Journal of IEICE B (in Japanese), pages 1702–1711, 2000.

    Google Scholar 

  41. S. Doi and M. Yamamura. BntNetL and its evaluation on a situation of congestion. Electronics and Communications in Japan (Part I), 85(9):31–41, 2002.

    Article  Google Scholar 

  42. S. Doi and M. Yamamura. An experimental analysis of loop-free algorithms for scale-free networks. In Proceedings of ANTS, volume 3172 of Lecture Notes in Computer Science, pages 278–285. Springer-Verlag, 2004.

    Google Scholar 

  43. M. Dorigo, E. Bonabeau, and G. Theraulaz. Ant algorithms and stigmergy. Future Generation Computer Systems, 16(8):851–871, 2000.

    Article  Google Scholar 

  44. M. Dorigo and G. A. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11–32. McGraw-Hill, 1999.

    Google Scholar 

  45. M. Dorigo, G. A. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5(2):137–172, 1999.

    Article  Google Scholar 

  46. M. Dorigo and E. Sahin (Editors). Special issue on Swarm Robotics. Autonomous Robots, 17(2–3), 2004.

    Google Scholar 

  47. M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics—Part B, 26(1):29–41, 1996.

    Article  Google Scholar 

  48. M. Dorigo and T. StÜtzle. Ant Colony Optimization. MIT Press, Cambridge, MA, 2004.

    MATH  Google Scholar 

  49. F. Ducatelle, G. A. Di Caro, and L. M. Gambardella. An analysis of the different components of the AntHocNet routing algorithm. In Proceedings of the 5th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS’06), volume 4150 of LNCS, pages 37–48. Springer, 2006.

    Google Scholar 

  50. F. Ducatelle, G. A. Di Caro, and L. M. Gambardella. Ant agents for hybrid multipath routing in mobile ad hoc networks. In Proceedings of WONS, Switzerland, January 18–19, 2005. IEEE Press.

    Google Scholar 

  51. F. Ducatelle, G.A. Di Caro, and L. M. Gambardella. Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks. International Journal of Computational Intelligence and Applications, Special Issue on Nature-Inspired Approaches to Networks and Telecommunications, 5(2):169–184, 2005.

    MATH  Google Scholar 

  52. M. Farooq. Bee-inspired Protocol Engineering: From Nature to Networks. Natural Computing Series. Springer, (In Press).

    Google Scholar 

  53. L. M. Feeney. A taxonomy for routing protocols in mobile ad hoc networks. Technical Report ISRN:SICS-T-99/07-SE, Swedish Institute of Computer Science, Kista, Sweden, 1999.

    Google Scholar 

  54. S. Fenet and S. Hassas. An ant based system for dynamic multiple criteria balancing. Proceedings of the First International Workshop on Ant Colony Optimization (ANTS’98), 1998.

    Google Scholar 

  55. S. Fenet and S. Hassas. A.N.T.: a distributed network control framework based on mobile agents. In Proceedings of the International ICSC Congress on Intelligent Systems and Applications, 2000.

    Google Scholar 

  56. R. Freeman.\! Telecommunication System Engineering.\! John Wiley & Sons, 2004.

    Google Scholar 

  57. M. Gadomska and A. Pacut. Performance of ant routing algorithms when using TCP. In M. Giacobini et al., editors, Applications of Evolutionary Computing, EvoWorkshops 2007, volume 4448 of Lecture Notes in Computer Science, pages 1–10. Springer Verlag, 2007.

    Google Scholar 

  58. R. M. Garlick and R. S. Barr. Dynamic wavelength routing in WDM networks via Ant Colony Optimization. In M. Dorigo, G. A. Di Caro, and M. Sampels, editors, Proceedings of ANTS, volume 2463 of Lecture Notes in Computer Science, pages 250–255. Springer Verlag, 2002.

    Google Scholar 

  59. S. Goss, S. Aron, J. L. Deneubourg, and J. M. Pasteels. Self-organized shortcuts in the Argentine ant. Naturwissenschaften, 76:579–581, 1989.

    Article  Google Scholar 

  60. M. Günes, U. Sorges, and I. Bouazizi. ARA—The ant-colony based routing algorithm for MANETS. In Proceedings of the 2002 ICPP International Workshop on Ad Hoc Networks (IWAHN 2002), pages 79–85, 2002.

    Google Scholar 

  61. A. Harsch. Design and development of a network infrastructure for swarm routing protocols inside Linux. Master’s thesis, LSIII, University of Dortmund, Germany, July 2005.

    Google Scholar 

  62. P. Heegaard and I. Fuglem. AntPing: prototype demonstrator of swarm based path management and monitoring (Poster). In Proceedings of IWSOS, 2006.

    Google Scholar 

  63. P. Heegaard, O. Wittner, and B. Helvik. Self-management of virtual paths in dynamic networks. In O. Babaoglu, M. Jelasity, A. Montresor, C. Fetzer, S. Leonardi, A. van Moorsel, and M. van Steen, editors, Self-Star Properties in Complex Information Systems, volume 3460 of Lecture Notes in Computer Science, pages 417–432. Springer-Verlag, 2005.

    Google Scholar 

  64. M. HeissenbÜttel and T. Braun. Ants-based routing in large scale mobile ad-hoc networks. In 13. ITG/GI-Fachtagung Kommunikation in verteilten Systemen (KiVS 2003), pages 91–99, Leipzig, Germany, 2003.

    Google Scholar 

  65. M. Heusse, D. Snyers, S. Guérin, and P. Kuntz. Adaptive agent-driven routing and load balancing in communication networks. Advances in Complex Systems, 1(2):237–254, 1998.

    Article  Google Scholar 

  66. M. Heusse, D. Snyers, and Y. Kermarrec. Adaptive agent driven routing in communication networks: comparison with a classical approach. Advances in Complex Systems, 2(3):209–219, 1999.

    Article  Google Scholar 

  67. N. Hu and P. Steenkiste. Evaluation and characterization of available bandwidth probing techniques. IEEE Journal on Selected Areas in Communications, 21(6):879–894, 2003.

    Article  Google Scholar 

  68. D. E. Jackson and F. L. Ratnieks. Communication in ants. Current biology, 16(15):570–574, 2006.

    Article  Google Scholar 

  69. D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In T. Imielinski and H. F. Korth, editors, Mobile Computing, pages 153–181. Kluwer Academic Publishers, 1996.

    Google Scholar 

  70. I. Kassabalidis, M. A. El-Sharkawi, R. J. Marks, P. Arabshahi, and A. A. Gray. Swarm intelligence for routing in communication networks. In Proceedings of GLOBECOM, pages 3613–3617. IEEE Press, 2001.

    Google Scholar 

  71. I. Kassabalidis, M. A. El-Sharkawi, R. J. Marks II, P. Arabshahi, and A. A. Gray. Adaptive-SDR: Adaptive swarm-based distributed routing. In Proceedings of IJCNN, pages 351–354. IEEE Press, 2002.

    Google Scholar 

  72. J. Kephart and D. Chess. The vision of autonomic computing. IEEE Computer Magazine, 36(1):41–50, January 2003.

    Google Scholar 

  73. A. Khanna and J. Zinky. The revised ARPANET routing metric. ACM SIGCOMM Computer Communication Review, 19(4):45–56, 1989.

    Article  Google Scholar 

  74. Y.-B. Ko and N. H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. In Proceedings of MOBICOM, pages 66–75. ACM Press, 1998.

    Google Scholar 

  75. S.-J. Lee, E. M. Royer, and C. E. Perkins. Scalability study of the ad hoc on-demand distance vector routing protocol. ACM/Wiley International Journal of Network Management, 13(2):97–114, March 2003.

    Google Scholar 

  76. S. Liang, A. N. Zincir-Heywood, and M. I. Heywood. The effect of routing under local information using a social insect metaphor. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), May 2002.

    Google Scholar 

  77. S. Liang, A. N. Zincir-Heywood, and M. I. Heywood. Adding more intelligence to the network routing problem: AntNet and GA-agents. Applied Soft Computing, 6(3):244–257, 2006.

    Article  Google Scholar 

  78. S. Liang, A. N. Zincir-Heywood, and M. I. Heywood. Intelligent packets for dynamic network routing using distributed genetic algorithm. In Proceedings of GECCO, pages 88–96. ACM Press, 2002.

    Google Scholar 

  79. G. S. Malkin. RIP: An Intra-Domain Routing Protocol. Addison-Wesley, 1999.

    Google Scholar 

  80. S. Marwaha, C. K. Tham, and D. Srinavasan. Mobile Agents based routing protocol for mobile ad hoc networks. In Proceedings of GLOBECOM, pages 163–167, Taipei, Taiwan, November 2002. IEEE Press.

    Google Scholar 

  81. H. Matsuo and K. Mori. Accelerated ants routing in dynamic networks. In Proceedings of SNPD, pages 333–339, August 2001.

    Google Scholar 

  82. N. Mazhar and M. Farooq. BeeAIS: Artificial immune system security for nature inspired, MANET routing protocol, BeeAdHoc. In Proceedings of the 6th International Conference on Artificial Immune Systems, volume 4628 of LNCS, pages 370–381. Springer, 2007.

    Google Scholar 

  83. N. Mazhar and M. Farooq. Vulnerability analysis and security framework (BeeSec) for nature inspired MANET routing protocols. In Proceedings of GECCO, pages 102–109. ACM Press, 2007.

    Google Scholar 

  84. T. Michalareas and L. Sacks. Link-state and ant-like algorithm behaviour for single-constrained routing. In Proceedings of HPSR, pages 302–305. IEEE Press, May 2001.

    Google Scholar 

  85. T. Michalareas and L. Sacks. Stigmergic techniques for solving multi-constraint routing for packet networks. In Proceedings of the First International Conference on Networking (ICN), Part II, volume 2094 of Lecture Notes in Computer Science, pages 687–697. Springer-Verlag, 2001.

    Google Scholar 

  86. T. Michalareas and L. Sacks. Stigmergic techniques for solving multi-constraint routing for packet networks. In Proceedings of ICN, volume 2093 of Lecture Notes in Computer Science, pages 687—697. Springer Verlag, 2001.

    Google Scholar 

  87. J. Moy. OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, 1998.

    Google Scholar 

  88. R. Muraleedharan and L. A. Osadciw. A predictive sensor network using ant system. In R. M. Rao, S. A. Dianat, and M. D. Zoltowski, editors, Digital Wireless Communications VI, Proceedings of the SPIE, pages 181–192, 2004.

    Google Scholar 

  89. K. S. Narendra and M. A. Thathachar. Learning Automata: An Introduction. Prentice-Hall, 1989.

    Google Scholar 

  90. K. S. Narendra and M. A. Thathachar. On the behavior of a learning automaton in a changing environment with application to telephone traffic routing. IEEE Trans. on Systems, Man, and Cybernetics, SMC-10(5):262–269, 1980.

    Article  Google Scholar 

  91. G. Navarro-Varela and M. C. Sinclair. Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pages 1809–1816, 1999.

    Google Scholar 

  92. O. V. Nedzelnitsky and K. S. Narendra. Nonstationary models of learning automata routing in data communication networks. IEEE Transactions on Systems, Man, and Cybernetics, SMC-17:1004–1015, 1987.

    Google Scholar 

  93. The NS-2 network simulator. http://nsnam.isi.edu/nsnam/.

  94. K. Oida and A. Kataoka. Lock-free AntNet and its evaluation adaptiveness. Journal of IEICE B (in Japanese), J82-B(7):1309–1319, 1999.

    Google Scholar 

  95. K. Oida and M. Sekido. An agent-based routing system for QoS guarantees. In IEEE International Conference on Systems, Man, and Cybernetics, volume 3, pages 833–838, 1999.

    Google Scholar 

  96. K. Oida and M. Sekido. ARS: An efficient agent-based routing system for QoS guarantees. Computer Communications, 23:1437–1447, 2002.

    Article  Google Scholar 

  97. S. Okdem and D. Karaboga. Routing in wireless sensor networks using Ant Colony Optimization. In Proceedings of AHS, pages 401–404, 2006.

    Google Scholar 

  98. C. E. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of SIGCOMM, pages 234–244. ACM Press, 1994.

    Google Scholar 

  99. C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In Proceedings of WMCSA, pages 90–100. IEEE Press, 1999.

    Google Scholar 

  100. L. Peshkin, N. Meuleau, and L. P. Kaelbling. Learning policies with external memory. In Proceedings of ICML, pages 307–314, 1999.

    Google Scholar 

  101. Qualnet Simulator, Version 3.9. Scalable Network Technologies, Inc., Culver City, CA, USA, 2005. http://www.scalable-networks.com.

  102. S. Rajagopalan and C.-C. Shen. ANSI: A unicast routing protocol for mobile ad hoc networks using swarm intelligence. In Proceedings of the International Conference on Artificial Intelligence (ICAI), pages 24–27, 2005.

    Google Scholar 

  103. S. Rajagopalan and C.-C. Shen. ANSI: a swarm intelligence-based unicast routing protocol for hybrid ad hoc networks. Journal of System Architecture, 52(8-9):485–504, 2006.

    Article  Google Scholar 

  104. M. Roth and S. Wicker. Termite: Ad-hoc networking with stigmergy. In Proceedings of IEEE GLOBECOM, pages 2937–2941, 2003.

    Google Scholar 

  105. M. Roth and S. Wicker. Termite: Emergent ad-hoc networking. In Proceedings of the 2nd Mediterranean Workshop on Ad-Hoc Networks (Med-Hoc-Net), 2003.

    Google Scholar 

  106. E. M. Royer and C.-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 6(2):46–55, 1999.

    Article  Google Scholar 

  107. R. Y. Rubinstein. Combinatorial optimization, cross-entropy, ants and rare events. In S. Uryasev and P.M. Pardalos, editors, Stochastic Optimization: Algorithms and Applications, pages 304–358. Kluwer Academic Publisher, 2000.

    Google Scholar 

  108. M. Saleem and M. Farooq. Beesensor: A bee-inspired power aware routing protocol for wireless sensor networks. In M. Giacobini et al., editors, Lecture Notes in Computer Science, LNCS 4449, pages 81–90. Springer Verlag, 2007.

    Google Scholar 

  109. M. Saleem and M. Farooq. A framework for empirical evaluation of nature inspired routing protocols for wireless sensor networks. In Proceedings of Congress on Evolutionary Computing (CEC), pages 751–758. IEEE, 2007.

    Google Scholar 

  110. H. G. Sandalidis, C. X. Mavromoustakis, and P. P. Stavroulakis. Ant based probabilistic routing with pheromone and antipheromone mechanisms. Communication Systems, 17:55–62, 2004.

    Article  Google Scholar 

  111. H. G. Sandalidis, C. X. Mavromoustakis, and P.P. Stavroulakis. Performance measures of an ant based decentralised routing scheme for circuit switching communication networks. Soft Computing, 5(4):313–317, 2001.

    Article  MATH  Google Scholar 

  112. R. Schoonderwoerd and O. Holland. Minimal agents for communications network routing: The social insect paradigm. Software Agents for Future Communication Systems, 1(1):1–2, 1999.

    Google Scholar 

  113. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz. Ant-based load balancing in telecommunications networks. Adaptive Behavior, 5(2):169–207, 1996.

    Article  Google Scholar 

  114. T. Seeley. The Wisdom of the Hive. Harvard University Press, London, 1995.

    Google Scholar 

  115. A. U. Shankar, C. Alaettinogˇlu, I. Matta, and K. Dussa-Zieger. Performance comparison of routing protocols using MaRS: Distance-vector versus link-state. In Proceedings of ACM SIGMETRICS/PERFORMANCE, pages 181–192, 1992.

    Google Scholar 

  116. C.-C. Shen and C. Jaikaeo. Ad hoc multicast routing algorithm with swarm intelligence. MONET, 10(1-2):47–59, 2005.

    Google Scholar 

  117. C.-C. Shen, C. Jaikaeo, C. Srisathapornphat, Z. Huang, and S. Rajagopalan. Ad hoc networking with swarm intelligence. In M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle, editors, Proceedings of ANTS, volume 3172 of Lecture Notes in Computer Science, pages 262–269. Springer-Verlag, 2004.

    Google Scholar 

  118. C.-C. Shen, S. Rajagopalan, G. Borkar, and C. Jaikaeo. A flexible routing architecture for ad hoc space networks. Computer Networks, 46(3):389–410, 2004.

    Article  Google Scholar 

  119. E. Sigel, B. Denby, and S. Le Heárat-Mascle. Application of ant colony optimization to adaptive routing in a LEO telecommunications satellite network. Annals of Telecommunications, 57(5–6):520–539, May-June 2002.

    Google Scholar 

  120. K. M. Sim and W. H. Sun. Ant colony optimization for routing and load-balancing: Survey and new directions. IEEE Transactions on Systems, Man and Cybernetics-Part A, 33(5):560–572, 2003.

    Article  Google Scholar 

  121. K. M. Sim and W. H. Sun. Ant colony optimization for routing and load-balancing: Survey and new directions. IEEE Transactions on Systems, Man, and Cybernetics–Part A, 33(5):560–572, September 2003.

    Google Scholar 

  122. I. Stojmenović, editor. Mobile Ad-Hoc Networks. John Wiley & Sons, 2002.

    Google Scholar 

  123. D. Subramanian, P. Druschel, and J. Chen. Ants and reinforcement learning: A case study in routing in dynamic networks. In Proceedings of IJCAI, pages 832–838. Morgan Kaufmann, 1997.

    Google Scholar 

  124. D. J. T. Sumpter. From bee to society: An agent-based investigation of honey bee colonies. PhD thesis, University of Manchester, UK, 2000.

    Google Scholar 

  125. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press, 1998.

    Google Scholar 

  126. S. Tadrus. Generic multi-pheromone quality of service routing. PhD thesis, Department of Computer Science, University of Nottingham, 2007.

    Google Scholar 

  127. S. Tadrus and L. Bai. A QoS network routing algorithm using multiple pheromone tables. In Web Intelligence, pages 132–138, 2003.

    Google Scholar 

  128. S. Tadrus and L. Bai. QColony: a multi-pheromone best-fit QoS routing algorithm as an alternative to shortest-path routing algorithms. International Journal of Computational Intelligence and Applications, 5(2):141–167, 2005.

    Article  MATH  Google Scholar 

  129. G. Theraulaz and E. Bonabeau. A brief history of stigmergy. Artificial Life, Special Issue on Stigmergy, 5:97–116, 1999.

    Google Scholar 

  130. M. Thirunavukkarasu. Reinforcing reachable routes. Master’s thesis, Virginia Polytechnic Institue and State University, 2004.

    Google Scholar 

  131. R. van der Put. Routing in packet switched networks using agents. Master thesis, KBS, Delft University of Technology, Netherlands, 1998.

    Google Scholar 

  132. R. van der Put. Routing in the faxfactory using mobile agents. Technical report, KPN Research, 1998.

    Google Scholar 

  133. S. Varadarajan, N. Ramakrishnan, and M. Thirunavukkarasu. Reinforcing reachable routes. Computer Networks, 43(3):389–416, 2003.

    Article  MATH  Google Scholar 

  134. A. V. Vasilakos and G. A. Papadimitriou. A new approach to the design of reinforcement scheme for learning automata: Stochastic Estimator Learning Algorithms. Neurocomputing, 7(275), 1995.

    Google Scholar 

  135. V. Verstraete, M. Strobbe, E. Van Breusegem, J. Coppens, M. Pickavet, and P. Demeester. AntNet: ACO routing algorithm in practice. In Proceedings of INFORMS Telecommunications Conference, 2006.

    Google Scholar 

  136. K. von Frisch. Tanzsprache und Orientierung der Bienen. Springer-Verlag, Heidelberg, 1965.

    Google Scholar 

  137. K. von Frisch. The Dance Language and Orientation of Bees. Harvard University Press, Cambridge, 1967.

    Google Scholar 

  138. S. Vutukury. Multipath routing mechanisms for traffic engineering and quality of service in the Internet. PhD thesis, University of California, Santa Cruz, CA, USA, March 2001.

    Google Scholar 

  139. Z. Wang. Internet QoS: Architectures and Mechanisms for Quality of Service. Morgan Kaufmann, 2001.

    Google Scholar 

  140. H. F. Wedde and M. Farooq et al. BeeAdHoc—An Energy-Aware Scheduling and Routing Framework. Technical Report pg439, LSIII, School of Computer Science, University of Dortmund, 2004.

    Google Scholar 

  141. H. F. Wedde and M. Farooq. Beehive: New ideas for developing routing algorithms inspired by honey bee behavior. In Albert Y. Zomaya Stephan Olariu, editor, Handbook of Bioinspired Algorithms and Applications, chapter 21, pages 321–339. Chapman & Hall/CRC Computer and Information Science, 2005.

    Google Scholar 

  142. H. F. Wedde and M. Farooq. BeeHive: Routing algorithms inspired by honey bee behavior. KÜnstliche Intelligenz, Special Issue on Swarm Intelligence, 4:18–24, November 2005.

    Google Scholar 

  143. H. F. Wedde and M. Farooq. A performance evaluation framework for nature inspired routing algorithms. In Applications of Evolutionary Computing, volume 3449 of LNCS, pages 136–146. Springer, 2005.

    Google Scholar 

  144. H. F. Wedde and M. Farooq. The wisdom of the hive applied to mobile ad-hoc networks. In Proceedings of the IEEE Swarm Intelligence Symposium, pages 341–348, 2005.

    Google Scholar 

  145. H. F. Wedde and M. Farooq. A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks. Journal of System Architecture, 52(8-9):461–484, 2006.

    Article  Google Scholar 

  146. H. F. Wedde, M. Farooq, T. Pannenbaecker, B. Vogel, C. Mueller, J. Meth, and R. Jeruschkat. BeeAdHoc: an energy efficient routing algorithm for mobile ad-hoc networks inspired by bee behavior. In Proceedings of GECCO, pages 153–161, 2005.

    Google Scholar 

  147. H. F. Wedde, M. Farooq, C. Timm, J. Fischer, M. Kowalski, M. Langhans, N. Range, C. Schletter, R. Tarak, M. Tchatcheu, F. Volmering, S. Werner, and K. Wang. BeeAdHoc–An Efficient, Secure, Scalable Routing Framework for Mobile AdHoc Networks. Technical Report pg460, LSIII, School of Computer Science, University of Dortmund, 2005.

    Google Scholar 

  148. H. F. Wedde, M. Farooq, and Y. Zhang. BeeHive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior. In Ant Colony Optimization and Swarm Intelligence, volume 3172 of Lecture Notes in Computer Science, pages 83–94. Springer Verlag, Sept 2004.

    Google Scholar 

  149. H. F. Wedde, C. Timm, and M. Farooq. BeeHiveAIS: A simple, efficient, scalable and secure routing framework inspired by artificial immune systems. In Proceedings of the PPSN IX, volume 4193 of Lecture Notes in Computer Science, pages 623–632. Springer Verlag, September 2006.

    Google Scholar 

  150. H. F. Wedde, C. Timm, and M. Farooq. BeeHiveGuard: A step towards secure nature inspired routing algorithms. In Applications of Evolutionary Computing, volume 3907 of Lecture Notes in Computer Science, pages 243–254. Springer Verlag, April 2006.

    Google Scholar 

  151. T. White. Swarm intelligence and problem solving in telecommunications. Canadian Artificial Intelligence Magazine, (41):14–16, 1997.

    Google Scholar 

  152. T. White, B. Pagurek, and F. Oppacher. ASGA: Improving the ant system by integration with genetic algorithms. In Proceedings of the Third Annual Conference on Genetic Programming, pages 610–617, 1998.

    Google Scholar 

  153. T. White, B. Pagurek, and F. Oppacher. Connection management using adaptive mobile agents. In H.R. Arabnia, editor, Proceedings of the PDPTA, pages 802–809. CSREA Press, 1998.

    Google Scholar 

  154. T. White, B. Pagurek, and F. Oppacher. Application oriented routing with biologically-inspired agents. In Proceedings of GECCO, pages 610–617, 1999.

    Google Scholar 

  155. Y. Yang, A. N. Zincir-Heywood, M. I. Heywood, and S. Srinivas. Agent-based routing algorithms on a LAN. In IEEE Canadian Conference on Electrical and Computer Engineering, 1442–1447 2002.

    Google Scholar 

  156. S. Zahid, M. Shehzad, S. Usman Ali, and M. Farooq. A comprehensive formal framework for analyzing the behavior of nature inspired routing protocols. In Proceedings of Congress on Evolutionary Computing (CEC), pages 180–187. IEEE, 2007.

    Google Scholar 

  157. L. Zhang, S. Deering, and D. Estrin. RSVP: A new resource ReSerVation protocol. IEEE Networks, 7(5):8–18, September 1993.

    Google Scholar 

  158. R. Zhang and M. Bartell. BGP Design and Implementation. CISCO Press, 2003.

    Google Scholar 

  159. Z. Zhang, C. Sanchez, B. Salkewicz, and E. Crawley. Quality of service extensions to OSPF. Internet Draft draft-zhang-qos-ospf-00, Internet Engineering Task Force (IEFT), June 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Next Generation Intelligent Networks Research Center, National University of Computer and Emerging Sciences (NUCES), Islamabad, Pakistan

    Muddassar Farooq

  2. “Dalle Molle”, Institute for Artificial Intelligence (IDSIA), Lugano, Switzerland

    Gianni A. Di Caro

Authors
  1. Muddassar Farooq
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianni A. Di Caro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ALBCOM Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona 1-3 Omega 112 Campus Nord, 08034 Barcelona, Spain

    Christian Blum (Dr) (Dr)

  2. Dept. of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55 5230 Odense M, Denmark

    Daniel Merkle (Dr) (Dr)

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Farooq, M., Di Caro, G.A. (2008). Routing Protocols for Next-Generation Networks Inspired by Collective Behaviors of Insect Societies: An Overview. In: Blum, C., Merkle, D. (eds) Swarm Intelligence. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74089-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74089-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74088-9

  • Online ISBN: 978-3-540-74089-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation