Routing in Extremely Mobile Networks

  • Géraud Allard
  • Philippe Jacquet
  • Bernard Mans
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 197)


To become realistically untethered, wireless communication networks need to be self-organised, rapidly deployable, infrastructureless and mobile. Existing protocols are efficient in routing data dynamically between mobile nodes that belong to the same connected component. Concrete applications such as Defence and Disaster-Relief cannot always assume that the network is connected (i.e., not partitionned). However, even if the network is continuously partitioned, a “communication path” may be available through time and mobility using intermediate mobile nodes (temporally within reach of each other) — we have coined these “Extremely Mobile Networks”. We consider the problem of routing in a highly mobile network which, possibly, may never be fully connected. We introduce new algorithms that always allow to route a packet toward a remote destination. The packet bounces from connected components to connected components, thanks to node mobility.


Network partition Routing MANET Mobile Network Wireless Network 


  1. [1]
    T. Camp, J. Boleng, and V. Davies, ‘A Survey of Mobility Models for Ad Hoc Network Research’, Wireless Communication & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5), (2002), pp. 483–502, 2002Google Scholar
  2. [2]
    M. Grossglauser and D. Tse, “Mobility increases the capacity of ad hoc wireless netorks”, IEEE infocom 2001.Google Scholar
  3. [3]
    X. Hong, M. Gerla, G. Pei and C. Chiang, ‘A Group Mobility Model for Ad Hoc Wireless Networks’, ACM Workshop on Modeling and Simulation of Wireless and Mobile Systems, 1999.Google Scholar
  4. [4]
    P. Jacquet, “Space-time information propagation in Mobile ad hoc Networks”, IEEE Information Theory Workshop, Texas, October 2004.Google Scholar
  5. [5]
    Q. Li and D. Rus, Communication in disconnected ad hoc networks using message relay, Journal of Parallel and Distributed Computing, vol. 63, pp. 75–86, 2003.zbMATHCrossRefGoogle Scholar
  6. [6]
    T. Clausen, P. Jacquet, et al., Optimized Link State Routing Protocol, IETF-RFC-3626, Scholar
  7. [7]
    R. Rajaraman, ‘Topology Control and Routing in Ad hoc Networks: A Survey’, SIGACT News, 33, (2002), pp. 60–73.CrossRefGoogle Scholar
  8. [8]
    R. Shah and N.C. Hutchinson, ‘Delivering Messages in Disconnected Mobile Ad-Hoc Networks’, ADHOC-NOW, LNCS 2865, Springer-Verlag, pp. 72–83, 2003.Google Scholar
  9. [9]
    T. Spyropoulos, K. Psounis, C. Raghavendra, “Single-Copy Routing in Intermittently Connected Mobile Networks,” IEEE SECON, October 2004.Google Scholar
  10. [10]
    K. Wang and B. Li, ‘Efficient and guaranteed service coverage in partitionable mobile Ad Hoc Networks’, IEEE-Infocom, vol. 2, 2002, pp. 1089–1098.zbMATHGoogle Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Géraud Allard
    • 1
  • Philippe Jacquet
    • 1
  • Bernard Mans
    • 2
  1. 1.Domaine de Voluceau RocquencourtINRIAFrance
  2. 2.Dpt. of computingMacquarie UniversitySydneyAustralia

Personalised recommendations