关键词: 无线传感器网络 连通K覆盖 近似算法

Abstract:

One fundamental issue in wireless sensor networks is coverage control. Using coverage control, the space resources of networks are optimally utilized, and the monitoring and transfer are done better. As one of the hotspots in coverage control, the connected k-coverage problem involves how to activate   some connected sensors from lots of randomly deployed ones to k -cover all the targets, where each target point should be within the sensing range ofk o  r more activated sensors. In this paper, the system model and evaluation metrics of the connected k -coverage scheme are analyzed. And some classic appr  oximation algorithms are introduced and compared. Finally, some future directions of the connected k -coverage problem are pointed out.

Key words: wireless sensor network, connected k -coverage, approximation algorithm