In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the V...In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the VR from a unique mobile network operator(MNO) is considered. Our objective is two folds. The first is to guarantee the minimum rate requirements of the MNO and the WSPs. The second is to distribute the system rate among the MNO and the WSPs in the Pareto optimal manner. To this end, an efficient VR allocation scheme based on bargaining game theory is proposed, and the Nash bargaining solution(NBS) method is used to solve the proposed game problem. The proposed game problem is proved to be a convex optimization problem. By using standard convex optimization method, the global optimal NBS of the game is obtained in closed form. The effectiveness of the proposed VR allocation game is testified through numerical results.展开更多
基金supported in part by China University of Mining and Technology Funds for Academic Frontier Research(Grant No.2015XKQY18)National High-tech R&D Program of China(863 Program)(Grant Nos.2015AA015701+1 种基金2015AA01A705)National Natural Science Foundation of China(Grant No.61100167)
文摘In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the VR from a unique mobile network operator(MNO) is considered. Our objective is two folds. The first is to guarantee the minimum rate requirements of the MNO and the WSPs. The second is to distribute the system rate among the MNO and the WSPs in the Pareto optimal manner. To this end, an efficient VR allocation scheme based on bargaining game theory is proposed, and the Nash bargaining solution(NBS) method is used to solve the proposed game problem. The proposed game problem is proved to be a convex optimization problem. By using standard convex optimization method, the global optimal NBS of the game is obtained in closed form. The effectiveness of the proposed VR allocation game is testified through numerical results.