Relay assisted device-to-device communication with channel uncertainty

The gains of direct communication between user equipment in a network may not be fully realised due to the separation between the user equipment and due to the fading that the channel between these user equipment experiences. In order to fully realise the gains that direct (device-to-device) communication promises, idle user equipment can be exploited to serve as relays to enforce device-to-device communication. The availability of potential relay user equipment creates a problem: a way to select the relay user equipment. Moreover, unlike infrastructure relays, user equipment are carried around by people and these users are self-interested. Thus the problem of relay selection goes beyond choosing which device to assist in relayed communication but catering for user self-interest. Another problem in wireless communication is the unavailability of perfect channel state information. This reality creates uncertainty in the channel and so in designing selection algorithms, channel uncertainty awareness needs to be a consideration. Therefore the work in this thesis considers the design of relay user equipment selection algorithms that are not only device centric but that are relay user equipment centric. Furthermore, the designed algorithms are channel uncertainty aware. Firstly, a stable matching based relay user equipment selection algorithm is put forward for underlay device-to-device communication. A channel uncertainty aware approach is proposed to cater to imperfect channel state information at the devices. The algorithm is combined with a rate based mode selection algorithm. Next, to cater to the queue state at the relay user equipment, a cross-layer selection algorithm is proposed for a twoway decode and forward relay set up. The algorithm proposed employs deterministic uncertainty constraint in the interference channel, solving the selection algorithm in a heuristic fashion. Then a cluster head selection algorithm is proposed for device-to-device group communication constrained by channel uncertainty in the interference channel. The formulated rate maximization problem is solved for deterministic and probabilistic constraint scenarios, and the problem extended to a multiple-input single-out scenario for which robust beamforming was designed. Finally, relay utility and social distance based selection algorithms are proposed for full duplex decode and forward device-to-device communication set up. A worst-case approach is proposed for a full channel uncertainty scenario. The results from computer simulations indicate that the proposed algorithms offer spectral efficiency, fairness and energy efficiency gains. The results also showed clearly the deterioration in the performance of networks when perfect channel state information is assumed

Cost-Effective Signal Processing Algorithms for Physical-Layer Security in Wireless Networks

Data privacy in traditional wireless communications is accomplished by cryptography techniques at the upper layers of the protocol stack. This thesis aims at contributing to the critical security issue residing in the physical-layer of wireless networks, namely, secrecy rate in various transmission environments. Physical-layer security opens the gate to the exploitation of channel characteristics to achieve data secure transmission. Precoding techniques, as a critical aspect in pre-processing signals prior to transmission has become an effective approach and recently drawn significant attention in the literature. In our research, novel non-linear precoders are designed focusing on the improvement of the physical-layer secrecy rate with consideration of computational complexity as well as the Bit Error Ratio (BER) performance. In the process of designing the precoder, strategies such as Lattice Reduction (LR) and Artificial Noise (AN) are employed to achieve certain design requirements. The deployment and allocation of resources such as relays to assist the transmission also have gained significant interest. In multiple-antenna relay networks, we examine various relay selection criteria with arbitrary knowledge of the channels to the users and the eavesdroppers. Furthermore, we provide novel effective relay selection criteria that can achieve a high secrecy rate performance. More importantly they do not require knowledge of the channels of the eavesdroppers and the interference. Combining the jamming technique with resource allocation of relay networks, we investigate an opportunistic relaying and jamming scheme for Multiple-Input Multiple-Output (MIMO) buffer-aided downlink relay networks. More specifically, a novel Relaying and Jamming Function Selection (RJFS) algorithm as well as a buffer-aided RJFS algorithm are developed along with their ability to achieve a higher secrecy rate. Relying on the proposed relay network, we detail the characteristics of the system, under various relay selection criteria, develop exhaustive search and greedy search-based algorithms, with or without inter-relay Interference Cancellation (IC)