Abstract
In this paper, some basic traffic management problems in future mobile communications networks are considered: thechannel minimization problem and themaximum channel reuse problem. These are formulated as mathematical optimization problems in a bipartite graph. We prove the intractability of these problems and discuss relations to well-known graph optimization problems as, for example, vertex coloring. Simple and fast heuristic methods for finding reasonable solutions to the problems mentioned above are presented. Results from computational work using these heuristics on simulated traffic are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Berge,Graphs (North-Holland, Amsterdam, 1991).
C. Berge,Hypergraphs (North-Holland, Amsterdam, 1989).
G. Chartrand and L. Lesniak,Graphs and Digraphs (Wadsworth and Brooks, California, 1986).
G. Falciasecca et al., Investigation on dynamic channel allocation for high capacity mobile radio systems,IEEE Vehicular Tech. Conf. (1989) pp. 176–181.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
M. Grevel and A. Sachs, A graph theoretical analysis of dynamic channel assignment algorithms for mobile radiocommunication systems, Siemens Forsch. u. Entwickl.-Ber. 12(1983)298–305.
D. Haugland, K. Jörnsten and G. Dahl, An algorithm for cardinality maximization applied to mobile communication networks, Research Notes, Rogaland University Centre (1993).
E. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Reinhart and Winston, New York, 1976).
W.C.Y. Lee,Mobile Communications Engineering (McGraw-Hill, New York 1982).
L. Lovasz and M.D. Plummer,Matching Theory (North-Holland, Amsterdam, 1986) [Ann. Discr. Math. 29].
J.A. McHugh,Algorithmic Graph Theory (Prentice-Hall, Englewood Cliffs, NJ, 1990).
M. Gondran and M. Minoux,Graphs and Algorithms (Wiley, New York, 1990).
S. Onoe and S. Yashuda, Flexible re-use for dynamic channel assignment in mobile radio systems, in:IEEE Int. Conf. on Communications, Boston (1989) pp. 472–476.
H. Panzer and R. Beck, Adaptive resource allocation in metropolitan area cellular mobile radio systems, in:IEEE Vehicular Tech. Conf. (1990) pp. 638–645.
M. Sengoku, Telephone traffic in a mobile radio communication system using dynamic frequency assignment, IEEE Trans. Vehicular Tech. VT-29(1980)270–278
J. Tajima, A new channel assignment scheme in a demand-assignment radio communication system, Electron. Commun. in Japan 1(1989)72.
H. Tamura et al., Channel assignment problem in a cellular mobile system and a new coloring problem of networks, IEIEC Trans. E-74(1991)2983–2989.
W.H.W. Tuttlebee (ed.),Cordless Telecommunications in Europe (Springer, Berlin, 1990) pp. 170–175.
S. Wang and S. Rappaport, Balanced channel assignment patterns for cellular communications systems, in:IEEE Int. Conf. on Communications (1988) pp. 452–457.
J.F. Whitehead, Cellular system design: An emerging engineering discipline, IEEE Commun. Mag. 24(2) (1986)8–15.
J.F. Whitehead, Cellular spectrum efficiency via reuse planning, in:IEEE Vehicular Tech. Conf. (1985) pp. 16–20.
J. Zander, Performance of reuse-type dynamic channel allocation in cellular mobile radio, in:Nordic Radio Symp. (1992) pp. 119–122.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dahl, G., Jörnsten, K., Løvnes, G. et al. Graph optimization problems in connection with the management of mobile communications systems. Telecommunication Systems 3, 319–339 (1994). https://doi.org/10.1007/BF02110310
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02110310