Computation in noisy radio networks

Eyal Kushilevitz; Yishay Mansour

doi:10.1137/S0895480103434063

Computation in noisy radio networks

Eyal Kushilevitz^*, Yishay Mansour

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Pages (from-to)	96-108
Number of pages	13
Journal	SIAM Journal on Discrete Mathematics
Volume	19
Issue number	1
DOIs	https://doi.org/10.1137/S0895480103434063
State	Published - 2005

Keywords

Broadcast networks
Noisy computation
Radio networks
Threshold functions

Access to Document

10.1137/S0895480103434063

Cite this

@article{593d68b64a0947faae25fcdda4c0d0e9,

title = "Computation in noisy radio networks",

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

keywords = "Broadcast networks, Noisy computation, Radio networks, Threshold functions",

author = "Eyal Kushilevitz and Yishay Mansour",

year = "2005",

doi = "10.1137/S0895480103434063",

language = "אנגלית",

volume = "19",

pages = "96--108",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "1",

}

TY - JOUR

T1 - Computation in noisy radio networks

AU - Kushilevitz, Eyal

AU - Mansour, Yishay

PY - 2005

Y1 - 2005

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

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

KW - Broadcast networks

KW - Noisy computation

KW - Radio networks

KW - Threshold functions

UR - http://www.scopus.com/inward/record.url?scp=33644591451&partnerID=8YFLogxK

U2 - 10.1137/S0895480103434063

DO - 10.1137/S0895480103434063

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33644591451

SN - 0895-4801

VL - 19

SP - 96

EP - 108

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 1

ER -

Computation in noisy radio networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this