AODV Routing In Wireless Ad-hoc Networks

Computer Engineering

The main challenge is to transmit the packets in multiple paths ,so it reduces the time delay and improve the delay performance and expected time delay over existing opportunistic routing policies. Before transmission occurs, transceiver send some broadcast signals to probability of neighbours nodes . Neighbours nodes receiving that signals after that neighbours nodes respond signals to that transceiver. If receiving respond signal by first node transceiver then resend acknowledgement to their neighbours nodes. After that a link quality checks the link state in the nodes by using two methods active and passive probing. Before transmitting the packets router send some broadcast signals over a different network And getting some response from various routers. Based on that concept router knows good link So we can use good link for our transmissions. A distance-vector routing protocol send and receive updates, calculates best path, detect and react topology changes. The DVRP achieve by router send some request as broadcast to their neighbour’s nodes and get back some response from their neighbour’s using that router calculate the distance between the sender and receiver node. Traffic is a main problem during data transmission in all network, so we have to solve this problem by choosing traffic less path .In this module, we choose only traffic free path only. Before transmission occurs we get three paths based on the priority. Traffic is a main problem in networks, so we choose the less traffic path in nodes.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.