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

Abstract: In this paper, we are concerned with algorithms for deployed sensor nodes over a long period of time (e.g., monischeduling the sensing activity of sensor nodes that are deployed toring the radiation level or temperature of a source at a given to sense/measure point-targets in wireless sensor networks using location in a remote/inaccessible area). The intensity of such a information coverage. Defining a set of sensors which collectively physical quantity to monitor typically decays with distance. A can sense a target accurately as an information cover, we propose target is said to be 'covered ' if a sensor individually (or a set of an algorithm to obtain Disjoint Set of Information Covers (DSIC), sensors collectively) can measure (i.e., sense) the target with which achieves longer network life compared to the set of certain acceptable accuracy. A set of nodes which collectively covers obtained using an Exhaustive-Greedy-Equalized Heuristic can sense a target in the network with acceptable accuracy is (EGEH) algorithm proposed recently in the literature. We also referred to as a cover for that target. In the case of multiple present a detailed complexity comparison between the DSIC and targets in the network, a set of nodes which together can EGEH algorithms. sense all the targets in the network with acceptable accurac