Batched point location in sinr diagrams via algebraic tools

Boris Aronov, Matthew J. Katz

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The SINR model for the quality of wireless connections has been the subject of extensive recent study. It attempts to predict whether a particular transmitter is heard at a specific location, in a setting consisting of n simultaneous transmitters and background noise. The SINR model gives rise to a natural geometric object, the SINR diagram, which partitions the space into n regions where each of the transmitters can be heard and the remaining space where no transmitter can be heard. Efficient point location in the SINR diagram, i. e., being able to build a data structure that facilitates determining, for a query point, whether any transmitter is heard there, and if so, which one, has been recently investigated in several papers. These planar data structures are constructed in time at least quadratic in n and support logarithmic-time approximate queries. Moreover, the performance of some of the proposed structures depends strongly not only on the number n of transmitters and on the approximation parameter ε, but also on some geometric parameters that cannot be bounded a priori as a function of n or ε. In this paper, we address the question of batched point location queries, i. e., answering many queries simultaneously. Specifically, in one dimension, we can answer n queries exactly in amortized polylogarithmic time per query, while in the plane we can do it approximately. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and ε. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.

    Original languageEnglish (US)
    Title of host publicationAutomata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings
    PublisherSpringer Verlag
    Pages65-77
    Number of pages13
    Volume9134
    ISBN (Print)9783662476710
    DOIs
    StatePublished - 2015
    Event42nd International Colloquium on Automata, Languages and Programming, ICALP 2015 - Kyoto, Japan
    Duration: Jul 6 2015Jul 10 2015

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9134
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other42nd International Colloquium on Automata, Languages and Programming, ICALP 2015
    CountryJapan
    CityKyoto
    Period7/6/157/10/15

    Fingerprint

    Point Location
    Transmitter
    Transmitters
    Diagram
    Query
    Data structures
    Data Structures
    Computational geometry
    Efficient Points
    Geometric object
    Computational Geometry
    One Dimension
    Logarithmic
    Assignment
    Partition
    Predict
    Arbitrary
    Approximation
    Model
    Demonstrate

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Aronov, B., & Katz, M. J. (2015). Batched point location in sinr diagrams via algebraic tools. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings (Vol. 9134, pp. 65-77). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9134). Springer Verlag. https://doi.org/10.1007/978-3-662-47672-7_6

    Batched point location in sinr diagrams via algebraic tools. / Aronov, Boris; Katz, Matthew J.

    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Vol. 9134 Springer Verlag, 2015. p. 65-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9134).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B & Katz, MJ 2015, Batched point location in sinr diagrams via algebraic tools. in Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. vol. 9134, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9134, Springer Verlag, pp. 65-77, 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan, 7/6/15. https://doi.org/10.1007/978-3-662-47672-7_6
    Aronov B, Katz MJ. Batched point location in sinr diagrams via algebraic tools. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Vol. 9134. Springer Verlag. 2015. p. 65-77. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-47672-7_6
    Aronov, Boris ; Katz, Matthew J. / Batched point location in sinr diagrams via algebraic tools. Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Vol. 9134 Springer Verlag, 2015. pp. 65-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{5c913ac6386848b9a9e571a8a0bb25b9,
    title = "Batched point location in sinr diagrams via algebraic tools",
    abstract = "The SINR model for the quality of wireless connections has been the subject of extensive recent study. It attempts to predict whether a particular transmitter is heard at a specific location, in a setting consisting of n simultaneous transmitters and background noise. The SINR model gives rise to a natural geometric object, the SINR diagram, which partitions the space into n regions where each of the transmitters can be heard and the remaining space where no transmitter can be heard. Efficient point location in the SINR diagram, i. e., being able to build a data structure that facilitates determining, for a query point, whether any transmitter is heard there, and if so, which one, has been recently investigated in several papers. These planar data structures are constructed in time at least quadratic in n and support logarithmic-time approximate queries. Moreover, the performance of some of the proposed structures depends strongly not only on the number n of transmitters and on the approximation parameter ε, but also on some geometric parameters that cannot be bounded a priori as a function of n or ε. In this paper, we address the question of batched point location queries, i. e., answering many queries simultaneously. Specifically, in one dimension, we can answer n queries exactly in amortized polylogarithmic time per query, while in the plane we can do it approximately. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and ε. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.",
    author = "Boris Aronov and Katz, {Matthew J.}",
    year = "2015",
    doi = "10.1007/978-3-662-47672-7_6",
    language = "English (US)",
    isbn = "9783662476710",
    volume = "9134",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "65--77",
    booktitle = "Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings",

    }

    TY - GEN

    T1 - Batched point location in sinr diagrams via algebraic tools

    AU - Aronov, Boris

    AU - Katz, Matthew J.

    PY - 2015

    Y1 - 2015

    N2 - The SINR model for the quality of wireless connections has been the subject of extensive recent study. It attempts to predict whether a particular transmitter is heard at a specific location, in a setting consisting of n simultaneous transmitters and background noise. The SINR model gives rise to a natural geometric object, the SINR diagram, which partitions the space into n regions where each of the transmitters can be heard and the remaining space where no transmitter can be heard. Efficient point location in the SINR diagram, i. e., being able to build a data structure that facilitates determining, for a query point, whether any transmitter is heard there, and if so, which one, has been recently investigated in several papers. These planar data structures are constructed in time at least quadratic in n and support logarithmic-time approximate queries. Moreover, the performance of some of the proposed structures depends strongly not only on the number n of transmitters and on the approximation parameter ε, but also on some geometric parameters that cannot be bounded a priori as a function of n or ε. In this paper, we address the question of batched point location queries, i. e., answering many queries simultaneously. Specifically, in one dimension, we can answer n queries exactly in amortized polylogarithmic time per query, while in the plane we can do it approximately. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and ε. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.

    AB - The SINR model for the quality of wireless connections has been the subject of extensive recent study. It attempts to predict whether a particular transmitter is heard at a specific location, in a setting consisting of n simultaneous transmitters and background noise. The SINR model gives rise to a natural geometric object, the SINR diagram, which partitions the space into n regions where each of the transmitters can be heard and the remaining space where no transmitter can be heard. Efficient point location in the SINR diagram, i. e., being able to build a data structure that facilitates determining, for a query point, whether any transmitter is heard there, and if so, which one, has been recently investigated in several papers. These planar data structures are constructed in time at least quadratic in n and support logarithmic-time approximate queries. Moreover, the performance of some of the proposed structures depends strongly not only on the number n of transmitters and on the approximation parameter ε, but also on some geometric parameters that cannot be bounded a priori as a function of n or ε. In this paper, we address the question of batched point location queries, i. e., answering many queries simultaneously. Specifically, in one dimension, we can answer n queries exactly in amortized polylogarithmic time per query, while in the plane we can do it approximately. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and ε. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.

    UR - http://www.scopus.com/inward/record.url?scp=84946076419&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84946076419&partnerID=8YFLogxK

    U2 - 10.1007/978-3-662-47672-7_6

    DO - 10.1007/978-3-662-47672-7_6

    M3 - Conference contribution

    SN - 9783662476710

    VL - 9134

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 65

    EP - 77

    BT - Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings

    PB - Springer Verlag

    ER -