On interference among moving sensors and related problems

Jean Lou De Carufel, Matthew J. Katz, Matias Korman, André Van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We show that for any set of n moving points in Rd and any parameter 2 ≤ k ≤ n, one can select a fixed non-empty subset of the points of size O(k log k), such that the Voronoi diagram of this subset is "balanced" at any given time (i.e., it contains O(n/k) points per cell). We also show that the bound O(k log k) is near optimal even for the one dimensional case in which points move linearly in time. As an application, we show that one can assign communication radii to the sensors of a network of n moving sensors so that at any given time, their interference is O(√n log n). This is optimal up to an O(√log n) factor.

Original languageEnglish
Title of host publication24th Annual European Symposium on Algorithms, ESA 2016
EditorsChristos Zaroliagis, Piotr Sankowski
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770156
DOIs
StatePublished - 1 Aug 2016
Event24th Annual European Symposium on Algorithms, ESA 2016 - Aarhus, Denmark
Duration: 22 Aug 201624 Aug 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume57
ISSN (Print)1868-8969

Conference

Conference24th Annual European Symposium on Algorithms, ESA 2016
Country/TerritoryDenmark
CityAarhus
Period22/08/1624/08/16

Keywords

  • Facility location
  • Interference minimization
  • Moving points
  • Range spaces
  • Voronoi diagrams

Fingerprint

Dive into the research topics of 'On interference among moving sensors and related problems'. Together they form a unique fingerprint.

Cite this