基于节点接触频率和持续时间率的数据转发算法  

A contact frequency and time ratio-based data forwarding algorithm

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

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

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

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

摘　　要：文章从节点间的联系情况出发,提出了一种基于节点接触频率和持续时间率的数据转发(contact frequency and time ratio-based data forwarding,CFTDF)算法。其主要思想是利用节点历史相遇信息来预测未来节点接触频率和持续时间率,以此定义节点间的活性,并根据相遇节点分别与目的节点之间活性值大小来决定数据转发节点的选择。仿真结果表明:与Epidemic算法相比,该文所提出的CFTDF算法明显地降低数据包的拷贝数目;与间接概率转发(probability-inferred forwarding,PIF)算法相比,CFTDF算法可减少数据包的传递延迟和数据包的拷贝数目。In view of contacts made by the nodes,a contact frequency and time ratio-based data forwarding(CFTDF)algorithm is proposed in delay tolerant networks(DTN).Its main idea is predicting the future contact frequency and time ratio between two nodes based on their historic encounters,defining the activity between nodes based on their contact frequency and time ratio,and determining whether or not a node is a relay node by the activities with the destination of the encounter nodes.The experimental results show that compared with Epidemic algorithm,the proposed CFTDF algorithm can obviously reduce the number of copies,and compared with the probability-inferred forwarding(PIF)algorithm,the proposed CFTDF algorithm can reduce the delivery delay and the number of copies.

关 键 词：数据转发算法 拷贝数目 接触频率 接触时间率 传递延迟 

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