基于节点紧密效应的容迟网络路由算法  

A node compact effect-based routing algorithm in DTNs

作　　者：任璐 王青山[1] 王琦[1] 章翔 REN Lu;WANG Qingshan;WANG Qi;ZHANG Xiang(School of Mathematics, Hefei University of Technology, Hefei 230601, China)

机构地区：[1]合肥工业大学数学学院,安徽合肥230601

出　　处：《合肥工业大学学报（自然科学版）》2020年第11期1487-1491,共5页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(61571179)。

摘　　要：容迟网络(disruption tolerant networks,DTNs)是一类具有节点间间歇连接特征的新型网络,其一般情况下不存在端到端路径的特点而导致传统的路由算法很难被应用在容迟网络中。文章根据节点与其邻居节点、次邻居节点(邻居节点的邻居节点)之间的联系情况,提出了一种基于节点紧密效应的路由(node compact effect-based routing,NCER)算法。在设计该路由算法时,首先推导出节点与次邻居节点之间的间接相遇时间间隔,并通过节点间历史相遇情况得到节点间相遇概率,并利用矩阵知识推导出节点的概率性相遇时间间隔矩阵,由此定义节点的紧密效应标准来决定是否选择1个节点作为数据转发节点。仿真实验结果表明,与Epidemic算法、Prophet算法相比,NCER算法可以降低网络资源的消耗,并明显提高数据包的传递率。Disruption tolerant networks(DTNs)are new type of networks with intermittent connections between nodes.The characteristics of the lack of end-to-end paths make the traditional routing algorithms difficult to be applied directly in DTNs.Based on the connections between a node and its neighbor nodes and the secondary neighbor nodes(the neighbor nodes of its neighbor nodes),this paper proposes a node compact effect-based routing(NCER)algorithm in DTNs.When designing the routing algorithm,the indirect encounter time interval between the node and the secondary neighbor nodes is firstly derived.Then,the probability of encounter between nodes is obtained through their historical encounters.Furthermore,the matrix knowledge is used to derive the probabilistic interval matrix of the nodes,and then the compact effect metric of node is defined,which can be used to decide whether to choose a node as the relay node.The simulation results show that compared with Epidemic algorithm and Prophet algorithm,the proposed algorithm can reduce the consumption of network resources and significantly improve the delivery ratio of message.

关 键 词：容迟网络 路由算法 消息转发 邻居节点 相遇时间间隔 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]