An efficient routing algorithm to preserve k-coverage in wireless sensor networks

What is it about?

This paper reviews efficient routing algorithms for preserving k-coverage in a sensor network and then proposes an effective technique for preserving k-coverage and the reliability of data with logical fault tolerance. It is assumed that the network nodes are aware of their residual energy and that of their neighbors.Sensors are first categorized into two groups, coverage and communicative nodes, and some are then re-categorized as clustering and dynamic nodes.

Featured Image

Why is it important?

We try to propose a new heuristic approach for covering the sensors in wireless sensor networks. This approach can apply in real-systems such as navigation in military.