{"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}
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.