scispace - formally typeset
Search or ask a question

Showing papers on "Relay published in 2008"


Journal ArticleDOI
TL;DR: This paper considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper, and assumes that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdroppers.
Abstract: The broadcast nature of the wireless medium makes the communication over this medium vulnerable to eavesdropping. This paper considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper. The assumption used is that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdropper. The transmitter ensures secrecy of communication by utilizing some of the available power to produce 'artificial noise', such that only the eavesdropper's channel is degraded. Two scenarios are considered, one where the transmitter has multiple transmit antennas, and the other where amplifying relays simulate the effect of multiple antennas. The channel state information (CSI) is assumed to be publicly known, and hence, the secrecy of communication is independent of the secrecy of CSI.

1,846 citations


Journal ArticleDOI
TL;DR: The utility of user cooperation in facilitating secure wireless communications is established and an outer-bound on the optimal rate-equivocation region is derived and the novel noise-forwarding strategy is used to illustrate the deaf helper phenomenon.
Abstract: This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is the novel noise-forwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper phenomenon, where the relay is able to facilitate secure communications while being totally ignorant of the transmitted messages. Furthermore, NF is shown to increase the secrecy capacity in the reversely degraded scenario, where the relay node fails to offer performance gains in the classical setting. The gain offered by the proposed cooperation strategies is then proved theoretically and validated numerically in the additive white Gaussian noise (AWGN) channel.

862 citations


Journal ArticleDOI
TL;DR: A new cooperative communication protocol is proposed, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the conventional cooperative schemes, and the tradeoff between the achievable bandwidth efficiency and the corresponding SER is presented.
Abstract: In this paper; we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the conventional cooperative schemes. The proposed scheme considers relay selection via the available partial channel state information (CSI) at the source and the relays. In particular, we discuss the multi-node decode-and-forward cooperative scenarios, where arbitrary N relays are available. The source determines when it needs to cooperate with one relay only, and which relay to cooperate with in case of cooperation, i.e., "When to cooperate?" and "Whom to cooperate with?". An optimal relay is the one which has the maximum instantaneous scaled harmonic mean functionof its source-relay and relay-destination channel gains. For the symmetric scenario, we derive an approximate expression of the bandwidth efficiency and obtain an upper bound on the symbol error rate (SER) performance. We show that full diversity is guaranteed and that a significant increase of the bandwidth efficiency is achieved. Moreover, we present the tradeoff between the achievable bandwidth efficiency and the corresponding SER. Finally, the obtained analytical results are verified through computer simulations.

553 citations


Posted Content
TL;DR: A communication system where two transmitters wish to exchange information through a central relay is considered, using lattice codes and lattice decoding, to obtain a rate of 1/2 log(1/2 + snr) bits per transmitter, which is essentially optimal at high SNR.
Abstract: We consider the problem of two transmitters wishing to exchange information through a relay in the middle. The channels between the transmitters and the relay are assumed to be synchronized, average power constrained additive white Gaussian noise channels with a real input with signal-to-noise ratio (SNR) of snr. An upper bound on the capacity is 1/2 log(1+ snr) bits per transmitter per use of the medium-access phase and broadcast phase of the bi-directional relay channel. We show that using lattice codes and lattice decoding, we can obtain a rate of 1/2 log(0.5 + snr) bits per transmitter, which is essentially optimal at high SNRs. The main idea is to decode the sum of the codewords modulo a lattice at the relay followed by a broadcast phase which performs Slepian-Wolf coding with structured codes. For asymptotically low SNR's, jointly decoding the two transmissions at the relay (MAC channel) is shown to be optimal. We also show that if the two transmitters use identical lattices with minimum angle decoding, we can achieve the same rate of 1/2 log(0.5 + snr). The proposed scheme can be thought of as a joint physical layer, network layer code which outperforms other recently proposed analog network coding schemes.

503 citations


Journal ArticleDOI
TL;DR: This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected.
Abstract: This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected. This problem is motivated by practically considering the tradeoff among performance, lifetime, and cost when designing sensor networks. In our study, this problem is modelled by a NP-hard network optimization problem named Steiner Minimum Tree with Minimum number of Steiner Points and bounded edge length (SMT-MSP). In this paper, we propose two approximate algorithms, and conduct detailed performance analysis. The first algorithm has a performance ratio of 3 and the second has a performance ratio of 2.5.

