On minimizing average packets decoding delay based on B-DLNC for wireless broadcasting

We are concerned with designing an optimal binary determine linear network coding (B-DLNC) strategy with the aim of reducing the number of transmissions and the average packets decoding delay for wireless broadcasting scenarios. In this paper, we first propose the concept of the B-DLNC that no longer limits the encoding packets to be immediately decoded by the receivers and allows the receivers to cache the correctly received undecodable retransmission packets waiting for future decoding opportunities. Next, we use channel coding theory (generation matrix and decoding matrix) to analyze the performance of B-DLNC strategy. In addition, we formulate the average packets decoding delay minimization problem as a max-weight search problem and propose a heuristic algorithm (IMWSA) to improve search efficiency. The simulation results show that compared with the traditional strategies, the proposed strategy can obviously reduce the number of transmissions and average packets decoding delay.