| DTN中基于时间因素的拥塞感知路由算法 |
| |
| 引用本文： | 良梓,任哲坡,吴晓军.DTN中基于时间因素的拥塞感知路由算法[J].计算机工程与应用,2015,51(5):97-101. |
| |
| 作者姓名： | 良梓 任哲坡 吴晓军 |
| |
| 作者单位： | 1.陕西师范大学 计算机科学学院，西安 710062
2.西北工业大学 自动化学院，西安 710072 |
| |
| 基金项目： | 国家自然科学基金面上项目(No.11372167)；陕西自然科学基金重点项目(No.2014JZ021)；陕西省“重点科技创新团队”项目资助(No.2014KTC-18)。 |
| |
| 摘 要： | 为了解决散发等待路由算法中，中继节点的选择存在盲目性的问题，提出一种基于时间因素的拥塞感知路由算法CARA。该算法考虑时间因素对转发概率的影响，改进Prophet算法中的转发概率。根据改进的转发概率选择中继节点，动态分配报文转发数目，并以拥塞感知自适应的方式实现拥塞控制的优化。仿真结果表明，CARA算法和网络投递率及延迟表现最好的CS-DTN算法相比，投递率提高了10.21%，延迟降低了7.05%，同网络开销表现最好的BSW算法相比，开销降低了8.16%。
|
| 关 键 词： | 延迟容断网络（DTN） 时间因素 转发概率 拥塞感知 |
Congestion-aware routing algorithm based on time factor in DTN |
| |
| LIANG Zi,REN Zhepo,WU Xiaojun.Congestion-aware routing algorithm based on time factor in DTN[J].Computer Engineering and Applications,2015,51(5):97-101. |
| |
| Authors: | LIANG Zi REN Zhepo WU Xiaojun |
| |
| Affiliation: | 1.School of Computer Science, Shaanxi Normal University, Xi’an 710062, China
2.College of Automation, Northwestern Polytechnical University, Xi’an 710072, China |
| |
| 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. |
| |
| Keywords: | Disruption Tolerant Network(DTN) time factor forwarding probability congestion-aware |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
