On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding

Abstract

In this paper, we consider the problem of minimizing the mean completion delay in wireless broadcast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the packet selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these properties, we propose a simple online selection algorithm that efficiently minimizes the mean completion delay of a frame of broadcast packets, compared to the random and greedy selection algorithms with a similar computational complexity. Simulation results show that our proposed algorithm indeed outperforms these random and greedy selection algorithms.

A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications

“…The maximum decoding delay is introduced in [19] as a more reliable delay metric in IDNC. The completion time is reduced in [21] and is shown to be related to the maximum decoding delay in [20] and thus, be better controlled through it.…”

“…For simplicity, this proof considers the cost function φ = −U CT , defined in (21), with the objective of minimizing. The set of NEs allows the determination of the PoA of Game 4 and its comparison with the PoA of Game 1.…”

“…Furthermore, no buffer is needed at receivers as noninstantly decodable packets are not stored for future decoding possibilities. In the last few years, IDNC is an intensive subject of research [8]- [21]. While the authors in [8] investigate the sum decoding delay reduction for perfect feedback, the authors in [9], [17], [18], [22] study the effects of feedback imperfection on the sum decoding delay minimization.…”

Distributed relay selection with network coding for data dissemination in vehicular ad hoc networks

“…Since each encoded packet requires to be decoded before the delivery to higher layers, 23,24 the successful decoding of each encoded packet asks for receiving a certain number of encoded packets. In contrast with RLNC, IDNC 12,25,26 is proposed to reduce the decoding delay by carefully choosing the set of data packets to be coded together in each transmission. By doing so, IDNC guarantees a subset of (or if possible, all) receivers be able to instantly decode one of their wanted packets upon successful reception of the coded packet.…”

Instantly decodable network coding protocols with unequal error protection

“…Additionally, IDNC encoding method is implemented using binary XOR. [14]- [16] propose algorithms that target delaysensitive applications, such as video streaming. Adaptive IDNC algorithms were shown in [17], [18], however, these methods require feedback for every (re)transmitted packet to determine the reception status for every receiver and, hence, make a decision on the packets combination.…”