| 分布式多业务系统信道分配算法 |
| |
| 引用本文： | 李湘洋,赵杭生,赵小龙,张阳.分布式多业务系统信道分配算法[J].计算机科学,2016,43(Z6):272-275, 294. |
| |
| 作者姓名： | 李湘洋 赵杭生 赵小龙 张阳 |
| |
| 作者单位： | 解放军理工大学通信工程学院 南京210007;南京电讯技术研究所 南京210007,南京电讯技术研究所 南京210007,中国人民解放军61541部队 北京100094,解放军理工大学通信工程学院 南京210007;南京电讯技术研究所 南京210007 |
| |
| 基金项目： | 本文受国家自然科学基金面上项目:频谱服务架构及其关键技术研究(61471395),国家自然科学基金项目:认知Ad Hoc网络中动态拓扑管理与路由技术研究(61301161),江苏省自然科学基金:基于时空关联特性的频谱地图构建研究(BK20141070)资助 |
| |
| 摘 要： | 信道决策是认知无线电中的关键技术之一,近年来得到了广泛的研究。集中式算法是最常用的算法形式,但在认知无线电网络这种分布式系统中,集中式算法不易实现。基于Gale和Shapley的大学入学匹配理论,针对认知无线电信道的决策场景以及分布式组网特性,将多用户、多业务系统的信道分配问题建模为多对一匹配博弈,提出一种基于效用矩阵的分布式多用户多业务信道匹配算法。仿真表明,该算法收敛时间短,获得的效用与最优集中式算法接近,远优于随机接入算法。
|
| 关 键 词： | 认知无线电 多对一匹配 信道分配 匹配算法 |
Distributed Channel Allocation Algorithm for Multi-services Systems |
| |
| LI Xiang-yang,ZHAO Hang-sheng,ZHAO Xiao-long and ZHANG Yang.Distributed Channel Allocation Algorithm for Multi-services Systems[J].Computer Science,2016,43(Z6):272-275, 294. |
| |
| Authors: | LI Xiang-yang ZHAO Hang-sheng ZHAO Xiao-long and ZHANG Yang |
| |
| Affiliation: | Institute of Communications Engineering,PLA University of Science and Technology,Nanjing 210007,China;Nanjing Telecommunication Technology Institute,Nanjing 210007,China,Nanjing Telecommunication Technology Institute,Nanjing 210007,China,Unit 61541 of PLA,Beijing 100094,China and Institute of Communications Engineering,PLA University of Science and Technology,Nanjing 210007,China;Nanjing Telecommunication Technology Institute,Nanjing 210007,China |
| |
| Abstract: | As one of the key issues for cognitive radio,channel allocation has been widely studied in recent years.The centralized decision algorithms are common,but it is uneasy to implement centralized algorithms for distributed cognitive radio systems.Based on the college admission matching theory proposed by D.Gale and L.Shapley and characteristics of distributed systems,the channel association of multi-services systems was formulated as a many-to-one matching game.And a distributed channel allocation algorithm based on utility matrix was proposed.Simulations show that the convergence time of the proposed algorithm is short and the utility of stable matching state approximates the optimal centralized algorithm in Rayleigh fading,far better than that of the random access algorithm. |
| |
| Keywords: | Cognitive radio Many-to-one matching Channel allocation Matching algorithm |
|
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
