한국정보통신설비학회:학술대회논문집
- 2005.08a
- /
- Pages.349-357
- /
- 2005
An Energy-efficient Clustering Algorithm using the Guaranteed Minimum Coverage for ClusterHeads in Wireless Sensor Networks
무선 센서 네트워크에서의 에너지 효율을 위한 클러스터 헤더 재배치 알고리즘
- Kim, Nam-Hun (School of Electrical Engr. and Computer Science, Seoul National University) ;
-
Park, Tae-Rim
(School of Electrical Engr. and Computer Science, Seoul National University) ;
- Kwon, Wook-Hyun (School of Electrical Engr. and Computer Science, Seoul National University) ;
- Kim, Jeong-Jun (KT convergence Laboratory) ;
- Kim, Yong-Ho (KT convergence Laboratory) ;
- Sin, Yeong-Hui (KT convergence Laboratory)
- 김남훈 (서울대학교 전기컴퓨터공학부) ;
-
박태림
(서울대학교 전기컴퓨터공학부) ;
- 권욱현 (서울대학교 전기컴퓨터공학부) ;
- 김정준 (KT 컨버전스 연구소) ;
- 김용호 (KT 컨버전스 연구소) ;
- 신영희 (KT 컨버전스 연구소)
- Published : 2005.08.01
Abstract
In this paper, a new clustering algorithm using the Guaranteed Minimum Coverage (GMC) is proposed. In the new protocol, an appropriate distribution of clusterheads is accomplished by guaranteeing a stochastic coverage at each clusterhead(CH)s. Using this protocol, the communication cost from clusterheads to their member nodes and the load variance in each clusterheads are reduced. Therefore, the network lifetime can be extended and the fair energy consumption for all CHs can be achieved