Optimal Rate Scheduling via Utility-Maximization for J-User MIMO Markov Fading Wireless Channels with Cooperation
From MaRDI portal
Publication:5166294
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.
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
Cited in
(14)- Feedback limited opportunistic scheduling and admission control for ergodic rate guarantees over Nakagami-\(m\) fading channels
- Diffusion approximation for a heavily loaded multi-user wireless communication system with cooperation
- Convolutional neural network based simulation and analysis for backward stochastic partial differential equations
- Platform modelling and scheduling game with multiple intelligent cloud-computing pools for big data
- \(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
- Estimating intensity functions of spatial inhomogeneous Poisson point processes via a Stein estimator
- Quantum-computing with AI \& blockchain: modelling, fault tolerance and capacity scheduling
- Structural results on optimal transmission scheduling over dynamical fading channels: a constrained Markov decision process approach
- A state action frequency approach to throughput maximization over uncertain wireless channels
- Product-form solutions for integrated services packet networks and cloud computing systems
- On the Performance of a Two-User MIMO Downlink System in Heavy Traffic
- Mean-variance hedging based on an incomplete market with external risk factors of non-Gaussian OU processes
- A fluid analysis of a utility-based wireless scheduling policy
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)
