English
Related papers

Related papers: Multi-hop Cooperative Wireless Networks: Diversity…

200 papers

This paper develops a diversity-multiplexing tradeoff (DMT) over a bidirectional random relay set in a wireless network where the distribution of all nodes is a stationary Poisson point process. This is a nontrivial extension of the DMT…

Information Theory · Computer Science 2009-09-25 Chun-Hung Liu , Jeffery G. Andrews

Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the…

Information Theory · Computer Science 2009-03-16 Yijia , Fan , Chao Wang , H. Vincent Poor , John S. Thompson

We study a simple question: when are dynamic relaying strategies essential in optimizing the diversity-multiplexing tradeoff (DMT) in half-duplex wireless relay networks? This is motivated by apparently two contrasting results even for a…

Information Theory · Computer Science 2016-11-18 Ritesh Kolte , Ayfer Özgür , Suhas Diggavi

This paper considers an interference network composed of K half-duplex single-antenna pairs of users who wish to establish bi-directional communication with the aid of a multi-input-multi-output (MIMO) half-duplex relay node. This channel…

Information Theory · Computer Science 2009-01-20 Hassan Ghozlan , Yahya Mohasseb , Hesham El Gamal , Gerhard Kramer

Cooperation between terminals has been proposed to improve the reliability and throughput of wireless communication. While recent work has shown that relay cooperation provides increased diversity, increased multiplexing gain over that…

Information Theory · Computer Science 2009-09-10 Vinayak Nagpal , Sameer Pawar , David Tse , Borivoje Nikolic

This chapter presents joint interference suppression and power allocation algorithms for DS-CDMA and MIMO networks with multiple hops and amplify-and-forward and decode-and-forward (DF) protocols. A scheme for joint allocation of power…

Information Theory · Computer Science 2013-01-28 Patrick Clarke , Rodrigo C. de Lamare

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and…

Information Theory · Computer Science 2007-08-10 Shuangqing Wei

In this paper, a multiple-relay network in considered, in which $K$ single-antenna relays assist a single-antenna transmitter to communicate with a single-antenna receiver in a half-duplex mode. A new Amplify and Forward (AF) scheme is…

Information Theory · Computer Science 2007-10-01 Shahab Oveis Gharan , Alireza Bayesteh , Amir K. khandani

This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at…

Information Theory · Computer Science 2019-04-25 Qi Gu , Gongpu Wang , Rongfei Fan , Ning Zhang , Zhangdui Zhong

The 5G wireless network architecture will bring dense deployments of base stations called {\em small cells} for both outdoors and indoors traffic. The feasibility of their dense deployments depends on the existence of a high data-rate…

Information Theory · Computer Science 2015-08-04 Song-Nam Hong , Ivana Maric , Dennis Hui

Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for arbitrary slow fading full-duplex networks as well as for the single-relay half-duplex network. A key reason for this…

Information Theory · Computer Science 2016-11-18 Ayan Sengupta , I-Hsiang Wang , Christina Fragouli

In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit…

Information Theory · Computer Science 2015-05-22 Yair Yona , Meir Feder

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

In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward…

Information Theory · Computer Science 2009-11-09 Olivier Leveque , Christophe Vignat , Melda Yuksel

The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m,k,n)-relay channel where the source, relay and the destination terminals have m, k and n antennas,…

Information Theory · Computer Science 2010-08-10 Sanjay Karmakar , Mahesh K. Varanasi

Wireless networks with multiple nodes that relay information from a source to a destination are expected to be deployed in many applications. Therefore, understanding their design and performance under practical constraints is important. In…

Information Theory · Computer Science 2010-01-22 Bama Muthuramalingam , Srikrishna Bhashyam , Andrew Thangaraj

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…

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

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…

Information Theory · Computer Science 2013-05-16 Ritesh Kolte , Ayfer Özgür

In this paper we study the maximum throughput achievable with optimal scheduling in multi-hop networks with highly directive antenna arrays capable of Space Division Multiplexing (SDM) at the transmitter and Space Division Multiple Access…

Information Theory · Computer Science 2019-01-28 Felipe Gómez-Cuba , Michele Zorzi

We show that fully connected two-hop wireless networks with K sources, K relays and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and in the case of constant channel coefficients (in which…

Information Theory · Computer Science 2013-05-16 Ilan Shomorony , A. Salman Avestimehr