Segment Routing for WSN Using Hybrid Optimisation With Energy Efficient Game Theory Based Clustering Technique

This research focuses on wireless sensor networks (WSNs) and proposes a three‐phase approach to achieve energy‐efficient routing. The approach consists of node deployment using Voronoi diagrams, clustering, cluster head (CH) selection using energy‐efficient game theory, and a routing strategy based on improved pelican Optimisation (ImPe) segment routing. Random deployment of sensor nodes in WSNs can lead to coverage issues, and hence, in order to address this, Voronoi‐based node deployment is employed to ensure uniform and balanced coverage of the monitoring area. An energy‐efficient game theory‐based approach is used for CH selection, which considers factors such as network conditions and energy levels to select CHs, preventing specific nodes from becoming overburdened and ensuring smoother data collection. The proposed routing mechanism utilises segment routing, which provides deterministic routing paths from CHs to the sink. Segment routing eliminates the need for route discovery and maintenance, making it energy‐efficient. The ImPe algorithm that works on the characteristics of pelican search agents is employed to choose the optimal segment path for information sharing. The assessment based on delay, network lifetime, packet delivery ratio, residual energy and throughput by the proposed ImPe segment routing acquired the values of 2.1494, 98.9685, 99.1109, 0.9856, and 250.7044, respectively.