Graph-based robust resource allocation for cognitive radio networks

In this paper, we investigate robust resource allocation for cognitive radio networks. First, a resource allocation scheme based on stable matching is developed, which takes the preferences of both secondary users and primary users into account. To improve its robustness, we then discuss an ϵ-stable resource allocation scheme. With the help of the properties of ϵ-stable resource allocation, three edge-cutting algorithms are proposed. Numerical results show that the modified algorithms are robust to the channel state information variation.