skip to main content
research-article
Public Access

Batched Point Location in SINR Diagrams via Algebraic Tools

Published:09 August 2018Publication History
Skip Abstract Section

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.

References

  1. Deepak Ajwani, Saurabh Ray, Raimund Seidel, and Hans Raj Tiwary. 2007. On computing the centroid of the vertices of an arrangement and related problems. In Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS’07). 519--528. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Andrews and M. Dinitz. 2009. Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM’09). 1332--1340.Google ScholarGoogle Scholar
  3. Boris Aronov and Matthew J. Katz. 2015. Batched point location in SINR diagrams via algebraic tools. In Proceedings of Automata, Languages, and Programming—42nd International Colloquium (ICALP’15), Part I. 65--77. See also arXiv:1412.0962 {cs.CG}, 2014.Google ScholarGoogle Scholar
  4. Rom Aschner, Gui Citovsky, and Matthew J. Katz. 2014. Exploiting geometry in the SINRk model. In Proceedings of Algorithms for Sensor Systems—10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS’14). 125--135.Google ScholarGoogle Scholar
  5. Franz Aurenhammer. 1986. The one-dimensional weighted Voronoi diagram. Inform. Process. Lett. 22, 3 (1986), 119--123. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Franz Aurenhammer and Herbert Edelsbrunner. 1984. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Patt. Recog. 17, 2 (1984), 251--257.Google ScholarGoogle ScholarCross RefCross Ref
  7. Franz Aurenhammer, Rolf Klein, and D.-T. Lee. 2013. Voronoi Diagrams and Delaunay Triangulations. World Scientific. http://www.worldscientific.com/worldscibooks/10.1142/8685. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, and David Peleg. 2017. SINR diagram with interference cancellation. Ad Hoc Netw. 54 (2017), 1--16. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, and Liam Roditty. 2012. SINR diagrams: Convexity and its applications in wireless networks. J. ACM 59, 4, Article 18 (2012), 34 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Dario Bini and Victor Y. Pan. 1994. Polynomial and Matrix Computations, Vol. 1: Fundamental Algorithms. Birkhäuser. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. de Berg, O. Cheong, M. van Kreveld, and M. H. Overmars. 2008. Computational Geometry: Algorithms and Applications (3rd ed.). Springer-Verlag, Berlin. http://www.cs.ruu.nl/geobook. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Edelsbrunner and R. Seidel. 1986. Voronoi diagrams and arrangements. Discrete Comput. Geom. 1 (1986), 25--44. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. O. Goussevskaia, M. M. Halldórsson, R. Wattenhofer, and E. Welzl. 2009. Capacity of arbitrary wireless networks. In Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM’09). 1872--1880.Google ScholarGoogle Scholar
  14. O. Goussevskaia, Y. A. Oswald, and R. Wattenhofer. 2007. Complexity in geometric SINR. In Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’07). 100--109. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P. Gupta and P. R. Kumar. 2000. The capacity of wireless networks. IEEE Trans. Inform. Theor. 46, 2 (2000), 388--404. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. M. Halldórsson. 2012. Wireless scheduling with power control. ACM Trans. Algorithms 9, 1 (2012), 7:1--7:20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. M. Halldórsson and P. Mitra. 2011. Wireless capacity with oblivious power in general metrics. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 1538--1548. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. M. M. Halldórsson and R. Wattenhofer. 2009. Wireless communication is in APX. In Proceedings Automata, Languages and Programming—36th International Colloquium (ICALP’09), Part I. 525--536. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Sariel Har-Peled and Nirman Kumar. 2015. Approximating minimization diagrams and generalized proximity search. SIAM J. Comput. 44, 4 (2015), 944--974.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Erez Kantor, Zvi Lotker, Merav Parter, and David Peleg. 2011. The topology of wireless communication. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). 383--392. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. T. Kesselheim. 2011. A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 1549--1559. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Zvi Lotker and David Peleg. 2010. Structure and algorithms in the SINR wireless model. SIGACT News 41, 2 (2010), 74--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Guillaume Moroz and Boris Aronov. 2016. Computing the distance between piecewise-linear bivariate functions. ACM Trans. Algorithms 12, 1 (2016), 3:1--3:13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. T. Moscibroda and R. Wattenhofer. 2006. The complexity of connectivity in wireless networks. In Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM’06). 25--37.Google ScholarGoogle Scholar
  25. Michael Nüsken and Martin Ziegler. 2004. Fast multipoint evaluation of bivariate polynomials. In Proceedins 12th European Symposium on Algorithms (ESA’04). 544--555.Google ScholarGoogle ScholarCross RefCross Ref
  26. Victor Y. Pan. 1994. Simple multivariate polynomial multiplication. J. Symb. Comput. 18, 3 (1994), 183--186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. M. Sharir and P. K. Agarwal. 1995. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York. http://us.cambridge.org/titles/catalogue.asp?isbn=0521470250. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Joachim von zur Gathen. 1999. Modern Computer Algebra. Cambridge University Press, Cambridge. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. P.-J. Wan, X. Jia, and F. F. Yao. 2009. Maximum independent set of links under physical interference model. In Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (WASA’09). 169--178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Martin Ziegler. 2003. Fast relative approximation of potential fields. In Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS’03). 140--149.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Batched Point Location in SINR Diagrams via Algebraic Tools

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Algorithms
          ACM Transactions on Algorithms  Volume 14, Issue 4
          October 2018
          445 pages
          ISSN:1549-6325
          EISSN:1549-6333
          DOI:10.1145/3266298
          Issue’s Table of Contents

          Copyright © 2018 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 August 2018
          • Revised: 1 April 2018
          • Accepted: 1 April 2018
          • Received: 1 January 2017
          Published in talg Volume 14, Issue 4

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format