Optimizing energy efficiency in WSNs through dynamic sensor deployment and advanced clustering

IF 0.8 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Dinesh Sharma, Geetam Singh Tomar
{"title":"Optimizing energy efficiency in WSNs through dynamic sensor deployment and advanced clustering","authors":"Dinesh Sharma, Geetam Singh Tomar","doi":"10.1007/s10878-026-01423-6","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks (WSNs) have revolutionized data capture and utilization in agricultural fields. With the potential to incorporate thousands of nodes, WSNs enable agile sensing and communication. However, the limited life cycle of the sensor nodes and their energy sources pose a significant challenge. Maximizing their utilization and efficiency becomes paramount. This paper presents an advanced deterministic energy-efficient clustering protocol that selects cluster heads to extend the lifespan of sensor nodes. Our algorithm intelligently selects the cluster heads, improving the overall lifespan of the network considering the position, distance, and residual energy of the nodes. This approach addresses the primary concern of efficient energy use in WSNs. To assess the efficiency of our proposed protocol, we conducted fifty simulations using the NS3 simulator, employing the advanced deterministic energy-efficient clustering algorithm. We analyze the simulation results to show the effectiveness and efficiency of our approach. Unlike many existing probabilistic routing protocols that rely solely on residual energy, our architecture incorporates a dynamic approach to calculate the number of sensors required for complete field coverage. In addition, we devised a routing protocol that intelligently selects cluster heads, optimizing communication within the network. The ADEC protocol optimizes the utilization of the sensor nodes by calculating the number of sensors required based on the area and the range of detection. For example, in a 100x100-meter area, our algorithm determines that only 74 sensors are required, compared to the previous requirement of 100 sensors. This method allows users to input an initial field area (e.g. 100x100 meters) and subsequently provide new values for multiple simulations (e.g., 120x120 meters), ensuring that all simulations follow the specified sequence. The algorithm dynamically adjusts the sensor count for each area, extending the WSN’s lifespan by significantly delaying the last node’s failure.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"14 1","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2026-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-026-01423-6","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Wireless sensor networks (WSNs) have revolutionized data capture and utilization in agricultural fields. With the potential to incorporate thousands of nodes, WSNs enable agile sensing and communication. However, the limited life cycle of the sensor nodes and their energy sources pose a significant challenge. Maximizing their utilization and efficiency becomes paramount. This paper presents an advanced deterministic energy-efficient clustering protocol that selects cluster heads to extend the lifespan of sensor nodes. Our algorithm intelligently selects the cluster heads, improving the overall lifespan of the network considering the position, distance, and residual energy of the nodes. This approach addresses the primary concern of efficient energy use in WSNs. To assess the efficiency of our proposed protocol, we conducted fifty simulations using the NS3 simulator, employing the advanced deterministic energy-efficient clustering algorithm. We analyze the simulation results to show the effectiveness and efficiency of our approach. Unlike many existing probabilistic routing protocols that rely solely on residual energy, our architecture incorporates a dynamic approach to calculate the number of sensors required for complete field coverage. In addition, we devised a routing protocol that intelligently selects cluster heads, optimizing communication within the network. The ADEC protocol optimizes the utilization of the sensor nodes by calculating the number of sensors required based on the area and the range of detection. For example, in a 100x100-meter area, our algorithm determines that only 74 sensors are required, compared to the previous requirement of 100 sensors. This method allows users to input an initial field area (e.g. 100x100 meters) and subsequently provide new values for multiple simulations (e.g., 120x120 meters), ensuring that all simulations follow the specified sequence. The algorithm dynamically adjusts the sensor count for each area, extending the WSN’s lifespan by significantly delaying the last node’s failure.
通过动态传感器部署和高级聚类优化无线传感器网络的能源效率
无线传感器网络(WSNs)已经彻底改变了农业领域的数据捕获和利用。由于有可能包含数千个节点,wsn可以实现敏捷的感知和通信。然而,传感器节点有限的生命周期及其能量来源构成了重大挑战。最大限度地利用和提高效率变得至关重要。本文提出了一种先进的确定性节能聚类协议,该协议通过选择簇头来延长传感器节点的寿命。我们的算法智能地选择簇头,考虑节点的位置、距离和剩余能量,提高网络的整体寿命。该方法解决了无线传感器网络中能源高效利用的主要问题。为了评估我们提出的协议的效率,我们使用NS3模拟器进行了50次模拟,采用先进的确定性节能聚类算法。仿真结果表明了该方法的有效性和高效性。与许多现有的仅依赖于剩余能量的概率路由协议不同,我们的架构采用了一种动态方法来计算完全现场覆盖所需的传感器数量。此外,我们还设计了一种路由协议,可以智能地选择簇头,优化网络内的通信。ADEC协议通过根据区域和探测范围计算所需传感器的数量来优化传感器节点的利用率。例如,在100x100米的区域中,我们的算法确定只需要74个传感器,而不是之前的100个传感器。该方法允许用户输入初始场面积(例如100x100米),随后为多个模拟(例如120x120米)提供新值,确保所有模拟都遵循指定的顺序。该算法动态调整每个区域的传感器数量,通过显著延迟最后一个节点的故障来延长WSN的使用寿命。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书