Computation in noisy radio networks

Eyal Kushilevitz, Yishay Mansour

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper we examine noisy radio (broadcast) networks in which every bit transmitted has a certain probability to be flipped. Each processor has some initial input bit, and the goal is to compute a function of the initial inputs. In this model we show a protocol to compute any threshold function using only a linear number of transmissions.

Original languageEnglish
Pages236-243
Number of pages8
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 25 Jan 199827 Jan 1998

Conference

ConferenceProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period25/01/9827/01/98

Fingerprint

Dive into the research topics of 'Computation in noisy radio networks'. Together they form a unique fingerprint.

Cite this