Wireless erasure networks with feedback

Author

Smith, Brian ; Hassibi, Babak

Author_Institution

Dept. of ECE, Univ. of Texas at Austin, Austin, TX

fYear

2008

fDate

6-11 July 2008

Firstpage

339

Lastpage

343

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

Keywords

encoding; feedback; queueing theory; radio networks; telecommunication network topology; acknowledgment feedback; information theoretic cut-set rate; lossy packet network; network coding; network topology; rateless coding; throughput-optimal transmission strategy; unicast network; wireless erasure networks; Additive noise; Broadcasting; Lyapunov method; Network coding; Network topology; Stability; State feedback; Unicast; Wireless communication; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2008. ISIT 2008. IEEE International Symposium on

Conference_Location

Toronto, ON

Print_ISBN

978-1-4244-2256-2

Electronic_ISBN

978-1-4244-2257-9

Type

conf

DOI

10.1109/ISIT.2008.4595004

Filename

4595004