Minimizing interference for the highway model in wireless ad-hoc and sensor networks

  • Authors:
  • Haisheng Tan;Tiancheng Lou;Francis C. M. Lau;Yuexuan Wang;Shiteng Chen

  • Affiliations:
  • Department of Computer Science, The University of Hong Kong, Hong Kong, China;Institute for Theoretical Computer Science, Tsinghua University, Beijing, China;Department of Computer Science, The University of Hong Kong, Hong Kong, China;Institute for Theoretical Computer Science, Tsinghua University, Beijing, China;Institute for Theoretical Computer Science, Tsinghua University, Beijing, China

  • Venue:
  • SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Finding a low-interference connected topology is one of the fundamental problems in wireless ad-hoc and sensor networks. The receiver-centric interference on a node is the number of other nodes whose transmission ranges cover the node. The problem of reducing interference through adjusting the nodes' transmission ranges in a connected network can be formulated as that of connecting the nodes by a spanning tree while minimizing interference. 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. Two exact algorithms are proposed. One constructs the optimal topology that minimizes the average interference among all the nodes in polynomial time, O(n3Δ3), where n is the number of nodes and Δ is the maximum node degree. The other algorithm constructs the optimal topology that minimizes the maximum interference in sub-exponential time, O(n3ΔO(k)), where k = O(√Δ) is the minimum maximum interference.