Dingo Algorithm-Based Efficient Group Leader Selection in Wireless Network

Energy saving is a significant problem in wireless sensor networks. To address this issue, a number of hybrid, dynamic, and static grouping techniques have recently been developed. This paper proposes an efficient Dingo Algorithm based on Efficient Group leader selection (DAEG) in wireless networks. A new method of grouping and choosing Group Leaders (GLs) in wireless networks is based on the Dingo algorithm. The fitness function of the Dingo algorithm depends on the node energy, neighbor count, distance, and Packet Received Rate (PRR) parameters. The DAEG approach objective is to minimize energy utilization and increase the network's throughput. This approach chooses a leader for each group after segmenting the network into compact groups. The leader coordinates communication between the group members and directs the traffic inside the cluster. It has been shown that the DAEG method outperforms conventional grouping and GL selection methods in terms of routing efficiency.