研究著作內容
Finding Self-Similarities in Opportunistic People Networks
(NOTE: Sheng-Wei Chen is also known as Kuan-Ta Chen.)

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.

Materials
Citation
Ling-Jyh Chen, Yung-Chih Chen, Tony Sun, Paruvelli Sreedevi, Kuan-Ta Chen, Chen-Hung Yu, and Hao-hua Chu, "Finding Self-Similarities in Opportunistic People Networks," In Proceedings of IEEE INFOCOM`07 (mini-symposium), Alaska, USA, May 2007.

BibTex
@INPROCEEDINGS{chen07:ss,
  AUTHOR     = {Ling-Jyh Chen and Yung-Chih Chen and Tony Sun and Paruvelli Sreedevi and Kuan-Ta Chen and Chen-Hung Yu and Hao-hua Chu},
  TITLE      = {Finding Self-Similarities in Opportunistic People Networks},
  BOOKTITLE  = {Proceedings of IEEE INFOCOM`07 (mini-symposium)},
  MONTH      = {May},
  YEAR       = {2007},
  ADDRESS    = {Alaska, USA}
}