A Novel Decentralized Scheme for Cooperative Compressed Spectrum Sensing in Distributed Networks

被引:17
作者
Huang Jijun [1 ]
Zha Song [1 ]
机构
[1] Natl Univ Def Technol, Coll Elect Sci & Engn, Changsha 410073, Hunan, Peoples R China
关键词
CONSENSUS; RECOVERY;
D O I
10.1155/2015/785143
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Compressed sensing (CS) recently turns out to be an effective approach to alleviate the sampling bottleneck in wideband spectrum sensing. However, the computation overhead incurred by compressed reconstruction is nontrivial, especially in a power-constrained cognitive radio (CR). Moreover, additional information, which is generally unavailable in practice, is needed in conventional CS-based wideband spectrum sensing schemes to improve the reconstruction quality as well as the detection performance. To address these issues, this paper proposes a novel decentralized scheme for cooperative compressed spectrum sensing in distributed CR networks. Our key observation is that the sparse signals are unnecessary to be reconstructed since the task of spectrum sensing is only interested in the spectrum occupancy status. The major novelty of the proposed scheme relates to the use of Karcher mean as a statistic indicating the spectrum occupancy status, thereby eliminating the compressed reconstruction stage and significantly reducing the computational complexity. Considering limited communication resources per CR, a decentralized implementation based on alternating direction method of multipliers is presented to calculate the Karcher mean via one-hop communications only. The superior performance of the proposed scheme is demonstrated by comparing with several existing decentralized schemes in terms of detection performance, communication overhead, and computational complexity.
引用
收藏
页数:10
相关论文
共 19 条
[1]   NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey [J].
Akyildiz, Ian F. ;
Lee, Won-Yeol ;
Vuran, Mehmet C. ;
Mohanty, Shantidev .
COMPUTER NETWORKS, 2006, 50 (13) :2127-2159
[2]   Cooperative spectrum sensing in cognitive radio networks: A survey [J].
Akyildiz, Ian F. ;
Lo, Brandon F. ;
Balakrishnan, Ravikumar .
PHYSICAL COMMUNICATION, 2011, 4 (01) :40-62
[3]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[4]  
Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
[5]  
Chung F, 1997, SPECTRAL GRAPH THEOR
[6]  
Davenport MarkA., 2011, Preprint, V93, P1
[7]   Recovery algorithms for vector-valued data with joint sparsity constraints [J].
Fornasier, Massimo ;
Rauhut, Holger .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2008, 46 (02) :577-613
[8]   COMPRESSIVE DETECTION FOR WIDE-BAND SPECTRUM SENSING [J].
Havary-Nassab, V. ;
Hassan, S. ;
Valaee, S. .
2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2010, :3094-3097
[9]   Ten years of research in spectrum sensing and sharing in cognitive radio [J].
Lu, Lu ;
Zhou, Xiangwei ;
Onunkwo, Uzoma ;
Li, Geoffrey Ye .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2012, :1-16
[10]   Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks [J].
Meng, Jia ;
Yin, Wotao ;
Li, Husheng ;
Hossain, Ekram ;
Han, Zhu .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2011, 29 (02) :327-337