A class of cross-layer optimization algorithms for performance and complexity trade-offs in wireless networks

Xiaoying Zheng, Feng Chen, Ye Xia, Yuguang Fang

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

12 Citations (Scopus)

Abstract

In this paper, we solve the problem of a joint optimal design of congestion control and wireless MAC-layer scheduling using a column generation approach with imperfect scheduling. We point out that the general subgradient algorithm has difficulty in recovering the time-share variables and experiences slower convergence. We first propose a two-timescale algorithm that can recover the optimal time-share values. Most existing algorithms have a component, called global scheduling, which is usually NP-hard. We apply imperfect scheduling and prove that if the imperfect scheduling achieves an approximation ratio \rho, then our algorithm produces a suboptimum of the overall problem with the same approximation ratio. By combining the idea of column generation and the two-timescale algorithm, we derive a family of algorithms that allows us to reduce the number of times the global scheduling is needed. © 2009 IEEE.
Original languageEnglish
Pages (from-to)1393-1407
JournalIEEE Transactions on Parallel and Distributed Systems
Volume20
Issue number10
DOIs
Publication statusPublished - 2009
Externally publishedYes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Research Keywords

  • Column generation
  • Congestion control
  • Cross-layer design
  • MAC-layer scheduling
  • Optimization

Fingerprint

Dive into the research topics of 'A class of cross-layer optimization algorithms for performance and complexity trade-offs in wireless networks'. Together they form a unique fingerprint.

Cite this