Channel Hopping Sequences for Rendezvous Establishment in Cognitive Radio Sensor Networks

Tessema, Widist Bekulu; Kim, Byeongung; Kim, Junhyung; Cho, Wooseong; Han, Kijun

doi:10.1155/2014/872780

Cited by 4 publications

(2 citation statements)

References 12 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tessema et al [33] presented two channel-hopping algorithms: a synchronous channel-hopping sequence (S-CHS) and an asynchronous channel-hopping sequence (A-CHS). These algorithms have three parts: (a) construction of a Cayley table, (b) reflection of the Cayley table, and (c) construction of S-CHS by cyclic shift and catenation.…”

Section: Synchronous Channel-hopping Sequencementioning

confidence: 99%

Rendezvous Issues in AD Hoc Cognitive Radio Networks

2014

KSII TIIS

View full text Add to dashboard Cite

Rendezvous is a process of two or more cognitive radio nodes gathering on the same channel at the same time for a negotiation to establish data communications. This paper discusses rendezvous issues in cognitive radio networks. It details why rendezvous is an issue in cognitive radio networks and how rendezvous works. It classifies channel access methods, and details sequence-based channel-hopping methods. It surveys existing works on blind rendezvous and compares the proposed algorithms in terms of the maximum time to rendezvous. This paper discusses the properties that an efficient channel-hopping rendezvous algorithm should have and illustrates common issues in the existing rendezvous methods. It also explains open research issues in the rendezvous area.

show abstract

Section: Synchronous Channel-hopping Sequencementioning

confidence: 99%

Rendezvous Issues in AD Hoc Cognitive Radio Networks

2014

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…The Channel Hopping (CH) mechanisms otherwise are of interest since they do not require CCC to achieve rendezvous [23,24,25]. The CH method is inspired by the Adaptive Frequency Hopping (AFH) of Bluetooth technology [26], where the Bluetooth nodes in piconet hop channels following a CH sequence generated by the master device.…”

Section: Introductionmentioning

confidence: 99%

Ranked Sense Multiple Access Control Protocol for Multichannel Cognitive Radio-Based IoT Networks

Shafiq

Singh

Ashraf

et al. 2019

Sensors

View full text Add to dashboard Cite

The widespread growth of the Internet-of-Things (IoT) and its dependence on the license-exempt Industrial, Scientific, and Medical (ISM) bands have made spectrum resources scarce. IoT can nonetheless get advantage from the Cognitive Radio (CR) technology to resolve the spectrum shortage issue. Since in CR networks the unlicensed Secondary Users (SUs) can exploit the white spaces in licensed channels of Primary Users (PUs) opportunistically. CR ad hoc networks are more useful in IoT due to ease of installation, low cost, and less complexity. However, CR ad hoc networks are prone to the rendezvous issue and hidden primary terminal problem. Moreover, the available channels in the CR system are not identical, PUs’ and SUs’ activities can diversify them as well. In this connection, channel selection by SUs is a complex balancing act since the transmission opportunities are space, frequency and time bounded. In this paper, we hence proposed a new Ranked Sense Multiple Access with Collision Avoidance (RSMA/CA) protocol for multichannel CR-based IoT networks. Our proposed RSMA/CA protocol not only resolves the hidden primary terminal problem but also avoids hidden and exposed terminal problems at the same time by mutual spectrum sensing. We suggest a new channel ranking mechanism to rank the available channels based on the long term qualities of the channels, PUs’ return rate, and SUs’ activities and tailor-made the algorithms in an existing scheme to make the rendezvous process more efficient. We analyze the performance of our proposed RSMA/CA in terms of normalized throughput through the Markov chain model and compared with that of the existing scheme. Simulation results show that our RSMA/CA protocol outperforms the existing scheme due to efficient rendezvous and access mechanisms.

show abstract

Clock skew and offset estimations for channel rendezvous in cognitive radio networks

Han

Wang

2014

2014 IEEE Fourth International Conference on Consumer Electronics Berlin (ICCE-Berlin)

View full text Add to dashboard Cite

In a Dynamic Spectrum Access (DSA) environment, how can cognitive radios (CRs) initially rendezvous their opportunistic channels to setup a network without causing interference to primary users (SUs) or other secondary users (SUs) is still an open problem in literature. In this paper, this problem is solved by a proposed network-wide clock synchronization scheme, which is implemented along with the initial channel rendezvous procedures. Not much resource consumption is assumed. The clock parameters of skew and offset are estimated on all nodes of a CR network except for the reference one. The timing message transmission delays in CR network are modeled by the exponential models. Two Maximum-Likelihood Estimation (MLE) algorithms and a quasi-MLE algorithm are proposed in three statuses of channel rendezvous respectively. The results of numeric simulations show that the proposed methods improve the mean square errors (MSE) of clock parameters estimations progressively, and the four-way based timing message exchanging based estimator outperforms classical one-way and two-way timing messages exchanging based estimators.

show abstract

Channel Hopping Sequences for Rendezvous Establishment in Cognitive Radio Sensor Networks

Cited by 4 publications

References 12 publications

Rendezvous Issues in AD Hoc Cognitive Radio Networks

Rendezvous Issues in AD Hoc Cognitive Radio Networks

Ranked Sense Multiple Access Control Protocol for Multichannel Cognitive Radio-Based IoT Networks

Clock skew and offset estimations for channel rendezvous in cognitive radio networks

Contact Info

Product

Resources

About