Stable channel allocation in hybrid overlay/underlay cognitive radio networks

Fast and high utility channel allocation is one of the key issues of cognitive radio. In this paper, the channel allocation is formulated as a one-to-one matching game, and a distributed user-channel stable matching algorithm with low complexity is proposed to optimize the utility. We apply the algorithm to a hybrid underlay/overlay cognitive network in which secondary users utilize different manners of spectrum sharing due to their different geographic locations. The simulation results demonstrate that the convergence time of the proposed algorithm is shorter than G-S algorithm and the utility is close to the upper bound obtained by the Hungarian method.