Batched Point Location in SINR Diagrams via Algebraic Tools

Author:

Aronov Boris1ORCID,Katz Matthew J.2

Affiliation:

1. New York University, NY, USA

2. Ben-Gurion University, Beer-Sheva, Israel

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 n 2 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.

Funder

National Science Foundation

United States-Israel Binational Science Foundation

Israel Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication;ACM Transactions on Algorithms;2023-01-31

2. Eccentricity queries and beyond using hub labels;Theoretical Computer Science;2022-09

3. Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth;ACM Transactions on Algorithms;2022-03-04

4. Computing Shapley Values in the Plane;Discrete & Computational Geometry;2022-02-22

5. Resolving SINR Queries in a Dynamic Setting;SIAM Journal on Computing;2020-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3