Research On Charging Scheduling Strategy In Wireless Rechargeable Sensor Networks

With the development of wireless sensor networks,the limited battery capacity of sensor nodes has become one of energy bottleneck problem that dominate the wide application of wireless sensor networks.In recent years,wireless rechargeable sensor networks have attracted much attention due to their potential in solving the energy bottleneck problem.In this paper,we study the scheduling strategy of mobile charger in the on-demand mobile charging wireless sensor networks.The proposed strategy can divide the sensor nodes of service pool into two categories.Mobile charger can provide charging service in some priority according to the degree of charging request urgency during the charging tour.Our proposed algorithm can reduce charging missing ratio by 89 percent,and it can keep charging throughput decline rate less than 9.91 percent.we study the scheduling strategy of the charging mission in WRSNs,and this strategy is charging for sensor node by using multiple mobile chargers,such that every sensor will not run out of energy in monitoring period.As sensors require many times to charge in monitoring period,scheduling many charging car is modeled to be a collaborative charging problem of sensor.Firstly,the sensor nodes need to be charge are divided into multiple subsets using minimum spanning tree algorithm,and the number of subsets is equal to the number of mobile recharges.Then,we determine the range of recharges using approximate algorithm in each subset.After that,the sensor nodes have been reduced and grouped periodically,so that the range of all recharges is minimized.Extensive experimental results show that,our proposed algorithm can reduce the range of all recharges by 43%,compared to the greedy algorithm.