A lower bound for radio broadcast
Journal of Computer and System Sciences
Multiple communication im multihop radio networks
SIAM Journal on Computing
An Ω(D log(N/D)) lower bound for broadcast in radio networks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of Computer and System Sciences
Maximum finding on a multiple access broadcast network
Information Processing Letters
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Information dissemination in highly dynamic graphs
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Zigzag decoding: combating hidden terminals in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Combinatorial algorithms for wireless information flow
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
An algorithmic framework for wireless information flow
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Prioritized gossip in vehicular networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
Consensus and Mutual Exclusion in a Multiple Access Channel
IEEE Transactions on Parallel and Distributed Systems
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Faster information dissemination in dynamic networks via network coding
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient distributed communication in ad-hoc radio networks
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Capacity of time-slotted ALOHA packetized multiple-access systems over the AWGN channel
IEEE Transactions on Wireless Communications
The capacity region of the totally asynchronous multiple-access channel
IEEE Transactions on Information Theory
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Wireless Network Information Flow: A Deterministic Approach
IEEE Transactions on Information Theory
Hi-index | 0.00 |
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 ℓ 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.