Shortest path establishment approaches for static and dynamic mobile nodes with quality of service Online publication date: Mon, 29-Jan-2018
by S. Sundar; Aritra Basu; Arunava Kar; R. Kumar; Harish Mallikarjun Kittur
Electronic Government, an International Journal (EG), Vol. 14, No. 1, 2018
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the Electronic Government, an International Journal (EG):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook