A performance study of a distributed algorithm for dynamic channel allocation

  • Authors:
  • Azzedine Boukerche;Sungbum Hong;Tom Jacob

  • Affiliations:
  • Parallel Simulations and Distributed Systems Research (PARADISE) Lab., Department of Computer Sciences, University of North Texas, Denton, Texas;Parallel Simulations and Distributed Systems Research (PARADISE) Lab., Department of Computer Sciences, University of North Texas, Denton, Texas;Parallel Simulations and Distributed Systems Research (PARADISE) Lab., Department of Computer Sciences, University of North Texas, Denton, Texas

  • Venue:
  • Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent demand for mobile telephone service have been growing rapidly while the electro-magnetic spectrum of frequencies allocated for this purpose remain limited. Any solution to the channel assignment problem is subject to this limitation, as well as the interference constraints between adjacent channels in the spectrum. Channel allocation schemes provide a flexible and efficient access to bandwith in wireless and mobile communication systems.In this paper, we present an efficient distributed algorithm for dynamic channel allocation based upon multual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels can not be shared concurrently within the cluster. We describe the algorithm, and report its performance several channel systems using different types of call arrival patterns. Our results indicate that significant low denial rate, low message complexity and low acquisition time can be obtained using our algorithm.