An analytical study of people mobility in opportunistic networks

Ling Jyh Chen, Yung Chih Chen

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

An opportunistic network is a type of Delay Tolerant Network (DTN) in which communication opportunities are intermittent. Moreover, an end-to-end path between the source and the destination may never have existed, disconnection and reconnection are common occurrences, and link performance is highly variable or extreme. With numerous emerging opportunistic networking applications, strategies that can facilitate effective data communication in such challenging environments have become increasingly desirable. In particular, knowing the fundamental properties of opportunistic networks will soon be the key to the proper design of opportunistic routing schemes and applications. In this study, we investigate opportunistic network scenarios based on two public network traces, namely, the UCSD and Dartmouth traces. Our contribution is twofold. First, we identify the censorship issue in network traces that usually leads to a strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements. The survivorship feature is used to design our proposed censorship removal algorithm (CRA) for recovering censored data. Second, we perform an in-depth analysis of the UCSD and Dartmouth network traces. We show that they exhibit strong self-similarity, and can be modeled as such. We believe these newly revealed characteristics will be important in the future development and evaluation of opportunistic networks.

Original languageEnglish
Pages (from-to)197-214
Number of pages18
JournalJournal of Information Science and Engineering
Volume26
Issue number1
Publication statusPublished - 2010 Jan 1

Fingerprint

Delay tolerant networks
Communication
censorship
communication
networking
scenario
evaluation
performance

Keywords

  • Censorship removal algorithm
  • Delay tolerant networks
  • Kaplan-meier estimator
  • Self-similarity
  • Survival analysis

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Cite this

An analytical study of people mobility in opportunistic networks. / Chen, Ling Jyh; Chen, Yung Chih.

In: Journal of Information Science and Engineering, Vol. 26, No. 1, 01.01.2010, p. 197-214.

Research output: Contribution to journalArticle

@article{baff2afda22944abaf66a8afb2401943,
title = "An analytical study of people mobility in opportunistic networks",
abstract = "An opportunistic network is a type of Delay Tolerant Network (DTN) in which communication opportunities are intermittent. Moreover, an end-to-end path between the source and the destination may never have existed, disconnection and reconnection are common occurrences, and link performance is highly variable or extreme. With numerous emerging opportunistic networking applications, strategies that can facilitate effective data communication in such challenging environments have become increasingly desirable. In particular, knowing the fundamental properties of opportunistic networks will soon be the key to the proper design of opportunistic routing schemes and applications. In this study, we investigate opportunistic network scenarios based on two public network traces, namely, the UCSD and Dartmouth traces. Our contribution is twofold. First, we identify the censorship issue in network traces that usually leads to a strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements. The survivorship feature is used to design our proposed censorship removal algorithm (CRA) for recovering censored data. Second, we perform an in-depth analysis of the UCSD and Dartmouth network traces. We show that they exhibit strong self-similarity, and can be modeled as such. We believe these newly revealed characteristics will be important in the future development and evaluation of opportunistic networks.",
keywords = "Censorship removal algorithm, Delay tolerant networks, Kaplan-meier estimator, Self-similarity, Survival analysis",
author = "Chen, {Ling Jyh} and Chen, {Yung Chih}",
year = "2010",
month = "1",
day = "1",
language = "English",
volume = "26",
pages = "197--214",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "1",

}

TY - JOUR

T1 - An analytical study of people mobility in opportunistic networks

AU - Chen, Ling Jyh

AU - Chen, Yung Chih

PY - 2010/1/1

Y1 - 2010/1/1

N2 - An opportunistic network is a type of Delay Tolerant Network (DTN) in which communication opportunities are intermittent. Moreover, an end-to-end path between the source and the destination may never have existed, disconnection and reconnection are common occurrences, and link performance is highly variable or extreme. With numerous emerging opportunistic networking applications, strategies that can facilitate effective data communication in such challenging environments have become increasingly desirable. In particular, knowing the fundamental properties of opportunistic networks will soon be the key to the proper design of opportunistic routing schemes and applications. In this study, we investigate opportunistic network scenarios based on two public network traces, namely, the UCSD and Dartmouth traces. Our contribution is twofold. First, we identify the censorship issue in network traces that usually leads to a strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements. The survivorship feature is used to design our proposed censorship removal algorithm (CRA) for recovering censored data. Second, we perform an in-depth analysis of the UCSD and Dartmouth network traces. We show that they exhibit strong self-similarity, and can be modeled as such. We believe these newly revealed characteristics will be important in the future development and evaluation of opportunistic networks.

AB - An opportunistic network is a type of Delay Tolerant Network (DTN) in which communication opportunities are intermittent. Moreover, an end-to-end path between the source and the destination may never have existed, disconnection and reconnection are common occurrences, and link performance is highly variable or extreme. With numerous emerging opportunistic networking applications, strategies that can facilitate effective data communication in such challenging environments have become increasingly desirable. In particular, knowing the fundamental properties of opportunistic networks will soon be the key to the proper design of opportunistic routing schemes and applications. In this study, we investigate opportunistic network scenarios based on two public network traces, namely, the UCSD and Dartmouth traces. Our contribution is twofold. First, we identify the censorship issue in network traces that usually leads to a strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements. The survivorship feature is used to design our proposed censorship removal algorithm (CRA) for recovering censored data. Second, we perform an in-depth analysis of the UCSD and Dartmouth network traces. We show that they exhibit strong self-similarity, and can be modeled as such. We believe these newly revealed characteristics will be important in the future development and evaluation of opportunistic networks.

KW - Censorship removal algorithm

KW - Delay tolerant networks

KW - Kaplan-meier estimator

KW - Self-similarity

KW - Survival analysis

UR - http://www.scopus.com/inward/record.url?scp=77249108874&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77249108874&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:77249108874

VL - 26

SP - 197

EP - 214

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 1

ER -