检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蒋涛涛 朱江[1] Jiang Taotao;Zhu Jiang(Chongqing Key Laboratory of Mobile Communications Technology,School of Communication&Information Engineering,Chongqing University of Posts&Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院移动通信技术重庆市重点实验室,重庆400065
出 处:《计算机应用研究》2020年第8期2500-2503,共4页Application Research of Computers
基 金:国家自然科学基金资助项目(61102062);国家教育部科学技术研究重点项目(212145);重庆市科委自然科学基金资助项目(cstc2015jcyjA40050)。
摘 要:针对认知无线网络中多用户资源分配时需要大量信道和功率策略信息交互,并且占用和耗费了大规模系统资源的问题,通过非合作博弈模型对用户的策略进行了研究,提出一种基于多用户Q学习的联合信道选择和功率控制算法。用户在自学习过程中将采用统一的策略,仅通过观察自己的回报来进行Q学习,并逐渐收敛到最优信道和功率分配的最优集合。仿真结果表明,该算法可以高概率地收敛到纳什均衡,用户通过信道选择得到的整体回报非常接近最大整体回报值。When multi-user resources allocate in cognitive radio networks,a large amount of channels and power strategy information need to interact,which will cause a large occupation and expend of system resources.To solve this problem,this paper analyzed the users with a non-cooperative game model and proposed a joint channel selection and power control algorithm based on multi-user Q-learning.In the process of self-learning,the users would observe their own rewards and did Q-learning with a unified strategy,the learning result gradually converged to the optimal set of optimal channel and power allocation.As simulation results show that the algorithm can converge to Nash equilibrium with high probability,and the overall reward obtained from the user channel selection is very close to the maximum overall reward.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.114