# Computing in Additive Networks with Bounded-Information Codes

@inproceedings{CensorHillel2015ComputingIA, title={Computing in Additive Networks with Bounded-Information Codes}, author={K. Censor-Hillel and E. Kantor and N. Lynch and Merav Parter}, booktitle={DISC}, year={2015} }

This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is not high contention, as assumed previously, but rather guaranteeing a bounded amount of \emph{information} in each neighborhood per round, a property that we show is achievable using a new random coding technique.
Technically, we provide efficient… Expand

#### Topics from this paper

#### 2 Citations

Cross-Sender Bit-Mixing Coding

- Computer Science, Mathematics
- 2019 18th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)
- 2019

A Comprehensive Theory of Algorithms for Wireless Networks and Mobile Systems

- Computer Science
- 2016

#### References

SHOWING 1-10 OF 31 REFERENCES

Wireless Network Information Flow: A Deterministic Approach

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2011

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

- Computer Science, Mathematics
- DISC
- 2012

Maximal independent sets in multichannel radio networks

- Mathematics, Computer Science
- PODC '13
- 2013

A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs

- Mathematics, Computer Science
- PODC '07
- 2007

Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2007

What Is the Use of Collision Detection (in Wireless Networks)?

- Mathematics, Computer Science
- DISC
- 2010