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 Citations (Scopus)

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

Fingerprint

Approximation algorithms
Relay
Placement
Approximation Algorithms
Sensors
Distance formula
Euclidean plane

Keywords

  • Approximation algorithm
  • Biconnectivity
  • Steiner points
  • Wireless network

ASJC Scopus subject areas

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

Cite this

Improved approximation algorithms for single-tiered relay placement. / Calinescu, Gruia; Grimmer, Benjamin; Misra, Satyajayant; Tongngam, Sutep; Xue, Guoliang; Zhang, Weiyi.

In: Journal of Combinatorial Optimization, Vol. 31, No. 3, 01.04.2016, p. 1280-1297.

Research output: Contribution to journalArticle

Calinescu, G, Grimmer, B, Misra, S, Tongngam, S, Xue, G & Zhang, W 2016, 'Improved approximation algorithms for single-tiered relay placement', Journal of Combinatorial Optimization, vol. 31, no. 3, pp. 1280-1297. https://doi.org/10.1007/s10878-014-9823-0
Calinescu, Gruia ; Grimmer, Benjamin ; Misra, Satyajayant ; Tongngam, Sutep ; Xue, Guoliang ; Zhang, Weiyi. / Improved approximation algorithms for single-tiered relay placement. In: Journal of Combinatorial Optimization. 2016 ; Vol. 31, No. 3. pp. 1280-1297.
@article{96d1496db52949c18f71ffb478e7d6ff,
title = "Improved approximation algorithms for single-tiered relay placement",
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.",
keywords = "Approximation algorithm, Biconnectivity, Steiner points, Wireless network",
author = "Gruia Calinescu and Benjamin Grimmer and Satyajayant Misra and Sutep Tongngam and Guoliang Xue and Weiyi Zhang",
year = "2016",
month = "4",
day = "1",
doi = "10.1007/s10878-014-9823-0",
language = "English (US)",
volume = "31",
pages = "1280--1297",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Improved approximation algorithms for single-tiered relay placement

AU - Calinescu, Gruia

AU - Grimmer, Benjamin

AU - Misra, Satyajayant

AU - Tongngam, Sutep

AU - Xue, Guoliang

AU - Zhang, Weiyi

PY - 2016/4/1

Y1 - 2016/4/1

N2 - 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.

AB - 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.

KW - Approximation algorithm

KW - Biconnectivity

KW - Steiner points

KW - Wireless network

UR - http://www.scopus.com/inward/record.url?scp=84961059767&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961059767&partnerID=8YFLogxK

U2 - 10.1007/s10878-014-9823-0

DO - 10.1007/s10878-014-9823-0

M3 - Article

AN - SCOPUS:84961059767

VL - 31

SP - 1280

EP - 1297

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 3

ER -