Admission Control as a Non-Cooperative Multi-Stage Game between Wireless Networks
Dimitris E. Charilas, Ourania I. Markaki, Panagiotis T. Vlacheas · 2009
As the wireless world is moving towards heterogeneous wireless networks, admission control (AC) is facing more challenges. In an environment of multiple heterogeneous networks, all possible alternatives have to be evaluated when admitting a new session in order to offer the users the best possible quality of service (QoS). An AC algorithm incorporates the concept of efficiency as one of its main goals. Additionally, the concept of fairness among services should be considered. Game theory provides an appropriate framework for formulating such fair and efficient admission control problems. In this paper we propose an AC scheme that distributes fairly service requests between two wireless networks, taking into account both the suitability of each network and the current bandwidth availability. The proposed scheme is then tested in the ns2 simulator and results indicate an overall improvement to the QoS offered to users.