Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks
Name
Medard_Collision helps.pdf
Size
259.7 KB
Format
Adobe PDF
Checksum (MD5)
73ba2a0474ce32636860a12d148187e0
Author(s)
Medard, Muriel
Parandehgheibi, Ali
Sundararajan, Jay-Kumar
Date Issued
July 2010
Journal
2010 IEEE Wireless Network Coding Conference (WiNC)
Publisher
Institute of Electrical and Electronics Engineers
Citation
ParandehGheibi, Ali, Jay Kumar Sundararajan, and Muriel Medard. “Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks.” Wireless Network Coding Conference (WiNC), 2010 IEEE. 2010. 1-6. © 2010 IEEE
Version
Author's final manuscript
Abstract
Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recovering the original packets from multiple collisions. In this paper, we present an algebraic representation of collisions which allows us to view each collision as a linear combination of the original packets. The transmitted, colliding packets may themselves be a coded version of the original packets. We propose a new acknowledgment (ACK) mechanism for collisions based on the idea that if a set of packets collide, the receiver can afford to ACK exactly one of them and still decode all the packets eventually. We analytically compare delay performance of such collision recovery schemes with other collision avoidance approaches in the context of a single hop wireless erasure network. From the delay perspective, our scheme, without any coordination, outperforms not only ALOHA-type random access mechanisms, but also centralized scheduling.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/WINC.2010.5507938
