Efficient Scheduling of Sensor Activity for Information Coverage in Wireless Sensor Networks

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain disjoint set of information covers (DSIC), which achieves longer network life compared to the set of covers obtained using an exhaustive-greedy-equalized heuristic (EGEH) algorithm proposed in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.