{"title":"User matching game in virtualized 5G cellular networks","authors":"T. Le, Nguyen H. Tran, Tuan LeAnh, C. Hong","doi":"10.1109/APNOMS.2016.7737278","DOIUrl":null,"url":null,"abstract":"Recently, wireless virtualization has attracted more and more attentions from research communities. With virtualization, resource utilization is higher, system performance is improved and the investment capital is lower. However, there are remaining challenges to be addressed before wireless virtualization is widespread deployed. One challenge is user association which has great influence on the performance of the wireless virtualization network. Traditionally, user associates to the base station (BS) who provides the highest signal to interference plus noise ratio (max-SINR). However, this scheme may not guarantee the quality of service (QoS) of users and backhaul constraint of infrastructure providers (InPs). This motivates us to investigate the user association problem in virtualized cellular networks in this paper. We formulate the user-BS association as a matching game. We show that the preferences used to rank one another are independent and affected by the existing matching. Therefore, this game can be classified as the one-to-many matching game with externalities. In addition, we present a distributed algorithm to find the stable outcome of this game. Simulation results show that the presented association scheme is better than traditional scheme.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2016.7737278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Recently, wireless virtualization has attracted more and more attentions from research communities. With virtualization, resource utilization is higher, system performance is improved and the investment capital is lower. However, there are remaining challenges to be addressed before wireless virtualization is widespread deployed. One challenge is user association which has great influence on the performance of the wireless virtualization network. Traditionally, user associates to the base station (BS) who provides the highest signal to interference plus noise ratio (max-SINR). However, this scheme may not guarantee the quality of service (QoS) of users and backhaul constraint of infrastructure providers (InPs). This motivates us to investigate the user association problem in virtualized cellular networks in this paper. We formulate the user-BS association as a matching game. We show that the preferences used to rank one another are independent and affected by the existing matching. Therefore, this game can be classified as the one-to-many matching game with externalities. In addition, we present a distributed algorithm to find the stable outcome of this game. Simulation results show that the presented association scheme is better than traditional scheme.