检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:岳晓红[1]
出 处:《计算机应用与软件》2014年第10期111-115,共5页Computer Applications and Software
基 金:甘肃省科技计划项目(1118RJZA224)
摘 要:为了最大化认知无线网络次用户系统的吞吐量,同时减少信道选择过程中的计算量,在多条主用户信道的次用户多时隙系统中,用半马尔科夫链POMDP(Partially Observable Markov Decision Process)理论刻画次用户信道选择过程,并提出对应的认知无线网络信道选择算法。在每一个时隙开始时,次用户选择部分信道进行感知,之后根据感知结果选择不同的传输功率接入信道,对于没有被感知的信道,次用户可以直接接入。对POMDP问题求解给出最优策略、次优策略。通过在不同仿真环境下对最优策略、次优策略以及任意策略进行数值分析比较,论证了该设计算法的有效性。In order to maximise the throughput of secondary users (SU) system in cognitive radio networks and to reduce the calculation amount in channel selection process at the same time, in the paper we utilise partially observable Markov decision process (POMDP) theory to depict SUs’ channel selection process in SU multi-slot system in multiple primary users channels, and present the corresponding channel selection algorithm of cognitive radio networks. At the beginning of each time slot, SUs select part of the channels to perceive, and select different transmission power to access the channel afterwards based on perception results, for those channels haven’t been perceived, SUs can access directly. In the paper we also present the optimal policy and suboptimal policy for solutions of POMDP problem. Through numerical analysis and comparison on optimal policy, suboptimal policy and random policy under different simulation environments, we demonstrate the effectiveness of channel selection algorithm designed in the paper.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28