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

研究成果: 書貢獻/報告類型會議貢獻

18 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
主出版物標題Proceedings - IEEE INFOCOM 2007
主出版物子標題26th IEEE International Conference on Computer Communications
頁面2286-2290
頁數5
DOIs
出版狀態已發佈 - 2007
事件IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, 美国
持續時間: 2007 五月 62007 五月 12

出版系列

名字Proceedings - IEEE INFOCOM
ISSN(列印)0743-166X

其他

其他IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
國家美国
城市Anchorage, AK
期間07/5/607/5/12

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

指紋 深入研究「Finding self-similarities in opportunistic people networks」主題。共同形成了獨特的指紋。

  • 引用此

    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. 於 Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications (頁 2286-2290). [4215848] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2007.266