Wireless Erasure Networks with Feedback
| dc.creator | Smith, Brian | |
| dc.creator | Hassibi, Babak | |
| dc.date | 2008-04-27 | |
| dc.date.accessioned | 2026-07-07T09:35:34Z | |
| dc.date.available | 2026-07-07T09:35:34Z | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/0804.4298 | |
| dc.identifier | http://arxiv.org/abs/0804.4298 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/159872 | |
| dc.subject | Information Theory | |
| dc.title | Wireless Erasure Networks with Feedback | |
| dc.type | text |