Resource allocation for secure OFDMA decode-and-forward relay networks
Ng DWK, Schober R (2011)
Publication Type: Conference contribution
Publication year: 2011
Pages Range: 202-205
Conference Proceedings Title: 12th Canadian Workshop on Information Theory, CWIT 2011
Event location: Kelowna
ISBN: 9781457707438
DOI: 10.1109/CWIT.2011.5872157
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. © 2011 IEEE.
Authors with CRIS profile
Involved external institutions
How to cite
APA:
Ng, D.W.K., & Schober, R. (2011). Resource allocation for secure OFDMA decode-and-forward relay networks. In 12th Canadian Workshop on Information Theory, CWIT 2011 (pp. 202-205). Kelowna, CA.
MLA:
Ng, Derrick Wing Kwan, and Robert Schober. "Resource allocation for secure OFDMA decode-and-forward relay networks." Proceedings of the 12th Canadian Workshop on Information Theory, CWIT 2011, Kelowna 2011. 202-205.
BibTeX: Download