Implementation of Wireless Sensor Charging Route Planning Based on Multi-Strategies Frilled Lizard Optimization
This paper presents an improved method to solve the problems of wireless sensor charging route planning by using a K-means algorithm and an improved Frilled Lizard Optimization. The improved method uses the K-means algorithm to cluster the data of wireless sensor nodes first. Then, an improved swarm intelligence algorithm generates corresponding Hamiltonian cycles for the clustered units and finally combines each Hamiltonian cycle to generate the final path planning for wireless sensor charging. The experimental simulations have proven that the K-means clustering algorithm reduces the time and space complexity in solving the problem, and the improved swarm intelligence algorithm has a shorter running time, lower energy consumption and higher efficiency than existing algorithms.
Authors
- Wei Song (ORCID: https://orcid.org/0000-0002-0591-4608)
- Bin Guo (ORCID: https://orcid.org/0000-0001-5054-4311)
- Kefeng Wang (ORCID: https://orcid.org/0000-0002-8506-2803)
- Gen Li (ORCID: https://orcid.org/0000-0001-6636-1106)
- Tengfei You (ORCID: https://orcid.org/0000-0001-7732-751X)
- Yi Niu
Institutions
- Jilin Jianzhu University (CN)
- First Automotive Works (China) (CN)
- China United Network Communications Group (China) (CN)
Publication Details
- Journal
- International Journal of Software Engineering and Knowledge Engineering
- Published
- 2025-10-10
- DOI
- https://doi.org/10.1142/s0218194025500767
- Primary Topic
- Energy Efficient Wireless Sensor Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00