Sivarajan, Kumar N. and McEliece, Robert J. (1989) Channel assignment in cellular radio. In: 39th IEEE Vehicular Technology Conference. IEEE , Piscataway, NJ, pp. 846-850. ISBN 1090-3038 http://resolver.caltech.edu/CaltechAUTHORS:20120517-092808034
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120517-092808034
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.
|Item Type:||Book Section|
|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.|
|Other Numbering System:|
|Official Citation:||Sivarajan, K.N.; McEliece, R.J.; Ketchum, J.W.; , "Channel assignment in cellular radio," Vehicular Technology Conference, 1989, IEEE 39th , vol., no., pp.846-850 vol.2, 1-3 May 1989 doi: 10.1109/VETEC.1989.40173 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=40173&isnumber=1551|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||22 May 2012 18:37|
|Last Modified:||26 Dec 2012 15:13|
Repository Staff Only: item control page