190 likes | 313 Views
Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks. Tzay-Farn Shih Department of Computer Science and Information Engineering, Chaoyan, University of Technology Hsu-Chun Yen Department of Electrical Engineering, Nation Taiwan University
E N D
Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks Tzay-Farn Shih Department of Computer Science and Information Engineering, Chaoyan, University of Technology Hsu-Chun Yen Department of Electrical Engineering, Nation Taiwan University Wireless Network 2006
Outline • Introduction • Related Work • Location-Aware Routing protocol with Dynamic Adaptation of Request zone (LARDAR) • Simulation • Conclusions
Introduction • Mobile ad hoc network (MANET) • No fixed routers • No fixed hosts • No fixed wireless base station • How to design the route between source and destination is a problem
Related work • Location-Aided Routing in mobile ad hoc network • Young-Bae Ko, Nitin H. Vaidya • Department of Computer Science, Texas • Wireless Network 2000
B (Xd+r, Yd+r) A (Xs, Yd+r) C (Xd+r, Ys) Location-Aided Routing r Request Zone D (Xd, Yd) Expected Zone S (Xs, Ys) t1: t0, D (Xd, Yd), v r=v(t1-t0)
LARDAR • Define the request zone and expected zone • Determining the member of forwarding node • Dynamic adaptation of request zone • Route recovery
LARDAR -assumption • Ad hoc node will update the location information by periodically • Request packet contain • Location information (source, destination) • Location information obtained time • Sequence number • The angle of request triangle zone
LARDAR –define request and expected zone B r E D (Xd, Yd) d C S (Xs, Ys) t1: t0, D (Xd, Yd), v r=v(t1-t0)
B D G r E d C LARDAR –define request and expected zone F S (Xs, Ys) D (Xd, Yd) Reduction ratio between ASEG and ASDFG
L LARDAR –determining the forwarding node • Check two conditions • If angle is less than angle • L*cos is less than d+r • Request packet contain: • Location information • The obtained time • Sequence number • α B I (Xi, Yi) r E D (Xd, Yd) d C J (Xj, Yj) S (Xs, Ys)
LARDAR –dynamic adaptation of request zone B E r D (Xd, Yd) d C I1 I2 S (Xs, Ys)
I5 I4 I7 I6 LARDAR –increase-exclusive search B E r I3 D (Xd, Yd) C I1 I2 S (Xs, Ys)
LARDAR –route recovery • The node detects the route broken sends a error packet to source node • Source node will re-initial the route discovery • The node detects the route broken will initial a route discovery process
Simulation • Simulator : GloMoSim • Region: 1000m* 1000m • Node: [200,400,600,800,1000] • Mobility model: Random
Simulation Routing overhead with Speed = 72 km/hr
Simulation Time of collision with Speed = 72 km/hr
Simulation Routing setup time with Speed = 72 km/hr
Simulation Routing setup time with Speed = 90 km/hr
Conclusions • Proposed a location-based routing algorithm, called LARDAR • Use triangle zone to cover the possible destination location • Dynamic adaptation of request zone to redefine the request zone precisely • LARDAR can save more power than LAR