Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami
{"title":"认知无线电系统中的联合调度与功率分配","authors":"Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami","doi":"10.1109/ICCW.2015.7247212","DOIUrl":null,"url":null,"abstract":"This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"24 1","pages":"399-404"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Joint scheduling and power allocation in Cognitive Radio systems\",\"authors\":\"Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami\",\"doi\":\"10.1109/ICCW.2015.7247212\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.\",\"PeriodicalId\":6464,\"journal\":{\"name\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"volume\":\"24 1\",\"pages\":\"399-404\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2015.7247212\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247212","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint scheduling and power allocation in Cognitive Radio systems
This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.