Efficient algorithms for network localization using cores of underlying graphs

Meng Li, Yota Otachi, Takeshi Tokuyama

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル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
ページ101-114
ページ数14
DOI
出版ステータスPublished - 2012
イベント7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011 - Saarbrucken, Germany
継続期間: 2011 9月 82011 9月 9

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7111 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

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

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Efficient algorithms for network localization using cores of underlying graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル