English
Related papers

Related papers: Diversity-Multiplexing Tradeoff of Cooperative Com…

200 papers

The dynamic decode-and-forward (DDF) relaying protocol is a relatively new cooperative scheme which has been shown to achieve promising theoretical results in terms of diversity-multiplexing gain tradeoff and error rates. The case of a…

Information Theory · Computer Science 2015-03-17 Charlotte Hucher , Parastoo Sadeghi

The problem of communicating a single message to a destination in presence of multiple relay nodes, referred to as cooperative unicast network, is considered. First, we introduce "Mixed Noisy Network Coding" (MNNC) scheme which generalizes…

Information Theory · Computer Science 2014-10-21 Arash Behboodi , Pablo Piantanida

Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time coding was used to maximize diversity gain. Assuming a…

Information Theory · Computer Science 2008-05-22 Rahul Vaze , Robert W. Heath

In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with…

Information Theory · Computer Science 2009-05-18 Vahid Pourahmadi , Alireza Bayesteh , Amir K. Khandani

WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…

Information Theory · Computer Science 2009-11-03 Georg Böcherer , Alexandre de Baynast

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…

Information Theory · Computer Science 2014-06-05 Z. Chen , P. Fan , K. B. Letaief

Most of the existing P2P content distribution schemes implement a random or rarest piece first dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem…

Networking and Internet Architecture · Computer Science 2019-09-10 M Anandaraj , K Selvaraj , P Ganeshkumar , K P Vijayakumar

We examine the benefits of user cooperation under compute-and-forward. Much like in network coding, receivers in a compute-and-forward network recover finite-field linear combinations of transmitters' messages. Recovery is enabled by linear…

Information Theory · Computer Science 2012-03-06 Matthew Nokleby , Behnaam Aazhang

We analyze a wireless line network employing wireless network coding. The two end nodes exchange their packets through relays. While a packet at a relay might not find its coding pair upon arrival, a transmission cost can be reduced by…

Networking and Internet Architecture · Computer Science 2020-06-16 Yu-Pin Hsu

In this paper, we propose a new cooperation model for discrete memoryless multiple access channels. Unlike in prior cooperation models (e.g., conferencing encoders), where the transmitters cooperate directly, in this model the transmitters…

Information Theory · Computer Science 2014-04-29 Parham Noorzad , Michelle Effros , Michael Langberg , Tracey Ho

A multi-hop two-way relay channel is considered in which all the terminals are equipped with multiple antennas. Assuming independent quasi-static Rayleigh fading channels and channel state information available at the receivers, we…

Information Theory · Computer Science 2008-12-19 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

In this paper, we study video streaming over wireless networks with network coding capabilities. We build upon recent work, which demonstrated that network coding can increase throughput over a broadcast medium, by mixing packets from…

Networking and Internet Architecture · Computer Science 2007-06-12 Hulya Seferoglu , Athina Markopoulou

We study the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to…

Information Theory · Computer Science 2009-08-31 Zhenning Kong , Edmund M. Yeh , Emina Soljanin

This paper studies the setup of a multiple-relay network in which $K$ half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are…

Information Theory · Computer Science 2008-06-08 Shahab Oveis Gharan , Alireza Bayesteh , Amir K. Khandani

We consider slow fading relay channels with a single multi-antenna source-destination terminal pair. The source signal arrives at the destination via N hops through N-1 layers of relays. We analyze the diversity of such channels with fixed…

Information Theory · Computer Science 2007-08-03 Sheng Yang , Jean-Claude Belfiore

The performance of user-cooperation in a multi-access network is compared to that of using a wireless relay. Using the total transmit and processing power consumed at all nodes as a cost metric, the outage probabilities achieved by dynamic…

Information Theory · Computer Science 2016-11-17 Lalitha Sankar , Gerhard Kramer , Narayan B. Mandayam

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_S$, which is usually smaller than the channel capacity…

Information Theory · Computer Science 2007-07-16 Daisuke Kobayashi , Hirosuke Yamamoto , Tomohiro Ogawa

The issue of non-cooperative transceiver optimization in the uplink of a multiuser wireless code division multiple access data network with widely-linear detection at the receiver is considered. While previous work in this area has focused…

Information Theory · Computer Science 2009-06-19 Stefano Buzzi , H. Vincent Poor , Alessio Zappone

In this work we explicitly provide the first ever optimal, with respect to the Zheng-Tse diversity multiplexing gain (D-MG) tradeoff, cooperative diversity schemes for wireless relay networks. The schemes are based on variants of perfect…

Information Theory · Computer Science 2007-07-13 Petros Elia , P. Vijay Kumar

Wireless energy harvesting constitutes an effective way to prolong the lifetime of wireless networks. In this paper, an opportunistic decode-and-forward cooperative communication system is investigated, where the energy-constrained relays…

Information Theory · Computer Science 2018-01-23 Yanju Gu