Skip to content
Open access

An Optimal Routing for Chain-based Heterogeneous Wireless Sensor Networks

Aug 2026 · International Journal of Wireless and Microwave Technologies · Vol 16, pp. 251-274 · 0 citations

TL;DR

The suggested ORB-PEGASIS algorithm increases the network lifetime of the HetWSNs by, according to a comparison of the obtained results with various algorithms, including PEGASIS-E by 68.42%, PEGASIS by 112.8%, PEG-ACO by 60.43%, and IEEPB-KMO by 58.47%.

Abstract

The longevity of the network depends on making the correct route decisions. The term "optimal routing" in wireless sensor networks refers to selecting the best path among the available routes in order to reduce energy consumption and increase network lifetime. Numerous optimization algorithms considering parameters like energy remaining in a node, node distance, network topology, and link quality when choosing the best routes. In order to enable data aggregation and energy-efficient routing through the CH, optimal routing techniques are typically implemented in cluster-based WSNs. In Heterogeneous WSNs (HetWSNs), reliability studies pertain to the network's capacity to deliver information to the base station. Extreme weather conditions, sensor node battery depletion, hardware and software malfunctions, and other factors all have an impact on a heterogeneous WSN's reliability. This article examines the application of optimal routing to both chain-based HetWSNs and also focuses on reliability studies in HetWSNs with chain-based connections that use optimal routing. For five levels of energy-based HetWSNs, an algorithm known as ORB-PEGASIS (Optimal Routing Based Power Efficient Gathering in Sensor Information System) is created. Our suggested ORB-PEGASIS algorithm increases the network lifetime of the HetWSNs by, according to a comparison of the obtained results with various algorithms, including PEGASIS-E by 68.42%, PEGASIS by 112.8%, PEG-ACO by 60.43%, and IEEPB-KMO by 58.47%.

Read PDF

Similar papers

Open access Aug 2026

An Enhanced LEACH-Based Dynamic Routing Framework for Energy-Efficient Heterogeneous Wireless Sensor Networks

The core research goal of this paper is to optimize dynamic routing protocols to improve the performance of the classic LEACH protocol in heterogeneous WSNs through a real-time adaptive scheme, which relies on two core methods: a cluster head selection mechanism based on the residual energy criterion, and a priority hop count strategy.

Vishwajit K. Barbudhe, Shruti Dixit · 0 citations
Open access Aug 2026

FGOGNN: An Energy-Efficient and Intelligent Cluster-Based Routing Protocol for Wireless Sensor Networks

A novel cluster-based routing protocol that integrates a Fungal Growth Optimizer for adaptive cluster head (CH) selection and a Graph Neural Network for inter-cluster routing, which demonstrates FGOGNN’s potential for deployment in real-time WSN applications, where energy efficiency and dynamic adaptability are paramount.

Huang-shui Hu, Shuo Liu, Qier Kang et al. · 1 citation
Open access Aug 2026

THGCDTR-RP: A triple-hybrid swarm intelligence and tree-based routing protocol for energy-efficient wireless sensor networks

ThGCDTR-RP is proposed, an energy-efficient clustering and routing protocol that integrates Grey Wolf Optimizer, Cheetah Optimizer, and Differential Evolution for cluster-head (CH) selection that consistently outperforms LEACH, LPSO, LGWO, WOA-P, and LACO.

Xuan Yang, Jiaqi Yan, Desheng Wang et al. · 0 citations
Open access Jul 2026

A local-update tree-based routing algorithm for WSNs

To address premature node failure in wireless sensor networks (WSNs) caused by limited energy and uneven energy consumption, this article proposes a tree-based routing algorithm with local update capability. Building upon traditional tree-based routing architecture, this algorithm classifies nodes into different tiers according to their residual energy, geographical location, and current connectivity status. These tiers undergo real-time dynamic updates to adapt to packet transmission demands. Routing paths are adaptively adjusted based on tier variations: when a node’s tier rapidly decreases, its associated routes undergo local updates to minimize energy consumption, thereby prolonging the life time of lower-tier nodes as effectively as possible. Simulation results demonstrate that compared with three other algorithms, the proposed algorithm achieves a more balanced energy consumption distribution among nodes, significantly extends the network’s stability period, and further enhances the overall network lifetime.

Ni Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.