Structural results on optimal transmission scheduling over dynamical fading channels: A Constrained Markov Decision Process approach

被引:0
作者
Djonin, Dejan V. [1 ]
Krishnamurthy, Vikram [1 ]
机构
[1] Univ British Columbia, Dept Elect Engn, Vancouver, BC, Canada
来源
WIRELESS COMMUNICATIONS | 2007年 / 143卷
基金
加拿大自然科学与工程研究理事会;
关键词
value function; scheduling; optimal policy; Markov Decision process; correlated sources; correlated channels; transmission scheduling; supermodularity; stochastic dominance; latency; adaptive modulation;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The problem of transmission scheduling over a correlated time-varying wireless channel is formulated as a Constrained Markov Decision Process. The model includes a transmission buffer and finite state Markov model for time-varying radio channel and incoming traffic. The resulting cross-layer optimization problem is formulated to minimize the transmission cost under the constraint on a buffer cost such as the transmission delay. Under the assumptions on submodularity and convexity of the cost function it is shown that the optimal randomized policy is monotonically increasing with the increase of the buffer state. Furthermore, the influence of the channel and traffic correlation matrices on the optimal transmission cost is investigated. It is shown that comparison between optimal transmission costs of two different channels can be performed by considering the stochastic dominance relation of their conditional probability distributions. As an example of this result, channels with smaller scattering and the same mean can achieve smaller average transmission cost for the same average buffer cost.
引用
收藏
页码:75 / +
页数:3
相关论文
共 27 条
[1]  
Abad FW, 2002, IEEE DECIS CONTR P, P1940, DOI 10.1109/CDC.2002.1184811
[2]  
Altman E., 1999, STOCH MODEL SER
[3]   Communication over fading channels with delay constraints [J].
Berry, RA ;
Gallager, RG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (05) :1135-1149
[4]  
Bertsekas, 1996, DYNAMIC PROGRAMMING, V2
[5]  
Bertsekas D. P., 1996, Neuro Dynamic Programming, V1st
[6]   OPTIMAL POLICIES FOR CONTROLLED MARKOV-CHAINS WITH A CONSTRAINT [J].
BEUTLER, FJ ;
ROSS, KW .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1985, 112 (01) :236-252
[7]  
BOUTILIER C, 1995, P 14 INT JOINT C ART, P1104
[8]  
Boyd S., 2003, CONVEX OPTIMIZATION
[9]  
CIOFFI JM, 1999, MULTICARRIER PREMIER
[10]  
COLLINS B, 1999, P ALL C COMM CONTR C