A Fast Blind Rendezvous Method by Alternate Hop-and-Wait Channel Hopping in Cognitive Radio Networks

Chuang, I-Hsun; Wu, Hsiao-Yun; Kuo, Yau‐Hwang

doi:10.1109/tmc.2013.2297313

Cited by 63 publications

(34 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To overcome these challenges, many asynchronous CH algorithms (i.e., one that does not require clock synchronization) have been proposed recently in the literature [13][14][15][16][17][18][19][20][21]. DaSilva and Guerreiro [13] proposed a sequence-based rendezvous and was later referred to as the generated orthogonal sequence (GOS) algorithm in which all SUs use the identical predefined CH sequences.…”

Section: Asynchronous Rendezvous Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Asynchronous Channel-Hopping Scheme under Jamming Attacks

Kim

Kang

2018

Mobile Information Systems

View full text Add to dashboard Cite

Cognitive radio networks (CRNs) are considered an attractive technology to mitigate inefficiency in the usage of licensed spectrum. CRNs allow the secondary users (SUs) to access the unused licensed spectrum and use a blind rendezvous process to establish communication links between SUs. In particular, quorum-based channel-hopping (CH) schemes have been studied recently to provide guaranteed blind rendezvous in decentralized CRNs without using global time synchronization. However, these schemes remain vulnerable to jamming attacks. In this paper, we first analyze the limitations of quorum-based rendezvous schemes called asynchronous channel hopping (ACH). Then, we introduce a novel sequence sensing jamming attack (SSJA) model in which a sophisticated jammer can dramatically reduce the rendezvous success rates of ACH schemes. In addition, we propose a fast and robust asynchronous rendezvous scheme (FRARS) that can significantly enhance robustness under jamming attacks. Our numerical results demonstrate that the performance of the proposed scheme vastly outperforms the ACH scheme when there are security concerns about a sequence sensing jammer.

show abstract

Section: Asynchronous Rendezvous Algorithmsmentioning

confidence: 99%

“…e higher velocity SU will eventually catch the lower velocity SU. Chuang et al [18] presents a new alternate HOP-and-WAIT channel-hopping method (E-AHW) to minimize the time to rendezvous (TTR) than existing methods. In this method, each SU has a unique alternating sequence of HOP and WAIT.…”

Section: Asynchronous Rendezvous Algorithmsmentioning

confidence: 99%

Asynchronous Channel-Hopping Scheme under Jamming Attacks

Kim

Kang

2018

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…In a sequence-based method, each node changes its negotiating channel in accordance with a random or a predetermined channel-hopping sequence [8]. Sequence-based methods use a common channel that is selected from a hopping pattern [9], in which the mechanism to decrease rendezvous-setting time is used in a hop-and-wait channel hopping scheme. In literature, the rendezvous-setting time represents the required time to setup an initial common channel between cluster head and member nodes.…”

Section: Introductionmentioning

confidence: 99%

Initial Rendezvous Protocol using Multicarrier Operation for Cognitive Radio Ad-hoc Networks

2018

KSII TIIS

View full text Add to dashboard Cite

In cognitive radio technology, the overall efficiency of communications systems can be improved without allocating additional bands by allowing a secondary system to utilize the licensed band when the primary system, which has the right to use the band, does not use it. In this paper, we propose a fast and reliable common channel initialization protocol without any exchange of initialization messages between the cluster head and the member nodes in cognitive ad-hoc networks. In the proposed method, the cluster and member nodes perform channel-based spectrum sensing. After sensing, the cluster head transmits a system activation signal through its available channels with a predetermined angle difference pattern. To detect the cluster head's transmission channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation for the angle difference sequence of the received signal patterns. This is compared to the predetermined reference angle difference pattern. The join-request and channel-decision procedures are presented in this paper. Performance evaluation of the proposed method is presented in the simulation results. This version includes a concrete analysis and supporting implementation results on initial rendezvous protocol using multicarrier operation.

show abstract

“…Kim and Yoo [10] proposed a multicasting tree-based initial common channel setup method for multi-hop ad-hoc networks. A method to reduce rendezvous time with a hop-and-wait channel hopping method was also presented by Chuang et al [11]. In [12], as a group-based rendezvous protocol a cyclic listening method was proposed.…”

Section: Introductionmentioning

confidence: 99%

Secondary System Initialization Protocol Using FFT-based Correlation Matching for Cognitive Radio Ad-hoc Networks

2016

KSII TIIS

View full text Add to dashboard Cite

Due to the increasing demand for spectrum resources, cognitive radio networks and dynamic spectrum access draw a lot of research into efficiently utilizing limited spectrum resources. To set up cluster-based CR ad-hoc common channels, conventional methods require a relatively long time to successfully exchange the initialization messages. In this paper, we propose a fast and reliable common channel initialization protocol for CR ad-hoc networks. In the proposed method, the cluster head sequentially broadcasts a system activation signal through its available channels with a predetermined correlation pattern. To detect the cluster head's broadcasting channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation of an FFT bin sequence for each available channel of the member node. This is compared to the predetermined reference pattern. The join request and channel decision procedures are also presented in this paper. In a simulation study, the performance of the proposed method is evaluated.A preliminary version of this paper appeared in ICUFN 2015, Sapporo, Japan, July 2015. This version includes a concrete analysis, protocol details and performance evaluations for various wireless cahnnel conditions. This work was supported by a grant-in-aid of HANHWA THALES.

show abstract

A Fast Blind Rendezvous Method by Alternate Hop-and-Wait Channel Hopping in Cognitive Radio Networks

Cited by 63 publications

References 26 publications

Asynchronous Channel-Hopping Scheme under Jamming Attacks

Asynchronous Channel-Hopping Scheme under Jamming Attacks

Initial Rendezvous Protocol using Multicarrier Operation for Cognitive Radio Ad-hoc Networks

Secondary System Initialization Protocol Using FFT-based Correlation Matching for Cognitive Radio Ad-hoc Networks

Contact Info

Product

Resources

About