Solving the Physical Traveling Salesman Problem: Tree Search and Macro Actions
Recently, wireless energy transfer technologies have emerged as a promising approach to address the power constraint problem in Wireless Sensor Networks. In this paper, we propose an optimized algorithm Multi-node Renewable based on Charging Range (MRCR) in the large-scale WSN, where multiple sensor nodes are charging simultaneously. A mobile charging vehicle (MCV) is responsible for energy supplement of these nodes group by group at specified docking spots. These spots are selected based on charging range of MCV, which not only maximum the charging coverage, but also improve the energy efficiency as the minimum stops and shortest travel path. We organize MCV schedule into rounds and each round is divided into slots: judgment, charging and rest. Finally, extensive experimental results show the proposal of MRCR algorithm can guarantee a short TSP length in every round and all sensor nodes live immorally.