Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks

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 detecti...

• Type: Journal
• Year: 2010
• Where: EJWCN
• Authors: Zaheer Khan, Janne J. Lehtomäki, Marian Codreanu, Matti Latva-aho, Luiz A. DaSilva
• Keywords: Coalition, Coalition Formation, EJWCN 2010, Target Detection Probability