TY - JOUR

T1 - Efficient algorithms for network localization using cores of underlying graphs

AU - Li, Meng

AU - Otachi, Yota

AU - Tokuyama, Takeshi

N1 - Publisher Copyright:
© 2014 Elsevier B.V.

PY - 2014

Y1 - 2014

N2 - 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 (n2) pairwise distances among n sensors in some Euclidean space. We want to determine the positions of each sensor 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 their cores. 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 fixed-parameter tractable algorithms for some restricted instances such as graphs with connected vertex covers of bounded size.

AB - 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 (n2) pairwise distances among n sensors in some Euclidean space. We want to determine the positions of each sensor 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 their cores. 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 fixed-parameter tractable algorithms for some restricted instances such as graphs with connected vertex covers of bounded size.

KW - Chordal graph

KW - Connected dominating set

KW - Graph turnpike problem

KW - Network localization

KW - Point set reconstruction

KW - Weighted graph embedding

UR - http://www.scopus.com/inward/record.url?scp=84926278850&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84926278850&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2014.02.020

DO - 10.1016/j.tcs.2014.02.020

M3 - Article

AN - SCOPUS:84926278850

SN - 0304-3975

VL - 553

SP - 18

EP - 26

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - C

ER -