An Energy Efficient Coverage Method for Clustered Wireless Sensor Networks

an important issue in WSN is the regional covering. A coverage algorithm should be able to solve this issue by considering the power consumption to improve the network lifetime. This requires employing the lowest number of sensors. A solution is just to turn on a subset of nodes. This subset should be chosen in such a way to cover the entire region. This can be achieved by partitioning the network nodes and considering a representative for each part in a time slice to perform the responsibilities of all the partition members for full coverage. This will lead to turn on some of the nodes in a time slice rather than all of them. This paper presents a novel algorithm that employs grouping and time scheduling sensor nodes to turn some of them on to cover the entire area. In this algorithm the sensing range of the nodes depends on their energy. The cluster head denotes the sensing range and also turn on time slice of each node by considering node's remained energy and position.