On the impact of geometry on ad hoc communication in wireless networks

DOI10.1145/2611462.2611487zbMath1321.68473arXiv1406.2852MaRDI QIDQ2943636

Dariusz R. Kowalski, Michał Różański, Tomasz Jurdziński, Grzegorz Stachowiak

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

coloring; distributed algorithms; ad hoc wireless networks; broadcast; signal-to-interference-and-noise-ratio (SINR) model

Mathematics Subject Classification ID

90B18: Communication networks in operations research

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W15: Distributed algorithms

Related Items

The Power of Oblivious Wireless Power, Token traversal in ad hoc wireless networks via implicit carrier sensing, Contention resolution on a fading channel, Distributed bare-bones communication in wireless networks, Limitations of current wireless link scheduling algorithms, Deterministic protocols in the SINR model without knowledge of coordinates, The cost of global broadcast in dynamic radio networks, Leveraging multiple channels in ad hoc networks, Broadcasting in an Unreliable SINR Model.