Relay Placement for Two-Connectivity - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Relay Placement for Two-Connectivity

(1)
1
Gruia Calinescu
  • Function : Author
  • PersonId : 1009374

Abstract

Motivated by applications to wireless sensor networks, we study the following problem. We are given a set S of wireless sensor nodes, given as a multiset of points in a normed space. We must place a minimum-size (multi)set Q of wireless relay nodes in the normed space such that the unit-disk graph induced by Q ∪ S is two-connected. The unit-disk graph of a set of points has an edge between two points if their distance is at most 1.Kashyap, Khuller, and Shayman (Infocom 2006) present algorithms for the two variants of the problem: two-edge-connectivity and biconnectivity. For both they prove an approximation ratio of at most 2 dMST, where dMST is the maximum degree of a minimum-degree Minimum Spanning Tree in the normed space. In the Euclidean two and three dimensional spaces, dMST = 5, and dMST = 13 respectively. We give a tight analysis of the same algorithms, obtaining approximation ratios of dMST for biconnectivity and 2 dMST − 1 for two-edge-connectivity respectively.
Fichier principal
Vignette du fichier
978-3-642-30054-7_29_Chapter.pdf (181.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01531964 , version 1 (02-06-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Gruia Calinescu. Relay Placement for Two-Connectivity. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.366-377, ⟨10.1007/978-3-642-30054-7_29⟩. ⟨hal-01531964⟩
41 View
43 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More