Completion time reduction in instantly decodable network coding through decoding delay control

Rate aware network codes for coordinated multi base-station networks

“…• The classical IDNC: In this scheme, the message combination is chosen according to the strategy proposed in [21]. The transmission rate is the minimum rate/achievable capacity of the users included in the maximum independent set.…”

“…Previous works have showed that employing well-designed IDNC schemes can minimize either the completion time [23] or the decoding delay experienced by the users [24], [19]. Lately, a recent study [21] on the effect of controlling the decoding delay to minimize the completion time resulted in a multi-layer solution that improved the performance obtained in [24]. Most of the works mentioned above focused on an upper layer view of the network and abstracted the physical layer conditions, e.g., fading, shadowing, reflection, into simple erasure-channel models.…”

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

“…The problem of minimizing the completion time for the whole recovery phase is shown to be intractable in [20]. A traditional approach is to approximate the completion time, at each transmission, by an expression involving the decoding delay as shown in the following corollary.…”

“…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.…”

“…Whereas in [20] only the BS is transmitting, in a D2D configuration all the player can communicate and thus the probability for a packet to be erased at the ith player is approximated by the average erasure probability linking him to all other players.…”