Routing and Related Problems for Plane Networks

Dr. Huaming Zhang

Department of Computer Science
University of Alabama in Huntsville

16 March 2012
218 Shelby Center
3:00 (Refreshements at 2:30)

Abstract

Routing is one of the most important algorithmic problems in networking research. Extensive efforts have been devoted to the discovery of efficient routing algorithms. While some approaches have been very successful for traditional networks, they are resources consuming and requiring considerable overhead, which make them less suitable for networks such as wireless sensor networks. Recently, alternative approaches have been proposed.

In this talk, we will present geographic routing algorithms and geometric routing algorithms. Geographic routing algorithms directly use the geographic locations of network agents for routing. Geometric routing algorithms extend geographic routing one step further. They first apply graph drawing algorithms to obtain virtual coordinates for these network agents. Then, they use the virtual coordinates for the routing purposes. We will present some recent results in geometric routing. Some possible future research directions and related open problems will also be discussed in the talk.