## 4 Result and Discussion
### Comparative Analysis with Other Methods  
This section provides the result analysis and comparison of the proposed and existing methods in terms of the secure routing algorithm blockchain protect (SRABC), ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR), highly efficient dual authenticated routing (HEDAR), secured encryption technique with optimum route discovery (SETORD), the OLSR, destination sequenced distance vector (DSDV), geographic routing protocol (GRP) and hybrid wireless mesh protocol (HWMP). Figure 12 depicts the comparison of the proposed and existing OLSR protocols. In order to validate the OLSR protocol, it is essential to guarantee its dependability, effectiveness, and security in MANET implementations. Also, the OLSR protocol improves performance and enhances security. Figure 12a-k depicts the comparison of the proposed and existing OLSR protocols. The studied OLSR has large networks with lots of nodes that can be handled. For dynamic wireless networks, the OLSR provides a reliable and effective routing solution. The proposed OLSR protocol has energy efficiency, scalability, low overhead, quick convergence, loop-free routing, many routes, and fast convergence. Also, with the energy-efficient design, the OLSR can be used in wireless connections with a short battery life. Through the comparison analysis with other existing protocols, the proposed protocol is validated by achieving better results in every performance metric. Simulation Outputs  
The evaluation of the simulation result is displayed in this section. First, randomly generate the blockchain connection. After that, communication occurs inside the MANET, then the blockchain is integrated into the network, and nodes are recognized by their relevant weights. The most efficient method of interaction has also been used to finish a transaction over the MANET. At last, a range of attacks are included in the set of data in training, and a range of assaults are validated in datasets by testing. The creation of a node in the MANET blockchain with the proper weight is shown in Figure 13.  
Figure 12: _Cont_. may result in improved network performance generally and in transaction confirma-tion times. Also, Figure 13b-d shows the shortest-path calculation. Due to its ability to quickly recalculate routes and preserve connectivity, shortest-path algorithms can dynamically adapt to changes in network topology, such as those caused by node mo-bility or link failures. As networks grow, the shortest-path algorithms are a good choice since they can manage larger MANETs more effectively than certain routing tech-niques. The simulation parameters of the proposed method are depicted in Table 3.  
Figure 14 and Table 4 show the average end delay(s) of the proposed methods by varying pause time. This graph demonstrates that the average end delay rises with the pause time over a period of time. For a pause time of 20, the proposed model achieves an average end delay of 19.2 s, compared to the average end delays of the existing SRABC, GRP, and HWMP methods, which are 18.2, 14.21, and 12.34 s, respectively. For a pause time of 40, the proposed model achieves an average end delay of 20.5 s, com-pared to the average end delays of the existing methods of 19.1, 15.5, and 13.4 s, re-spectively. For a pause time of 60, the proposed model achieves an average end delay of 21.3 s, compared to the average end delays of existing methods of 20, 16.4, and 14.34 s, respectively. For a pause time of 80, the proposed model achieves an average end delay of 22.6 s, compared to the average end delays of the existing methods of 21.2, 17.71, and 15.45 s, respectively. For a pause time of 100, the proposed model achieves an av-erage end delay of 23.6 s, compared to the average end delays of the existing methods of 22, 18.34, and 16.12 s, respectively. As a result, the graph indicates that the recom-mended technique performs better in terms of end-to-end delay. Figure 15 and Table 4 show the average end delay(s) of the proposed and existing methods by varying pause time.