感知受限的移动传感器节点扫描覆盖优化算法  

Sweep coverage optimization algorithm for mobile sensor node with limited sensing

作　　者：神显豪[1] 李军[1] 奈何 

机构地区：[1]广西高校嵌入式技术与智能信息处理重点实验室(桂林理工大学),广西桂林541004

出　　处：《计算机应用》2017年第1期60-64,102,共6页journal of Computer Applications

基　　金：国家自然科学基金资助项目(E050603);广西高等学校科研项目(YB2014157);广西自然科学基金资助项目(2015GXNSFBA139254)~~

摘　　要：移动无线传感器网络(WSN)的应用中,因为传感器节点的感知范围受限,其覆盖分析就是一个针对目标区域的扫描覆盖问题。提出了一种基于多目标优化的扫描覆盖算法。在目标区域中,采用双目标优化策略对单个移动传感器节点进行路径规划,一方面使节点的覆盖面最大化,另一方面使扫描覆盖的路径最短。仿真实验在含有障碍物和不含障碍物的情况下进行,与多节点的编队覆盖算法相比,所提算法在适度降低覆盖率的情况下,可大幅降低移动能耗。In the applications of mobile Wireless Sensor Network （WSN）, since the sensing range of the sensor nodes is limited, the coverage analysis is a scan coverage problem for the target area. In this paper, a new scan coverage algorithm based on multi-objective optimization was proposed. In the target area, the double objective optimization strategy was used on path planning for a single mobile sensor node, which could maximize the coverage of the node and make scan coverage path to the shortest. Simulation experiments were carried out under the conditions with obstacles and without obstacles. Compared with the formation coverage algorithm for multiple nodes, the proposed algorithm can significantly reduce the mobile energy consumption while moderately reducing coverage rate.

关 键 词：移动传感器节点 扫描覆盖 双目标优化 覆盖率 能耗 

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