基于信息覆盖理论的传感器节点部署方法

Novel sensor placement method based on complete information coverage in sensor networks

传感器网络中,覆盖控制是一个基本的问题。传感器节点既可以随机部署也可以在特定的环境中指定部署。传感器部署在传感区域网格的顶点处,如果信息能够覆盖网格中所有的顶点,此传感器网络为完全信息覆盖。通过研究基于完全信息覆盖理论的传感器节点指定部署,把传感器部署问题转化为受限的优化问题,并提出了一种贪婪算法,目的是在保证覆盖要求的条件下总代价的最小化。计算结果显示该算法不仅能有效的求得高质量的解决方案,而且还能在满足信息覆盖的要求的同时,极大地减少所需传感器的数量。

The sensor placement problem for complete information coverage in a distributed sensor network is studied. Sensors are assumed to be placed on the grid points of a grid in the sensor fields and complete information coverage is claimed if all grid points are information covered. This sensor placement problem is formulated as a constrained optimization problem, where the objective is to minimize the total cost while guaranteeing certain coverage requirement. We propose a greedy algorithm to solve this problem. Computational results show that the proposed algorithm can efficiently obtain a good quality solution and the number of sensors can be greatly reduced for information coverage.