2019/11/19 by Majid Khabbazian, Khabbazian, Majid, Afshin Arefi +1
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Wireless Networks and Protocols #cs.NI
paper · pdf · doi:10.48550/arxiv.1911.08449
arxiv created 2019/11/19 · openalex publication_date 2019/11/19 · arxiv updated 2019/11/20 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
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 RIDNC, a random encoding approach to IDNC. We propose RACE, a light 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.