119 research outputs found
Throughput Analysis and Optimization of Wireless-Powered Multiple Antenna Full-Duplex Relay Systems
We consider a full-duplex (FD) decode-and-forward system in which the
time-switching protocol is employed by the multi-antenna relay to receive
energy from the source and transmit information to the destination. The
instantaneous throughput is maximized by optimizing receive and transmit
beamformers at the relay and the time-split parameter. We study both optimum
and suboptimum schemes. The reformulated problem in the optimum scheme achieves
closed-form solutions in terms of transmit beamformer for some scenarios. In
other scenarios, the optimization problem is formulated as a semi-definite
relaxation problem and a rank-one optimum solution is always guaranteed. In the
suboptimum schemes, the beamformers are obtained using maximum ratio combining,
zero-forcing, and maximum ratio transmission. When beamformers have closed-form
solutions, the achievable instantaneous and delay-constrained throughput are
analytically characterized. Our results reveal that, beamforming increases both
the energy harvesting and loop interference suppression capabilities at the FD
relay. Moreover, simulation results demonstrate that the choice of the linear
processing scheme as well as the time-split plays a critical role in
determining the FD gains.Comment: Accepted for publication in IEEE Transactions on Communication
Distributed Quasi-Orthogonal Space-Time coding in wireless cooperative relay networks
Cooperative diversity provides a new paradigm in robust wireless re- lay networks that leverages Space-Time (ST) processing techniques to combat the effects of fading. Distributing the encoding over multiple relays that potentially observe uncorrelated channels to a destination terminal has demonstrated promising results in extending range, data- rates and transmit power utilization. Specifically, Space Time Block Codes (STBCs) based on orthogonal designs have proven extremely popular at exploiting spatial diversity through simple distributed pro- cessing without channel knowledge at the relaying terminals. This thesis aims at extending further the extensive design and analysis in relay networks based on orthogonal designs in the context of Quasi- Orthogonal Space Time Block Codes (QOSTBCs).
The characterization of Quasi-Orthogonal MIMO channels for cooper- ative networks is performed under Ergodic and Non-Ergodic channel conditions. Specific to cooperative diversity, the sub-channels are as- sumed to observe different shadowing conditions as opposed to the traditional co-located communication system. Under Ergodic chan- nel assumptions novel closed-form solutions for cooperative channel capacity under the constraint of distributed-QOSTBC processing are presented. This analysis is extended to yield closed-form approx- imate expressions and their utility is verified through simulations. The effective use of partial feedback to orthogonalize the QOSTBC is examined and significant gains under specific channel conditions are demonstrated.
Distributed systems cooperating over the network introduce chal- lenges in synchronization. Without extensive network management
it is difficult to synchronize all the nodes participating in the relaying between source and destination terminals. Based on QOSTBC tech- niques simple encoding strategies are introduced that provide compa- rable throughput to schemes under synchronous conditions with neg- ligible overhead in processing throughout the protocol. Both mutli- carrier and single-carrier schemes are developed to enable the flexi- bility to limit Peak-to-Average-Power-Ratio (PAPR) and reduce the Radio Frequency (RF) requirements of the relaying terminals.
The insights gained in asynchronous design in flat-fading cooperative channels are then extended to broadband networks over frequency- selective channels where the novel application of QOSTBCs are used in distributed-Space-Time-Frequency (STF) coding. Specifically, cod- ing schemes are presented that extract both spatial and mutli-path diversity offered by the cooperative Multiple-Input Multiple-Output (MIMO) channel. To provide maximum flexibility the proposed schemes are adapted to facilitate both Decode-and-Forward (DF) and Amplify- and-Forward (AF) relaying. In-depth Pairwise-Error-Probability (PEP) analysis provides distinct design specifications which tailor the distributed- STF code to maximize the diversity and coding gain offered under the
DF and AF protocols.
Numerical simulation are used extensively to confirm the validity of the proposed cooperative schemes. The analytical and numerical re- sults demonstrate the effective use of QOSTBC over orthogonal tech- niques in a wide range of channel conditions
Selective Combining for Hybrid Cooperative Networks
In this study, we consider the selective combining in hybrid cooperative
networks (SCHCNs scheme) with one source node, one destination node and
relay nodes. In the SCHCN scheme, each relay first adaptively chooses between
amplify-and-forward protocol and decode-and-forward protocol on a per frame
basis by examining the error-detecting code result, and () relays will be selected to forward their received signals to the
destination. We first develop a signal-to-noise ratio (SNR) threshold-based
frame error rate (FER) approximation model. Then, the theoretical FER
expressions for the SCHCN scheme are derived by utilizing the proposed SNR
threshold-based FER approximation model. The analytical FER expressions are
validated through simulation results.Comment: 27 pages, 8 figures, IET Communications, 201
Channel Tracking for AF MIMO Relaying Systems
In this paper, we consider the problem of channel
estimation in multiple-input multiple-output (MIMO) amplifyand-
forward (AF) relaying systems operating over time varying
channels. Only data at the receiving end are assumed available
for the estimation. By employing a first-order autoregressive
(AR) model for characterizing the time-varying nature of the
channels to be estimated, we derive an expectation-maximization
(EM) Kalman filter (KF) that utilizes the received signal at the
destination to track the individual channel links. The extended
KF algorithm is also derived and compared to the proposed
EM-based KF. Our simulation results show that the proposed
EM-based KF offers better estimation performance with less
complexity when compared to the EKF algorithm
Exploiting Diversity in Broadband Wireless Relay Networks
Fading is one of the most fundamental impairments to wireless communications. The standard approach to combating fading is by adding redundancy - or diversity - to help increase coverage and transmission speed. Motivated by the results in multiple-input multiple-output technologies, which are usually used at base stations or access points, cooperation commutation has been proposed to improve the performance of wireless networks which consist of low-cost single antenna devices. While the majority of the research in cooperative communication focuses on flat fading for its simplicity and easy analysis, in practice the underlying channels in broadband wireless communication systems such as cellular systems (UMTS/LTE) are more likely to exhibit frequency selective fading. In this dissertation, we consider a frequency selective fading channel model and explore distributed diversity techniques in broadband wireless relay networks, with consideration to practical issues such as channel estimation and complexity-performance tradeoffs. We first study a system model with one source, one destination and multiple decode-and-forward (DF) relays which share a single channel orthogonal to the source. We derive the diversity-multiplexing tradeoff (DMT) for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. The best relay selection method selects the relay in the decoding set with the largest sum-squared relay-to-destination channel coefficients. This scheme can achieve the optimal DMT of the system at the expense of higher complexity, compared to the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we find special cases when the three relaying strategies have the same DMT. We further present a transceiver design and prove it can achieve the optimal DMT asymptotically. Monte Carlo simulations are presented to corroborate the theoretical analysis. We provide a detailed performance comparison of the three relaying strategies in channels encountered in practice. The work has been extended to systems with multiple amplify-and-forward relays. We propose two relay selection schemes with maximum likelihood sequential estimator and linear zero- forcing equalization at the destination respectively and both schemes can asymptotically achieve the optimal DMT. We next extend the results in the two-hop network, as previously studied, to multi-hop networks. In particular, we consider the routing problem in clustered multi-hop DF relay networks since clustered multi-hop wireless networks have attracted significant attention for their robustness to fading, hierarchical structure, and ability to exploit the broadcast nature of the wireless channel. We propose an opportunistic routing (or relay selection) algorithm for such networks. In contrast to the majority of existing approaches to routing in clustered networks, our algorithm only requires channel state information in the final hop, which is shown to be essential for reaping the diversity offered by the channel. In addition to exploiting the available diversity, our simple cross-layer algorithm has the flexibility to satisfy an additional routing objective such as maximization of network lifetime. We demonstrate through analysis and simulation that our proposed routing algorithm attains full diversity under certain conditions on the cluster sizes, and its diversity is equal to the diversity of more complicated approaches that require full channel state information. The final part of this dissertation considers channel estimation in relay networks. Channel state information is vital for exploiting diversity in cooperative networks. The existing literature on cooperative channel estimation assumes that block lengths are long and that channel estimation takes place within a fading block. However, if the forwarding delay needs to be reduced, short block lengths are preferred, and adaptive estimation through multiple blocks is required. In particular, we consider estimating the relay-to-destination channel in DF relay systems for which the presence of forwarded information is probabilistic since it is unknown whether the relay participates in the forwarding phase. A detector is used so that the update of the least mean square channel estimate is made only when the detector decides the presence of training data. We use the generalized likelihood ratio test and focus on the detector threshold for deciding whether the training sequence is present. We also propose a heuristic objective function which leads to a proper threshold to improve the convergence speed and reduce the estimation error. Extensive numerical results show the superior performance of using this threshold as opposed to fixed thresholds
Joint Relay Selection and Power Allocation in Large-Scale MIMO Systems with Untrusted Relays and Passive Eavesdroppers
In this paper, a joint relay selection and power allocation (JRP) scheme is
proposed to enhance the physical layer security of a cooperative network, where
a multiple antennas source communicates with a single-antenna destination in
presence of untrusted relays and passive eavesdroppers (Eves). The objective is
to protect the data confidentially while concurrently relying on the untrusted
relays as potential Eves to improve both the security and reliability of the
network. To realize this objective, we consider cooperative jamming performed
by the destination while JRP scheme is implemented. With the aim of maximizing
the instantaneous secrecy rate, we derive a new closed-form solution for the
optimal power allocation and propose a simple relay selection criterion under
two scenarios of non-colluding Eves (NCE) and colluding Eves (CE). For the
proposed scheme, a new closed-form expression is derived for the ergodic
secrecy rate (ESR) and the secrecy outage probability as security metrics, and
a new closed-form expression is presented for the average symbol error rate
(SER) as a reliability measure over Rayleigh fading channels. We further
explicitly characterize the high signal-to-noise ratio slope and power offset
of the ESR to highlight the impacts of system parameters on the ESR. In
addition, we examine the diversity order of the proposed scheme to reveal the
achievable secrecy performance advantage. Finally, the secrecy and reliability
diversity-multiplexing tradeoff of the optimized network are provided.
Numerical results highlight that the ESR performance of the proposed JRP scheme
for NCE and CE cases is increased with respect to the number of untrustworthy
relays.Comment: 18 pages, 10 figures, IEEE Transactions on Information Forensics and
Security (In press
- …