An Enhanced LEACH-Based Dynamic Routing Framework for Energy-Efficient Heterogeneous Wireless Sensor Networks
TL;DR
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.
Abstract
Wireless Sensor Networks (WSNs) are generally constrained by their built-in energy limits, leading to very short operational lifespans. Moreover, the node energy reserves of homogeneous WSNs are far lower than those of heterogeneous WSNs. For this reason, energy-efficient routing is a core optimization direction for this type of network. 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. We propose to enhance energy efficiency 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. It is a widely agreed conclusion in the field that hierarchical routing for heterogeneous WSNs outperforms flat routing and location-based routing in both energy efficiency and scalability. This paper also implements three supporting technologies: topology control, adaptive routing, and power management. These technologies reduce energy consumption through multi-hop clustering and optimized relay selection, ultimately supporting more flexible routing strategies, extending the network's operational cycle, and meeting the application requirements in the Internet of Things and information technology fields.