A Survey on Position-Based Routing in Mobile Ad Hoc Networks

1
A Survey on Position-Based Routing in Mobile Ad
Hoc Networks
by Martin Mauve, Jorg Widmer, and Hannes
Hartenstein
2
Ad Hoc Networks Reviews

• Self-organizing
• No pre-established infrastructure
• Consisting of autonomous nodes
• end systems as well as routers at the same
  time
• Classification
• Static such as rooftop networks
• Mobile
• changing topology frequently unpredictably

3
Two different approaches in routing

• Topology-based routing
• proactive approaches
• reactive approaches
• hybrid approaches
• Position-based routing

4
Topology-based Approaches

• Proactive routing protocols
• maintain routing info. of all available paths
• Drawback maintenance of unused path

• Reactive routing protocols
• only maintain routes currently in use
• Drawbacks
• - require route discovery
• - suffer traffic increasing when topology change
• - packets lost due to route changing

5
Topology-based Approaches (cont.)

• Hybrid ad hoc routing protocols
• Zone Routing Protocol (ZRP) local proactive
  routing with global reactive routing
• Limitation still need to maintain routes
  currently in use

6
Position-based Routing Algorithms

• require physical location info of nodes
• routing decision based on destinations
  location and locations of forwarding nodes
  neighbors
• no establishment or maintenance of routes

7
Basic Principles and Problems

• location service determine position of a node
• how many nodes host the service
• some or all nodes maintained by position server

• forwarding strategies
• greedy forwarding
• restricted directional flooding
• hierarchical

8
Location Services

• Centralized approaches viable only as an
  external service that can be reached via non-ad
  hoc means
• single point of failure
• bottleneck on central server
• server might be far from nearby nodes
• Example cellular phone system

9
Location Services (cont.)

• Decentralized approaches location service is
  part of the ad hoc network
• Distance Routing Effect Algorithm for Mobility
  (DREAM)
• Quorum-Based Location Service
• Grid Location Service
• Homezone

10
Example Grid Location Service (GLS)

• hierarchy of squares
• n-order squares contain exactly four (n-1)-order
  squares
• each node maintains all other node within the
  local 0-order square

11
Forwarding Strategies Greedy

• Most Forward within r (MFR)
• Nearest with forward progress (NFP)
• Compass routing
• Random choice with progress

12
Greedy routing failure recovery
13
Restricted Directional Flooding
14
Hierarchical Forwarding

• reduce complexity in individual node
• scale to large number of nodes
• Grid
• Terminodes