Wireless and Mobile Network Architectures
Wireless and Mobile Network Architectures
Distributed Call Admission Control for a Heterogeneous PCS Network
IEEE Transactions on Computers
A Comprehensive Resource Management Framework for Next Generation Wireless Networks
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing
Wireless Personal Communications: An International Journal
Random waypoint mobility model in cellular networks
Wireless Networks
AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
New Call Admission Control and Handoff Techniques for 3-G Mobile Networks
ICACC '09 Proceedings of the 2009 International Conference on Advanced Computer Control
Efficient call admission control scheme for 4G wireless networks
Wireless Communications & Mobile Computing - Next Generation Wireless Communications and Mobile Computing-Networking Technologies
Thinning schemes for call admission control in wireless networks
IEEE Transactions on Computers
Call admission control in single and two-tier cellular networks
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Call admission control jointly with resource reservation in cellular wireless networks
EURASIP Journal on Wireless Communications and Networking
A Practical Layer 3 Admission Control and Adaptive Scheduling (L3-ACAS) for COTS WLANs
Wireless Personal Communications: An International Journal
A Novel Hybrid Slot Allocation Mechanism for 802.11e EDCA Protocol
Information Processing Letters
Hi-index | 0.89 |
We analyze performance characteristics of a class of call admission control (CAC) algorithms designed for servicing multiple priority classes in wireless networks with the goal of quality of service (QoS) satisfaction and reward optimization. By reward, we mean some sort of ''value'' obtained by the system as a result of servicing multiple priority classes. In this paper we design and evaluate the performance of a new algorithm, elastic threshold-based CAC, in terms of the maximum reward obtainable with QoS satisfaction from servicing multiple priority classes with distinct QoS requirements, and compare it with existing partitioning, threshold, and spillover CAC algorithms. We also develop a heuristic-based search method to determine the best threshold-value sets used for multiple service classes by sequentially adjusting these thresholds based on the reward and rejection rate obtainable vs. QoS constraints of each service class. We demonstrate through test cases and simulation that elastic threshold-based CAC outperforms existing CAC algorithms for QoS satisfaction and reward optimization in solution optimality for serving multiple QoS service classes in wireless networks.