Search

The tremendous proliferation of smart phones and other smart devices has spurred the explosive growth of delay-sensitive high-rate multimedia services, which significantly increases energy consumption in wireless cellular networks. Therefore, it is an important yet challenging issue to carry out resource allocation for cellular networks to meet the quality of service requirement in terms of high data rate and, at the same time, achieve high energy efficiency. In this paper, two resource allocation approaches are proposed, where user selection and power allocation are jointly considered, to maximize effective capacity (EC) and effective energy efficiency (EEE), respectively, for a relay-assisted downlink of cellular networks. Channel estimation errors are taken into account to make the proposed approaches more practical. Moreover, to solve the EC maximization problem efficiently, we develop an optimal algorithm based on Lagrange method and Karush–Kuhn–Tucker conditions, and derive closed-form optimal solutions for user selection and power allocation at both the base station and relays. For the EEE maximization problem, an iterative algorithm based on the Dinkelbach method is developed to find the optimal solutions. Theoretical analysis and simulation results are presented to demonstrate the performance of the proposed approaches in terms of EC, EEE, and delay bound violation probability. [ABSTRACT FROM PUBLISHER]

Terminal relaying is expected to offer an effective means for realizing machine-type communications (MTC) in wireless cellular networks. In the absence of channel quality indicators, the effective utilization of relaying terminals (RTs) requires a mechanism by which RTs can autonomously assign available resource blocks (RBs) to potentially large numbers of uncoordinated MTC devices with minimal conflicts. Unlike random RB assignments, which do not offer performance guarantees, using prescribed RB assignment sequences provides an opportunity for obtaining performance gains. However, realizing these gains requires optimizing RB assignments over a large set of lengthy sequences. One technique for selecting assignment sequences is based on an exhaustive search of exponential complexity over sequences generated by multiplicative cyclic groups. This technique restricts the number of RBs to be prime minus one and does not consider sequences generated using other group operations. In this paper, we use group isomorphism to eliminate the constraint on the number of RBs and to show that the optimal assignment sequences generated by a specific cyclic group are globally optimal over the set of all cyclically generated sequences. We develop a greedy algorithm with polynomial complexity for the sequential selection of RB assignment sequences in systems with large numbers of RTs and arbitrary device distributions. This algorithm is further simplified by invoking the graphical representation of cyclic groups. The resulting algorithm is more efficient and thus suitable for generating assignment sequences for relay-assisted massive multiple access Internet-of-Things systems. Numerical results show that the performance of the sequences generated by the greedy algorithms is comparable to that of those generated by exhaustive search, but with much less computational cost. [ABSTRACT FROM PUBLISHER]

In this paper, we design and evaluate the proposed geographic-based spray-and-relay (GSaR) routing scheme in delay/disruption-tolerant networks. To the best of our knowledge, GSaR is the first spray-based geographic routing scheme using historical geographic information for making a routing decision. Here, the term spray means that only a limited number of message copies are allowed for replication in the network. By estimating a movement range of destination via the historical geographic information, GSaR expedites the message being sprayed toward this range, meanwhile prevents that away from and postpones that out of this range. As such, the combination of them intends to fast and efficiently spray the limited number of message copies toward this range and effectively spray them within range, to reduce the delivery delay and increase the delivery ratio. Furthermore, GSaR exploits delegation forwarding to enhance the reliability of the routing decision and handle the local maximum problem, which is considered to be the challenges for applying the geographic routing scheme in sparse networks. We evaluate GSaR under three city scenarios abstracted from real world, with other routing schemes for comparison. Results show that GSaR is reliable for delivering messages before the expiration deadline and efficient for achieving low routing overhead ratio. Further observation indicates that GSaR is also efficient in terms of a low and fair energy consumption over the nodes in the network. [ABSTRACT FROM PUBLISHER]

