摘要： 针对带有权重目标和返回时间约束的扫描覆盖问题，提出一种基于目标分层和路径分割的区域覆盖算法TLPS。通过分析所有目标的位置和权重信息，将目标抽象成一系列的点目标并计算基站位置，分层提取不同权重的节点，基于贪心策略计算相同层次间点目标集的TSP路径。在此基础上，设计一种针对权重节点的环路分割策略，对TSP路径进行再分割处理以得到最终扫描路径。实验结果表明，相对tcwtp、OSweep等算法，TLPS算法能够在增加少量传感器节点的情况下缩短平均扫描周期，提高目标覆盖效率和路径有效率。

关键词: 无线传感器网络, 扫描覆盖, TSP问题, 目标分层, 路径分割

Abstract: To improve the sweep coverage with weighted targets and constrained return time,this paper proposes a region coverage algorithm,TLPS,based on target layering and path segmentation.The algorithm analyzes the location and weight information of all targets and translate these targets into points.According to the point information,the algorithm calculates the location of the sink and hierarchically extracts weighted targets.For the point target set between the same levels,the TSP path based on the greedy policy is designed.On this basis,a loop segmentation strategy for weight nodes is designed,and TSP paths are re-segmented to obtain the final scan paths.Experimental results show that by adding a small number of sensor nodes,the TLPS algorithm has a shorter average scan period,higher target coverage efficiency and higher path effectiveness rate than tcwtp,OSweep and other algorithms.

Key words: Wireless Sensor Networks(WSNs), sweep coverage, TSP problem, target layering, path segmentation

中图分类号: 

• TP393