Wireless erasure networks with feedback
- Creators
- Smith, Brian
-
Hassibi, Babak
Abstract
Consider a lossy packet network of queues, communicating over a wireless medium. This paper presents a throughput-optimal transmission strategy for a unicast network when feedback is available, which has the following advantages: It requires a very limited form of acknowledgment feedback. It is completely distributed, and independent of the network topology. Finally, communication at the information theoretic cut-set rate requires no network coding and no rateless coding on the packets. This simple strategy consists of each node randomly choosing a packet from its buffer to transmit at each opportunity. However, the packet is only deleted from a node's buffer once it has been successfully received by the final destination.
Additional Information
© 2008 IEEE. The first author would like to acknowledge funding from an ARO Young Investigator Award. The work of the second author was in parts supported by the National Science Foundation under grant CCF 0729203, by the David and Lucille Packard Foundation and by Caltech's Lee Center for Advanced Networking.Attached Files
Published - 04595004.pdf
Submitted - 0804.4298.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:013dc53747aed50369969463788a1bbf
|
238.7 kB | Preview Download |
|
md5:e0f9ce8009516580cc8ecdbe8e69c8db
|
205.8 kB | Preview Download |
Additional details
- Eprint ID
- 75658
- Resolver ID
- CaltechAUTHORS:20170403-172107989
- Army Research Office (ARO)
- NSF
- CCF-0729203
- David and Lucille Packard Foundation
- Caltech Lee Center for Advanced Networking
- Created
-
2017-04-04Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field