Secrecy Throughput of Wireless Interference Networks with Uncertain Channel State Information

Considering a multi-user interference network with an eavesdropper, this paper investigates the problem of power allocation to optimize the worst secrecy throughput among the network links. Three scenarios for the access of channel state information are considered: perfect channel state information, partial channel state information with channels from the transmitters to the eavesdropper exponentially distributed, and imperfectly known channels between the transmitters and the users with exponentially distributed errors. The paper develops various path-following procedures of low complexity and rapid convergence for the optimal power allocation. Their effectiveness and viability are illustrated through numerical examples. The power allocation schemes are shown to achieve high secrecy throughput.