Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Fundamentals of wireless communication
Fundamentals of wireless communication
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Greedy primal-dual algorithm for dynamic resource allocation in complex networks
Queueing Systems: Theory and Applications
Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks
IEEE Transactions on Mobile Computing
Downlink scheduling and resource allocation for OFDM systems
IEEE Transactions on Wireless Communications
Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: the 2-2-1 channel
IEEE Transactions on Information Theory
Wiretap channel with secure rate-limited feedback
IEEE Transactions on Information Theory
Secrecy capacity region of a multiple-antenna Gaussian broadcast channel with confidential messages
IEEE Transactions on Information Theory
INFOCOM'10 Proceedings of the 29th conference on Information communications
Secure transmission with multiple antennas I: the MISOME wiretap channel
IEEE Transactions on Information Theory
Broadcast channels with confidential messages
IEEE Transactions on Information Theory
Jointly optimal routing and scheduling in packet ratio networks
IEEE Transactions on Information Theory
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
Multiple-Access Channels With Confidential Messages
IEEE Transactions on Information Theory
Wireless Information-Theoretic Security
IEEE Transactions on Information Theory
Secure Broadcasting Over Fading Channels
IEEE Transactions on Information Theory
Secure Communication Over Fading Channels
IEEE Transactions on Information Theory
The Relay–Eavesdropper Channel: Cooperation for Secrecy
IEEE Transactions on Information Theory
On the Secrecy Capacity of Fading Channels
IEEE Transactions on Information Theory
The Wiretap Channel With Feedback: Encryption Over the Channel
IEEE Transactions on Information Theory
The Gaussian Multiple Access Wire-Tap Channel
IEEE Transactions on Information Theory
The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel
IEEE Transactions on Information Theory
The Secrecy Capacity of the MIMO Wiretap Channel
IEEE Transactions on Information Theory
On Cooperative Relaying Schemes for Wireless Physical Layer Security
IEEE Transactions on Signal Processing
MIMO Interference Channel With Confidential Messages: Achievable Secrecy Rates and Precoder Design
IEEE Transactions on Information Forensics and Security - Part 1
Joint Relay and Jammer Selection for Secure Two-Way Relay Networks
IEEE Transactions on Information Forensics and Security - Part 2
| Hi-index | 0.00 |
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 multiuser systems assuming that the nodes have full channel state information (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.