论文部分内容阅读
针对多信道感知无线电网络中现有协作式频谱感知方法的不足,考虑信道使用特征、检测性能的动态性以及SU选择感知信道时需对PU造成的干扰降至最低等因素,将信道分配问题建模为非线性整数规划问题.为高效地获得该问题的解,通过构建一个完整的二部图并定义合适的权重向量,将该问题转化为凸二部匹配问题,进而提出一种信道分配算法,可在多项式时间内计算出问题的解,包括SU数量、信道数量以及最大权重值.仿真结果表明:随着SU数量的增加,PU的漏检概率和SU的平均可用时间都在下降;本文算法的吞吐量要优于已有的频谱感知算法.
In view of the deficiencies of the existing cooperative spectrum sensing methods in multi-channel cognitive radio networks, considering the characteristics of channel usage, the dynamic performance of detection, and minimizing the interference caused by SU when choosing the perceptual channel, the channel assignment problem The model is a nonlinear integer programming problem.In order to efficiently obtain the solution of the problem, a complete bipartite graph is constructed and an appropriate weight vector is defined, which transforms the problem into a convex two-part matching problem, and then proposes a channel allocation algorithm , The solution of the problem can be calculated in polynomial time, including the number of SUs, the number of channels and the maximum weight value.The simulation results show that as the number of SUs increases, the probability of missed detection and the average SU availability time decrease; The throughput of the algorithm is better than the existing spectrum sensing algorithm.