From: Jenny Liu (jen@cs.washington.edu)
Date: Mon Nov 22 2004 - 04:49:58 PST
"GPSR: Greedy Perimeter Stateless Routing for Wireless Networks"
presents a new approach to wireless routing that address packets by
geographical location and uses a local greedy strategy (when possible)
to route packets. When the local greedy strategy is not possible (when
the packet is stuck in a local maxima of the objective (min. distance)
function), GPSR routes around the dead space until the packet gets
closer to its final destination.
GPSR is able to adapt when nodes within its network are moving.
Furthermore, it scales well as the geographic range covered by the
network increases. However, since each node needs to know about all of
its one hop neighbors, GPSR does not scale well as the number of nodes
increases if the geographic range does not increase as well and the
density of the nodes is allowed to increase. Because GPSR routing is
stateless, GPSR may forward packets along the network to an unreachable
destination for a long time before realizing that the packet is
unsendable, thus wasting resources. This property of GPSR makes it
vulnerable to malicious nodes who can flood the network with junk
packets. The authors propose extending their work to volumes from
planes, which could be a good idea if it were possible for the nodes in
the network to know their own locations in three dimensions. (Is that
possible with GPS?) The biggest weakness of GPRS is the location
registration and lookup service where all receiving nodes must register
and all sending nodes must look up locations of receiving nodes. The
location registration and lookup service represents a single point of
failure of the GPRS network.
This archive was generated by hypermail 2.1.6 : Mon Nov 22 2004 - 04:50:27 PST