Research On Wireless Rechargeable Sensor Network Planning Based On Greedy Algorithm

The limited power supplies restrict the life and performance of the traditional wireless sensor networks.Wireless rechargeable sensor networks(WRSNs)are developed to get rid of this limitation by using wireless power transmission technologies.In nowadays,many researchers have proposed plenty of static and dynamic charging strategies to improve the charging efficiency of wireless sensor networks,according to whether the charging device is fixed.And they got some good results.However,there are still some disadvantages in the existing investigations.Based on previous research,the energy allocation planning problem of WRSN is analyzed.In this thesis,the research of charging optimization algorithms is carried out for different strategies,and two types of research are studied: base station charging algorithm of static strategy and mobile car charging algorithm of dynamic strategy.The comparison of experiments shows that those proposed algorithms have the advantages of more economical and more efficient.The main ideas of this paper are as follows:(1)The research status at home and abroad of WRSN,wireless power transmission technologies and two types of charging strategies are introduced.(2)One charging base station deployment and positioning algorithm are proposed by using the static method.The problem of charging equipment deployment is transformed into a problem of circle coverage,and an optimal method in geometry is proposed.And then cooperate with the local optimal feature of the greedy algorithm,the entire WRSN can be covered by as few base stations as possible.The simulated results show that the proposed algorithm not only has the advantages on less number of charging base stations,but also gives out the specific locations of the base stations.(3)One mobile charging car planning algorithm for the dynamic charging method are proposed.Compared to the traditional strategies,this new algorithm combines the greedy algorithm and remedies to the Traveling Salesman problem(TSP)which can cut down the general path of the mobile charging car by using dynamic programming greedy algorithm.Analyzed and compared the results of this algorithm,the total moving path was shortened more than 80% in one charging cycle.