Xin Kang, Hon-Fah Chong, Yeow-Khiang Chia, Sumei Sun
{"title":"无连续干扰抵消的频谱共享认知多址信道和速率最大化","authors":"Xin Kang, Hon-Fah Chong, Yeow-Khiang Chia, Sumei Sun","doi":"10.1109/GLOCOM.2014.7037274","DOIUrl":null,"url":null,"abstract":"In this paper, the sum-rate of a cognitive multiple access channel (C-MAC) is studied, where a secondary network (SN) with multiple secondary users (SUs) transmitting to a secondary base station (SBS) shares the spectrum band with a primary user (PU). An interference power constraint (IPC) is imposed on the SN to protect the PU. Under the IPC and the individual transmit power constraint (TPC) imposed on each SU, we investigate the power allocation strategies to maximize the sum-rate of the C-MAC without successive interference cancellation (SIC). We prove that the optimal solution must be at the extreme points of the feasible region. We show that Dynamic Time Division Multiple Access (D-TDMA) is optimal with high probability when the number of SUs is large. Furthermore, we show through simulations that the optimal power allocation to maximize the sum-rate of the C-MAC with SIC is optimal or near-optimal for our setting when D-TDMA is not optimal.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"878 1","pages":"3057-3061"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Sum-rate maximization for spectrum-sharing cognitive multiple access channels without successive interference cancellation\",\"authors\":\"Xin Kang, Hon-Fah Chong, Yeow-Khiang Chia, Sumei Sun\",\"doi\":\"10.1109/GLOCOM.2014.7037274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the sum-rate of a cognitive multiple access channel (C-MAC) is studied, where a secondary network (SN) with multiple secondary users (SUs) transmitting to a secondary base station (SBS) shares the spectrum band with a primary user (PU). An interference power constraint (IPC) is imposed on the SN to protect the PU. Under the IPC and the individual transmit power constraint (TPC) imposed on each SU, we investigate the power allocation strategies to maximize the sum-rate of the C-MAC without successive interference cancellation (SIC). We prove that the optimal solution must be at the extreme points of the feasible region. We show that Dynamic Time Division Multiple Access (D-TDMA) is optimal with high probability when the number of SUs is large. Furthermore, we show through simulations that the optimal power allocation to maximize the sum-rate of the C-MAC with SIC is optimal or near-optimal for our setting when D-TDMA is not optimal.\",\"PeriodicalId\":6492,\"journal\":{\"name\":\"2014 IEEE Global Communications Conference\",\"volume\":\"878 1\",\"pages\":\"3057-3061\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Global Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2014.7037274\",\"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 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2014.7037274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
本文研究了一种认知多址信道(C-MAC)的和速率问题,在这种信道中,一个由多个辅助用户(su)向一个辅助基站(SBS)传输的辅助网络(SN)与一个主用户(PU)共享同一频段。对SN进行IPC (interference power constraint)保护,保护PU。在IPC和单个发射功率约束(TPC)下,研究了在不进行连续干扰抵消(SIC)的情况下,最大化C-MAC和速率的功率分配策略。证明了最优解必须在可行域的极值点上。结果表明,当单元数量较大时,动态时分多址(D-TDMA)有高概率是最优的。此外,我们通过模拟表明,当D-TDMA不是最优时,最大化C-MAC与SIC的求和速率的最佳功率分配对于我们的设置是最优或接近最优的。
Sum-rate maximization for spectrum-sharing cognitive multiple access channels without successive interference cancellation
In this paper, the sum-rate of a cognitive multiple access channel (C-MAC) is studied, where a secondary network (SN) with multiple secondary users (SUs) transmitting to a secondary base station (SBS) shares the spectrum band with a primary user (PU). An interference power constraint (IPC) is imposed on the SN to protect the PU. Under the IPC and the individual transmit power constraint (TPC) imposed on each SU, we investigate the power allocation strategies to maximize the sum-rate of the C-MAC without successive interference cancellation (SIC). We prove that the optimal solution must be at the extreme points of the feasible region. We show that Dynamic Time Division Multiple Access (D-TDMA) is optimal with high probability when the number of SUs is large. Furthermore, we show through simulations that the optimal power allocation to maximize the sum-rate of the C-MAC with SIC is optimal or near-optimal for our setting when D-TDMA is not optimal.