Cargando…
Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks
Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research inter...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6308550/ https://www.ncbi.nlm.nih.gov/pubmed/30544684 http://dx.doi.org/10.3390/s18124360 |
_version_ | 1783383215472377856 |
---|---|
author | Al-Mqdashi, AbdulMajid Sali, Aduwati Noordin, Nor kamariah Hashim, Shaiful J. Nordin, Rosdiadee |
author_facet | Al-Mqdashi, AbdulMajid Sali, Aduwati Noordin, Nor kamariah Hashim, Shaiful J. Nordin, Rosdiadee |
author_sort | Al-Mqdashi, AbdulMajid |
collection | PubMed |
description | Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics. |
format | Online Article Text |
id | pubmed-6308550 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-63085502019-01-04 Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks Al-Mqdashi, AbdulMajid Sali, Aduwati Noordin, Nor kamariah Hashim, Shaiful J. Nordin, Rosdiadee Sensors (Basel) Article Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics. MDPI 2018-12-10 /pmc/articles/PMC6308550/ /pubmed/30544684 http://dx.doi.org/10.3390/s18124360 Text en © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Al-Mqdashi, AbdulMajid Sali, Aduwati Noordin, Nor kamariah Hashim, Shaiful J. Nordin, Rosdiadee Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks |
title | Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks |
title_full | Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks |
title_fullStr | Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks |
title_full_unstemmed | Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks |
title_short | Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks |
title_sort | efficient matrix-based channel hopping schemes for blind rendezvous in distributed cognitive radio networks |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6308550/ https://www.ncbi.nlm.nih.gov/pubmed/30544684 http://dx.doi.org/10.3390/s18124360 |
work_keys_str_mv | AT almqdashiabdulmajid efficientmatrixbasedchannelhoppingschemesforblindrendezvousindistributedcognitiveradionetworks AT saliaduwati efficientmatrixbasedchannelhoppingschemesforblindrendezvousindistributedcognitiveradionetworks AT noordinnorkamariah efficientmatrixbasedchannelhoppingschemesforblindrendezvousindistributedcognitiveradionetworks AT hashimshaifulj efficientmatrixbasedchannelhoppingschemesforblindrendezvousindistributedcognitiveradionetworks AT nordinrosdiadee efficientmatrixbasedchannelhoppingschemesforblindrendezvousindistributedcognitiveradionetworks |