10,151 research outputs found

    Modified quasi-orthogonal space-time block coding in distributed wireless networks

    Get PDF
    Cooperative networks have developed as a useful technique that can achieve the same advantage as multi-input and multi-output (MIMO) wireless systems such as spatial diversity, whilst resolving the difficulties of co-located multiple antennas at individual nodes and avoiding the effect of path-loss and shadowing. Spatial diversity in cooperative networks is known as cooperative diversity, and can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. However, there remain technical challenges to maximize the benefit of cooperative communications, e.g. data rate, asynchronous transmission and outage. In this thesis, therefore, firstly, a modified distributed quasi-orthogonal space-time block coding (M-D-QO-STBC) scheme with increased code gain distance (CGD) for one-way and two-way amplify-and-forward wireless relay networks is proposed. This modified code is designed from set partitioning a larger codebook formed from two quasi-orthogonal space time block codes with different signal rotations then the subcodes are combined and pruned to arrive at the modified codebook with the desired rate in order to increase the CGD. Moreover, for higher rate codes the code distance is maximized by using a genetic algorithm to search for the optimum rotation matrix. This scheme has very good performance and significant coding gain over existing codes such as the open-loop and closed-loop QO-STBC schemes. In addition, the topic of outage probability analysis in the context of multi-relay selection from NN available relay nodes for one-way amplify-and-forward cooperative relay networks is considered together with the best relay selection, the NthN^{th} relay selection and best four relay selection in two-way amplify-and-forward cooperative relay networks. The relay selection is performed either on the basis of a max-min strategy or one based on maximizing exact end-to-end signal-to-noise ratio. Furthermore, in this thesis, robust schemes for cooperative relays based on the M-D-QO-STBC scheme for both one-way and two-way asynchronous cooperative relay networks are considered to overcome the issue of a synchronism in wireless cooperative relay networks. In particular, an orthogonal frequency division multiplexing (OFDM) data structure is employed with cyclic prefix (CP) insertion at the source in the one-way cooperative relay network and at the two terminal nodes in the two-way cooperative network to combat the effects of time asynchronism. As such, this technique can effectively cope with the effects of timing errors. Finally, outage probability performance of a proposed amplify-and-forward cooperative cognitive relay network is evaluated and the cognitive relays are assumed to exploit an overlay approach. A closed form expression for the outage probability for multi-relay selection cooperation over Rayleigh frequency flat fading channels is derived for perfect and imperfect spectrum acquisitions. Furthermore, the M-QO-STBC scheme is also proposed for use in wireless cognitive relay networks. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of new algorithms and methods

    Robust Iterative Transceiver Beamforming For Multipair Two-Way Distributed Relay Networks

    Get PDF
    OAPA In this paper, the transceiver beamforming problem is studied for multipair two-way distributed relay networks, particularly with multi-antenna user nodes and in the presence of channel state errors. With multi-antenna setting on the user nodes, some of the usual signal processing tasks are shifted from the relay nodes to the user nodes with the proposed transceiver beamforming designs. The transmit beamforming vectors, distributed relay coefficients and the receive beamforming vectors are obtained by iteratively solving three sub-problems, each having a closed-form solution. The tasks of maximizing desired signal power, and reducing inter-pair interference (IPI) and noise are thus allocated to different iteration steps. By this arrangement, the transmit and receive beamformers of each user are responsible for improving its own performance and the distributed relay nodes with simple amplify-and-forward protocol aim at creating a comfortable communication environment for all user pairs. With respect to the channel uncertainty, two relay strategies are proposed considering two different requirements from the communication network: sum relay output power and individual relay output power. Our simulation demonstrates that the performance improvement can be very significant through cooperation of the three components, especially when the number of relay nodes is large

    Novel transmission schemes for application in two-way cooperative relay wireless communication networks

    Get PDF
    Recently, cooperative relay networks have emerged as an attractive communications technique that can generate a new form of spatial diversity which is known as cooperative diversity, that can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. To achieve cooperative diversity single-antenna terminals in a wireless relay network typically share their antennas to form a virtual antenna array on the basis of their distributed locations. As such, the same diversity gains as in multi-input multi-output systems can be achieved without requiring multiple-antenna terminals. However, there remain technical challenges to maximize the benefit of cooperative communications, e.g. data rate, asynchronous transmission, interference and outage. Therefore, the focus of this thesis is to exploit cooperative relay networks within two-way transmission schemes. Such schemes have the potential to double the data rate as compared to one-way transmission schemes. Firstly, a new approach to two-way cooperative communications via extended distributed orthogonal space-time block coding (E-DOSTBC) based on phase rotation feedback is proposed with four relay nodes. This scheme can achieve full cooperative diversity and full transmission rate in addition to array gain. Then, distributed orthogonal space-time block coding (DOSTBC) is applied within an asynchronous two-way cooperative wireless relay network using two relay nodes. A parallel interference cancelation (PIC) detection scheme with low structural and computational complexity is applied at the terminal nodes in order to overcome the effect of imperfect synchronization among the cooperative relay nodes. Next, a DOSTBC scheme based on cooperative orthogonal frequency division multiplexing (OFDM) type transmission is proposed for flat fading channels which can overcome imperfect synchronization in the network. As such, this technique can effectively cope with the effects of fading and timing errors. Moreover, to increase the end-to-end data rate, a closed-loop EDOSTBC approach using through a three-time slot framework is proposed. A full interference cancelation scheme with OFDM and cyclic prefix type transmission is used in a two-hop cooperative four relay network with asynchronism in the both hops to achieve full data rate and completely cancel the timing error. The topic of outage probability analysis in the context of multi-relay selection for one-way cooperative amplify and forward networks is then considered. Local measurements of the instantaneous channel conditions are used to select the best single and best two relays from a number of available relays. Asymptotical conventional polices are provided to select the best single and two relays from a number of available relays. Finally, the outage probability of a two-way amplify and forward relay network with best and Mth relay selection is analyzed. The relay selection is performed either on the basis of a max-min strategy or one based on maximizing exact end-to-end signal-to-noise ratio. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of new algorithms and methods

    Wireless network coding for multi-hop relay channels

    Get PDF
    Future wireless communication systems are required to meet growing demands for high spectral e�ciency, low energy consumption and high mobility. The advent of wireless network coding (WNC) has o�ered a new opportunity to improve network throughput and transmission reliability by exploiting interference in intermediate relays. Combined with network coding and self-information cancelation, WNC for two-way relay channels (TWRCs) has come to the forefront. This dissertation focuses on exploiting WNC in multi-hop two-way relay channels (MH-TRCs). Particularly, a multi-hop wireless network coding (MH-WNC) scheme is designed for the generalized L-node K-message MH-TRC. Theoretical studies on the network throughput and performance bounds achieved by the MH-WNC scheme with di�erent relaying strategies (i.e., amplify-and-forward (AF) and compute-and-forward (CPF)) are carried out. Furthermore, by introducing di�erent numbers of transmission time intervals into the MH-WNC, a multiple-time-interval (Multi-TI) MH-WNC is proposed to determine an optimal MH-WNC which can achieve the best outage performance for all-scale MH-TRCs. Finally, this study extends the research on WNC one step forward from two-user networks to multi-user networks. An extended CPF joint with a dominated solution for maximizing the overall computation rate is proposed for the multi-way relay channel (mRC) in the last chapter. The contributions of this dissertation are multifold. First, the proposed MHWNC scheme with fixed two transmission time intervals can achieve a significantly improved network throughput compared to the non-network coding (Non-NC) scheme in the generalized L-node K-message MH-TRC. Theoretical results are derived for both multi-hop analog network coding (MH-ANC) and multi-hop compute-and-forward (MH-CPF). Moreover, both theoretical and numerical results demonstrate that the two MH-WNC schemes can be applied to different scale MH-TRCs to achieve a better outage performance compared to the conventional Non-NC scheme (i.e., MH-ANC for the non-regenerative MH-TRC with a small number of nodes, and MH-CPF for the regenerative MH-TRC with a large number of nodes.). Furthermore, a Multi-TI MH-WNC scheme is generalized with a special binary-tree model and characteristic matrix. The determined optimal MH-WNC scheme is able to provide the best outage performance and outperform the Non-NC scheme in all scale MH-TRCs. Last but not least, this dissertation provides a preliminary investigation of WNC in mRCs. The proposed dominated solution for maximizing the overall computation rate can ensure that all the nodes in the mRC successfully recover their required messages. Moreover, the extended CPF strategy is proven superior to Non-NC in the mRC with a small number of users

    Interference Alignment in Multi-Input Multi-Output Cognitive Radio-Based Network

    Get PDF
    This study investigates the interference alignment techniques for cognitive radio networks toward 5G to meet the demand and challenges for future wireless communications requirements. In this context, we examine the performance of the interference alignment in two parts. In the first part of this chapter, a multi-input multi-output (MIMO) cognitive radio network in the presence of multiple secondary users (SUs) is investigated. The proposed model assumes that linear interference alignment is used at the primary system to lessen the interference between primary and secondary networks. Herein, we derive the closed-form mathematical equations for the outage probability considering the interference leakage occurred in the primary system. The second part of this study analyzes the performance of interference alignment for underlay cognitive two-way relay networks with channel state information (CSI) quantization error. Here, a two-way amplify-and-forward relaying scheme is considered for independent and identically distributed Rayleigh fading channel. The closed-form average pairwise error probability expressions are derived, and the effect of CSI quantization error is analyzed based on the bit error rate performance. Finally, we evaluate the instantaneous capacity for both primary and secondary networks*

    Beamforming Design for IRS-and-UAV-aided Two-way Amplify-and-Forward Relay Networks

    Full text link
    As a promising solution to improve communication quality, unmanned aerial vehicle (UAV) has been widely integrated into wireless networks. In this paper, for the sake of enhancing the message exchange rate between User1 (U1) and User2 (U2), an intelligent reflective surface (IRS)-and-UAV- assisted two-way amplify-and-forward (AF) relay wireless system is proposed, where U1 and U2 can communicate each other via a UAV-mounted IRS and an AF relay. Besides, an optimization problem of maximizing minimum rate is casted, where the variables, namely AF relay beamforming matrix and IRS phase shifts of two time slots, need to be optimized. To achieve a maximum rate, a low-complexity alternately iterative (AI) scheme based on zero forcing and successive convex approximation (LC-ZF-SCA) algorithm is put forward, where the expression of AF relay beamforming matrix can be derived in semi-closed form by ZF method, and IRS phase shift vectors of two time slots can be respectively optimized by utilizing SCA algorithm. To obtain a significant rate enhancement, a high-performance AI method based on one step, semidefinite programming and penalty SCA (ONS-SDP-PSCA) is proposed, where the beamforming matrix at AF relay can be firstly solved by singular value decomposition and ONS method, IRS phase shift matrices of two time slots are optimized by SDP and PSCA algorithms. Simulation results present that the rate performance of the proposed LC-ZF-SCA and ONS-SDP-PSCA methods surpass those of random phase and only AF relay. In particular, when total transmit power is equal to 30dBm, the proposed two methods can harvest more than 68.5% rate gain compared to random phase and only AF relay. Meanwhile, the rate performance of ONS-SDP-PSCA method at cost of extremely high complexity is superior to that of LC-ZF-SCA method

    Timing and Carrier Synchronization with Channel Estimation in AF Two-Way Relaying Networks

    Get PDF
    Two-way relaying networks (TWRNs) allow for more bandwidth efficient use of the available spectrum since they allow for simultaneous information exchange between two users with the assistance of an intermediate relay node. However, due to superposition of signals at the relay node, the received signal at the user terminals is affected by multiple impairments, i.e., channel gains, timing offsets, and carrier frequency offsets, that need to be jointly estimated and compensated. This paper presents the system model for amplify-and-forward (AF) TWRNs in the presence of multiple impairments and proposes least squares and differential evolution based algorithms for joint estimation of these impairments. The Cramér-Rao lower bounds (CRLBs) for the joint estimation of multiple impairments are derived. A minimum mean-square error based receiver is then proposed to compensate the effect of multiple impairments and decode each user’s signal. Simulation results show that the performance of the proposed estimators is very close to the derived CRLBs at moderate-to-high signal-to-noise-ratios. It is also shown that the bit-error rate performance of the overall AF TWRN is close to a TWRN that is based on assumption of perfect knowledge of the synchronization parameters

    Covert Communication Achieved by A Greedy Relay in Wireless Networks

    Get PDF
    Covert wireless communication aims to hide the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this paper, we examine the possibility and achievable performance of covert communication in amplify-and-forward one-way relay networks. Specifically, the relay is greedy and opportunistically transmits its own information to the destination covertly on top of forwarding the source's message, while the source tries to detect this covert transmission to discover the illegitimate usage of the resource (e.g., power and spectrum) allocated only for the purpose of forwarding the source's information. We propose two strategies for the relay to transmit its covert information, namely rate-control and power-control transmission schemes, for which the source's detection limits are analyzed in terms of detection error probability and the achievable effective covert rates from the relay to destination are derived. Our examination determines the conditions under which the rate-control transmission scheme outperforms the power-control transmission scheme, and vice versa, which enables the relay to achieve the maximum effective covert rate. Our analysis indicates that the relay has to forward the source's message to shield its covert transmission and the effective covert rate increases with its forwarding ability (e.g., its maximum transmits power)

    マルチホップ無線ネットワークの特性解析に関する研究

    Get PDF
    九州工業大学博士学位論文 学位記番号:情工博甲第309号 学位授与年月日:平成28年3月25日1 Introduction||2 Impact of Transceiver Hardware Impairments on Cognitive Network||3 Case study: Two-Way Cognitive Relay in RF Energy HarvestingWireless Sensor Network||4 Soft Information Relaying Protocol||5 Overall Conclusion and FutureWorkWireless communication has been considered as the most efficient mean of data transmission. We have been witnessed the breakthrough of wireless communication era in many manifolds, such as speech, coverage area, and stability. However, frequency bands, the resource to convey information wirelessly, are limited and expensive to be granted usage licenses. Attaining the goals of ubiquitous wireless devices will require the future wireless networks stepping forward to overcome the scarcity and expensiveness of wireless frequency bands. Thus, the future wireless networks should evolve to utilize wireless frequencies more efficiently, such as cognitive relay network where non-license users are able to transmit data in the same frequency band that officially allocated to primary users. Subsequently, the transmit power of users in a cognitive network is limited and the performance is vulnerable to impairments of transceiver hardware. This dissertation aims to analyze the performance of the cognitive relay network under the impact of transceiver hardware impairments. A case study of two-way cognitive relay network is given for further investigate the impact of transceiver hardware impairments on end-to-end outage performance and throughput. Furthermore, we provide a new relaying scheme in order to lessen the impact of transceiver hardware impairment and further boost the system performance. For the purposes, this dissertation is organized into five (5) chapters. Chapter 1: Introduction. In this chapter, multihop wireless networks and the performance metrics are overviewed. In particular, the relay networks and cognitive relay networks are presented. Moreover, the general model of the practical transceiver hardware impairment is detailed for further analysis. Chapter 2: The impact of transceiver hardware impairments on cognitive relay networks. By using the general hardware impairment model for the received signal, the closed forms of outage probability of the relay network with decode-and-forward (DF) and amplify-and-forward (AF) under the impact of transceiver hardware imperfection are derived. Based on these results, we provide further discussion on transceiver hardware selection guideline. Chapter 3: Case study: two-way cognitive relaying in energy harvesting wireless sensor networks. A two-way relay wireless sensor network equipped with RF energy harvesting node is introduced. This network is aimed to be implemented in hazardous or remote areas where power supply for the relay node is difficult to maintain. In this chapter, we consider four configurations of the network with formed by combining two bidirectional relaying protocols and two wireless power transfer policies. The detailed performance analysis of outage probability and throughput of the case-study network with four configurations are presented. Based on the analysis, we provide performance comparison between the four and suggest the network configuration with the best performance. Chapter 4: Soft information relaying protocol. The soft information relaying protocol is proposed and analyzed. The analysis shows that this relaying protocol can gradually reduce the impact of transceiver hardware impairment on cognitive relay networks. Hence, soft relaying protocol is considered as a solution for cognitive relay network with cost-effective wireless transceiver devices. Chapter 5: Overall conclusion. An overall summary of the works presented in the above is provided in this chapter. Moreover, the future related work is also discussed. The results in this dissertation acknowledge the impact of transceiver hardware impairment by presenting the reduction of outage probability and throughput of the cognitive relay network. It puts forward the consideration of including the impact of transceiver hardware impairments on wireless network performance analysis, especially for the cognitive networks of which the transmit power is limited. Furthermore, a new relaying protocol, namely soft information relaying protocol, is proposed as a solution to lessen the impact of transceiver hardware impairment. The analysis shows that the impact of transceiver hardware impairment in cognitive relay network is reduced in compared to conventional relaying schemes. As a final point, we have provided a full picture of performance analysis for the cognitive relay network under the impact of transceiver hardware imperfection and the solution to reduce the performance loss by applying soft information relaying scheme. This research would contribute to boost the development of cognitive relay networks where frequency bands are used more efficiently
    corecore