{"title":"中继辅助认知网络的最优功率分配","authors":"Anne Savard, E. Belmega","doi":"10.1145/3306309.3306314","DOIUrl":null,"url":null,"abstract":"In this paper, we address a power allocation problem in a relay-aided cognitive network. The network is composed by a primary and secondary user/destination pair and a relay, which helps the communication between the secondary user and its destination. The transmission of the secondary user and the helping relay is allowed provided that a minimum quality of service (QoS) constraint is met at the primary user. First, we derive the achievable rate regions under Decode-and-Forward (DF) and Compress-and-Forward (CF) relaying schemes. Then, we provide analytic expressions of the optimal power allocation policies at the secondary user and the relay. Remarkably, if the secondary direct link is negligible - the communication takes place only via the relay - DF is proven to always outperform CF, irrespective from the system parameters. If the secondary direct link is not negligible, our numerical results illustrate that DF outperforms CF only when the relay is close to the secondary user.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal Power Allocation in a Relay-aided Cognitive Network\",\"authors\":\"Anne Savard, E. Belmega\",\"doi\":\"10.1145/3306309.3306314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address a power allocation problem in a relay-aided cognitive network. The network is composed by a primary and secondary user/destination pair and a relay, which helps the communication between the secondary user and its destination. The transmission of the secondary user and the helping relay is allowed provided that a minimum quality of service (QoS) constraint is met at the primary user. First, we derive the achievable rate regions under Decode-and-Forward (DF) and Compress-and-Forward (CF) relaying schemes. Then, we provide analytic expressions of the optimal power allocation policies at the secondary user and the relay. Remarkably, if the secondary direct link is negligible - the communication takes place only via the relay - DF is proven to always outperform CF, irrespective from the system parameters. If the secondary direct link is not negligible, our numerical results illustrate that DF outperforms CF only when the relay is close to the secondary user.\",\"PeriodicalId\":113198,\"journal\":{\"name\":\"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3306309.3306314\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3306309.3306314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal Power Allocation in a Relay-aided Cognitive Network
In this paper, we address a power allocation problem in a relay-aided cognitive network. The network is composed by a primary and secondary user/destination pair and a relay, which helps the communication between the secondary user and its destination. The transmission of the secondary user and the helping relay is allowed provided that a minimum quality of service (QoS) constraint is met at the primary user. First, we derive the achievable rate regions under Decode-and-Forward (DF) and Compress-and-Forward (CF) relaying schemes. Then, we provide analytic expressions of the optimal power allocation policies at the secondary user and the relay. Remarkably, if the secondary direct link is negligible - the communication takes place only via the relay - DF is proven to always outperform CF, irrespective from the system parameters. If the secondary direct link is not negligible, our numerical results illustrate that DF outperforms CF only when the relay is close to the secondary user.