Energy Efficient Clustering and Routing Algorithms for Wireless Sensor Networks: GA Based Approach

摘要

Energy efficient clustering and routing are two well known problems in wireless sensor networks. In this paper, we propose genetic algorithm based approaches for clustering and routing in wireless sensor networks. The clustering is based on residual energy of the gateways and distance from sensor nodes to their corresponding cluster head. The routing scheme is also based on the residual energy of the gateways along with a trade-off between transmission distance and number of forwards. We perform extensive simulations of the proposed algorithms and compare the simulation results with that of the existing algorithms. The results demonstrate that the proposed algorithms outperform the existing algorithms in terms of various performance metrics including energy consumption, number of active nodes, first gateway die and number of dead gateway per round.