分布式网络中采用图型博弈的动态频谱接入  

Dynamic Spectrum Access Algorithm Based on Graphical Game in Distributed Wireless Network

作　　者：李方伟[1] 唐永川[1] 朱江[1] 张海波[1] 

机构地区：[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《北京邮电大学学报》2014年第2期18-22,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61102062;61301122);教育部科学技术研究重点项目(212145);重庆市科委自然基金资助项目(cstc2011jjA1192)

摘　　要：针对分布式无线网络中用户关系拓扑结构的任意性和复杂性带来的维灾问题,提出了一种基于图型博弈的动态频谱接入算法.利用环境信息的非对称性把频谱接入问题抽象为图型博弈模型,并用模型中的图型拓扑表示现实环境中博弈的内在结构;以最小化个人后悔值代替最小化系统后悔值来求解纯策略纳什均衡点.与现有算法比较,该算法能有效降低运算复杂度,满足通信中实时性的要求.仿真结果表明,该算法能快速收敛到无冲突的纯策略纳什均衡,提高了系统容量和功率利用率,在资源匮乏时优势明显.To solve the dimension disaster problem from the arbitrariness and complexity of user-relationship topology in distributed wireless network,a dynamic spectrum access algorithm is presented based on graphical game. Relying on information asymmetry environment,the users accessing channel is modeled as a graphical game so as to construct a new internal game in realistic environment. Pure-strategy Nash equilibrium without conflict is obtained by minimizing the regret value of person instead of that of system. Compared to the existing literatures,the algorithm can reduce the computing complexity effectively and meet the real-time communication requirements. Simulation results show that the pure-strategy Nash equilibrium achieves better system performance in terms of capacity and power utilization,specifically in the system with scare resources.

关 键 词：分布式无线网络 图型博弈 纳什均衡 动态频谱接入 

分 类 号：TN929.5[电子电信—通信与信息系统]