Routing Protocol in 3DWSN using Hybrid Ad-LEACH Algorithm and It’s Performance Analysis

Wireless Sensor Networks (WSNs) have found extensive applications in various fields, such as environmental monitoring, smart cities, and military surveillance. As the demand for three-dimensional (3D) deployment of nodes grows, routing protocols in 3D WSNs need to be optimized for efficiency in terms of energy consumption, latency, and coverage. This paper proposes an integrated approach combining the Dijkstra algorithm and an Hybrid advanced version of the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol for efficient routing and data transmission in 3DWSNs. The Dijkstra algorithm is employed to find the shortest path between sensor nodes and the sink or base station in a 3D space, ensuring minimum energy consumption and reduced communication delay. It guarantees optimal routing by calculating the shortest distance between the source and destination nodes, considering the network’s communication range constraints. The algorithm creates a routing table to efficiently forward data packets through the network while minimizing the number of hops. In parallel, the Advanced LEACH protocol is used to improve the network’s energy efficiency by establishing clusters of sensor nodes and dynamically selecting cluster heads (CHs). In this modified version of LEACH, the selection of the CHs is based on factors like node energy levels, node proximity, and network topology, ensuring that energy is distributed evenly across the network. This approach reduces the overall energy consumption and extends the lifetime of the WSN. By integrating these two protocols, the network benefits from optimal routing and energy-efficient clustering, leading to improved network performance, extended sensor lifetime, and reduced energy consumption. This approach is suitable for large-scale, real-time WSN applications in industrial automation, healthcare monitoring, and disaster recovery systems.