Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

DOI10.1109/TSP.2018.2812748MaRDI QIDQ4622150zbMATH OpenWikidataFDO

Authors Kaiming Shen, Wei Yu

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1802.10197

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Fractional programming (90C32) Decentralized systems (93A14) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

Cited in

(4)

• The Karush-Kuhn-Tucker (KKT) optimality conditions for fuzzy-valued fractional optimization problems
• Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
• Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
• Joint user scheduling and resource allocation scheme for low Earth orbit satellite systems considering queue stability

This page was built for publication: Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622150)