This paper presents an outage performance of multiple access relay channel (MARC) for decode-and-forward (DF) relay and amplify-and-forward (AF) relay selection. We consider the multiple-access relay channel with two source nodes, one relay node and one destination node. In MARC, multiple sources transmit to a common destination simultaneously with the assistance of a single relay. In a relayin...

This paper investigates the Diversity Multiplexing Tradeoff (DMT) of the generalized quantizeand-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...

Enabling cooperation among nodes of a wireless network can significantly reduce the required transmit power as well as the induced intra-network interference. Due to the practical half-duplexity constraint of the cooperating nodes, they are prohibited to simultaneously transmit and receive data at the same time-frequency resource. The purpose of this dissertation is to illustrate the value of c...

Manuscript Received 8-August-2012 and revised 5-October-2012 ISSN: 2322-3936 Accepted on 1November-2012 Abstract— This paper concerns two-hop communication over relayassisted Block fading channel. It is assumed there is not a direct link between the transmitter and the affiliated destination and the communication occurs in two hops through the use of a relay, where the amplify and forward (AF) ...

Cooperative diversity is a transmission technique where multiple users pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine space-time signal design for a simple amplify-and-forward relay channel. We show that the code design criteria for the relay case consist of the traditional rank and determinant criter...

We consider a state-dependent full-duplex relay channel with the channel states available non-causally at only the source, i.e., neither at the relay nor at the destination. For the discrete memoryless (DM) case, we establish lower and upper bounds on the channel capacity. The lower bound is obtained by a coding scheme at the source that uses a Gel’fand-Pinsker like binning scheme at the source...

In this paper, we study a diamond-relay channel where the source is connected to M relays through orthogonal links and the relays transmit to the destination over a wireless multiple-access channel in the presence of an eavesdropper. The eavesdropper not only observes the relay transmissions through another multiple-access channel, but also observes a certain number of source-relay links. The l...

In this paper, we model a specific relay channel named relay multiple access channel (RMAC) aiming at providing a clue to select the relay node in multiple access channels such as the uplink of cellular communication system. In this channel, the relay node not only aids to send the information of the source but also sends its private message to the destination. We derive the achievable rate reg...

The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources’ messages and aids in the sources’ transmission. We derive a new outer bound for this channel using an argument originally devised for the “more capable” broadcast channel, and show the ach...

Relay selection is an attractive method to improve the bandwidth efficiency of cooperative networks [1]-[3]. Specifically, Bletsas and others [1] proposed a distributed relay selection based on the channel information of both the first and second hops for each relay, showing that the diversitymultiplexing tradeoff of relay selection is identical with that of distributed space-time coding. Recen...