1. 大规模无线传感器网络中高效按需充电规划.
- Author
-
刘 亮 and 蒲浩洋
- Subjects
- *
WIRELESS power transmission , *POLYNOMIAL time algorithms , *NP-hard problems , *APPROXIMATION algorithms , *WIRELESS sensor networks , *MAGNETIC resonance , *DETECTORS , *ALGORITHMS - Abstract
With the increasing maturity of wireless charging technology, especially the development of magnetic resonance wireless charging technology, the employment of mobile charging vehicles and wireless charging technology to replenish sensors' energy to ensure the continuous operation of wireless sensor networks has become a new research hotspot. This paper focused on how to schedule multiple charging vehicles to replenish energy to the sensors in a large-scale wireless sensor network. In order to balance the charging tasks of multiple charging vehicles and reduce the completion time of the whole charging task, the paper proposed the charging task completion time minimization problem, hoping to find K closed charging circles for K charging vehicles, so that the longest completion time among these K vehicles was the shortest. Since the charging task completion time minimization problem was an NP-hard problem and it was difficult to find an optimal solution in polynomial time, this paper proposed an approximation algorithm with a ratio of 5 for this problem. Finally, it demonstrated the performance of the algorithm by simulation experiments, and the experiments show that the actual approximation ratio of the proposed algorithm is less than 2. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF