Channel assignment on Cayley graphs
by
Patrick Bahls
University of North Carolina, Asheville

Channel assignment problems arise in applications in which radio transmitters must be assigned broadcast frequencies so that stations near to one another physically receive sufficiently different frequencies that the competing radio signals do not cause substantial interference. This problem can be modeled by graphs in which vertices represent the radio stations and the distance between stations is given by the path metric; a station's frequency, or channel, is given by a non-negative integer or real number. In this talk we will consider a means by which the Cayley graph of any one of a very general classes of groups can be given a channel assignnment l that is optimal in the sense that the span max_{v ∈ V} l(v) - min_{v ∈ V} l(v) is as small as possible.

Date received: March 13, 2009