Abstract
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.
Chapter PDF
Similar content being viewed by others
References
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, 2002
M. Grossglauser and D. Tse, “Mobility increases the capacity of ad hoc wireless netorks”, IEEE infocom 2001.
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.
P. Jacquet, “Space-time information propagation in Mobile ad hoc Networks”, IEEE Information Theory Workshop, Texas, October 2004.
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.
T. Clausen, P. Jacquet, et al., Optimized Link State Routing Protocol, IETF-RFC-3626, http://www.ietf.org/
R. Rajaraman, ‘Topology Control and Routing in Ad hoc Networks: A Survey’, SIGACT News, 33, (2002), pp. 60–73.
R. Shah and N.C. Hutchinson, ‘Delivering Messages in Disconnected Mobile Ad-Hoc Networks’, ADHOC-NOW, LNCS 2865, Springer-Verlag, pp. 72–83, 2003.
T. Spyropoulos, K. Psounis, C. Raghavendra, “Single-Copy Routing in Intermittently Connected Mobile Networks,” IEEE SECON, October 2004.
K. Wang and B. Li, ‘Efficient and guaranteed service coverage in partitionable mobile Ad Hoc Networks’, IEEE-Infocom, vol. 2, 2002, pp. 1089–1098.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Allard, G., Jacquet, P., Mans, B. (2006). Routing in Extremely Mobile Networks. In: Al Agha, K., Guérin Lassous, I., Pujolle, G. (eds) Challenges in Ad Hoc Networking. Med-Hoc-Net 2005. IFIP International Federation for Information Processing, vol 197. Springer, Boston, MA. https://doi.org/10.1007/0-387-31173-4_15
Download citation
DOI: https://doi.org/10.1007/0-387-31173-4_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-31171-5
Online ISBN: 978-0-387-31173-9
eBook Packages: Computer ScienceComputer Science (R0)