Adaptive relay techniques for OFDM-based cooperative communication systems

Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems. Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes

Cooperative diversity techniques for high-throughput wireless relay networks

Relay communications has attracted a growing interest in wireless communications with application to various enhanced technologies. This thesis considers a number of issues related to data throughput in various wireless relay network models. Particularly, new implementations of network coding (NC) and space-time coding (STC) techniques are investigated to offer various means of achieving high-throughput relay communications. Firstly, this thesis investigates different practical automatic repeat request (ARQ) retransmission protocols based on NC for two-way wireless relay networks to improve throughput efficiency. Two improved NC-based ARQ schemes are designed based on go-back-N and selective-repeat (SR) protocols. Addressing ARQ issues in multisource multidestination relay networks, a new NC-based ARQ protocol is proposed and two packet-combination algorithms are developed for retransmissions at relay and sources to significantly improve the throughput. In relation to the concept of channel quality indicator (CQI) reporting in two-way relay networks, two new efficient CQI reporting schemes are designed based on NC to improve the system throughput by allowing two terminals to simultaneously estimate the CQI of the distant terminal-relay link without incurring additional overhead. The transmission time for CQI feedback at the relays is reduced by half while the increase in complexity and the loss of performance are shown to be negligible. Furthermore, a low-complexity relay selection scheme is suggested to reduce the relay searching complexity. For the acknowledgment (ACK) process, this thesis proposes a new block ACK scheme based on NC to significantly reduce the ACK overheads and therefore produce an enhanced throughput. The proposed scheme is also shown to improve the reliability of block ACK transmission and reduce the number of data retransmissions for a higher system throughput. Additionally, this thesis presents a new cooperative retransmission scheme based on relay cooperation and NC to considerably reduce the number of retransmission packets and im- prove the reliability of retransmissions for a more power efficient and higher throughput system with non-overlapped retransmissions. Moreover, two relay selection schemes are recommended to determine the optimised number of relays for the retransmission. Finally, with respect to cognitive wireless relay networks (CWRNs), this thesis proposes a new cooperative spectrum sensing (CSS) scheme to improve the spectrum sensing performance and design a new CSS scheme based on NC for three-hop CWRNs to improve system throughput. Furthermore, a new distributed space-time-frequency block code (DSTFBC) is designed for a two- hop nonregenerative CWRN over frequency-selective fading channels. The proposed DSTFBC design achieves higher data rate, spatial diversity gain, and decoupling detection of data blocks at all destination nodes with a low-complexity receiver structure

Distributed Adaptation Techniques for Connected Vehicles

In this PhD dissertation, we propose distributed adaptation mechanisms for connected vehicles to deal with the connectivity challenges. To understand the system behavior of the solutions for connected vehicles, we first need to characterize the operational environment. Therefore, we devised a large scale fading model for various link types, including point-to-point vehicular communications and multi-hop connected vehicles. We explored two small scale fading models to define the characteristics of multi-hop connected vehicles. Taking our research into multi-hop connected vehicles one step further, we propose selective information relaying to avoid message congestion due to redundant messages received by the relay vehicle. Results show that the proposed mechanism reduces messaging load by up to 75% without sacrificing environmental awareness. Once we define the channel characteristics, we propose a distributed congestion control algorithm to solve the messaging overhead on the channels as the next research interest of this dissertation. We propose a combined transmit power and message rate adaptation for connected vehicles. The proposed algorithm increases the environmental awareness and achieves the application requirements by considering highly dynamic network characteristics. Both power and rate adaptation mechanisms are performed jointly to avoid one result affecting the other negatively. Results prove that the proposed algorithm can increase awareness by 20% while keeping the channel load and interference at almost the same level as well as improve the average message rate by 18%. As the last step of this dissertation, distributed cooperative dynamic spectrum access technique is proposed to solve the channel overhead and the limited resources issues. The adaptive energy detection threshold, which is used to decide whether the channel is busy, is optimized in this work by using a computationally efficient numerical approach. Each vehicle evaluates the available channels by voting on the information received from one-hop neighbors. An interdisciplinary approach referred to as entropy-based weighting is used for defining the neighbor credibility. Once the vehicle accesses the channel, we propose a decision mechanism for channel switching that is inspired by the optimal flower selection process employed by bumblebees foraging. Experimental results show that by using the proposed distributed cooperative spectrum sensing mechanism, spectrum detection error converges to zero