Computing in Additive Networks with Bounded-Information Codes
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 guar...
Main Authors: | Censor-Hillel, Keren, Kantor, Erez, Lynch, Nancy Ann, Parter, Merav |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Springer-Verlag
2017
|
Online Access: | http://hdl.handle.net/1721.1/111687 https://orcid.org/0000-0003-3809-8990 https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0002-2357-2445 |
Similar Items
-
Bounded-Contention Coding for wireless networks in the high SNR regime
by: Censor-Hillel, Keren, et al.
Published: (2016) -
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
by: Censor-Hillel, Keren, et al.
Published: (2014) -
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
by: Censor-Hillel, Keren, et al.
Published: (2012) -
Structuring Unreliable Radio Networks
by: Censor-Hillel, Keren, et al.
Published: (2012) -
Computational tradeoffs in biological neural networks: Self-stabilizing winner-Take-All networks
by: Lynch, Nancy Ann, et al.
Published: (2022)