Control of wireless networks with secrecy

We consider the problem of cross-layer resource allocation in time-varying cellular and multihop wireless networks, and incorporate information theoretic secrecy as a Quality of Service constraint. Specifically, each node in the network injects two types of traffic, secure and unsecure, at rates chosen in order to maximize a global utility function, subject to network stability and secrecy constraints. The secrecy constraint enforces an arbitrarily low mutual information leakage from the source to every node in the network, except for the sink node. We show that the secrecy constraint leads to solutions that are significantly different from their counterparts without secrecy. We focus on a set of topologies and develop an end-to-end secure coding scheme along with the associated efficient routing and scheduling schemes to achieve a high performance. While we assume the nodes have full CSI of their neighbors, we generalize our results to the case with limited CSI.