Results 1 - 10 of 3,431

Cooperative strategies and capacity theorems for relay networks

by Gerhard Kramer, Michael Gastpar, Piyush Gupta - IEEE TRANS. INFORM. THEORY , 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract - Cited by 739 (19 self) - Add to MetaCart
Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant

Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

by J. Nicholas Laneman, Gregory W. Wornell - IEEE TRANS. INF. THEORY , 2003
"... We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a m ..."
Abstract - Cited by 622 (5 self) - Add to MetaCart
We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a

Wireless Network Information Flow: A Deterministic Approach

by A. Salman Avestimehr, et al. , 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract - Cited by 296 (42 self) - Add to MetaCart
the Gaussian model but still captures two key wireless channel properties of broadcast and superposition. We consider a model for a wireless relay network with nodes connected by such deterministic channels, and present an exact characterization of the end-to-end capacity when there is a single source and one

Cooperative diversity in wireless networks: efficient protocols and outage behavior

by J. Nicholas Laneman, David N. C. Tse, Gregory W. Wornell - IEEE TRANS. INFORM. THEORY , 2004
"... We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies ..."
Abstract - Cited by 2009 (31 self) - Add to MetaCart
We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies

A simple cooperative diversity method based on network path selection

by Aggelos Bletsas, Ashish Khisti, David P. Reed, Andrew Lippman - IEEE J. SELECT. AREAS COMMUN , 2006
"... Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investi ..."
Abstract - Cited by 452 (14 self) - Add to MetaCart
investigation if there is more than one cooperative relay. We propose a novel scheme that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of available relays and then uses this “best ” relay

On the capacity of large Gaussian relay networks

by Michael Gastpar, Martin Vetterli - IEEE TRANS. INF. THEORY , 2005
"... The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper and ..."
Abstract - Cited by 146 (6 self) - Add to MetaCart
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper

Embracing wireless interference: Analog network coding

by Sachin Katti, Shyamnath Gollakota, Dina Katabi - in ACM SIGCOMM , 2007
"... Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages strategically picked senders to interfere. Instead of forwarding packets, r ..."
Abstract - Cited by 358 (10 self) - Add to MetaCart
? Theoretically, such an approach doubles the capacity of the canonical relay network. Surprisingly, it is also practical. We implement our design using software radios and show that it achieves significantly higher throughput than both traditional wireless routing and prior work on wireless network coding. 1.

On The Capacity Of Wireless Networks: The Relay Case

by Michael Gastpar, Martin Vetterli - in Proc. IEEE INFOCOM , 2002
"... In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-access and broadcast codes. In this paper, we consider essentially the same physical model of a wireless network under a different traffi ..."
Abstract - Cited by 233 (11 self) - Add to MetaCart
the max-flow min-cut theorem. It is shown that lower and upper bounds meet asymptotically as the number of nodes in the network goes to infinity, thus proving that the capacity of the wireless network with n nodes under the relay traffic pattern behaves like log n bits per second. This demonstrates also

Dynamic Power Allocation and Routing for Time Varying Wireless Networks

by Michael J. Neely, Eytan Modiano, Charles E. Rohrs - IEEE Journal on Selected Areas in Communications , 2003
"... We consider dynamic routing and power allocation for a wireless network with time varying channels. The network consists of power constrained nodes which transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be tran ..."
Abstract - Cited by 358 (73 self) - Add to MetaCart
-hoc wireless network where channel variations are due to user mobility, and compare its performance with the Grossglauser-Tse relay model developed in [13].

Distributed Space-Time Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks

by J. Nicholas Laneman - IEEE Trans. Inform. Theory , 2003
"... Abstract — We develop and analyze space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another i ..."
Abstract - Cited by 333 (10 self) - Add to MetaCart
Abstract — We develop and analyze space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another
Results 1 - 10 of 3,431