Secure resource allocation and scheduling for OFDMA decode-and-forward relay networks

Ng DWK, Lo ES, Schober R (2011)


Publication Type: Journal article

Publication year: 2011

Journal

Book Volume: 10

Pages Range: 3528-3540

Article Number: 6002421

Journal Issue: 10

DOI: 10.1109/TWC.2011.082011.110538

Abstract

In this paper, we formulate an optimization problem for secure 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 passive multiple antenna eavesdropper and the effects of imperfect channel state information at the transmitter (CSIT) in slow fading. The optimization problem is solved by dual decomposition which results in a highly scalable distributed iterative resource allocation algorithm. The packet data rate, secrecy data rate, power, and subcarrier allocation policies are optimized to maximize the average secrecy outage capacity (bit/s/Hz securely and successfully delivered to the users via relays). Simulation results illustrate that our proposed distributed iterative algorithm converges to the optimal solution in a small number of iterations and guarantees a non-zero secrecy data rate for given target secrecy outage and channel outage probability requirements. © 2011 IEEE.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Ng, D.W.K., Lo, E.S., & Schober, R. (2011). Secure resource allocation and scheduling for OFDMA decode-and-forward relay networks. IEEE Transactions on Wireless Communications, 10(10), 3528-3540. https://doi.org/10.1109/TWC.2011.082011.110538

MLA:

Ng, Derrick Wing Kwan, Ernest S. Lo, and Robert Schober. "Secure resource allocation and scheduling for OFDMA decode-and-forward relay networks." IEEE Transactions on Wireless Communications 10.10 (2011): 3528-3540.

BibTeX: Download