Packet P reaches destination D provided that D is reachable from sender S.

Sequence numbers used to avoid the possibility of forwarding the same packet more than once.

Each node receiving P forwards P to its neighbors.

Sender S broadcasts data packet P to all its neighbors.

Which approach achieves a better trade-off depends on the traffic and mobility patterns Computer Network.

Proactive protocols can (but not necessarily) result in higher overhead due to continuous route updating

Reactive protocols may have lower overhead since routes are determined only if needed.

Overhead of route discovery/maintenance.

Reactive protocols may have higher latency because a route from X to Y will be found only when X attempts to send to Y

Proactive protocols may have lower latency.

Traditional link-state and distance-vector routing protocols are proactive.

Determine routes independent of traffic pattern.

some attempts made to develop adaptive protocols Computer Network.

No single protocol works well in all environments.

Others are adapted from previously proposed protocols for wired networks.

Some have been invented specifically for MANET.

Rate of link failure/repair may be high when nodes move fast.

link failure/repair due to mobility may have different characteristics than those due to other causes.

Less energy consumption Wireless Mobile Ad hoc Networks.

Quick reconfiguration in case of failure.Comparison of routing protocols Computer Network.

A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Computer Network.

A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks.

Comparison of Routing Metrics for Static Multi-Hop Wireless Networks.

De Couto, Daniel Aguayo, John Bicket, Robert Morris

“A High-Throughput Path Metric for Multi-Hop Wireless Routing (ETX)” By Douglas S.

How to Rout packets in an Ad hoc network?.

Special Topicson Wireless Ad-hoc Networks Lecture 11: Ad-hoc Wireless Routing University of Tehran Dept.

Panda wireless pau05 ad-hoc