Energy-efficient selection of cluster headers in wireless sensor networks
Clustering is vital for lengthening the lives of resource-constrained wireless sensor nodes. In this work, we propose a cluster-based energy-efficient router placement scheme for wireless sensor networks, where the K-means algorithm is used to select the initial cluster headers and then a cluster he...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2018-03-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1177/1550147718764642 |
id |
doaj-a9526d73095648e181d7acbfdb56ba46 |
---|---|
record_format |
Article |
spelling |
doaj-a9526d73095648e181d7acbfdb56ba462020-11-25T03:10:04ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772018-03-011410.1177/1550147718764642Energy-efficient selection of cluster headers in wireless sensor networksAdem Fanos Jemal0Redwan Hassen Hussen1Do-Yun Kim2Zhetao Li3Tingrui Pei4Young-June Choi5School of Electrical Engineering and Computing, Adama Science and Technology University, Adama, EthiopiaDepartment of Software and Computer Engineering, Ajou University, Suwon, KoreaDepartment of Software and Computer Engineering, Ajou University, Suwon, KoreaXiangtan University, Xiangtan, ChinaXiangtan University, Xiangtan, ChinaDepartment of Software and Computer Engineering, Ajou University, Suwon, KoreaClustering is vital for lengthening the lives of resource-constrained wireless sensor nodes. In this work, we propose a cluster-based energy-efficient router placement scheme for wireless sensor networks, where the K-means algorithm is used to select the initial cluster headers and then a cluster header with sufficient battery energy is selected within each cluster. The performance of the proposed scheme was evaluated in terms of the energy consumption, end-to-end delay, and packet loss. Our simulation results using the OPNET simulator revealed that the energy consumption of our proposed scheme was better than that of the low-energy adaptive clustering hierarchy, which is known to be an energy-efficient clustering mechanism. Furthermore, our scheme outperformed low-energy adaptive clustering hierarchy in terms of the end-to-end delay, throughput, and packet loss rate.https://doi.org/10.1177/1550147718764642 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Adem Fanos Jemal Redwan Hassen Hussen Do-Yun Kim Zhetao Li Tingrui Pei Young-June Choi |
spellingShingle |
Adem Fanos Jemal Redwan Hassen Hussen Do-Yun Kim Zhetao Li Tingrui Pei Young-June Choi Energy-efficient selection of cluster headers in wireless sensor networks International Journal of Distributed Sensor Networks |
author_facet |
Adem Fanos Jemal Redwan Hassen Hussen Do-Yun Kim Zhetao Li Tingrui Pei Young-June Choi |
author_sort |
Adem Fanos Jemal |
title |
Energy-efficient selection of cluster headers in wireless sensor networks |
title_short |
Energy-efficient selection of cluster headers in wireless sensor networks |
title_full |
Energy-efficient selection of cluster headers in wireless sensor networks |
title_fullStr |
Energy-efficient selection of cluster headers in wireless sensor networks |
title_full_unstemmed |
Energy-efficient selection of cluster headers in wireless sensor networks |
title_sort |
energy-efficient selection of cluster headers in wireless sensor networks |
publisher |
SAGE Publishing |
series |
International Journal of Distributed Sensor Networks |
issn |
1550-1477 |
publishDate |
2018-03-01 |
description |
Clustering is vital for lengthening the lives of resource-constrained wireless sensor nodes. In this work, we propose a cluster-based energy-efficient router placement scheme for wireless sensor networks, where the K-means algorithm is used to select the initial cluster headers and then a cluster header with sufficient battery energy is selected within each cluster. The performance of the proposed scheme was evaluated in terms of the energy consumption, end-to-end delay, and packet loss. Our simulation results using the OPNET simulator revealed that the energy consumption of our proposed scheme was better than that of the low-energy adaptive clustering hierarchy, which is known to be an energy-efficient clustering mechanism. Furthermore, our scheme outperformed low-energy adaptive clustering hierarchy in terms of the end-to-end delay, throughput, and packet loss rate. |
url |
https://doi.org/10.1177/1550147718764642 |
work_keys_str_mv |
AT ademfanosjemal energyefficientselectionofclusterheadersinwirelesssensornetworks AT redwanhassenhussen energyefficientselectionofclusterheadersinwirelesssensornetworks AT doyunkim energyefficientselectionofclusterheadersinwirelesssensornetworks AT zhetaoli energyefficientselectionofclusterheadersinwirelesssensornetworks AT tingruipei energyefficientselectionofclusterheadersinwirelesssensornetworks AT youngjunechoi energyefficientselectionofclusterheadersinwirelesssensornetworks |
_version_ |
1724660847514484736 |