DocumentCode
3260540
Title
Shortest Path Routing for Co-ordinate Based Mobile Networks: A Genetic Algorithm Approach
Author
Poddar, Rajarshi ; Banerjee, Subarno ; Thakurta, Parag Kumar Guha
Author_Institution
Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol. Durgapur, Durgapur, India
fYear
2012
fDate
1-2 Aug. 2012
Firstpage
50
Lastpage
53
Abstract
A genetic algorithm approach for shortest routing path has been proposed in this paper. The different genetic operations have been modeled with co-ordinate based mobile networks. The simulation study confirms the convergence with the Dijkstra´s Algorithm.
Keywords
genetic algorithms; mobile communication; telecommunication network routing; Dijkstra algorithm; coordinate based mobile networks; genetic algorithm; shortest path routing; Biological cells; Genetic algorithms; Mobile communication; Mobile computing; Routing; Sociology; Statistics; co-ordinate; genetic algorithm; mobile network; routing; shortest path;
fLanguage
English
Publisher
ieee
Conference_Titel
Advances in Mobile Network, Communication and its Applications (MNCAPPS), 2012 International Conference on
Conference_Location
Bangalore
Print_ISBN
978-1-4673-1869-3
Type
conf
DOI
10.1109/MNCApps.2012.15
Filename
6295751
Link To Document