Geographic Routing

for Wireless Networks

 

 

Home
Overview
Status
Funding
People
Simulator
Publications
Related Work

Geographic Routing Network Simulator

In our work, we developed our own event driven simulator in order to compare our new geographic routing algorithms with existing algorithms.

Implemented Planarization Algorithms:

  • Gabriel Graph (GG)
  • Gabriel Graph/Mutual Witness (GGMW)
  • Relative Neighborhood Graph (RNG)
  • Relative Neighborhood Graph/Mutual Witness (RNGMW)
  • Cross-Link Detection Protocol (CLDP)
  • Experimental Variants of CLDP

Implemented Geographic Routing Algorithms:

  • Greedy
  • Compass
  • Greedy Compass
  • Greedy Perimeter Stateless Routing (GPSR)
  • Greedy Other Adaptive Face Routing (GOAFR+)
  • Oblivious Path Vector Face Routing (OPVFR)
  • Greedy Path Vector Face Routing (GPVFR)
  • Greedy Distributed Spanning Tree Routing (GDSTR)

Virtual Coordinate Algorithms:

  • NoGeo
  • Greedy Embedding Spring Coordinates (GSpring)

Other Features:

  • Display of node routing state
  • Saving and Loading of Networks from File
  • Individually configurable radio ranges
  • Simple obstacles (line, circle, rectangular)
  • Virtual location errors
  • Support for arbitrary network topologies (turn off radios)
  • Drag and move nodes (when radios mode is off)
  • Zoom

Demo Applet:

You will need the Java Runtime Environment v1.5 to run this applet. If it is not already installed, click here to download from Sun.

This applet is the visual component of the simulator that we used for our work on geographic routing. It is close to impossible to debug geometric routing algorithms without a visual simulator. :-)

Public Release of Source Code:

The source code for this simulator is available here.

 

$Date: 2008/01/01 06:35:12 $