Applying Branching Processes to Delay-Tolerant Networks

Dieter Fiems; Eitan Altman

Bioinspired Models of Network, Information, and Computing Systems. 4th International Conference, BIONETICS 2009, Avignon, France, December 9-11, 2009, Revised Selected Papers

Research Article

Applying Branching Processes to Delay-Tolerant Networks

Download

435 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-12808-0_11,
    author={Dieter Fiems and Eitan Altman},
    title={Applying Branching Processes to Delay-Tolerant Networks},
    proceedings={Bioinspired Models of Network, Information, and Computing Systems. 4th International Conference, BIONETICS 2009, Avignon, France, December 9-11, 2009, Revised Selected Papers},
    proceedings_a={BIONETICS},
    year={2012},
    month={5},
    keywords={},
    doi={10.1007/978-3-642-12808-0_11}
}

Dieter Fiems
Eitan Altman
Year: 2012
Applying Branching Processes to Delay-Tolerant Networks
BIONETICS
Springer
DOI: 10.1007/978-3-642-12808-0_11

Dieter Fiems¹, Eitan Altman²

1: Ghent University
2: INRIA, BP93

Abstract

Mobility models that have been used in the past to study delay tolerant networks (DTNs) have been either too complex to allow for deriving analytical expressions for performance measures, or have been too simplistic. In this paper we identify several classes of DTNs where the dynamics of the number of nodes that have a copy of some packet can be modeled as branching process with migration. Using recent results on such processes in a random environment, we obtain explicit formulae for the first two moments of the number of copies of a file that is propagated in the DTN, for quite general mobility models. Numerical examples illustrate our approach.

Published: 2012-05-28

: http://dx.doi.org/10.1007/978-3-642-12808-0_11