{"title":"Resource allocation for secure OFDMA decode-and-forward relay networks","authors":"D. W. K. Ng, R. Schober","doi":"10.1109/CWIT.2011.5872157","DOIUrl":null,"url":null,"abstract":"In this paper, we formulate an optimization problem for resource allocation and scheduling in orthogonal frequency division multiple access (OFDMA) half-duplex decode-and-forward (DF) relay assisted networks. Our problem formulation takes into account artificial noise generation to combat a multiple antenna eavesdropper. The secrecy data rate, power, and sub-carrier allocation policies are optimized to maximize the average secrecy outage capacity (bit/s/Hz securely delivered to the users via relays). The optimization problem is solved by dual decomposition which results in an efficient iterative algorithm. Simulation results illustrate that the proposed iterative algorithm converges in a small number of iterations and guarantees a non-zero secrecy date rate for a given target secrecy outage probability.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2011.5872157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we formulate an optimization problem for resource allocation and scheduling in orthogonal frequency division multiple access (OFDMA) half-duplex decode-and-forward (DF) relay assisted networks. Our problem formulation takes into account artificial noise generation to combat a multiple antenna eavesdropper. The secrecy data rate, power, and sub-carrier allocation policies are optimized to maximize the average secrecy outage capacity (bit/s/Hz securely delivered to the users via relays). The optimization problem is solved by dual decomposition which results in an efficient iterative algorithm. Simulation results illustrate that the proposed iterative algorithm converges in a small number of iterations and guarantees a non-zero secrecy date rate for a given target secrecy outage probability.