Sharpe ratio for joint user association and subcarrier allocation design in downlink heterogeneous cellular networks

N. Apandi, Shuang Tian, Wibowo Hardjawana, Phee Lep Yeoh, B. Vucetic
{"title":"Sharpe ratio for joint user association and subcarrier allocation design in downlink heterogeneous cellular networks","authors":"N. Apandi, Shuang Tian, Wibowo Hardjawana, Phee Lep Yeoh, B. Vucetic","doi":"10.1109/PIMRC.2017.8292497","DOIUrl":null,"url":null,"abstract":"This paper considers a user association (UA) design for the base station (BS) and subcarrier (SC) allocation where a BS allocates different number of SCs to different users associated to it in a downlink heterogeneous cellular network. In jointly optimising the UA and SC allocation, we propose to use the Sharpe Ratio as the utility function for the optimisation objective. The Sharpe ratio is defined as the ratio between the mean of user achievable rates to its standard deviation. With this objective, the achieved user rates will be closer to each other, leading to a fair network access. To reduce the computational complexity of the solution, a simplified method based on binary Belief Propagation (BP) algorithm is proposed. Simulation results show that the achievable user rates are doubled in comparison with other schemes. The low computational complexity of the proposed method is achieved through BP solver by reducing the edges of the factor graph.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2017.8292497","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper considers a user association (UA) design for the base station (BS) and subcarrier (SC) allocation where a BS allocates different number of SCs to different users associated to it in a downlink heterogeneous cellular network. In jointly optimising the UA and SC allocation, we propose to use the Sharpe Ratio as the utility function for the optimisation objective. The Sharpe ratio is defined as the ratio between the mean of user achievable rates to its standard deviation. With this objective, the achieved user rates will be closer to each other, leading to a fair network access. To reduce the computational complexity of the solution, a simplified method based on binary Belief Propagation (BP) algorithm is proposed. Simulation results show that the achievable user rates are doubled in comparison with other schemes. The low computational complexity of the proposed method is achieved through BP solver by reducing the edges of the factor graph.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
下行异构蜂窝网络中联合用户关联和子载波分配设计的夏普比率
本文研究了一种基于用户关联(UA)的基站和子载波分配设计,其中在下行异构蜂窝网络中,一个基站为与其关联的不同用户分配不同数量的子载波。在联合优化UA和SC分配时,我们建议使用夏普比率作为优化目标的效用函数。夏普比率被定义为用户可实现率的平均值与其标准差之间的比率。有了这个目标,实现的用户速率将更接近彼此,从而导致公平的网络接入。为了降低求解的计算复杂度,提出了一种基于二元信念传播(BP)算法的简化方法。仿真结果表明,与其他方案相比,该方案可实现的用户速率提高了一倍。该方法通过BP求解器减少了因子图的边缘,从而降低了算法的计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
RSSI-based self-localization with perturbed anchor positions Bit precision study of a non-orthogonal iterative detector with FPGA modelling verification Analytical approach to base station sleep mode power consumption and sleep depth Experimental over-the-air testing for coexistence of 4G and a spectrally efficient non-orthogonal signal Secrecy analysis of random wireless networks with multiple eavesdroppers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1