Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures

Joongheon Kim; Wonjun Lee; Dongshin Kim; Eunkyo Kim; Hyeokman Kim; Sanghyun Ahn

doi:10.1007/11802167_66

Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures

Joongheon Kim, Wonjun Lee, Dongshin Kim, Eunkyo Kim, Hyeokman Kim, Sanghyun Ahn

Department of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

This paper proposes dynamic clustering for coverage-time maximization (DC-CTM) in sensor networks. The coverage-time is defined as the time until one of cluster heads (CHs) runs out of energy in clustering-based sensor networks. DC-CTM regulates cluster radii for balanced energy consumption among CHs for coverage-time maximization. By using DC-CTM, three advantages can be achieved. The first one is balanced energy consumption among CHs. The second one is minimized energy consumption in each CH. The last one is the consideration of mobility on CHs. The novelty of proposed scheme, DC-CTM scheme, is shown by various simulation-based performance analyses.

Original language	English
Title of host publication	Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings
Publisher	Springer Verlag
Pages	652-661
Number of pages	10
ISBN (Print)	3540366792, 9783540366799
DOIs	https://doi.org/10.1007/11802167_66
State	Published - 2006
Event	International Conference on Embedded and Ubiquitous Computing, EUC 2006 - Seoul, Korea, Republic of Duration: 1 Aug 2006 → 4 Aug 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4096 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Embedded and Ubiquitous Computing, EUC 2006
Country/Territory	Korea, Republic of
City	Seoul
Period	1/08/06 → 4/08/06

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/11802167_66

Cite this

Kim, J., Lee, W., Kim, D., Kim, E., Kim, H., & Ahn, S. (2006). Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures. In Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings (pp. 652-661). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4096 LNCS). Springer Verlag. https://doi.org/10.1007/11802167_66

Kim, Joongheon ; Lee, Wonjun ; Kim, Dongshin et al. / Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures. Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings. Springer Verlag, 2006. pp. 652-661 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5dba8f1506974ac2906c0a170c90606d,

title = "Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures",

abstract = "This paper proposes dynamic clustering for coverage-time maximization (DC-CTM) in sensor networks. The coverage-time is defined as the time until one of cluster heads (CHs) runs out of energy in clustering-based sensor networks. DC-CTM regulates cluster radii for balanced energy consumption among CHs for coverage-time maximization. By using DC-CTM, three advantages can be achieved. The first one is balanced energy consumption among CHs. The second one is minimized energy consumption in each CH. The last one is the consideration of mobility on CHs. The novelty of proposed scheme, DC-CTM scheme, is shown by various simulation-based performance analyses.",

author = "Joongheon Kim and Wonjun Lee and Dongshin Kim and Eunkyo Kim and Hyeokman Kim and Sanghyun Ahn",

year = "2006",

doi = "10.1007/11802167_66",

language = "English",

isbn = "3540366792",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "652--661",

booktitle = "Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings",

address = "Germany",

note = "International Conference on Embedded and Ubiquitous Computing, EUC 2006 ; Conference date: 01-08-2006 Through 04-08-2006",

}

Kim, J, Lee, W, Kim, D, Kim, E, Kim, H & Ahn, S 2006, Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures. in Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4096 LNCS, Springer Verlag, pp. 652-661, International Conference on Embedded and Ubiquitous Computing, EUC 2006, Seoul, Korea, Republic of, 1/08/06. https://doi.org/10.1007/11802167_66

Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures. / Kim, Joongheon; Lee, Wonjun; Kim, Dongshin et al.
Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings. Springer Verlag, 2006. p. 652-661 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4096 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures

AU - Kim, Joongheon

AU - Lee, Wonjun

AU - Kim, Dongshin

AU - Kim, Eunkyo

AU - Kim, Hyeokman

AU - Ahn, Sanghyun

PY - 2006

Y1 - 2006

N2 - This paper proposes dynamic clustering for coverage-time maximization (DC-CTM) in sensor networks. The coverage-time is defined as the time until one of cluster heads (CHs) runs out of energy in clustering-based sensor networks. DC-CTM regulates cluster radii for balanced energy consumption among CHs for coverage-time maximization. By using DC-CTM, three advantages can be achieved. The first one is balanced energy consumption among CHs. The second one is minimized energy consumption in each CH. The last one is the consideration of mobility on CHs. The novelty of proposed scheme, DC-CTM scheme, is shown by various simulation-based performance analyses.

AB - This paper proposes dynamic clustering for coverage-time maximization (DC-CTM) in sensor networks. The coverage-time is defined as the time until one of cluster heads (CHs) runs out of energy in clustering-based sensor networks. DC-CTM regulates cluster radii for balanced energy consumption among CHs for coverage-time maximization. By using DC-CTM, three advantages can be achieved. The first one is balanced energy consumption among CHs. The second one is minimized energy consumption in each CH. The last one is the consideration of mobility on CHs. The novelty of proposed scheme, DC-CTM scheme, is shown by various simulation-based performance analyses.

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

U2 - 10.1007/11802167_66

DO - 10.1007/11802167_66

M3 - Conference contribution

AN - SCOPUS:33746715118

SN - 3540366792

SN - 9783540366799

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

SP - 652

EP - 661

BT - Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings

PB - Springer Verlag

T2 - International Conference on Embedded and Ubiquitous Computing, EUC 2006

Y2 - 1 August 2006 through 4 August 2006

ER -

Kim J, Lee W, Kim D, Kim E, Kim H, Ahn S. Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures. In Embedded and Ubiquitous Computing - International Conference, EUC 2006, Proceedings. Springer Verlag. 2006. p. 652-661. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11802167_66

Dynamic clustering for coverage-time maximization in two-tiered hierarchical sensor network architectures

Abstract

Publication series

Conference

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this