Call admission control under QoS constraints using neuroevolution of topologies

Yang Xu, J. Bigham

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we solve the call admission control (CAC) problem in a cellular network via a form of NeuroEvolution algorithm. The results are compared with Complete Sharing scheme, which allows all types of traffic to access all available channels at all time, and show that our proposed CAC scheme CN can reduce the handoff failure subject to several predefined Quality of Service (QoS) constraints: the handoff dropping probability (CDR) and intra-class fairness are all guaranteed within the predefined constraints. Additionally, the numerical results shows that under the same handoff failure constraint, better fairness causes higher new setup calls blocking probabilities (CBR) and lower CDR, therefore the fairness and maximizing revenue are two opposite goals, and the fairness and CDR do not conflict with each other.

Original languageEnglish
Title of host publicationIET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006
PublisherInstitution of Engineering and Technology
Pages343
Number of pages1
Edition525
ISBN (Print)0863416446, 9780863416446
DOIs
Publication statusPublished - 1 Jan 2006
EventIET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006 - Hangzhou, China
Duration: 6 Nov 20069 Nov 2006

Publication series

NameIET Conference Publications
Number525

Conference

ConferenceIET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006
Country/TerritoryChina
CityHangzhou
Period6/11/069/11/06

Keywords

  • CAC
  • Fairness
  • NEAT
  • QoS

Fingerprint

Dive into the research topics of 'Call admission control under QoS constraints using neuroevolution of topologies'. Together they form a unique fingerprint.

Cite this