Shortest path routing problem in networks and optimization algorithms

Various intelligent techniques were used to solve the Shortest Path Problems in the Networks like Artificial Neural Networks (ANN), Genetic Algorithms (GA), Particle Swarm Optimization (PSO), etc. With the recent up-gradation in wireless technology,mobile communication between various nodes has become possible. One of the most important characteristics in mobile wireless networks is the topology dynamics,the network topology keeps on changing due to energy conservation or node mobility. Therefore, the shortest path routing problem becomes a Dynamic Optimization Problem (DOP) in Mobile Networks. Here the use of various optimization algorithms to solve the dynamic shortest path problem in Mobile Networks and their comparisons are discussed.

Autorentext

Kulvir Kaur,M. Tech:Electronics and Communication at Punjabi University in India.Assistant Professor at Sant Baba Bhag Singh Institute of Engg. and Technology,Jalandhar,India.