Abstract
In wireless rechargeable sensor networks (WRSNs), wireless charging stations can recharge the batteries of sensor nodes so that they can operate sustainably. Since wireless charging stations are costly and have limited charging distances, how to deploy the minimal number of charging stations to cover all sensor nodes and satisfy the energy requirements of all sensor nodes are important and challenging issues. This paper proposes a new deploy strategy by taking the number of charging stations and the distance between the sensor node and charging station into account simultaneously. We formulate the proposed strategy into a multi-objective problem and employ a non-dominated sorting genetic algorithm-II (NSGA-II) to solve this problem. We compare the proposed approach to the simulated annealing-based charging algorithm (SABC) and the layoff simulated annealing-based charging algorithm (LSABC) in terms of the number of charging stations and the overall charging power. The simulation results reveal that the overall charging power obtained using the proposed approach is 5% and 8% higher than that obtained using SABC and LSABC approaches. Moreover, the number of charging stations obtained using NSGA-II is 6% and 1% less than that obtained using SABC and LSABC approaches, respectively.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call