Académique Documents
Professionnel Documents
Culture Documents
Outline
Overview of DSR, Route Discovery, Route Maintenance ABR Characteristics ABR Protocol Differences and Comparison Issues
DSR Overview
Uses source routing, every node has a cache of source routes Phases: route discovery, route maintenance No periodic messaging Multiple routes available Promiscuous mode
Route Discovery
If a mobile node wants to send a packet, it first checks its route cache. Route discovery is initiated by broadcasting a route request packet. A route request contains the address of destination, the address of the source, and a unique ID. Each node checks for a route, if not, it adds its own address to the route record of the packet.
Route Maintenance
Accomplished through the use of route error packets and acknowledgements. Route error packets are generated at a node when there is a link failure. The source is interrupted, the hop error is removed from the route cache and all routes with error are truncated. Acknowledgments also verify link operation, passive acknowledgments as well.
Associativity-Based Routing
Associativity is related to the spatial, temporal, and connection stability of a MH. Stability in ABR refers to associativity ticks, signal strength, and power life. Assumption: a MH will spend some dormant time at a location before moving again. New routing metrics besides fast adaptability, minimum-hop, prop. delay, loop avoidance, and link capacity: longevity of a route (not shortest path) fair route relaying load (congestion).
Associativity Ticks
Each MH transmits beacons to identify itself and constantly updates its associativity ticks based on its neighbors. The threshold where associativity transitions take place is defined. If ticks>Athreshold, stable link, stable route (may not be shortest path). A depends on trans. range, speed, and beaconing interval. Low associativity ticks = high state of mobility for MH.
Route Discovery
Broadcast query (BQ) and an await reply cycle by the SRC. BQ has a sequence number and is broadcast only once. All INs check to see if they are the DEST. If not, IN re-broadcasts and appends:
- MH address - associativity ticks - route relaying load - link prop. Delay - remaining power life - route hop count
DEST receives multiple BQs, selects best route, sends REPLY back to SRC via route.
Partial route discovery Invalid route erasure Valid route update New route discovery (worst case)
RRC continued
Any moves by SRC will cause route initialization via BQ packet. Any moves by DEST cause a localized query (LQ) process at upstream neighbor. If this fails, a route notification (RN) causes new BQ from SRC. Any moves by an IN invokes LQ, route erase towards DEST, either partial route or no. of backtracks exceeds route length (delay).
Multiple RRCs
Concurrent movements by SRC, DEST, and IN cause multiple RRCs. Only one RRC succeeds. LQs have a sequence number and if nodes processing LQs hear a BQ, the LQ process is aborted.
Comparison Issues
Periodic beaconing at each MH in ABR may lead to power consumption problems. Multiple route overhead (and stale routes) in DSR compared with partial route discovery time in ABR (RRC and more BQs). Source routing overhead in DSR (scalability), not in ABR. Stability (load and power) and long lived routes (ABR) vs. shortest path routes (DSR). The signaling traffic grows with increasing mobility of active routes in ABR.
References
Toh, C.-K., Ad-Hoc Mobile Wireless Networks: Protocols and Systems, 2002 Johnson, David B. and Maltz, David A., Dynamic Source Routing in Ad Hoc Wireless Networks, 1996 Toh, C.-K., A Novel Distributed Routing Protocol To Support Ad-Hoc Mobile Computing, 1996 Royer, Elizabeth M., A Review of Current Routing Protocols for Ad Hoc Wireless Networks, 1999 Perkins, Charles E., Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks, 2001