{"title":"A Delay and Traffic Balancing Sensitive Scheme for User Association in Limited Fronthaul H-CRAN s","authors":"Shaobo Liu, Biling Zhang, Jung-Lang Yu, Zhu Han","doi":"10.1109/ISWCS.2018.8491053","DOIUrl":null,"url":null,"abstract":"In order to fully exploit the potentials of the heterogeneous cloud radio access networks (H-CRANs), how to associate the user equipments (UEs) with the appropriate low power nodes (LPNs) is a very essential problem. However, when the fronthaul constraint is limited, the UEs are sensitive to delay, and the LPNs are concerned about the traffic balancing, such a problem has not gained enough attention. In this paper, the aforementioned user association problem is investigated and formulated as a bidirectional matching game, where the UEs are seeking to access the most preferred LPN while the LPNs are seeking to accept the most preferred UEs. To find the solution to the proposed game, an iteration algorithm is proposed, and its computational complexity and convergence are proved as well. Simulation results show that our proposed user association scheme is effective and outperforms the existing schemes-in terms of achieved data rates, delay, traffic balancing and overall utility.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2018.8491053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In order to fully exploit the potentials of the heterogeneous cloud radio access networks (H-CRANs), how to associate the user equipments (UEs) with the appropriate low power nodes (LPNs) is a very essential problem. However, when the fronthaul constraint is limited, the UEs are sensitive to delay, and the LPNs are concerned about the traffic balancing, such a problem has not gained enough attention. In this paper, the aforementioned user association problem is investigated and formulated as a bidirectional matching game, where the UEs are seeking to access the most preferred LPN while the LPNs are seeking to accept the most preferred UEs. To find the solution to the proposed game, an iteration algorithm is proposed, and its computational complexity and convergence are proved as well. Simulation results show that our proposed user association scheme is effective and outperforms the existing schemes-in terms of achieved data rates, delay, traffic balancing and overall utility.