Theoretical stopping criteria guided Greedy Algorithm for Compressive Cooperative Spectrum Sensing

Wei Jie Liang, Tsung Hsun Chien, Chun Shien Lu

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Cooperative spectrum sensing (CSS) in homogeneous cognitive radio networks conducts cooperation among sensing users to jointly sense the information of spectrum usage for recovery of spectrum status and utilization of available ones. Motivated by the fact that the number of occupied channels is sparse, the mechanism of greedy multiple measurement vectors (MMVs) in the context of compressive/compressed sensing can ideally model the wideband CSS scenario to efficiently solve the support detection problem for identification of occupied channels. Actually, the number of sparsity is unknown, and the existing greedy algorithms for MMVs lack for a robust stopping criterion of determining when the greedy algorithm should terminate. In this paper, we analyze and derive oracle stopping bounds that are independent of prior information such as sparsity for greedy algorithms. Simulations are provided to confirm that, in compressive cooperative spectrum sensing, the proposed stopping criteria for greedy algorithms can remarkably improve detection performance.

Original languageEnglish
Pages (from-to)165-175
Number of pages11
JournalComputer Communications
Volume111
DOIs
Publication statusPublished - 2017 Oct 1

Fingerprint

Compressed sensing
Cognitive radio
Recovery

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{cc42998c221a46889cf25f6aac3aade6,
title = "Theoretical stopping criteria guided Greedy Algorithm for Compressive Cooperative Spectrum Sensing",
abstract = "Cooperative spectrum sensing (CSS) in homogeneous cognitive radio networks conducts cooperation among sensing users to jointly sense the information of spectrum usage for recovery of spectrum status and utilization of available ones. Motivated by the fact that the number of occupied channels is sparse, the mechanism of greedy multiple measurement vectors (MMVs) in the context of compressive/compressed sensing can ideally model the wideband CSS scenario to efficiently solve the support detection problem for identification of occupied channels. Actually, the number of sparsity is unknown, and the existing greedy algorithms for MMVs lack for a robust stopping criterion of determining when the greedy algorithm should terminate. In this paper, we analyze and derive oracle stopping bounds that are independent of prior information such as sparsity for greedy algorithms. Simulations are provided to confirm that, in compressive cooperative spectrum sensing, the proposed stopping criteria for greedy algorithms can remarkably improve detection performance.",
author = "Liang, {Wei Jie} and Chien, {Tsung Hsun} and Lu, {Chun Shien}",
year = "2017",
month = "10",
day = "1",
doi = "10.1016/j.comcom.2017.08.007",
language = "English",
volume = "111",
pages = "165--175",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",

}

Theoretical stopping criteria guided Greedy Algorithm for Compressive Cooperative Spectrum Sensing. / Liang, Wei Jie; Chien, Tsung Hsun; Lu, Chun Shien.

In: Computer Communications, Vol. 111, 01.10.2017, p. 165-175.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Theoretical stopping criteria guided Greedy Algorithm for Compressive Cooperative Spectrum Sensing

AU - Liang, Wei Jie

AU - Chien, Tsung Hsun

AU - Lu, Chun Shien

PY - 2017/10/1

Y1 - 2017/10/1

N2 - Cooperative spectrum sensing (CSS) in homogeneous cognitive radio networks conducts cooperation among sensing users to jointly sense the information of spectrum usage for recovery of spectrum status and utilization of available ones. Motivated by the fact that the number of occupied channels is sparse, the mechanism of greedy multiple measurement vectors (MMVs) in the context of compressive/compressed sensing can ideally model the wideband CSS scenario to efficiently solve the support detection problem for identification of occupied channels. Actually, the number of sparsity is unknown, and the existing greedy algorithms for MMVs lack for a robust stopping criterion of determining when the greedy algorithm should terminate. In this paper, we analyze and derive oracle stopping bounds that are independent of prior information such as sparsity for greedy algorithms. Simulations are provided to confirm that, in compressive cooperative spectrum sensing, the proposed stopping criteria for greedy algorithms can remarkably improve detection performance.

AB - Cooperative spectrum sensing (CSS) in homogeneous cognitive radio networks conducts cooperation among sensing users to jointly sense the information of spectrum usage for recovery of spectrum status and utilization of available ones. Motivated by the fact that the number of occupied channels is sparse, the mechanism of greedy multiple measurement vectors (MMVs) in the context of compressive/compressed sensing can ideally model the wideband CSS scenario to efficiently solve the support detection problem for identification of occupied channels. Actually, the number of sparsity is unknown, and the existing greedy algorithms for MMVs lack for a robust stopping criterion of determining when the greedy algorithm should terminate. In this paper, we analyze and derive oracle stopping bounds that are independent of prior information such as sparsity for greedy algorithms. Simulations are provided to confirm that, in compressive cooperative spectrum sensing, the proposed stopping criteria for greedy algorithms can remarkably improve detection performance.

UR - http://www.scopus.com/inward/record.url?scp=85029417603&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029417603&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2017.08.007

DO - 10.1016/j.comcom.2017.08.007

M3 - Article

AN - SCOPUS:85029417603

VL - 111

SP - 165

EP - 175

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

ER -