Cross-layer optimization for wireless networks with deterministic channel models

Authors:
Ziyu Shao;Minghua Chen;Salman Avestimehr;Shuo-Yen Robert Li
Affiliations:
Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;School of Electrical and Computer Engineering, Cornell University, Ithaca, NY;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 6
Cited 0

Approximation algorithms

Approximation algorithms
Convex Optimization

Convex Optimization
Impact of interference on multi-hop wireless network performance

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Markov approximation for combinatorial network optimization

INFOCOM'10 Proceedings of the 29th conference on Information communications
Wireless Network Information Flow: A Deterministic Approach

IEEE Transactions on Information Theory
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a deterministic channel model proposed in [11, 12], a simple abstraction of the physical layer that effectively captures the effect of channel strength, broadcast and superposition in wireless channels. Within the Network Utility Maximization (NUM) framework, we study the cross-layer optimization for wireless networks based on this deterministic channel model. First, we extend the well-applied conflict graph model to capture the flow interactions over the deterministic channels and characterize the feasible rate region. Then we study distributed algorithms for general wireless multi-hop networks. The convergence of algorithms is proved by Lyapunov stability theorem and stochastic approximation method. Further, we show the convergence to the bounded neighborhood of optimal solutions with probability one under constant steps and constant update intervals. Our numerical evaluation validates the analytical results.