Lower bounds for structuring unreliable radio networks

DOI10.1007/978-3-662-45174-8_22zbMATH Open1390.68508arXiv1408.0812OpenAlexW1703357547MaRDI QIDQ5498701FDOQ5498701

Authors: Calvin Newport 

Publication date: 10 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: In this paper, we study lower bounds for randomized solutions to the maximal independent set (MIS) and connected dominating set (CDS) problems in the dual graph model of radio networks---a generalization of the standard graph-based model that now includes unreliable links controlled by an adversary. We begin by proving that a natural geographic constraint on the network topology is required to solve these problems efficiently (i.e., in time polylogarthmic in the network size). We then prove the importance of the assumption that nodes are provided advance knowledge of their reliable neighbors (i.e, neighbors connected by reliable links). Combined, these results answer an open question by proving that the efficient MIS and CDS algorithms from [Censor-Hillel, PODC 2011] are optimal with respect to their dual graph model assumptions. They also provide insight into what properties of an unreliable network enable efficient local computation.

Full work available at URL: https://arxiv.org/abs/1408.0812

Recommendations

• Structuring unreliable radio networks
• Structuring unreliable radio networks
• Broadcasting in unreliable radio networks
• The cost of radio network broadcast for different models of unreliable links
• \textsc{Maximal Independent Sets} in radio networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited In (9)

• Maximal independent sets in multichannel radio networks
• STACS 2004
• Structuring unreliable radio networks
• Lower Bounds for Clear Transmissions in Radio Networks
• Radio Network Lower Bounds Made Easy
• The cost of radio network broadcast for different models of unreliable links
• Structuring unreliable radio networks
• On simple back-off in unreliable radio networks
• A (truly) local broadcast layer for unreliable radio networks

This page was built for publication: Lower bounds for structuring unreliable radio networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498701)