The University of Southampton
University of Southampton Institutional Repository

Distributed matching algorithms for spectrum access: a comparative study and further enhancements

Distributed matching algorithms for spectrum access: a comparative study and further enhancements
Distributed matching algorithms for spectrum access: a comparative study and further enhancements

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

Cognitive radio networks, Cooperative communications, Matching algorithm, Physical layer security, SECCC, Spectrum access strategy
1976-7277
1594-1617
Ali, Bakhtiar
5b9bfa0e-ea32-4196-873a-7501fabc3425
Zamir, Nida
b2a6d01c-544a-4bf4-b13a-c3c1704a2913
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Butt, Muhammad Fasih Uddin
da56c043-0c68-4e87-a293-f3f0c04584de
Ali, Bakhtiar
5b9bfa0e-ea32-4196-873a-7501fabc3425
Zamir, Nida
b2a6d01c-544a-4bf4-b13a-c3c1704a2913
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Butt, Muhammad Fasih Uddin
da56c043-0c68-4e87-a293-f3f0c04584de

Ali, Bakhtiar, Zamir, Nida, Ng, Soon Xin and Butt, Muhammad Fasih Uddin (2018) Distributed matching algorithms for spectrum access: a comparative study and further enhancements. KSII Transactions on Internet and Information Systems, 12 (4), 1594-1617. (doi:10.3837/tiis.2018.04.011).

Record type: Article

Abstract

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

Text
Distributed matching algorithms for spectrum access: A comparative study and further enhancements - Accepted Manuscript
Download (2MB)

More information

Accepted/In Press date: 7 November 2017
e-pub ahead of print date: 30 April 2018
Additional Information: AM added 4/6/18
Keywords: Cognitive radio networks, Cooperative communications, Matching algorithm, Physical layer security, SECCC, Spectrum access strategy

Identifiers

Local EPrints ID: 421425
URI: http://eprints.soton.ac.uk/id/eprint/421425
ISSN: 1976-7277
PURE UUID: 93c2d4e1-a4f0-4cdf-9e0c-8d368815aaf6
ORCID for Soon Xin Ng: ORCID iD orcid.org/0000-0002-0930-7194

Catalogue record

Date deposited: 11 Jun 2018 16:30
Last modified: 20 Jul 2019 01:13

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×