Sciweavers

102 search results - page 2 / 21
» Queued Cooperative Wireless Networks With Rateless Codes
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 1 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
SIGCOMM
2012
ACM
11 years 7 months ago
Spinal codes
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
Jonathan Perry, Peter Iannucci, Kermin Fleming, Ha...
VTC
2010
IEEE
171views Communications» more  VTC 2010»
13 years 3 months ago
Optimum Physical-Layer Frame Size for Maximising the Application-Layer Rateless Code's Effective Throughput
— The tolerable packet-loss ratio of an Internet Protocol (IP) based wireless networks varies according to the specific services considered. File transfer for example must be er...
Tim Stevens, Robert G. Maunder, Lajos Hanzo
MOBICOM
2012
ACM
11 years 7 months ago
AutoMAC: rateless wireless concurrent medium access
Current wireless network design is built on the ethos of avoiding interference. In this paper we question this long-held design principle. We show that with appropriate design, su...
Aditya Gudipati, Stephanie Pereira, Sachin Katti
INFOCOM
2009
IEEE
13 years 11 months ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...