|
| |
Geographic Routing for Mobile Nodes
Project Type: HYP/UROP
While geographic routing is known to be an efficient routing solution for
static wireless nodes, existing geographic routing algorithms are not likely
to work well for mobile nodes. In addition to the problems of changing
network topologies due to mobility, we have to grapple with a naming
problem: in geographic routing, there is a need to assign a coordinate to
each node and if nodes move and coordinates change, how are we going to be
able to deliver packets to a moving target?
In this project, the student will explore how existing geographic routing
algorithms can be modified to operate well in the presence of highly mobile
nodes. In particular, we will also study the problem of geographic routing
in mixed networks consisting of a set of static nodes and a set of mobile
nodes.
References:
-
Evangelos Kranakis,
Harvinder Singh and Jorge Urrutia,
Compass routing on geometric networks, Proc. 11 th Canadian Conference
on Computational Geometry, Vancouver, August, 1999.
-
Brad Karp and H. T. Kung.
GPSR: Greedy Perimeter Stateless Routing for
Wireless Networks. In
Proceedings of Mobicom 2000, pages 243–254, Boston, MA, August 2000.
-
Fabian Kuhn, Roger
Wattenhofer, and Aaron Zollinger.
Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing.
In Proceedings of 4th ACM International Symposium on Mobile Ad Hoc
Networking and Computing (MobiHoc 2003), June 2003.
-
Young-Jin Kim, Ramesh Govindan, Brad Karp, and Scott Shenker. Geographic routing made practical. In Proceedings of NSDI 2005, May 2005.
-
Ben Leong, Sayan Mitra, and Barbara Liskov,
"Path Vector Face Routing:
Geographic Routing with Local Face Information". Proceedings of the
13th IEEE International Conference on
Network Protocols (ICNP 2005). Boston, MA, November 2005.
-
Young-Jin Kim, Ramesh
Govindan, Brad Karp, and Scott Shenker.
On the Pitfalls of Geographic Routing. Proceedings of the 3rd
International Workshop on Discrete Algorithms and Methods for Mobile
Computing and Communications (DIALM) -Principles of Mobile Computing,
September 2005.
-
Ben Leong, Barbara Liskov, and Robert Morris,
"Geographic Routing without
Planarization".
Proceedings of the 3rd
Symposium on Network Systems Design and Implementation (NSDI 2006). San
Jose, CA, May 2006.
-
Young-Jin Kim, Ramesh
Govindan, Brad Karp, Scott Shenker.
Lazy
Cross-Link Removal for Geographic Routing. In Proceedings of the ACM
Conference on Embedded Networked Sensor Systems (Sensys '06), November 2006.
|
