Simulation results of the capacity of cellular systems

IEEE Transactions on Vehicular Technology

Volumn 46, Issue 4, 1997, Pages 805-817

  Haas, Zygmunt J ^a   Winters, Jack H ^a   Johnson, David S ^a  

^a School of Civil and Environmental Engineering   (United States)

Author keywords

Dynamic channel assignment; Fixed channel allocation; Graph coloring; Heuristics; Interference cancellation; Interference adaptation dynamic channel allocation

Indexed keywords

CHANNEL CAPACITY; COMPUTER SIMULATION; FADING (RADIO); HEURISTIC METHODS; INTERFERENCE SUPPRESSION; RADIO INTERFERENCE; SIGNAL TO NOISE RATIO; TELECOMMUNICATION TRAFFIC;

INTERFERENCE ADAPTATION DYNAMIC CHANNEL ALLOCATION (DCA);

CELLULAR RADIO SYSTEMS;

EID: 0031270669     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/25.653055     Document Type: Article

References (24)

1. V. H. Mac Donald, "Advanced mobile phone system: The cellular concept," Bell Syst. Tech. J.. vol. 58, no. 1, pp. 15-11, Jan. 1979.
2. S. Nanda and D. J. Goodman, "Dynamic resources acquisition: Distributed carrier allocation for TDMA cellular systems," in Third Generation Wireless Information Networks, S. Nanda and D. J. Goodman, Eds. Boston, MA: Kluwer, 1992.
3. V. Prabhu and S. S. Rappaport, "Approximate analysis of dynamic channel assignment in large systems with cellular structure," IEEE Trans. Commun., vol. COM-22, pp. 1715-1720, Oct. 1974.
4. J. C.-I. Chuang, "Performance issues and algorithms for dynamic channel assignment," IEEE J. Select. Areas Commun., vol. 11, no. 6, Aug. 1993.
5. F. K. Hwang, P. E. Wright, and B. D. Lubachevsky, "Simple, effective, dynamic channel allocation for cellular systems," Internal AT&T Tech. Memo.
6. J. Zander and H. Eriksson, "Asymptotic bounds on the performance of a class of dynamic channel assignment algorithms," IEEE J. Select. Areas Commun., vol. 11, no. 6, pp. 926-933, Aug. 1993.
7. W. C. Jakes Jr., Ed., Microwave Mobile Communications. New York: Wiley, 1974.
8. T. J. Kahava and N. D. Georganas, "A hybrid channel assignment scheme in large-scale, cellular-structured mobile communication systems," IEEE Trans. Commun., vol. COM-26, pp. 432-438, Apr. 1978.
9. S. M. Elnoubi, R. Singh, and S. C. Gupta, "A new frequency channel assignment algorithm in high capacity mobile communication systems," IEEE Trans. Veh. Technol., vol. VT-32, pp. 125-131, Aug. 1982.
10. D. E. Everitt and N. W. Macfadyen, "Analysis of multicellular mobile radiotelephone systems with loss," British Telecommun. Tech. J., vol. 1, no. 2, pp. 37-45, Oct. 1983.
11. P.-A. Raymond, "Performance analysis of cellular networks," IEEE Trans. Commun., vol. 39, Dec. 1991.
12. "DECT services and facilities requirements specification," RES3S (3) 90, Rev. 5, May 4, 1990.
13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of N P-Completeness. New York: Freeman, 1979.
14. A. Johri and D. W. Matula, "Probabilistic bounds and heuristic algorithms for coloring large random graphs," Southern Methodist Univ., Dallas, TX, Tech. Rep., 1982.
15. M. Duque-Anton, D. Kunz, and B. Rüber, "Channel assignment for cellular radio using simulated annealing," IEEE Trans. Veh. TechnoL, vol. 42, Feb. 1993.
16. M. Duque-Antön and D. Kunz, "Channel assignment based on neural network algorithms," in Proc. DMR IV, Oslo, Norway, June 26-28, 1990, pp. 5.4.1-5.4.9.
17. R. W. Nettleton and G. R. Schloemer, "A high-capacity assignment method for cellular mobile telephone systems," in Proc. VTC'39, pp. 359-367, May 1989.
18. M. Serizawa and D. J. Goodman, "Instability and deadlock of distributed dynamic channel allocation," in Proc. 1993 43rd IEEE Veh. TechnoL Conf., Secaucus, NJ, May 18-20, 1993.
19. J. F. Whitehead, "Performance and capacity of distributed dynamic channel assignment and power control in shadow fading," in Proc. ICC'93, Geneva, Switzerland, pp. 910-914, May 23-26, 1993.
20. J. F. Whitehead, "Signal-level-based dynamic power control for cochannel interference management," in Proc. VTC'93, Secaucus, NJ, May 18-20, 1993.
21. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, "Optimization by simulated annealing: An experimental evaluation-Part II, graph coloring and number partitioning," Operations Res., vol. 39, pp. 378-406, 1991.
22. R. Carraghan and P. Pardalos, "An exact algorithm for the maximum clique problem," Operations Res. Lett., vol. 9, pp. 375-382, 1990.
23. D. W. Matula, G. Marble, and J. D. Isaacson, "Graph coloring algorithms," in Graph Theory and Computing, R. C. Read, Ed. New York Academic, 1972, pp. 109-122.
24. A. Hertz and D. de Werra, "Using tabu search techniques for graph coloring," Computing, vol. 39, pp. 345-351, 1987.