容迟网络中基于节点间亲密度的分组路由方法

doi:10.3969/j.issn.1000-436x.2014.12.009

Abstract

Abstract:

Through analyzing the moving law of nodes,the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference.Take topological trim according to the weight of edges and dig out groups of nodes which have higher inti-macy degree.And also improve the spray and wait routing protocol according to the group of source and destination nodes.Then put forward a packet-based routing algorithm in DTN based on the intimacy between nodes.Simulation result shows that this routing algorithm could effectively increase the delivery ratio and reduce delay.

Key words: DTN, social network, intimacy, packet-based

En WANG,Yong-jian YANG,Wei-dan ZHAO,Lin-lu LIU. Packet-based routing algorithm in DTN based on the intimacy between nodes[J]. Journal on Communications, 2014, 35(12): 70-77.

Figures/Tables 12

References 20

[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]. .

Metrics

Recommended 0

No Suggested Reading articles found!

参数	值
仿真时间/s	5 000
仿真区域大小	4 500 m×3 400 m
节点数量	60、80、100、120、140
停留时间/s	0～120
传输速度/(kbit·s^?1)	250
传输范围/m	50
缓存大小/MB	10、20、30、50、100
消息产生时间间隔	5,15]、[15,25]、[25,35]、[35,45]
TTL	300

Packet-based routing algorithm in DTN based on the intimacy between nodes

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 12

References 20

Related Articles 15

Metrics

Recommended 0

[1]	Xuan WANG, Yu ZHANG, Junfeng ZHOU, Ziyang CHEN. Influence maximization algorithm based on social network [J]. Journal on Communications, 2022, 43(8): 151-163.
[2]	Tao PENG, Wentao ZHONG, Guojun WANG, Entao LUO, Jinbo XIONG, Yining LIU, Wang Hao. Privacy-preserving precise profile matching in mobile social network [J]. Journal on Communications, 2022, 43(11): 90-103.
[3]	Zhen LIU,Na’na WANG,Xiaodong WANG,Yongqi SUN. Spectral clustering and embedding-enhanced POI recommendation in location-based social network [J]. Journal on Communications, 2020, 41(3): 197-206.
[4]	Qiuyang GU, Chunhua JU, Gongxing WU. Social network link prediction method based on subgraph evolution and improved ant colony optimization algorithm [J]. Journal on Communications, 2020, 41(12): 21-35.
[5]	Jing CHEN,Ziyi QI. Research on social network influence maximization algorithm based on time sequential relationship [J]. Journal on Communications, 2020, 41(10): 211-221.
[6]	Junlei BI,Zhiyuan LI. Time-variant interest community based query message routing algorithm in opportunity social network [J]. Journal on Communications, 2019, 40(9): 86-94.
[7]	Fenghua LI,Zhe SUN,Ben NIU,Jin CAO,Hui LI. Privacy-preserving photo sharing framework cross different social network [J]. Journal on Communications, 2019, 40(7): 1-13.
[8]	Haiping HUANG,Kai WANG,Xiong TANG,Dongjun ZHANG. Differential privacy protection scheme based on edge betweenness model [J]. Journal on Communications, 2019, 40(5): 88-97.
[9]	Xiaomeng WANG, Binxing FANG, Hongli ZHANG, Xing WANG. TSL:predicting popularity of Facebook content based on tie strength [J]. Journal on Communications, 2019, 40(10): 1-9.
[10]	Guanghui YAN, Meng ZHANG, Hao LUO, Shikui LI, Ting LIU. Identifying vital nodes algorithm in social networks fusing higher-order information [J]. Journal on Communications, 2019, 40(10): 109-118.
[11]	Yu FU, Yihan YU, Xiaoping WU. Differential privacy protection technology and its application in big data environment [J]. Journal on Communications, 2019, 40(10): 157-168.
[12]	Yancui SHI,Yuan WANG,Qing ZHAO,Xiankun ZHANG. Research status of community detection based on local expansion [J]. Journal on Communications, 2019, 40(1): 149-162.
[13]	Lu DENG,Yan JIA,Binxing FANG,Bin ZHOU,Tao ZHANG,Xin LIU. Performance analysis of topic detection algorithms in distributed environment [J]. Journal on Communications, 2018, 39(8): 176-184.
[14]	Yong ZENG,Lingjie ZHOU,Zhongyuan JIANG,Zhihong LIU,Jianfeng MA. Security analysis of weighted network anonymity based on singular value decomposition [J]. Journal on Communications, 2018, 39(5): 23-33.
[15]	Weihao LI,Sheng DING,Jiajie MENG,Hui LI. Spatio-temporal aware privacy-preserving scheme in LBS [J]. Journal on Communications, 2018, 39(5): 134-142.