Coverage-Aware Recharging Scheduling Using Mobile Charger in Wireless Sensor Networks

Abstract

Energy recharging in wireless rechargeable sensor networks (WRSNs) has acquired much attention in recent years. In literature, many recharging path construction algorithms have been proposed. Most of them considered that all sensors are equally important and designed algorithms to increase the number of recharged sensors or decrease the path length of the mobile charger. However, different sensors have different coverage contributions. Recharging the sensors with larger coverage contribution can achieve better surveillance quality. The proposed recharging scheduling algorithm is divided into three phases, including the Initialization, Recharging Scheduling and Path Construction Phases. In the second phase, this paper proposed two recharging scheduling algorithms, namely the Cost-Effective (CE) algorithm and Cost-Effective with Considerations of Coverage and Fairness ( $C^{2}F$ ) algorithm. The proposed two algorithms construct paths for the mobile charger and select the recharging sensors based on the higher weight in terms of larger coverage contribution and smaller path cost. Performance results show that the CE and $C^{2}F$ algorithms yield better performance in terms of the fairness of recharging, recharging stability and coverage ratio, as compared with the existing studies.

Keywords

• Mobile charger
• recharging
• coverage
• wireless sensor networks
• ping-pong effect