476 citations


Journal ArticleDOI
TL;DR: It is shown that using semidefinite relaxation, the problem of distributed beamforming is considered for a wireless network which consists of a transmitter, a receiver, and relay nodes and is efficiently solved using interior point methods.
Abstract: In this paper, the problem of distributed beamforming is considered for a wireless network which consists of a transmitter, a receiver, and relay nodes. For such a network, assuming that the second-order statistics of the channel coefficients are available, we study two different beamforming design approaches. As the first approach, we design the beamformer through minimization of the total transmit power subject to the receiver quality of service constraint. We show that this approach yields a closed-form solution. In the second approach, the beamforming weights are obtained through maximizing the receiver signal-to-noise ratio (SNR) subject to two different types of power constraints, namely the total transmit power constraint and individual relay power constraints. We show that the total power constraint leads to a closed-form solution while the individual relay power constraints result in a quadratic programming optimization problem. The later optimization problem does not have a closed-form solution. However, it is shown that using semidefinite relaxation, this problem can be turned into a convex feasibility semidefinite programming (SDP), and therefore, can be efficiently solved using interior point methods. Furthermore, we develop a simplified, thus suboptimal, technique which is computationally more efficient than the SDP approach. In fact, the simplified algorithm provides the beamforming weight vector in a closed form. Our numerical examples show that as the uncertainty in the channel state information is increased, satisfying the quality of service constraint becomes harder, i.e., it takes more power to satisfy these constraints. Also our simulation results show that when compared to the SDP-based method, our simplified technique suffers a 2-dB loss in SNR for low to moderate values of transmit power.

466 citations


Journal ArticleDOI
TL;DR: This paper provides a complete study on the training based channel estimation issues for relay networks that employ the amplify-and-forward (AF) transmission scheme and provides a new estimation scheme that directly estimates the overall channels from the source to the destination.
Abstract: In this paper, we provide a complete study on the training based channel estimation issues for relay networks that employ the amplify-and-forward (AF) transmission scheme. We first point out that separately estimating the channel from source to relay and relay to destination suffers from many drawbacks. Then we provide a new estimation scheme that directly estimates the overall channels from the source to the destination. The proposed channel estimation well serves the AF based space time coding (STC) that was recently developed. There exists many differences between the proposed channel estimation and that in the traditional single input single out (SISO) and multiple input single output (MISO) systems. For example, a relay must linearly precode its received training sequence by a sophisticatedly designed matrix in order to minimize the channel estimation error. Besides, each relay node is individually constrained by a different power requirement because of the non-cooperation among all relay nodes. We study both the linear least-square (LS) estimator and the minimum mean-square-error (MMSE) estimator. The corresponding optimal training sequences, as well as the optimal preceding matrices are derived from an efficient convex optimization process.

455 citations


Journal ArticleDOI
TL;DR: This correspondence derives performance bounds for this problem for each of three decode-and-forward protocols for coded bidirectional cooperation and finds that in some cases, the achievable rate region of the four phase protocol contains points that are outside the outer bounds of the other two protocols.
Abstract: In coded bidirectional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this correspondence, we derive performance bounds for this problem for each of three decode-and-forward protocols. The first protocol is a two phase protocol where both users simultaneously transmit during the first phase and the relay alone transmits during the second. In this protocol, our bounds are tight. The second protocol considers sequential transmissions from the two users followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. In the latter two protocols the bounds are not identical. Numerical evaluation shows that in some cases of interest our bounds do not differ significantly. Finally, in the Gaussian case with path loss, we derive achievable rates and compare the relative merits of each protocol. This case is of interest in cellular systems. Surprisingly, we find that in some cases, the achievable rate region of the four phase protocol contains points that are outside the outer bounds of the other two protocols.

449 citations


