Combined Sector and Channel Hopping Schemes for Efficient Rendezvous in Directional Antenna Cognitive Radio Networks

Al-Mqdashi, AbdulMajid; Sali, Aduwati; Noordin, Nor Kamariah; Hashim, Shaiful Jahari; Nordin, Rosdiadee

doi:10.1155/2017/5748067

Cited by 3 publications

(2 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chen et al 34 designed an oblivious neighbor discovery algorithm that achieves guaranteed oblivious discovery with minimum order worst‐case discovery delay in asynchronous and heterogeneous environments. Al‐Mqdashi et al 35 studied secondary users' partitioning and channel problems in directional antenna cognitive radio networks and proposed two effective sector hopping schemes based on coprimality. It was used to provide sector rendezvous in asymmetric and symmetrical environments.…”

Section: Related Workmentioning

confidence: 99%

Three‐dimensional scan‐based algorithm for directional neighbor discovery in ad hoc networks

Lan

Liu

Wang³

et al. 2023

Int J Communication

View full text Add to dashboard Cite

In recent years, neighbor discovery techniques using directional antennas have attracted widespread attention. Most currently available directional neighbor discovery techniques are designed based on two-dimensional (2D) space. Although these algorithms can accomplish the discovery between nodes, the algorithm portability is poor for three-dimensional (3D) platforms, and the application scenarios are limited since new communication scenarios such as unmanned aerial vehicle (UAV) groups and maritime fleets emerge where information needs to be delivered in real time and nodes are located in 3D space. This paper proposes a new deterministic directional neighbor discovery algorithm in 3D space named 3D scan-based algorithm (3D-SBA) to meet the needs of the line-of-sight (LOS) scenes. Four existing neighbor discovery algorithms, namely, SBA-based random mode selection (SBA-R), quorum, complete random algorithm (CRA), and SBA-based leader election algorithm (LE), have been extended to our proposed 3D algorithm model for simulation and comparative analysis with 3D-SBA. The simulation results show that the 3D-SBA algorithm consumes 51.15%, 180.20%, 9.48%, and 17.49% of the time slots compared with the four existing algorithms mentioned above. However, the quorum algorithm has a very high node collision rate, up to 92.11%.Ultimately, the 3D-SBA algorithm has the best performance considering the conflicts and the density of network nodes.

show abstract

Section: Related Workmentioning

confidence: 99%

Three‐dimensional scan‐based algorithm for directional neighbor discovery in ad hoc networks

Lan

Liu

Wang³

et al. 2023

Int J Communication

View full text Add to dashboard Cite

show abstract

“…It is worthy mentioning here that IQSF-CH is anonymous rendezvous scheme since it does not rely on the SU’s ID to interleave its sequences such as the works in [17,52]. This makes it more practical for distributed CRNs where SUs do not possess public IDs.…”

Section: Interleaved Quick Slow and Fixed Channel Hopping (Iqsf-mentioning

confidence: 99%

Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks

Al-Mqdashi

Sali

Noordin

et al. 2018

Sensors

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Dynamic Sectorized Routing in Mobile Ad Hoc Networks Using Reconfigurable Directional Antenna

Palanisamy

Satkunarajah

2021

Proceedings of International Conference on Advanced Computing Applications

View full text Add to dashboard Cite

Combined Sector and Channel Hopping Schemes for Efficient Rendezvous in Directional Antenna Cognitive Radio Networks

Cited by 3 publications

References 34 publications

Three‐dimensional scan‐based algorithm for directional neighbor discovery in ad hoc networks

Three‐dimensional scan‐based algorithm for directional neighbor discovery in ad hoc networks

Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks

Dynamic Sectorized Routing in Mobile Ad Hoc Networks Using Reconfigurable Directional Antenna

Contact Info

Product

Resources

About