Sciweavers

Share
INFOCOM
2006
IEEE

Relay Placement for Higher Order Connectivity in Wireless Sensor Networks

9 years 6 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g, due to failures of some sensors, or loss of battery power). In this paper we consider the problem of adding the smallest number of additional (relay) nodes so that the induced communication graph is 2-connected1 . The problem is NP-hard. In this paper we develop O(1)-approximation algorithms that find close to optimal solutions in time O((kn)2 ) for achieving k-edge connectivity of n nodes. The worst case approximation guarantee is 10, but the algorithm produces solutions that are far better than this bound suggests. We also consider extensions to higher dimensions, and the scheme that we develop for points in the plane, yields a bound of 2dMST where dMST is the maximum degree of a minimum-degree Minimum Spanning Tree in d dimensions using Euclidean metrics. In addition, our methods extend with the same ap...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where INFOCOM
Authors Abhishek Kashyap, Samir Khuller, Mark A. Shayman
Comments (0)
books