Utility-based scheduling with non-deterministic fading channels in wireless multi-hop networks

Authors:
Zheng Liu;Maode Ma;Jufeng Dai
Affiliations:
School of Electronic Information Engineering, Tianjin University, Tianjin, P.R. China;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore;School of Electronic Information Engineering, Tianjin University, Tianjin, P.R.China
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 9
Cited 0

Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Convex Optimization

Convex Optimization
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs

IEEE/ACM Transactions on Networking (TON)
A utility-based joint power and rate adaptive algorithm in wireless ad hoc networks

IEEE Transactions on Communications
Optimal power control in interference-limited fading wireless channels with outage-probability specifications

IEEE Transactions on Wireless Communications
Cross-layer optimization of wireless networks using nonlinear column generation

IEEE Transactions on Wireless Communications
Cross-layer optimization frameworks for multihop wireless networks using cooperative diversity

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an innovative scheduling scheme is proposed for interference-limited wireless multi-hop networks with non-deterministic fading channels. The scheduling problem is considered as a network utility maximization(NUM) problem subject to link rate constraints. With jointly considering link scheduling and the statistical variations of both signal and interference power, the convex sets for NUM are built. The subgradient projection method based on dual decomposition is employed to solve the convex optimization problem. Then a practical algorithm is designed for the TDM mode wireless multihop networks with minimizing the discrepancy between the expected network cost and the optimal value in each timeslot. The numerical results demonstrate the convergence and the improvement over network utility made by our proposed scheme.