Zhu Jiang, Xu Bin-yang, Li Shao-qian. A Transmission and Scheduling Scheme Based on Markov Decision Process in Cognitive Radio Networks[J]. Journal of Electronics & Information Technology, 2009, 31(8): 2019-2023. doi: 10.3724/SP.J.1146.2008.00960
Citation:
Zhu Jiang, Xu Bin-yang, Li Shao-qian. A Transmission and Scheduling Scheme Based on Markov Decision Process in Cognitive Radio Networks[J]. Journal of Electronics & Information Technology, 2009, 31(8): 2019-2023. doi: 10.3724/SP.J.1146.2008.00960
Zhu Jiang, Xu Bin-yang, Li Shao-qian. A Transmission and Scheduling Scheme Based on Markov Decision Process in Cognitive Radio Networks[J]. Journal of Electronics & Information Technology, 2009, 31(8): 2019-2023. doi: 10.3724/SP.J.1146.2008.00960
Citation:
Zhu Jiang, Xu Bin-yang, Li Shao-qian. A Transmission and Scheduling Scheme Based on Markov Decision Process in Cognitive Radio Networks[J]. Journal of Electronics & Information Technology, 2009, 31(8): 2019-2023. doi: 10.3724/SP.J.1146.2008.00960
A cross-layer transmission and scheduling scheme of average power minimization in cognitive radio networks under the constraint of packet drop probability is addressed. The scheme is formulated by constrained Markov Decision Process (MDP). Lagrangian multiplier approach is used to solve the MDP, and a golden section search method is proposed to find the multiplier. Two simplifying methods, namely, state aggregate and action set reduction are employed to cope with the curse of dimensionality. Simulation results show that simplifying methods have little influence on the performance of the scheme and average power consumption of the scheme is the lowest.
Hossain E and Bhargava V. Cognitive WirelessCommunication Networks [M]. First Edition, New York:Springer, 2007: 1-301.[2]Djonin D V, et al.. Joint rate and power adaptation for type-Ihybrid ARQ systems over correlated fading channels underdifferent buffer cost constraints [J]. IEEE Transactions. onWireless Communications, 2008, 57(1): 421-435.[3]Bolch G.[J].et al.. Queueing Networks and Markov Chains:Modeling and Performance Evaluation with ComputerScience Applications [M]. Second Edition, New York: JohnWiley Sons.2006,:-[4]Chung Seong Taek and Goldsmith A. Degrees of freedom inadaptive modulation: A unified view [J].IEEE Transactions.on Communications.2001, 49(9):1561-1571[5]Chang H S, et al.. Simulation-based Algorithms for MarkovDecision Processes [M]. First Edition, London: Springer-Verlag, 2007: 9-167.[6]Beutle F J and Ross K W. Optimal policies for controlledmarkov chains with a constraint [J]. Journal of MathematicalAnalysis and Application, 1985, 112(1): 236-252.[7]Hossain M J, et al.. Delay limited optimal and suboptimalpower and bit loading algorithms for OFDM systems overcorrelated fading [C]. IEEE GLOBECOM, St. Louis, USA,Dec. 1-2, 2005: 3448-3453.[8]Pandana C and Liu K J R. Near-optimal reinforcementlearning framework for energy-aware sensor communications[J]. IEEE Transactions. on Wireless Communications, 2005,23(4): 788-797.