A graph clustering based method for Energy efficient clustering in wireless sensor networks

Wireless sensor networks have recently gained the attention of researchers in many challenging aspects. The most important challenge in these networks is energy conservation. Enhancing the lifetime of wireless sensors network and efficient utilizations of bandwidth are essential for the proliferation of wireless sensor network in different applications. In this paper, a graph clustering based method is proposed to optimize the lifetime of wireless sensor networks. The proposed method is a cluster based approach like LEACH. Graph clustering is used to maximize the lifetime of the network by means of rounds. The clustering algorithm is presented by considering energyconservation of the nodes through load balancing. The proposed algorithms are experimented extensively and the results are compared with the existing algorithms to demonstrate their superiority in terms of network life, energy consumption, dead sensor nodes and delivery of total data packets to the base station. The results show that the proposed method is found to be more efficient than previous works.

Keywords:

Wireless sensor networks , Routing protocol , Energy-efficiency , Graph clustering