Resolving SINR queries in a dynamic setting

DOI10.4230/LIPICS.ICALP.2018.145MaRDI QIDQ5002834zbMATH OpenFDO

Authors Gali Bar-On, Boris Aronov, Matthew J. Katz

Publication date 28 July 2021

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2018.145

zbMATH Keywords

dynamic insertion and deletioninterference cancellationrange searchingSINRwireless networks

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20) Analysis of algorithms (68W40) Communication theory (94A05)

Recommendations

• Resolving SINR Queries in a Dynamic Setting
• SINR diagrams, towards algorithmically usable SINR models of wireless networks
• SINR diagrams, convexity and its applications in wireless networks

Cites work

• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Adding range restriction capability to dynamic data structures
• Computational geometry. Algorithms and applications.
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
• Efficient partition trees
• Nonuniform SINR+Voroni diagrams are effectively uniform
• SINR diagrams, convexity and its applications in wireless networks
• Space efficient data structures for dynamic orthogonal range counting
• The design of dynamic data structures
• The topology of wireless communication

Cited in

(3)

• Resolving SINR Queries in a Dynamic Setting
• Dynamic approximate multiplicatively-weighted nearest neighbors
• Generalized disk graphs

This page was built for publication: Resolving SINR queries in a dynamic setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002834)