arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.0467cs.ITmath.IT
收藏

认知无线电网络中联合频谱感知与接入的分区形式联盟博弈

Coalitional Games in Partition Form for Joint Spectrum Sensing and Access in Cognitive Radio Networks

Walid Saad, Zhu Han, Rong Zheng, Are Hjørungnes, Tamer Başar, H. Vincent Poor

摘要:

认知无线电网络中的非授权次用户(SU)在频谱感知和频谱接入之间存在固有的权衡。虽然每个SU都有动机感测主用户(PU)信道以定位频谱空洞,但这种频谱探索可能以较短的传输时间为代价,因此可能以较小的数据传输容量为代价。本文研究了这种权衡的影响,寻求合作,以提高他们的频谱(感测),减少相互之间的干扰的可能性,并提高他们的传输容量(接入)的SU网络的合作策略。该问题被建模为一个划分形式的联盟博弈,并提出了一个联盟形成的算法。使用所提出的算法,SU可以做出加入或离开联盟的个体分布式决策,同时最大化它们的效用,其捕获用于感测的平均时间以及在接入频谱时实现的容量。结果表明,通过使用所提出的算法,SU可以自组织成一个由不相交的联盟组成的网络分区,每个联盟的成员合作,共同优化其传感和访问性能。仿真结果表明,该算法的性能改善,相对于非合作的情况下产量。结果还显示了该算法如何允许SU自适应环境中的变化,如PU的流量变化或缓慢的移动性。

英文摘要:

Unlicensed secondary users (SUs) in cognitive radio networks are subject to an inherent tradeoff between spectrum sensing and spectrum access. Although each SU has an incentive to sense the primary user (PU) channels for locating spectrum holes, this exploration of the spectrum can come at the expense of a shorter transmission time, and, hence, a possibly smaller capacity for data transmission. This paper investigates the impact of this tradeoff on the cooperative strategies of a network of SUs that seek to cooperate in order to improve their view of the spectrum (sensing), reduce the possibility of interference among each other, and improve their transmission capacity (access). The problem is modeled as a coalitional game in partition form and an algorithm for coalition formation is proposed. Using the proposed algorithm, the SUs can make individual distributed decisions to join or leave a coalition while maximizing their utilities which capture the average time spent for sensing as well as the capacity achieved while accessing the spectrum. It is shown that, by using the proposed algorithm, the SUs can self-organize into a network partition composed of disjoint coalitions, with the members of each coalition cooperating to jointly optimize their sensing and access performance. Simulation results show the performance improvement that the proposed algorithm yields with respect to the non-cooperative case. The results also show how the algorithm allows the SUs to self-adapt to changes in the environment such as the change in the traffic of the PUs, or slow mobility.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