Optimal channel allocation for multi-PU and multi-SU pairs in underlay cognitive radio networks. (2018)

• Record Type: Journal Article
• Authors: Chen, Long; Huang, Liusheng; Xu, Hongli; Guo, Hansong
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 27:Number 1(2018)
• Page Start: 19
• Page End: 33
• Publication Date: 2018
• Subjects: cognitive radio -- underlay -- channel assignment -- multiple pairs -- matching -- bipartite graph -- max-min fairness; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

Abstract

In the underlay cognitive radio networks, this paper defines the joint channel and power allocation problem, which aims to optimise the max-total and max-min throughputs of secondary users (SUs), with the constraints of interference on primary receivers. For the max-total problem, we formulate the problem as a bipartite matching and derive a maximum weighted matching-based sum throughput maximisation algorithm (STMA) to solve this problem. For the max-min problem, on the basis of the optimal relay assignment (ORA) algorithm, we derive a polynomial time optimal channel assignment algorithm (OCAA) to iteratively assign channels to each SU pair under the power constraint. Simulation results demonstrate the effectiveness of our algorithms when compared with random method.