Efficient algorithms for network localization using cores of underlying graphs

Meng Li, Yota Otachi, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationAlgorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Revised Selected Papers
Pages101-114
Number of pages14
DOIs
Publication statusPublished - 2012
Event7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011 - Saarbrucken, Germany
Duration: 2011 Sep 82011 Sep 9

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7111 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011
CountryGermany
CitySaarbrucken
Period11/9/811/9/9

Keywords

  • Chordal graph
  • Connected dominating set
  • Graph turnpike problem
  • Network localization
  • Point set reconstruction
  • Weighted graph embedding

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient algorithms for network localization using cores of underlying graphs'. Together they form a unique fingerprint.

Cite this