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

Authors: S. Sundar; Aritra Basu; Arunava Kar; R. Kumar; Harish Mallikarjun Kittur

Addresses: School of Electronics Engineering, Vellore Institute of Technology (VIT), Vellore, 632014, India ' School of Electronics Engineering, Vellore Institute of Technology (VIT), Vellore, 632014, India ' School of Computer Science and Engineering, Vellore Institute of Technology (VIT), Vellore, 632014, India ' WIPRO, Chennai, 600119, India ' School of Electronics Engineering, Vellore Institute of Technology (VIT), Vellore, 632014, India

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.

Keywords: Egovernance; shortest path; MST; minimum spanning tree; DVMs; distance vector methods; genetic algorithm; MANETs; mobile ad hoc networks; Dijikstra algorithm; Bellman-Ford algorithm; QoS; quality of service.

DOI: 10.1504/EG.2018.089509

Electronic Government, an International Journal, 2018 Vol.14 No.1, pp.1 - 15

Received: 11 Jan 2017
Accepted: 05 Mar 2017

Published online: 29 Jan 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article