Home > Research > Publications & Outputs > A connection-level call admission control using...

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks. / Hong, X.; Xiao, Y.; Ni, Q. et al.
In: International Journal of Mobile Communications, Vol. 4, No. 5, 2006, p. 568-580.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Hong, X, Xiao, Y, Ni, Q & Li, T 2006, 'A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks', International Journal of Mobile Communications, vol. 4, no. 5, pp. 568-580. https://doi.org/10.1504/IJMC.2006.009260

APA

Hong, X., Xiao, Y., Ni, Q., & Li, T. (2006). A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks. International Journal of Mobile Communications, 4(5), 568-580. https://doi.org/10.1504/IJMC.2006.009260

Vancouver

Hong X, Xiao Y, Ni Q, Li T. A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks. International Journal of Mobile Communications. 2006;4(5):568-580. doi: 10.1504/IJMC.2006.009260

Author

Hong, X. ; Xiao, Y. ; Ni, Q. et al. / A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks. In: International Journal of Mobile Communications. 2006 ; Vol. 4, No. 5. pp. 568-580.

Bibtex

@article{8ee01549aac54f6a865de2711677e0aa,
title = "A connection-level call admission control using genetic algorithm for multi-class multimedia services in wireless networks",
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.",
author = "X. Hong and Y. Xiao and Q. Ni and T. Li",
year = "2006",
doi = "10.1504/IJMC.2006.009260",
language = "English",
volume = "4",
pages = "568--580",
journal = "International Journal of Mobile Communications",
issn = "1470-949X",
publisher = "Inderscience Enterprises Ltd.",
number = "5",

}

RIS

TY - JOUR

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

AU - Hong, X.

AU - Xiao, Y.

AU - Ni, Q.

AU - Li, T.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

U2 - 10.1504/IJMC.2006.009260

DO - 10.1504/IJMC.2006.009260

M3 - Journal article

VL - 4

SP - 568

EP - 580

JO - International Journal of Mobile Communications

JF - International Journal of Mobile Communications

SN - 1470-949X

IS - 5

ER -