Abstract
Wireless Sensor Networks (WSNs) consist of sensor nodes, which are small in size with limited energy and computational power. The main function of WSN is to route sensed data to base station (BS), however the main constraint in WSN is irreplaceable power sources of sensor nodes. In this paper, a distributed energy efficient and energy balanced clustering algorithm is proposed. A sensor node selects a cluster head (CH) having minimum routing overhead with higher ratio of residual energy of CH and corresponding distance. Routing overhead of CH is calculated only when the route from individual CH to base station (BS) is defined, so for defining the route amongst CH, we execute GA based routing algorithm named as GAR [1] before selection of CH by sensor nodes. Proposed algorithm also takes care of those sensor nodes, which are not in communication range of CH. This is also complimented with fault tolerant issue of WSNs as the sensor nodes are prone to failure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
