A New Method in Coverage for Wireless Sensor Networks

Abstract

One of the main problems in designing wireless sensor networks is to present a strategy which leads to increasing network lifetime by paying attention to energy resources. One of the most important issues in WSN is covering the region. So, the presented strategy should be able to cover all over the region by using lowest amount of sensor nodes. It is not always necessary that all the network nodes to be turning on, so by using a suitable algorithm, network nodes can be divided into some groups and each group will be in charge of covering its corresponding part of the region by turn on some nodes in some time slices such that full coverage is guaranty. In this paper, we propose a new idea that uses grouping and time scheduling for sensor nodes for turning them on to cover area. According to this method sensing range of all the nodes aren't always same, and it is depending to their remained energy. Cluster head denotes the sensing range and also turn on time slice of each node by considering its remained energy and position. Using the mentioned algorithm leads to energy efficiency for better coverage; consequently it is increasing in network life.