| [1] Fall K. A delay-tolerant network architecture for challenged Internets [C]//Proc of the ACM SIGCOMM 2003. New York: ACM, 2003: 27-34.[2] Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks[C]//MProceedings of ACM SIGCOMM Workshops: Conference on Computer Communications. New York: [s. n. ], 2005: 252-259.[3] 李家瑜, 张大方, 何施明. DTN中基于节点价值的效用路由协议[J]. 计算机应用研究, 2012, 29(9): 3380-3382. Li Jiayu, Zhang Dafang, He Shiming. Utility routing algorithm based on value of node in DTN[J]. Application Research of Computers, 2012, 29(9): 3380-3382.[4] Liu Can, Deng Su, Huang Hongbin, et al. Fair spray and wait routing in DTN[C]//2011 4th IEEE International Conference on Computer Science and Information Technology. Chengdu: [s. n. ], 2011: 219-222.[5] Jung K H, Lim W S, Jeong J P, et al. A link contact duration-based routing protocol in delay-tolerant networks[J]. Wireless Networks, 2013, 19(6): 1299-1316.[6] 张振京, 金志刚, 舒炎泰. 基于节点运动预测的社会性DTN高效路由[J]. 计算机学报, 2013, 36(3): 626-635. Zhang Zhenjing, Jin Zhigang, Shu Yantai. Efficient routing in social DTN based on nodes' movement prediction[J]. Chinese Journal of Computers, 2013, 36(3): 626-635.[7] 彭敏, 洪佩琳, 薛开平, 等. 基于投递概率预测的DTN高效路由[J]. 计算机学报, 2011, 34(1): 175-180. Peng Min, Hong Peilin, Xue Kaiping, et al. Delivery probability prediction based efficient routing in DTN[J]. Chinese Journal of Computers, 2011, 34(1): 175-180. |
