论文部分内容阅读
针对容迟网络(DTN)中多副本消息传递造成网络资源浪费的问题,提出了一种基于概率和新鲜度的梯度路由(PFG)算法.该算法通过概率梯度和新鲜度梯度来构建目标节点的历史轨迹与目标节点信号覆盖所形成的势场.在节点相遇时,将消息传递给更新鲜、概率更高的节点,尽力避免网络资源的浪费.仿真实验结果表明,PFG路由算法在满足相同消息传递完成率和消息平均时延的条件下,可减少消息传递的副本数,提高系统性能.
Aiming at the waste of network resources caused by multi-copy messaging in tolerant networks (DTNs), a gradient routing (PFG) algorithm based on probability and freshness is proposed in this paper, which constructs the target nodes by using the gradient of probability and the gradient of freshness The historical track and the target node cover the formed potential field.When the nodes meet, the message is passed on to the newer and higher probability nodes, trying to avoid the waste of network resources.The simulation results show that when the PFG routing algorithm satisfies the same message Transfer completion rate and average message delay conditions, can reduce the number of copies of the message delivery, improve system performance.