Bounded-Contention Coding for Wireless Networks in the High SNR Regime

Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks. This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original transmissions and whose complexity depends on a bound on the contention among the transmitters. BCC enables deterministic local broadcast in a network with n nodes and at most a transmitters with information of l bits each within O(a log n + al) bits of communication with full-duplex radios, and O((a log n + al)(log n)) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within O((D + a + log n)(a log n + l)) bits, with high probability. This also holds in dynamic networks that can change arbitrarily over time by a worst-case adversary. When no bound on the contention is given, it is shown how to probabilistically estimate it and obtain global broadcast that is adaptive to the true contention in the network.

💡 Research Summary

The paper tackles a fundamental challenge in wireless networking: interference caused by simultaneous transmissions. Rather than trying to avoid collisions, the authors embrace them by exploiting the additive nature of high‑SNR wireless channels. They introduce Bounded‑Contention Coding (BCC), a coding scheme that guarantees the exact recovery of up to a simultaneously transmitted messages, provided that the number of concurrent transmitters never exceeds a known bound a.

BCC works by assigning each possible message a distinct vector from a carefully constructed linear code. When up to a nodes transmit at the same time, the receiver observes the linear sum of the corresponding vectors. Because the code ensures that any subset of size a is linearly independent, the receiver can solve a small system of linear equations and retrieve the original messages without ambiguity. This approach transforms a collision from a destructive event into a decodable linear combination.

The authors first apply BCC to the local broadcast problem, where each node must deliver its own l‑bit payload to all of its immediate neighbors. In a full‑duplex setting (simultaneous transmit/receive), a deterministic algorithm achieves this in O(a log n + a l) bits of communication per node, where n is the network size. The O(a log n) term encodes the identifiers needed to separate up to a colliding transmissions, while the O(a l) term carries the actual payloads. For half‑duplex radios, an additional logarithmic factor appears because nodes must schedule transmit and receive slots, leading to O((a log n + a l)·log n) bits with high probability.

To disseminate information globally, the paper combines BCC with random linear network coding (RLNC). Each node, after decoding the collided packets using BCC, forms a random linear combination of the recovered messages and forwards it. Because RLNC preserves linear independence with high probability, the network rapidly spreads a basis for the entire message set. The resulting global broadcast algorithm succeeds in O((D + a + log n)(a log n + l)) bits, where D denotes the network diameter. This bound holds even when the topology changes arbitrarily from round to round under a worst‑case adversary, demonstrating robustness to dynamic environments.

A practical obstacle is that the contention bound a may not be known a priori. The authors address this by first estimating the contention level through a short probing phase. The estimate is then used to select appropriate BCC parameters, yielding an adaptive algorithm whose performance automatically scales with the true contention.

Key contributions of the work include:

1. A novel collision‑decoding code (BCC) that leverages linear independence to recover up to a simultaneous transmissions.
2. Deterministic local broadcast algorithms with tight bit‑complexity for both full‑ and half‑duplex radios.
3. A seamless integration of BCC with RLNC to achieve efficient global broadcast in static, dynamic, and adversarial networks.
4. An adaptive contention‑estimation technique that removes the need for a priori knowledge of a.

Overall, the paper shifts the paradigm from collision avoidance to collision exploitation, offering a theoretically sound and practically relevant solution for high‑SNR wireless systems such as dense IoT deployments, industrial automation, and next‑generation cellular networks.