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.
Routing Protocols for Ad Hoc Networks Chapter 2<br />
other nodes in the network. The transmission period of the LPs is detennined by the<br />
mobility of a node. The faster a node moves, the more often it must communicate its<br />
location. Dream also uses "distance effect" which is the fact that the greater the<br />
distance separating two nodes, the slower they appear to be moving with respect to<br />
each other. Nodes that are far apart from each other therefore need to update each<br />
other's locations less frequently than nodes closer together. Each LP has a certain<br />
"lifetime" in terms of geographical distance which detennines how far an LP travels<br />
before being discarded. Faster moving nodes transmit shorter lived LPs more<br />
frequently while slow moving nodes transmit longer lived LPs less frequently. By<br />
differentiating between nearby and faraway nodes, DREAM attempts to limit the<br />
overhead of LPs.<br />
LPs are used to update the location tables of the receiving nodes and contain the<br />
source identification, coordinates of the source, and the time the LP originated. When<br />
a source node needs to transmit data to a destination node, it calculates a circle<br />
around the most recent location information for the destination nodes, much like the<br />
expected zone in LAR. The source then defines the forwarding zone to be a cone<br />
whose vertex is at the source node and whose sides are tangent to the circle<br />
calculated for the expected location of the destination node. The authors of DREAM<br />
[Basagni98] use a minimum cone angle of 30° in their simulation. The source node<br />
then forwards the data packet to the neighbours in the forwarding zone. This is unlike<br />
LAR and other on-demand routing protocols where a route request is forwarded first.<br />
The neighbours receiving the data packet then compute their own forwarding zones<br />
based on their own location tables and forward the data packet accordingly. When<br />
the destination receives the data packet an acknowledgement (ACK) is returned to<br />
the source along the reverse of the path that was used for the data. If the source does<br />
. .<br />
not receive the ACK within a timeout period, the source resorts to the DREAM<br />
recovery procedure, which involves flooding the data packet through the network. A<br />
destination node receiving a flooded data packet does not return an ACK. DREAM<br />
also defines a timeout value on location information. A source node resorts to<br />
flooding if the location information is older than the specified limit.<br />
2-20