Sciweavers

317 search results - page 18 / 64
» Bounds on the Gain of Network Coding and Broadcasting in Wir...
Sort
View
WIOPT
2010
IEEE
13 years 5 months ago
On capacity achieving property of rotational coding for acyclic deterministic wireless networks
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
ADHOCNOW
2008
Springer
13 years 8 months ago
A Lower Bound on the Capacity of Wireless Ad Hoc Networks with Cooperating Nodes
In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper b...
Anthony S. Acampora, Louisa Pui Sum Ip
PODC
2012
ACM
11 years 9 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
CORR
2007
Springer
69views Education» more  CORR 2007»
13 years 7 months ago
Wireless Network Information Flow
— We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if t...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
TWC
2010
13 years 2 months ago
Lifetime-resource tradeoff for multicast traffic in wireless sensor networks
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
Vahid Shah-Mansouri, Vincent W. S. Wong