Meta-Heuristics Techniques and Swarm Intelligence in Mobile Ad Hoc Networks

The infrastructure-less and the dynamic nature of mobile ad hoc networks (MANETs) demands new set of networking strategies to be implemented in order to provide efficient end-to-end communication. MANETs employ the traditional TCP/IP structure to provide end-to-end communication between nodes. However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model requires redefinition or modifications to work efficiently in MANETs. One interesting research area in MANETs is routing. Routing is a challenging task and has received huge attention from researches. Due to the adaptive and dynamic nature of these networks, the Swarm Intelligence approach is considered a successful design paradigm to solve the routing problem. Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviours of insects and of other animals. In particular, the collective behaviour of ants have inspired a number of methods and techniques among which the most studied and the most successful is the general purpose optimization technique known as Ant Colony Optimization (ACO) meta-heuristic. ACO takes inspiration from the foraging behaviour of some ant species. These ants deposit a chemical substance called pheromone on the ground in order to mark some favourable path that should be followed by other members of the colony. This behaviour has led to development of many different ant based routing protocols for MANETs. In this chapter, a description of swarm intelligence approach and ACO meta-heuristic is given, an overview of a wide range of ant based routing protocols in the literature is proposed and finally other applications related to ACO in MANETs and new directions are discussed.

[1]  Wei Guo,et al.  An ant-based distributed routing algorithm for ad-hoc networks , 2004, 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914).

[2]  Anthony R. White,et al.  Syntheca: a synthetic ecology of chemical agents , 2000 .

[3]  Morteza Ziyadi,et al.  Adaptive Clustering for Energy Efficient Wireless Sensor Networks Based on Ant Colony Optimization , 2009, 2009 Seventh Annual Communication Networks and Services Research Conference.

[4]  Thomas Stützle,et al.  The MAX–MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization , 1997 .

[5]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[6]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[7]  Sam Jabbehdari,et al.  A novel ant-based QoS routing for mobile adhoc networks , 2009, 2009 First International Conference on Ubiquitous and Future Networks.

[8]  Tarek Saadawi,et al.  Ant routing algorithm for mobile ad-hoc networks (ARAMA) , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[9]  John S. Baras,et al.  A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks , 2003 .

[10]  Xiaoyan Huang,et al.  An Improved Ant Colony QoS Routing Algorithm Applied to Mobile Ad Hoc Networks , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.

[11]  Benjamín Barán,et al.  A new approach for AntNet routing , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[12]  Hong Zhang,et al.  An Effective Ant-Colony Based Routing Algorithm for Mobile Ad-Hoc Network , 2008, 2008 4th IEEE International Conference on Circuits and Systems for Communications.

[13]  Vasilis Friderikos,et al.  Cross-Layer Optimization to Maximize Fairness Among TCP Flows of Different TCP Flavors , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[14]  Yue Zhang,et al.  HCRS: A Routing Scheme for Ad Hoc Networks as a QoS Guarantee Primitive , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[15]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[16]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[17]  Floriano De Rango,et al.  Energy saving and load balancing in wireless ad hoc networks through ant-based routing , 2009, 2009 International Symposium on Performance Evaluation of Computer & Telecommunication Systems.

[18]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[19]  Luca Maria Gambardella,et al.  AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks , 2004, PPSN.

[20]  Alvaro Pachon,et al.  Application of an ant colony metaphor for network address management in MANETs , 2009, 2009 IEEE Latin-American Conference on Communications.

[21]  Ruppa K. Thulasiram,et al.  HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network , 2009, Ad Hoc Networks.

[22]  Otto Spaniol,et al.  Ant-Routing-Algorithm for Mobile Multi-Hop Ad-Hoc Networks , 2003, Net-Con.

[23]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

[24]  Gianluca Reali,et al.  On ant routing algorithms in ad hoc networks with critical connectivity , 2008, Ad Hoc Networks.

[25]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[26]  Luca Maria Gambardella,et al.  Using Ant Agents to Combine Reactive and Proactive Strategies for Routing in Mobile Ad-hoc Networks , 2005, Int. J. Comput. Intell. Appl..

[27]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[28]  B.M. Ali,et al.  Existing MANET routing protocols and metrics used towards the efficiency and reliability- an overview , 2007, 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications.

[29]  Ruppa K. Thulasiram,et al.  PACONET: imProved  Ant Colony Optimization Routing Algorithm for Mobile Ad Hoc NETworks , 2008, 22nd International Conference on Advanced Information Networking and Applications (aina 2008).

[30]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[31]  Jaroslav Opatrny,et al.  A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks , 2008, J. Networks.

[32]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

[33]  Hantao Song,et al.  Ant-based Energy Aware Disjoint Multipath Routing Algorithm in MANETs , 2006, 2006 First International Symposium on Pervasive Computing and Applications.

[34]  Chien-Chung Shen,et al.  ANSI: A Unicast Routing Protocol for Mobile Ad hoc Networks Using Swarm Intelligence , 2005, IC-AI.

[35]  Devika Subramanian,et al.  Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks , 1997, IJCAI.

[36]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[37]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[38]  Salvatore Marano,et al.  Minimum Hop Count and Load Balancing Metrics Based on Ant Behavior over HAP Mesh , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[39]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.