基于节点相遇时间估计的DTMSN路由算法-中国科技论文在线.PDFVIP

中国科技论文在线 基于节点相遇时间估计的DTMSN 路由 算法 1 1 2,3 1 刘玉冲 ，林锋 ，李文藻 ，周激流 （1. 四川大学计算机学院，成都610065； 2. 成都信息工程大学通信工程学院，成都610225; 3.四川大学电子信息学院,成都 610065 ） 摘要：针对行人场景下节点相遇具有一定规律性的情况，提出了一种基于节点相遇时间估计 的容延迟移动传感器网络路由算法EEBR ，以优化行人场景下的网络性能。通过对节点间历 史相遇信息和节点间相互关系的分析，设计了一种实时估计普通节点和汇聚节点相遇概率的 方法，并对发送缓冲区转发机制进行了设计。基于EEBR 的行人场景数据集下的仿真结果表 明，与传统的路由算法相比，EEBR 算法的消息投递成功率、平均投递延迟和网络负载等关 键指标更优。 关键词：移动通信；无线传感器网络；容延迟移动传感器网络；路由算法 中图分类号：TN929.5 文献标志码：A Routing algorithm for DTMSN based on estimation of encounter time between nodes 1 1 2, 3 1 LIU Yuchong , LIN Feng , LI Wenzao , ZHOU Jiliu (1. College of Computer Science, Sichuan University, Chengdu 610065, China； 2. College of Communication Engineering, Chengdu University of Information Technology, Chengdu 610225, China; 3.College of Electronics and Information Engineering, Sichuan University, Chengdu 610065, China) Abstract: For the case of pedestrian scene that nodes encounter with certain regularity, a new Delay Tolerant Mobile Sensor Networks (DTMSN) routing algorithm EEBR was proposed based on the estimation of encounter time between nodes to optimize network performance. Through the encounter history and the analysis of the relationship between nodes, a real-time estimation method of the encounter probability between normal nodes and sink node was presented, and the buffer forwarding mechanism was designed. Simulation results for the pedestrians’ scene data set show that EEBR algorithm can achieve better performance than other DTMSN routing algorithms in te