DocumentCode :
2670126
Title :
Finding Self-Similarities in Opportunistic People Networks
Author :
Chen, Ling-Jyh ; Chen, Yung-Chih ; Sun, Tony ; Sreedevi, Paruvelli ; Chen, Kuan-Ta ; Yu, Chen-Hung ; Chu, Hao-Hua
Author_Institution :
Acad. Sinica, Taipei
fYear :
2007
fDate :
6-12 May 2007
Firstpage :
2286
Lastpage :
2290
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.
Keywords :
telecommunication network routing; DTN network; Kaplan-Meier estimator; censorship removal algorithm; delay tolerant networks; opportunistic people networks; Ad hoc networks; Algorithm design and analysis; Communications Society; Computer science; Disruption tolerant networking; IP networks; Information science; Performance analysis; Statistical analysis; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE
Conference_Location :
Anchorage, AK
ISSN :
0743-166X
Print_ISBN :
1-4244-1047-9
Type :
conf
DOI :
10.1109/INFCOM.2007.266
Filename :
4215848
Link To Document :
بازگشت