A Token Based Clustering Algorithm Considering Uniform Density Cluster in Wireless Sensor Networks


The KIPS Transactions:PartC, Vol. 17, No. 3, pp. 291-298, Jun. 2010
10.3745/KIPSTC.2010.17.3.291,   PDF Download:

Abstract

In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. The clustering is the one of methods used to manage network energy consumption efficiently and LEACH(Low-Energy Adaptive Clustering Hierarchy) is one of the most famous clustering algorithms. LEACH utilizes randomized rotation of cluster-head to evenly distribute the energy load among the sensor nodes in the network. The random selection method of cluster-head does not guarantee the number of cluster-heads produced in each round to be equal to expected optimal value. And, the cluster head in a high-density cluster has an overload condition. In this paper, we proposed both a token based cluster-head selection algorithm for guarantee the number of cluster-heads and a cluster selection algorithm for uniform-density cluster. Through simulation, it is shown that the proposed algorithm improve the network lifetime about 9.3% better than LEACH.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. S. Lee and J. S. Heo, "A Token Based Clustering Algorithm Considering Uniform Density Cluster in Wireless Sensor Networks," The KIPS Transactions:PartC, vol. 17, no. 3, pp. 291-298, 2010. DOI: 10.3745/KIPSTC.2010.17.3.291.

[ACM Style]
Hyun Seok Lee and Jeong Seok Heo. 2010. A Token Based Clustering Algorithm Considering Uniform Density Cluster in Wireless Sensor Networks. The KIPS Transactions:PartC, 17, 3, (2010), 291-298. DOI: 10.3745/KIPSTC.2010.17.3.291.