Cost-Efficient Sensor Placement for Full Coverage of 3D Indoor Space with Moving Obstacles

概要

論文の詳細を見る
In this paper, we tackle the problem to achieve mobile k-coverage of a target indoor space, that is, for arbitrary position of a moving obstacle, any point located in the target monitoring area has a line-of-sight to and is located in the sensing range rs of at least k sensors. We propose a heuristic algorithm for computing a deployment pattern achieving the mobile k-coverage in an arbitrary 3D target space with stationary and moving obstacles, while minimizing the overall deployment cost. In our method, first we provide a sufficient condition for mobile k-coverage: the half-sphere of radius rs centered at a monitoring point bounded by the vertical plane containing the point includes at least k sensor nodes. Based on this condition, we propose a heuristic algorithm that puts at least one sensor node in each π/k+1 spherical wedge for each monitoring point. Using the proposed method, we have computed the sensor nodes position in an existing indoor environment and confirmed that the obtained WSN deployment in the real space accurately achieves mobile k-coverage.
2011-02-28