Gugrajah_Yuvaan_ Ramesh_2003.pdf
Gugrajah_Yuvaan_ Ramesh_2003.pdf
Gugrajah_Yuvaan_ Ramesh_2003.pdf
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Routing Protocols for Ad Hoc Networks<br />
2.2.2.4. Discussion on Reactive Protocols<br />
Chapter 2<br />
A reactive routing protocol attempts to discover a route to a destination only when it<br />
is' presented with a packet for forwarding to that destination. This increases the<br />
latency of delivering the packet since discovery must be completed before the packet<br />
can be sent. Also, without additional information, a protocol using on-demand<br />
routing must search the entire network for a node to which it must send packets.<br />
Discovering a new route therefore remains a costly operation. The use of some sort<br />
of route cache can be used to avoid the need to re-discover each routing decision for<br />
each individual packet. However, the cache itself may contain out-of-date<br />
information indicating that links exist between nodes that are no longer within<br />
wireless transmission range of each other. This stale data represents a liability that<br />
may degrade performance rather than improve it.<br />
Various comparative simulations of AODV and DSR have been published in the<br />
literature. Broch et al [Broch98] at Carnegie Melon University (CMU) developed ad<br />
hoc networking extensions for the ns2 network simulator [Ns02] to compare DSDV,<br />
TORA, DSR and AODV. Another simulation was scenario-based [Johansson99]<br />
which simulated DSDV, AODV and DSR in a conference setting, event coverage<br />
situation and a disaster area. Das et al [DasOl] compared AODV to DSR.<br />
[DasOl] concluded that in terms of throughput and delay DSR outperforms AODV<br />
when average node speed and load is low while AODV outperforms DSR with<br />
widening performance gaps with high load and higher node speeds. However, it was<br />
found that DSR consistently generates less routing overhead than AODV. This is<br />
because AODV made more frequent route requests. The aggressive caching used in<br />
DSR and the inability to expire stale routes were recognized.as DSR's weaknesses.<br />
[Johannson99] also found that DSR and AODV perform relatively similarly with<br />
similar conclusions to [DasOl]. [Broch98] found that while DSR and AODV<br />
performed relatively similarly, at higher node speeds the routing overhead of AODV<br />
is more expensive. Both [Broch98] and [Johannson99] found that DSDV had<br />
difficulties in maintaining valid routes when the average node speed was increased<br />
due to DSDV being a proactive protocol. [Johannson99] concluded that the reactive<br />
2-13