License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.145
URN: urn:nbn:de:0030-drops-91495
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9149/
Go to the corresponding LIPIcs Volume Portal


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

Resolving SINR Queries in a Dynamic Setting

pdf-format:
LIPIcs-ICALP-2018-145.pdf (0.6 MB)


Abstract

We consider a set of transmitters broadcasting simultaneously on the same frequency under the SINR model. Transmission power may vary from one transmitter to another, and a signal's strength decreases (path loss or path attenuation) by some constant power alpha of the distance traveled. Roughly, a receiver at a given location can hear a specific transmitter only if the transmitter's signal is stronger than the signal of all other transmitters, combined. An SINR query is to determine whether a receiver at a given location can hear any transmitter, and if yes, which one. An approximate answer to an SINR query is such that one gets a definite yes or definite no, when the ratio between the strongest signal and all other signals combined is well above or well below the reception threshold, while the answer in the intermediate range is allowed to be either yes or no. We describe several compact data structures that support approximate SINR queries in the plane in a dynamic context, i.e., where both queries and updates (insertion or deletion of a transmitter) can be performed efficiently.

BibTeX - Entry

@InProceedings{aronov_et_al:LIPIcs:2018:9149,
  author =	{Boris Aronov and Gali Bar-On and Matthew J. Katz},
  title =	{{Resolving SINR Queries in a Dynamic Setting}},
  booktitle =	{45th International Colloquium on Automata, Languages, and  Programming (ICALP 2018)},
  pages =	{145:1--145:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9149},
  URN =		{urn:nbn:de:0030-drops-91495},
  doi =		{10.4230/LIPIcs.ICALP.2018.145},
  annote =	{Keywords: Wireless networks, SINR, dynamic insertion and deletion, interference cancellation, range searching}
}

Keywords: Wireless networks, SINR, dynamic insertion and deletion, interference cancellation, range searching
Collection: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Issue Date: 2018
Date of publication: 04.07.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI