We consider a two-hop wireless network where a transmitter communicates with a receiver via $M$ relays with an amplify-and-forward (AF) protocol. Recent works have shown that sophisticated linear processing such as beamforming and distributed space-time coding (DSTC) at relays enables to improve the AF performance. However, the relative utility of these strategies depend on the available channel state information at transmitter (CSIT), which in turn depends on system parameters such as the speed of the underlying fading channel and that of training and feedback procedures. Moreover, it is of practical interest to have a single transmit scheme that handles different CSIT scenarios. This motivates us to consider a unified approach based on DSTC that potentially provides diversity gain with statistical CSIT and exploits some additional side information if available. Under individual power constraints at the relays, we optimize the amplifier power allocation such that pairwise error probability conditioned on the available CSIT is minimized. Under perfect CSIT we propose an on-off gradient algorithm that efficiently finds a set of relays to switch on. Under partial and statistical CSIT, we propose a simple waterfilling algorithm that yields a non-trivial solution between maximum power allocation and a generalized STC that equalizes the averaged amplified noise for all relays. Moreover, we derive closed-form solutions for M=2 and in certain asymptotic regimes that enable an easy interpretation of the proposed algorithms. It is found that an appropriate amplifier power allocation is mandatory for DSTC to offer sufficient diversity and power gain in a general network topology.
In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) optimal power allocation to maximize the end-to-end signal-to-noise ratio (SNR) and 2) minimizing the total consumed power while maintaining the end-to-end SNR over a threshold value. We investigate these two problems for two relaying protocols of all-participate relaying and selective relaying and multiple cases of available channel state information (CSI) at the relays. We show that the SNR maximizati…
This paper investigates the impact of the channel state information (CSI) and antenna correlation at the multi-antenna relay on the performance of wireless powered dual-hop amplify-and-forward relaying systems. Depending on the available CSI at the relay, two different scenarios are considered, namely, instantaneous CSI and statistical CSI where the relay has access only to the antenna correlation matrix. Adopting the power-splitting architecture, we present a detailed performance study for both cases. Closed-form analytical expressions are derived for the outage probability and ergodic capaci…
Most previous researches on bidirectional relay selection (RS) typically assume perfect channel state information (CSI). However, outdated CSI, caused by the the time-variation of channel, cannot be ignored in the practical system, and it will deteriorate the performance. In this paper, the effect of outdated CSI on the performance of bidirectional amplify-and-forward RS is investigated. The optimal single RS scheme in minimizing the symbol error rate (SER) is revised by incorporating the outdated channels. The analytical expressions of end-to-end signal to noise ratio (SNR) and symbol error r…
Channel state information (CSI) at the transmitters (CSIT) is of importance for interference alignment schemes to achieve the optimal degrees of freedom (DoF) for wireless networks. This paper investigates the impact of half-duplex relays on the degrees of freedom (DoF) of the X channel and the interference channel when the transmitters are blind in the sense that no ISIT is available. In particular, it is shown that adding relay nodes with global CSI to the communication model is sufficient to recover the DoF that is the optimal for these models with global CSI at the transmitters. The relay …
This paper investigates power splitting for full-duplex relay networks with wireless information and energy transfer. By applying power splitting as a relay transceiver architecture, the full duplex information relaying can be powered by energy harvested from the source-emitted radio frequency signal. In order to minimize outage probability, power splitting ratios have been dynamically optimized according to full channel state information (CSI) and partial CSI, respectively. Under strong loop interference, the proposed full CSI-based and partial CSI-based power splitting schemes achieve the be…
The accuracy of channel state information (CSI) is critical for improving the capacity of wireless networks. In this paper, we introduce a training protocol for wireless relay networks that uses channel estimation and feedforwarding methods. The feedforwarding method is the distinctive feature of the proposed protocol. As we show, each relay feedforwards the imperfect CSI to the destination in a way that provides a higher network capacity and a faster transfer of the CSI than the existing protocols. In addition, we show the importance of the effective CSI accuracy on the wireless relay network…
The impact of imperfect channel state (CSI) information in an energy harvesting (EH) cooperative non-orthogonal multiple access (NOMA) network, consisting of a source, two users, and an EH relay is investigated in this paper. The relay is not equipped with a fixed power source and acts as a wireless powered node to help signal transmission to the users. Closed-form expressions for the outage probability of both users are derived under imperfect CSI for two different power allocation strategies namely fixed and dynamic power allocation. Monte Carlo simulations are used to numerically evaluate t…
In this paper, we address the problem of secure wireless information and power transfer in a large-scale multiple-input multiple-output (LS-MIMO) amplify-and-forward (AF) relaying system. The advantage of LS-MIMO relay is exploited to enhance wireless security, transmission rate and energy efficiency. In particular, the challenging issues incurred by short interception distance and long transfer distance are well addressed simultaneously. Under very practical assumptions, i.e., no eavesdropper's channel state information (CSI) and imperfect legitimate channel CSI, this paper investigates the i…
This paper investigates the outage probability and the throughput of relay networks with wireless information and energy transfer where the relays harvest energy from the transmitted radio-frequency signal of the source. Considering different power consumption models, we derive the outage probability for both adaptive and non-adaptive power allocations at the relay. With a total energy consumption constraint at the source, we provide closed-form expressions for the optimal time sharing and power allocation between the source energy and information transfer signals as well as the optimal relay …
This paper studies the impact of using outdated channel state information for relay selection on the performance of a network where two sources communicate with each other via fixed-gain amplifyand- forward relays. For a Rayleigh faded channel, closed-form expressions for the outage probability, moment generating function and symbol error rate are derived. Simulations results are also presented to corroborate the derived analytical results. It is shown that adding relays does not improve the performance if the channel is substantially outdated. Furthermore, relay location is also taken into co…
Wireless energy harvesting (WEH) provides an exciting way to supply energy for relay nodes to forward information for the source-destination pairs. In this paper, we investigate the problem on how the relay node dynamically adjusts the power splitting ratio of information transmission (IT) and energy harvesting (EH) in order to achieve the optimal outage performance. According to the knowledge of channel state information (CSI) at the relay, optimal dynamic power splitting policy with full CSI and partial CSI are both provided. Finally, through simulations, the proposed power splitting policie…
This paper investigates the Diversity Multiplexing Tradeoff (DMT) of the generalized quantize-and-forward (GQF) relaying scheme over the slow fading half-duplex multiple-access relay channel (HD-MARC). The compress-and-forward (CF) scheme has been shown to achieve the optimal DMT when the channel state information (CSI) of the relay-destination link is available at the relay. However, having the CSI of relay-destination link at relay is not always possible due to the practical considerations of the wireless system. In contrast, in this work, the DMT of the GQF scheme is derived without relay-d…
In this paper, we consider a dual-hop Multiple Input Multiple Output (MIMO) wireless relay network in the presence of imperfect channel state information (CSI), in which a source-destination pair both equipped with multiple antennas communicates through a large number of half-duplex amplify-and-forward (AF) relay terminals. We investigate the performance of three linear beamforming schemes when the CSI of relay-to-destination (R-D) link is not perfect at the relay nodes. The three efficient linear beamforming schemes are based on the matched-filter (MF), zero-forcing (ZF) precoding and regular…
In this paper, outage performance of network topology-aware distributed opportunistic relay selection strategies is studied with focus on the impact of different levels of channel state information (CSI) available at relays. Specifically, two scenarios with (a) exact instantaneous and (b) only statistical CSI are compared with explicit account for both small-scale Rayleigh fading and path loss due to random inter-node distances. Analytical results, matching closely to simulations, suggest that although similar diversity order can be achieved in both cases, the lack of precise CSI to support re…
In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available at the source. Both the physical-layer performance (blocklength-limited throughput) and the link-layer performance (effective capacity) of the relaying system are investigated. We propose a simple system operation by introducing a factor based on which we weight the average CSI and let the source determine the coding rate accordingly. In particular, we prove …
In this paper, we consider decode-and-forward (DF) relay beamforming with imperfect channel state information (CSI), cooperative artificial noise (AN) injection, and finite-alphabet input in the presence of an user and $J$ non-colluding eavesdroppers. The communication between the source and the user is aided by a multiple-input-multiple-output (MIMO) DF relay. We use the fact that a wiretap code consists of two parts: i) common message (non-secret), and ii) secret message. The source transmits two independent messages: i) common message (non-secret), and ii) secret message. The common message…
In this paper, we present the performance analysis of mixed RF/FSO system with multiple relays. To select the best relay, we adopt partial relay selection with outdated CSI wherein we investigate the effect of the temporal correlation of the channels. Unlike the vast majority of work, we introduce the impairments to the relays and the destination and we compare the performance against conventional RF relaying systems. We further derive the expressions of the outage probability and the ergodic capacity as well as the bounds to unpack engineering insights into the system robustness.
In this paper, we introduce a discrete memoryless State-Dependent Relay Channel with Private Messages (SD-RCPM) as a generalization of the state-dependent relay channel. We investigate two main cases: SD-RCPM with non-causal Channel State Information (CSI), and SD-RCPM with causal CSI. In each case, it is assumed that partial CSI is available at the source and relay. For non-causal case, we establish an achievable rate region using Gel'fand-Pinsker type coding scheme at the nodes informed of CSI, and Compress-and-Forward (CF) scheme at the relay. Using Shannon's strategy and CF scheme, an achi…
An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency. To investigate the impact of this technique on latency, we study the delivery time of a cache-aided broadcast-relay wireless network consisting of one central base station, $M$ cache-equipped transceivers and $K$ receivers under finite precision channel state information (CSI). We use the normalized delivery time (NDT) to capture the worst-case per-bit latency in a file delivery. Lower and upper boun…
A network consisting of $n$ source-destination pairs and $m$ relays is considered. Focusing on the large system limit (large $n$), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fading channels. It is shown that, under the practical constraints of single-user encoding-decoding scheme, and partial channel state information (CSI) at the transmitters (via integer-value feedback from the receivers), the maximal throughput scales as $\log n$ even if full relay cooperation is allowed. Furthermore, a novel decentralized opportunistic relaying scheme with receiver C…
Capacity gains from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static phase fading, when all nodes have equal average transmit power along with full channel state information (CSI), it is shown that transmitter cooperation outperforms receiver cooperation, whereas the opposite is true when power is optimally allocated among the cooperating nodes but only CSI at the receiver (CSIR) is available. When the nodes have equal power with CSIR only, cooperative schemes are shown to offer no capacity improvement over …
A framework for energy-efficient resource allocation in a single-user, amplify-and-forward relay-assisted MIMO system is devised in this paper. Previous results in this area have focused on rate maximization or sum power minimization problems, whereas fewer results are available when bits/Joule energy efficiency (EE) optimization is the goal. The performance metric to optimize is the ratio between the system's achievable rate and the total consumed power. The optimization is carried out with respect to the source and relay precoding matrices, subject to QoS and power constraints. Such a challe…
In this letter, we analyze the ergodic capacity of bidirectional amplify-and-forward relay selection (RS) with imperfect channel state information (CSI), i.e., outdated CSI and imperfect channel estimation. Practically, the optimal RS scheme in maximizing the ergodic capacity cannot be achieved, due to the imperfect CSI. Therefore, two suboptimal RS schemes are discussed and analyzed, in which the first RS scheme is based on the imperfect channel coefficients, and the second RS scheme is based on the predicted channel coefficients. The lower bound of the ergodic capacity with imperfect CSI is …
The degrees of freedom (DoF) of an X-network with M transmit and N receive nodes utilizing interference alignment with the support of $J$ relays each equipped with $L_j$ antennas operating in a half-duplex non-regenerative mode is investigated. Conditions on the feasibility of interference alignment are derived using a proper transmit strategy and a structured approach based on a Kronecker-product representation. The advantages of this approach are twofold: First, it extends existing results on the achievable DoF to generalized antenna configurations. Second, it unifies the analysis for time-v…
We develop an analytical framework to characterize the effect of impulsive noise on the performance of relay-assisted simultaneous wireless information and power transfer (SWIPT) systems. We derive novel closed-form expressions for the pairwise error probability (PEP) considering two variants based on the availability of channel state information (CSI), namely, blind relaying and CSI-assisted relaying. We further consider two energy harvesting (EH) techniques, i.e., instantaneous EH (IEH) and average EH (AEH). Capitalizing on the derived analytical results, we present a detailed numerical inve…
We consider a two-way half-duplex relaying system where multiple pairs of single antenna users exchange information assisted by a multi-antenna relay. Taking into account the practical constraint of imperfect channel estimation, we study the achievable sum spectral efficiency of the amplify-and-forward (AF) and decode-and-forward (DF) protocols, assuming that the relay employs simple maximum ratio processing. We derive an exact closed-form expression for the sum spectral efficiency of the AF protocol and a large-scale approximation for the sum spectral efficiency of the DF protocol when the nu…
We investigate a multi-pair two-way decode-andforward relaying aided massive multiple-input multiple-output antenna system under Rician fading channels, in which multiple pairs of users exchange information through a relay station having multiple antennas. Imperfect channel state information is considered in the context of maximum-ratio processing. Closedform expressions are derived for approximating the sum spectral efficiency (SE) of the system. Moreover, we obtain the powerscaling laws at the users and the relay station to satisfy a certain SE requirement in three typical scenarios. Finally…
This paper investigates quantization of channel state information (CSI) and bit allocation across wireless links in a multi-source, single-relay cooperative cellular network. Our goal is to minimize the loss in performance, measured as the achievable sum rate, due to limited-rate quantization of CSI. We develop both a channel quantization scheme and allocation of limited feedback bits to the various wireless links. We assume that the quantized CSI is reported to a central node responsible for optimal resource allocation. We first derive tight lower and upper bounds on the difference in rates b…
This work provides a comprehensive scaling law and performance analysis for multi-user massive MIMO relay networks, where the relay is equipped with massive antennas and uses MRC/MRT for low-complexity processing. CSI error is considered. First, a sum-rate lower bound is derived which manifests the effect of system parameters including the numbers of relay antennas and users, the CSI quality, and the transmit powers of the sources and the relay. Via a general scaling model on the system parameters with respect to the relay antenna number, the asymptotic scaling law of the SINR as a function of…
We show that the broadcast capacity of an infinite-depth tree-structured network of error-free half-duplex-constrained relays can be achieved using constrained coding at the source and symbol forwarding at the relays.
In this paper, we study beamforming in decode-and-forward (DF) relaying using multiple relays, where the source node sends a secret message as well as a non-secret message to the destination node in the presence of multiple non-colluding eavesdroppers. The non-secret message is transmitted at a fixed rate $R_{0}$ and requires no protection from the eavesdroppers, whereas the secret message needs to be protected from the eavesdroppers. The source and relays operate under a total power constraint. We find the optimum source powers and weights of the relays for both secret and non-secret messages…
We enhance the physical-layer security (PLS) of amplify-and-forward relaying networks with the aid of joint relay and jammer selection (JRJS), despite the deliterious effect of channel state information (CSI) feedback delays. Furthermore, we conceive a new outage-based characterization approach for the JRJS scheme. The traditional best relay selection (TBRS) is also considered as a benchmark. We first derive closed-form expressions of both the connection outage probability (COP) and of the secrecy outage probability (SOP) for both the TBRS and JRJS schemes. Then, a reliable-and-secure connecti…
In this paper, we study relay networks with orthogonal components in presence of noncausal channel state information (CSI) available at the source. We propose an upper bound on the capacity of the discrete memoryless model (DM)for the case in which just the source component intended for the destination is encoded against the CSI known non-causally at the source. Also, we derive capacity for two special classes of the Gaussian structure of the model. The first class is the one for which we have obtained the upper bound and the second class is the one in which all of the source components intend…
This paper considers a multi-way massive multiple-input multiple-output relaying system, where single-antenna users exchange their information-bearing signals with the help of one relay station equipped with unconventionally many antennas. The relay first estimates the channels to all users through the pilot signals transmitted from them. Then, the relay uses maximum-ratio processing (i.e. maximum-ratio combining in the multiple-access phase and maximum-ratio transmission in the broadcast phase) to process the signals. A rigorous closed-form expression for the spectral efficiency is derived. T…
This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operate without knowledge of the codebooks, i.e., it performs oblivious processing. Moreover, due to the bottleneck constraint, it is impossible for the relay to inform the destination node of the perfect channel state information (CSI) in each channel realization. To evaluate the bottleneck rate, we first provide an upper bound by assuming that the destination node can get the perfect CSI at no cost. Then, we provide …
In this paper, we consider the design of joint network coding (NC)and relay selection (RS) in two-way relay channels. In the proposed schemes, two users first sequentially broadcast their respective information to all the relays. We propose two RS schemes, a single relay selection with NC and a dual relay selection with NC. For both schemes, the selected relay(s) perform NC on the received signals sent from the two users and forward them to both users. The proposed schemes are analyzed and the exact bit error rate (BER) expressions are derived and verified through Monte Carlo simulations. It i…
In this paper, we adopt the relay selection (RS) protocol proposed by Bletsas, Khisti, Reed and Lippman (2006) with Enhanced Dynamic Decode-and-Forward (EDDF) and network coding (NC) system in a two-hop two-way multi-relay network. All nodes are single-input single-output (SISO) and half-duplex, i.e., they cannot transmit and receive data simultaneously. The outage probability is analyzed and we show comparisons of outage probability with various scenarios under Rayleigh fading channel. Our results show that the relay selection with EDDF and network coding (RS-EDDF&NC) scheme has the best perf…
We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the functional-decode-forward coding strategy, the relay decodes functions of the users' messages without needing to decode individual messages. The functions to be decoded by the relay are defined such that when the relay broadcasts the functions back to the users, every user is able to decode the messages of all other users.
This paper deals with distributed beamforming techniques for wireless networks with half-duplex amplify-and-forward relays. Existing schemes optimize the beamforming weights based on the assumption that channel state information (CSI) is available at the relays. We propose to use adaptive beamforming based on deterministic perturbations and limited feedback (1-bit) from the destination to the relays in order to avoid CSI at the relays. Two scalable perturbation schemes are considered and practical implementation aspects are addressed. Simulation results confirm that the proposed techniques clo…
In this paper, we consider the problem of sum throughput maximization for bidirectional relay networks with block fading. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct link between both users is not present. We assume that channel state information at the transmitter (CSIT) is not available and/or only one coding and modulation scheme is used at the transmitters due to complexity constraints. Thus, the nodes transmit with a fixed predefined rate regardless of the channel state information (CSI). In general, the nodes in the network can assume one of thre…
In this paper, we consider the problem of secure and reliable communication with uncertain channel state information (CSI) and present a new solution named active secure coding which combines the machine learning methods with the traditional physical layer secure coding scheme. First, we build a detectable wiretap channel model by combining the hidden Markov model with the compound wiretap channel model, in which the varying of channel block CSI is a Markov process and the detected information is a stochastic emission from the current CSI. Next, we present a CSI learning scheme to learn the CS…
The capacity of the semi-deterministic relay channel (SD-RC) with non-causal channel state information (CSI) only at the encoder and decoder is characterized. The capacity is achieved by a scheme based on cooperative-bin-forward. This scheme allows cooperation between the transmitter and the relay without the need to decode a part of the message by the relay. The transmission is divided into blocks and each deterministic output of the channel (observed by the relay) is mapped to a bin. The bin index is used by the encoder and the relay to choose the cooperation codeword in the next transmissio…
In this paper, we propose a new distributed coding structure with a soft input soft output (SISO) relay encoder for error-prone parallel relay channels. We refer to it as the distributed soft coding (DISC). In the proposed scheme, each relay first uses the received noisy signals to calculate the soft bit estimate (SBE) of the source symbols. A simple SISO encoder is developed to encode the SBEs of source symbols based on a constituent code generator matrix. The SISO encoder outputs at different relays are then forwarded to the destination and form a distributed codeword. The performance of the…
Network coding has the potential to improve the overall throughput of a network by combining different streams of data and forwarding them. In wireless networks, the wireless channel provide an excellent medium for physical layer network coding as signals from different transmitters are combined automatically by the wireless channel. In such scenarios, it would be interesting to investigate protocols and algorithms which can optimally relay information. In this paper, we look at a four-node two-way or bidirectional relay network, and propose a relay protocol which can relay information efficie…
In this paper, we re-examine the relay channel under the decode-forward (DF) strategy. Contrary to the established belief that block Markov coding is always the rate-optimal DF strategy, under certain channel conditions (a link regime), independent signaling between the source and relay achieves the same transmission rate without requiring coherent channel phase information. Further, this independent signaling regime allows the relay to conserve power. As such, we design a composite DF relaying strategy that achieves the same rate as block Markov DF but with less required relay power. The find…
In this paper, we consider the relaying of orthogonal space time block codes (OSTBCs) in a two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system with estimated channel state information (CSI). A simple four phase protocol is used for training and OSTBC data transmission. Decoding of OSTBC data at a user terminal is performed by replacing the exact CSI by the estimated CSI, in a maximum likelihood decoder. Tight approximations for the moment generating function (m.g.f.) of the received signal-to-noise ratio at a user is derived under Rayleigh fading by ignoring the…
Under the assumption of outdated channel state information (CSI) at the source, we consider the finite blocklength (FBL) throughput of a two-hop relaying system. Previous work has considered this setting so far only for the infinite blocklength case, where decoding can be arbitrarily reliable as long as operating below the Shannon limit. In contrast, in the FBL regime residual decoding errors can not be avoided even when transmitting below the Shannon limit. This makes the scheduling problem at the source more vulnerable to transmission errors, where we investigate the trade-off between the ch…
In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes performing network coding can decode the messages from sources perfectly. On a simple relay network, we design a scheme to obtain network coding gain even when the relay node cannot perfectly decode its received messages. In our scheme, the operation at the relay node resembles message passing in belief propagation, sending the logarithm likelihood ratio (LLR) of the network coded message to the destination. Simulation results …
In this paper, we consider general two-way relay networks (TWRNs) with two source and N relay nodes. A distributed differential space time coding with analog network coding (DDSTC-ANC) scheme is proposed. A simple blind estimation and a differential signal detector are developed to recover the desired signal at each source. The pairwise error probability (PEP) and block error rate (BLER) of the DDSTC-ANC scheme are analyzed. Exact and simplified PEP expressions are derived. To improve the system performance, the optimum power allocation (OPA) between the source and relay nodes is determined ba…
We consider a single-source, multiple-relay, single-destination lossy network employing Random Linear Network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination node. In contrast with some previous studies, we assume the classical RLNC scheme, in which the relaying nodes simply re-encode packets, without resorting to decoding. In addition, we consider an arbitrary field size and take into account correlation between the relay nodes. We propose a novel upper bound for an arbitrary number of relays, which becomes exac…
Reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs) is considered. In MARCs, only the destination is interested in a reconstruction of the sources, while in MABRCs, both the relay and the destination want to reconstruct the sources. We allow an arbitrary correlation among the sources at the transmitters, and let both the relay and the destination have side information that are correlated with the sources. Two joint source-channel coding schemes are presented and the corresponding sets of suffi…
Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for arbitrary slow fading full-duplex networks as well as for the single-relay half-duplex network. A key reason for this is that quantizing at the noise level suffices to achieve the cut-set bound approximately to within an additive gap, without any requirement of instantaneous channel state information (CSI). However, DMT only captures the high SNR performance and potentially, limited CSI at the relay can improve performance at moderate SNRs. In this work we propose an optimiz…
In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, amplify-and-forward (AF) relay beamforming designs under total and individual relay power constraints are studied with the goal of maximizing the secrecy rates when perfect channel state information (CSI) is available. In the AF scheme, not having analytical solutions for the optimal beamforming design under both total and individual power constraints, an iterative algorithm is proposed to numerically obtain the optimal beamforming structure and maximize t…
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed, which alleviates these limitations. The scheme entails a two-hop communication protocol, in which sources…
In this paper, we consider a two-way or bidirectional communications system with a relay equipped with multiple antennas. We show that when the downlink channel state information is not known at the relay, the benefit of having additional antennas at the relay can only be obtained by using decode and forward (DF) but not amplify and forward (AF). The gain becomes significant when we employ transmit diversity together with wireless network coding. We also demonstrate how the performance of such system can be improved by performing antenna selection at the relay. Our results show that if downlin…
In this paper, a multi-source multi-relay cooperative wireless network with binary modulation and binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets are forwarded regardless of their reliability; and ii) a maximum-likelihood optimum demodulator at the destination, which accounts for possible demodulations errors at the relays. An asymptotically-tight and closed-form expression of the end-to-end error probability is derived, which clearly showcases diversity order and coding gain of each source. Unlike o…
Noisy network coding, which elegantly combines the conventional compress-and-forward relaying strategy and ideas from network coding, has recently drawn much attention for its simplicity and optimality in achieving to within constant gap of the capacity of the multisource multicast Gaussian network. The constant-gap result, however, applies only to Gaussian relay networks with independent noises. This paper investigates the application of noisy network coding to networks with correlated noises. By focusing on a four-node Gaussian relay chain network with a particular noise correlation structur…
This paper considers a multi-source multi-relay network, in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and useful…
In this paper, we investigate the joint design of channel and network coding in bi-directional relaying systems and propose a combined low complexity physical network coding and LDPC decoding scheme. For the same LDPC codes employed at both source nodes, we show that the relay can decodes the network coded codewords from the superimposed signal received from the BPSK-modulated multiple-access channel. Simulation results shown that this novel joint physical network coding and LDPC decoding method outperforms the existing MMSE network coding and LDPC decoding method over AWGN and complex MAC cha…
