Grid coverage for surveillance and target location in distributed sensor networks
Grid coverage for surveillance and target location in distributed sensor networks
复制标题
DOI：
10.1109/tc.2002.1146711
复制
发表时间：
2002-12-01
影响因子：
3.7
通讯作者：
Cho, EC
中科院分区：
文献类型：
--
作者：
Chakrabarty, K;Iyengar, SS;Cho, EC
我们提出了新的网格覆盖策略，在分布式传感器网络中进行有效的监视和目标定位。我们将传感器场表示为点（坐标）的网格（二维或三维），并使用术语目标定位来指代在任何时刻将目标定位在网格点处的问题。首先，我们提出了一个整数线性规划（ILP）的解决方案，最大限度地减少传感器的成本，传感器领域的完全覆盖。我们使用一个有代表性的公共领域求解器来解决ILP模型，并提出了一种分而治之的方法来解决大型问题实例。然后，我们使用识别代码的框架，以确定传感器放置的唯一目标位置。我们提供了传感器数量的编码理论界限，并提出了确定它们在传感器场中的位置的方法。我们还表明，基于网格的传感器放置为单个目标提供了渐近完整的（明确的）多个目标在网格中的位置。
We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimensional) of points (coordinates) and use the term target location to refer to the problem of locating a target at a grid point at any instant in time. We first present an integer linear programming (ILP) solution for minimizing the cost of sensors for complete coverage of the sensor field. We solve the ILP model using a representative public-domain solver and present a divide-and-conquer approach for solving large problem instances. We then use the framework of identifying codes to determine sensor placement for unique target location. We provide coding-theoretic bounds on the number of sensors and present methods for determining their placement in the sensor field. We also show that grid-based sensor placement for single targets provides asymptotically complete (unambiguous) location of multiple targets in the grid.