Efficient clustering techniques to optimize the system lifetime in Wireless Sensor Network

Mobility of sensor node in Wireless Sensor Network (WSN) is one of the key advantages of wireless over fixed communication system. But to track the sensor node in the heterogeneous network is more challenging and difficulties. In heterogeneous system, generally power consumption is more then homogeneous system. Coordination in distributed sensor network the implementation of clustering is an important technique and clusters of bounded size which is the total number of nodes in a specific cluster, is an important parameter in clustering algorithms which are very much effective in reducing energy consumption by minimizing the neighborhood of a node. Communication cost is also an important parameter for computation in a large area. Clustering techniques is Wireless Sensor Networks (WSNs) compare to random sampling is less costly due to the saving of time in journeys, reduction in number of transmissions and receptions at each node, identification, contacts etc. Which are valuable for increasing the overall network life, scalability of WSNs. Clustering sensor nodes is an effective and efficient technique for achieving all the requirement. In this paper we study the comprehensive theoretical aspects of the clustering problem to energy optimization in wireless sensor networks.