Neighbor Node Discovery and Load Balancing Schemes for Energy-Efficient Clustering in Wireless Sensor Networks 


Vol. 31,  No. 11, pp. 1147-1158, Nov.  2006


PDF
  Abstract

Clustering algorithm is an essential element to implement a hierarchical routing protocol, especially for a large-scale wireless sensor network. In this paper, we propose a new type of energy-efficient clustering algorithm, which maximizes the physical distance between cluster head and gateway by a neighbor node discovery mechanism. Furthermore, a slave/master patching scheme is introduced as a useful means of further improving the energy-efficiency. It has been shown that the number of cluster heads can be reduced by as many as 21% as compared with the existing clustering algorithms.

  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]

J. Choi and C. Kang, "Neighbor Node Discovery and Load Balancing Schemes for Energy-Efficient Clustering in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1147-1158, 2006. DOI: .

[ACM Style]

Ji-young Choi and Chung-gu Kang. 2006. Neighbor Node Discovery and Load Balancing Schemes for Energy-Efficient Clustering in Wireless Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 31, 11, (2006), 1147-1158. DOI: .

[KICS Style]

Ji-young Choi and Chung-gu Kang, "Neighbor Node Discovery and Load Balancing Schemes for Energy-Efficient Clustering in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1147-1158, 11. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880