## 3 Experiments, Comparative Investigations and Results
In this preference, the computation overhead of related routing principles are denoted in Figure 12 against the changing velocity of sensor nodes. As the sensor nodes' velocity changes from 15 m/s to 45 m/s, the excessive load initiated in the sensor node's processor slowly increases and it increases energy AACR definitively. The comparison with energy-optimized routing practices is noted in terms of the excessive number of processes raised in the distributed environment. As discussed, the additional processes in each sensor node are created as a result of managing real-time issues such as node failures, link breaks, excessive route updates, etc. At this point, the computation overhead of E8 varies from 210 packets to 321 packets over the changing velocity of sensor nodes. Similarly, other techniques such as E7 have 290 packets as the computation load in the front end for a maximum velocity of 45 m/s. On the other hand, E6 produces a rate between 175 and 270 of overhead. Among these techniques, E8 was developed for the hierarchical routing model and it is not flexible with random networks. Hence, an excessive load in E8 is observed. In this case, E6 and E7 target load balance and cooperative routing procedures, respectively. The comparison between E6 and E7 shows the better contribution of the cooperative routing technique (E7) in computation reduction. As E7 uses an authentic and distributed cooperative model for computing twin-trust costs (local trust value and global trust value), the elimination of irregular nodes is easy in the network. In addition, the excessive packet transmission to unethical nodes  
Figure 12: Overall computation overhead. or inefficient nodes is ignored in the network. At any rate, the performance of E6 directly deals with low-powered computation procedures in order to limit transmissions. In this manner, the technical pitches and purposes used for establishing these existing techniques make notable performance variations. In this comparison, E3 falls in both channel and efficient routing practices in order to reduce the overloaded tasks at different layers. Accordingly, the production of computation overhead in E3 is maintained between 170 and 250 which is the minimum compared to other techniques. The experimental contributions of this article are extended to analyze the practical betterment of routing delay (routing protocol) and scheduling time (channel allotment). The motive of understanding the routing-based research techniques and channel slot management techniques leads to separate comparative observations. Hence, the implications are noted as given in Tables 7 and 8, respectively. Table 7 shows the performance of energy-efficient routing strategies (E3, E6, E7 and E8). As discussed, E3, E6, E7 and E8 mainly focus on the implementation of energy-efficient routing protocols, and routing delay calculation is an important task. With this in mind, the successful elimination of overhead and retransmission leads to minimal routing delay (milliseconds (msec)). Thus, the performance of E3 is optimal in terms of routing delay production (maximum 553 msec) during the change in the node's velocity. In this experiment, this article takes the node's velocity as changing parameter to validate the routing delay. Since the dynamic velocity rate (meter/seconds, m/s) increases the possibilities of node failures and link breaks continuously in the network, the routing delay produced from each protocol varies rapidly. In this case, E6 produces a moderate routing delay compared to other techniques such as E7 and E8. The existing techniques E7 and E8 deal with secure and hierarchical routing models; therefore, the production of routing delay is higher than E6 (load balanced and low-powered scheme). Similarly, Table 8 gives the identifications of channel scheduling strategies (E1, E2, E3 and E5) and their performance. As E3 is noted, it is a cross-layered solution for energy optimization in WSN, and it is not effective in scheduling processes.