Ecient Algorithms for Synchronizing Localization Sensors under Interval Uncertainty

Research output: Contribution to journalArticleResearch

Authors

Research Organisations

External Research Organisations

  • University of Texas at El Paso
View graph of relations

Details

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalReliable Computing
Volume27
Publication statusPublished - Jun 2020

Abstract

In this paper, we show that a practical need for synchronization of localization sensors leads to an interval-uncertainty problem. In principle, this problem can be solved by using the general linear programming algorithms, but this would take a long time – and this time is not easy to decrease, e.g., by parallelization since linear programming is known to be provably hard to parallelize. To solve the corresponding problem, we propose more efficient and easy-to-parallelize algorithms.

Cite this

Ecient Algorithms for Synchronizing Localization Sensors under Interval Uncertainty. / Voges, R.; Wagner, B.; Kreinovich, V.
In: Reliable Computing, Vol. 27, 06.2020, p. 1-11.

Research output: Contribution to journalArticleResearch

Voges R, Wagner B, Kreinovich V. Ecient Algorithms for Synchronizing Localization Sensors under Interval Uncertainty. Reliable Computing. 2020 Jun;27:1-11.
Voges, R. ; Wagner, B. ; Kreinovich, V. / Ecient Algorithms for Synchronizing Localization Sensors under Interval Uncertainty. In: Reliable Computing. 2020 ; Vol. 27. pp. 1-11.
Download
@article{c6712271ba9f4bd3a296bdcab11ac751,
title = "Ecient Algorithms for Synchronizing Localization Sensors under Interval Uncertainty",
abstract = "In this paper, we show that a practical need for synchronization of localization sensors leads to an interval-uncertainty problem. In principle, this problem can be solved by using the general linear programming algorithms, but this would take a long time – and this time is not easy to decrease, e.g., by parallelization since linear programming is known to be provably hard to parallelize. To solve the corresponding problem, we propose more efficient and easy-to-parallelize algorithms.",
author = "R. Voges and B. Wagner and V. Kreinovich",
note = "This work was performed when Vladik was a visiting researcher with the Geodetic Institute of the Leibniz University of Hannover, a visit supported by the German Research Foundation. This work was also supported in part by the US National Science Foundation (NSF) grant HRD-1242122 and by the German Research Foundation (DFG) as part of the DFG Research Training Group GRK2159 {"}i.c.sens - Integrity and Collaboration in dynamic sensor networks{"}.",
year = "2020",
month = jun,
language = "English",
volume = "27",
pages = "1--11",

}

Download

TY - JOUR

T1 - Ecient Algorithms for Synchronizing Localization Sensors under Interval Uncertainty

AU - Voges, R.

AU - Wagner, B.

AU - Kreinovich, V.

N1 - This work was performed when Vladik was a visiting researcher with the Geodetic Institute of the Leibniz University of Hannover, a visit supported by the German Research Foundation. This work was also supported in part by the US National Science Foundation (NSF) grant HRD-1242122 and by the German Research Foundation (DFG) as part of the DFG Research Training Group GRK2159 "i.c.sens - Integrity and Collaboration in dynamic sensor networks".

PY - 2020/6

Y1 - 2020/6

N2 - In this paper, we show that a practical need for synchronization of localization sensors leads to an interval-uncertainty problem. In principle, this problem can be solved by using the general linear programming algorithms, but this would take a long time – and this time is not easy to decrease, e.g., by parallelization since linear programming is known to be provably hard to parallelize. To solve the corresponding problem, we propose more efficient and easy-to-parallelize algorithms.

AB - In this paper, we show that a practical need for synchronization of localization sensors leads to an interval-uncertainty problem. In principle, this problem can be solved by using the general linear programming algorithms, but this would take a long time – and this time is not easy to decrease, e.g., by parallelization since linear programming is known to be provably hard to parallelize. To solve the corresponding problem, we propose more efficient and easy-to-parallelize algorithms.

M3 - Article

VL - 27

SP - 1

EP - 11

JO - Reliable Computing

JF - Reliable Computing

SN - 1385-3139

ER -

By the same author(s)