A Temporal and Spatial Priority With Global Cost Recharging Scheduling in Wireless Rechargeable Sensor Networks

Wireless power transfer technique provides a new and promising method for alleviating the limited energy capacity problem, thus receiving much attention. However, previous works usually consider temporal, spatial, or both factors of the current selected node greedily without taking the residual moving distance of the remaining nodes into consideration. Surely, it is not easy to precisely estimate the residual moving distance of the remaining nodes before knowing their exact order in the scheduling path. In this work, the authors are the first to propose the concept of the residual moving distance (cost) and create a mathematical model to roughly estimate the cost of a given node set. Moreover, they design a temporal and spatial priority charging scheduling algorithm with additional considering the global cost (TSPG). Simulation results demonstrate that TSPG outperforms earliest deadline first scheduling algorithm and revised earliest deadline first scheduling algorithm. Moreover, the proposed new model for estimating moving distance in the residual area has all relative error below 9%.