IEEE Trans Cybern. 2017 May;47(5):1133-1146. doi: 10.1109/TCYB.2016.2538293. Epub 2016 Mar 22.
In cognitive radio networks, self-interested secondary users (SUs) desire to maximize their own throughput. They compete with each other for transmit time once the absence of primary users (PUs) is detected. To satisfy the requirement of PU protection, on the other hand, they have to form some coalitions and cooperate to conduct spectrum sensing. Such dilemma of SUs between competition and cooperation motivates us to study two interesting issues: 1) how to appropriately form some coalitions for cooperative spectrum sensing (CSS) and 2) how to share transmit time among SUs. We jointly consider these two issues, and propose a noncooperative game model with 2-D strategies. The first dimension determines coalition formation, and the second indicates transmit time allocation. Considering the complexity of solving this game, we decompose the game into two more tractable ones: one deals with the formation of CSS coalitions, and the other focuses on the allocation of transmit time. We characterize the Nash equilibria (NEs) of both games, and show that the combination of these two NEs corresponds to the NE of the original game. We also develop a distributed algorithm to achieve a desirable NE of the original game. When this NE is achieved, the SUs obtain a Dhp-stable coalition structure and a fair transmit time allocation. Numerical results verify our analyses, and demonstrate the effectiveness of our algorithm.
在认知无线电网络中，自利的次用户（SU）希望最大化其吞吐量。一旦检测到主用户（PU）不存在，它们就会相互竞争传输时间。另一方面，为了满足 PU 保护的要求，它们必须形成一些联盟并合作进行频谱感知。SU 之间的这种竞争与合作的困境促使我们研究两个有趣的问题：1）如何适当形成一些用于合作频谱感知（CSS）的联盟，以及 2）如何在 SU 之间共享传输时间。我们共同考虑这两个问题，并提出了一个具有 2-D 策略的非合作博弈模型。第一个维度决定联盟的形成，第二个维度表示传输时间的分配。考虑到解决这个博弈的复杂性，我们将博弈分解为两个更易于处理的博弈：一个处理 CSS 联盟的形成，另一个则专注于传输时间的分配。我们刻画了这两个博弈的纳什均衡（NE），并表明这两个 NE 的组合对应于原始博弈的 NE。我们还开发了一种分布式算法来实现原始博弈的理想 NE。当达到这个 NE 时，SU 就会获得一个 Dhp-稳定的联盟结构和公平的传输时间分配。数值结果验证了我们的分析，并证明了我们算法的有效性。
