Near-Optimal and Practical Jamming-Resistant Energy-Efficient Cognitive Radio Communications

This paper studies the problem of jamming-resistant spectrum aggregation and access (SAA) for energy-efficiency (EE) cognitive radio communications. We consider various jamming behaviors, where jammers may attack all available channels with arbitrarily changing strategies over time, attack a subset of the channels at certain time slots, or have different intelligence, i.e., oblivious or adaptive adversary, and so on. Without any priori knowledge about the channels and jammers, it is very challenging to design an efficient and practical jamming-resistant SAA algorithm to reach the optimal EE goal. In this paper, we utilize the advanced martingale concentration inequalities in an multi-armed bandits-based online learning framework to facilitate the optimal detection of various jamming behaviors. We first define a novel EE model for discontiguous orthogonal frequency division multiplexing to facilitate scalable SAA over distributed spectrum pools in practice. Then, the jamming-resistant dynamic channel access problem is formulated as a regret minimization problem. Meanwhile, an online stochastic gradient descent with bandit feedback procedure is adopted to allocate the transmit power. The proposed algorithm can autonomously detect the environmental features and find a near-optimal solution in each attacking scenario. Our algorithm is implemented with low complexity and with multiple users under some practical jamming scenarios. Extensive numerical studies show that under some practical jamming scenarios, our algorithm has an EE improvement of 45.3% over a fixed learning period, and an improvement of 82.5% in terms of learning duration compared with existing approaches.

[1]  K. J. Ray Liu,et al.  An anti-jamming stochastic game for cognitive radio networks , 2011, IEEE Journal on Selected Areas in Communications.

[2]  Charalampos Konstantopoulos,et al.  A survey on jamming attacks and countermeasures in WSNs , 2009, IEEE Communications Surveys & Tutorials.

[3]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[4]  T. L. Lai Andherbertrobbins Asymptotically Efficient Adaptive Allocation Rules , 1985 .

[5]  H. T. Kung,et al.  Competing Mobile Network Game: Embracing antijamming and jamming strategies with reinforcement learning , 2013, 2013 IEEE Conference on Communications and Network Security (CNS).

[6]  K. J. Ray Liu,et al.  Anti-Jamming Games in Multi-Channel Cognitive Radio Networks , 2012, IEEE Journal on Selected Areas in Communications.

[7]  Qing Zhao,et al.  Distributed learning in cognitive radio networks: Multi-armed bandit with distributed multiple players , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[8]  Shaojie Tang,et al.  Almost Optimal Dynamically-Ordered Channel Sensing and Accessing for Cognitive Networks , 2014, IEEE Transactions on Mobile Computing.

[9]  Jian Lin,et al.  SpecWatch: Adversarial spectrum usage monitoring in CRNs with unknown statistics , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[10]  Geoffrey Ye Li,et al.  Low-Complexity Energy-Efficient Scheduling for Uplink OFDMA , 2012, IEEE Transactions on Communications.

[11]  Robert D. Kleinberg Nearly Tight Bounds for the Continuum-Armed Bandit Problem , 2004, NIPS.

[12]  Yi Gai,et al.  Decentralized Online Learning Algorithms for Opportunistic Spectrum Access , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[13]  Xiang-Yang Li,et al.  Towards Optimal Adaptive UFH-Based Anti-Jamming Wireless Communication , 2012, IEEE Journal on Selected Areas in Communications.

[14]  Qing Zhao,et al.  Distributed Learning in Multi-Armed Bandit With Multiple Players , 2009, IEEE Transactions on Signal Processing.

[15]  Ambuj Tewari,et al.  Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret , 2012, ICML.

[16]  Peter Auer,et al.  The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..

[17]  Zheng Wen,et al.  Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits , 2014, AISTATS.

[18]  H. Vincent Poor,et al.  User-Centric View of Jamming Games in Cognitive Radio Networks , 2015, IEEE Transactions on Information Forensics and Security.

[19]  Peter Auer,et al.  Evaluation and Analysis of the Performance of the EXP3 Algorithm in Stochastic Environments , 2013, EWRL.

[20]  Gábor Lugosi,et al.  Regret in Online Combinatorial Optimization , 2012, Math. Oper. Res..

[21]  Mihaela van der Schaar,et al.  Jamming Bandits—A Novel Learning Method for Optimal Jamming , 2016, IEEE Transactions on Wireless Communications.

[22]  William A. Arbaugh,et al.  Improving the latency of 802.11 hand-offs using neighbor graphs , 2004, MobiSys '04.

[23]  Yongming Huang,et al.  Coordinated Multicell Multiuser Precoding for Maximizing Weighted Sum Energy Efficiency , 2014, IEEE Transactions on Signal Processing.

[24]  Ian F. Akyildiz,et al.  Cooperative spectrum sensing in cognitive radio networks: A survey , 2011, Phys. Commun..

[25]  Ismael Gomez-Miguelez,et al.  Energy-Efficient Water-Filling with Order Statistics , 2014, IEEE Transactions on Vehicular Technology.

[26]  Sébastien Bubeck,et al.  Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..

[27]  J.D. Poston,et al.  Discontiguous OFDM considerations for dynamic spectrum access in idle TV channels , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[28]  Ao Tang,et al.  Opportunistic Spectrum Access with Multiple Users: Learning under Competition , 2010, 2010 Proceedings IEEE INFOCOM.

[29]  Peng Ning,et al.  Anti-jamming communication in cognitive radio networks with unknown channel statistics , 2011, 2011 19th IEEE International Conference on Network Protocols.

[30]  Hanna Bogucka,et al.  Dynamic spectrum aggregation for future 5G communications , 2015, IEEE Communications Magazine.

[31]  Aleksandrs Slivkins,et al.  One Practical Algorithm for Both Stochastic and Adversarial Bandits , 2014, ICML.

[32]  Peng Ning,et al.  Jamming-Resistant Multiradio Multichannel Opportunistic Spectrum Access in Cognitive Radio Networks , 2016, IEEE Transactions on Vehicular Technology.

[33]  Shaojie Tang,et al.  Almost optimal accessing of nonstochastic channels in cognitive radio networks , 2012, 2012 Proceedings IEEE INFOCOM.