Related papers: On Maximizing Coverage in Gaussian Relay Networks
Diversity-multiplexing trade-off has been studied extensively to quantify the benefits of different relaying strategies in terms of error and rate performance. However, even in the case of a single half-duplex relay, which seems fully…
This letter studies distributed opportunistic channel access in a wireless network with decode-and-forward relays. All the sources use channel contention to get transmission opportunity. If a source wins the contention, the channel state…
The L-user additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functional-decode-forward coding…
This work considers relay assisted transmission for multiuser networks when the relay has no access to the codebooks used by the transmitters. The relay is called oblivious for this reason. Of particular interest is the generalized…
Consider a wireless Gaussian network where a source wishes to communicate with a destination with the help of N full-duplex relay nodes. Most practical systems today route information from the source to the destination using the best path…
We provide the solution for optimizing the power and resource allocation over block-fading relay-assisted broadcast channels in order to maximize the long term average achievable rates region of the users. The problem formulation assumes…
In this paper, the Gaussian relay channel with linear time-invariant relay filtering is considered. Based on spectral theory for stationary processes, the maximum achievable rate for this subclass of linear Gaussian relay operation is…
A new communication scheme for Gaussian parallel relay networks based on superposition coding and partial decoding at the relays is presented. Some specific examples are proposed in which two codebook layers are superimposed. The first…
Decode-and-forward (D-F) and compress-and-forward (C-F) are two fundamentally different relay strategies proposed by (Cover and El Gamal, 1979). Individually, either of them has been successfully generalized to multi-relay channels. In this…
We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…
In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…
This paper investigates the location-based relay selection problem, where the source node chooses its relay from a set of spatially deployed decode-and-forward relays. The advantages of location-based relay selection are the elimination of…
In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…
In this work we focus on the general relay channel. We investigate the application of estimate-and-forward (EAF) to different scenarios. Specifically, we consider assignments of the auxiliary random variables that always satisfy the…
Motivated by the fact that full diversity order is achieved using the "best-relay" selection technique, we consider opportunistic amplify-and-forward and decode-and-forward relaying systems. We focus on the outage probability of such a…
This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas and various power constraints. The points of interest maximize general rate objectives that…
This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different…
In this paper, we consider an unmanned aerial vehicle (UAV) aided mobile relaying system under a buffer constraint. We propose a new relaying protocol employing mixed free-space optical/radio frequency (FSO/RF) communication, i.e., the…
Compress-forward (CF) schemes are studied in general networks. The CF rate for the one-relay channel defines outerbounds on both the CF rate for general networks and the compression rate-vector region supporting this rate. We show the…
Compute and Forward (CF) is a coding scheme which enables receivers to decode linear combinations of simultaneously transmitted messages while exploiting the linear properties of lattice codes and the additive nature of a shared medium. The…