中文摘要：

针对协作认知无线电网络中较为复杂的多主用户与多次级用户共存场景，提出联合频谱分配与协作集划分问题，并将该问题形式化描述为整数0-1非线性规划问题，证明其是NP．hard的．首先，设计了集中式的遗传算法CGA（centralizedgeneticalgorithm）对问题求解，对该算法进行齐次有限马尔可夫链建模并对其全局收敛性进行了分析；随后，提出了一种包含两阶段的分布式遗传算法DGA（distributedgeneticalgorithm），包括基于最小支配集的分簇与频谱预分配阶段和簇间协作集协商与簇内适应值精化阶段．此外，还提出一种快速收敛的DGA算法（fast-convergentDGA，简称FDGA）缩短分布式算法运行时间．仿真实验结果表明，根据能反映出算法性能的适应值结果对各算法进行比较：（1）小规模网络下CGA获得的解平均为通过穷举算法得到的最优值的92％；（2）随着网络规模的扩大，由于CGA搜索空间增大，DGA，FDGA在达到相同停机条件时获得的适应值比CGA提高约20％；r3）与DGA相比，FDGA虽能得到与DGA相近的结果，但却大大缩短了算法收敛的时间，更适应于大规模网络应用．

英文摘要：

The coexistence of multi-primary users and multi-secondary users in cooperative cognitive radio networks motivate the study to propose a joint spectrum allocation and cooperation set partition problem, which so far has not been addressed before. The problem is formulated as a 0-1 integer non-linear programming model. Due to its NP-hardness, the study proposes a suboptimal Centralized Genetic Algorithm （CGA） to show its convergence by modeling it as a homogeneous finite Markov chain. The study then extends CGA to a fully Distributed Genetic Algorithm （DGA） that consists of two phases. The core techniques include a minimum dominate set based cluster partition, a spectrum pre-allocation algorithm in phase 1, and an inter-cluster cooperation set negotiation and cluster fitness refinement algorithm in phase 2. A Fast-Convergent DGA （FDGA） is. also devised to reduce the system configuration time. Extensive experiments by simulations demonstrate that in terms of the fitness that reflects the performance of the proposed algorithms： （1） CGA is shown to perform as well as 92% of the optimal solution by brutal search under small network sizes; （2） As the network size increases, due to the massive search space CGA has to deal, DGA and FDGA instead outperform CGA with 20% on average when achieving the same algorithm termination condition; （3） FDGA delivers similar results as DGA while reducing the configuration time significantly, which is more suitable for large-scale networks.