Geometrically aware communication in random wireless networks
From MaRDI portal
Publication:5501511
DOI10.1145/1011767.1011813zbMath1321.90033OpenAlexW2019830787MaRDI QIDQ5501511
Gady Kozma, Zvi Lotker, Gideon Stupp, Micha Sharir
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.1370
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions ⋮ Efficiently navigating a random Delaunay triangulation ⋮ Synchronous Rendezvous for Location-Aware Agents
This page was built for publication: Geometrically aware communication in random wireless networks