Paper Info
Title
An analysis of channel assignment problems based on tours
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
Year
DOI
Venue
1997
10.1109/ICC.1997.609849
ICC (2)
Keywords
Field
DocType
spectrum efficiency,land mobile radio,frequency allocation,cellular radio,bandwidth,transmitters,graph colouring,linear programming,radio spectrum management,frequency channels,lower bounds,channel assignment problems,tours,cap,interference,polyhedral theory,radio transmitters,linear program,radio broadcasting,spectrum,lower bound
Mathematical optimization,Computer science,Channel assignment problem,Communication channel,Bandwidth (signal processing),Interference (wave propagation),Spectral efficiency,Linear programming,Frequency allocation,Cognitive radio
Conference
Volume
ISBN
Citations 
2
0-7803-3925-8
1
PageRank 
References 
Authors
0.48
1
2
Name
Order
Citations
PageRank
Jeannette Janssen129532.23
Kyriakos Kilakos2213.97