Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks

Walid Saad, Zhu Han, Tamer Başar, Are Hjørungnes, Ju Bin Song

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

26 Citations (Scopus)

Abstract

In order to maintain a conflict-free environment among licensed primary users (PUs) and unlicensed secondary users (SUs) in cognitive radio networks, providing frequency and geographical information through control channels, such as the cognitive pilot channel (CPC), has been recently proposed. While existing literature focused on the type of information that these control channels need to carry, this paper investigates the problem of gathering this information cooperatively, among a network of secondary base stations (SBSs). In this regard, given a cognitive network where every SBS can only have accurate knowledge on a small number of different primary users (PUs) or channels, each SBS can cooperate with neighboring SBSs in order to improve its view of the spectrum, i.e., learn about new PUs that can subsequently be used by its served SUs. We model the problem as a hedonic coalition formation game among the SBSs and we propose an algorithm for forming the coalitions. Using the proposed algorithm, each SBS can take an individual decision to join or leave a coalition while maximizing its overall potential utility, which accounts for the tradeoff between the benefit from learning new channels through coalition members and the cost from receiving inaccurate information. Simulation results show that the proposed algorithm yields a performance advantage, in terms of the average payoff per SBS reaching up to 165% relative to the non-cooperative case for a large network with 27 SBSs.

Original languageEnglish
Title of host publicationIEEE Wireless Communications and Networking Conference, WCNC
DOIs
StatePublished - Aug 3 2010
EventIEEE Wireless Communications and Networking Conference 2010, WCNC 2010 - Sydney, NSW, Australia
Duration: Apr 18 2010Apr 21 2010

Other

OtherIEEE Wireless Communications and Networking Conference 2010, WCNC 2010
CountryAustralia
CitySydney, NSW
Period4/18/104/21/10

Fingerprint

Cognitive radio
Base stations
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Saad, W., Han, Z., Başar, T., Hjørungnes, A., & Song, J. B. (2010). Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks. In IEEE Wireless Communications and Networking Conference, WCNC [5506107] https://doi.org/10.1109/WCNC.2010.5506107

Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks. / Saad, Walid; Han, Zhu; Başar, Tamer; Hjørungnes, Are; Song, Ju Bin.

IEEE Wireless Communications and Networking Conference, WCNC. 2010. 5506107.

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

Saad, W, Han, Z, Başar, T, Hjørungnes, A & Song, JB 2010, Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks. in IEEE Wireless Communications and Networking Conference, WCNC., 5506107, IEEE Wireless Communications and Networking Conference 2010, WCNC 2010, Sydney, NSW, Australia, 4/18/10. https://doi.org/10.1109/WCNC.2010.5506107
Saad W, Han Z, Başar T, Hjørungnes A, Song JB. Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks. In IEEE Wireless Communications and Networking Conference, WCNC. 2010. 5506107 https://doi.org/10.1109/WCNC.2010.5506107
Saad, Walid ; Han, Zhu ; Başar, Tamer ; Hjørungnes, Are ; Song, Ju Bin. / Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks. IEEE Wireless Communications and Networking Conference, WCNC. 2010.
@inproceedings{1b5ee930b860437f8d1429e75a878c2b,
title = "Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks",
abstract = "In order to maintain a conflict-free environment among licensed primary users (PUs) and unlicensed secondary users (SUs) in cognitive radio networks, providing frequency and geographical information through control channels, such as the cognitive pilot channel (CPC), has been recently proposed. While existing literature focused on the type of information that these control channels need to carry, this paper investigates the problem of gathering this information cooperatively, among a network of secondary base stations (SBSs). In this regard, given a cognitive network where every SBS can only have accurate knowledge on a small number of different primary users (PUs) or channels, each SBS can cooperate with neighboring SBSs in order to improve its view of the spectrum, i.e., learn about new PUs that can subsequently be used by its served SUs. We model the problem as a hedonic coalition formation game among the SBSs and we propose an algorithm for forming the coalitions. Using the proposed algorithm, each SBS can take an individual decision to join or leave a coalition while maximizing its overall potential utility, which accounts for the tradeoff between the benefit from learning new channels through coalition members and the cost from receiving inaccurate information. Simulation results show that the proposed algorithm yields a performance advantage, in terms of the average payoff per SBS reaching up to 165{\%} relative to the non-cooperative case for a large network with 27 SBSs.",
author = "Walid Saad and Zhu Han and Tamer Başar and Are Hj{\o}rungnes and Song, {Ju Bin}",
year = "2010",
month = "8",
day = "3",
doi = "10.1109/WCNC.2010.5506107",
language = "English",
isbn = "9781424463985",
booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",

}

TY - GEN

T1 - Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks

AU - Saad, Walid

AU - Han, Zhu

AU - Başar, Tamer

AU - Hjørungnes, Are

AU - Song, Ju Bin

PY - 2010/8/3

Y1 - 2010/8/3

N2 - In order to maintain a conflict-free environment among licensed primary users (PUs) and unlicensed secondary users (SUs) in cognitive radio networks, providing frequency and geographical information through control channels, such as the cognitive pilot channel (CPC), has been recently proposed. While existing literature focused on the type of information that these control channels need to carry, this paper investigates the problem of gathering this information cooperatively, among a network of secondary base stations (SBSs). In this regard, given a cognitive network where every SBS can only have accurate knowledge on a small number of different primary users (PUs) or channels, each SBS can cooperate with neighboring SBSs in order to improve its view of the spectrum, i.e., learn about new PUs that can subsequently be used by its served SUs. We model the problem as a hedonic coalition formation game among the SBSs and we propose an algorithm for forming the coalitions. Using the proposed algorithm, each SBS can take an individual decision to join or leave a coalition while maximizing its overall potential utility, which accounts for the tradeoff between the benefit from learning new channels through coalition members and the cost from receiving inaccurate information. Simulation results show that the proposed algorithm yields a performance advantage, in terms of the average payoff per SBS reaching up to 165% relative to the non-cooperative case for a large network with 27 SBSs.

AB - In order to maintain a conflict-free environment among licensed primary users (PUs) and unlicensed secondary users (SUs) in cognitive radio networks, providing frequency and geographical information through control channels, such as the cognitive pilot channel (CPC), has been recently proposed. While existing literature focused on the type of information that these control channels need to carry, this paper investigates the problem of gathering this information cooperatively, among a network of secondary base stations (SBSs). In this regard, given a cognitive network where every SBS can only have accurate knowledge on a small number of different primary users (PUs) or channels, each SBS can cooperate with neighboring SBSs in order to improve its view of the spectrum, i.e., learn about new PUs that can subsequently be used by its served SUs. We model the problem as a hedonic coalition formation game among the SBSs and we propose an algorithm for forming the coalitions. Using the proposed algorithm, each SBS can take an individual decision to join or leave a coalition while maximizing its overall potential utility, which accounts for the tradeoff between the benefit from learning new channels through coalition members and the cost from receiving inaccurate information. Simulation results show that the proposed algorithm yields a performance advantage, in terms of the average payoff per SBS reaching up to 165% relative to the non-cooperative case for a large network with 27 SBSs.

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

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

U2 - 10.1109/WCNC.2010.5506107

DO - 10.1109/WCNC.2010.5506107

M3 - Conference contribution

SN - 9781424463985

BT - IEEE Wireless Communications and Networking Conference, WCNC

ER -