基于全局时延最小化的移动Sink数据收集算法  

Data Gathering Algorithm for Mobile Sink Based on the Global Delivery Latency Minimization

作　　者：常捷[1] 张灵[1] 曾碧[1] 

机构地区：[1]广东工业大学计算机学院,广州510006

出　　处：《传感技术学报》2016年第2期264-270,共7页Chinese Journal of Sensors and Actuators

基　　金：广东省产学研合作专项项目(2014B090904080);广州市科技计划项目(2014J4100228)

摘　　要：针对Sink节点移动所带来的时延问题,提出了一种基于最优路径的移动Sink数据收集方案OPDG(Data Gathering Based on Optimal-Path)。首先由MWHA(Minimum Weighted Heuristic Algorithm)算法得到汇聚节点RP(Rendezvous Point)的集合,然后根据这些RP节点求出移动Sink的最佳驻留点集合,最后求出经过驻留点的最短路径。Sink沿着这条路径周期性采集数据。通过NS-2中大量的仿真实验结果表明,与已有算法相比,OPDG算法能最大限度的减小时延,延长网络的生命周期。For the latency problem brought by the movement of Sink node,this paper presents a mobile Sink datagathering program based on optimal path（OPDG）. Firstly,a set of rendezvous points（RP）are obtained by MWHA（Minimum Weighted Heuristic Algorithm）algorithm. Then a best set of access points are selected according to theRP set. Finally,the shortest path is found across the access points. The mobile Sink will travel along this path peri-odically and collect data at each access point. Lots of simulation results show that compared with existing algorithm,OPDG algorithm can shorten the delivery latency and prolong the network lifetime.

关 键 词：无线传感器网络 时延 移动SINK 汇聚节点 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]