B $$GOP$$: An adaptive algorithm for coverage problems in wireless sensor networks

Abstract

Abstract — To achieve power-efficient monitoring of targets in a terrain covered by a sensor network, it is sensible to divide the sensors into cover sets and make each of these sets responsible for covering the targets for a certain period of time. Generating the maximum number of such cover sets, has been proved to be an NP-complete problem, and thus algorithms producing suboptimal solutions have been proposed. In this paper we propose a centralised heuristic algorithm, that efficiently generates cover sets, each one capable of monitoring all targets. Our simulation findings demonstrate an improvement against existing methods, with results close to the optimal solution. I.