每基站数据传输约束下下行云无线接入网的优化非对称合作

Fehmí Emre Kadan, A. O. Yılmaz
{"title":"每基站数据传输约束下下行云无线接入网的优化非对称合作","authors":"Fehmí Emre Kadan, A. O. Yılmaz","doi":"10.1109/ICCW.2017.7962646","DOIUrl":null,"url":null,"abstract":"Using multicell cooperation between several base stations (BSs) connected to a central processor (CP) via finite capacity digital backhaul links, the inter-cell interference, which is known to limit the standard cellular systems, can be mitigated. When all user data is sent to each BS through the CP, which is referred as the full cooperation, the interference can be perfectly eliminated, however, this may cause the capacity of backhaul links to be exceeded. In this study, it is aimed to find the optimal asymmetric cooperation strategy for downlink cloud radio access network (C-RAN) which minimizes the total transmitted power from BSs where each user's signal-to-interference-and-noise ratio (SINR) is lower bounded and the number of user data streams sent by each BS is limited. The original problem is NP-hard and requires a combinatorial search. In this paper, we propose two sub-optimal cooperation methods. The first method is based on iteratively increasing the number of users served by the BSs until all users are chosen, and the second is based on iteratively adding a user data stream to be sent to a BS. We also consider a known method, iterative link removal, which is based on iteratively removing a user data from a BS by starting the full cooperation scheme, and a modified version of this method as a comparison. The simulation results show that the proposed methods can provide better performance in comparison to other methods in the literature.","PeriodicalId":6656,"journal":{"name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"11 1","pages":"132-137"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimized asymmetric cooperation for downlink cloud radio access network under per-base station data transfer constraint\",\"authors\":\"Fehmí Emre Kadan, A. O. Yılmaz\",\"doi\":\"10.1109/ICCW.2017.7962646\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Using multicell cooperation between several base stations (BSs) connected to a central processor (CP) via finite capacity digital backhaul links, the inter-cell interference, which is known to limit the standard cellular systems, can be mitigated. When all user data is sent to each BS through the CP, which is referred as the full cooperation, the interference can be perfectly eliminated, however, this may cause the capacity of backhaul links to be exceeded. In this study, it is aimed to find the optimal asymmetric cooperation strategy for downlink cloud radio access network (C-RAN) which minimizes the total transmitted power from BSs where each user's signal-to-interference-and-noise ratio (SINR) is lower bounded and the number of user data streams sent by each BS is limited. The original problem is NP-hard and requires a combinatorial search. In this paper, we propose two sub-optimal cooperation methods. The first method is based on iteratively increasing the number of users served by the BSs until all users are chosen, and the second is based on iteratively adding a user data stream to be sent to a BS. We also consider a known method, iterative link removal, which is based on iteratively removing a user data from a BS by starting the full cooperation scheme, and a modified version of this method as a comparison. The simulation results show that the proposed methods can provide better performance in comparison to other methods in the literature.\",\"PeriodicalId\":6656,\"journal\":{\"name\":\"2017 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"volume\":\"11 1\",\"pages\":\"132-137\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2017.7962646\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2017.7962646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

通过有限容量数字回程链路连接到中央处理器(CP)的多个基站(BSs)之间的多小区合作,可以减轻限制标准小区系统的小区间干扰。当所有用户数据都通过CP发送到每个BS时,称为充分合作,可以完全消除干扰,但这可能会导致回程链路的容量超出。在每个用户的信噪比(SINR)较低且每个基站发送的用户数据流数量有限的情况下,寻求下行云无线接入网(C-RAN)的最优非对称合作策略,使基站的总发射功率最小。最初的问题是np困难的,需要进行组合搜索。本文提出了两种次优合作方法。第一种方法是基于迭代地增加BSs服务的用户数量,直到选择所有用户为止,第二种方法是基于迭代地添加要发送到BSs的用户数据流。我们还考虑了一种已知的方法,迭代链接删除,该方法基于通过启动完全合作方案迭代地从BS中删除用户数据,并将该方法的修改版本作为比较。仿真结果表明,与文献中的其他方法相比,所提出的方法可以提供更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimized asymmetric cooperation for downlink cloud radio access network under per-base station data transfer constraint
Using multicell cooperation between several base stations (BSs) connected to a central processor (CP) via finite capacity digital backhaul links, the inter-cell interference, which is known to limit the standard cellular systems, can be mitigated. When all user data is sent to each BS through the CP, which is referred as the full cooperation, the interference can be perfectly eliminated, however, this may cause the capacity of backhaul links to be exceeded. In this study, it is aimed to find the optimal asymmetric cooperation strategy for downlink cloud radio access network (C-RAN) which minimizes the total transmitted power from BSs where each user's signal-to-interference-and-noise ratio (SINR) is lower bounded and the number of user data streams sent by each BS is limited. The original problem is NP-hard and requires a combinatorial search. In this paper, we propose two sub-optimal cooperation methods. The first method is based on iteratively increasing the number of users served by the BSs until all users are chosen, and the second is based on iteratively adding a user data stream to be sent to a BS. We also consider a known method, iterative link removal, which is based on iteratively removing a user data from a BS by starting the full cooperation scheme, and a modified version of this method as a comparison. The simulation results show that the proposed methods can provide better performance in comparison to other methods in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信