Minimizing the Aggregate Movements for Interval Coverage

TL;DR

This paper introduces an optimal $O(n \,\log n)$ algorithm for minimizing total movement in an interval coverage problem on a line, improving over the previous $O(n^2)$ solution, with applications in wireless sensor networks.

Contribution

The paper presents a new $O(n \,\log n)$ algorithm for the interval coverage problem, establishing its optimality through a matching lower bound.

Findings

Achieved an $O(n \,\log n)$ time complexity for the problem.

Proved an $\,\Omega(n \,\log n)$ lower bound, confirming the algorithm's optimality.

Enhanced understanding of geometric coverage problems and their computational limits.

Abstract

We consider an interval coverage problem. Given $n$ intervals of the same length on a line $L$ and a line segment $B$ on $L$, we want to move the intervals along $L$ such that every point of $B$ is covered by at least one interval and the sum of the moving distances of all intervals is minimized. As a basic geometry problem, it has applications in mobile sensor barrier coverage in wireless sensor networks. The previous work solved the problem in $O(n^2)$ time. In this paper, by discovering many interesting observations and developing new algorithmic techniques, we present an $O(n\log n)$ time algorithm. We also show an $\Omega(n\log n)$ time lower bound for this problem, which implies the optimality of our algorithm.