Nonuniform SINR+Voronoi diagrams are effectively uniform

DOI10.1016/j.tcs.2021.04.018OpenAlexW3166839949MaRDI QIDQ2043011

David Peleg, Erez Kantor, Zvi Lotker, Merav Parter

Publication date: 22 July 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.018

zbMATH Keywords

Voronoi diagrampoint locationSINR

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
• The Topology of Wireless Communication
• On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• SINR Diagrams

This page was built for publication: Nonuniform SINR+Voronoi diagrams are effectively uniform