Clustering Scheme using Memory Restriction for Wireless Sensor Network 


Vol. 34,  No. 1, pp. 10-15, Jan.  2009


PDF
  Abstract

Recently, there are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. Thereby, this paper proposes a new clustering scheme to solve the co-shared problems in them. The basic idea of our scheme is using the inherent memory restrictions in sensor nodes. The results show that the proposed scheme could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.

  Statistics
Cumulative Counts from November, 2022
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. Choi and K. Yoo, "Clustering Scheme using Memory Restriction for Wireless Sensor Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 1, pp. 10-15, 2009. DOI: .

[ACM Style]

Hae-Won Choi and Kee-Young Yoo. 2009. Clustering Scheme using Memory Restriction for Wireless Sensor Network. The Journal of Korean Institute of Communications and Information Sciences, 34, 1, (2009), 10-15. DOI: .

[KICS Style]

Hae-Won Choi and Kee-Young Yoo, "Clustering Scheme using Memory Restriction for Wireless Sensor Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 1, pp. 10-15, 1. 2009.