基于节点相遇时间估计的DTMSN路由算法  

Routing algorithm for DTMSN based on estimation of encounter time between nodes

作　　者：刘玉冲 林锋[1] 李文藻[2,3] 周激流[1] 

机构地区：[1]四川大学计算机学院,成都610065 [2]成都信息工程大学通信工程学院,成都610225 [3]四川大学电子信息学院,成都610065

出　　处：《中国科技论文》2016年第8期860-864,共5页China Sciencepaper

基　　金：高等学校博士学科点专项科研基金资助项目(20110181130007);国家自然科学基金资助项目(61272448);川大-泸州战略合作项目资助项目(2013CDLZ-S07);成都信息工程大学院选基金资助项目(CRF201501)

摘　　要：针对行人场景下节点相遇具有一定规律性的情况,提出了一种基于节点相遇时间估计的容延迟移动传感器网络路由算法(EEBR),以优化行人场景下的网络性能。通过对节点间历史相遇信息和节点间相互关系的分析,设计了一种实时估计普通节点和汇聚节点相遇概率的方法,并对发送缓冲区转发机制进行了设计。基于EEBR的行人场景数据集下的仿真结果表明,与传统的路由算法相比,EEBR算法的消息投递成功率、平均投递延迟和网络负载等关键指标更优。For the case of pedestrian scene that nodes encounter with certain regularity ,a new delay tolerant mobile sensor net-works （DTMSN） routing algorithm EEBR was proposed based on the estimation of encounter time between nodes to optimize net-work 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 terms of message delivery ratio ,average delivery delay and network transmission over-head .

关 键 词：移动通信 无线传感器网络 容延迟移动传感器网络 路由算法 

分 类 号：TN929.5[电子电信—通信与信息系统]