A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks

  • Authors:

  • Xiao Hong;Yang Xiao;Qiang Ni;Tianji Li

  • Affiliations:

  • Computer Center, Changchun Institute of Technology, Tongzhi Street 80#, Changchun, Jilin Province, 130021, P.R. China.;Department of Computer Science, The University of Memphis, Memphis, TN 38152, USA.;The Hamilton Institute, National University of Ireland, Maynooth, Ireland.;The Hamilton Institute, National University of Ireland, Maynooth, Ireland

  • Venue:
  • International Journal of Mobile Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Semi-Markov Decision Process (SMDP) can be used to optimise channel utilisation with upper bounds on handoff blocking probabilities as Quality of Service constraints for call admission control in a wireless cell in a Personal Communication System (PCS). However, this method is too time consuming and therefore it fails when state space and action space are large. In this paper, we apply a genetic algorithm approach to address the situation when the SMDP approach fails. We code call admission control decisions as binary strings. The coded binary strings are fed into the genetic algorithm, and the resulting binary strings are founded to be near optimal call admission control decisions. Simulation results from the genetic algorithm are compared with the optimal solutions obtained from linear programming for the SMDP approach. The results reveal that the genetic algorithm approximates the optimal approach very well with less complexity.