[1] JINDAL A, PSOUNIS K. Contention-aware analysis of routing schemes for mobile opportunistic networks[C]// Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking. New York: ACM, 2007:1-8. [2] HAAS Z, SMALL T. A new networking model for biological applications of Ad Hoc sensor networks[J]. IEEE/ACM Transactions on Networking, 2006, 14(1): 27-40. [3] GANTI R, YE F, LEI H. Mobile crowdsensing: current state and future challenges[J]. IEEE Communications Magazine, 2011, 49(11): 32-39. [4] PENTLAND A, FLETCHER R, HASSON A. Daknet: rethinking connectivity in developing nations [J]. Computer, 2004, 37(1): 78-83. [5] ZHAO D, MA H, LIU L, et al. On opportunistic coverage for urban sensing[C]// Proceedings of the IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems. Piscataway: IEEE, 2013: 231-239. [6] VAHDAT A, BECKER D. Epidemic routing for partially connected Ad Hoc networks, Technical Report CS-200006 [R]. Durham: Duke University, 2000. [7] FRENKIEL R H, BADRINATH B R, BORRAS J, et al. The infostations challenge: Balancing cost and ubiquity in delivering wireless data [J]. IEEE Personal Communications, 2000, 7(2): 66-71. [8] GROSSGLAUSER M, TSE D. Mobility increases the capacity of Ad-Hoc wireless networks [C]// INFOCOM 2001: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications. Piscataway: IEEE, 2001, 3: 1360-1369. [9] SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S. Efficient routing in intermittently connected mobile networks: the multiple-copy case [J]. IEEE/ACM Transactions on Networking, 2008, 16(1): 77-90. [10] XU J, LI Q, ZHANG H, et al. Performance evaluation of adaptive spray routing for opportunistic networks[J]. Journal of Computer Research and Development, 2010, 47(9):1622-1632.(徐佳, 李千目, 张宏,等. 机会网络中的自适应喷雾路由及其性能评估[J]. 计算机研究与发展, 2010, 47(9):1622-1632.) [11] MTIBAA A, MAY M, DIOT C, et al. PeopleRank: social opportunistic forwarding[C]// INFOCOM 2010: Proceedings of the 2010 International Conference on Computer Communications. Piscataway: IEEE, 2010: 1-5. [12] BULUT E, SZYMANSKI B. Exploiting friendship relations for efficient routing in mobile social networks [J]. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(12): 2254-2265. [13] YUAN P, MA H. Opportunistic forwarding with hotspot entropy[C]// Proceedings of the 2013 IEEE 14th International Symposium and Workshops on World of Wireless, Mobile and Multimedia Networks. Piscataway: IEEE, 2013: 1-9. [14] SHAH R, ROY S, JAIN S, et al. Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks [J]. Ad Hoc Networks, 2003, 1(2): 215-233. [15] LI Q, RUS D. Sending messages to mobile users in disconnected Ad Hoc wireless networks [C]// Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. New York: ACM, 2000: 44-55. [16] ZHAO W, AMMAR M, ZEGURA E. A message ferrying approach for data delivery in sparse mobile Ad Hoc networks [C]// Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York: ACM, 2004: 187-198. [17] ZHAO W, AMMAR M, ZEGURA E. Controlling the mobility of multiple data transport ferries in a delay-tolerant network[C]// Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications. Piscataway: IEEE, 2005: 1407-1418. [18] HE T, LEE K, SWAMI A. Flying in the dark: controlling autonomous data ferries with partial observations [C]// Proceedings of the 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York: ACM, 2010: 141-150. [19] WANG T, LOW C. Reducing message delay with the general Message Ferry Route (MFR*) problem[C]// Proceedings of the 2011 IEEE 7th International Conference on Wireless and Mobile Computing, Networking and Communications. Piscataway: IEEE, 2011: 380-387. [20] HENMI K, KOYAMA A. A DTN routing protocol based on mobility and maximum number of replications[C]// Proceedings of the 7th International Conference on Complex, Intelligent, and Software Intensive Systems. Piscataway: IEEE, 2013: 293-298. [21] KAVEEIVITCHAI S, ESAKI H. Independent DTNs message deletion mechanism for multi-copy routing scheme[C]// Proceedings of the 6th Asian Internet Engineering Conference. New York: ACM, 2010: 48-55. [22] LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks [J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 19-20. [23] GROENEVELT R, NAIN P, KOOLE G. The message delay in mobile Ad Hoc networks [J]. Performance Evaluation, 2005, 62(1): 210-228. |