Charging base Stations Deployment Algorithms for Wireless Rechargeable Sensor Networks

Abstract

One of the important problems in wireless rechargeable sensor networks is the deployment of charging base stations. Based on a convergent charging scheme, two new algorithms are proposed, by combining the solution of the Fermat point problem with the advantages of the greedy algorithm. Different from the existing solutions where the charging base stations are restricted on some special locations (like grid points), the charging base stations are more flexible in new algorithms. Instead of setting a charging circle, the specific variation of the power transfer efficiency with distance is used in the new algorithms to optimize the number of the charging base stations more accurately. The simulation results show that for different numbers of sensors, the proposed two algorithms can get a smaller number of base stations. Furthermore, the convex vertices priority algorithm has the advantage of less candidate base stations and consequently less time consuming.