[1] Xiong Yongping, Sun Limin, Niu Jianwei, et al. Opportunistic Networks[J]. Journal of Software, 2009, 20(1): 124-137.
[2] Boldrini C, Conti M, Passarella A. Autonomic Behaviour of Opportunistic Network Routing[J]. International Journal of Autonomous and Adaptive Communications Systems, 2008, 1(1): 122-147.
[3] Fall K. A Delay-tolerent Network Architecture for Chanllenged Internets[C]//Proc. of ACM SIGCOMM’03. Karlsruhe, Germany: [s. n.], 2003.
[4] Merugu S, Ammar M, Zegura E. Routing in Space and Time in Networks with Predictable Mobility[R]. Georgia Institute of Technology, Tech. Rep.: IRB-TR-04-020, 2004.
[5] Ferreira A, Jarry A. Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-enerage Broadcast Routing Problem [C]//Proc. of WIOPT’04. Cambridge, UK: [s. n.], 2004.
[6] Jarry A, Lotker A. Connectivity in Evolving Graph with Geometric Properties[C]//Proc. of DIALM-POMC’04. Philedelphia, USA: [s. n.], 2004: 24-30.
[7] Monteiro J, Goldman A, Ferreira A. Performance Evaluation of Dynamic Networks Using an Evolving Graph Combinatorial Model[C]//Proc. of WIMOB’06. Montreal, USA: [s. n.], 2006: 173-180.
[8] Clementi A E F, Macci C, Monti M, et al. Flooding Time in Edge-Markovian Dynamic Graphs[C]//Proc. of the 27th ACM Symp. on Principles of Distributed Computing. Toronto, Canada: [s. n.], 2008: 213-222.
[9] Hervé B, Pierluigi C, Pierre F. Parsimonious Flooding in Dynamic Graphs[C]//Proc. of the 28th ACM Symp. on Principles of Distributed Computing. Calgary, USA: ACM Press, 2009: 260- 269.
[10] Zabell S L. Symmetry and Its Discontents, Chapter 2: The Rule of Succession[M]. [S. l.]: Springer, 2005.
[11] A Community Resource for Archiving Wireless Data[EB/OL]. (2009-12-23). http://crawdad.cs.dartmouth.edu/. |