传感技术学报2016，Vol.29Issue(2)：264-270,7.DOI:10.3969/j.issn.1004-1699.2016.02.019
基于全局时延最小化的移动Sink数据收集算法
Data Gathering Algorithm for Mobile Sink Based on the Global Delivery Latency Minimization
摘要
Abstract
For the latency problem brought by the movement of Sink node,this paper presents a mobile Sink data gathering 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 the RP 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/汇聚节点Key words
wireless sensor networks/delivery latency/mobile Sink/rendezvous point分类
计算机与自动化引用本文复制引用
常捷,张灵,曾碧..基于全局时延最小化的移动Sink数据收集算法[J].传感技术学报,2016,29(2):264-270,7.基金项目
广东省产学研合作专项项目(2014B090904080)；广州市科技计划项目(2014J4100228) （2014B090904080）
