Exact algorithms to minimize interference in wireless sensor networks

  • Authors:

  • Haisheng Tan;Tiancheng Lou;Yuexuan Wang;Qiang-Sheng Hua;Francis C. M. Lau

  • Affiliations:

  • Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, 100084, China;Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, 100084, China;Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, 100084, China;Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, 100084, China;Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong, China

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 5.23

Visualization

Abstract

Finding 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(n^3@D), where n is the number of nodes and @D is the maximum node degree. The second one is an exact algorithm to minimize the maximum interference in sub-exponential time, O(n^3@D^O^(^k^)), where k=O(@D) is the minimum maximum interference. All the optimal topologies constructed are planar.