结合节点剩余相遇间隔改进Prophet路由算法  

IMPROVED PROPHET ROUTING ALGORITHM COMBININGRESIDUAL ENCOUNTER INTERVAL OF NODES

作　　者：杨雄飞 刘凤 赵鑫 钱育蓉[1,2,3] Yang Xiongfei;Liu Feng;Zhao Xin;Qian Yurong(College of Software,Xinjiang University,Urumqi 830000,Xinjiang,China;Key Laboratory of Signal Detection and Processing in Xinjiang Uygur Autonomous Region,Urumqi 830000,Xinjiang,China;Key Laboratory of Software Engineering,Xinjiang University,Urumqi 830000,Xinjiang,China)

机构地区：[1]新疆大学软件学院,新疆乌鲁木齐830000 [2]新疆维吾尔自治区信号检测与处理重点实验室,新疆乌鲁木齐830000 [3]新疆大学软件工程重点实验室,新疆乌鲁木齐830000

出　　处：《计算机应用与软件》2023年第11期111-117,共7页Computer Applications and Software

基　　金：国家自然科学基金项目(61966035);国家自然科学基金联合基金项目(U1803261);数据驱动的中俄云计算共享平台建设项目(2020E01023);自治区研究生创新项目(XJ2019G072)。

摘　　要：在对Prophet路由协议研究的基础上,利用节点相遇间隔时间具有指数分布的特性提出一种结合节点剩余相遇间隔改进Prophet路由算法-PRREI(Prophet routing with residual encounter interval of nodes)。该算法在选择中继节点时,充分考虑了相遇节点与目的节点到下次相遇时,在剩余相遇时间内相遇的概率,使得相遇概率值估算既有动态性又有时效性。此外,引入了动态缓冲区管理策略,利用消息的剩余生存时间对消息的重要性进行度量来确定消息转发和删除的优先级,避免网络拥塞。结果表明,该算法能有效提高投递率,降低了时延和传输开销。Based on the study of Prophet routing protocol,Prophet routing with residual encounter interval of nodes(PRREI)is proposed by utilizing the characteristic of exponential distribution of node encounter interval.When selecting relay nodes,the algorithm took into full account the probability of meeting between the meeting node and the destination node in the remaining meeting time until the next meeting,which made the estimation of the probability of meeting both dynamic and time-efficient.In addition,a dynamic buffer management policy was introduced to measure the importance of the message by using the remaining survival time of the message to determine the forwarding priority and delete priority of the message to avoid network congestion.The results show that the algorithm can effectively improve the delivery rate and reduce the delay and transmission overhead.

关 键 词：机会网络 节点相遇间隔 指数分布 缓存管理 PROPHET 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]