Sciweavers

54 search results - page 4 / 11
» Network Coding for Computing: Cut-Set Bounds
Sort
View
ADHOCNOW
2005
Springer
14 years 1 months ago
Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...
Carlos H. Rentel, Thomas Kunz
ACCESSNETS
2009
Springer
13 years 5 months ago
Capacity of Two-Way Relay Channel
This paper investigates the capacity of a wireless two-way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-th...
Shengli Zhang, Soung Chang Liew, Hui Wang, Xiao-Hu...
SPAA
2010
ACM
14 years 16 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
DSN
2003
IEEE
14 years 1 months ago
On the Design of Robust Integrators for Fail-Bounded Control Systems
This paper describes the design and evaluation of a robust integrator for software-implemented control systems. The integrator is constructed as a generic component in the Simulin...
Jonny Vinter, Andréas Johansson, Peter Folk...
IPSN
2005
Springer
14 years 1 months ago
Sensing capacity for discrete sensor network applications
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
Yaron Rachlin, Rohit Negi, Pradeep K. Khosla