This paper addresses the area of heterogeneous wireless relaying vehicular clouds. We devise an advanced vehicular relaying technique for enhanced connectivity in densely populated urban areas. We investigate the performance of a transmission scheme over a Long-Term Evolution-Advanced (LTE-A) network where vehicles act as relaying cooperating terminals for a downlink session between a base station and an end-user. The abundance of moving vehicles, operating in an ad hoc fashion, can eliminate the need for establishing a dedicated relaying infrastructure. However, the associated wireless links in vehicular clouds are characterized by a doubly selective fading channel; this causes performance degradation in terms of increased error probability. Hence, we propose a precoded cooperative transmission technique to extract the underlying rich multipath–Doppler-spatial diversity, which is a relay selection scheme to take advantage of the potentially large number of available relaying vehicles. We further contribute by the derivation of a closed-form error rate expression, diversity gain, and outage expressions and introduce our derived performance unconditional expressions as a benchmark to assess our analysis and future research studies of such an approach. Our analytical and simulation results indicate that significant diversity gains and reduced error rates are achievable. In addition, there is a noticeable reduction in the required transmitting power compared with traditional transmission schemes, as well as an increase in distance coverage. [ABSTRACT FROM PUBLISHER]

Many studies have presented the order sense results of information transmission capacity and packet delivery delay in mobile ad hoc networks (MANETs). To achieve the fundamental understanding of MANETs, we focus on deriving the closed-form expressions of the network capacity and end-to-end delay. A MANET with the generalized correlated mobility model is considered in this paper, where the mobility of nodes clustered in one group is confined within a specified area, and multiple groups move uniformly across the network. We also leverage limited packet redundancy to speed up the packet transmission, i.e., each source node is allowed to distribute at most f copies of each packet in its delivery process. Specifically, we first propose an effective multi-hop scheduling-routing scheme under the correlated mobility model, and then develop the closed-form expressions of both per node throughput capacity and expected end-to-end delay. We further explore the tradeoff between throughput capacity and packet delay by using packet redundancy f. The simulation studies validate our theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we consider a bidirectional cellular relay network with distributed relays where a single base station exchanges information with multiple independent users through multiple single-antenna relays. We design the transceivers at the base station, the relays, and the users. The related optimization problems are generally non-convex and difficult to solve. In this paper, we propose a unified framework to design the transceiver algorithms based on two criteria, i.e. weighted sum MSE minimization and sum rate maximization. Specifically, we show that the sum rate maximization problem can be converted into an iterative weighted sum MSE minimization problem. Low-complexity iterative algorithms are developed for both weighted sum MSE minimization and sum rate maximization optimization problems. However, the convergence points of the proposed iterative algorithms are sensitive to the initial conditions, especially in the high signal-to-noise ratio (SNR) regime. For this reason, we further derive the high-SNR asymptotically optimal solutions and use them as the initials for the proposed iterative algorithms. Simulation results show that the proposed scheme can approximately double the system throughput, compared to the conventional four-stage transmission schemes. [ABSTRACT FROM AUTHOR]

This paper presents an analytical investigation on the outage performance of dual-hop multiple antenna amplify-and-forward relaying systems in the presence of interference. For both the fixed-gain and variable-gain relaying schemes, exact analytical expressions for the outage probability of the systems are derived. Moreover, simple outage probability approximations at the high signal-to-noise-ratio regime are provided, and the diversity order achieved by the systems are characterized. Our results suggest that variable-gain relaying systems always outperform the corresponding fixed-gain relaying systems. In addition, the fixed-gain relaying schemes only achieve diversity order of one, while the achievable diversity order of the variable-gain relaying scheme depends on the location of the multiple antennas. [ABSTRACT FROM PUBLISHER]

