[1] Chen Qifan, Liu Linlan, Yang Zhiyong, et al. Prediction approach of critical node based on multiple attribute decision making for opportunistic sensor networks[J]. Journal of Sensors, 2016, 2016(4):1-8.
[2] 吴大鹏, 刘佳, 王汝言. 带有投递概率感知的低开销机会网络路由机制[J]. 北京邮电大学学报, 2013, 36(6):64-68. Wu Dapeng, Liu Jia, Wang Ruyan. Cost-efficient routing mechanism with delivery probability perception in opportunistic networks[J]. Journal of Beijing University of Posts and Telecommunications, 2013, 36(6):64-68.
[3] Xue F, Kumar P R. The number of neighbors needed for connectivity of wireless networks[J]. Wireless Networks, 2004, 10(2):169-181.
[4] Wan P J, Yi C W, Wang L X. Asymptotic critical transmission radius for k-connectivity in wireless Ad Hoc networks[J]. IEEE Transactions on Information Theory, 2010, 56(6):2867-2874.
[5] Scellato S, Leontiadis I, Mascolo C, et al. Evaluating temporal robustness of mobile networks[J]. IEEE Transactions on Mobile Computing, 2013, 12(1):105-117.
[6] Chaintreau A, Mtibaa A, Massoulie L, et al. The diameter of opportunistic mobile networks[C]//Proceedings of the 2007 ACM CoNEXT Conference. New York:ACM, 2007:1-12.
[7] Nicosia V, Tang J, Musolesi M, et al. Components in time-varying graphs[J]. Chaos:An Interdisciplinary Journal of Nonlinear Science, 2012, 22(2):1-12.
[8] Harras K A, Almeroth K C. Inter-regional messenger scheduling in delay tolerant mobile networks[C]//Proceedings of the 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks. New York:IEEE Computer Society, 2006:93-102. |