On-demand clustering mechanism for wireless sensor networks
- Authors
- Ahn, S.; Kim, H.; Park, J.-S.; Yoo, J.
- Issue Date
- 2013
- Publisher
- IEEE Computer Society
- Keywords
- Cluster head re-election; Clustering; Energy level; Wireless sensor network
- Citation
- International Conference on ICT Convergence, pp.256 - 261
- Journal Title
- International Conference on ICT Convergence
- Start Page
- 256
- End Page
- 261
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/17238
- DOI
- 10.1109/ICTC.2013.6675353
- ISSN
- 2162-1233
- Abstract
- Wireless sensor networks impose strict energy efficiency requirements since the sensor nodes tend to operate with non-rechargeable batteries. The cluster-based communication structure is an attractive solution for energy efficiency, because the cluster head (CH) node gathers the messages from the sensor nodes and transmits them to the sink node. However, the CH selection is challenging due to the distributed nature of sensor networks. In this paper, we propose an energy-efficient clustering mechanism that effectively conducts the CH selection. Our proposal introduces three key contributions. First, the CH is selected on-demand, i.e., only when the residual energy is reduced by some level. Second, each sensor node maintains multiple residual energy levels in order to allow fair CH selection and gradual energy consumption. Finally, the CH node may conduct multi-hop communication to the sink to save energy. These three innovations are combined to provide an energy efficient clustering mechanism for sensor networks. Through extensive Qualnet simulations, we show that our scheme prolongs the network lifetime compared to the previous work. © 2013 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering > Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/17238)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.