Shahriar Etemadi Tajbakhsh, T. Ray, M. Reed, Yuan Liu
{"title":"Joint power control and resource scheduling in wireless heterogeneous networks","authors":"Shahriar Etemadi Tajbakhsh, T. Ray, M. Reed, Yuan Liu","doi":"10.1109/ICT.2015.7124679","DOIUrl":null,"url":null,"abstract":"The optimization problem of joint resource allocation and user association in wireless heterogeneous with the assumption of fixed transmission power by the base station has been studied in the literature. In this paper, we let the transmitted power by each base station on each resource be an optimization variable as well. The resulting optimization problem is NP-hard and non-convex. We provide a greedy algorithm to solve the optimization problem. Our numerical results shows a considerable improvement over the fixed power assumption in terms of average achievable rate by the users as well as the entire network utility measured based on proportional fairness criterion.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 22nd International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2015.7124679","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The optimization problem of joint resource allocation and user association in wireless heterogeneous with the assumption of fixed transmission power by the base station has been studied in the literature. In this paper, we let the transmitted power by each base station on each resource be an optimization variable as well. The resulting optimization problem is NP-hard and non-convex. We provide a greedy algorithm to solve the optimization problem. Our numerical results shows a considerable improvement over the fixed power assumption in terms of average achievable rate by the users as well as the entire network utility measured based on proportional fairness criterion.