带回程约束的小蜂窝网络联合用户关联与资源分配

Zhe Cui, R. Adve
{"title":"带回程约束的小蜂窝网络联合用户关联与资源分配","authors":"Zhe Cui, R. Adve","doi":"10.1109/CISS.2014.6814100","DOIUrl":null,"url":null,"abstract":"Heterogeneous networks potentially provide significant capacity gains by overlaying the traditional cellular network with a layer of small cells (SCs) served by access points (APs). However, the limited backhaul capacity of the SC APs, combined with increased interference from neighboring cells, necessitates careful resource allocation to realize the gains. In our work, we consider maximization of the weighted sum rate in small cell networks with carrier aggregation while enforcing a backhaul constraint on each SC AP. We propose an efficient, waterfilling-like, algorithm which converges to a locally optimal solution of the non-convex optimization problem. This algorithm differs from existing works by using a computationally efficient bisection-like search that ensures the sum-power and sum-rate constraints at each AP are satisfied via an one-dimensional search. An added advantage is that this approach also allows for a decentralized implementation.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Joint user association and resource allocation in small cell networks with backhaul constraints\",\"authors\":\"Zhe Cui, R. Adve\",\"doi\":\"10.1109/CISS.2014.6814100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Heterogeneous networks potentially provide significant capacity gains by overlaying the traditional cellular network with a layer of small cells (SCs) served by access points (APs). However, the limited backhaul capacity of the SC APs, combined with increased interference from neighboring cells, necessitates careful resource allocation to realize the gains. In our work, we consider maximization of the weighted sum rate in small cell networks with carrier aggregation while enforcing a backhaul constraint on each SC AP. We propose an efficient, waterfilling-like, algorithm which converges to a locally optimal solution of the non-convex optimization problem. This algorithm differs from existing works by using a computationally efficient bisection-like search that ensures the sum-power and sum-rate constraints at each AP are satisfied via an one-dimensional search. An added advantage is that this approach also allows for a decentralized implementation.\",\"PeriodicalId\":169460,\"journal\":{\"name\":\"2014 48th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 48th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2014.6814100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2014.6814100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

通过在接入点(ap)提供服务的小蜂窝(SCs)层上覆盖传统蜂窝网络,异构网络可能提供显著的容量增益。然而,SC ap的回程容量有限,加上来自邻近小区的干扰增加,需要谨慎地分配资源以实现增益。在我们的工作中,我们考虑了具有载波聚合的小蜂窝网络中加权和速率的最大化,同时对每个SC AP施加回程约束。我们提出了一种有效的,类似于水填充的算法,该算法收敛于非凸优化问题的局部最优解。该算法与现有算法的不同之处在于,它使用了一种计算效率很高的类平分搜索,确保通过一维搜索满足每个AP的和功率和和速率约束。另一个优点是,这种方法还允许分散实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint user association and resource allocation in small cell networks with backhaul constraints
Heterogeneous networks potentially provide significant capacity gains by overlaying the traditional cellular network with a layer of small cells (SCs) served by access points (APs). However, the limited backhaul capacity of the SC APs, combined with increased interference from neighboring cells, necessitates careful resource allocation to realize the gains. In our work, we consider maximization of the weighted sum rate in small cell networks with carrier aggregation while enforcing a backhaul constraint on each SC AP. We propose an efficient, waterfilling-like, algorithm which converges to a locally optimal solution of the non-convex optimization problem. This algorithm differs from existing works by using a computationally efficient bisection-like search that ensures the sum-power and sum-rate constraints at each AP are satisfied via an one-dimensional search. An added advantage is that this approach also allows for a decentralized implementation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信