Dynamic Clustering in Wireless Sensor Networks using Hybrid Jellyfish Optimization-Leach Protocol

M. Gurupriya, A. Sumathi
{"title":"Dynamic Clustering in Wireless Sensor Networks using Hybrid Jellyfish Optimization-Leach Protocol","authors":"M. Gurupriya, A. Sumathi","doi":"10.46719/dsa202130.11.02","DOIUrl":null,"url":null,"abstract":"WSNs are usually equipped with a large number of sensor nodes that are designed and deployed to distribute and distribute the required data. Although sensors are sometimes deployed in remote environments, it is essential to identify a cluster head(CH) with an energy-efficient technique for transferring data in WSN. Cluster head selection algorithm is becoming a significant and challenging problem in WSN. This research presented a hybrid Leach with jellyfish algorithm for cluster head selection and an energy-efficient Heuristic Moth Search Algorithm (HMSA) to find efficient paths for transferring data to base station(BS).This technique avoids congestion with less guaranteed delays and maintain the energy efficiency of WSNs. The cluster head (CH) determines the residual energy on the basis of an optimum fit function assessed on the basis of strategic parameters such as distance between adjacent nodes and the centre. It can significantly reduce the number of dead nodesand reduce energy consumption. The HMSA method has been used to determine the best route for data transfer to the base station once the CH selection is complete. The entire WSN field is divided into several subdivisions, and each section chooses the designated target by measuring the transmission distance. The proposed approach has been assessed analytically, and results are compared with those related to conventional methods, namely HEED, FACER and EACBM, in terms of WSN Quality of service (QoS). The suggested approach demonstrated better performance in the number of live nodes and energy consumption than conventional algorithms.","PeriodicalId":51019,"journal":{"name":"Dynamic Systems and Applications","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dynamic Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46719/dsa202130.11.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

WSNs are usually equipped with a large number of sensor nodes that are designed and deployed to distribute and distribute the required data. Although sensors are sometimes deployed in remote environments, it is essential to identify a cluster head(CH) with an energy-efficient technique for transferring data in WSN. Cluster head selection algorithm is becoming a significant and challenging problem in WSN. This research presented a hybrid Leach with jellyfish algorithm for cluster head selection and an energy-efficient Heuristic Moth Search Algorithm (HMSA) to find efficient paths for transferring data to base station(BS).This technique avoids congestion with less guaranteed delays and maintain the energy efficiency of WSNs. The cluster head (CH) determines the residual energy on the basis of an optimum fit function assessed on the basis of strategic parameters such as distance between adjacent nodes and the centre. It can significantly reduce the number of dead nodesand reduce energy consumption. The HMSA method has been used to determine the best route for data transfer to the base station once the CH selection is complete. The entire WSN field is divided into several subdivisions, and each section chooses the designated target by measuring the transmission distance. The proposed approach has been assessed analytically, and results are compared with those related to conventional methods, namely HEED, FACER and EACBM, in terms of WSN Quality of service (QoS). The suggested approach demonstrated better performance in the number of live nodes and energy consumption than conventional algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于混合水母优化-滤出协议的无线传感器网络动态聚类
wsn通常配备大量的传感器节点,这些节点的设计和部署是为了分发和分发所需的数据。虽然传感器有时部署在远程环境中,但在无线传感器网络中,使用节能技术识别簇头(CH)是必不可少的。簇头选择算法是无线传感器网络中一个重要而具有挑战性的问题。提出了一种混合滤出水母算法用于簇头选择,以及一种高效的启发式飞蛾搜索算法(HMSA)用于寻找有效的数据传输路径到基站(BS)。该技术避免了拥塞和低保证延迟,并保持了无线传感器网络的能量效率。簇头(CH)根据邻近节点与中心之间的距离等策略参数评估的最优拟合函数来确定剩余能量。它可以显著减少死节点数量,降低能耗。一旦CH选择完成,HMSA方法已用于确定向基站传输数据的最佳路由。将整个WSN领域划分为几个细分,每个细分通过测量传输距离来选择指定的目标。对该方法进行了分析评估,并将结果与传统方法(即HEED、FACER和EACBM)在无线传感器网络服务质量(QoS)方面的结果进行了比较。与传统算法相比,该方法在活节点数和能耗方面表现出更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
12
审稿时长
>12 weeks
期刊介绍: The aim of this quarterly journal is to provide an international forum for the information in the theory and practice of Dynamic Systems and Applications. This journal publishes carefully selected original research papers from stochastic/deterministic : Differential Equations ,Integral Equations, Integro-Differential Equations, Discrete Analogs of these equations, and Applications.
期刊最新文献
On Zeros of Polynomials and Infinite Series With Some Bounds On Some Retarded Integral Inequalities of Gronwall Type: Application to Integral and Differential Equations Phase Portraits of The Complex Riccati Equation With Constant Coefficients Multiple Solutions of a Discrete Nonlinear Boundary Value Problem Involving p(k)-Laplace Kirchhoff Type Operator Decomposing a Conjugate Fixed-Point Problem into Multiple Fixed-Point Problems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1