Secure Channel Selection Using Multi-Armed Bandit Algorithm in Cognitive Radio Network
暂无分享,去创建一个
[1] Cheng-Xiang Wang,et al. Reinforcement learning approaches and evaluation criteria for opportunistic spectrum access , 2014, 2014 IEEE International Conference on Communications (ICC).
[2] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[3] David Grace,et al. Efficient exploration in reinforcement learning-based cognitive radio spectrum sharing , 2011, IET Commun..
[4] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[5] D. Ernst,et al. Upper Confidence Bound Based Decision Making Strategies and Dynamic Spectrum Access , 2010, 2010 IEEE International Conference on Communications.
[6] R. Agrawal. Sample mean based index policies by O(log n) regret for the multi-armed bandit problem , 1995, Advances in Applied Probability.
[7] Mikio Hasegawa,et al. Application of multi-armed bandit algorithms for channel sensing in cognitive radio , 2012, 2012 IEEE Asia Pacific Conference on Circuits and Systems.
[8] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[9] Octavia A. Dobre,et al. Secured cooperative cognitive radio networks with relay selection , 2014, 2014 IEEE Global Communications Conference.
[10] George K. Karagiannidis,et al. On Secrecy Performance of Antenna-Selection-Aided MIMO Systems Against Eavesdropping , 2015, IEEE Transactions on Vehicular Technology.
[11] Miguel R. D. Rodrigues,et al. Secrecy Capacity of Wireless Channels , 2006, 2006 IEEE International Symposium on Information Theory.
[12] Hai Jiang,et al. Channel Exploration and Exploitation with Imperfect Spectrum Sensing in Cognitive Radio Networks , 2013, IEEE Journal on Selected Areas in Communications.