Packet Loss Recovery in Broadcast for Real-Time Applications in Dense Wireless Networks

Afshin Arefi,Majid Khabbazian

doi:10.1109/ojcs.2021.3049773

Afshin Arefi, Majid Khabbazian

Open Access

https://doi.org/10.1109/ojcs.2021.3049773

Copy DOI

Abstract

Packet loss recovery in wireless broadcast is challenging, particularly for real-time applications which have strict and short delivery deadline. To recover the maximum number of lost packets within a short time, existing packet recovery solutions often rely on instantly decodable network coding (IDNC). Some of these solutions can recover nearly the maximum number of lost packets possible at the cost of collecting feedback from all (or a large percentage of) users. This is impractical in dense networks. In addition, their runtime grows with the number of users, which is not desirable due to the urgent delivery deadline of real-time applications. In this work, we introduce random instantly decodable network coding (RIDNC), a random encoding approach to IDNC. We propose RA ndom IDN C E ncoder (RACE), a fast RIDNC encoder that can recover nearly as many lost packets as the optimal RIDNC encoder. We compare RACE with the CrowdWiFi encoder, a high performing packet loss recovery solution used in CrowdWiFi, a commercial system for broadcasting live video in dense networks. We show that RACE is up to two orders of magnitude faster than the CrowdWiFi encoder, and recovers more lost packets in practice, where there is not enough time to collect feedback from many users.

Highlights

With the increase in popularity of mobile devices, the need for greater quality and higher bandwidth in wireless networks has increased exponentially
RESEARCH In dense networks, it is not practical to collect feedback from all or a large percentage of users. This is especially the case when broadcasting for real-time applications, which have urgent delivery deadlines. Considering this limitation, we proposed RAndom IDNC Encoder (RACE), a fast and light random instantly decodable network coding (RIDNC) encoder
In dense networks, the optimal RIDNC encoder is capable of recovering nearly as many lost packets as possible by any other solution

Summary

INTRODUCTION

With the increase in popularity of mobile devices, the need for greater quality and higher bandwidth in wireless networks has increased exponentially. We consider wireless broadcast of live media in a network with a single transmitter and many receivers within its transmission range Decodable network codes: IDNC is an attractive solution for packet loss recovery in broadcast of real-time applications [4]. Some works in the literature (e.g., [6]) tried to tackle this problem by assigning cluster heads and collecting feedback from them (instead of all users) These algorithms are relatively complicated and rely on the spacial packet loss correlation. We compare RACE with one of the best IDNC-based packet recovery solutions, verify the superior performance of RACE in speed and in recovering lost packets, and confirm its low communication overhead in dense networks.

RELATED WORK

Objective

RACE: THE PROPOSED RIDNC ENCODER

SIMULATION RESULTS

CONCLUSION AND FUTURE RESEARCH