Distributed cooperative sensing in cognitive radio networks: An overlapping coalition formation approach

Tianyu Wang, Lingyang Song, Zhu Han, Walid Saad

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

Cooperative spectrum sensing has been shown to yield a significant performance improvement in cognitive radio networks. In this paper, we consider distributed cooperative sensing (DCS) in which secondary users (SUs) exchange data with one another instead of reporting to a common fusion center. In most existing DCS algorithms, the SUs are grouped into disjoint cooperative groups or coalitions, and within each coalition the local sensing data is exchanged. However, these schemes do not account for the possibility that an SU can be involved in multiple cooperative coalitions thus forming overlapping coalitions. Here, we address this problem using novel techniques from a class of cooperative games, known as overlapping coalition formation games, and based on the game model, we propose a distributed DCS algorithm in which the SUs self-organize into a desirable network structure with overlapping coalitions. Simulation results show that the proposed overlapping algorithm yields significant performance improvements, decreasing the total error probability up to 25% in the Qm+Qfcriterion, the missed detection probability up to 20% in the QmQf} criterion, the overhead up to 80%, and the total report number up to 10%, compared with the state-of-the-art non-overlapping algorithm.

Original languageEnglish
Article number6881693
Pages (from-to)3144-3160
Number of pages17
JournalIEEE Transactions on Communications
Volume62
Issue number9
DOIs
StatePublished - Sep 1 2014

Fingerprint

Cognitive radio
Electronic data interchange
Fusion reactions

Keywords

  • Cognitive radio
  • cooperative games.
  • cooperative spectrum sensing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Distributed cooperative sensing in cognitive radio networks : An overlapping coalition formation approach. / Wang, Tianyu; Song, Lingyang; Han, Zhu; Saad, Walid.

In: IEEE Transactions on Communications, Vol. 62, No. 9, 6881693, 01.09.2014, p. 3144-3160.

Research output: Contribution to journalArticle

Wang, Tianyu ; Song, Lingyang ; Han, Zhu ; Saad, Walid. / Distributed cooperative sensing in cognitive radio networks : An overlapping coalition formation approach. In: IEEE Transactions on Communications. 2014 ; Vol. 62, No. 9. pp. 3144-3160.
@article{20b938fade08480a80ee290098dc6581,
title = "Distributed cooperative sensing in cognitive radio networks: An overlapping coalition formation approach",
abstract = "Cooperative spectrum sensing has been shown to yield a significant performance improvement in cognitive radio networks. In this paper, we consider distributed cooperative sensing (DCS) in which secondary users (SUs) exchange data with one another instead of reporting to a common fusion center. In most existing DCS algorithms, the SUs are grouped into disjoint cooperative groups or coalitions, and within each coalition the local sensing data is exchanged. However, these schemes do not account for the possibility that an SU can be involved in multiple cooperative coalitions thus forming overlapping coalitions. Here, we address this problem using novel techniques from a class of cooperative games, known as overlapping coalition formation games, and based on the game model, we propose a distributed DCS algorithm in which the SUs self-organize into a desirable network structure with overlapping coalitions. Simulation results show that the proposed overlapping algorithm yields significant performance improvements, decreasing the total error probability up to 25{\%} in the Qm+Qfcriterion, the missed detection probability up to 20{\%} in the QmQf} criterion, the overhead up to 80{\%}, and the total report number up to 10{\%}, compared with the state-of-the-art non-overlapping algorithm.",
keywords = "Cognitive radio, cooperative games., cooperative spectrum sensing",
author = "Tianyu Wang and Lingyang Song and Zhu Han and Walid Saad",
year = "2014",
month = "9",
day = "1",
doi = "10.1109/TCOMM.2014.2350503",
language = "English",
volume = "62",
pages = "3144--3160",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Distributed cooperative sensing in cognitive radio networks

T2 - An overlapping coalition formation approach

AU - Wang, Tianyu

AU - Song, Lingyang

AU - Han, Zhu

AU - Saad, Walid

PY - 2014/9/1

Y1 - 2014/9/1

N2 - Cooperative spectrum sensing has been shown to yield a significant performance improvement in cognitive radio networks. In this paper, we consider distributed cooperative sensing (DCS) in which secondary users (SUs) exchange data with one another instead of reporting to a common fusion center. In most existing DCS algorithms, the SUs are grouped into disjoint cooperative groups or coalitions, and within each coalition the local sensing data is exchanged. However, these schemes do not account for the possibility that an SU can be involved in multiple cooperative coalitions thus forming overlapping coalitions. Here, we address this problem using novel techniques from a class of cooperative games, known as overlapping coalition formation games, and based on the game model, we propose a distributed DCS algorithm in which the SUs self-organize into a desirable network structure with overlapping coalitions. Simulation results show that the proposed overlapping algorithm yields significant performance improvements, decreasing the total error probability up to 25% in the Qm+Qfcriterion, the missed detection probability up to 20% in the QmQf} criterion, the overhead up to 80%, and the total report number up to 10%, compared with the state-of-the-art non-overlapping algorithm.

AB - Cooperative spectrum sensing has been shown to yield a significant performance improvement in cognitive radio networks. In this paper, we consider distributed cooperative sensing (DCS) in which secondary users (SUs) exchange data with one another instead of reporting to a common fusion center. In most existing DCS algorithms, the SUs are grouped into disjoint cooperative groups or coalitions, and within each coalition the local sensing data is exchanged. However, these schemes do not account for the possibility that an SU can be involved in multiple cooperative coalitions thus forming overlapping coalitions. Here, we address this problem using novel techniques from a class of cooperative games, known as overlapping coalition formation games, and based on the game model, we propose a distributed DCS algorithm in which the SUs self-organize into a desirable network structure with overlapping coalitions. Simulation results show that the proposed overlapping algorithm yields significant performance improvements, decreasing the total error probability up to 25% in the Qm+Qfcriterion, the missed detection probability up to 20% in the QmQf} criterion, the overhead up to 80%, and the total report number up to 10%, compared with the state-of-the-art non-overlapping algorithm.

KW - Cognitive radio

KW - cooperative games.

KW - cooperative spectrum sensing

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

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

U2 - 10.1109/TCOMM.2014.2350503

DO - 10.1109/TCOMM.2014.2350503

M3 - Article

AN - SCOPUS:84907519584

VL - 62

SP - 3144

EP - 3160

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 9

M1 - 6881693

ER -