Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Shortest path establishment approaches for static and dynamic mobile nodes with quality of service

Shortest path establishment approaches for static and dynamic mobile nodes with quality of service An ideal routing algorithm is one which finds the best/shortest path(s) for transmitting the data between source and destination in a short time. In this study, we have proposed two approaches; one is based on minimum spanning tree (MST) and the other one is based on distance vector method (DVM). For MST, a genetic algorithm is used. The chromosomes used are of variable length and their genes are used for encoding. The crossover and mutation operations are used for genetic diversity and improving the convergence rate. The second method is based on DVM to cover the limitations of the first approach as well the traditional DVM. The developed algorithm finds the shortest path for a static mesh connected mobile nodes. It is then tested for dynamicity by varying the positions of a few nodes. Extensive simulations are carried out on both the approaches and the results are compared with other popular algorithms. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Electronic Government, an International Journal Inderscience Publishers

Shortest path establishment approaches for static and dynamic mobile nodes with quality of service

Loading next page...
 
/lp/inderscience-publishers/shortest-path-establishment-approaches-for-static-and-dynamic-mobile-WJs9xO6Jti

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1740-7494
eISSN
1740-7508
DOI
10.1504/EG.2018.089509
Publisher site
See Article on Publisher Site

Abstract

An ideal routing algorithm is one which finds the best/shortest path(s) for transmitting the data between source and destination in a short time. In this study, we have proposed two approaches; one is based on minimum spanning tree (MST) and the other one is based on distance vector method (DVM). For MST, a genetic algorithm is used. The chromosomes used are of variable length and their genes are used for encoding. The crossover and mutation operations are used for genetic diversity and improving the convergence rate. The second method is based on DVM to cover the limitations of the first approach as well the traditional DVM. The developed algorithm finds the shortest path for a static mesh connected mobile nodes. It is then tested for dynamicity by varying the positions of a few nodes. Extensive simulations are carried out on both the approaches and the results are compared with other popular algorithms.

Journal

Electronic Government, an International JournalInderscience Publishers

Published: Jan 1, 2018

There are no references for this article.