Abstract
We consider a cognitive radio network where secondary users (SUs) are allowed access time to the spectrum belonging to the primary users (PUs) provided that they relay primary messages. PUs and SUs negotiate over allocations of the secondary power that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power allocations. We stipulate a limited information exchange in the network so that agents only calculate their own utilities but no information is available about the utilities of any other users in the network. We establish convergence to epsilon pairwise stable matchings in finite time. Finally we show that our algorithm exhibits a limited degradation in PU utility when compared with the Pareto optimal results attained using perfect information assumptions. © 2016 IEEE.
| Original language | English (US) |
|---|---|
| Title of host publication | 2016 IEEE International Symposium on Information Theory (ISIT) |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 2938-2942 |
| Number of pages | 5 |
| ISBN (Print) | 9781509018062 |
| DOIs | |
| State | Published - Aug 15 2016 |