TH1.R9.1

Throughput and Latency of Network Coding in Line Networks with Outages

Yanyan Dong, Shenghao Yang, The Chinese University of Hong Kong, Shenzhen, China; Jie Wang, Georgia Institute of Technology, United States; Fan Cheng, Shanghai Jiao Tong University, China

Session:
Coding Over Networks

Track:
21: Other topics

Location:
Lamda

Presentation Time:
Thu, 11 Jul, 09:45 - 10:05

Session Chair:
Parastoo Sadeghi, The University of New South Wales
Abstract
Wireless communications are often affected by outage events caused by fading and interference. This paper focuses on investigating the communication throughput and latency in a line-topology, multi-hop network where outages may occur on network links. We focus on three types of intermediate network node schemes: random linear network coding (RLNC), store-and-forward (SF), and hop-by-hop retransmission. The analytical formulas for the maximum throughput and the end-to-end latency are provided for each scheme. To gain a more explicit understanding, we conducted a scalability analysis of the maximum throughput and latency as the network length $L$ increases. We observed that the same order of throughput/latency holds across a wide range of outage functions for each scheme. Specifically, the SF scheme achieves at most $\Theta(\frac{1}{L})$ throughput, while retransmission and RLNC achieve a constant throughput. However, the retransmission scheme relies on ideal feedback, which is rarely satisfied in practice, whereas RLNC does not. We conducted latency comparisons among various schemes under several constraints regarding the volume of data for transmission.
Resources