Coverage and connectivity protocol for Wireless Sensor Networks

A fundamental challenge in Wireless Sensor Networks (WSNs) is the coverage problem. To solve this problem, several coverage solutions exist in literature based on different methods (protocol, geometrical and analytical solutions). In this paper, we suggest a solution to solve the problem of coverage and connectivity, called Connected Cover Set based on IDentity of node (CCSID). The idea was to adapt a concept from graph theory of connected dominating sets having minimum cardinality MCDS, to build cover sets. The solution CCSID divides the set of deployed nodes into subsets. In each subset, a minimum number of active nodes are selected to ensure coverage and connectivity. Simulation results show that CCSID achieves a high coverage ratio and uses fewer active nodes.