TY - GEN
T1 - Efficient algorithms for network localization using cores of underlying graphs
AU - Li, Meng
AU - Otachi, Yota
AU - Tokuyama, Takeshi
PY - 2012
Y1 - 2012
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 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.
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 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.
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=84863130796&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863130796&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-28209-6_9
DO - 10.1007/978-3-642-28209-6_9
M3 - Conference contribution
AN - SCOPUS:84863130796
SN - 9783642282089
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 101
EP - 114
BT - Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Revised Selected Papers
T2 - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011
Y2 - 8 September 2011 through 9 September 2011
ER -