Efficient Scheduling for Target Coverage in Energy Harvesting Wireless Sensor Network

Abstract

A Wireless Sensor Network (WSN) is a group of a fixed number of sensor nodes that are used for monitoring and transmitting data for a particular target to a base station. One major caveat of WSN is its limited time availability due to the finite energy capacity of the sensor nodes deployed on any flat surface. This can lead to network unavailability in practical scenarios where the sensor nodes cannot be easily recharged or replaced. Hence, researchers come up with Energy Harvesting Sensor Networks that use Environmental energy to recharge. An algorithm for switching and scheduling written for a typical WSN is not feasible because of the new charging factors. This increases the demand for a scheduling algorithm that considers various energy parameters like energy consumption and recharge rates. Therefore, we propose a novel algorithm that provides the set of active nodes for all target points in the network and therefore improves the network lifetime.