Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks

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 al...

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Ali ParandehGheibi, Jay Kumar Sundararajan, Muriel Médard
• Keywords: Collision, Collision Avoidance, CORR 2010, Education, Original Packets