Wireless Charging Optimization Algorithms For Wireless Rechargeable Sensor Networks

The development of wireless charging technology provides a solution to the problem of energizing the sensor networks.In the Wireless Rechargeable Sensor Network(WRSN),one important issue is the charging planning.In recent years,many scholars have proposed a number of dynamic and static charging strategies to improve the charging efficiency of sensor networks based on whether the charging base station can move or not.The dynamic charging strategy is greatly affected by the distributed terrain of the sensors,and there are fewer available scenes in practice.In the study of existing static charging strategies,the charging base stations are limited to certain fixed areas,and the method of calculating the specific deployment location of the base station is not given.Therefore,there are still many shortcomings in the existing researches.In this paper,the charging deployment problem of wireless rechargeable sensor networks is analyzed in detail.With the help of combining the energy consumption model of the sensor network and the characteristics of charging base stations,an omnidirectional radiation charging deployment algorithm and a directional radiation charging base station deployment algorithm are proposed.The main contents of this paper are as follows:(1)Two energy consumption models of sensor networks are proposed.According to the characteristics of sensor network energy consumption,a sensor network with smaller sensor energy consumption or average energy consumption value is called as ‘Power Consumption Uniform Sensor Network'.A sensor network that consumes a large amount of energy or has a significant difference in energy consumption value is called as ‘Power Consumption Difference Sensor Network'.The charging base station model suitable for each of the two sensor networks is also analyzed.(2)An algorithm for deploying omnidirectional radiation charging base stations is proposed.Firstly,the omnidirectional charging base station deployment problem in the sensor network is transformed into a point coverage problem.Then,the advantages of the greedy algorithm and the solution of the minimum coverage circle are used to optimize the deployment of a single base station.Finally,the greedy circle charging algorithm is proposed and compared with the algorithm results proposed in other studies.(3)A directional radiation charging base station deployment algorithm is proposed.Firstly,according to the characteristics of the directional charging base station,the iterative formula of the specific location of the single base station deployment is derived.Then the directional charging base station deployment problem of the sensor network is transformed into the optimal set coverage problem.Finally,the convex vertices priority algorithm is proposed,and the results of algorithm were analyzed.