Research of charging route planning model for wireless rechargeable sensor network based on simulated annealing algorithm and linear programming

Wireless rechargeable sensor network includes three parts: data center DC, sensor and mobile charger MC. The work of sensor requires battery to provide energy. Based on this, this paper focuses on how to design a reasonable charging circuit for a single mobile charger starting from the data center, and the minimum capacity of the battery to ensure the normal operation of each sensor, and thus expand to multiple mobile chargers. In the case of a mobile charger, in order to minimize the energy consumption of the mobile charger on the road, the driving distance of the mobile charger should be minimized. The paper use the earth's radius and longitude and latitude of each sensor can calculate the distance between each sensor, thus the problem can be converted to a given weighted network diagram to find starting from the data center will all vertices in the network graph traversal only again back to the data center makes the problem of shortest distance, the simulation using the simulated annealing algorithm, thus it is concluded that the optimum route scheme. And then normal operation of the system need to make sure that the process of finish a lap mobile charger after the sensor has not less than the minimum battery capacity as the constraint condition, the multi-objective problem to single objective problem, the simplified calculation is further transformed into linear programming problems, setting up reasonable charging rate r, movement speed v, battery capacity low f, sensor is obtained by solving our minimum battery capacity.