[1]ZHAO Q, KRISHNAMACHARI B, LIU K. On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance [J]. IEEE Transactions on Wireless Communications, 2008,7(12):5431-5440.
[2]ZHANG B, ZHU Y, HU K. Spectrum assignment algorithm based on particle swarm optimization for cognitive radio [J]. Journal of Computer Applications, 2012,32(12):3184-3186.(张北伟,朱云龙,胡琨元.基于粒子群算法的认知无线电频谱分配算法[J].计算机应用,2012,32(12):3184-3186.)[3]LONG Y, YIN H, ZHU J, et al.New adaptive dynamic channel allocation algorithm in cognitive radio [J]. Journal of Computer Applications, 2011,31(11):2915-2917.(龙吟,殷亨静,朱江,等.认知无线电中的新型自适应动态信道分配算法[J].计算机应用,2011,31(11):2915-2917.)
[4]LIU K, ZHAO Q, KRISHNAMACHARI B. Dynamic multichannel access with imperfect channel state detection [J]. IEEE Transactions on Signal Processing, 2010,58(5):2795-2808.
[5]DONG S, LEE J. Greedy confidence bound techniques for restless multi-armed bandit based Cognitive Radio [C]// Proceedings of the 2013 47th Annual Conference on Information Sciences and Systems. Piscataway: IEEE Press, 2013:1-4.
[6]LIU K, ZHAO Q. Indexability of restless bandit problems and optimality of Whittle index for dynamic multichannel access [J]. IEEE Transactions on Information Theory, 2010,56(11):5547-5567.
[7]GILBERT E N. Capacity of a burst-noise channel [J]. Bell System Technical Journal, 1960,39:1253-1265.
[8]SMALLWOOD R, SONDIK E. The optimal control of partially observable Markov processes over a finite horizon [J]. Operations Research, 1971,26:1071-1088.
[9]ZHAO Q, TONG L, SWAMI A, et al.Decentralized cognitive MAC for opportunistic spectrum access in Ad Hoc networks: a POMDP framework [J]. IEEE Journal on Selected Areas in Communications, 2007,25(3):589-600.
[10]PAPADIMITRIOU C H, TSITSIKLIS J N. The complexity of optimal queueing network control [J]. Mathematics of Operations Research, 1999,24(2):293-305.
[11]ZHU J, LI S. Channel allocation mechanisms for cognitive radio networks via repeated multi-bid auction [C]// Proceedings of the 2006 IET International Conference on Wireless, Mobile and Multimedia Networks. Beijing: IET Beijing Branch, 2006:1-4.
[12]WHITTLE P. Restless bandits: activity allocation in a changing world [J]. Journal of Applied Probability, 1988,25:287-598.
[13]NY J L, DAHLEH M, FERON E. Multi-UAV dynamic routing with partial observations using restless bandit allocation indices [C]// Proceedings of the 2008 IEEE American Control Conference. Piscataway: IEEE Press, 2008:4220-4225.
[14]SONDIK E. The optimal control of partially observable Markov decision processes over the infinite horizon: discounted costs [J]. Operations Research, 1978,26(2):282-304.
[15]LI F, TANG Y, ZHU J. Dynamic channel selection in unknown environment based on graphical game and multi-Q learning [J]. Journal on Communications, 2013,34(11):1-7.(李方伟, 唐永川, 朱江.未知环境中基于图型博弈和multi-Q学习的动态信道选择算法[J].通信学报,2013,34(11):1-7.)
[16]GALLAGER R G. Discrete stochastic processes [M]. Dordrecht: Kluwer Academic Publishers, 1995. |