Energy-efficient k-coverage scheduling algorithm for sensor networks with adjustable sensing range

A dynamic energy efficient scheduling algorithm for k-coverage Wireless Sensor Networks with adjustable sensing range has been proposed in this study. These types of sensors require a minimal coverage range setting to reduce the utilization of energy. In our proposed algorithm, each sensor utilizes the minimum feasible sensing range without affecting the network coverage; on the other hand, the activated sensors are able to cover the same area if they are activated with their maximum sensing range. Outcomes of the experiments have revealed that, the algorithm proposed in this study has reduced the cost of sensing energy of all sensors, without affecting the network coverage, and furthermore, the power has been effectively distributed among the network sensors, and lifetime of the network has been successfully extended.