Short and Robust Communication Paths in Dynamic Wireless Networks

We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[3]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[4]  Vinny Cahill,et al.  802.11 Link Quality and Its Prediction - An Experimental Study , 2004, PWC.

[5]  Krishna M. Sivalingam,et al.  Power-aware scheduling algoritms for wire-less networks , 2001 .

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

[7]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[8]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

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

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

[11]  Jose Oscar Fajardo,et al.  Service Discovery Protocol in Proactive Mobile Ad Hoc Networks , 2005, Med-Hoc-Net.

[12]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[13]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[14]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[15]  Daniele Frigioni,et al.  Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.

[16]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

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

[18]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[19]  Imed Bouazizi,et al.  ARA-the ant-colony based routing algorithm for MANETs , 2002, Proceedings. International Conference on Parallel Processing Workshop.