2 research outputs found
Exact algorithms to minimize interference in wireless sensor networks
AbstractFinding a low-interference connected topology is a fundamental problem in wireless sensor networks (WSNs). The problem of reducing interference through adjusting the nodes’ transmission radii in a connected network is one of the most well-known open algorithmic problems in wireless sensor network optimization. In this paper, we study minimization of the average interference and the maximum interference for the highway model, where all the nodes are arbitrarily distributed on a line. First, we prove that there is always an optimal topology with minimum interference that is planar. Then, two exact algorithms are proposed. The first one is an exact algorithm to minimize the average interference in polynomial time, O(n3Δ), where n is the number of nodes and Δ is the maximum node degree. The second one is an exact algorithm to minimize the maximum interference in sub-exponential time, O(n3ΔO(k)), where k=O(Δ) is the minimum maximum interference. All the optimal topologies constructed are planar
Interference Minimization in Asymmetric Sensor Networks
A fundamental problem in wireless sensor networks is to connect a given set
of sensors while minimizing the \emph{receiver interference}. This is modeled
as follows: each sensor node corresponds to a point in and each
\emph{transmission range} corresponds to a ball. The receiver interference of a
sensor node is defined as the number of transmission ranges it lies in. Our
goal is to choose transmission radii that minimize the maximum interference
while maintaining a strongly connected asymmetric communication graph.
For the two-dimensional case, we show that it is NP-complete to decide
whether one can achieve a receiver interference of at most . In the
one-dimensional case, we prove that there are optimal solutions with nontrivial
structural properties. These properties can be exploited to obtain an exact
algorithm that runs in quasi-polynomial time. This generalizes a result by Tan
et al. to the asymmetric case.Comment: 15 pages, 5 figure