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
Cross-Sender Bit-Mixing Coding
A Comprehensive Theory of Algorithms for Wireless Networks and Mobile Systems

References

SHOWING 1-10 OF 31 REFERENCES
Wireless Network Information Flow: A Deterministic Approach
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
Maximal independent sets in radio networks
Maximal independent sets in multichannel radio networks
Approximate Local Sums and Their Applications in Radio Networks
The abstract MAC layer
On the locality of bounded growth
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
What Is the Use of Collision Detection (in Wireless Networks)?
...
1
2
3
4
...