| 摘要: |
| 综合利用节点物理状态信息（位置和速度矢量信息）和社会关系信息（历史相遇信息），提出一种多信息融合的概率路由算法（PRMF）。该算法依据节点间距离的远近程度动态调整两类信息在预测相遇关系中的权重，以选择合适的信息来计算传输概率，并依据传输概率的大小选择转发节点。另外，还引入有效的分组副本控制和分组散播策略，并结合预测信息改进了节点缓存管理方法。仿真结果表明：与现有的几种路由算法相比，PRMF保持了较低的平均开销，同时具有最高的投递率和最小的平均延迟。 |
| 关键词: 延迟容忍网络 路由协议 多信息融合 传输概率 队列管理 转发节点 |
| DOI： |
|
| 基金项目:国家自然科学基金资助项目(61371091) |
|
| An improved probabilistic routing algorithm based on multi-information fusion in delay tolerant networks |
| WANG Xu,HE Rong-xi |
| () |
| Abstract: |
| With an integrated utilization of nodes’physical status information and social relationship information,i.e.,position and velocity vector information and historical encounter information,a probabilistic routing algorithm based on multi-information fusion,called PRMF,is proposed for delay tolerant networks(DTN)in this paper.According to the relative distance from a node to the destination node,PRMF dynamically adjusts the weighting factor to select the appropriate information for calculation of the node’s delivery probability which gives guidance to forwarder selection.In addition,an effective strategy for packet copy control and packet spreading is also introduced in PRMF to improve the queue management method by combining with the former predictive information.The simulation results show that PRMF can have not only a relatively small average overhead but also a higher packet delivery rate and a lower delivery delay than other routing algorithms. |
| Key words: delay tolerant network(DTN) routing protocol multi-information fusion delivery probability queue management forwarding node |
《电讯技术》编辑部 