[1] |
FALL K . A delay-tolerant network architecture for challenged Inter-nets[A]. Proc of the ACM SIGCOMM[C]. 2003.27-34.
|
[2] |
BURLEIGH S , HOOKE A , TORGERSON L ,et al. Delay tolerant networking:an approach to interplanetary internetInter-nets[J]. IEEE Commu-nications Magazine, 2003.41(6):128-136.
|
[3] |
AKYILDIZ I F , SU W , SANKARASUBRAMANIAM Y ,et al. A survey on sensor networks[J]. IEEE Communications Magazine, 2002,40(8):102-114.
|
[4] |
JONES E , WARD P . Routing strategies for delay-tolerant net-works[A]. Proc of International Conference on Wireless Communica-tions and Mobile Computing[C]. 2006.
|
[5] |
熊永平, 孙利民, 牛建伟 等. 机会网络[J]. 软件学报, 2009,20(1):124-137. XIONG Y P , SUN L M , NIU J W ,et al. Opportunistic networks[J]. Journal of Software, 2009,20(1):124-137.
|
[6] |
JAIN S , FALL K , PATRA R . Routing in delay tolerant network[A]. Proc of SIGCOMM[C]. New York:ACM Press, 2004.145-157.
|
[7] |
VAHDAT A , BECKER D . Epidemic routing for partially connected ad hoc networks[R].Duke University, 2000.
|
[8] |
TANG L , ZHENG Q , LIU J ,et al. SMART:A selective con-trolled-flooding routing for delay tolerant networks[A]. Fourth Inter-national Conference on IEEE Broadband Communications,Networks and Systems[C]. 2007.356-365.
|
[9] |
SOYROPOULOS T , PSOUNIS K , RAGHAVENDRA C S . Spray and wait:an efficient routing scheme for intermittently connected mobile networks[A]. Proc of the ACM SIGCOMM Workshop on De-lay-Tolerant Networking[C]. 2005.252-259.
|
[10] |
王恩, 杨永健, 李莅 . DTN 中基于生命游戏的拥塞控制策略[J]. 计算机研究与发展, 2014,51(11):2393-2407. WANG E , YANG Y J , LI L . Game of life based congestion control strategy in delay tolerant networks[J]. Journal of Computer Research and Development, 2014,51(11):2393-2407.
|
[11] |
SU J , CHIN A , POPIVANOVA A ,et al. User mobility for opportunis-tic ad-hoc networking[A]. Proc of the 6th IEEE Workshop on Mobile Computing System and Applications[C]. 2004.41-50.
|
[12] |
韩毅, 方滨兴, 贾焰 等. 基于密度估计的社会网络特征簇挖掘方法[J]. 通信学报, 2012,33(5):38-48. HAN Y , FANG B X , JIA Y ,et al. Mining characteristic clusters:a density estimation approach[J]. Journal on Communications, 2012,33(5):38-48.
|
[13] |
ZENG Z P , WANG J Y , ZHOU L Z ,et al. Coherent closed quasi-clique discovery from large dense graph databases[A]. Proc of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,KDD '06[C]. 2006.797-802.
|
[14] |
林友芳, 王天宇, 唐锐 等. 一种有效的社会网络社区发现模型和算法[J]. 计算机研究与发展, 2012,49(2):337-345. LIN Y F , WANG T Y , TANG R ,et al. An effective model and algo-rithm for community detection in social networks[J]. Journal of Com-puter Research and Development, 2012,49(2):337-345.
|
[15] |
李陟, 李千目, 张宏 . 基于最近社交圈的社交时延容忍网络路由策略[J]. 计算机研究与发展, 2012,49(6):1185-1195. LI Z , LI Q M , ZHANG H ,et al. Closely social circuit based routing in so-cial delay tolerant networks[J]. Journal of Computer Research and Development, 2012,49(6):1185-1195.
|
[16] |
周瑞涛, 曹元大, 胡晶晶 . 基于社区的容迟网络路由方法[J]. 北京理工大学学报, 2012,32(009):996-970. ZHOU T R , CAO Y D , HU J J . Community based routing in delay and tolerance networks[J]. Transaction of Beijing Institute of Technology, 2012,32(009):966-970.
|
[17] |
于海征, 马建峰, 边红 . 容迟网络中基于社会网络的可靠路由[J]. 通信学报, 2010,31(12):21-26. YU H Z , MA J F , BIAN H . Social network-based trustworthy routing in delay tolerant networks[J]. Journal on Communication, 2010,31(12):21-26.
|
[18] |
VELLAMBI B N , SUBRAMANIAN R , FEKRI F ,et al. Reliable and efficient message delivery in delay tolerant networks using rateless codes[A]. Proc of the 1st International Mobisys Workshop on Mobile Opportunistic Networking[C].ACM, 2007.91-98.
|
[19] |
EAGLE N , PENTLAND A S , LAZER D . Inferring friendship network structure by using mobile phone data[J]. Proceedings of the National Academy of Sciences, 2009,106(36):15274-15278.
|
[20] |
王恩, 杨永健, 李莅 . 基于动态半马尔可夫路径搜索模型的 DTN分 簇 路 由 方 法 [EB/OL]. . WANG E , YANG Y J , LI L . A Clustering Routing Method Based on Semi-Markov Process and Path-finding Strategy in DTN[EB/OL]. .
|