Show simple item record

dc.contributor.authorNewport, Calvin Charles
dc.contributor.authorKuhn, Fabian
dc.contributor.authorLynch, Nancy Ann
dc.date.accessioned2010-01-28T15:26:37Z
dc.date.available2010-01-28T15:26:37Z
dc.date.issued2009
dc.date.submitted2009-08
dc.identifier.isbn978-1-60558-396-9
dc.identifier.urihttp://hdl.handle.net/1721.1/51002
dc.description.abstractWe prove two broadcast lower bounds for a wireless network model that includes unreliable links. For deterministic algorithms, we show n − 1 rounds are required, where n is the number of processes. For randomized algorithms, ε(n − 1) rounds are required for success probability ε. In both cases, the bounds are proved for a network in which constant-time broadcast is possible.en
dc.language.isoen_US
dc.publisherAssociation for Computing Machineryen
dc.relation.isversionofhttp://dx.doi.org/10.1145/1582716.1582794en
dc.rightsAttribution-Noncommercial-Share Alike 3.0 Unporteden
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en
dc.sourceJoanne Hanleyen
dc.titleBrief announcement: Hardness of broadcasting in wireless networks with unreliable communicationen
dc.typeArticleen
dc.identifier.citationKuhn, Fabian, Nancy Lynch, and Calvin Newport. “Brief announcement: hardness of broadcasting in wireless networks with unreliable communication.” Proceedings of the 28th ACM symposium on Principles of distributed computing. Calgary, AB, Canada: ACM, 2009. 330-331.en
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverLynch, Nancy Ann
dc.contributor.mitauthorNewport, Calvin Charles
dc.contributor.mitauthorKuhn, Fabian
dc.contributor.mitauthorLynch, Nancy Ann
dc.relation.journalProceedings of the 28th ACM Symposium on Principles of Distributed Computingen
dc.eprint.versionAuthor's final manuscript
dc.type.urihttp://purl.org/eprint/type/SubmittedJournalArticleen
eprint.statushttp://purl.org/eprint/status/PeerRevieweden
dspace.orderedauthorsKuhn, Fabian; Lynch, Nancy; Newport, Calvinen
dc.identifier.orcidhttps://orcid.org/0000-0003-3045-265X
mit.licenseOPEN_ACCESS_POLICYen
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record