Scheduling in cooperative cognitive radio networks

This paper considers network-layer cooperation in cognitive radio networks whereby secondary users may be allowed to relay primary users packets. Under this cooperative scheme, the paper investigates whether, and under what conditions, the primary and secondary networks can be stabilized without explicit knowledge of the arrival-rates. We consider a deterministic and periodic primary packet arrival process and develop a relaying and scheduling algorithm using Lyapunov drift techniques that does not require explicit knowledge of primary and secondary packet arrival rates. The algorithm is then shown to stabilize the transmission queues in the network for all secondary packet arrival rate vectors that lie in the interior of a certain region. The region includes all secondary arrival-rate vectors that can be supported when the secondary nodes do not cooperate. Furthermore, when the primary data arrival-rate is greater than what could have been supported without cooperative relay but less than what can be maximally supported with cooperation, the algorithm stabilizes the network for a non-empty set of secondary arrival-rate vectors. The significance of these results is that they show that properly designed cooperation may result in a win-win scenario for both primary and secondary users (and not just for the primary users).