Matching Theory for Channel Allocation in Cognitive Radio Networks

L. Cao, F. Yao, H. Zhao, J. Zhang

Matching Theory for Channel Allocation in Cognitive Radio Networks

Číslo: 4/2016
Periodikum: Radioengineering Journal
DOI: 10.13164/re.2016.0741

Klíčová slova: cognitive radio, channel allocation, optimization, matching theory, stable matching, computation complexity, Kognitivní rádio, přidělování kanálů, optimalizace, teorie shody, stabilní shoda, výpočetní složitost

Pro získání musíte mít účet v Citace PRO.

Přečíst po přihlášení

Anotace: For a cognitive radio network (CRN) in which a set of secondary users (SUs) competes for a limited number of channels (spectrum resources) belonging to primary users (PUs), the channel allocation is a challenge and dominates the throughput and congestion of the network. In this paper, the channel allocation problem is first formulated as the 0-1 integer programming optimization, with considering the overall utility both of primary system and secondary system. Inspired by matching theory, a many-to-one matching game is used to remodel the channel allocation problem, and the corresponding PU proposing deferred acceptance (PPDA) algorithm is also proposed to yield a stable matching. We compare the performance and computation complexity between these two solutions. Numerical results demonstrate the efficiency and obtain the communication overhead of the proposed scheme.