A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing

Tsung Hsun Chien, Wei Jie Liang, Chun Shien Lu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Cooperative spectrum sensing (CSS) in cognitive radio networks conducts cooperation among sensing users to jointly sense the sparse spectrum and utilize available spectrums. Greedy multiple measurement vectors (MMVs) algorithm in the context of 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 most of 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 for greedy MMVs algorithms without depending on prior information such as sparsity. Moreover, we introduce a practical subspace MMVs greedy algorithm that extends from a subspace-based sparse recovery method to a more practical setting, in which no prior information are required. Extensive simulations confirm the feasibility of the proposed stopping criteria and our sparse recovery algorithm.

Original languageEnglish
Title of host publication2014 IEEE Global Communications Conference, GLOBECOM 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages787-792
Number of pages6
ISBN (Electronic)9781479935116
DOIs
Publication statusPublished - 2014 Feb 9
Event2014 IEEE Global Communications Conference, GLOBECOM 2014 - Austin, United States
Duration: 2014 Dec 82014 Dec 12

Publication series

Name2014 IEEE Global Communications Conference, GLOBECOM 2014

Conference

Conference2014 IEEE Global Communications Conference, GLOBECOM 2014
CountryUnited States
CityAustin
Period14-12-0814-12-12

Fingerprint

measurement algorithm
Recovery
radio
Compressed sensing
Cognitive radio
scenario
simulation
lack

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Communication

Cite this

Chien, T. H., Liang, W. J., & Lu, C. S. (2014). A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing. In 2014 IEEE Global Communications Conference, GLOBECOM 2014 (pp. 787-792). [7036904] (2014 IEEE Global Communications Conference, GLOBECOM 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2014.7036904
Chien, Tsung Hsun ; Liang, Wei Jie ; Lu, Chun Shien. / A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing. 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 787-792 (2014 IEEE Global Communications Conference, GLOBECOM 2014).
@inproceedings{2f0bf73918244436a6e119dea44a7dbe,
title = "A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing",
abstract = "Cooperative spectrum sensing (CSS) in cognitive radio networks conducts cooperation among sensing users to jointly sense the sparse spectrum and utilize available spectrums. Greedy multiple measurement vectors (MMVs) algorithm in the context of 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 most of 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 for greedy MMVs algorithms without depending on prior information such as sparsity. Moreover, we introduce a practical subspace MMVs greedy algorithm that extends from a subspace-based sparse recovery method to a more practical setting, in which no prior information are required. Extensive simulations confirm the feasibility of the proposed stopping criteria and our sparse recovery algorithm.",
author = "Chien, {Tsung Hsun} and Liang, {Wei Jie} and Lu, {Chun Shien}",
year = "2014",
month = "2",
day = "9",
doi = "10.1109/GLOCOM.2014.7036904",
language = "English",
series = "2014 IEEE Global Communications Conference, GLOBECOM 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "787--792",
booktitle = "2014 IEEE Global Communications Conference, GLOBECOM 2014",
address = "United States",

}

Chien, TH, Liang, WJ & Lu, CS 2014, A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing. in 2014 IEEE Global Communications Conference, GLOBECOM 2014., 7036904, 2014 IEEE Global Communications Conference, GLOBECOM 2014, Institute of Electrical and Electronics Engineers Inc., pp. 787-792, 2014 IEEE Global Communications Conference, GLOBECOM 2014, Austin, United States, 14-12-08. https://doi.org/10.1109/GLOCOM.2014.7036904

A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing. / Chien, Tsung Hsun; Liang, Wei Jie; Lu, Chun Shien.

2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 787-792 7036904 (2014 IEEE Global Communications Conference, GLOBECOM 2014).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing

AU - Chien, Tsung Hsun

AU - Liang, Wei Jie

AU - Lu, Chun Shien

PY - 2014/2/9

Y1 - 2014/2/9

N2 - Cooperative spectrum sensing (CSS) in cognitive radio networks conducts cooperation among sensing users to jointly sense the sparse spectrum and utilize available spectrums. Greedy multiple measurement vectors (MMVs) algorithm in the context of 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 most of 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 for greedy MMVs algorithms without depending on prior information such as sparsity. Moreover, we introduce a practical subspace MMVs greedy algorithm that extends from a subspace-based sparse recovery method to a more practical setting, in which no prior information are required. Extensive simulations confirm the feasibility of the proposed stopping criteria and our sparse recovery algorithm.

AB - Cooperative spectrum sensing (CSS) in cognitive radio networks conducts cooperation among sensing users to jointly sense the sparse spectrum and utilize available spectrums. Greedy multiple measurement vectors (MMVs) algorithm in the context of 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 most of 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 for greedy MMVs algorithms without depending on prior information such as sparsity. Moreover, we introduce a practical subspace MMVs greedy algorithm that extends from a subspace-based sparse recovery method to a more practical setting, in which no prior information are required. Extensive simulations confirm the feasibility of the proposed stopping criteria and our sparse recovery algorithm.

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

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

U2 - 10.1109/GLOCOM.2014.7036904

DO - 10.1109/GLOCOM.2014.7036904

M3 - Conference contribution

AN - SCOPUS:84949922584

T3 - 2014 IEEE Global Communications Conference, GLOBECOM 2014

SP - 787

EP - 792

BT - 2014 IEEE Global Communications Conference, GLOBECOM 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Chien TH, Liang WJ, Lu CS. A practical subspace multiple measurement vectors algorithm for cooperative spectrum sensing. In 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 787-792. 7036904. (2014 IEEE Global Communications Conference, GLOBECOM 2014). https://doi.org/10.1109/GLOCOM.2014.7036904