Multi-objective Optimization of Barrier Coverage with Wireless Sensors
Multi-objective Optimization of Barrier Coverage with Wireless Sensors
复制标题
DOI：
10.1007/978-3-319-15892-1_38
复制
发表时间：
2015-03
期刊：
影响因子：
--
通讯作者：
Xiao Zhang;Yu Zhou;Qingfu Zhang;V. Lee;Minming Li
中科院分区：
文献类型：
--
作者：
Xiao Zhang;Yu Zhou;Qingfu Zhang;V. Lee;Minming Li
屏障覆盖的重点是检测试图穿越特定区域的入侵者，在这些场景中，有限功率的传感器应该以不确定的方式远程分布。在本文中，我们考虑的情况下，可调范围和几个汇聚节点的传感器部署，形成一个虚拟的传感器屏障监测带状区域和收集事件数据。该问题考虑到三个相关的目标：最小化功耗，同时满足障碍覆盖的要求，最小化的主动传感器的数量（可靠性）和最小化的主动传感器和最近的汇聚节点（数据收集的效率）之间的传输距离。这三个目标在某种程度上是相互冲突的。提出了一种具有局部搜索方法的问题特定MOEA/D，用于寻找最优折衷解，并与经典算法进行了比较。实验结果表明，膝盖区域的存在，这些膝盖区域可以提供最好的可能的权衡决策者。
Barrier coverage focuses on detecting intruders in an attempt to cross a specific region, in which limited-power sensors in these scenarios are supposed to be distributed remotely in an indeterminate way. In this paper, we consider a scenario where sensors with adjustable ranges and a few sink nodes are deployed to form a virtual sensor barrier for monitoring a belt-shaped region and gathering incidents data. The problem takes into account three relevant objectives: minimizing power consumption while meeting the barrier coverage requirement, minimizing the number of active sensors (reliability) and minimizing the transmission distances between active sensors and the nearest sink node (efficiency of data gathering). It is shown that these three objectives are conflicting in some degree. A Problem Specific MOEA/D with local search methods is proposed for finding optimal tradeoff solutions and compared with a classical algorithm. Experimental results indicate that knee regions exist, and these knee regions may provide the best possible tradeoff for decision makers.