TY - GEN
T1 - Information propagation speed in mobile and delay tolerant networks
AU - Jacquet, Philippe
AU - Mans, Bernard
AU - Rodolakis, Georgios
N1 - Copyright 2009 IEEE. Reprinted from 2009 Proceedings IEEE INFOCOM : 19-25 April 2009, Rio de Janeiro, Brazil. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
PY - 2009
Y1 - 2009
N2 - The goal of this paper is to increase our under-standing of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently connected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility and graph models to obtain specific analytical estimates. In particular, when nodes move at speed v and their density v is small (the network is sparse and surely disconnected), we prove that the information propagation speed is upper bounded by (1+ O(v2))v in the random way-point model, while it is upper bounded by O(v √vvv) for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios.
AB - The goal of this paper is to increase our under-standing of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently connected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility and graph models to obtain specific analytical estimates. In particular, when nodes move at speed v and their density v is small (the network is sparse and surely disconnected), we prove that the information propagation speed is upper bounded by (1+ O(v2))v in the random way-point model, while it is upper bounded by O(v √vvv) for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios.
UR - http://www.scopus.com/inward/record.url?scp=70349696202&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2009.5061927
DO - 10.1109/INFCOM.2009.5061927
M3 - Conference proceeding contribution
AN - SCOPUS:70349696202
SN - 9781424435128
T3 - IEEE INFOCOM
SP - 244
EP - 252
BT - The 28th Conference on Computer Communications, IEEE INFOCOM 2009
PB - Institute of Electrical and Electronics Engineers (IEEE)
CY - Piscataway, NJ
T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009
Y2 - 19 April 2009 through 25 April 2009
ER -