A segment-graph algorithm is provided for wireless spectrum allocation in cognitive networks based on the cooperation of the secondary users, which aim to maximize the utilization of the limited spectrum bands and minimize the total cost of all the secondary users to buy (or lease) the spectrum bands. The segment-graph of the complement graph of the original interference graph is defined. The proposed segment-graph algorithm is based on finding the complete subgraph of the segment-graph repeatedly. It is proved that the proposed algorithm always obtains the optimal solution if one of the segment-graphs is complete in each iteration. In general cases, the proposed algorithm dramatically reduces the total cost of all the secondary users. Comparative simulations agree with the theoretical results obtained.

提供了一种分段图算法，用于基于次要用户的协作在认知网络中进行无线频谱分配，该算法旨在最大程度地利用有限的频段，并使所有次要用户购买（或租赁）的总成本最小化频谱带。定义了原始干涉图的补图的分段图。提出的分段图算法基于反复查找分段图的完整子图。实践证明，该算法在每次迭代中完成其中一个分段图时，总能获得最优解。在一般情况下，提出的算法会大大降低所有二级用户的总成本。比较模拟与所获得的理论结果一致。