Documente Academic
Documente Profesional
Documente Cultură
Routing (LAR) in
Mobile Ad Hoc
Networks
Young-Bae Ko and Nitin H. Vaidya
Recipient of the MOBICOM'98
Best Student Paper Award
Problem
D
t10
B
E
route reply
B
E
Location-Aided Routing
Main Idea
Location Information
Expected Zone
Request Zone
expected zone
other regions around the
expected zone
timeout
expanded request zone
Trade-off between
latency of route
determination
the message overhead
Membership of Request
Zone
LAR Scheme 1
LAR Scheme 2
S knows the location (Xd, Yd) of
node D at time t0
Node S calculates its distance
from location (Xd, Yd): DISTs
Node I receives the route request,
calculates its distance from
location (Xd, Yd): DISTi
For some parameter ,
If DISTs + DISTi, node I
replaces DISKs by DISKi and
forwards the request to its
neighbors; otherwise discards the
route request
Expected Zone
e+v(t1-t0)
(Xd, Yd)
Evaluation
Comparing
Flooding
LAR scheme 1
LAR scheme 2
moving speed
Definition of Evaluation
Metric
Variations and
Optimizations
see
A survey on position-based routing in mobile a
d hoc networks
, M. Mauve, J. Widmer, and H. Hartenstein,
IEEE Network, Vol. 15 No. 6, 2001.