Global dynamic channel allocation algorithm in wireless communications

A. Merchant, D. Raychaudhuri, Q. Ren, B. Sengupta

Research output: Contribution to conferencePaperpeer-review


Due to increased demand for channel capacity and reliable service requirement in future wireless communications, dynamic channel allocation (DCA) has been proposed for new calls as well as hand-off calls. In this paper, we compare the performance of three different DCA algorithms through a detailed simulation, which faithfully captures the dynamics of mobile movements and signal propagation effects. Based on the measurements of signal-to-interference ratios (SIR), our DCA algorithm is intended to improve the system performance in terms of reduced call blocking and dropping rates. We develop a centralized re-packing procedure to optimize the system performance, i.e., to maximize the minimum SIR of all the calls in progress. This optimization problem, which turns out to be an integer non-linear program, is solved by an efficient heuristic algorithm. Our simulation results show that the re-packing procedure embedded in the DCA algorithm can improve the quality-of-service for the system, i.e., the call dropping rate can be substantially reduced for each user.

Original languageEnglish (US)
Number of pages6
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA
Duration: Nov 3 1997Nov 8 1997


OtherProceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3)
CityPhoenix, AZ, USA

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Global and Planetary Change


Dive into the research topics of 'Global dynamic channel allocation algorithm in wireless communications'. Together they form a unique fingerprint.

Cite this