Analytic bounds on data loss rates in mostly-covered mobile DTNs

Max Brugger, Kyle Bradford, Samina Ehsan, Bechir Hamdaoui, Yevgeniy Kovchegov

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

We derive theoretical performance limits of densely covered delay-tolerant networks (DTNs). In the DTN model we study, a number of fixed (data collector) nodes are deployed in the DTN region where mobile (data generator) nodes move freely in the region according to Brownian motion. As it moves, each \mobile is assumed to continuously generate and buffer data. When a \mobile comes within the communication coverage range of a data collector node, the \mobile immediately and completely uploads its buffered data to the data collector node, and then resumes generating and buffering its data. In this paper, we first derive analytic bounds on the amount of time a \mobile spends without communication coverage. Then, using these derived bounds, we derive sufficient conditions on node density that statistically guarantee that the expected amount of time spent in the uncovered region remains below a given threshold. Additionally, we derive sufficient conditions on node density to keep the probability of buffer overflow below a given tolerance.

Original languageEnglish
Article number6542779
Pages (from-to)3121-3129
Number of pages9
JournalIEEE Transactions on Wireless Communications
Volume12
Issue number7
DOIs
Publication statusPublished - 2013
Externally publishedYes

Keywords

  • Performance modeling and analysis
  • Poisson clumping approximations
  • data loss rates
  • mobile delay-tolerant networks

Fingerprint

Dive into the research topics of 'Analytic bounds on data loss rates in mostly-covered mobile DTNs'. Together they form a unique fingerprint.

Cite this