Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks
Citation:
Zaheer Khan, Janne Lehtomaki, Marian Codreanu, Matti Latva-aho and Luiz A. DaSilva, Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks, EURASIP Journal on Wireless Communications and Networking, 2010, 2010, 653913-Download Item:
Abstract:
We formulate the problem of distributed throughput-efficient sensing in cognitive radio (CR) networks as a dynamic coalition formation game based on a Markovian model. The proposed coalition formation enables the CRs to increase their achievable throughput, under the detection probability constraint, while also taking into account the overhead in sensing reports combining. The dynamic model of coalition formation is used to express and model the behavior of the coalition forming CRs over time. In the proposed game, CRs form coalitions either to increase their individual gains (selfish coalition formation) or to maximize the overall gains of the group (altruistic coalition formation). We show that the proposed coalition formation solutions yield significant gains in terms of reduced average false alarm probability and increased average throughput per CR as compared to the non-cooperative solutions. Given a target detection probability for a coalition, we adopt a weighted target detection probability for individual CRs in a coalition. We find that the weighted target detection probability for individual CRs results in increased average throughput per CR as compared to when each CR is assigned the same target detection probability in a coalition.
Author's Homepage:
http://people.tcd.ie/dasilvalDescription:
PUBLISHED
Author: DA SILVA, LUIZ
Type of material:
Journal ArticleSeries/Report no:
EURASIP Journal on Wireless Communications and Networking2010
Availability:
Full text availableMetadata
Show full item recordLicences: