Improved approximation algorithms for single-tiered relay placement

Gruia Calinescu, Benjamin Grimmer, Satyajayant Misra, Sutep Tongngam, Guoliang Xue, Weiyi Zhang

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

We consider the problem of Single-Tiered Relay Placement with Basestations, which takes as input a set (Formula presented.) of sensors and a set (Formula presented.) of basestations described as points in a normed space (Formula presented.) , and real numbers (Formula presented.). The objective is to place a minimum cardinality set (Formula presented.) of wireless relay nodes that connects (Formula presented.) and (Formula presented.) according to the following rules. The sensors in (Formula presented.) can communicate within distance (Formula presented.) , relay nodes in (Formula presented.) can communicate within distance (Formula presented.) , and basestations are considered to have an infinite broadcast range. Together the sets (Formula presented.) , and (Formula presented.) induce an undirected graph (Formula presented.) defined as follows: (Formula presented.) and (Formula presented.) and (Formula presented.) and (Formula presented.) and (Formula presented.) and (Formula presented.). Then (Formula presented.) connects (Formula presented.) and (Formula presented.) when this induced graph is connected. In the case of the two-dimensional Euclidean plane, we get a (Formula presented.) -approximation algorithm, improving the previous best ratio of 3.11. Let (Formula presented.) be the maximum number of points on a unit ball with pairwise distance strictly bigger than 1. Under certain assumptions, we have a (Formula presented.) -approximation algorithm. When biconnectivity is required, we show that a variant of our previously proposed algorithm has approximation ratio of (Formula presented.). In the case of the two-dimensional Euclidean plane, our ratio of 7 improves our previous bound of 16.

Original languageEnglish (US)
Pages (from-to)1280-1297
Number of pages18
JournalJournal of Combinatorial Optimization
Volume31
Issue number3
DOIs
StatePublished - Apr 1 2016

Keywords

  • Approximation algorithm
  • Biconnectivity
  • Steiner points
  • Wireless network

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Improved approximation algorithms for single-tiered relay placement'. Together they form a unique fingerprint.

  • Cite this