Lower Bounds for Clear Transmissions in Radio Networks

DOI10.1007/11682462_42zbMath1145.68324OpenAlexW1748875290MaRDI QIDQ3525780

Martín Farach-Colton, Miguel A. Mosteiro

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_42

zbMATH Keywords

Random geometric graphsLeader electionDominating setLower boundMaximal independent setSensor networkBroadcastRadio networkAd-hoc networkContention resolutionStation selectionWake upWeak Sensor Model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Related Items (5)

Consensus and collision detectors in radio networks ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Initializing sensor networks of non-uniform density in the weak sensor model

This page was built for publication: Lower Bounds for Clear Transmissions in Radio Networks