Wireless erasure networks with feedback


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 nodepsilas buffer once it has been successfully received by the final destination.

DOI: 10.1109/ISIT.2008.4595004

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@article{Smith2008WirelessEN, title={Wireless erasure networks with feedback}, author={Brian Smith and Babak Hassibi}, journal={2008 IEEE International Symposium on Information Theory}, year={2008}, pages={339-343} }