Journal ArticleDOI
TL;DR: The outage probability of a simple and completely distributed selection scheme, requiring some feedback but no centralization, is analyzed, and it outperforms distributed space-time codes for networks with more than three relaying nodes.
Abstract: In a cooperative network with multiple potential relays and multiple simultaneous transmissions, we present selection cooperation wherein each source pairs with a single "best" relay. We analyze the outage probability of a simple and completely distributed selection scheme, requiring some feedback but no centralization, and show that it outperforms distributed space-time codes for networks with more than three relaying nodes. These gains are due to the more efficient use of power in networks using selection. We suggest two other more complex selection schemes based on increasing system intelligence and centralization, and show that for smaller network sizes their performance improvement over the simple selection scheme is not significant.

444 citations


Posted Content
TL;DR: In this paper, a two-step amplify-and-forward protocol is used, in which the transmitter and relays not only use match filters to form a beam at the receiver but also adaptively adjust their transmit powers according to the channel strength information.
Abstract: This paper is on beamforming in wireless relay networks with perfect channel information at relays, the receiver, and the transmitter if there is a direct link between the transmitter and receiver. It is assumed that every node in the network has its own power constraint. A two-step amplify-and-forward protocol is used, in which the transmitter and relays not only use match filters to form a beam at the receiver but also adaptively adjust their transmit powers according to the channel strength information. For a network with any number of relays and no direct link, the optimal power control is solved analytically. The complexity of finding the exact solution is linear in the number of relays. Our results show that the transmitter should always use its maximal power and the optimal power used at a relay is not a binary function. It can take any value between zero and its maximum transmit power. Also, this value depends on the quality of all other channels in addition to the relay's own channels. Despite this coupling fact, distributive strategies are proposed in which, with the aid of a low-rate broadcast from the receiver, a relay needs only its own channel information to implement the optimal power control. Simulated performance shows that network beamforming achieves the maximal diversity and outperforms other existing schemes. Then, beamforming in networks with a direct link are considered. We show that when the direct link exists during the first step only, the optimal power control is the same as that of networks with no direct link. For networks with a direct link during the second step, recursive numerical algorithms are proposed to solve the power control problem. Simulation shows that by adjusting the transmitter and relays' powers adaptively, network performance is significantly improved.

436 citations


Journal ArticleDOI
TL;DR: This work considers a cooperative wireless network where a set of nodes cooperate to relay in parallel the information from a source to a destination using a decode-and-forward approach, and describes the structure of the optimal transmission scheme.
Abstract: We consider a cooperative wireless network where a set of nodes cooperate to relay in parallel the information from a source to a destination using a decode-and-forward approach. The source broadcasts the data to the relays, some or all of which cooperatively beamform to forward the data to the destination. We generalize the standard approaches for cooperative communications in two key respects: (i) we explicitly model and factor in the cost of acquiring channel state information (CSI), and (ii) we consider more general selection rules for the relays and compute the optimal one among them. In particular, we consider simple relay selection and outage criteria that exploit the inherent diversity of relay networks and satisfy a mandated outage constraint. These criteria include as special cases several relay selection criteria proposed in the literature. We obtain expressions for the total energy consumption for general relay selection and outage criteria for the non-homogeneous case, in which different relay links have different mean channel power gains, and the homogeneous case, in which the relay links statistics are identical. We characterize the structure of the optimal transmission scheme. Numerical results show that the cost of training and feedback of CSI is significant. The optimal strategy is to use a varying subset (and number) of relay nodes to cooperatively beamform at any given time. Depending on the relative location of the relays, the source, and the destination, numerical computations show energy savings of about 16% when an optimal relay selection rule is used. We also study the impact of shadowing correlation on the energy consumption for a cooperative relay network.

Journal ArticleDOI
TL;DR: The probability density function of the received signal-to-noise ratio for the considered relaying link is approximated in closed form, and an asymptotic exponential expression is proposed to simplify performance estimation.
Abstract: This letter offers a statistical analysis of the basic two-hop Amplify-and-Forward link, where the relay node is selected based on instantaneous and partial knowledge of the channel. In contrast with previously reported work, where relay selection requires global knowledge (2 hops) of the relaying link, the problem considered is interesting in practical ad-hoc systems, where only neighboring (1 hop) channel information is available to the nodes. The probability density function of the received signal-to-noise ratio for the considered relaying link is approximated in closed form, and an asymptotic exponential expression is proposed to simplify performance estimation.

Journal ArticleDOI
TL;DR: In this work the capacity region of the broadcast phase in terms of the maximal probability of error is determined and is characterized by the mutual informations of the separate channels coupled by the common input.
Abstract: In a three-node network bidirectional communication between two nodes can be enabled by a half-duplex relay node with a decode-and-forward protocol. In the first phase, the messages of two nodes are transmitted to the relay node. In the second phase a re-encoded composition is broadcasted by the relay node. In this work the capacity region of the broadcast phase in terms of the maximal probability of error is determined. It is characterized by the mutual informations of the separate channels coupled by the common input.

Journal ArticleDOI
TL;DR: A relay diversity based cooperative spectrum sensing approach to increase the diversity of detection when some CRs are in heavy shadowing and it is shown that, when combined with algebraic coding, relay diversity can further improve the cooperative Spectrum Sensing performance.
Abstract: In the letter the problem of cooperative spectrum sensing is investigated in cognitive radio (CR) networks over Rayleigh fading channels. By taking into account the error effect on the decision reporting, a general performance analysis of cooperative spectrum sensing is given. The analytical detection results show that the performance of cooperative spectrum sensing is limited by the probability of reporting errors. To deal with this limitation, we propose a transmit diversity based cooperative spectrum sensing method. By regarding multiple CRs as a virtual antenna array, space-time coding and space-frequency coding are applied into CR networks over flat-fading and frequency-selective fading channels, respectively. Moreover, we propose a relay diversity based cooperative spectrum sensing approach to increase the diversity of detection when some CRs are in heavy shadowing. It is then shown that, when combined with algebraic coding, relay diversity can further improve the cooperative spectrum sensing performance.

Journal ArticleDOI
TL;DR: These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation.
Abstract: In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.

Journal ArticleDOI
TL;DR: Close-form expressions for the outage and bit error probability of uncoded, threshold-based opportunistic relaying and selection cooperation at arbitrary signal to noise ratios and number of available relays, assuming decode-and-forward relays and Rayleigh fading channels are provided.
Abstract: We provide closed-form expressions for the outage and bit error probability (BEP) of uncoded, threshold-based opportunistic relaying (OR) and selection cooperation (SC), at arbitrary signal to noise ratios (SNRs) and number of available relays, assuming decode-and-forward relays and Rayleigh fading channels. Numerical results demonstrate that SC performs slightly better in terms of outage probability; in terms of BEP, both systems may outperform one another, depending on the SNR threshold that determines the set of relays that participate in the forwarding process.

Journal ArticleDOI
TL;DR: This paper proposes a novel selective single-relay cooperative scheme, combining selective-relays cooperative communication with physical-layer power control, and results confirm that the proposed scheme achieves significant energy savings and prolongs the network lifetime considerably.
Abstract: Cooperative communication with single relay selection is a simple but effective communication scheme for energy-constrained networks. In this paper, we propose a novel selective single-relay cooperative scheme, combining selective-relay cooperative communication with physical-layer power control. Based on the MAC-layer RTS-CTS signaling, a set of potential relays compute individually the required transmission power to participate in the cooperative communication, and compete within a window of fixed length. The "best" relay is selected in a distributed fashion with minimum signaling overhead. We derive power-control solutions corresponding to two policies on relay selection: one is to minimize the energy consumption per data packet, and the other is to maximize the network lifetime. Our numerical and simulation results confirm that the proposed scheme achieves significant energy savings and prolongs the network lifetime considerably.

Journal ArticleDOI
TL;DR: Under average power constraint at the relay station, it is shown that the optimal relay-precoder always loads power across channel eigenvectors and then decomposes the equivalent MIMO channel into a set of parallel SISO channels.
Abstract: In this letter, we address the problem of transceiver design in a non-regenerative MIMO relay system, where linear processing is applied at both the relay and destination to jointly minimize the mean-squared error (MSE) of symbol estimations. Under average power constraint at the relay station, we show that the optimal relay-precoder always loads power across channel eigenvectors and then decomposes the equivalent MIMO channel into a set of parallel SISO channels. Simulation results demonstrate that our method outperforms other relaying schemes in terms of both BER and MSE.

Journal ArticleDOI
TL;DR: This paper extends recent optimal minimum-mean-square-error (MMSE) and signal-to-noise ratio (SNR) designs of relay networks to the corresponding multiple-input-multiple-output (MIMO) scenarios, whereby the source, relays and destination comprise multiple antennas.
Abstract: Relay networks have received considerable attention recently, especially when limited size and power resources impose constraints on the number of antennas within a wireless sensor network. In this context, signal processing techniques play a fundamental role, and optimality within a given relay architecture can be achieved under several design criteria. In this paper, we extend recent optimal minimum-mean-square-error (MMSE) and signal-to-noise ratio (SNR) designs of relay networks to the corresponding multiple-input-multiple-output (MIMO) scenarios, whereby the source, relays and destination comprise multiple antennas. We investigate maximum SNR solutions subject to power constraints and zero-forcing (ZF) criteria, as well as approximate MMSE equalizers with specified target SNR and power constraint at the receiver. We also maximize the transmission rate between the source and destination subject to power constraint at the receiver.

Journal ArticleDOI
TL;DR: In this article, a new approach is proposed to solve the directional overcurrent relay coordination problem, which arises from installing distributed generation (DG) in looped power delivery systems (PDS).
Abstract: A new approach is proposed to solve the directional overcurrent relay coordination problem, which arises from installing distributed generation (DG) in looped power delivery systems (PDS). This approach involves the implementation of a fault current limiter (FCL) to locally limit the DG fault current, and thus restore the original relay coordination. The proposed restoration approach is carried out without altering the original relay settings or disconnecting DGs from PDSs during fault. Therefore, it is applicable to both the current practice of disconnecting DGs from PDSs, and the emergent trend of keeping DGs in PDSs during fault. The process of selecting FCL impedance type (inductive or resistive) and its minimum value is illustrated. Three scenarios are discussed: no DG, the implementation of DG with FCL and without FCL. Various simulations are carried out for both single- and multi-DG existence, and different DG and fault locations. The obtained results are reported and discussed.

Journal ArticleDOI
TL;DR: Performance results show that multihop relaying is one of the most promising technologies that enables cost-effective enhancement of coverage, user throughput, and system capacity, and is especially suitable for the emerging markets and rural areas.
Abstract: This article presents the outlook of the overall broadband market and operators' challenges in offering profitable mass market mobile data services. The concept of wireless relaying and its state of the art are then introduced, followed by a comprehensive description of a multihop relay system for WiMAX and related use cases. The article explains the impact of relays on network planning and presents an example of deployment cost analysis in different traffic scenarios and propagation conditions. Performance results show that multihop relaying is one of the most promising technologies that enables cost-effective enhancement of coverage, user throughput, and system capacity, and is especially suitable for the emerging markets and rural areas.

Journal ArticleDOI
TL;DR: It is shown that the source and the relay should map their signals to the dominant right singular vectors of the source-relay and relay-destination channels, and the appropriateness of Grassmannian codebooks for quantizing the optimal source beamforming vector based on its distribution is justified.
Abstract: We consider the problem of beamforming codebook design for limited feedback half-duplex multiple-input multiple output (MIMO) amplify-and-forward (AF) relay system. In the first part of the paper, the direct link between the source and the destination is ignored. Assuming perfect channel state information (CSI), we show that the source and the relay should map their signals to the dominant right singular vectors of the source-relay and relay-destination channels. For the limited feedback scenario, we prove the appropriateness of Grassmannian codebooks as the source and relay beamforming codebooks based on the distributions of the optimal source and relay beamforming vectors. In the second part of the paper, the direct link is considered in the problem model. Assuming perfect CSI, we derive the optimization problem that identifies the optimal source beamforming vector and show that the solution to this problem is uniformly distributed on the unit sphere for independent and identically distributed (i.i.d) Rayleigh channels. For the limited feedback scenario, we justify the appropriateness of Grassmannian codebooks for quantizing the optimal source beamforming vector based on its distribution. Finally, a modified quantization scheme is presented, which introduces a negligible penalty in the system performance but significantly reduces the required number of feedback bits.

