Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems |
| |
Authors: | CAI Dao-jin JI Hong LI Xi |
| |
Institution: | Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| |
Abstract: | Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access (TDMA) mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution (NBS) derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions. |
| |
Keywords: | NBS game theory bandwidth allocation admission control IEEE 802 16 |
本文献已被 CNKI 维普 万方数据 ScienceDirect 等数据库收录! |