Batched point location in SINR Diagrams via algebraic tools

Boris Aronov, Matthew J. Katz

    Research output: Contribution to journalArticle

    Abstract

    The SINR (Signal to Interference plus Noise Ratio) 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 articles. 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 article, 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. In another result, we show how to answer n2 queries exactly in amortized polylogarithmic time per query, assuming the queries are located on a possibly non-uniform n ~ n grid. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and We also show how to speed up the preprocessing in a previously proposed point-location structure in SINR diagram for uniform-power sites, by almost a full order of magnitude. For this, we obtain results on the sensitivity of the reception regions to slight changes in the reception threshold, which are of independent interest. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.

    Original languageEnglish (US)
    Article number41
    JournalACM Transactions on Algorithms
    Volume14
    Issue number4
    DOIs
    StatePublished - Aug 1 2018

    Fingerprint

    Point Location
    Diagram
    Interference
    Query
    Transmitter
    Data Structures
    Efficient Points
    Geometric object
    Computational Geometry
    One Dimension
    Preprocessing
    Logarithmic
    Speedup
    Assignment
    Partition
    Grid
    Predict

    Keywords

    • Algebraic Methods
    • Batched Point Location
    • Fast Polynomial Multiplication
    • Fast Polynomial Multipoint Evaluation
    • Range Searching
    • Sinr Diagram
    • Sinr Model
    • Wireless Networks

    ASJC Scopus subject areas

    • Mathematics (miscellaneous)

    Cite this

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

    In: ACM Transactions on Algorithms, Vol. 14, No. 4, 41, 01.08.2018.

    Research output: Contribution to journalArticle

    Aronov, Boris ; Katz, Matthew J. / Batched point location in SINR Diagrams via algebraic tools. In: ACM Transactions on Algorithms. 2018 ; Vol. 14, No. 4.
    @article{394b9edc6cf446da81c087f242e6f2f5,
    title = "Batched point location in SINR Diagrams via algebraic tools",
    abstract = "The SINR (Signal to Interference plus Noise Ratio) 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 articles. 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 article, 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. In another result, we show how to answer n2 queries exactly in amortized polylogarithmic time per query, assuming the queries are located on a possibly non-uniform n ~ n grid. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and We also show how to speed up the preprocessing in a previously proposed point-location structure in SINR diagram for uniform-power sites, by almost a full order of magnitude. For this, we obtain results on the sensitivity of the reception regions to slight changes in the reception threshold, which are of independent interest. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.",
    keywords = "Algebraic Methods, Batched Point Location, Fast Polynomial Multiplication, Fast Polynomial Multipoint Evaluation, Range Searching, Sinr Diagram, Sinr Model, Wireless Networks",
    author = "Boris Aronov and Katz, {Matthew J.}",
    year = "2018",
    month = "8",
    day = "1",
    doi = "10.1145/3209678",
    language = "English (US)",
    volume = "14",
    journal = "ACM Transactions on Algorithms",
    issn = "1549-6325",
    publisher = "Association for Computing Machinery (ACM)",
    number = "4",

    }

    TY - JOUR

    T1 - Batched point location in SINR Diagrams via algebraic tools

    AU - Aronov, Boris

    AU - Katz, Matthew J.

    PY - 2018/8/1

    Y1 - 2018/8/1

    N2 - The SINR (Signal to Interference plus Noise Ratio) 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 articles. 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 article, 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. In another result, we show how to answer n2 queries exactly in amortized polylogarithmic time per query, assuming the queries are located on a possibly non-uniform n ~ n grid. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and We also show how to speed up the preprocessing in a previously proposed point-location structure in SINR diagram for uniform-power sites, by almost a full order of magnitude. For this, we obtain results on the sensitivity of the reception regions to slight changes in the reception threshold, which are of independent interest. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.

    AB - The SINR (Signal to Interference plus Noise Ratio) 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 articles. 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 article, 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. In another result, we show how to answer n2 queries exactly in amortized polylogarithmic time per query, assuming the queries are located on a possibly non-uniform n ~ n grid. All these results can handle arbitrary power assignments to the transmitters. Moreover, the amortized query time in these results depends only on n and We also show how to speed up the preprocessing in a previously proposed point-location structure in SINR diagram for uniform-power sites, by almost a full order of magnitude. For this, we obtain results on the sensitivity of the reception regions to slight changes in the reception threshold, which are of independent interest. Finally, these results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.

    KW - Algebraic Methods

    KW - Batched Point Location

    KW - Fast Polynomial Multiplication

    KW - Fast Polynomial Multipoint Evaluation

    KW - Range Searching

    KW - Sinr Diagram

    KW - Sinr Model

    KW - Wireless Networks

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

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

    U2 - 10.1145/3209678

    DO - 10.1145/3209678

    M3 - Article

    AN - SCOPUS:85049792366

    VL - 14

    JO - ACM Transactions on Algorithms

    JF - ACM Transactions on Algorithms

    SN - 1549-6325

    IS - 4

    M1 - 41

    ER -