doi: 10.4304/jsw.8.10.2660-2667
LEACH-G: an Optimal Cluster-heads Selection Algorithm based on LEACH
Abstract—As a classic clustering algorithm, LEACH is widely used in wireless sensor networks. Due to the random cluster head selection process, LEACH does not guarantee optimization for the number and position of cluster heads. In order to further optimize LEACH, an optimal energyefficient cluster-heads selection algorithm LEACH-G for LEACH protocol is presented. We calculate the optimal number of cluster heads based on energy model for LEACH algorithm, and further set forth on LEACH-G algorithm for optimal cluster heads. We use NS2 simulation platform to compare LEACH-G with LEACH. By calculating the optimal number of cluster-heads, the energy consumption of the sensor nodes in LEACH-G algorithm can be more evenly distributed in the wireless sensor networks to avoid too much energy consumption of single node to untimely death, which affect the network life cycle. Compared with LEACH protocol, the simulation results demonstrate that LEACH-G algorithm can effectively reduce the energy consumption and increase the system lifetime.
Index Terms—WSN, LEACH, Cluster head.
Cite: Hongwei Chen, Chunhua Zhang, Xinlu Zong, Chunzhi Wang, "LEACH-G: an Optimal Cluster-heads Selection Algorithm based on LEACH," Journal of Software vol. 8, no. 10, pp. 2660-2667, 2013.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]