Two-Sided Matching Based Cooperative Spectrum Sharing

IEEE Transactions on Mobile Computing(2017)

引用 54|浏览69
暂无评分
摘要
Dynamic spectrum access (DSA) can effectively improve the spectrum efficiency and alleviate the spectrumscarcity, by allowing unlicensed secondary users (SUs) to access the licensed spectrumof primary users (PUs) opportunistically. Cooperative spectrum sharing is a new promising paradigm to provide necessary incentives for both PUs and SUs in dynamic spectrum access. The key idea is that SUs relay the traffic of PUs in exchange for the access time on the PUs licensed spectrum. In this paper, we formulate the cooperative spectrum sharing between multiple PUs and multiple SUs as a two-sided market, and study the market equilibrium under both complete and incomplete information. First, we characterize the sufficient and necessary conditions for the market equilibrium.We analytically show that there may exist multiple market equilibria, among which there is always a unique Pareto-optimal equilibrium for PUs (called PU-Optimal-EQ), in which every PU achieves a utility no worse than in any other equilibrium. Then, we show that under complete information, the unique Pareto-optimal equilibrium PU-Optimal-EQ can always be achieved despite the competition among PUs; whereas, under incomplete information, the PU-Optimal-EQ may not be achieved due to the mis-representations of SUs (in reporting their private information). Regarding this, we further study the worse-case equilibrium for PUs, and characterize a Robust equilibrium for PUs (called PU-Robust-EQ), which provides every PU a guaranteed utility under all possible mis-representation behaviors of SUs. Numerical results show that in a typical network where the number of PUs and SUs are different, the performance gap between PU-Optimal-EQ and PU-Robust-EQ is quite small (e.g., less than 10 percent in the simulations). © 2002-2012 IEEE.
更多
查看译文
关键词
Cooperative spectrum sharing,game theory,market equilibrium,two-sided matching
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要