An Efficient Cluster Header Election Scheme Considering Distance from a Sink in Zigbee Envionment


The KIPS Transactions:PartC, Vol. 17, No. 5, pp. 427-432, Oct. 2010
10.3745/KIPSTC.2010.17.5.427,   PDF Download:

Abstract

It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely effects on the life duration of the network. Therefore, a recent research is going forward a research activity with regard to life time extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from a Sink, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.


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]
J. I. Park, K. H. Lee, J. H. Lee, Y. T. Shin, "An Efficient Cluster Header Election Scheme Considering Distance from a Sink in Zigbee Envionment," The KIPS Transactions:PartC, vol. 17, no. 5, pp. 427-432, 2010. DOI: 10.3745/KIPSTC.2010.17.5.427.

[ACM Style]
Jong Il Park, Kyun Hwa Lee, Jooh Hyun Lee, and Yong Tae Shin. 2010. An Efficient Cluster Header Election Scheme Considering Distance from a Sink in Zigbee Envionment. The KIPS Transactions:PartC, 17, 5, (2010), 427-432. DOI: 10.3745/KIPSTC.2010.17.5.427.