The Particle Swarm Optimization with Decaying ICMIC for Shortest Path Computation in Computer Networks

Author(s):  
Zhang Huidang ◽  
Zhang Yifei
2014 ◽  
Vol 1049-1050 ◽  
pp. 1690-1693 ◽  
Author(s):  
Juan Li

The traditional evolutionary algorithm is cannot converge faster to solve the path optimization problems, and the path that is computed is not the shortest path, in allusion to the disadvantage of this algorithm, a mutation particle swarm optimization algorithm is proposed. The algorithm introduces the adaptive mutation strategy, and accelerated the speed to search for the global optimal solution. For seven examples experiment in standard database, the result shows that the algorithm is more efficient..


2016 ◽  
Vol 45 (3) ◽  
pp. 598-621 ◽  
Author(s):  
Mohammad Aijaz Mohiuddin ◽  
Salman A. Khan ◽  
Andries P. Engelbrecht

2018 ◽  
Vol 4 (10) ◽  
pp. 5
Author(s):  
Roshni Jha ◽  
Dr. Shivnath Ghosh

Wireless Networks includes a larger advantage in today’s communication application like environmental, traffic, military, and health observation. To realize these applications it's necessary to possess a reliable routing protocol. discusses about the working of proposed energy efficient bandwidth aware shortest path routing protocol for multipath routing in wireless sensor network. The proposed algorithm is based for choosing energy efficient shortest path. In routing algorithm, route that have shortest path among multipaths selected by particle swarm optimization algorithm. Among these shortest paths, that path is selected which require minimum route selection parameter. The proposed algorithm uses distance as well as energy of nodes as a parameter to find optimum paths using particle swarm optimization. Among these selected paths, only one optimum path is selected which reduces the energy requirement of the network. According to this work there would be improvement in other parameters also such as end to end delay as well as throughput.


Sign in / Sign up

Export Citation Format

Share Document