Journal ArticleDOI
TL;DR: This paper devise relay selection methods to recover the multiplexing loss in decode-and-forward (DF) relay networks, while requiring very little feedback (merely bits/relay), which is a marked improvement over previous DF methods.
Abstract: This paper addresses the multiplexing loss that occurs in relay networks due to causality of relays and the half-duplex constraint. We devise relay selection methods to recover the multiplexing loss in decode-and-forward (DF) relay networks, while requiring very little feedback (merely bits/relay). Two network topologies are studied: First the case is considered where a direct link is available between the source and destination, in addition to the relayed links. For this configuration, an incremental transmission scheme is proposed, and comprehensively analyzed, which uses limited feedback to improve both diversity as well as multiplexing gain. Then, the case without a direct link is considered, for which efficient non-orthogonal DF protocols are produced and analyzed. An interesting feature of the latter methods is unequal error protection capability via a family of embedded diversity-multiplexing (DMT) curves, which can be very useful for practical applications. Even considering this method's minimal DMT, a marked improvement over previous DF methods is observed, especially in high spectral efficiencies.

Journal ArticleDOI
TL;DR: This paper investigates the performance of the best-relay selection scheme where the "best" relay only participates in the relaying and derives closed form expressions for tight lower bounds of the symbol error probability and outage probability.
Abstract: We consider an amplify-and-forward (AF) cooperative diversity system where a source node communicates with a destination node directly and indirectly (through multiple relays). In regular multiple-relay cooperative diversity systems, all relay nodes relay the source signal using orthogonal channels (time slots, carriers, or codes) to avoid cochannel interference. Hence, for a regular cooperative diversity network with M relays, we need M+1 channels (one for the direct link and M for the M indirect links). This means that the number of required channels increases linearly with the number of relays. In this paper, we investigate the performance of the best-relay selection scheme where the "best" relay only participates in the relaying. Therefore, two channels only are needed in this case (one for the direct link and the other one for the best indirect link) regardless of the number of relays (M). The best relay is selected as the relay node that can achieve the highest signal-to-noise ratio (SNR) at the destination node. We show that the best-relay selection not only reduces the amount of required resources but also maintains a full diversity order (which is achievable by the regular multiple-relay cooperative diversity system but with much more amount of resources). We derive closed form expressions for tight lower bounds of the symbol error probability and outage probability. Since it is hard to find a closed-form expression for the probability density function (PDF) of SNR of the relayed signal at the destination node, we use an approximate value instead. Then, we find a closed-form expression for the moment generating function (MGF) of the total SNR at the destination. This MGF is used to derive the closed-form expressions of the performance metrics such as the average symbol error probability, the outage probability, the average SNR, the amount of fading, and the SNR moments. Furthermore, we derive the asymptotic behavior of the symbol error probability. From this asymptotic behavior, the diversity order and its dependence on the number of relays (M) can be explicitly determined. Simulation results are also given to verify the analytical results.

Journal ArticleDOI
TL;DR: By studying the performance under different models, it is shown that knowledge of the instantaneous source-destination SNR at the relay can be exploited and the e2e BER can be reduced significantly compared to simple digital relaying.
Abstract: This paper studies selective relaying schemes based on signal-to-noise-ratio (SNR) to minimize the end-to-end (e2e) bit error rate (BER) in cooperative digital relaying systems using BPSK modulation. In the SNR-based selective relaying, the relay either retransmits or remains silent depending on the SNRs of the source-relay, relay-destination, and source-destination links. Different models assuming the availability of different sets of instantaneous and average SNR information at the relay are studied. For each model, the optimal strategy to minimize the e2e BER is a different threshold rule on the source-relay SNR, if the link SNRs are uncorrelated in time and space. Approximations for the optimal threshold values that minimize the e2e BER and the resulting performance are derived analytically for BPSK modulation. Using the derived threshold the e2e BER can be reduced significantly compared to simple digital relaying. By studying the performance under different models, it is shown that knowledge of the instantaneous source-destination SNR at the relay can be exploited. The gain from this knowledge is higher when the average source-destination SNR is large. However, knowledge of the instantaneous relay-destination SNR at the relay does not change performance significantly.

