Finding self-similarities in opportunistic people networks

Ling Jyh Chen, Yung Chih Chen, Tony Sun, Paruvelli Sreedevi, Kuan Ta Chen, Chen Hung Yu, Hao Hua Chu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

Opportunistic network is a type of Delay Tolerant Networks (DTN) where network communication opportunities appear opportunistic. In this study, we investigate opportunistic network scenarios based on public network traces, and our contributions are the following: First, we identify the censorship issue in network traces that usually leads to strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements, which is used in designing our proposed censorship removal algorithm (CRA) that is used to recover censored data. Second, we perform a rich set of analysis illustrating that UCSD and Dartmouth network traces show strong self-similarity, and can be modeled as such. Third, we pointed out the importance of these newly revealed characteristics in future development and evaluation of opportunistic networks.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM 2007
Subtitle of host publication26th IEEE International Conference on Computer Communications
Pages2286-2290
Number of pages5
DOIs
Publication statusPublished - 2007 Sep 4
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: 2007 May 62007 May 12

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
CountryUnited States
CityAnchorage, AK
Period07/5/607/5/12

Fingerprint

Delay tolerant networks
Telecommunication networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Chen, L. J., Chen, Y. C., Sun, T., Sreedevi, P., Chen, K. T., Yu, C. H., & Chu, H. H. (2007). Finding self-similarities in opportunistic people networks. In Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications (pp. 2286-2290). [4215848] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2007.266

Finding self-similarities in opportunistic people networks. / Chen, Ling Jyh; Chen, Yung Chih; Sun, Tony; Sreedevi, Paruvelli; Chen, Kuan Ta; Yu, Chen Hung; Chu, Hao Hua.

Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications. 2007. p. 2286-2290 4215848 (Proceedings - IEEE INFOCOM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, LJ, Chen, YC, Sun, T, Sreedevi, P, Chen, KT, Yu, CH & Chu, HH 2007, Finding self-similarities in opportunistic people networks. in Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications., 4215848, Proceedings - IEEE INFOCOM, pp. 2286-2290, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, United States, 07/5/6. https://doi.org/10.1109/INFCOM.2007.266
Chen LJ, Chen YC, Sun T, Sreedevi P, Chen KT, Yu CH et al. Finding self-similarities in opportunistic people networks. In Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications. 2007. p. 2286-2290. 4215848. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2007.266
Chen, Ling Jyh ; Chen, Yung Chih ; Sun, Tony ; Sreedevi, Paruvelli ; Chen, Kuan Ta ; Yu, Chen Hung ; Chu, Hao Hua. / Finding self-similarities in opportunistic people networks. Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications. 2007. pp. 2286-2290 (Proceedings - IEEE INFOCOM).
@inproceedings{3ddec4e501604ca6a6237c09745e5994,
title = "Finding self-similarities in opportunistic people networks",
abstract = "Opportunistic network is a type of Delay Tolerant Networks (DTN) where network communication opportunities appear opportunistic. In this study, we investigate opportunistic network scenarios based on public network traces, and our contributions are the following: First, we identify the censorship issue in network traces that usually leads to strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements, which is used in designing our proposed censorship removal algorithm (CRA) that is used to recover censored data. Second, we perform a rich set of analysis illustrating that UCSD and Dartmouth network traces show strong self-similarity, and can be modeled as such. Third, we pointed out the importance of these newly revealed characteristics in future development and evaluation of opportunistic networks.",
author = "Chen, {Ling Jyh} and Chen, {Yung Chih} and Tony Sun and Paruvelli Sreedevi and Chen, {Kuan Ta} and Yu, {Chen Hung} and Chu, {Hao Hua}",
year = "2007",
month = "9",
day = "4",
doi = "10.1109/INFCOM.2007.266",
language = "English",
isbn = "1424410479",
series = "Proceedings - IEEE INFOCOM",
pages = "2286--2290",
booktitle = "Proceedings - IEEE INFOCOM 2007",

}

TY - GEN

T1 - Finding self-similarities in opportunistic people networks

AU - Chen, Ling Jyh

AU - Chen, Yung Chih

AU - Sun, Tony

AU - Sreedevi, Paruvelli

AU - Chen, Kuan Ta

AU - Yu, Chen Hung

AU - Chu, Hao Hua

PY - 2007/9/4

Y1 - 2007/9/4

N2 - Opportunistic network is a type of Delay Tolerant Networks (DTN) where network communication opportunities appear opportunistic. In this study, we investigate opportunistic network scenarios based on public network traces, and our contributions are the following: First, we identify the censorship issue in network traces that usually leads to strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements, which is used in designing our proposed censorship removal algorithm (CRA) that is used to recover censored data. Second, we perform a rich set of analysis illustrating that UCSD and Dartmouth network traces show strong self-similarity, and can be modeled as such. Third, we pointed out the importance of these newly revealed characteristics in future development and evaluation of opportunistic networks.

AB - Opportunistic network is a type of Delay Tolerant Networks (DTN) where network communication opportunities appear opportunistic. In this study, we investigate opportunistic network scenarios based on public network traces, and our contributions are the following: First, we identify the censorship issue in network traces that usually leads to strongly skewed distribution of the measurements. Based on this knowledge, we then apply the Kaplan-Meier Estimator to calculate the survivorship of network measurements, which is used in designing our proposed censorship removal algorithm (CRA) that is used to recover censored data. Second, we perform a rich set of analysis illustrating that UCSD and Dartmouth network traces show strong self-similarity, and can be modeled as such. Third, we pointed out the importance of these newly revealed characteristics in future development and evaluation of opportunistic networks.

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

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

U2 - 10.1109/INFCOM.2007.266

DO - 10.1109/INFCOM.2007.266

M3 - Conference contribution

AN - SCOPUS:34548305167

SN - 1424410479

SN - 9781424410477

T3 - Proceedings - IEEE INFOCOM

SP - 2286

EP - 2290

BT - Proceedings - IEEE INFOCOM 2007

ER -