Control of Wireless Networks with Secrecy

TL;DR

This paper develops a cross-layer resource allocation framework for wireless networks that incorporates information-theoretic secrecy constraints, ensuring low information leakage while maximizing network utility.

Contribution

It introduces a novel joint flow control, scheduling, and private encoding scheme that achieves near-optimal utility without requiring prior channel gain distributions.

Findings

Achieves an achievable rate region for secure communication in wireless networks.

Proposes a dynamic control algorithm that approaches maximum utility.

Numerical results confirm the effectiveness of the proposed scheme.

Abstract

We consider the problem of cross-layer resource allocation in time-varying cellular wireless networks, and incorporate information theoretic secrecy as a Quality of Service constraint. Specifically, each node in the network injects two types of traffic, private and open, 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 first obtain the achievable rate region for the problem for single and multi-user systems assuming that the nodes have full CSI of their neighbors. Then, we provide a joint flow control, scheduling and private encoding scheme, which does not rely on the knowledge of the prior distribution of the gain of any channel. We prove that our scheme achieves a utility, arbitrarily close to the maximum achievable utility. Numerical experiments are performed to verify the analytical results, and to show the efficacy of the dynamic control algorithm.