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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Channel assignment in cellular radio


    Additional title:

    Kanalzuteilung beim zellularen Funk


    Contributors:


    Publication date :

    1989


    Size :

    5 Seiten, 7 Quellen


    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Dynamic channel assignment in cellular radio

    Sivarajan,K.N. / McEliece,R.J. / Ketchum et al. | Automotive engineering | 1990


    A modified Hopfield network approach for cellular radio channel assignment

    Kim,J.S. / Park,H. / Dowd,P.W. et al. | Automotive engineering | 1995


    Channel assignment in dual cellular systems

    Lara,D.R. / Vazquez,R.M. / Munoz,D.R. et al. | Automotive engineering | 1993



    A fixed channel assignment plan for three-dimensional cellular systems

    Song,P. / Han,Y. / Kim,H. et al. | Automotive engineering | 1993