Proceedings ArticleDOI
12 Mar 2008
TL;DR: In some cases, the proposed lattice coding scheme can achieve within 1/2-bit the capacity and is asymptotically optimal at high signal-to-noise ratio (SNR) regimes.
Abstract: We provide achievable rate regions for two-way relay channels (TRC). At first, for a binary TRC, we show that the subspace-sharing of linear codes can achieve the capacity region. And, for a Gaussian TRC, we propose the subset-sharing of lattice codes. In some cases, the proposed lattice coding scheme can achieve within 1/2-bit the capacity and is asymptotically optimal at high signal-to-noise ratio (SNR) regimes.

Journal ArticleDOI
Xingkai Bao1, Jing Li1
TL;DR: Compared with the existing schemes, ANCC significantly outperforms repetition-based schemes and performs on par with space-time coded cooperation (STCC), but obviates the need for stringent inter-user synchronization at the bit/baud level.
Abstract: We consider user cooperation in a relay network that comprises a large collection of transmitters sending wireless data to a common receiver. A new framework exploiting the network coding technology, referred to as adaptive network coded cooperation (ANCC), is proposed to combat the lossy nature of wireless links and to adapt to the changing network topology. The central idea is to match network-on-graph, i.e. instantaneous network topologies described in graphs, with the well-known class of code-on-graph, i.e. low-density parity-check (LDPC) codes and LDPC-like codes. Both achievable rates and outage probabilities are evaluated for ANCC, and closed-form expressions are derived for the asymptotic case where the network size increases without bound. Compared with the existing schemes, ANCC significantly outperforms repetition-based schemes and performs on par with space-time coded cooperation (STCC), but obviates the need for stringent inter-user synchronization at the bit/baud level.

Journal ArticleDOI
TL;DR: A semi-distributed user relaying algorithm, which can provide comparable system capacity, but has significantly reduced computational complexity, is proposed for amplify-and-forward wireless relay networks.
Abstract: In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. The objective is to simplify the application of user relaying in practical wireless communication networks so that the system capacity can be improved with low computational complexity and system overhead. Beginning with the derivation of a tight threshold-based sufficient condition on the feasibility of a relay node, i.e., ensuring that user relaying via the node can achieve a larger channel capacity than direct transmission, a semi-distributed user relaying algorithm is proposed. In the proposed algorithm, each relay node can make decision on its feasibility individually, and the ultimate decision on the relay node selection among multiple feasible ones is made in a centralized manner. Since there is no need on exchanging channel state information among different network nodes, the proposed algorithm is simple for implementation and suitable for practical applications, which have stringent constraints on system overhead. By comparing with the centralized user relaying algorithm, which requires global channel state information of the whole network, the proposed semi-distributed algorithm can provide comparable system capacity, but has significantly reduced computational complexity.

Journal ArticleDOI
TL;DR: A differential transmission scheme, which requires channel information at neither relays nor the receiver, for wireless relay networks, and distributed differential space-time codes that work for networks with any number of relays using circulant matrices are proposed.
Abstract: Distributed space-time coding is a cooperative transmission scheme for wireless relay networks. With this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximum diversity. Although the scheme needs no channel information at relays, it does require full channel information, both the channels from the transmitter to relays and the channels from relays to the receiver, at the receiver. In this paper, we propose a differential transmission scheme, which requires channel information at neither relays nor the receiver, for wireless relay networks. As distributed space-time coding can be seen as the counterpart of space-time coding in the network setting, this scheme is the counterpart of differential space-time coding. Compared to coherent distributed space-time coding, the differential scheme is 3dB worse. In addition, we show that Alamouti, square real orthogonal, and Sp(2) codes can be used differentially in networks with corresponding numbers of relays. We also propose distributed differential space-time codes that work for networks with any number of relays using circulant matrices.

Proceedings ArticleDOI
26 May 2008
TL;DR: The main contribution of this paper is the development of a polynomial time algorithm to solve the relay node assignment problem in a network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network.
Abstract: Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising approach to achieve spatial diversity. Under this communication paradigm, the choice of relay node plays a significant role in the overall system performance. In this paper, we study the relay node assignment problem in a network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. The main contribution of this paper is the development of a polynomial time algorithm to solve this problem. A key idea in this algorithm is a "linear marking" mechanism, which is able to offer a linear complexity for each iteration. We give a formal proof of optimality for this algorithm. We also show several attractive properties associated with this algorithm.