CS 68191 Masters Seminar / CS 89191 Doctoral Seminar
Spring 2008
Distance and Routing for Irregular Cellular Networks
Robert Harbart
(Masters Student Presentation)
Continuing off the established work in triangular cellular
communication networks, which has focused primarily on cohesive grids,
this research looks into the algorithm design for irregular network
graphs. Graphs representing either cellular networks with missing
base stations or sensor networks assume gaps in their structure.
These gaps produce an irregularity that offers a variable routing
solution.
In such light, this work attempts to construct a viable method of
solving the routing problem when networks are less then ideal. The
aim is to establish a strong algorithm to repeatedly produce the
shorted routing distance with the most economical labeling scheme.