Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Approximating Throughput and Packet Decoding Delay in Linear Network Coded Wireless Broadcast

Loading...
Thumbnail Image

Authors

Yu, Mingchao
Sadeghi, Parastoo

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Abstract

We study the interplay between the throughput and average packet decoding delay (APDD) of linear network coded (LNC) wireless broadcast systems through studying the approximation of throughput and APDD. We first define strong and weak approximations (based on whether the approximation holds for every receiver or not). We then prove that LNC techniques that strongly approximate throughput can also strongly approximate APDD, but those that weakly approximate throughput do not necessarily weakly approximate APDD. We prove that all throughput-optimal LNC techniques, including random linear network coding, strongly approximate APDD with a ratio between 4/3 and 2. We also prove that all memoryless LNC techniques, including instantly decodable network coding techniques, cannot strongly or weakly approximate throughput, nor strongly approximate APDD.

Description

Citation

Source

2018 IEEE Information Theory Workshop, ITW 2018

Book Title

Entity type

Access Statement

License Rights

Restricted until

2037-12-31