Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets

Abstract

Sensor networks consist of autonomous nodes with limited battery and of base stations with theoretical infinite energy. Nodes can be sleep to extend the lifespan of the network without compromising neither area coverage nor network connectivity. This paper addresses the area coverage problem with equal sensing and communicating radii. The goal is to minimize the number of active sensors involved in coverage task, while computing a connected set able to report to monitoring stations. Our solution is fully localized, and each sensor is able to make decision on whether to sleep or to be active based on two messages sent by each sensor. The first message is a "hello" message to gather position of all neighboring nodes. Then each node computes its own relay area dominating set, by taking the furthest neighbor as the first node, and then adding neighbors farthest to the isobarycenter of already selected neighbors, until the area covered by neighbors is fully covered. The second message broadcasts this relay set to neighbors. Each node decides to be active if it has highest priority among its neighbors or is a relay node for its neighbor with the highest priority.