基于节点相似性的容迟网络概率路由算法

发布时间：2018-04-01 19:12

本文选题：容迟网络　切入点：路由算法　出处：《计算机工程》2016年09期

【摘要】：在容迟网络(DTN)中节点密度稀疏和节点移动导致网络拓扑结构频繁割裂,消息在传递时无法始终存在一条端到端的连通路径,因此DTN路由算法通常采用存储-携带-转发机制将消息从源节点投递至目的节点。针对上述情况,结合节点间相似性与消息生存时间内节点到达目的节点的概率值,提出一种基于节点相似性的概率路由算法(SBPR),包含消息复制与消息转发2种策略。当持有消息的节点与其他节点相遇时,将消息复制给消息节点相似性较小的节点以提高消息投递率。对于与其相似性较大的邻居节点,如果该邻居节点到达目的节点的概率更大,将消息转发至邻居节点以节省网络资源消耗。实验结果表明,在节点缓存不足的情况下,SBPR在消息投递率、网络负载率及消息丢包数等方面的表现均优于Epidemic,Prophet和First Contact路由算法。
[Abstract]:In Delay-tolerant Network (DTNN), node density sparsity and node movement result in frequent fragmentation of network topology, and there is not always an end-to-end connected path when the message is delivered. Therefore, DTN routing algorithm usually uses the mechanism of storage, carrying and forwarding to deliver messages from the source node to the destination node. In view of the above situation, combining the similarity between the nodes and the probability of the nodes arriving at the destination node within the message lifetime. A probabilistic routing algorithm based on node similarity is proposed, which includes two strategies: message replication and message forwarding. The message is copied to a node with less similarity to improve the message delivery rate. For a neighbor node with greater similarity, if the neighbor node has a higher probability of reaching the destination node, In order to save network resource consumption by forwarding messages to neighbor nodes, the experimental results show that SBPRs outperform EpidemicProphet and First Contact routing algorithms in the aspects of message delivery rate, network load rate and number of packets dropped.
【作者单位】：青岛大学信息工程学院;南京邮电大学海外教育学院;
【基金】：国家自然科学基金资助项目(61502261,61572457,61379132) 山东省自然科学基金资助项目(ZR2013FQ022) 山东省教育厅高校科技计划基金资助项目(J14LN85)
【分类号】：TN915.0

【相似文献】