2011/01/18 by C. Emre Koksal, Ozgur Ercetin, Koksal, C. Emre +4
Computer Science · Engineering · Mathematics · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #Distributed #FOS: Computer and information sciences #Information Theory (cs.IT) #Parallel #Wireless Communication Security Techniques #and Cluster Computing (cs.DC) #cs.DC #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1101.3444
To appear in IEEE/ACM Transactions on Networking
openalex publication_date 2011/01/18 · arxiv created 2012/04/25 · arxiv updated 2015/03/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.