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 Chapter 3<br />
direction and speed. But since nodes move towards the boundaries and pause at the<br />
boundaries, the average hop count between node pairs is higher than the average hop<br />
count in simulations using other mobility models. Network partitions also occur<br />
more frequently [DaviesOO].<br />
The simulation results discussed in this chapter are based on simulations using the<br />
original Random Waypoint Mobility Model, since it was not necessary to ensure that<br />
nodes had a constant number of neighbours and the periodic increase and decrease in<br />
the average number of neighbours could actually help to demonstrate the robustness<br />
of the routing protocol.<br />
Assign random<br />
position to node<br />
X-pOS E [0, x_max]<br />
Y-pas E [0, y_max]<br />
...<br />
...<br />
Choose random<br />
destination<br />
X_dest E [0, x_max]<br />
Y_desl F [O,y_max]<br />
Choose random<br />
velocity<br />
vel E [0, v_max]<br />
"<br />
Move to destination<br />
(X_desl, Y_desl) at<br />
vel m1s<br />
Wait pause_time<br />
Figure 3-5. Flowchart for Random Waypoint Mobility model for a single node<br />
3-14
Change language