Unequal Clustering Energy Hole Avoidance (UCEHA) algorithm in Cognitive Radio Wireless Sensor Networks (CRWSNs)

IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ranjita Joon, Parul Tomar, Gyanendra Kumar, Balamurugan Balusamy, Anand Nayyar
{"title":"Unequal Clustering Energy Hole Avoidance (UCEHA) algorithm in Cognitive Radio Wireless Sensor Networks (CRWSNs)","authors":"Ranjita Joon, Parul Tomar, Gyanendra Kumar, Balamurugan Balusamy, Anand Nayyar","doi":"10.1007/s11276-024-03801-6","DOIUrl":null,"url":null,"abstract":"<p>Cognitive Radio Wireless Sensor Networks (CRWSNs) promise optimized spectrum utilization but face challenges in sustaining energy balance, particularly due to the emergence of “hot spots.” In CRWSNs, Cluster Heads (CHs) closer to the sink experience higher traffic as compared to those farther away, primarily due to their role in data collaboration and relaying to the sink. This leads to early depletion of their energy reserves and potentially causing the network to partition creating hot spots or energy holes. Effective clustering algorithms are needed to mitigate these hot spots. The main objective of the paper is to propose a novel clustering scheme titled “Unequal Clustering Energy Hole Avoidance (UCEHA) algorithm” to address hot spot issues in CRWSNs. UCEHA partitions the network into clusters based on sink proximity, selecting CHs considering node energy, communication channels, neighbors, and sink distance. An enhanced spectrum-aware AODV mechanism facilitates efficient data routing. To test and validate the proposed methodology, extensive experimentations were conducted and the results demonstrate UCEHA’s superiority over existing methods, exhibiting reduced energy consumption (average 19%), improved network load balance (average 26%), increased network lifetime (average 40%), and enhanced throughput (average 8%). These results highlight the effectiveness of UCEHA algorithm in addressing energy imbalance and hot spot issues in CRWSNs, ultimately leading to enhanced network performance and longevity.</p>","PeriodicalId":23750,"journal":{"name":"Wireless Networks","volume":"27 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11276-024-03801-6","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Cognitive Radio Wireless Sensor Networks (CRWSNs) promise optimized spectrum utilization but face challenges in sustaining energy balance, particularly due to the emergence of “hot spots.” In CRWSNs, Cluster Heads (CHs) closer to the sink experience higher traffic as compared to those farther away, primarily due to their role in data collaboration and relaying to the sink. This leads to early depletion of their energy reserves and potentially causing the network to partition creating hot spots or energy holes. Effective clustering algorithms are needed to mitigate these hot spots. The main objective of the paper is to propose a novel clustering scheme titled “Unequal Clustering Energy Hole Avoidance (UCEHA) algorithm” to address hot spot issues in CRWSNs. UCEHA partitions the network into clusters based on sink proximity, selecting CHs considering node energy, communication channels, neighbors, and sink distance. An enhanced spectrum-aware AODV mechanism facilitates efficient data routing. To test and validate the proposed methodology, extensive experimentations were conducted and the results demonstrate UCEHA’s superiority over existing methods, exhibiting reduced energy consumption (average 19%), improved network load balance (average 26%), increased network lifetime (average 40%), and enhanced throughput (average 8%). These results highlight the effectiveness of UCEHA algorithm in addressing energy imbalance and hot spot issues in CRWSNs, ultimately leading to enhanced network performance and longevity.

Abstract Image

认知无线电无线传感器网络(CRWSN)中的不平等聚类能量洞规避(UCEHA)算法
认知无线电无线传感器网络(CRWSN)有望优化频谱利用率,但在维持能量平衡方面面临挑战,特别是由于 "热点 "的出现。在 CRWSNs 中,与距离较远的簇头(CHs)相比,距离水槽较近的簇头(CHs)的流量更大,这主要是由于它们在数据协作和向水槽转发数据方面的作用。这将导致它们的能量储备提前耗尽,并可能导致网络分裂,形成热点或能量漏洞。需要有效的聚类算法来缓解这些热点。本文的主要目的是提出一种名为 "不平等聚类能量洞规避(UCEHA)算法 "的新型聚类方案,以解决 CRWSN 中的热点问题。UCEHA 根据离水槽的远近将网络划分为若干个簇,并考虑节点能量、通信信道、邻居和水槽距离来选择 CH。增强型频谱感知 AODV 机制促进了高效数据路由。为了测试和验证所提出的方法,我们进行了大量实验,结果表明 UCEHA 优于现有方法,它降低了能耗(平均 19%),改善了网络负载平衡(平均 26%),延长了网络寿命(平均 40%),提高了吞吐量(平均 8%)。这些结果凸显了 UCEHA 算法在解决 CRWSN 中能量不平衡和热点问题方面的有效性,最终提高了网络性能和寿命。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Wireless Networks
Wireless Networks 工程技术-电信学
CiteScore
7.70
自引率
3.30%
发文量
314
审稿时长
5.5 months
期刊介绍: The wireless communication revolution is bringing fundamental changes to data networking, telecommunication, and is making integrated networks a reality. By freeing the user from the cord, personal communications networks, wireless LAN''s, mobile radio networks and cellular systems, harbor the promise of fully distributed mobile computing and communications, any time, anywhere. Focusing on the networking and user aspects of the field, Wireless Networks provides a global forum for archival value contributions documenting these fast growing areas of interest. The journal publishes refereed articles dealing with research, experience and management issues of wireless networks. Its aim is to allow the reader to benefit from experience, problems and solutions described.
×
引用
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学术官方微信