A New Base Station Deployment Method for WRSN Based on Greedy Algorithm

Wireless rechargeable sensor networks (WRSNs) is developed to resolve the problem of power supplies in wireless sensor networks by using wireless power transmission technologies. Minimizing the number of the charging base stations is important to reduce the cost of deploying the WRSNs. An algorithm without the restriction in existing algorithms (like requiring to fix the base stations to some grid points and without the specific location information of the base stations) is proposed in this paper. The proposed double-circle greedy algorithm uses the minimum greedy circle coverage idea to search an optimized deployment of the base stations. The simulated results show the advantages of lower number of base stations under the comparison with the existing algorithms.