Proactive Schemes
Determine the routes to various nodes in the network in advance, so that the route is already present whenever needed. Route Discovery overheads are large in such schemes as one has to discover all the routes. Consumes bandwidth to keep routes up-to-date Packet forwarding is faster as the route is already present. Examples of such schemes are the conventional routing schemes, Destination Sequenced Distance Vector (DSDV).
Reactive Schemes
Determine the route when needed .Smaller Route Discovery overheads. Employs flooding(global search) A node trying to transmit a packet may have to wait for route discovery. Examples of such schemes are Dynamic Source Routing, Ad-Hoc On Demand Distance Vector Routing (AODV) etc.
Flooding
Some routing protocols will find a apart form proactive and reactive there is another mechanism called Flooding. In flooding no route is computed or discovered. A packet is broadcasted to all the nodes in the network. Flooding is the easiest routing method, however it generates heavy traffic.
Different proactive, reactive and even hybrid (reactive as well as proactive) schemes e.g. Zone Routing Protocol, have been proposed for Wireless Ad-Hoc networks
Determine the routes to various nodes in the network in advance, so that the route is already present whenever needed. Route Discovery overheads are large in such schemes as one has to discover all the routes. Consumes bandwidth to keep routes up-to-date Packet forwarding is faster as the route is already present. Examples of such schemes are the conventional routing schemes, Destination Sequenced Distance Vector (DSDV).
Reactive Schemes
Determine the route when needed .Smaller Route Discovery overheads. Employs flooding(global search) A node trying to transmit a packet may have to wait for route discovery. Examples of such schemes are Dynamic Source Routing, Ad-Hoc On Demand Distance Vector Routing (AODV) etc.
Flooding
Some routing protocols will find a apart form proactive and reactive there is another mechanism called Flooding. In flooding no route is computed or discovered. A packet is broadcasted to all the nodes in the network. Flooding is the easiest routing method, however it generates heavy traffic.
Different proactive, reactive and even hybrid (reactive as well as proactive) schemes e.g. Zone Routing Protocol, have been proposed for Wireless Ad-Hoc networks
2 comments:
Helpful Mateials for Begginer its too Much easy and to the point
Best Regards,,,,,
Riaz Ali
Thanks alot!! so helpful..its s straight to the point...#vokeh bushman
Post a Comment