Relay Placement for Two-Connectivity

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.
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01531964
Contributor : Hal Ifip <>
Submitted on : Friday, June 2, 2017 - 11:23:22 AM
Last modification on : Wednesday, February 13, 2019 - 11:00:06 AM
Document(s) archivé(s) le : Wednesday, December 13, 2017 - 9:04:23 AM

File

978-3-642-30054-7_29_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

39

Files downloads

59