CGAR: An Energy Efficient Chaotic GA-based Routing Algorithm for Wireless Sensor Networks
Routing in wireless sensor network (WSN) with the energy consideration gain enormous attention because of its wide range of applications. The prime design issue is to reduce energy consumption of the node in these networks. In some WSN, nodes with high energy are called as relay nodes (RN’s) which are responsible to forward the data to the base station (BS).To prolong network lifetime and coverage of WSN energy consumption at RN must be reduced. In this paper, we present a chaotic based genetic algorithm (GA) routing scheme called CGAR for WSN and also minimizing the total distance covered by the data in each round. Our GA based routing approach improves the randomness and avoid premature convergence. The proposed algorithm experimental results are better than the existing techniques in terms of energy consumption, network lifetime for each round. In results we have analysed the randomness and sensitivity property of chaotic maps and its effect in GA.
Keywords: Routing, genetic algorithm, routing, wireless sensor networks.