Cantitate/Preț
Produs

Shortest path routing problem in networks and optimization algorithms

Autor Kaur Kulvir
en Limba Engleză Paperback – 27 oct 2012
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.
Citește tot Restrânge

Preț: 32303 lei

Nou

Puncte Express: 485

Preț estimativ în valută:
6182 6415$ 5167£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783659254628
ISBN-10: 3659254622
Pagini: 80
Dimensiuni: 152 x 229 x 5 mm
Greutate: 0.13 kg
Editura: LAP LAMBERT ACADEMIC PUBLISHING AG & CO KG
Colecția LAP Lambert Academic Publishing