Title :
An analysis of channel assignment problems based on tours
Author :
Janssen, Jeannette ; Kilakos, Kyriakos
Author_Institution :
London Sch. of Econ. & Political Sci., UK
Abstract :
A key to spectrum efficiency is the channel assignment problem (CAP), where frequency channels must be assigned to transmitters while minimizing bandwidth and keeping interference at acceptable levels. A method for obtaining lower bounds for the CAP is presented, which is based on representation of channel assignment as a tour through the network. It is shown how bounds can be generated in a systematic way using polyhedral theory, or obtained computationally using linear programming. Bounds and applications of these bounds to a number of specific instances are given as examples
Keywords :
cellular radio; frequency allocation; graph colouring; land mobile radio; linear programming; radio spectrum management; CAP; bandwidth; channel assignment problems; frequency channels; interference; linear programming; lower bounds; polyhedral theory; spectrum efficiency; tours; transmitters; Bandwidth; Frequency conversion; Frequency division multiaccess; Interference constraints; Linear programming; Radio broadcasting; Radio transmitters;
Conference_Titel :
Communications, 1997. ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on
Conference_Location :
Montreal, Que.
Print_ISBN :
0-7803-3925-8
DOI :
10.1109/ICC.1997.609849