The performance of opportunistic relaying in a dual-hop amplify-and-forward relay network where the relaying nodes are distributed according to a homogeneous two-dimensional Poisson point process with fixed density is analyzed. Largely ignored in the literature, this assumption leads to more realistic results, as in a typical practical scenario neither the number of relays nor their distances from the source and destination are known. An exact expression for the outage probability of this cooperative system for general fading environments and different types of relaying is derived. The expression is then simplified under an assumption that the radius of the relay deployment region is sufficiently large, and specialized to additive white Gaussian noise (no fading), Rayleigh fading and severe (half-Gaussian) fading environments. Simple and tight upper and lower bounds on the outage probability are also derived. Simulation results validate the theoretical analyses and verify the accuracies of the proposed bounds. [ABSTRACT FROM PUBLISHER]

The in-kernel One-to-Many Streaming Splicing (OMSS) relay method can help improve the relay data paths of critical nodes to reduce computing power for UDP and TCP streams and enhance the subscriber capacity. [ABSTRACT FROM AUTHOR]

In cooperative orthogonal frequency division multiplexing (OFDM) systems, accurate frequency synchronization is critical to achieving any potential gains brought by the cooperative operation. The carrier frequency offsets (CFOs) present among multiple nodes (source, relays and destination) are more difficult to tackle than the single CFO problem in point-to-point systems. Multiple CFOs cause phase drift, inter-carrier interference (ICI) and inter-block interference (IBI) in the received signal. This paper deals with the CFO induced interference mitigation problem in distributed space time block coded (STBC) amplify-and-forward (AF) cooperative OFDM systems. We propose a two step approach to recover the phase distortion and suppress the ICI and IBI using low complexity methods to achieve high performance. The first step is time domain (TD) compensation and the second step is frequency domain (FD) decoding. Two TD compensation schemes are proposed, i.e., IBI-removal and ICI-removal. The IBI-removal scheme decouples the two blocks of one STBC codeword completely and then decodes the ICI degraded blocks individually. The ICI-removal scheme removes ICI first and the subsequent decoding requires joint decoding of the two blocks. Simulation results show that the IBI-removal scheme which is of lower complexity performs well with small CFO. For large CFO, the ICI-removal with modified iterative joint maximum likelihood decoding (MIJMLD) outperforms other schemes. [ABSTRACT FROM AUTHOR]

