An Comparison of Different Cluster Head Selection Techniques for Wireless Sensor Network

Q4 Mathematics
E. Akila, Baby Deepa
{"title":"An Comparison of Different Cluster Head Selection Techniques for Wireless Sensor Network","authors":"E. Akila, Baby Deepa","doi":"10.52783/cana.v31.1073","DOIUrl":null,"url":null,"abstract":"Wireless Sensor Network is based on the hierarchical cluster and hence the Cluster Heads (CHs) will consume some more energy owing to the additional overload for the receiving and the aggregating of data from that of their member sensor nodes and this transmits all the aggregated data to its Base Station (BS). So the proper selection of the CH has a vital role to play in conserving the energy of the sensor nodes for the purpose of prolonging the WSNs and their lifetime. Here in this work, a proposed Low Energy Adaptive Clustering Hierarchy (LEACH), the Genetic Algorithm (GA) and finally the Chemical Reaction Optimization (CRO) algorithm is considered. The LEACH is a popular clustering algorithm wherein the sensor nodes will elect themselves to be the CH having a certain probability. But the main disadvantage of this algorithm will be that it may choose a CH having low energy that will be able to die quickly and thereby degrades the network performance. So there is a large number of algorithms that are developed for improving the LEACH. These results have been compared with certain currently existing algorithms for being able to demonstrate the proposed algorithm and its superiority. ","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":"119 44","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications on Applied Nonlinear Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52783/cana.v31.1073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

Wireless Sensor Network is based on the hierarchical cluster and hence the Cluster Heads (CHs) will consume some more energy owing to the additional overload for the receiving and the aggregating of data from that of their member sensor nodes and this transmits all the aggregated data to its Base Station (BS). So the proper selection of the CH has a vital role to play in conserving the energy of the sensor nodes for the purpose of prolonging the WSNs and their lifetime. Here in this work, a proposed Low Energy Adaptive Clustering Hierarchy (LEACH), the Genetic Algorithm (GA) and finally the Chemical Reaction Optimization (CRO) algorithm is considered. The LEACH is a popular clustering algorithm wherein the sensor nodes will elect themselves to be the CH having a certain probability. But the main disadvantage of this algorithm will be that it may choose a CH having low energy that will be able to die quickly and thereby degrades the network performance. So there is a large number of algorithms that are developed for improving the LEACH. These results have been compared with certain currently existing algorithms for being able to demonstrate the proposed algorithm and its superiority. 
无线传感器网络不同簇头选择技术的比较
无线传感器网络以分层簇为基础,因此簇首(CHs)在接收和聚合来自其成员传感器节点的数据时会额外超负荷消耗更多能量,然后将所有聚合数据传输到其基站(BS)。因此,为了延长 WSN 及其寿命,正确选择 CH 在节约传感器节点的能量方面起着至关重要的作用。在这项工作中,考虑了所提出的低能耗自适应聚类层次结构(LEACH)、遗传算法(GA)以及化学反应优化(CRO)算法。LEACH 是一种流行的聚类算法,在这种算法中,传感器节点将以一定的概率选举自己为 CH。但这种算法的主要缺点是,它可能会选择一个能量低、能够快速死亡的 CH,从而降低网络性能。因此,人们开发了大量算法来改进 LEACH。这些结果已与某些现有算法进行了比较,以证明所提出的算法及其优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.30
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信