Results 1 - 10 of 3,516

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

How practical is network coding?

by Mea Wang, Baochun Li , 2006
"... With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding is ..."
Abstract - Cited by 1016 (23 self) - Add to MetaCart
With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding

Tor: The secondgeneration onion router,”

by Roger Dingledine - in 13th USENIX Security Symposium. Usenix, , 2004
"... Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract - Cited by 1229 (33 self) - Add to MetaCart
by a symmetric key at each node (like the layers of an onion) and relayed downstream. The Onion Routing project published several design and analysis papers Perfect forward secrecy: In the original Onion Routing design, a single hostile node could record traffic and later compromise successive nodes

Constructing Minimum Relay Connected Sensor Cover in Heterogeneous Wireless Sensor Networks

by Jie Jiang, Jun Wen, Guofu Wu, Heyin Zhang, Wenhua Dou
"... Abstract. Energy efficiency is an important problem in wireless sensor net-works. In this paper, we consider the energy efficiency problem in a hetero-geneous wireless sensor network which consists of energy-constrained sensor nodes and resource-rich relay nodes. We firstly formulate the minimum rel ..."
Abstract - Add to MetaCart
Abstract. Energy efficiency is an important problem in wireless sensor net-works. In this paper, we consider the energy efficiency problem in a hetero-geneous wireless sensor network which consists of energy-constrained sensor nodes and resource-rich relay nodes. We firstly formulate the minimum

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
diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space–time coding for relay nodes is required, such as those proposed by Laneman and Wornell (2003). The simplicity of the technique allows for immediate implementation in existing radio hardware

Capacity bounds and power allocation for wireless relay channels

by Anders Høst-madsen, Junshan Zhang - IEEE TRANS. INF. THEORY , 2005
"... We consider three-node wireless relay channels in a Rayleigh-fading environment. Assuming transmitter channel state information (CSI), we study upper bounds and lower bounds on the outage capacity and the ergodic capacity. Our studies take into account practical constraints on the transmission/rece ..."
Abstract - Cited by 324 (6 self) - Add to MetaCart
We consider three-node wireless relay channels in a Rayleigh-fading environment. Assuming transmitter channel state information (CSI), we study upper bounds and lower bounds on the outage capacity and the ergodic capacity. Our studies take into account practical constraints on the transmission

Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance

by Michele Zorzi, Ramesh R. Rao - IEEE TRANSACTIONS ON MOBILE COMPUTING , 2003
"... In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its e ..."
Abstract - Cited by 368 (15 self) - Add to MetaCart
In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its

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

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
traffic pattern, namely the relay traffic pattern, but we allow for arbitrarily complex network coding. In our model, there is only one active source/destination pair, while all other nodes assist this transmission. We show code constructions leading to achievable rates and derive upper bounds from

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
, and for this model, the capacity of even a network with a single relay node is open for 30 years. In this paper, we present a deterministic approach to this problem by focusing on the signal interaction rather than the noise. To this end, we propose a deterministic channel model which is analytically simpler than
Results 1 - 10 of 3,516