Speeding Multicast by Acknowledgment Reduction Technique (SMART)
Author(s)
Rezaee, Arman; Zeger, Linda; Medard, Muriel
DownloadMedard_Speeding Multicast.pdf (214.8Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
We present a novel feedback protocol for wireless broadcast networks that utilize linear network coding. We consider transmission of packets from one source to many receivers over a single-hop broadcast erasure channel. Our method utilizes a predictive model to request feedback only when the probability that all receivers have completed decoding is significant. In addition, our proposed NACK-based feedback mechanism enables all receivers to request, within a single time slot, the number of retransmissions needed for successful decoding. We present simulation results as well as analytical results that show the favorable scalability of our technique as the number of receivers, file size, and packet erasure probability increase. We also show the robustness of this scheme to uncertainty in the predictive model, including uncertainty in the number of receiving nodes and the packet erasure probability, as well as to losses of the feedback itself. Our scheme, SMART, is shown to perform nearly as well as an omniscient transmitter that requires no feedback. Furthermore, SMART, is shown to outperform current state of the art methods at any given erasure probability, file size, and numbers of receivers.
Date issued
2011-12Department
Lincoln Laboratory; Massachusetts Institute of Technology. Research Laboratory of ElectronicsJournal
Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2011)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Rezaee, A., L. Zeger, and M. Medard. “Speeding Multicast by Acknowledgment Reduction Technique (SMART).” IEEE Global Telecommunications Conference (GLOBECOM 2011). 1–6.
Version: Author's final manuscript
ISBN
978-1-4244-9267-1
978-1-4244-9266-4
ISSN
1930-529X