IDA:无线传感器网络中用于负载平衡簇头选择的改进蜻蜓算法

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Peer-To-Peer Networking and Applications Pub Date : 2024-05-08 DOI:10.1007/s12083-024-01706-x
Ankita Srivastava, Pramod Kumar Mishra
{"title":"IDA:无线传感器网络中用于负载平衡簇头选择的改进蜻蜓算法","authors":"Ankita Srivastava, Pramod Kumar Mishra","doi":"10.1007/s12083-024-01706-x","DOIUrl":null,"url":null,"abstract":"<p>Efficient Energy Consumption and Network Lifetime are significant concerns in wireless sensor networks and allied disciplines. Clustering is one of the available solutions, but optimized cluster head selection is a prime issue nowadays. Many solutions have been given for solving this issue considering some attributes, but with time, meta-heuristics algorithms have become widely used for real-world applications. The nature-inspired algorithm is seeking researchers' wide attention as it gives the capability to self-learn and perform better. In this paper, we have proposed the Dragon Fly algorithm with multi-attribute decision-making inspired by the dynamic and static behavior of the dragonfly. The Proposed IDA (Innovative Dragonfly Algorithm) is a hybrid approach in which dragonfly and multi-attributes are combined for optimal cluster head selection. The proposed method is a way to compute multi-attributes of sensor nodes for ranking them and selecting optimized cluster heads. The energy consumption of IDA is 0.4896, NBA (Novel Bio-Inspired Algorithm) is 0.4321, FLPSOC (Fuzzy Logic and PSO-based energy efficient clustering) is 0.4421, and ESO-LEACH (PSO-based energy efficiency) is 0.4678 at which means proposed IDA is better than other compared algorithms in energy consumption. The throughput of IDA is 64.99, which is better than existing different compared algorithms. The number of alive nodes in the proposed method is, and that of compared algorithms is; thus, IDA has enhanced network lifetime compared to others. The IDA algorithm is compared with NBA, FLPSOC, and ESO-LEACH, validating that the proposed algorithm performs better than the classical and compared algorithm.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"16 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"IDA: Improved dragonfly algorithm for load balanced cluster heads selection in wireless sensor networks\",\"authors\":\"Ankita Srivastava, Pramod Kumar Mishra\",\"doi\":\"10.1007/s12083-024-01706-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Efficient Energy Consumption and Network Lifetime are significant concerns in wireless sensor networks and allied disciplines. Clustering is one of the available solutions, but optimized cluster head selection is a prime issue nowadays. Many solutions have been given for solving this issue considering some attributes, but with time, meta-heuristics algorithms have become widely used for real-world applications. The nature-inspired algorithm is seeking researchers' wide attention as it gives the capability to self-learn and perform better. In this paper, we have proposed the Dragon Fly algorithm with multi-attribute decision-making inspired by the dynamic and static behavior of the dragonfly. The Proposed IDA (Innovative Dragonfly Algorithm) is a hybrid approach in which dragonfly and multi-attributes are combined for optimal cluster head selection. The proposed method is a way to compute multi-attributes of sensor nodes for ranking them and selecting optimized cluster heads. The energy consumption of IDA is 0.4896, NBA (Novel Bio-Inspired Algorithm) is 0.4321, FLPSOC (Fuzzy Logic and PSO-based energy efficient clustering) is 0.4421, and ESO-LEACH (PSO-based energy efficiency) is 0.4678 at which means proposed IDA is better than other compared algorithms in energy consumption. The throughput of IDA is 64.99, which is better than existing different compared algorithms. The number of alive nodes in the proposed method is, and that of compared algorithms is; thus, IDA has enhanced network lifetime compared to others. The IDA algorithm is compared with NBA, FLPSOC, and ESO-LEACH, validating that the proposed algorithm performs better than the classical and compared algorithm.</p>\",\"PeriodicalId\":49313,\"journal\":{\"name\":\"Peer-To-Peer Networking and Applications\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Peer-To-Peer Networking and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s12083-024-01706-x\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Peer-To-Peer Networking and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12083-024-01706-x","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

高效的能源消耗和网络寿命是无线传感器网络和相关学科的重要关注点。聚类是可用的解决方案之一,但优化簇头选择是当今的首要问题。为解决这一问题,人们给出了许多考虑到某些属性的解决方案,但随着时间的推移,元启发式算法已广泛应用于现实世界。受自然启发的算法具有自我学习的能力,性能更好,因此受到研究人员的广泛关注。在本文中,我们从蜻蜓的动态和静态行为中汲取灵感,提出了多属性决策的蜻蜓算法。所提出的 IDA(创新蜻蜓算法)是一种混合方法,它将蜻蜓和多属性相结合,以实现最优簇头选择。提出的方法是一种计算传感器节点多属性的方法,用于对它们进行排序和选择优化的簇头。IDA 的能耗为 0.4896,NBA(新型生物启发算法)的能耗为 0.4321,FLPSOC(基于模糊逻辑和 PSO 的高能效聚类)的能耗为 0.4421,ESO-LEACH(基于 PSO 的高能效聚类)的能耗为 0.4678。IDA 的吞吐量为 64.99,优于现有的各种比较算法。提议方法的存活节点数为,而比较算法的存活节点数为;因此,与其他算法相比,IDA 的网络寿命更长。将 IDA 算法与 NBA、FLPSOC 和 ESO-LEACH 进行了比较,验证了所提出的算法优于经典算法和比较算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
IDA: Improved dragonfly algorithm for load balanced cluster heads selection in wireless sensor networks

Efficient Energy Consumption and Network Lifetime are significant concerns in wireless sensor networks and allied disciplines. Clustering is one of the available solutions, but optimized cluster head selection is a prime issue nowadays. Many solutions have been given for solving this issue considering some attributes, but with time, meta-heuristics algorithms have become widely used for real-world applications. The nature-inspired algorithm is seeking researchers' wide attention as it gives the capability to self-learn and perform better. In this paper, we have proposed the Dragon Fly algorithm with multi-attribute decision-making inspired by the dynamic and static behavior of the dragonfly. The Proposed IDA (Innovative Dragonfly Algorithm) is a hybrid approach in which dragonfly and multi-attributes are combined for optimal cluster head selection. The proposed method is a way to compute multi-attributes of sensor nodes for ranking them and selecting optimized cluster heads. The energy consumption of IDA is 0.4896, NBA (Novel Bio-Inspired Algorithm) is 0.4321, FLPSOC (Fuzzy Logic and PSO-based energy efficient clustering) is 0.4421, and ESO-LEACH (PSO-based energy efficiency) is 0.4678 at which means proposed IDA is better than other compared algorithms in energy consumption. The throughput of IDA is 64.99, which is better than existing different compared algorithms. The number of alive nodes in the proposed method is, and that of compared algorithms is; thus, IDA has enhanced network lifetime compared to others. The IDA algorithm is compared with NBA, FLPSOC, and ESO-LEACH, validating that the proposed algorithm performs better than the classical and compared algorithm.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Peer-To-Peer Networking and Applications
Peer-To-Peer Networking and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
8.00
自引率
7.10%
发文量
145
审稿时长
12 months
期刊介绍: The aim of the Peer-to-Peer Networking and Applications journal is to disseminate state-of-the-art research and development results in this rapidly growing research area, to facilitate the deployment of P2P networking and applications, and to bring together the academic and industry communities, with the goal of fostering interaction to promote further research interests and activities, thus enabling new P2P applications and services. The journal not only addresses research topics related to networking and communications theory, but also considers the standardization, economic, and engineering aspects of P2P technologies, and their impacts on software engineering, computer engineering, networked communication, and security. The journal serves as a forum for tackling the technical problems arising from both file sharing and media streaming applications. It also includes state-of-the-art technologies in the P2P security domain. Peer-to-Peer Networking and Applications publishes regular papers, tutorials and review papers, case studies, and correspondence from the research, development, and standardization communities. Papers addressing system, application, and service issues are encouraged.
期刊最新文献
Are neck pain, disability, and deep neck flexor performance the same for the different types of temporomandibular disorders? Enhancing cloud network security with a trust-based service mechanism using k-anonymity and statistical machine learning approach Towards real-time non-preemptive multicast scheduling in reconfigurable data center networks Homomorphic multi-party computation for Internet of Medical Things BPPKS: A blockchain-based privacy preserving and keyword-searchable scheme for medical data sharing
×
引用
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