In future 5G systems, the millimeter wave (mmWave) band will be used to support a large capacity for current mobile broadband. Therefore, the radio access technology (RAT) should be made available for 5G devices to help in distinct situations, for example device-to-device communications (D2D) and multi-hops. This paper presents ultra-wideband channel measurements for millimeter wave bands at 19, 28, and 38 GHz. We used an ultra-wideband channel sounder (1 GHz bandwidth) in an indoor to outdoor (I2O) environment for non-line-of-sight (NLOS) scenarios. In an NLOS environment, there is no direct path (line of sight), and all of the contributed paths are received from different physical objects by refection propagation phenomena. Hence, in this work, a directional horn antenna (high gain) was used at the transmitter, while an omnidirectional antenna was used at the receiver to collect the radio signals from all directions. The path loss and temporal dispersion were examined based on the acquired measurement data—the 5G propagation characteristics. Two different path loss models were used, namely close-in (CI) free space reference distance and alpha-beta-gamma (ABG) models. The time dispersion parameters were provided based on a mean excess delay, a root mean square (RMS) delay spread, and a maximum excess delay. The path loss exponent for this NLOS specific environment was found to be low for all of the proposed frequencies, and the RMS delay spread values were less than 30 ns for all of the measured frequencies, and the average RMS delay spread values were 19.2, 19.3, and 20.3 ns for 19, 28, and 38 GHz frequencies, respectively. Moreover, the mean excess delay values were found also at 26.1, 25.8, and 27.3 ns for 19, 28, and 38 GHz frequencies, respectively. The propagation signal through the NLOS channel at 19, 28, and 38 GHz was strong with a low delay; it is concluded that these bands are reliable for 5G systems in short-range applications.

Rendezvous is an initial and vital process for establishing data communications between devices in cognitive radio networks. Channel hopping (CH) provides an effective method for achieving rendezvous without relying on a dedicated common control channel. Most of the existing rendezvous schemes are designed for single-radio devices. Due to the dropping cost of wireless transceivers, the use of multiple radios to significantly reduce the rendezvous delay becomes economically feasible. In this paper, we propose a deterministic multi-radio rendezvous scheme that exploits the combinatorial features of grid quorum systems. We refer to our proposed scheme as multi-grid-quorum channel hopping (MGQ-CH). Our scheme uses multiple overlapped grid quorums to map the available channels at each device to its radios. We derive the theoretical upper-bound of the maximum time-to-rendezvous of MGQ-CH. Furthermore, we conduct simulations to study the performance of MGQ-CH under various system parameters and compare it with the state-of-the-art multi-radio rendezvous algorithms. The simulation results demonstrate the superior performance of MGQ-CH compared to previous schemes.

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.

Rendezvous is a prerequisite and important process for secondary users (SUs) to establish data communications in cognitive radio networks (CRNs). Recently, there has been a proliferation of different channel hopping- (CH-) based schemes that can provide rendezvous without relying on any predetermined common control channel. However, the existing CH schemes were designed with omnidirectional antennas which can degrade their rendezvous performance when applied in CRNs that are highly crowded with primary users (PUs). In such networks, the large number of PUs may lead to the inexistence of any common available channel between neighboring SUs which result in a failure of their rendezvous process. In this paper, we consider the utilization of directional antennas in CRNs for tackling the issue. Firstly, we propose two coprimality-based sector hopping (SH) schemes that can provide efficient pairwise sector rendezvous in directional antenna CRNs (DIR-CRNs). Then, we propose an efficient CH scheme that can be combined within the SH schemes for providing a simultaneous sector and channel rendezvous. The guaranteed rendezvous of our schemes are proven by deriving the theoretical upper bounds of their rendezvous delay metrics. Furthermore, extensive simulation comparisons with other related rendezvous schemes are conducted to illustrate the significant outperformance of our schemes.