Energy-Efficient and Overhead-Aware Cooperative Communications

Due to the rapid growth of energy-hungry wireless multimedia services, telecom energy consumption is increasing at an extraordinary rate. Besides negative environmental impacts and higher energy bills for operators, it also affects user experience as improvements in battery technologies have not kept up with increasing mobile energy demands. Therefore, how to increase the energy efficiency (EE) of wireless communications has gained a lot of attention recently. Cooperative communication, where relays cooperatively retransmit the received data from the source to the destination, is seen as a promising technique to increases EE. Nevertheless, it requires more overhead than direct communication that needs to be taken into account for practical wireless cooperative networks. In order to achieve potential energy savings promised by cooperative communications in practical systems, overhead-aware cooperative relaying schemes with low overhead are imperative. For the case that not all relays can hear each other, i.e., hidden relays exist, an energy-efficient and a low-overhead cooperative relaying scheme is proposed. This scheme selects a subset of relays before data transmission, through the proactive participation of available relays using their local timers. Theoretical analysis of average EE under maximum transmission power constraint, using practical data packet length, and taking account of the overhead for obtaining channel state information (CSI), relay selection, and cooperative beamforming, is performed and a closed-form approximate expression for the optimal position of relays is derived. Furthermore, the overhead of the proposed scheme and the impact of data packet lengths on EE, are analysed. The analytical and simulation results reveal that the proposed scheme is significantly more energy-efficient than direct transmission, best relay selection, all relay selection, and a state-of-the-art existing cooperative relaying scheme. Moreover, the proposed scheme reduces the overhead and achieves higher energy savings for larger data packets. The conventional cooperative beamforming schemes rely on the feedback of CSIs of the best relays from the destination, which cause extra energy consumption and are prone to quantization errors in practical systems. In the case of clustered relays with location awareness and timer-based relay selection, where relays can overhear the transmission and know the location of each other, an energy-efficient overhead-aware cooperative relaying scheme is proposed, making CSI feedback from the destination dispensable. In order to avoid possible collisions between relay transmissions during best relays selection, a distributed mechanism for the selected relays to appropriately insert guard intervals before their transmissions is proposed. Average EE of the proposed scheme considering the related overhead is analysed. Moreover, the impact of the number of available relays, the number of selected relays and the location of relay cluster on EE is studied. The simulation results indicate that the proposed cooperative relaying scheme achieves higher EE than direct communication, best relay selection, and all relay selection for relay clusters located close to the source. Independent of the relay cluster location, the proposed scheme exhibits significantly higher EE than an existing cooperative relaying scheme. Device-to-device (D2D) communication in cellular networks that enable direct transmissions between user equipments (UEs) is seen as a promising way to improve both EE and spectral efficiency (SE). If the source UE (SUE) and the destination UE (DUE) are far away from each other or if the channel between them is too weak for direct transmission, then two-hop D2D communications, where relay UEs (RUEs) forward the SUE's data packets to the DUE, can be used. An energy- and spectral-efficient optimal adaptive forwarding strategy (OAFS) for two-hop D2D communications is proposed. In a distributed manner, the OAFS adaptively chooses between the best relay forwarding (BRF) and the cooperative relay beamforming (CRB) with the optimal number of selected RUEs, depending on which of them provides the higher instantaneous EE. In order to reduce the computational complexity of relay selection, a low-complexity sub-optimal adaptive forwarding strategy (SAFS) is proposed that selects between the BRF and the CRB with two RUEs by comparing their instantaneous EE. Theoretical analysis of the average EE and SE for the proposed adaptive forwarding strategies is performed considering maximum transmission power constraints, circuit power consumption and the overhead for the acquisition of CSI, forwarding mode selection and cooperative beamforming. The theoretical and simulation results show that the proposed OAFS and SAFS exhibit significantly higher EE and SE than the BRF, CRB, direct D2D communications and conventional cellular communications. For short to moderate SUE-to-DUE distances, SAFS is almost as energy- and spectral-efficient as OAFS

Performance of Relaying Protocols

In wireless systems, cooperative diversity and relaying can exploit the benefit of spatial diversity and combat heavy pathloss without requiring multiple antennas at the receivers and transmitters. For practical networks, the use of relays is motivated by the need for simple, inexpensive terminals with limited power and a single antenna. The motivation for this thesis is to study and propose practical relaying protocols that can reduce the power consumption and ameliorate the performance with minimum additional complexity. Based on a dual-hop communication model, we exploit two upper bounds for the end-to-end SNR. These bounds further inspire us to propose new relaying protocols for wireless communication systems. We examine the case of a single user and relay under Rayleigh and Nakagami-m fading conditions. Based on the general upper bound, a new protocol is introduced: Clipped gain. This protocol makes it possible to save the transmit power by stopping the transmission when the quality of the first hop leads to an outage. We consider also user selection and user scheduling for dual-hop communication with multiple users and relays over a Rayleigh fading channel. We introduce new scheduling protocols based on one-bit feedback information. To the best of our knowledge, most of the available literature uses full channel state information to perform user selection and user scheduling. Interestingly, our protocols based on one bit feedback greatly improve the system performance while adding less additional complexity. To carry out rigorous comparison, close-form expressions are derived and analytical results used to assess the outage probability performance