Optimized routing method for wireless sensor networks based on improved ant colony algorithm

Author(s):  
Shailesh Pancham Khapre ◽  
Suhail Chopra ◽  
Arshad Khan ◽  
Pavika Sharma ◽  
Achyut Shankar
2014 ◽  
Vol 989-994 ◽  
pp. 4294-4297
Author(s):  
Hai Yang

Aiming at the shortcomings of slow convergence speed and instable optimal routing which will occur when ant colony algorithm is applied in wireless sensor networks, an improved algorithm is proposed in this paper, which can be used to optimize cluster heads number, cluster unequally and keep the majorizing clusters stable. In addition, the improved ant colony algorithm is used for routing in the majorizing cluster. Simulation experiments show that the stable cluster colony algorithm is useful in reducing the energy consumption and improving the speed of data package transmission.


2017 ◽  
Vol 13 (07) ◽  
pp. 69 ◽  
Author(s):  
Lin-lin Wang ◽  
Chengliang Wang

<p><span style="font-size: medium;"><span style="font-family: 宋体;">Aiming at the coverage problem of self-organizing wireless sensor networks, a target coverage method for wireless sensor networks based on Quantum Ant Colony Evolutionary Algorithm (QACEA) is put forward. This method introduces quantum state vector into the coding of ant colony algorithm, and realizes the dynamic adjustment of ant colony through quantum rotation port. The simulation results show that the quantum ant colony evolutionary algorithm proposed in this paper can effectively improve the target coverage of wireless sensor networks, and has obvious advantages compared with the other two methods in detecting the number of targets and the convergence speed. Based on the above findings, it is concluded that the algorithm proposed plays an essential role in the improvement of target coverage and it can be widely used in the similar fields, which has great and significant practical value.</span></span></p>


Sign in / Sign up

Export Citation Format

Share Document