Overlapping coalitional games for collaborative sensing in cognitive radio networks

Tianyu Wang, Lingyang Song, Zhu Han, Walid Saad

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

20 Citations (Scopus)

Abstract

Collaborative spectrum sensing (CSS) has been shown to be able to highly improve the performance of spectrum sensing in cognitive radio networks. However, most existing works focused on either centralized approaches that rely on a global fusion center, thus requiring significant overhead, or on distributed approaches that rely on disjoint coalitions of secondary users (SUs) in which an SU can only cooperate with a single, selected coalition, hence limiting the performance gains of CSS. In this paper, a novel, coalition-based approach to CSS is proposed in which an SU can share its sensing results with more than one coalition. The problem is formulated using a novel class of cooperative games, known as overlapping coalitional games, which enables the SUs to decide, in a distributed manner, on the number of coalitions in which they wish to cooperate, depending on the associated benefit and cost tradeoffs. To solve this game, a novel, distributed algorithm is proposed using which the SUs can self-organize into a stable overlapping coalitional structure. Simulation results show that our proposed algorithm significantly improves the performance in terms of both the average probability of misdetection and the convergence time, relative to the noncooperative case and the state-of-art cooperative CSS with non-overlapping coalitions.

Original languageEnglish
Title of host publicationIEEE Wireless Communications and Networking Conference, WCNC
Pages4118-4123
Number of pages6
DOIs
StatePublished - Aug 21 2013
Event2013 IEEE Wireless Communications and Networking Conference, WCNC 2013 - Shanghai, China
Duration: Apr 7 2013Apr 10 2013

Other

Other2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
CountryChina
CityShanghai
Period4/7/134/10/13

Fingerprint

Cognitive radio
Parallel algorithms
Fusion reactions
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Wang, T., Song, L., Han, Z., & Saad, W. (2013). Overlapping coalitional games for collaborative sensing in cognitive radio networks. In IEEE Wireless Communications and Networking Conference, WCNC (pp. 4118-4123). [6555237] https://doi.org/10.1109/WCNC.2013.6555237

Overlapping coalitional games for collaborative sensing in cognitive radio networks. / Wang, Tianyu; Song, Lingyang; Han, Zhu; Saad, Walid.

IEEE Wireless Communications and Networking Conference, WCNC. 2013. p. 4118-4123 6555237.

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

Wang, T, Song, L, Han, Z & Saad, W 2013, Overlapping coalitional games for collaborative sensing in cognitive radio networks. in IEEE Wireless Communications and Networking Conference, WCNC., 6555237, pp. 4118-4123, 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013, Shanghai, China, 4/7/13. https://doi.org/10.1109/WCNC.2013.6555237
Wang T, Song L, Han Z, Saad W. Overlapping coalitional games for collaborative sensing in cognitive radio networks. In IEEE Wireless Communications and Networking Conference, WCNC. 2013. p. 4118-4123. 6555237 https://doi.org/10.1109/WCNC.2013.6555237
Wang, Tianyu ; Song, Lingyang ; Han, Zhu ; Saad, Walid. / Overlapping coalitional games for collaborative sensing in cognitive radio networks. IEEE Wireless Communications and Networking Conference, WCNC. 2013. pp. 4118-4123
@inproceedings{a4d4fa46461747d39631e14e78c49b7a,
title = "Overlapping coalitional games for collaborative sensing in cognitive radio networks",
abstract = "Collaborative spectrum sensing (CSS) has been shown to be able to highly improve the performance of spectrum sensing in cognitive radio networks. However, most existing works focused on either centralized approaches that rely on a global fusion center, thus requiring significant overhead, or on distributed approaches that rely on disjoint coalitions of secondary users (SUs) in which an SU can only cooperate with a single, selected coalition, hence limiting the performance gains of CSS. In this paper, a novel, coalition-based approach to CSS is proposed in which an SU can share its sensing results with more than one coalition. The problem is formulated using a novel class of cooperative games, known as overlapping coalitional games, which enables the SUs to decide, in a distributed manner, on the number of coalitions in which they wish to cooperate, depending on the associated benefit and cost tradeoffs. To solve this game, a novel, distributed algorithm is proposed using which the SUs can self-organize into a stable overlapping coalitional structure. Simulation results show that our proposed algorithm significantly improves the performance in terms of both the average probability of misdetection and the convergence time, relative to the noncooperative case and the state-of-art cooperative CSS with non-overlapping coalitions.",
author = "Tianyu Wang and Lingyang Song and Zhu Han and Walid Saad",
year = "2013",
month = "8",
day = "21",
doi = "10.1109/WCNC.2013.6555237",
language = "English",
isbn = "9781467359399",
pages = "4118--4123",
booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",

}

TY - GEN

T1 - Overlapping coalitional games for collaborative sensing in cognitive radio networks

AU - Wang, Tianyu

AU - Song, Lingyang

AU - Han, Zhu

AU - Saad, Walid

PY - 2013/8/21

Y1 - 2013/8/21

N2 - Collaborative spectrum sensing (CSS) has been shown to be able to highly improve the performance of spectrum sensing in cognitive radio networks. However, most existing works focused on either centralized approaches that rely on a global fusion center, thus requiring significant overhead, or on distributed approaches that rely on disjoint coalitions of secondary users (SUs) in which an SU can only cooperate with a single, selected coalition, hence limiting the performance gains of CSS. In this paper, a novel, coalition-based approach to CSS is proposed in which an SU can share its sensing results with more than one coalition. The problem is formulated using a novel class of cooperative games, known as overlapping coalitional games, which enables the SUs to decide, in a distributed manner, on the number of coalitions in which they wish to cooperate, depending on the associated benefit and cost tradeoffs. To solve this game, a novel, distributed algorithm is proposed using which the SUs can self-organize into a stable overlapping coalitional structure. Simulation results show that our proposed algorithm significantly improves the performance in terms of both the average probability of misdetection and the convergence time, relative to the noncooperative case and the state-of-art cooperative CSS with non-overlapping coalitions.

AB - Collaborative spectrum sensing (CSS) has been shown to be able to highly improve the performance of spectrum sensing in cognitive radio networks. However, most existing works focused on either centralized approaches that rely on a global fusion center, thus requiring significant overhead, or on distributed approaches that rely on disjoint coalitions of secondary users (SUs) in which an SU can only cooperate with a single, selected coalition, hence limiting the performance gains of CSS. In this paper, a novel, coalition-based approach to CSS is proposed in which an SU can share its sensing results with more than one coalition. The problem is formulated using a novel class of cooperative games, known as overlapping coalitional games, which enables the SUs to decide, in a distributed manner, on the number of coalitions in which they wish to cooperate, depending on the associated benefit and cost tradeoffs. To solve this game, a novel, distributed algorithm is proposed using which the SUs can self-organize into a stable overlapping coalitional structure. Simulation results show that our proposed algorithm significantly improves the performance in terms of both the average probability of misdetection and the convergence time, relative to the noncooperative case and the state-of-art cooperative CSS with non-overlapping coalitions.

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

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

U2 - 10.1109/WCNC.2013.6555237

DO - 10.1109/WCNC.2013.6555237

M3 - Conference contribution

SN - 9781467359399

SP - 4118

EP - 4123

BT - IEEE Wireless Communications and Networking Conference, WCNC

ER -