## 9 Mobility Environment
### Scenario 1 Results  
Figure 6(a) depicts the simulation results of the proposed OCS-AODV routing scheme and it was compared to CS-DSDV and ACO-AODV protocols. The proposed scheme achieved the best performance because of the effectiveness of its OCS technique. A selected path tends to be optimal. Hence, the scheme delivered more packets than the other schemes. The study observed that the CS-DSDV protocol performed badly throughout the simulation due to nodes moving away from their original location, exiting the network, and others joining the network. This causes frequent reconfiguration of mobile nodes as they keep updating each other about the state of the network. So, the scheme is subjected to link breakages whereas, after a link breaks, it also fails to rediscover the link quickly. The study did not use the congestion control or avoidance mechanism to stabilize the traffic load accordingly. When the number of nodes increased within the network, the proposed scheme experienced a decrease in PDR. The nature of ACO-AODV iteration can prohibit the use of ongoing applications while the ant-colony optimization takes an exceptionally long time to converge; thus, the two protocols were outperformed by the cuckoo search algorithm. The packet loss occurs when packets are sent across the network and are not delivered to their destination. Figure 6(b) presents the outcomes of the packets lost throughout the data transmission. The proposed scheme OCS-AODV performed better than the CS-DSDV and ACO-AODV protocols, as it dropped the least number of packets. The scheme guarantees the reliability of a route and the network resources consumed by each application. The packets may be lost due to signal interruption or network performance challenges. We also observed that during the busiest periods, congestions occur frequently. When a connection is congested with heavy traffic, the data packets are dropped. However, the proposed scheme is effective, as it first checks the quality of routes before granting any request for transmission. The disadvantage of the CS-DSDV is that it regularly updates the routing tables, which uses up the battery power and the node's resources; thus, it loses more packets. We consider scenario two, where the number of mobile nodes ranging from 60 to 100. We observed that in terms of PDR, the proposed scheme performs best. This enhancement was accomplished by implementing the optimized CS scheme, for example, the connection lifespan and reliability, which impacts the PDR by selecting stable paths as optimal routes. As the number of nodes increases, the network environment becomes congested, and this reduces the chances of having a higher PDR, which affects all the routing protocols. Figure 6: Packet Lost and Packet Delivery Ration Results for the three routing protocols: (**a**) The Packet delivery Ratios of the three Routing Protocols (**b**) Number of Packets Lost during the Simulation. Figure 7 depicts the simulation results that demonstrate that OCS-AODV is the best performing protocol due to lower rates of packet loss and higher PDR. CS-DSDV is marginally better, which means that it would perform better if the route-discovery challenge can be addressed to enable the delivery of more packets. We also observed that, as the mobile nodes increased in CS-DSDV, the scheme experienced many delays that affected the delivery of transmitted packets. The challenge of the ACO-AODV is the process of discovering paths. When a link is broken, the scheme is not efficient enough to handle a congested environment, as illustrated in Figure 7a. Figure 7b shows the performance of the schemes in terms of packet-loss metrics. The CS-DSDV and ACO-AODV incurred many packets losses due to the collision of packets, link breakages, inadequate bandwidth, and higher overhead. The fitness function value of the OCS-AODV route selection was configured based on route lifespan and reliability. Applying these factors contributed to the selection of more stable routes with fewer link breakages, impacting the packet loss positively.