TY - JFULL AU - Vipin Pal and Girdhari Singh and R P Yadav PY - 2012/12/ TI - Analyzing The Effect of Variable Round Time for Clustering Approach in Wireless Sensor Networks T2 - International Journal of Electronics and Communication Engineering SP - 1261 EP - 1266 VL - 6 SN - 1307-6892 UR - https://publications.waset.org/pdf/2960 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 71, 2012 N2 - As wireless sensor networks are energy constraint networks so energy efficiency of sensor nodes is the main design issue. Clustering of nodes is an energy efficient approach. It prolongs the lifetime of wireless sensor networks by avoiding long distance communication. Clustering algorithms operate in rounds. Performance of clustering algorithm depends upon the round time. A large round time consumes more energy of cluster heads while a small round time causes frequent re-clustering. So existing clustering algorithms apply a trade off to round time and calculate it from the initial parameters of networks. But it is not appropriate to use initial parameters based round time value throughout the network lifetime because wireless sensor networks are dynamic in nature (nodes can be added to the network or some nodes go out of energy). In this paper a variable round time approach is proposed that calculates round time depending upon the number of active nodes remaining in the field. The proposed approach makes the clustering algorithm adaptive to network dynamics. For simulation the approach is implemented with LEACH in NS-2 and the results show that there is 6% increase in network lifetime, 7% increase in 50% node death time and 5% improvement over the data units gathered at the base station. ER -