Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2560
Title: A connection-level call admission control using genetic algorithm for MultiClass multimedia services in wireless networks
Authors: Hong, X
Xiao, Y
Ni, Q
Keywords: Call admission control;Multimedia;Quality of service;Queuing system;Genetic algorithm;Semi-Markov decision process;Wireless/mobile networks
Issue Date: 2006
Publisher: Inderscience
Citation: International Journal of Mobile Communications. 4 (5) 568-580
Abstract: Call admission control in a wireless cell in a personal communication system (PCS) can be modeled as an M/M/C/C queuing system with m classes of users. Semi-Markov Decision Process (SMDP) can be used to optimize channel utilization with upper bounds on handoff blocking probabilities as Quality of Service constraints. 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, where a value of “1” in the position i (i=1,…m) of a decision string stands for the decision of accepting a call in class-i; a value of “0” in the position i of the decision string stands for the decision of rejecting a call in class-i. The coded binary strings are feed 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.
URI: http://bura.brunel.ac.uk/handle/2438/2560
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Inderscience-Qiang.pdf121.84 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.