## 3 Proposed Methodology
### Data Transmission  
All nodes handshake with one another and communicate their attributes with the predecessor node in the route to start the network's functioning and route discovery. By calculating the distance between the two nodes using their position attribute obtained during handshaking, the neighbour node is selected. To find the route, each node needs to be handshaking with other nodes. When a route is discovered, node N1 is taken for the source node, and the other nodes are taken into account when selecting the optimal neighbournode. Currently, N1 is sending \"HELLO\" messages to every other node and is receiving \"REPLY\" messages in return. Figure 5 depicts the proposed data transmission flowchart. Now, node N1 sends a message to node N2, who then begins sending \"HELLO\" packets to all of the other nodes and receiving \"REPLY\" messages from them. It is possible to obtain multipath in a similar way between the source and destination nodes. The forwarder determines the candidate node's distance from both the forwarder and the sink for each transmission. The priority rises with decreasing value. The highest priority node in each forwarder set is the first to be enlarged, followed by nodes whose distances are less than the node transmission radius (Cr), and finally, nodes in the Ci whose distances are less than the communication radius for all nodes already present in the cluster. The forwarder chooses the highest priority set as the next-hop forwarder set after performing the calculation. If the highest priority set is unable to transmit, the remaining forwarder set will only transmit the packets in order. We introduce an EL to balance energy consumption; to do this, we divide the node's original energy into m equal parts. If the current energy of a node is greater than \(i\)-1 parts and less than or equal to I parts, the node's EL is \(i\) (\(1\leq i\leq m\)). Each uw-sensor has 2 transmission options during the steady data transmission phase: sending the packets via MT or sending them straight to the uw-sink (DT). The Algorithm 1 represents the proposed IEDA_HEGO system. Figure 5: Proposed data transmission flowchart. ```

**Algorithm 1**Algorithm of IEDA-HGEO. ## 4 Experimental Analysis

Settings for many parameters can be seen in Table 1. Unlike earlier studies, the network is deployed in three dimensions. The region in three dimensions is 1000 \(\times\) 2000 \(\times\) 250 m\({}^{3}\). Where BS is located at the ocean's surface, there are 1055 sensor nodes. Nodes are spread out at random between 1000 and 250 metres. The 260-m transmission radius of SN allows for packet delivery in three to four hops. There are four different packet sizes: 1500, 2000, 3000, and 4000 bytes. RNs, CHs, and CCOs aid in achieving network connectivity. The RPK and SPK control packet sizes are set to 13B and 9B, respectively. In IEDA-HGEO, a levelling parameter of 0.85 has been selected for link quality. For data packets, the transmission power is set at 2.8 W, while for control packets, it is 1.5 W. The SNs can produce random packets, and the chain made up of the RNs, CHs, and CCOs should be used to forward these packets to the BS. In the simulations, 4300 packets are created with various payload counts, and energy usage is noted. The MATLAB simulator (R2021a) was used to carry out the experiments. It is a shorter version of \"matrix and laboratory\" and was invented by MathWorks. For research investigations, structural engineering, and a wide range of scientific issues needing precise numerical estimates, Matplotlib offers a complete answer. This section evaluates and compares the performance of the proposed improved efficient data aggregation in IEDA-HGEO with that of two existing widely used routing protocols: ERP2R and EGRC. These two algorithms were chosen because they are well-known in the literature and share the same objectives as the method under consideration.