Dynamic-size Multi-hop Clustering Mechanism in Sensor Networks


The KIPS Transactions:PartC, Vol. 12, No. 6, pp. 875-880, Oct. 2005
10.3745/KIPSTC.2005.12.6.875,   PDF Download:

Abstract

One of the most important issues in the sensor network with resource-constrained sensor nodes is prolonging the network lifetime by efficiently utilizing the given energy of nodes. The most representative mechnism to achieve a long-lived network is the clustering mechnism. In this paper, we propose a new dynamic-size multi-hop clustering mechanism in which the burden of a node acting as a cluster gead(CH) is balabced regardless of the density of nodes in a sensor network by adjusting the size of a cluster based on the information about the communication load and the residual energy of the node and its neighboring nodes. We show that our proposed scheme outperforms other single-hop of fixed-size multi-hop clustering mechanisms by carrying uot simulations.


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]
Y. J. Lim and S. H. Ahn, "Dynamic-size Multi-hop Clustering Mechanism in Sensor Networks," The KIPS Transactions:PartC, vol. 12, no. 6, pp. 875-880, 2005. DOI: 10.3745/KIPSTC.2005.12.6.875.

[ACM Style]
Yu Jin Lim and Sang Hyun Ahn. 2005. Dynamic-size Multi-hop Clustering Mechanism in Sensor Networks. The KIPS Transactions:PartC, 12, 6, (2005), 875-880. DOI: 10.3745/KIPSTC.2005.12.6.875.