Routing Optimlzation using Genetic Algorithm in Ad Hoc Networks

An ad-hoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. The topology of connections between nodes in ad hoc networks may be quite dynamic. Ad hoc networks require a highly adaptive routing scheme to deal with the frequent topology changes. In this paper we propose algorithm for improving routing in clustering algorithm based on both clusterhead gateway switching protocol (CGSR) and the mechanisms of a genetic algorithm (GA).We use GA's because GA mechanisms allow for self configuration systems and maintain state information about the neighboring network better than traditional MANET routing mechanisms. GA mechanisms allow a node to change routing information quickly and efficiently to adjust an ever changing local topology, initiating fewer link breakages and increasing lower MAC layer overhead. Also our proposed algorithm shows that GA's are able to find, if not the shortest, at least a very good path between source and destination in ad-hoc network nodes.