Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 1989 | Published
Book Section - Chapter Open

Channel assignment in cellular radio

Abstract

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.

Additional Information

© 1989 IEEE. Date of Current Version: 06 August 2002. The contribution of K. N. Sivarajan and R. J. McEliece to this paper was supported by a grant from GTE Laboratories.

Attached Files

Published - SIVvtc89.pdf

Files

SIVvtc89.pdf
Files (380.3 kB)
Name Size Download all
md5:96dc80a75746e2e4cf67ad4d4c7a310f
380.3 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 17, 2023