Abstract-In overdeployed sensor networks, one approach to conserve energy is to keep only a small subset of sensors active at any instant. In this article, we consider the problem of selecting a minimum size connected K-cover, which is defined as a set of sensors M such that each point in the sensor network is "covered" by at least K different sensors in M, and the communication graph induced by M is connected. For the above optimization problem, we design a centralized approximation algorithm that delivers a near-optimal (within a factor of O(lgn)) solution, and present a distributed version of the algorithm. We also present a communication-efficient localized distributed algorithm which is empirically shown to perform well.
REF have extended the problem further and have considered the selection of a minimum size set of sensor nodes which are connected in such a way that each point inside the target area is covered by at least k sensors.
Connected K-coverage problem in sensor networks
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)
Computer Science