Sequential packing algorithm for channel assignment under cochannel and adjacentchannel interference constraint

IEEE Transactions on Vehicular Technology

Volumn 46, Issue 3, 1997, Pages 676-686

  Sung, Chi Wan ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Cellular systems; Channel assignment; Graph coloring; Maximum packing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; PROBLEM SOLVING; RADIO INTERFERENCE; TELECOMMUNICATION TRAFFIC;

CHANNEL ASSIGNMENT PROBLEM (CAP); GRAPH COLORING;

CELLULAR RADIO SYSTEMS;

EID: 0031211647     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/25.618193     Document Type: Article

References (17)

1. F. Box, "A heuristic technique for assigning frequencies to mobile radio nets," IEEE Trans. Veh. Technol., vol. 27, pp. 57-64, May 1978.
2. D.E. Everitt and N. W. Macfadyen, "Analysis of multicellular mobile radiotelephone systems with loss," Brit. Telecommun. Technol. J., vol. 1, no. 2, pp. 37-45, 1983.
3. M. Duque-Antón, D. Kunz, and B. Rüber, "Channel assignment for cellular radio using simulated annealing," IEEE Trans. Veh. Technol., vol. 42, pp. 14-21, Feb. 1993.
4. N. Funabiki and Y. Takefuji, "A neural network parallel algorithm for channel assignment problems in cellular radio networks," IEEE Trans. Veh. Technol., vol. 41, pp. 430-137, Nov. 1992.
5. A. Gamst and W. Rave, "On frequency assignment in mobile automatic telephone systems," in Proc. GLOBECOM '82 IEEE, pp. 309-315.
6. A. Gamst, "Homogeneous distribution of frequencies in a regular hexagonal cell system," IEEE Trans. Veh. Technol., vol. 31, pp. 132-144, Aug. 1982.
7. _, "Some lower bounds for a class of frequency assignment problems," IEEE Trans. Veh. Technol., vol. 35, pp. 8-14, Feb. 1986.
8. A. Gamst and K. Ralf, "Computational complexity of some interference graph calculations," IEEE Trans. Veh. Technol., vol. 39, pp. 140-149, May 1990.
9. M.R. Garey and D. S. Johnson, "The complexity of near-optimal graph coloring," J. ACM., vol. 23, pp. 43-19, Jan. 1976.
10. _, Computers and Intractability: A Guide to the Theory of NPCompleteness. New York: Freeman, 1979.
11. K. Keeler, "On maximum-packing strategy for channel assignment in cellular systems," private communication.
12. D. Kunz, "Channel assignment for cellular radio using neural networks," IEEE Trans. Veh. Technol., vol. 40, pp. 188-193, Feb. 1991.
13. _, "Suboptimum solutions obtained by the Hopfield-Tank neural network algorithm," Biol. Cybern., vol. 65, pp. 129-133, 1991.
14. V.H. MacDonald, "The cellular concept," Bell Syst. Tech. ]., vol. 58, pp. 15-11, Jan. 1979.
15. R. Mathar and J. Mattfeldt, "Channel assignment in cellular radio networks," IEEE Trans. Veh. Technol., vol. 42, pp. 647-656, Nov. 1993.
16. K.N. Sivarajan, R. J. McEliece, and J. W. Ketchum, "Channel assign-ment in cellular radio," in Proc. 39th IEEE Veh. Technol. Conf., 1989, pp. 846-850.
17. M. Zhang and T.S. Yum, "The nonuniform compact pattern allocation algorithm for cellular mobile systems," IEEE Trans. Veh. Technol., vol. 40, pp. 387-391, May 1991