Routing in extremely mobile networks

Géraud Allard*, Philippe Jacquet, Bernard Mans

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Title of host publicationChallenges in ad hoc networking
Subtitle of host publicationFourth Annual Mediterranean Ad Hoc Networking Workshop, June 21-24, 2005, Île de Porquerolles, France
EditorsK. AI Agha, I. Guérin Lassous, G. Pujolle
Place of PublicationNew York
PublisherSpringer, Springer Nature
Number of pages10
ISBN (Electronic)9780387311739
ISBN (Print)0387311718, 9780387311715
Publication statusPublished - 2006
EventFourth Annual Mediterranean Ad Hoc Networking Workshop - Île de Porquerolles, France
Duration: 21 Jun 200524 Jun 2005

Publication series

NameIFIP International Federation for Information Processing
ISSN (Print)15715736


WorkshopFourth Annual Mediterranean Ad Hoc Networking Workshop
CityÎle de Porquerolles


Dive into the research topics of 'Routing in extremely mobile networks'. Together they form a unique fingerprint.

Cite this