Wednesday, July 15

Recent Advances in Radio Channel Assignment

3:30 PM-6:00 PM
Room: Sidney Smith 2118

In recent years, the demand from new technologies on the radio spectrum has resulted in a state of severe spectral congestion. Not only the operators of radio services, but also the agencies responsible for spectrum management are increasingly interested in using the spectrum more efficiently. Advances in radio channel assignment lead to more intensive use of the spectrum, without unacceptable interference.

Channel assignment problems have natural formulations in terms of mathematical programming and extensions of graph coloring. The detailed analysis possible for some problems motivates new algorithms in more general cases. This minisymposium will cover new results in both theory and application.

Organizer: Robert A. Leese
University of Oxford, United Kingdom
3:30 Lower Bounds for Channel Assignment based on Mathematical Programming
Stuart M. Allen and Derek H. Smith, University of Glamorgan, United Kingdom; and Steve Hurley, University of Wales, United Kingdom
4:00 Minimum Span Channel Assignments
Jerrold Griggs, University of South Carolina, Columbia; and Daphne Liu, California State University, Los Angeles
4:30 A Tiling Approach to the Channel Assignment Problem
Jeannette Janssen, Acadia University, Canada; Kyriakos Kilakos, London School of Economics, United Kingdom; and Lata Narayanan, Concordia University, Canada
4:30 Radio Channel Assignment in Heavily Loaded Cellular Systems
Robert A. Leese, Organizer
5:00 Optimum Channel Assignment for Cellular Radio Networks
Rudolf Mathar and Martin Hellebrandt, Aachen University of Technology, Germany
5:30 Periodicity in Radio Channel Assignment Problems
Mark A. Shepherd, University of Oxford, United Kingdom
Program Program Overview Program-at-a-Glance Program Updates Speaker Index Registration Hotel Transportation

MMD, 5/29/98