Resource Allocation for Secure OFDMA Networks with Imperfect CSIT

Abstract

In this paper, we formulate an optimization problem for resource allocation and scheduling in orthogonal frequency division multiple access (OFDMA) 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 an iterative resource allocation algorithm with a fast speed of convergence. 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). Simulation results illustrate that our proposed 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.