No-Regret Learning in Collaborative Spectrum Sensing with Malicious Nodes

In cognitive radio network, spectrum sensing is a key component to detect spectrum holes (i.e., channels not used by any primary users). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve fidelity of primary user detection. However, malicious nodes can significantly impair the collaborative spectrum sensing by sending the wrong reports to the fusion center. To overcome this problem, in this paper we propose non- regret learning algorithms to study the non-constructive secondary users caused either by evil-intention or altruistical incapability. Both perfect observation and partial monitoring are investigated, and two algorithms are proposed respectively. Some convergence properties are also shown. Moreover, we also analyze the case in which the nature is assumed to be a player. Illustration example and simulation results demonstrate the proposed schemes can automatically pick the malicious nodes in a distributed way.

[1]  Jeffrey H. Reed,et al.  Defense against Primary User Emulation Attacks in Cognitive Radio Networks , 2008, IEEE Journal on Selected Areas in Communications.

[2]  T. Charles Clancy,et al.  Security in Cognitive Radio Networks: Threats and Mitigation , 2008, 2008 3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom 2008).

[3]  Kaigui Bian,et al.  Security vulnerabilities in IEEE 802.22 , 2008, WICON 2008.

[4]  T. Newman,et al.  Security Threats to Cognitive Radio Signal Classifiers , 2009 .

[5]  Ekram Hossain,et al.  Dynamic Spectrum Access and Management in Cognitive Radio Networks: Introduction , 2009 .

[6]  Lawrence K. Saul,et al.  Beyond blacklists: learning to detect malicious web sites from suspicious URLs , 2009, KDD.

[7]  Zhu Han,et al.  Resource Allocation for Wireless Networks: Basics, Techniques, and Applications , 2008 .

[8]  Kaigui Bian,et al.  Robust Distributed Spectrum Sensing in Cognitive Radio Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[9]  Jeff S. Shamma,et al.  Unified convergence proofs of continuous-time fictitious play , 2004, IEEE Transactions on Automatic Control.

[10]  Ekram Hossain,et al.  Dynamic Spectrum Access and Management in Cognitive Radio Networks , 2009 .

[11]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[12]  Anant Sahai,et al.  Cooperative Sensing among Cognitive Radios , 2006, 2006 IEEE International Conference on Communications.

[13]  V. Rao Vemuri,et al.  Robust Support Vector Machines for Anomaly Detection in Computer Security , 2003, ICMLA.

[14]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[15]  Joseph Mitola,et al.  Cognitive radio: making software radios more personal , 1999, IEEE Wirel. Commun..

[16]  Zhu Han Resource allocation for wireless networks , 2008 .

[17]  William A. Arbaugh,et al.  Dynamic spectrum access in cognitive radio networks , 2006 .

[18]  Raouf Boutaba,et al.  Robust and scalable trust management for collaborative intrusion detection , 2009, 2009 IFIP/IEEE International Symposium on Integrated Network Management.

[19]  Quanyan Zhu,et al.  Dynamic policy-based IDS configuration , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[20]  J. Robinson AN ITERATIVE METHOD OF SOLVING A GAME , 1951, Classics in Game Theory.

[21]  N. Bambos,et al.  Security investment games of interdependent organizations , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[22]  Simon Haykin,et al.  Cognitive radio: brain-empowered wireless communications , 2005, IEEE Journal on Selected Areas in Communications.

[23]  Zhu Han,et al.  Attack-proof collaborative spectrum sensing in cognitive radio networks , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.