What Is the Use of Collision Detection (in Wireless Networks)?
From MaRDI portal
Publication:3588300
DOI10.1007/978-3-642-15763-9_14zbMath1290.68131OpenAlexW1592796664MaRDI QIDQ3588300
No author found.
Publication date: 10 September 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15763-9_14
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (10)
Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Distributed minimum dominating set approximations in restricted families of graphs ⋮ Counting in one-hop beeping networks ⋮ Leader election using loneliness detection ⋮ Randomized broadcast in radio networks with collision detection ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Beeping a maximal independent set ⋮ Unnamed Item ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ Leader Election Using Loneliness Detection
This page was built for publication: What Is the Use of Collision Detection (in Wireless Networks)?
