Computer Science – Learning
Scientific paper
2010-10-02
Computer Science
Learning
30 pages, 7 figures
Scientific paper
In this paper, we consider a queue-aware distributive resource control algorithm for two-hop MIMO cooperative systems. We shall illustrate that relay buffering is an effective way to reduce the intrinsic half-duplex penalty in cooperative systems. The complex interactions of the queues at the source node and the relays are modeled as an average-cost infinite horizon Markov Decision Process (MDP). The traditional approach solving this MDP problem involves centralized control with huge complexity. To obtain a distributive and low complexity solution, we introduce a linear structure which approximates the value function of the associated Bellman equation by the sum of per-node value functions. We derive a distributive two-stage two-winner auction-based control policy which is a function of the local CSI and local QSI only. Furthermore, to estimate the best fit approximation parameter, we propose a distributive online stochastic learning algorithm using stochastic approximation theory. Finally, we establish technical conditions for almost-sure convergence and show that under heavy traffic, the proposed low complexity distributive control is global optimal.
Cui Ying
Lau Vincent K. N.
Wang Rui
No associations
LandOfFree
Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop MIMO Cooperative Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop MIMO Cooperative Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop MIMO Cooperative Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-519258