Improving IoT Network Longevity with Attack Repellent Energy (SARE) Algorithm for Energy-Efficient and Secure Routing

The current IoT architecture necessitates energy-efficient and secure routing algorithms, particularly in wireless infrastructures where the risk of security issues is elevated.One of the significant challenges is the lack of precise knowledge about the residual energy of nodes, which leads to complications in the Cluster Head (CH) selection process.This research addresses the problem by proposing an attack-repellent algorithm that identifies potential CHs with accurate knowledge of residual energy, while minimizing computational overhead for security purposes.The proposed Secure Attack Repellent Energy (SARE) algorithm selects CHs based on the K-Nearest Neighbor (KNN) algorithm, which evaluates residual energy by considering the battery voltage attached to each node.This algorithm also incorporates key renewal and a secure key exchange mechanism to enhance security, with frequent link key exchanges bolstering the network's robustness against attacks.SARE algorithm introduces a novel method for CH selection that reduces the likelihood of incorrect selections due to imprecise energy information, thereby extending the network's operational lifespan.In addition to energy efficiency, the algorithm emphasizes security by frequently updating encryption keys to guard against potential breaches, ensuring that even if a key is compromised, the damage is limited to a short timeframe.To demonstrate its effectiveness, the SARE algorithm is compared with the Low Energy Adaptive Clustering Hierarchical routing (LEACH) and TSRF algorithms.Results show that the SARE algorithm significantly outperforms these existing protocols.The SARE algorithm extends the network's lifetime by 1.15 times longer than the classical LEACH protocol and improves network throughput by 1.42 times compared to the LEACH routing protocol.Additionally, the SARE algorithm effectively mitigates HOTSPOT and Energy Hole issues, which are common problems in wireless sensor networks.

Institutions

Publication Details

Journal
Tehnicki vjesnik - Technical Gazette
Published
2025-05-02
DOI
https://doi.org/10.17559/tv-20240823001937
Citations
2
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
2.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improving IoT Network Longevity with Attack Repellent Energy (SARE) Algorithm for Energy-Efficient and Secure Routing

2 citations
Tehnicki vjesnik - Technical Gazette
IoT and Edge/Fog Computing
2.97
article

Improving IoT Network Longevity with Attack Repellent Energy (SARE) Algorithm for Energy-Efficient and Secure Routing

article en
2 citations

Abstract

The current IoT architecture necessitates energy-efficient and secure routing algorithms, particularly in wireless infrastructures where the risk of security issues is elevated.One of the significant challenges is the lack of precise knowledge about the residual energy of nodes, which leads to complications in the Cluster Head (CH) selection process.This research addresses the problem by proposing an attack-repellent algorithm that identifies potential CHs with accurate knowledge of residual energy, while minimizing computational overhead for security purposes.The proposed Secure Attack Repellent Energy (SARE) algorithm selects CHs based on the K-Nearest Neighbor (KNN) algorithm, which evaluates residual energy by considering the battery voltage attached to each node.This algorithm also incorporates key renewal and a secure key exchange mechanism to enhance security, with frequent link key exchanges bolstering the network's robustness against attacks.SARE algorithm introduces a novel method for CH selection that reduces the likelihood of incorrect selections due to imprecise energy information, thereby extending the network's operational lifespan.In addition to energy efficiency, the algorithm emphasizes security by frequently updating encryption keys to guard against potential breaches, ensuring that even if a key is compromised, the damage is limited to a short timeframe.To demonstrate its effectiveness, the SARE algorithm is compared with the Low Energy Adaptive Clustering Hierarchical routing (LEACH) and TSRF algorithms.Results show that the SARE algorithm significantly outperforms these existing protocols.The SARE algorithm extends the network's lifetime by 1.15 times longer than the classical LEACH protocol and improves network throughput by 1.42 times compared to the LEACH routing protocol.Additionally, the SARE algorithm effectively mitigates HOTSPOT and Energy Hole issues, which are common problems in wireless sensor networks.

Tehnicki vjesnik - Technical GazetteVol. 32(3)
Tamil University (IN), Patna University (IN), GS Engineering (United States) (US)
Affordable and clean energy
Openalex Percentile: Top 9%
IoT and Edge/Fog Computing
2.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Improving IoT Network Longevity with Attack Repellent Energy (SARE) Algorithm for Energy-Efficient and Secure Routing · Tehnicki vjesnik - Technical Gazette (2025) | TGRS Research Map | TGRS