Efficient algorithms for network localization using cores of underlying graphs

Abstract

Network localization is important for networks with no prefixed positions of network nodes such as sensor networks. We are given a subset of the set of pairwise distances among n sensors in some Euclidean space. We want to determine the positions of each sensors from the (partial) distance information. The input can be seen as an edge weighted graph. In this paper, we present some efficient algorithms that solve this problem using the structures of input graphs, which we call the cores of them. For instance, we present a polynomial-time algorithm solving the network localization problem for graphs with connected dominating sets of bounded size. This algorithm allows us to have an FPT algorithm for some restricted instances such as graphs with connected vertex covers of bounded size. © 2012 Springer-Verlag.