Short and Robust Communication Paths in Dynamic Wireless Networks

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6234)


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.


Short Path Average Path Length Centralize Algorithm Pheromone Trail Renewal Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: MobiCom 1998, pp. 85–97. ACM, New York (1998)CrossRefGoogle Scholar
  2. 2.
    Di Caro, G., Ducatelle, F., Gambardella, L.M.: Anthocnet: an ant-based hybrid routing algorithm for mobile ad hoc networks. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 461–470. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Di Caro, G., Dorigo, M.: Antnet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)zbMATHGoogle Scholar
  4. 4.
    Gaertner, G., ONuallain, E., Butterly, A., Singh, K., Cahill, V.: 802.11 Link Quality and Its Prediction - An Experimental Study. In: Niemegeers, I.G.M.M., de Groot, S.H. (eds.) PWC 2004. LNCS, vol. 3260, pp. 147–163. Springer, Heidelberg (2004)Google Scholar
  5. 5.
    Ko, Y.B., Vaidya, N.H.: Location-aided routing (lar) in mobile ad hoc networks. In: MobiCom 1998: Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, pp. 66–75. ACM Press, New York (1998)CrossRefGoogle Scholar
  6. 6.
    Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: WMCSA 1999: Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p. 90. IEEE Computer Society, Washington (1999)CrossRefGoogle Scholar
  7. 7.
    Rosati, L., Berioli, M., Reali, G.: On ant routing algorithms in ad hoc networks with critical connectivity. Ad Hoc Networks 6(6), 827–859 (2008)CrossRefGoogle Scholar
  8. 8.
    Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-based load balancing in telecommunications networks. Adaptive Behavior 5(2), 169 (1997)CrossRefGoogle Scholar
  9. 9.
    Wang, J., Osagie, E., Thulasiraman, P., Thulasiram, R.K.: Hopnet: A hybrid ant colony optimization routing algorithm for mobile ad hoc network. Ad Hoc Networks 7(4), 690–705 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.SnTUniversity of LuxembourgLuxembourg
  2. 2.LITISUniversity of Le HavreFrance

Personalised recommendations