Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks

Ji Young Choi, Chung Gu Kang, Yong Suk Kim, Kyeong Hur

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages470-479
Number of pages10
Volume3823 LNCS
Publication statusPublished - 2005 Dec 1
EventEUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES - Nagasaki, Japan
Duration: 2005 Dec 62005 Dec 9

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3823 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherEUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES
CountryJapan
CityNagasaki
Period05/12/605/12/9

Fingerprint

Energy Efficient
Clustering algorithms
Sensor networks
Sensor Networks
Clustering Algorithm
Cluster Analysis
Clustering
Vertex of a graph
Head
Slaves
Gateway
Number of Clusters
Routing Protocol
Energy Efficiency
Routing protocols
Energy efficiency
Wireless Sensor Networks
Wireless sensor networks
Efficient Algorithms
Maximise

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Choi, J. Y., Kang, C. G., Kim, Y. S., & Hur, K. (2005). Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3823 LNCS, pp. 470-479). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3823 LNCS).

Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks. / Choi, Ji Young; Kang, Chung Gu; Kim, Yong Suk; Hur, Kyeong.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3823 LNCS 2005. p. 470-479 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3823 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, JY, Kang, CG, Kim, YS & Hur, K 2005, Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3823 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3823 LNCS, pp. 470-479, EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES, Nagasaki, Japan, 05/12/6.
Choi JY, Kang CG, Kim YS, Hur K. Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3823 LNCS. 2005. p. 470-479. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Choi, Ji Young ; Kang, Chung Gu ; Kim, Yong Suk ; Hur, Kyeong. / Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3823 LNCS 2005. pp. 470-479 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bb8dfe056d694071aea4850a73d99ef2,
title = "Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks",
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.",
author = "Choi, {Ji Young} and Kang, {Chung Gu} and Kim, {Yong Suk} and Kyeong Hur",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "3540308032",
volume = "3823 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "470--479",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Neighbor node discovery algorithm for energy-efficient clustering in ubiquitious sensor networks

AU - Choi, Ji Young

AU - Kang, Chung Gu

AU - Kim, Yong Suk

AU - Hur, Kyeong

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33744933977&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744933977&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33744933977

SN - 3540308032

SN - 9783540308034

VL - 3823 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 470

EP - 479

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -