Bounded-Contention Coding for the additive network model

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$$n nodes and at most $$a$$a transmitters with information of ℓ bits each within O(alogn+aℓ) bits of communication with full-duplex radios, and O((alogn+aℓ)(logn)) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within O((D+a+logn)(alogn+ℓ)) 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.