Optimal channel allocation for multi-PU and multi-SU pairs in underlay cognitive radio networks
by Long Chen; Liusheng Huang; Hongli Xu; Hansong Guo
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 27, No. 1, 2018

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.

Online publication date: Tue, 05-Dec-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com