In code-division multiple-access (CDMA) mobile multimedia systems, call admission control (CAC) is essential to prevent overloading and ensure quality of Service (QoS) requirement for each traffic class. While efficiency is an important performance issue in the mobile networks with multimedia services, the concept of fairness among services should also be considered. Game theory can provide an appropriate framework for formulating such fair and efficient CAC problem. In this paper, a selection method for fair-efficient threshold parameters of the CAC scheme in CDMA mobile multimedia systems with traffic asymmetry based on the framework of game theory is proposed. The proposed scheme provides fairness and efficiency in terms of uplink and downlink signal-to-interference ratio (SIR) for the 2 classes of traffic, and also guarantees the priority of class 0 calls over class 1 calls. Class 0 calls and class 1 calls are viewed as two players of a game. For the cooperative game, the arbitration schemes for the interpersonal comparisons of utility and the bargaining problem are investigated. In the aspect of the social welfare (total utility), the numerical results indicate that the Nash solution of the bargaining problem outperforms the equilibrium point of the noncooperative game and the solution of the interpersonal comparisons of utility due to its much higher total utility.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.