Relay placement for fault tolerance in wireless networks in higher dimensions

In this paper we consider the problem of adding the smallest number of additional (relay) nodes to a network of static nodes with limited communication range so that the induced communication graph is 2-connected (we consider both edge and vertex connectivity). The problem is NP-hard. We develop alg...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational geometry : theory and applications 2011-05, Vol.44 (4), p.206-215
Hauptverfasser:	Kashyap, Abhishek, Khuller, Samir, Shayman, Mark
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Dimensional tolerances Fault tolerance Graphs Mathematical analysis Network connectivity Networks Optimization Placement Relay
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!