English
Related papers

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

200 papers

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. In a companion paper, we established some basic results which laid the foundation for the results…

Information Theory · Computer Science 2008-08-05 K. Sreeram , S. Birenjith , P. Vijay Kumar

In this two-part paper, the DMT of cooperative multi-hop networks is examined. The focus is on single-source single-sink (ss-ss) multi-hop relay networks having slow-fading links and relays that potentially possess multiple antennas. The…

Information Theory · Computer Science 2008-08-05 K. Sreeram , S. Birenjith , P. Vijay Kumar

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

We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into…

Information Theory · Computer Science 2007-07-22 Melda Yuksel , Elza Erkip

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

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 two-part paper, we consider the multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies…

Information Theory · Computer Science 2007-07-13 Sheng Yang , Jean-Claude Belfiore

In this paper, we propose novel cooperative transmission protocols for delay limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay,…

Information Theory · Computer Science 2007-07-16 Kambiz Azarian , Hesham El Gamal , Philip Schniter

This paper investigates the benefits of Amplify-and-Forward (AF) relaying in the setup of multi-antenna wireless networks. The concept of Random Sequential (RS) relaying is previously introduced in the literature and showed that it achieves…

Information Theory · Computer Science 2009-12-22 Shahab Oveis Gharan , Alireza Bayesteh , Amir K. Khandani

A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown…

Information Theory · Computer Science 2016-11-18 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer…

Information Theory · Computer Science 2009-02-16 Chun-Hung Liu , Feng Xue , Jeffrey G. Andrews

We analyze fading relay networks, where a single-antenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop protocol with linear processing at the relay level. A family of…

Information Theory · Computer Science 2016-08-14 Cemal Akçaba , Patrick Kuppinger , Helmut Bölcskei

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,…

Information Theory · Computer Science 2015-03-19 Mohamed Abouelseoud , Aria Nosratinia

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks…

Information Theory · Computer Science 2008-07-02 R. N. Krishnakumar , N. Naveen , P. Vijay Kumar

The diversity multiplexing tradeoff of a general two-hop asynchronous cooperative network is examined for various relaying protocols such as non-orthogonal selection decode-and-forward (NSDF), orthogonal selection decode-and-forward (OSDF),…

Information Theory · Computer Science 2011-02-21 Mehdi Torbatian , Mohamed Oussama Damen

Network coding and cooperative communication have received considerable attention from the research community recently in order to mitigate the adverse effects of fading in wireless transmissions and at the same time to achieve high…

Information Theory · Computer Science 2010-04-20 Hakan Topakkaya , Zhengdao Wang

We consider "virtual" full-duplex relaying by means of half-duplex relays. In this configuration, each relay stage in a multi-hop relaying network is formed by at least two relays, used alternatively in transmit and receive modes, such that…

Information Theory · Computer Science 2013-11-26 Song-Nam Hong , Giuseppe Caire

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain.…

Information Theory · Computer Science 2007-09-29 Yijia , Fan , H. Vincent Poor , John S. Thompson

We study a multihop "virtual" full-duplex relay channel as a special case of a general multiple multicast relay network. For such channel, quantize-map-and-forward (QMF) (or noisy network coding (NNC)) achieves the cut-set upper bound…

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

We study the problem of channel pairing and power allocation in a multichannel multihop relay network to enhance the end-to-end data rate. Both amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies are considered. Given…

Information Theory · Computer Science 2015-12-14 Mahdi Hajiaghayi , Min Dong , Ben Liang
‹ Prev 1 2 3 10 Next ›