• Aug 25, 2016 News!Vol.4, No.3 has been published with online version. 15 peer reviewed articles from 3 specific areas are published in this issue.   [Click]
  • May 03, 2016 News!Vol. 3, No. 3 has been indexed by EI (Inspec).   [Click]
  • May 03, 2016 News!Vol. 3, No. 2 has been indexed by EI (Inspec).   [Click]
General Information
    • ISSN: 2301-3559
    • Frequency: Quarterly
    • DOI: 10.18178/LNSE
    • Editor-in-Chief: Prof. Jemal Antidze
    • Executive Editor: Ms. Nina Lee
    • Abstracting/ Indexing: EI (INSPEC, IET), DOAJ, Electronic Journals Library, Engineering & Technology Digital Library, Ulrich's Periodicals Directory, International Computer Science Digital Library (ICSDL), ProQuest and Google Scholar.
    • E-mail: lnse@ejournal.net
Prof. Jemal Antidze
I. Vekua Scientific Institute of Applied Mathematics
Tbilisi State University, Georgia
I'm happy to take on the position of editor in chief of LNSE. We encourage authors to submit papers concerning any branch of Software Engineering.

LNSE 2013 Vol.1(1): 31-34 ISSN:2301-3559
DOI: 10.7763/LNSE.2013.V1.7

Analyzing the Effect of Variable Round Time for Clustering Approach in Wireless Sensor Networks

Vipin Pal, Girdhari Singh, and R. P. Yadav

Abstract—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.

Index Terms—Wireless sensor network, clustering, energy efficiency, round time.

Vipin Pal and Girdhari Singh are with the Malaviya National Institute of Technology, jaipur, 302017, India (e-mail: vipinrwr@ yahoo.com, girdharisingh@ rediffmail.com).
R P Yadav is with the Rajasthan Technical University, Kota, 324010, India (e-mail: rp_yadav@yahoo.com).


Cite: Vipin Pal, Girdhari Singh, and R. P. Yadav, "Analyzing the Effect of Variable Round Time for Clustering Approach in Wireless Sensor Networks," Lecture Notes on Software Engineering  vol. 1, no. 1, pp. 31-34, 2013.

Copyright © 2008-2015. Lecture Notes on Software Engineering. All rights reserved.
E-mail: lnse@ejournal.net