Abstract
This paper considers the problem of resource allocation for a cooperative cognitive radio network with multiple primary users (PUs) and multiple secondary users (SUs), in which secondary users (SUs) relay traffics for primary users, in exchange for dedicated transmission time for their own transmission needs. However, since the PUs and SUs are rational, they aim at maximizing their own utility. Therefore, the problem of conflicting interests between them exists. We formulate the problem as a coalitional game to analyze the cooperation behavior between PUs and SUs. We propose to form the grand coalition by grouping all PUs and SUs in a set, and to use the core and the Shapley value solution concepts, respectively to analyze the stability and fairness of cooperative resource allocation. The optimal fraction of time allocation and power allocation for PUs and SUs are derived by an iterative updating algorithm, respectively. Simulation results show the benefits of our proposed approach as compared with other approaches.
| Original language | English |
|---|---|
| Pages (from-to) | 1741-1749 |
| Number of pages | 9 |
| Journal | Sensor Letters |
| Volume | 11 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 2013 |
Keywords
- Coalitional Game
- Cooperative cognitive radio networks
- Core
- Power control
- Shapley value