Next Article in Journal
A Hierarchical Gamma Mixture Model-Based Method for Classification of High-Dimensional Data
Previous Article in Journal
A Generic Model for Quantum Measurements
Open AccessArticle

On NACK-Based rDWS Algorithm for Network Coded Broadcast

Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, West Bengal 721302, India
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(9), 905; https://doi.org/10.3390/e21090905
Received: 20 July 2019 / Revised: 18 August 2019 / Accepted: 27 August 2019 / Published: 17 September 2019
(This article belongs to the Special Issue Information Theory and Network Coding)
The Drop when seen (DWS) technique, an online network coding strategy is capable of making a broadcast transmission over erasure channels more robust. This throughput optimal strategy reduces the expected sender queue length. One major issue with the DWS technique is the high computational complexity. In this paper, we present a randomized version of the DWS technique (rDWS), where the unique strength of the DWS, which is the sender’s ability to drop a packet even before its decoding at receivers, is not compromised. Computational complexity of the algorithms is reduced with rDWS, but the encoding is not throughput optimal here. So, we perform a throughput efficiency analysis of it. Exact probabilistic analysis of innovativeness of a coefficient is found to be difficult. Hence, we carry out two individual analyses, maximum entropy analysis, average understanding analysis, and obtain a lower bound on the innovativeness probability of a coefficient. Based on these findings, innovativeness probability of a coded combination is analyzed. We evaluate the performance of our proposed scheme in terms of dropping and decoding statistics through simulation. Our analysis, supported by plots, reveals some interesting facts about innovativeness and shows that rDWS technique achieves near-optimal performance for a finite field of sufficient size. View Full-Text
Keywords: broadcast; drop when seen; feedback; integer partition; online network coding; probability of innovativeness; randomized drop when seen broadcast; drop when seen; feedback; integer partition; online network coding; probability of innovativeness; randomized drop when seen
Show Figures

Figure 1

MDPI and ACS Style

Giri, S.; Roy, R. On NACK-Based rDWS Algorithm for Network Coded Broadcast. Entropy 2019, 21, 905.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop