## 4 Proposed Model  
Numerous authors have specifically attempted to expand the workflow of the standard OLSR routing protocol by varying throughput and also clustering of nodes which help to enhance performance. The performance of OLSR depends upon the lost link the packets are not forwarded to the lost link but packets are forwarded along the fresh shortest way, and the neighbors hold time is the maximum amount of time a node waits for a link to respond for symmetric in the event of a broken link. Standard OLSR has some limitations and problems, such as:1. Scalability: OLSR suffers from scalability issues in large networks due to its flooding mechanism, which can result in a significant increase in control traffic overhead. 2. Mobility and Poor MPR Selection: The OLSR protocol does not handle high node mobility very well, and frequent topology changes can cause instability and packet loss. Due to the control traffic overhead, it leverages a poor Multi-point Relay (MPR) selection mechanism. 3. Congestion: OLSR assumes that the network is always underutilized, which can result in congestion and poor performance in high-traffic situations. 4. Energy efficiency: OLSR may not be energy-efficient, especially in mobile ad hoc networks where nodes have limited battery power. The frequent exchange of control packets can drain the battery of nodes quickly. 5. Quality of Service (QoS): OLSR does not provide any QoS guarantees, and the routing decisions are based solely on the hop count metric, which may not always result in the best path for real-time applications. To address the above concerns the proposed enhanced OCI-OLSR scheme is presented which will overcome the above said issues. To strengthen the OLSR scheme as depicted in Figure 4 an optimized OCI-OLSR algorithm is formulated to get coupled in standard OLSR in which the neighbor hold time is the maximum waiting period for which a node waits for a hello packet. After the expiry of the waiting period, the link is declared to be lost. The neighbor hold-time in the proposed scheme is reduced to 1 s to minimize the delay which results in packet loss. The neighbor hold-time decreases the delay for nodes as instead of waiting for a link to respond, the node is free to route alternative packets. Secondly, the control intervals are optimally used for optimal performance. As a result, more fresh routes are constantly present in the network to choose for routing. Lastly, in the event of both mobility and failures, there is a repeated exchange of messages including the network state for the existing network. In order to lessen control traffic overhead, it leverages the Multi-point Relay (MPR) technology. The following two messages are continuously issued in a network with n nodes and k average neighbors. * Hello Messages: Every node is able to gain information about its neighbors up to two hops away according to these messages. Each node selects its multi-point relay nodes using this information. * Topology Control Messages: Every node broadcasts control messages defined as topology control messages across the whole system to maintain a database essential for packet routing. To assess its MPR selector set, diverse nodes broadcast a TC message on a regular basis. The MPR selection process is modified by the proposed OLSR, and its algorithm is shown in Algorithm 1. This algorithm's direction calculation is based on the idea of cross and dot products. A third vector is produced by taking the cross-product of two distinct vectors. The two input vectors will be parallel to each other in the final vector. Here, the availability or insufficiency of a target node in the right or left direction of the sender node is confirmed by employing the dot product of two vectors. Each node will upgrade its MPR set each time the topology changes. Take into consideration the fact whenever source node E intends to send packets of data to receiving node Q. E will first specify whether node Q is on the right or left side of the channel by examining its positioning.