Some heuristic channel-assignment algorithms for cellular systems are described. These algorithms have yielded optimal, or near-optimal assignments, in many cases. The channel-assignment problem can be viewed as a generalized graph-coloring problem, and these algorithms have been developed, in part, by suitably adapting some of the ideas previously introduced in heuristic graph-coloring algorithms. The channel-assignment problem is formulated as a minimum-span problem, i.e. a problem wherein the requirement is to find the minimum bandwidth necessary to satisfy a given demand. Examples are presented, and algorithm performance results are discussed.
Channel assignment in cellular radio
Kanalzuteilung beim zellularen Funk
39th IEEE Vehicular Technology Conference (IEEE Cat. ; 2 ; 846-850
1989
5 Seiten, 7 Quellen
Aufsatz (Konferenz)
Englisch
Dynamic channel assignment in cellular radio
Kraftfahrwesen | 1990
|A modified Hopfield network approach for cellular radio channel assignment
Kraftfahrwesen | 1995
|Channel assignment in dual cellular systems
Kraftfahrwesen | 1993
|A fixed channel assignment plan for three-dimensional cellular systems
Kraftfahrwesen | 1993
|