Paper Info
Title
Multi-area Path Planning for Wireless Sensor Networks Based on Double Populations Ant Colony Optimization Algorithm
Abstract
Aiming at the problem that the ant colony algorithm(ACO) is slow to converge and easily fall into the local optimal value in the path planning of multi-area wireless sensor networks(WSNs), an improved ant colony optimization algorithm is proposed. First, a grid method was used to model two different obstacle environments. Second, to improve the efficiency of ant search in the early stages set a non-uniform initial pheromone concentration, and introduce new populations to expand the search space of the algorithm and avoid the algorithm falling into a local optimum. Finally, it is proposed that the elite ant pheromone update principle and adaptively adjusts the volatile coefficients to ensure the global search capability and improve the convergence speed of the algorithm. The experimental results show that the algorithm has a high global search capability and significantly faster convergence speed, which verifies the effectiveness and superiority of the algorithm.
Year
DOI
Venue
2020
10.1109/iThings-GreenCom-CPSCom-SmartData-Cybermatics50389.2020.00041
2020 International Conferences on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics)
Keywords
DocType
ISBN
Wireless Sensor Networks(WSNs),Ant Colony Optimization algorithms(ACO),path planning,Double Populations Ant Colony Optimization algorithms(DPACO)
Conference
978-1-7281-7648-2
Citations 
PageRank 
References 
0
0.34
8
Authors
6
Name
Order
Citations
PageRank
Chenxuan Zhai100.68
Minghua Wang26415.40
Kaiwu Jiang301.01
Yan Wang4162.94
Bo Fan500.68
Chao Wang6895190.04