# 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
2 Citations

#### Topics from this paper

Cross-Sender Bit-Mixing Coding
• Computer Science, Mathematics
• 2019 18th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)
• 2019

#### References

SHOWING 1-10 OF 31 REFERENCES
Wireless Network Information Flow: A Deterministic Approach
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2011
Maximal independent sets in radio networks
• Computer Science
• PODC '05
• 2005
Maximal independent sets in multichannel radio networks
• Mathematics, Computer Science
• PODC '13
• 2013
The abstract MAC layer
• Computer Science
• Distributed Computing
• 2010
On the locality of bounded growth
• Computer Science
• PODC '05
• 2005
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2007