By Topic

Information propagation speed in Delay Tolerant Networks: Analytic upper bounds

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Philippe Jacquet ; INRIA, Rocquencourt, France ; Bernard Mans ; Georgios Rodolakis

Delay/disruption tolerant networks (DTNs) or intermittently connected mobile networks (ICNs) are mobile ad hoc networks where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. While most of the research is dedicated to the design of routing protocols, very few properties of such networks are known. In a recent paper [6], the authors provided analytical upper bounds for the information propagation speed in DTNs when they are modeled as two-dimensional Unit Disk Graphs. In this paper, we extend this study to other models by using analytical tools to derive theoretical upper-bounds of the information propagation speed. Firstly, we will present results for DTNs mapped in a space of dimension D, where D varies from 1 to 3. Secondly, we will depart from the Unit Disk Graph model to consider a more realistic model where a node captures a packet sent at distance r with probability p(r).

Published in:

2008 IEEE International Symposium on Information Theory

Date of Conference:

6-11 July 2008