@inproceedings{c6eb1dcd70ba428c896d29665897ae58,
title = "On interference among moving sensors and related problems",
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.",
keywords = "Facility location, Interference minimization, Moving points, Range spaces, Voronoi diagrams",
author = "\{De Carufel\}, \{Jean Lou\} and Katz, \{Matthew J.\} and Matias Korman and \{Van Renssen\}, Andr{\'e} and Marcel Roeloffzen and Shakhar Smorodinsky",
note = "Publisher Copyright: {\textcopyright} Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, Andr{\'e} van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky.; 24th Annual European Symposium on Algorithms, ESA 2016 ; Conference date: 22-08-2016 Through 24-08-2016",
year = "2016",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.ESA.2016.34",
language = "American English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Christos Zaroliagis and Piotr Sankowski",
booktitle = "24th Annual European Symposium on Algorithms, ESA 2016",
address = "Germany",
}