节能改进最优K-Means:基于延迟MWSN-IoT第一个节点死亡的动态簇头选择

Awatef Chniguir, Zouhair Ben Jemaa
{"title":"节能改进最优K-Means:基于延迟MWSN-IoT第一个节点死亡的动态簇头选择","authors":"Awatef Chniguir, Zouhair Ben Jemaa","doi":"10.5121/ijcnc.2023.15503","DOIUrl":null,"url":null,"abstract":"The Internet of Things (IoT), which attaches dynamic devices that can access the Internet to create a smart environment, is a tempting research area. IoT-based mobile wireless sensor networks (WSN-IoT) are one of the major databases from which the IoT collects data for analysis and interpretation. However, one of the critical constraints is network lifetime. Routing-based clustered protocols and cluster head (CH) selection are crucial in load balancing and sensor longevity. Yet, with clustering, sensor node mobility requires more overhead because the nodes close to the center may get far and thus become unsuitable to be a CH, whereas those far from the center may get close and become good CH candidates, influencing energy consumption. This paper suggests an energy-efficient clustering protocol with a dynamic cluster head selection considering the distance to the cluster center, remaining energy, and each node's mobility degree implementing a rotation mechanism that allows cluster members to be equally elected while prioritizing those with the minimum weight. The advised algorithm aims to delay the first node death (FND) and thus prolong the stability period and minimize energy consumption by avoiding re-clustering. The performance of the proposed protocol exceeds that achieved in our previous work, Improved OKmeans, by 11%, in first dead node lifetime maximization, 43% in throughput, and 44% in energy efficiency.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":"2673 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Energy-Efficient Improved Optimal K-Means: Dynamic Cluster Head Selection based on Delaying the First Node Death in MWSN-IoT\",\"authors\":\"Awatef Chniguir, Zouhair Ben Jemaa\",\"doi\":\"10.5121/ijcnc.2023.15503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Internet of Things (IoT), which attaches dynamic devices that can access the Internet to create a smart environment, is a tempting research area. IoT-based mobile wireless sensor networks (WSN-IoT) are one of the major databases from which the IoT collects data for analysis and interpretation. However, one of the critical constraints is network lifetime. Routing-based clustered protocols and cluster head (CH) selection are crucial in load balancing and sensor longevity. Yet, with clustering, sensor node mobility requires more overhead because the nodes close to the center may get far and thus become unsuitable to be a CH, whereas those far from the center may get close and become good CH candidates, influencing energy consumption. This paper suggests an energy-efficient clustering protocol with a dynamic cluster head selection considering the distance to the cluster center, remaining energy, and each node's mobility degree implementing a rotation mechanism that allows cluster members to be equally elected while prioritizing those with the minimum weight. The advised algorithm aims to delay the first node death (FND) and thus prolong the stability period and minimize energy consumption by avoiding re-clustering. The performance of the proposed protocol exceeds that achieved in our previous work, Improved OKmeans, by 11%, in first dead node lifetime maximization, 43% in throughput, and 44% in energy efficiency.\",\"PeriodicalId\":37554,\"journal\":{\"name\":\"International Journal of Computer Networks and Communications\",\"volume\":\"2673 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Networks and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5121/ijcnc.2023.15503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Networks and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/ijcnc.2023.15503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

摘要

物联网(IoT)是一个诱人的研究领域,它将可以访问互联网的动态设备连接起来,创造一个智能环境。基于物联网的移动无线传感器网络(WSN-IoT)是物联网收集数据进行分析和解释的主要数据库之一。然而,一个关键的限制是网络生命周期。基于路由的集群协议和簇头(CH)选择对于负载平衡和传感器寿命至关重要。然而,在聚类中,传感器节点的移动需要更多的开销,因为靠近中心的节点可能会变远而不适合作为CH,而远离中心的节点可能会变近而成为良好的CH候选者,从而影响能量消耗。本文提出了一种考虑到簇中心距离、剩余能量和每个节点移动度的动态簇头选择的节能聚类协议,该协议实现了一种轮换机制,使簇成员在权重最小的情况下被平等地选择。建议的算法旨在通过避免重新聚类来延迟第一个节点死亡(FND),从而延长稳定周期和最小化能量消耗。提出的协议的性能超过了我们之前的工作,改进的OKmeans,在第一个死节点寿命最大化方面提高了11%,吞吐量提高了43%,能源效率提高了44%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Energy-Efficient Improved Optimal K-Means: Dynamic Cluster Head Selection based on Delaying the First Node Death in MWSN-IoT
The Internet of Things (IoT), which attaches dynamic devices that can access the Internet to create a smart environment, is a tempting research area. IoT-based mobile wireless sensor networks (WSN-IoT) are one of the major databases from which the IoT collects data for analysis and interpretation. However, one of the critical constraints is network lifetime. Routing-based clustered protocols and cluster head (CH) selection are crucial in load balancing and sensor longevity. Yet, with clustering, sensor node mobility requires more overhead because the nodes close to the center may get far and thus become unsuitable to be a CH, whereas those far from the center may get close and become good CH candidates, influencing energy consumption. This paper suggests an energy-efficient clustering protocol with a dynamic cluster head selection considering the distance to the cluster center, remaining energy, and each node's mobility degree implementing a rotation mechanism that allows cluster members to be equally elected while prioritizing those with the minimum weight. The advised algorithm aims to delay the first node death (FND) and thus prolong the stability period and minimize energy consumption by avoiding re-clustering. The performance of the proposed protocol exceeds that achieved in our previous work, Improved OKmeans, by 11%, in first dead node lifetime maximization, 43% in throughput, and 44% in energy efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Computer Networks and Communications
International Journal of Computer Networks and Communications Computer Science-Computer Networks and Communications
CiteScore
1.60
自引率
0.00%
发文量
46
期刊介绍: The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications.The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas. Authors are solicited to contribute to this journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the Computer Networks & Communications.
期刊最新文献
Analysis of System Capacity and Spectral Efficiency of Fixed-Grid Network Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Heterogeneous Wireless Networks A Privacy-Aware Tracking and Tracing System A Survey on CDN Vulnerability to DoS Attacks Energy-Efficient Improved Optimal K-Means: Dynamic Cluster Head Selection based on Delaying the First Node Death in MWSN-IoT
×
引用
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