Data loss modeling and analysis in partially-covered delay-tolerant networks

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

We characterize some fundamental performance limits of partially covered, intermittently connected, delay-tolerant networks (DTNs) that are comprised of a hybrid mix of mobile and static nodes (i.e., access points). Specifically, we derive theoretic bounds on the expected hitting time between two consecutive visits of a mobile node to access points for both the square and hexagonal access point deployment structures. For each of these two models, we use the Poisson Clumping technique to derive theoretic bounds on the data loss rate, under the assumption that a mobile node has a finite buffer that overflows after a certain amount of time. Based of these obtained results, we provide asymptotic analysis of the expected hitting time in these partially covered DTNs. We test the applicability of the Poisson Clumping technique, and our hitting time results, with simulations.

Original languageEnglish
Title of host publication2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Proceedings
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Maui, HI, United States
Duration: 31 Jul 20114 Aug 2011

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
ISSN (Print)1095-2055

Conference

Conference2011 20th International Conference on Computer Communications and Networks, ICCCN 2011
Country/TerritoryUnited States
CityMaui, HI
Period31/07/114/08/11

Fingerprint

Dive into the research topics of 'Data loss modeling and analysis in partially-covered delay-tolerant networks'. Together they form a unique fingerprint.

Cite this