In Order Packet Delivery in Instantly Decodable Network Coded Systems over Wireless Broadcast

TL;DR

This paper addresses in-order packet delivery in wireless broadcast networks using instantly decodable network coding, formulating it as a stochastic shortest path problem and proposing a heuristic algorithm that improves delivery speed.

Contribution

It introduces a stochastic shortest path formulation for in-order delivery and develops a practical heuristic algorithm based on problem structure insights.

Findings

Heuristic algorithm reduces total undelivered packets.

Proposed method achieves faster packet delivery in simulations.

Guidelines for efficient packet selection are derived from SSP analysis.

Abstract

In this paper, we study in-order packet delivery in instantly decodable network coded systems for wireless broadcast networks. We are interested in applications, in which the successful delivery of a packet depends on the correct reception of this packet and all its preceding packets. We formulate the problem of minimizing the number of undelivered packets to all receivers over all transmissions until completion as a stochastic shortest path (SSP) problem. Although finding the optimal packet selection policy using SSP is computationally complex, it allows us to systematically exploit the problem structure and draw guidelines for efficient packet selection policies that can reduce the number of undelivered packets to all receivers over all transmissions until completion. According to these guidelines, we design a simple heuristic packet selection algorithm. Simulation results illustrate that our proposed algorithm provides quicker packet delivery to the receivers compared to the existing algorithms in the literature.