Congestion-aware routing algorithm based on time factor in DTN

Computer Engineering and Applications ›› 2015, Vol. 51 ›› Issue (5): 97-101.

Previous Articles Next Articles

Congestion-aware routing algorithm based on time factor in DTN

LIANG Zi1, REN Zhepo2, WU Xiaojun1，2

1.School of Computer Science, Shaanxi Normal University, Xi’an 710062, China
2.College of Automation, Northwestern Polytechnical University, Xi’an 710072, China

Online:2015-03-01 Published:2015-04-08

DTN中基于时间因素的拥塞感知路由算法

良梓1，任哲坡2，吴晓军1，2

1.陕西师范大学计算机科学学院，西安 710062
2.西北工业大学自动化学院，西安 710072

Abstract

Abstract: In order to solve the problem of blindness in choice of relay nodes in spray and wait routing, a routing named CARA based on time factor is proposed in this paper. Considered time’s influence over the forwarding probability, this algorithm improves the forwarding probability of Prophet algorithm. The improved probability chooses relay nodes which dynamically distribute packets, and optimize congestion control by congestion-aware adaptive mechanism. The simulation results show CARA algorithm achieves an improvement in delivery by 10.21% and a reduction in delay by 7.05% compared with CS-DTN algorithm, and realizes a reduction in overhead by 8.16% compared with BSW algorithm.

Key words: Disruption Tolerant Network（DTN）, time factor, forwarding probability, congestion-aware

摘要： 为了解决散发等待路由算法中，中继节点的选择存在盲目性的问题，提出一种基于时间因素的拥塞感知路由算法CARA。该算法考虑时间因素对转发概率的影响，改进Prophet算法中的转发概率。根据改进的转发概率选择中继节点，动态分配报文转发数目，并以拥塞感知自适应的方式实现拥塞控制的优化。仿真结果表明，CARA算法和网络投递率及延迟表现最好的CS-DTN算法相比，投递率提高了10.21%，延迟降低了7.05%，同网络开销表现最好的BSW算法相比，开销降低了8.16%。

关键词: 延迟容断网络（DTN）, 时间因素, 转发概率, 拥塞感知

LIANG Zi1, REN Zhepo2, WU Xiaojun1，2. Congestion-aware routing algorithm based on time factor in DTN[J]. Computer Engineering and Applications, 2015, 51(5): 97-101.

良梓1，任哲坡2，吴晓军1，2. DTN中基于时间因素的拥塞感知路由算法[J]. 计算机工程与应用, 2015, 51(5): 97-101.

[1]	GU Mingxing, HUANG Weijian, HUANG Yuan, SHENG Long, SHEN Chao, ZHANG Mengtian. Collaborative Filtering Recommendation Combining Attribute Clustering and Improving User Similarity [J]. Computer Engineering and Applications, 2020, 56(22): 185-190.
[2]	ZHANG Kaihui, ZHOU Zhiping, ZHAO Weidong. Collaborative Filtering Recommendation Algorithm Combined with CFDP and Time Factor [J]. Computer Engineering and Applications, 2020, 56(15): 80-85.
[3]	WANG Yongkang, YUAN Weihua, ZHANG Zhijun, WEN Peng. Recommendation Algorithm Integrating Time Based Latent Semantic Completion Model with Subgroup Partitioning [J]. Computer Engineering and Applications, 2019, 55(16): 130-137.
[4]	FENG Xupeng1, MA Zhen1, XIE Bo1, LIU Lijun2, HUANG Qingsong2. Microblog topic detection method based on clustering ensemble [J]. Computer Engineering and Applications, 2017, 53(8): 81-86.
[5]	QI Xiangming, SUN Wenxin. Research on pagerank algorithm based on multi-feature factor fusion [J]. Computer Engineering and Applications, 2017, 53(7): 97-103.
[6]	SUN Jianzhi, ZHANG Yingxin, CHEN Dan, HAN Zhongming. Routing scheme of opportunistic network with Epidemic based on priority strategy [J]. Computer Engineering and Applications, 2012, 48(20): 108-111.
[7]	WANG Ke-wen，XIE Fu-ding，ZHANG Yong. Trust model to peer-to-peer network environment based on time decay [J]. Computer Engineering and Applications, 2009, 45(23): 92-94.
[8]	YU Hong-tao¹，ZHANG Jin-hui¹，ZHONG Zheng². Trust model in P2P network based on time factor and punitive measures [J]. Computer Engineering and Applications, 2009, 45(20): 115-117.

Congestion-aware routing algorithm based on time factor in DTN

DTN中基于时间因素的拥塞感知路由算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 8

Recommended Articles

Metrics