Pub Date : 1900-01-01DOI: 10.1109/CAMAD.2015.7390512
F. Héliot, Ting-Ting Yang, C. Foh
Energy efficiency (EE) has become a critical metric for the next generation mobile networks. Scheduling plays a key role for offering not only spectral efficient but also energy efficient operation in mobile networks. In this paper, we address the problem of EE scheduling for the downlink of a two-tier Heterogeneous Network (HetNet) with orthogonal frequency division multiple access (OFDMA). Contrary to the existing contributions on this research topic, we propose a coordinated green scheduling scheme that maximizes EE for the entire HetNet rather than a particular tier. Moreover, our novel scheduling scheme uses a more realistic EE criterion where the time dependence of the scheduling process is taken into account. Numerical results are presented showing the competitive EE performance of our proposed scheduling scheme with improved user fairness and reduced complexity compared with existing non-HetNet schemes. In dense small cell situation, our scheme reduces the scheduling processing time as much as 25 times.
{"title":"Low-complexity green scheduling for the coordinated downlink of HetNet system","authors":"F. Héliot, Ting-Ting Yang, C. Foh","doi":"10.1109/CAMAD.2015.7390512","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390512","url":null,"abstract":"Energy efficiency (EE) has become a critical metric for the next generation mobile networks. Scheduling plays a key role for offering not only spectral efficient but also energy efficient operation in mobile networks. In this paper, we address the problem of EE scheduling for the downlink of a two-tier Heterogeneous Network (HetNet) with orthogonal frequency division multiple access (OFDMA). Contrary to the existing contributions on this research topic, we propose a coordinated green scheduling scheme that maximizes EE for the entire HetNet rather than a particular tier. Moreover, our novel scheduling scheme uses a more realistic EE criterion where the time dependence of the scheduling process is taken into account. Numerical results are presented showing the competitive EE performance of our proposed scheduling scheme with improved user fairness and reduced complexity compared with existing non-HetNet schemes. In dense small cell situation, our scheme reduces the scheduling processing time as much as 25 times.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131593430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/CAMAD.2015.7390489
Mohammed Al-Imari, M. Ghoraishi, P. Xiao
Recent studies have shown the feasibility of full-duplex transceivers, which have the potential to double the system spectral efficiency by allowing transmission and reception at the same time on the same frequency. In this paper, we consider the radio resource allocation problem for full-duplex systems that jointly maximize the uplink and downlink sum-rate. The problem is coupled between uplink and downlink channels due to the self-interference. An iterative algorithm is proposed based on game theory by modelling the problem as a non-cooperative game between the uplink and downlink channels. The algorithm iteratively carries out optimal uplink and downlink resource allocation until a Nash equilibrium is achieved. Simulation results show that the algorithm can significantly improve the full-duplex performance comparing to the equal resource allocation approach. Furthermore, the full-duplex system performance is evaluated under different system settings, and it is shown that the superiority of the full-duplex technique over half-duplex is more prominent in cells with lower transmission power and smaller coverage area.
{"title":"Radio resource allocation and system-level evaluation for full-duplex systems","authors":"Mohammed Al-Imari, M. Ghoraishi, P. Xiao","doi":"10.1109/CAMAD.2015.7390489","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390489","url":null,"abstract":"Recent studies have shown the feasibility of full-duplex transceivers, which have the potential to double the system spectral efficiency by allowing transmission and reception at the same time on the same frequency. In this paper, we consider the radio resource allocation problem for full-duplex systems that jointly maximize the uplink and downlink sum-rate. The problem is coupled between uplink and downlink channels due to the self-interference. An iterative algorithm is proposed based on game theory by modelling the problem as a non-cooperative game between the uplink and downlink channels. The algorithm iteratively carries out optimal uplink and downlink resource allocation until a Nash equilibrium is achieved. Simulation results show that the algorithm can significantly improve the full-duplex performance comparing to the equal resource allocation approach. Furthermore, the full-duplex system performance is evaluated under different system settings, and it is shown that the superiority of the full-duplex technique over half-duplex is more prominent in cells with lower transmission power and smaller coverage area.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125457416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：