Optimal Rate Scheduling via Utility-Maximization for J-User MIMO Markov Fading Wireless Channels with Cooperation

DOI10.1287/OPRE.2013.1224zbMATH Open1291.90105arXiv1106.4386OpenAlexW2963859518MaRDI QIDQ5166294FDOQ5166294

Wanyang Dai

Publication date: 26 June 2014

Published in: Operations Research (Search for Journal in Brave)

Abstract: We design a dynamic rate scheduling policy of Markov type via the solution (a social optimal Nash equilibrium point) to a utility-maximization problem over a randomly evolving capacity set for a class of generalized processor-sharing queues living in a random environment, whose job arrivals to each queue follow a doubly stochastic renewal process (DSRP). Both the random environment and the random arrival rate of each DSRP are driven by a finite state continuous time Markov chain (FS-CTMC). Whereas the scheduling policy optimizes in a greedy fashion with respect to each queue and environmental state and since the closed-form solution for the performance of such a queueing system under the policy is difficult to obtain, we establish a reflecting diffusion with regime-switching (RDRS) model for its measures of performance and justify its asymptotic optimality through deriving the stochastic fluid and diffusion limits for the corresponding system under heavy traffic and identifying a cost function related to the utility function, which is minimized through minimizing the workload process in the diffusion limit. More importantly, our queueing model includes both J-user multi-input multi-output (MIMO) multiple access channel (MAC) and broadcast channel (BC) with cooperation and admission control as special cases. In these wireless systems, data from the J users in the MAC or data to the J users in the BC is transmitted over a common channel that is fading according to the FS-CTMC. The J-user capacity region for the MAC or the BC is a set-valued stochastic process that switches with the FS-CTMC fading. In any particular channel state, we show that each of the J-user capacity regions is a convex set bounded by a number of linear or smooth curved facets. Therefore our queueing model can perfectly match the dynamics of these wireless systems.

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

Recommendations

• Cooperative multiple access channels: achievable rates and optimal resource allocation
• Joint Scheduling and Resource Allocation in the OFDMA Downlink: Utility Maximization Under Imperfect Channel-State Information
• Structural results on optimal transmission scheduling over dynamical fading channels: a constrained Markov decision process approach
• Sum-Rate Maximization in the Multicell MIMO Broadcast Channel With Interference Coordination
• Optimal transmission strategy for multiple Markovian fading channels: existence, structure, and approximation
• On the capacity and BER performance of multiuser scheduling over MIMO Nakagami-\(m\) fading channels
• Optimal Joint Rate and Power Allocation in CDMA Networks

zbMATH Keywords

random environmentheavy trafficasymptotic optimalityconcave gameprocessor-sharing queuesdoubly stochastic renewal processMarkov fadingMIMO wireless channelreflecting diffusion with regime-switchingutility-maximization scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Cited In (8)

• Estimating intensity functions of spatial inhomogeneous Poisson point processes via a Stein estimator
• Quantum-computing with AI & blockchain: modelling, fault tolerance and capacity scheduling
• Platform modelling and scheduling game with multiple intelligent cloud-computing pools for big data
• Convolutional neural network based simulation and analysis for backward stochastic partial differential equations
• Mean-variance hedging based on an incomplete market with external risk factors of non-Gaussian OU processes
• \(n\)-qubit operations on sphere and queueing scaling limits for programmable quantum computer
• Reflecting time-Space Gaussian random field on compact Riemannian manifold and excursion probability
• Product-form solutions for integrated services packet networks and cloud computing systems

This page was built for publication: Optimal Rate Scheduling via Utility-Maximization for J-User MIMO Markov Fading Wireless Channels with Cooperation

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