In a communication system in which K nodes communicate with a central sink node, the following problem of selection often occurs. Each node maintains a preference number called a metric, which is not known to other nodes. The sink node must find the `best' node with the largest metric. The local nature of the metrics requires the selection process to be distributed. Further, the selection needs to be fast in order to increase the fraction of time available for data transmission using the selected node and to handle time-varying environments. While several selection schemes have been proposed in the literature, each has its own shortcomings. We propose a novel, distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not guarantee successful selection, and the splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme introduces several new ideas into the design of the timer and splitting schemes. It explicitly accounts for feedback overheads and guarantees selection of the best node. We analyze and optimize the performance of the scheme and show that it is scalable, reliable, and fast. We also present new insights about the optimal timer scheme. [ABSTRACT FROM AUTHOR]

We consider the symmetric discrete memoryless relay channel with orthogonal receiver components and show that polar codes are suitable for decode-and-forward and compress-and-forward relaying. In the first case we prove that polar codes are capacity achieving for the physically degraded relay channel; for stochastically degraded relay channels our construction provides an achievable rate. In the second case we construct sequences of polar codes that achieve the compress-and-forward rate by nesting polar codes for source compression into polar codes for channel coding. In both cases our constructions inherit most of the properties of polar codes. In particular, the encoding and decoding algorithms and the bound on the block error probability O(2^{-N^β}) which holds for any 0<β<\frac{1}{2}. [ABSTRACT FROM AUTHOR]

Large-scale propagation effect plays an important role in multiple-input multiple-output (MIMO) relay systems. In particular, the position of the relay (between the source and destination) determines the path-loss effects of adjacent hops, which will further affect the performance of each hop and thus the relay system. In this paper, by minimizing the outage probability of a decode-and-forward (DF) MIMO relay system with orthogonal space-time block coding, we show that relay position optimization improves the finite-SNR (signal-to-noise ratio) diversity gain of a relay system whose adjacent hops have different diversity orders (unbalanced system). Specifically, with relay position optimization, the diversity gain is no longer bounded by that of the weaker hop, i.e., the hop with a lower diversity order, but approaches the diversity order of the stronger hop. This diversity improvement provides a dramatic improvement for the end-to-end outage probability. It will also be shown that although power allocation has no effects on the achievable diversity order, it provides some SNR gains. [ABSTRACT FROM AUTHOR]

This paper proposes a low complexity protocol that preserves full diversity in multiuser amplify-and-forward relay networks with NS antennas at the source, NR antennas at the relay, and ND antennas at each of the K destinations. In the proposed protocol, a two-fold diversity is guaranteed: 1) multi-antenna diversity via transmit antenna selection with maximal-ratio combining (TAS/MRC), and 2) multiuser diversity via opportunistic scheduling. Under perfect feedback with precise channel state information (CSI), we derive new exact and asymptotic symbol error rate (SER) expressions in closed-form for the general case of Nakagami-m fading. We prove that the full diversity order of NSNDKmX+ min{NSNRmY,NRNDKmZ} is guaranteed, where mX, mY, and mZ denote the fading parameters of the source-destination, source-relay, and relay-destination links, respectively. To examine the impact of delayed feedback, we next derive new exact and asymptotic SER expressions in closed-form. We prove that in the presence of delayed feedback, outdated CSI degrades the diversity order to NDmX+ min{NRmY,NDmZ}. In addition, based on our asymptotic expressions, we determine the optimal power allocation between the source and the relay such that the SER is minimized. We show that optimal power allocation offers superior performance over uniform power allocation; highlighting a pivotal design choice for maximizing network performance without investing additional resources. [ABSTRACT FROM AUTHOR]

For cooperative amplify-and-forward (AF) relaying in spectrum-sharing wireless systems, secondary users share spectrum resources originally licensed to primary users to communicate with each other and, thus, the transmit power of secondary transmitters is strictly limited by the tolerable interference powers at primary receivers. Furthermore, the received signals at a relay and at a secondary receiver are inevitably interfered by the signals from primary transmitters. These co-channel interferences (CCIs) from concurrent primary transmission can significantly degrade the performance of secondary transmission. This paper studies the effect of CCIs on outage probability of the secondary link in a spectrum-sharing environment. In particular, in order to compensate the performance loss due to CCIs, the transmit powers of a secondary transmitter and its relaying node are respectively optimized with respect to both the tolerable interference powers at the primary receivers and the CCIs from the primary transmitters. Moreover, when multiple relays are available, the technique of opportunistic relay selection is exploited to further improve system performance with low implementation complexity. By analyzing lower and upper bounds on the outage probability of the secondary system, this study reveals that it is the tolerable interference powers at primary receivers that dominate the system performance, rather than the CCIs from primary transmitters. System designers will benefit from this result in planning and designing next-generation broadband spectrum-sharing systems. [ABSTRACT FROM AUTHOR]

In this paper, we present a video streaming system for wireless networks that employs utility optimization of pre-compressed video at the application layer, together with a novel cooperative wireless physical layer (PHY) that allows interfering transmissions. Our system model considers multiple and independent unicast or multicast transmissions between network nodes while a number of them serve as relays. For this new PHY the average transmission rate that each sender-destination pair can achieve is estimated first. Next, we show that the utility optimization problem can be simplified due to the features of the proposed PHY. Subsequently, we devise a utility optimization algorithm that is executed independently at each sender and it derives the optimal video packets that should be sent in the wireless link given the calculated rate constraint. Simulation results demonstrate that for unicast video streaming scenarios and with the utility optimization framework, allowing packets to interfere is a better choice than employing a typical cooperative PHY. For the case of multicast video delivery the performance of the proposed scheme is significantly improved for good channel conditions while the improvement is minimized in the low channel SNR regime when compared to the unicast scenario. [ABSTRACT FROM AUTHOR]

In a dynamic wireless network where a source terminal communicates with a destination, in presence of other users in the network, it is worthwhile to consider oblivious relaying strategies of a relay in close proximity to the source transmitter. The source-relay channel is assumed to be a fixed gain additive white Gaussian noise (AWGN) channel due to source-relay colocation. The source-destination and the relay-destination transmissions are subject to block flat fading dynamics. A perfect channel state information (CSI) at the respective receivers only is assumed. With the expected throughput as a performance measure, we incorporate a two-layer broadcast approach into a cooperative strategy based on the decode-and-forward scheme - Sequential Decode-and Forward (SDF). The broadcast approach splits the transmitted rate into superimposed layers, corresponding to a "bad" and a "good" channel states, allowing better adaptation to the actual channel conditions. The achievable rate expressions for the SDF strategy are derived under the broadcast approach for multiple settings including single user, multiple-input single-output (MISO) and the general relay setting using successive decoding technique, both numerically and analytically. Continuous broadcasting lower bounds are derived for the MISO and for the oblivious cooperation scenarios. [ABSTRACT FROM AUTHOR]

This paper compares the partial-decode-forward and the complete-decode-forward coding strategies for the half-duplex Gaussian single-relay channel. We analytically show that the rate achievable by partial-decode-forward outperforms that of the more straightforward complete-decode-forward by at most 12.5%. Furthermore, in the following asymptotic cases, the gap between the partial-decode-forward and the complete-decode-forward rates diminishes: (i) when the relay is close to the source, (ii) when the relay is close to the destination, and (iii) when the SNR is low. In addition, when the SNR increases, this gap, when normalized to the complete-decode-forward rate, also diminishes. Consequently, significant performance improvements are not achieved by optimizing the fraction of data the relay should decode and forward, over simply decoding the entire source message. [ABSTRACT FROM AUTHOR]

In this paper, we present a channel estimation scheme for Amplify-and-Forward (AF) relaying systems, using measurements at the destination only. A Least-Squares (LS) based channel estimation algorithm is developed, that provides the destination with full knowledge of all channel responses involved in the transmission. To investigate the algorithm performance, the Cramer-Rao lower bound (CRB) is analytically computed and compared with the asymptotic covariance of the proposed estimator. Since the existing estimator does not reach the CRB, we also propose and analyze an improved algorithm by taking into account the noise characteristics via weighted LS (WLS). The improved algorithm is asymptotically efficient, since it attains the CRB as the SNR tends to infinity. [ABSTRACT FROM AUTHOR]

We consider communication protocols for N-way all-cast relay networks, which comprise N source terminals such that each source terminal demands messages from all other source terminals with the help of a relay. The derived protocols are characterized by the fact that physical layer network coding is employed at the relay, where each source has side information about the signals it has sent. Amplify-and-forward (AF) and decode-and-forward (DF) protocols are applied to the N-way relay network setting, where the achievable rate regions for those protocols are derived and compared with outer capacity bounds. We propose several practical space-time coding schemes for AF and DF, and introduce two new protocols denoted as denoise-and-forward (DNF) and estimate-and-forward (EF). Further, for AF and DF the fundamental diversity-multiplexing trade-off is characterized. [ABSTRACT FROM AUTHOR]

In cognitive radio networks, cognitive secondary users (CSUs) can interfere with the primary users (PUs) when they falsely occupy the PU's licensed spectrum. If CSUs in transmission temporarily form a cooperative relaying network, the interference from CSUs to PU can be reduced due to the cooperative diversity. In this paper, the outage performance as well as the achievable diversity order of opportunistic relaying used for cooperative CSUs is investigated. The cooperative relaying network of CSUs is referred to opportunistically relayed cognitive secondary network (ORCSN). Exact outage probabilities and then the diversity order by high SNR approximation are provided under Rayleigh and Nakagami-m fading channels, respectively. It is shown that a spectrum-sensing method used by the CSUs plays an important role in determining the diversity order in ORCSN. Under Rayleigh fading channels, a cooperative sensing enables ORCSN to achieve the full diversity order but a distributed sensing provides the diversity order smaller than one. Under Nakagami-m fading channels, the achievable diversity order is restricted by the Nakagami channel parameters between the PU and the CSUs and also depends on the sensing method. Moreover, the full diversity order can be achieved by a proper selection of the threshold used for spectrum sensing. Numerical investigation is also provided and used to verify the analysis. [ABSTRACT FROM PUBLISHER]

In this paper, we address the problem of joint optimal threshold-based relaying and maximum likelihood (ML) detection in network-coded cooperative systems. The purpose of using threshold-based relaying is to circumvent the impact of error propagation, which could lead to degrading the system diversity. For simplicity, we consider a simple network comprising two source nodes and one relay node. The relay operates in the decode-and-forward (DF) mode and employs binary network coding. The communication between the two source nodes is bidirectional, resulting in a two-way relay channel. We assume binary phase shift keying (BPSK) signaling. For a given log-likelihood ratio (LLR)-based threshold used at the relay, we derive the ML detector at the destination assuming that the destination has full knowledge of the locations of the blocked bits at the relay. We then derive an expression for the corresponding end-to-end (E2E) bit error rate (BER) performance, which is used to find the optimal threshold. We also derive two practical discontinuous transmission detectors at the destination for the purpose of identifying whether the relay is forwarding or not. The performance of one of the detectors is similar to that when the destination knows the locations of the blocked bits, whereas the performance of the other detector suffers some performance degradation. We present several numerical examples that illustrate the efficacy of the proposed scheme as compared to existing schemes. [ABSTRACT FROM PUBLISHER]

In a two-hop system with multiple amplify-and-forward (AF) relays, the instantaneous channel state information (CSI) is usually required at the relays to achieve a coherent combining at the destination. In this paper, we investigate the design of non-coherent relaying systems, where no CSI is available at the relays. It will be shown that non-coherent relaying can achieve the optimal diversity and multiplexing tradeoff (DMT) of coherent relaying systems with no penalty in the coding length, but incurs a loss of combining gain. To illustrate the practicality of non-coherent relaying, we propose a simple spreading-based non-coherent relaying scheme which achieves the optimal diversity gain. However, the spreading scheme demonstrates a unique non-coherent penalty, namely, the inclusion of one non-coherent relay may introduce "negative" contribution to the receive SNR. To handle this penalty, a distributed relay selection scheme, which can achieve a better outage performance with less energy, is proposed. [ABSTRACT FROM PUBLISHER]

The interference channel with a relay (ICR) is the fundamental building block of cooperation in wireless networks where there are multiple communicating pairs interfering with each other. This paper considers ICRs in which the links are subject to i.i.d. fading, and each node has channel state information (CSI) only on its incoming links (receive CSI). Two channel models are considered: phase fading and Rayleigh fading. Strong interference conditions are derived for the case where the links from the sources to the relay are good in the sense that the achievable region for decoding both messages at the relay contains the maximal achievable region at the destinations. This leads to the characterization of the capacity region for such scenarios. This is the first time the capacity region of the ICR is characterized for a nondegraded, noncognitive scenario, with a causal relay when all links are active. [ABSTRACT FROM PUBLISHER]

The smallest network model that captures relaying in the presence of multiple communicating pairs causing interference to each other is the interference channel with a relay. In this paper, an achievable rate region for the interference channel with a relay is derived. Special cases of strong interference under which this region is the capacity region are presented. The results obtained demonstrate the benefits of interference forwarding at a relay. By forwarding interfering messages, the relay can improve their reception at unintended receivers and, thus, facilitate interference cancellation. We show that intentionally forwarding interfering messages can improve the achievable rates. The achievable rates and interference forwarding gains are also illustrated by numerical results in Gaussian channels. Finally, a sum-rate outer bound to the capacity region of the Gaussian interference channel with a relay is derived and compared with the achievable rate region. The cut-set bound for this channel is also derived and shown to be much looser than the new sum-rate outer bound. [ABSTRACT FROM PUBLISHER]

In multihop wireless networks, the rational packet droppers may not relay the others' packets because packet relay consumes their resources without benefits, and the irrational packet droppers intentionally drop packets to disrupt the packet transmission process, which may make multihop communication fail. Cooperation stimulation mechanisms can motivate the rational packet droppers to relay packets, but they cannot identify the irrational packet droppers. In this paper, we develop a novel mechanism that can thwart the rational and irrational packet dropping attacks by adopting stimulation and punishment strategies (TRIPO). TRIPO uses micropayment to stimulate the rational packet droppers to relay the others' packets and enforce fairness and uses reputation system (RS) to identify and evict the irrational packet droppers. We propose a novel monitoring technique to measure the nodes' frequency of dropping packets based on processing the payment receipts instead of using the medium overhearing technique. The receipts can be processed to extract financial information to reward the cooperative nodes that relay packets, as well as contextual information, such as broken links, to build up the RS. Extensive analytical and simulation results demonstrate that TRIPO can secure the payment and precisely identify the irrational packet droppers with almost no false-positive nodes, which can improve the network performance in terms of packet delivery ratio. [ABSTRACT FROM PUBLISHER]

This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic repeat request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with packets arriving according to a Poisson process and for an increasing convex cost function where packets must be drained from the queues at the base station. [ABSTRACT FROM AUTHOR]

In this paper, we investigate multi-hop relaying as an efficient fading mitigation tool for coherent free-space optical (FSO) systems over atmospheric turbulence channels. We consider an FSO relaying system with decode-and-forward relay nodes and multiple heterodyne receivers with modal compensation. Based on a recently introduced statistical characterization for the combined effects of log-normal turbulence fading and modal compensation, we derive the outage probability and quantify the potential performance improvements through the derivation of diversity-multiplexing tradeoff (DMT) and diversity gain. Our outage analysis yields impressive power savings for multi-hop relaying even with a single-relay. In addition, the DMT analysis in practical signal-to-noise ratio (SNR) ranges demonstrates that multi-hop transmission scheme improves finite-SNR diversity gain throughout the range of the multiplexing gain. [ABSTRACT FROM AUTHOR]

Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d. and correlated Rayleigh-fading links. Low-outage approximations are derived, which reveal a number of insights, including the impact of correlation, of the number of antennas, of relay noise and of relaying protocol. The effect of correlation is shown to be negligible, unless the channel becomes almost fully correlated. The SNR loss of relay fading channels compared to the AWGN channel is quantified. The SNR-asymptotic diversity-multiplexing tradeoff (DMT) is obtained for a broad class of fading distributions, including, as special cases, Rayleigh, Rice, Nakagami, Weibull, which may be non-identical, spatially correlated and/or non-zero mean. The DMT is shown to depend not on a particular fading distribution, but rather on its polynomial behavior near zero, and is the same for the simple "amplify-and-forward" protocol and more complicated "decode-and-forward" one with capacity achieving codes, i.e. the full processing capability at the relay does not help to improve the DMT. There is however a significant difference between the SNR-asymptotic DMT and the finite-SNR outage performance: while the former is not improved by using an extra antenna on either side, the latter can be significantly improved and, in particular, an extra antenna can be traded-off for a full processing capability at the relay. The results are extended to the multi-relay channels with selection relaying and typical outage events are identified. [ABSTRACT FROM AUTHOR]

Motivated by the recent concept of Space-Time Shift Keying (STSK), we propose a novel cooperative STSK family, which is capable of achieving a flexible rate-diversity tradeoff, in the context of cooperative space-time transmissions. More specifically, we first propose a Coherent cooperative STSK (CSTSK) scheme, where each Relay Node (RN) activates Decode-and-Forward (DF) transmissions, depending on the success or failure of Cyclic Redundancy Checking (CRC). We invoke a bit-to-STSK mapping rule, where according to the input bits, one of the Q pre-assigned dispersion vectors is activated to implicitly convey log_2Q bits, which are transmitted in combination with the classic log_2\cal L-bit modulated symbol. Additionally, we introduce a beneficial dispersion vector design, which enables us to dispense with symbol-level Inter-Relay Synchronization (IRS). Furthermore, the Destination Node (DN) is capable of jointly detecting the signals received from the source-destination and relay-destination links, using a low-complexity single-stream-based Maximum Likelihood (ML) detector, which is an explicit benefit of our Inter-Element Interference (IEI)-free system model. More importantly, as a benefit of its design flexibility, our cooperative CSTSK arrangement enables us to adapt the number of the RNs, the transmission rate as well as the achievable diversity order. Moreover, we also propose a Differentially-encoded cooperative STSK (DSTSK) arrangement, which dispenses with CSI estimation at any of the nodes, while retaining the fundamental benefits of the cooperative CSTSK scheme. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel cooperative diversity scheme for wireless systems employing the combination of bit—interleaved coded modulation (BICM) and orthogonal frequency division multiplexing (OFDM). The proposed scheme utilizes an amplify—and—forward protocol where relays are assigned to multiple groups. Relays in the same group transmit concurrently over disjoint sets of sub—carriers and relays in different groups transmit in different time slots. We derive closed—form expressions for the asymptotic worst—case pairwise error probability and the diversity gain of the proposed cooperative BICM—OFDM scheme. Based on the derived analytical results we develop design guidelines for sub—carrier allocation, relay grouping, and relay selection. Simulation results corroborate the derived analytical results and confirm the effectiveness of the developed optimization framework. [ABSTRACT FROM AUTHOR]

This paper presents a comparison and analysis of selection relaying with transmit beamforming as an effective approach to combat channel impairments in relay-assisted cellular networks. We consider the downlink scenario where the base station equipped with N antennas transmits to the mobile station either directly, or indirectly via a relay station, according to the link with the strongest received signal-to-noise ratio (SNR). We compare two amplify-and-forward protocols: i) fixed gain relaying which requires partial channel state information (CSI), and ii) variable gain relaying which requires full CSI. We present new exact closed-form expressions for the generalized moments of the end-to-end SNR to characterize the higher-order statistical properties of the SNR. We derive new exact closed-form expressions for the symbol error rate (SER), which are valid for a wide variety of modulations. Furthermore, we explicitly characterize the asymptotic behavior of the SER to obtain two key performance parameters: the array gain and the diversity order. Based on these, we reveal that the SNR advantage of variable over fixed gain relaying vanishes in the large N limit. [ABSTRACT FROM AUTHOR]

The battery nonlinearity has never been considered for energy analysis in relay networks. In this letter, we adopt the realistic nonlinear battery model, apply the battery energy consumption results in to general relay networks, investigate the optimum and suboptimum energy allocation solutions for relaying transmission, and establish the relay selection criterion from the battery energy efficiency perspective. Our analyses and comparisons show that relaying does not always increase the system energy efficiency. We further establish closed-form conditions that can be easily checked to determine whether the relay transmission is preferable to the direct transmission. Numerical examples are also presented to verify these results. [ABSTRACT FROM AUTHOR]

In this paper, we investigate an incremental opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we consider regenerative relaying in which the decision to cooperate is based on a signal-to-noise ratio (SNR) threshold and takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We derive a closed-form expression for the end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation based on the exact probability density function (PDF) of each hop. Furthermore, we evaluate the asymptotic error performance and the diversity order is deduced. We show that performance simulation results coincide with our analytical results. [ABSTRACT FROM AUTHOR]