基于节点运动预测的社会性DTN高效路由

发布时间：2018-12-10 08:06

【摘要】：延迟容忍网络是一种缺乏持续连接的新型网络体系结构,采用存储-携带-转发的路由方式进行消息的转发.考虑到节点的特性及运动模式,基于分簇、社会网络的路由协议已成为近年来的一个研究热点.该文分析现有基于分簇、社会网络的路由算法的缺陷及社会网络的特点,提出了一种新型的混合路由算法CS-DTN(ClusteringSocial Delay Tolerant Network):预测节点间的相遇概率并据此对节点进行分簇,簇内根据节点间相遇概率限定消息的副本数量,将消息以二分喷射的方式转发到更可能到达目的节点的中继节点;簇间对节点进行运动预测并结合节点的特性将消息不断地转发到更接近目的节点的中继节点.不同于已有的基于分簇、社会网络的路由算法,CS-DTN从多个角度结合了节点自身及节点间的特性,更考虑了对节点的运动预测,降低了由不必要的消息转发带来的资源浪费,同时也能更高效地将消息投递到目的节点.仿真结果表明CS-DTN较为明显地提升了消息的成功投递率并降低了消息的平均端到端延迟,在缓存足够的前提下,CS-DTN可以实现高达95%的投递率,而在资源有限的情况下也能获得80%以上的投递率.
[Abstract]:Delay-tolerant network is a new network architecture that lacks continuous connection. It uses a storage-port- forward routing method to forward messages. Considering the characteristics and motion patterns of nodes, the routing protocols based on clustering have become a hot topic in recent years. This paper analyzes the defects of the existing routing algorithms based on clustering, social networks and the characteristics of social networks, and proposes a new hybrid routing algorithm, CS-DTN (ClusteringSocial Delay Tolerant Network):, to predict the encounter probability between nodes and cluster the nodes accordingly. According to the probability of meeting between nodes, the message is forwarded to the relay node which is more likely to reach the destination node. The node motion prediction is carried out among clusters and the message is transmitted to the relay node which is closer to the destination node by combining the characteristics of the node. Different from the existing routing algorithms based on clustering and social networks, CS-DTN combines the characteristics of nodes themselves and nodes from many angles, and considers the motion prediction of nodes, thus reducing the waste of resources brought by unnecessary message forwarding. At the same time, the message can be delivered to the destination node more efficiently. Simulation results show that CS-DTN can obviously improve the successful delivery rate of messages and reduce the average end-to-end delay of messages. Under the premise of sufficient cache, CS-DTN can achieve a delivery rate of up to 95%. And in the case of limited resources can also get more than 80% delivery rate.
【作者单位】：天津大学计算机科学与技术系;天津大学通信工程系;
【基金】：国家自然科学基金(61072063,61162003)资助~~
【分类号】：TP393.02

【相似文献】