Geographical and Energy Aware Routing GEAR for wireless sensor net Yan Yu, Deborah Estrin, Ramesh Go

1
Geographical and Energy Aware Routing (GEAR) for
wireless sensor netYan Yu, Deborah Estrin,
Ramesh Govindan UCLA, ISI
UCLA / LECS

• Disseminate packet within the target region
• Geographic Recursive Forwarding to sub-regions of
  the original geographic region
• Restricted Flooding for low density case.

Goal Design an energy efficient data
dissemination protocol for sensor
networks Motivation Reduce initial and periodic
interest and low rate data flooding in directed
diffusion
Simulation Results
Interest 1 lion in x,y
Interest 2 panda in x,y
Network Lifetime
GEAR is 20 30 better than GPSR, and
significantly better than Flooding in terms of
network life time
Number of delivered packets before network
partition

• Some basic ideas of the GEAR protocol
• Leverage geographical information to restrict
  flooding, and recursively disseminate data inside
  the target region.
• Extend overall network lifetime using local
  techniques to balance energy usage
• Reuse routing information across multiple user
  queries.

Network size Number of nodes in the system
Energy Efficiency
GEAR is 3x better than GPSR, and much better than
other protocols under large topology in terms of
energy efficiency
The GEAR protocol Forward a packet to all the
nodes within a given geographical region.
Number of delivered pkt per connected pairs torn
down

• Major Contribution
• Route to a region
• Consider energy factor to balance energy
  consumption

Network size Number of nodes in the system
The GEAR Algorithm

• Future Plans
• Deploy geographic/energy optimized diffusion
  (i.e., integrate GEAR with diffusion) in
  diffusion test-bed.

• Reach target region
• Greedy mode minimizes cost function( distance,
  energy).
• Energy Aware Neighbor Estimation estimates the
  current best move around holes