Clustering the sensor nodes is one of the most popular and effective approaches for applications that must support hundreds or thousands of nodes. The conventional algorithms consider various parameters to evenly distribute the energy load. However, energy consumption problem of the cluster head still remains. In this paper, we propose a novel clustering approach that periodically elects cluster heads with assistant nodes. The assistant nodes substitute for each cluster head to transmit sensor readings to the base station. Performance evaluations show that our proposed clustering algorithm achieves about 10-40% better performance than the existing clustering algorithms in terms of lifetime.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Myung Ho YEO, Yu Mi KIM, Jae Soo YOO, "An Energy-Efficient Distributed Clustering Approach in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 2, pp. 620-623, February 2009, doi: 10.1587/transcom.E92.B.620.
Abstract: Clustering the sensor nodes is one of the most popular and effective approaches for applications that must support hundreds or thousands of nodes. The conventional algorithms consider various parameters to evenly distribute the energy load. However, energy consumption problem of the cluster head still remains. In this paper, we propose a novel clustering approach that periodically elects cluster heads with assistant nodes. The assistant nodes substitute for each cluster head to transmit sensor readings to the base station. Performance evaluations show that our proposed clustering algorithm achieves about 10-40% better performance than the existing clustering algorithms in terms of lifetime.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.620/_p
Copy
@ARTICLE{e92-b_2_620,
author={Myung Ho YEO, Yu Mi KIM, Jae Soo YOO, },
journal={IEICE TRANSACTIONS on Communications},
title={An Energy-Efficient Distributed Clustering Approach in Wireless Sensor Networks},
year={2009},
volume={E92-B},
number={2},
pages={620-623},
abstract={Clustering the sensor nodes is one of the most popular and effective approaches for applications that must support hundreds or thousands of nodes. The conventional algorithms consider various parameters to evenly distribute the energy load. However, energy consumption problem of the cluster head still remains. In this paper, we propose a novel clustering approach that periodically elects cluster heads with assistant nodes. The assistant nodes substitute for each cluster head to transmit sensor readings to the base station. Performance evaluations show that our proposed clustering algorithm achieves about 10-40% better performance than the existing clustering algorithms in terms of lifetime.},
keywords={},
doi={10.1587/transcom.E92.B.620},
ISSN={1745-1345},
month={February},}
Copy
TY - JOUR
TI - An Energy-Efficient Distributed Clustering Approach in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 620
EP - 623
AU - Myung Ho YEO
AU - Yu Mi KIM
AU - Jae Soo YOO
PY - 2009
DO - 10.1587/transcom.E92.B.620
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2009
AB - Clustering the sensor nodes is one of the most popular and effective approaches for applications that must support hundreds or thousands of nodes. The conventional algorithms consider various parameters to evenly distribute the energy load. However, energy consumption problem of the cluster head still remains. In this paper, we propose a novel clustering approach that periodically elects cluster heads with assistant nodes. The assistant nodes substitute for each cluster head to transmit sensor readings to the base station. Performance evaluations show that our proposed clustering algorithm achieves about 10-40% better performance than the existing clustering algorithms in terms of lifetime.
ER -