Related papers: Opportunistic Cooperation Strategies for Multiple …
In this work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal…
In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes…
The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is considered that…
We consider a system in which two users communicate with a destination with the help of a half-duplex relay. Based on the compute-and-forward scheme, we develop and evaluate the performance of coding strategies that are of network coding…
This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algorithm is proposed to achieve the optimal achievable rate…
Compute-and-forward (CF) harnesses interference in a wireless networkby allowing relays to compute combinations of source messages. The computed message combinations at relays are correlated, and so directly forwarding these combinations to…
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…
In this paper, we propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior…
Network coding is a new and promising paradigm for modern communication networks by allowing intermediate nodes to mix messages received from multiple sources. Compute-and-forward strategy is one category of network coding in which a relay…
Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The…
The problem of optimal resource allocation is studied for ergodic fading orthogonal multiaccess relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits on a…
We consider the opportunistic multiuser diversity in the multiuser two-way amplify-and-forward (AF) relay channel. The relay, equipped with multiple antennas and a simple zero-forcing beam-forming scheme, selects a set of two way relaying…
In this paper, we consider the joint opportunistic routing and channel assignment problem in multi-channel multi-radio (MCMR) cognitive radio networks (CRNs) for improving aggregate throughput of the secondary users. We first present the…
The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their…
This paper investigates the problem of information transmission over the simultaneous relay channel with two users (or two possible channel outcomes) where for one of them the more suitable strategy is Decode-and-Forward (DF) while for the…
We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two…
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…
Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks,…
This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of the network, we introduce two novel CMF methods, namely,…
A multiple access relay channel (MARC) is considered in which an analogue-like network coding is implemented in the relay node. This analogue coding is a simple addition of the received signals at the relay node. Using "nulling detection"…