Journal article
Block delay under random linear combinations on a broadcast erasure collision channel
2026 IEEE International Symposium on Information Theory (ISIT)
25 Aug 2026
Abstract
We consider the delay associated with transmissions of random linear combinations (RLC) of a block of packets, each held at a collection of independent transmitters and sent over a broadcast erasure and collision channel, to a collection of receivers. Our figures of merit is the expected time until all of the receivers recover the block (i.e., broadcast delay). The transmitters make transmission decisions independently in space and time, and these contention probabilities are the design variable in the problem. The erasure collision channel consists of independent erasure channels between each transmitter and each receiver, with the property that multiple messages arriving at a given receiver collide. We identify the contention probability that maximizes the probability of message reception at a given receiver in a time slot, and thus minimizes this receiver’s expected block delay. We further show maximizing this reception probability also minimizes the system’s expected broadcast delay.
Metrics
1 Record Views
Details
- Title
- Block delay under random linear combinations on a broadcast erasure collision channel
- Creators
- Steven Weber - Drexel University, Electrical and Computer EngineeringNan Xie - Xidian UniversityXian Zhang - Xidian University
- Publication Details
- 2026 IEEE International Symposium on Information Theory (ISIT)
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Other Identifier
- 991022202855704721