Link Stability and Obstacle Avoidance Based Traffic-Aware Reactive Routing Protocol for Mobile Ad-Hoc Networks

Main Article Content

Veeramani. R, Dr. R. Madhan Mohan, Dr. C. Mahesh


A distinctive type of wireless network called an ad hoc network has several hops, no central hub, and dynamic architecture. The forwarding of intermediate nodes is required to achieve data communication. A mobile ad hoc network is made up of several wireless communication nodes, each of which serves as a router. The restrictive characteristics of this type of communication networks, such as its frequent topological changes and low battery power, have a significant impact on routing. Numerous studies have been conducted to enhance MANET's routing performance. The network's performance typically suffers as a result of the unstable path caused by the high traffic load on links and low energy of the nodes. Reactive MANET routing techniques handle link breaks caused by node mobility and energy consumption. For broad area networks, multi-hop communication may be more effective in terms of routing methods. To build a better quality route between source and destination, the research suggested the Traffic-Aware and Stable Ad hoc On-Demand Multipath Distance Vector protocol (TAS-AOMDV), which is an upgrade over AODV. By choosing the most stable neighbour in relation to the transmitter of the route request message and the nodes approaching throughout the route discovery process, this method aims to forecast a stable path.To reduce lost data packets and route error messages, this minimises the contention phase, predicts the route lifespan, and speeds up data packet transmission. The effectiveness of routine procedures in MANETs is substantially hampered by the existence of obstructing obstacles. This study instead looks at the dynamic and autonomous detection of potential network barriers. A combined Lion Optimization algorithm (LOA) and Dynamic Window Approach was proposed in the research to suit the needs of global optimal and dynamic obstacle avoidance in path planning (DWA). To find the path, this optimization technique has been used. The algorithm proficiently plots a path among multiple nodes over the plot area, which results in perceiving the shortest path that is optimal without obstacles. The performance analysis was carried out in Network Simulator 3.36 software. It took into account various aspects like packet delivery ratio end-to-end delay for differing traffic loads, throughput and s in the proposed scheme via existing schemes.

Article Details