A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks Online publication date: Tue, 14-Mar-2006
by Xiao Hong, Yang Xiao, Qiang Ni, Tianji Li
International Journal of Mobile Communications (IJMC), Vol. 4, No. 5, 2006
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook