Dynamic spectrum access (DSA) exploits vacant frequency resources via distributed wireless access. The two nodes of DSA, master and slave, access different channels, and thus, cannot communicate with each other. To compensate for the access channel mismatch between the two nodes, a rendezvous channel, which exchanges control signals between two nodes, has been considered. The rendezvous channel based on channel-occupancy ratio (COR) adaptively constructs the channel in accordance with the channel occupancy of other systems, and both a high-speed rendezvous channel and high usage efficiency of the frequency resource are accomplished owing to exploitation of the vacant channel. In the rendezvous channel based on COR, the master and slave recognize the channel with minimum measured COR as the superior channel. As the master sends the control signals through the superior channel recognized by the master, the slave accesses to the superior channel recognized by the slave with higher access rate than to the other channels. As a result, the slave can receive the control signals with highly probability and thus high speed rendezvous channel is achieved. If the master and the slave recognize the different channel as the superior channel, the access rate to the other channel should be larger. This is because the slave obtains the opportunity of receiving the control signals through the different channel from the superior channel recognized by slave and thus the high probability that the slave can receive the control signals is maintained. Therefore, the access rate of slave should be constructed in accordance with the recognition of superior channel by master and slave. In this paper, the access rate of slave to the superior channel is optimally constructed using the analyzed probability of completion of rendezvous channel. The analysis of the probability of completion of rendezvous channel includes the recognition of superior channel by master and slave. Even if the master and the slave recognize the different channel, the constructed access rate of slave can maintain the high speed rendezvous channel. From the theoretical analysis and computer simulation, the rendezvous channel based on COR with the optimal access rate to the channel with the lowest COR achieves reduced time for the rendezvous channel.

A multi-channel cognitive radio is a powerful solution for recovering the exhaustion of frequency spectrum resources. In a cognitive radio, although master and slave terminals (which construct a communication link) have the freedom to access arbitrary channels, access channel mismatch is caused. A rendezvous scheme based on frequency hopping can compensate for this mismatch by exchanging control signals through a selected channel in accordance with a certain rule. However, conventional frequency hopping schemes do not consider an access protocol of both control signals in the rendezvous scheme and the signal caused by channel access from other systems. Further, they do not consider an information sharing method to reach a consensus between the master and slave terminals. This paper proposes a modified rendezvous scheme based on learning-based channel occupancy rate (COR) estimation and describes a specific channel-access rule in the slave terminal. On the basis of this rule, the master estimates a channel selected by the slave by considering the average COR of the other systems. Since the master can narrow down the number of channels, a fast rendezvous scheme with a few control signals is established.

We evaluated the transmission performance, including received power and transmission throughput characteristics, in 4×4 single-user multiple-input multiple-output (SU-MIMO) transmission for synchronous time division duplex (TDD) and downlink data channels in comparison with single-input single-output (SISO) transmission in an environment where a local 5G wireless base station was installed on the roof of a research building at our university. Accordingly, for the received power characteristics, the difference between the simulation value, which was based on the ray tracing method, and the experimental value at 32 points in the area was within a maximum difference of approximately 10 dB, and sufficient compliance was obtained. Regarding the transmission throughput versus received power characteristics, after showing a simulation method for evaluating throughput characteristics in MIMO, we compared the results with experimental results. The cumulative distribution function (CDF) of the transmission throughput shows that, at a CDF of 50%, in SISO transmission, the simulated value is approximately 115Mbps, and the experimental value is 105Mbps, within a difference of approximately 10Mbps. By contrast, in MIMO transmission, the simulation value is 380Mbps, and the experimental value is approximately 420Mbps, which is a difference of approximately 40Mbps. It was shown that the received power and transmission throughput characteristics can be predicted with sufficient accuracy by obtaining the delay profile and the system model at each reception point using the both ray tracing and MIMO simulation methods in actual environments.

In unlicensed spectrum, wireless communications employing carrier sense multiple access with collision avoidance (CSMA/CA) suffer from longer transmission delay time as the number of user terminals (UTs) increases, because packet collisions are more likely to occur. To cope with this problem, this paper proposes a new multiuser detection (MUD) scheme that uses both request-to-send (RTS) and enhanced clear-to-send (eCTS) for high-reliable and low-latency wireless communications. As in conventional MUD scheme, the metric-combining MUD (MC-MUD) calculates log likelihood functions called metrics and accumulates the metrics for the maximum likelihood detection (MLD). To avoid increasing the number of states for MLD, MC-MUD forces the relevant UTs to retransmit their packets until all the collided packets are correctly detected, which requires a kind of central control and reduces the system throughput. To overcome these drawbacks, the proposed scheme, which is referred to as cancelling MC-MUD (CMC-MUD), deletes replicas of some of the collided packets from the received signals, once the packets are correctly detected during the retransmission. This cancellation enables new UTs to transmit their packets and then performs MLD without increasing the number of states, which improves the system throughput without increasing the complexity. In addition, the proposed scheme adopts RTS and eCTS. One UT that suffers from packet collision transmits RTS before the retransmission. Then, the corresponding access point (AP) transmits eCTS including addresses of the other UTs, which have experienced the same packet collision. To reproduce the same packet collision, these other UTs transmit their packets once they receive the eCTS. Computer simulations under one AP conditions evaluate an average carrier-to-interference ratio (CIR) range in which the proposed scheme is effective, and clarify that the transmission delay time of the proposed scheme is shorter than that of the conventional schemes. In two APs environments that can cause the hidden terminal problem, it is demonstrated that the proposed scheme achieves shorter transmission delay times than the conventional scheme with RTS and conventional CTS.