DEVELOPMENT OF THE LEACH-PDT ALGORITHM FOR MULTI-HOP ROUTING IN IOT SYSTEMS BASED ON WEIGHTED GRAPHS
DOI:
https://doi.org/10.31673/2786-8362.2026.012857Abstract
The article addresses the problem of ensuring energy
efficiency and spatial scalability of Wireless Sensor Networks (WSNs) in Internet of Things (IoT) systems.
Classical single-hop protocols (e.g., LEACH) are inefficient over large coverage areas, while existing multihop modifications suffer from the "hot-spot" problem due to the critical overloading of transit nodes. To
resolve these architectural flaws, a novel backbone routing protocol, LEACH-PDT (Parameterized Data
Transfer), is proposed. The method is based on representing the network of cluster heads as a directed
weighted graph, where the routing objective function integrates a smoothed radio channel quality indicator
(exponential moving average of RSSI) and a developed relay node "weariness index" combined with its
residual energy. The protocol's efficiency was evaluated through Monte Carlo simulation for local, medium,
and large-scale topologies (up to 500x500 m) with varying spatial locations of the base station. The results
confirm that multi-parameter graph optimization allows LEACH-PDT to dynamically bypass overloaded
relays. This provides an exponential increase in the First Node Dead (FND) metric by up to 300% compared
to standard LEACH, and preserves 30% more total operational network time compared to LEACH-MH.
The developed algorithm guarantees the prolonged maintenance of 100% spatial coverage, making it an
optimal architectural solution for critical industrial telemetry systems, smart agriculture, and perimeter
security.
Keywords: Internet of Things, Wireless Sensor Networks, routing protocol, LEACH, multi-hop
routing, graph theory, weariness index, energy efficiency
References
1. Alnawafa E., Marghescu I. New Energy Efficient Multi-Hop Routing Techniques for Wireless
Sensor Networks: Static and Dynamic Techniques. Sensors. 2018. Vol. 18, no. 6. P. 1863.
URL: https://doi.org/10.3390/s18061863.
2. Al-Sulaifanie A. I., Al-Sulaifanie B. K., Biswas S. Recent trends in clustering algorithms for
wireless sensor networks: A comprehensive review. Computer Communications. 2022.
URL: https://doi.org/10.1016/j.comcom.2022.05.006.
3. An Unequally Clustered Multi-hop Routing Protocol Based on Fuzzy Logic for Wireless
Sensor Networks / M. Adnan et al. IEEE Access. 2021. Vol. 9. P. 38531–38545.
URL: https://doi.org/10.1109/access.2021.3063097.
4. Daanoune I., Abdennaceur B., Ballouk A. A comprehensive survey on LEACH-based
clustering routing protocols in Wireless Sensor Networks. Ad Hoc Networks. 2021. Vol. 114.
P. 102409. URL: https://doi.org/10.1016/j.adhoc.2020.102409.
5. Daanoune I., Baghdad A., Ballouk A. Improved LEACH protocol for increasing the lifetime
of WSNs. International Journal of Electrical and Computer Engineering (IJECE). 2021. Vol. 11,
no. 4. P. 3106. URL: https://doi.org/10.11591/ijece.v11i4.pp3106-3113.
6. Fanian F., Kuchaki Rafsanjani M. Cluster-based routing protocols in wireless sensor
networks: A survey based on methodology. Journal of Network and Computer Applications. 2019.
Vol. 142. P. 111–142. URL: https://doi.org/10.1016/j.jnca.2019.04.021.
7. Tyagi S., Kumar N. A systematic review on clustering and routing techniques based upon
LEACH protocol for wireless sensor networks. Journal of Network and Computer Applications.
2013. Vol. 36, no. 2. P. 623–645. URL: https://doi.org/10.1016/j.jnca.2012.12.001.
8. Verma C. P. Enhancing Parameters of LEACH Protocol for Efficient Routing in Wireless
Sensor Networks. Journal of Computers, Mechanical and Management. 2023. Vol. 2, no. 1. P. 26–
31. URL: https://doi.org/10.57159/gadl.jcmm.2.1.23040.
9. Zhou Y., Wang N., Xiang W. Clustering Hierarchy Protocol in Wireless Sensor Networks
Using an Improved PSO Algorithm. IEEE Access. 2017. Vol. 5. P. 2241–2253.
URL: https://doi.org/10.1109/access.2016.2633826.