Wireless Sensor Network (WSN) is widely considered as
one of the most important technologies for the twenty-first
century. One of the major objectives for WSN is that mobile
devices are used up "anywhere and anytime". However, this objective suffers from the difficulty to recharge or replace batteries for the sensor nodes due to the large number of nodes in network and the complexity of environment. So, the main
constraint in wireless communications is the limited energy of
mobile terminals.
The main research area in the wireless sensor network is the minimization of the energy consumption of the sensor nodes. To do so, a number of routing protocols has been
proposed. Genetic Algorithms (GA) [1] are methods used in the optimization problems. The GA takes their name from the biological evolution of living beings in the real world. These
algorithms try to simulate the process of natural selection in an unfavorable environment inspired by Darwin’s theory. In an environment, "individuals" best suited tend to live long enough to reproduce this while lower tend to disappear. Even though there are so many clustering routing protocols available, this paper considers LEACH protocol. In particular, Section 2 presents the related works, Section 3 discusses our new approach and concludes with the simulation results to validate our new approach and compare its performance with LEACH protocol.