Gugrajah_Yuvaan_ Ramesh_2003.pdf
Gugrajah_Yuvaan_ Ramesh_2003.pdf
Gugrajah_Yuvaan_ Ramesh_2003.pdf
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Simulation ofa Load Balancing Routing Protocol<br />
Figure 3-1. Example topology resulting in network congestion due to shortest<br />
path routing.<br />
Chapter 3<br />
An aim of the research described herein was therefore to evaluate a routing protocol<br />
that would perform load balancing in order to ensure that congestion in the network<br />
would be avoided. Table-driven routing protocols were not considered suitable<br />
because the mobility of the ad hoc network results in unnecessary overhead being<br />
created due to table updates. Hierarchical, zone and cluster based schemes were<br />
avoided because the aim was to treat all nodes equally and in these types of routing<br />
protocols selected nodes tend to use more resources than other nodes when<br />
maintaining local information. The aim was also to avoid periodic beaconing to<br />
conserve power.<br />
Dynamic Load Aware Routing (DLAR) [GerlaOO] is an on-demand routing protocol<br />
that takes load balancing into account by determining the state of the buffers of<br />
nodes along possible routes. DLAR has three original schemes, each differing in the<br />
manner in which the buffer contents are evaluated for route selection. This chapter<br />
discusses the modifications made to DLAR to iNclude a fourth scheme that also takes<br />
into consideration expected signal quality and the signal to interference ratio (SIR)<br />
along the route. Although SSR (described in Section 2.2.3.2) also takes into<br />
consideration signal quality, the DLAR implementation proposed herein avoids the<br />
periodic beacons of SSR and allows adaptive route selection from multiple possible<br />
3-2