265
MOBILITY MODELS FOR MULTIHOP WIRELESS
also represented by a point on some street. e movement algorithm
from the current position to the new destination finds a path that will
produce the shortest travel time between the two points. Moreover,
safe driving characteristics including speed limit and a minimum dis-
tance allowed between any two mobile nodes exist. After reaching the
destination, the mobile node has to again pause for a specified time
and before randomly choosing another destination (i.e., a point on
some street). After this the process is repeated.
8.3 Limitations of the Random Waypoint Model
and Other Random Models
e design characteristics of the random waypoint model and its vari-
ants try to mimic the movement of mobile nodes ...