Formalising Sensor Topologies for Target Counting

We present a formal model developed to reason about topologies created by sensor ranges. This model is used to formalise the topological aspects of an existing counting algorithm to estimate the number of targets in the area covered by the sensors. To that end, we present a first-order logic tailor...

Full description

Bibliographic Details
Main Authors: Sven Linker, Michele Sevegnani
Format: Article
Language:English
Published: Open Publishing Association 2018-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1802.01791v1
id doaj-36ccb48478924f7e9ea9e2824e296d7b
record_format Article
spelling doaj-36ccb48478924f7e9ea9e2824e296d7b2020-11-25T01:49:22ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802018-02-01264Proc. ALP4IoT 2017435710.4204/EPTCS.264.5:6Formalising Sensor Topologies for Target CountingSven Linker0Michele Sevegnani1 University of Liverpool University of Glasgow We present a formal model developed to reason about topologies created by sensor ranges. This model is used to formalise the topological aspects of an existing counting algorithm to estimate the number of targets in the area covered by the sensors. To that end, we present a first-order logic tailored to specify relations between parts of the space with respect to sensor coverage. The logic serves as a specification language for Hoare-style proofs of correctness of the topological computations of the algorithm, which uncovers ambiguities in their results. Subsequently, we extend the formal model as a step towards improving the estimation of the algorithm. Finally, we sketch how the model can be extended to take mobile sensors and temporal aspects into account.http://arxiv.org/pdf/1802.01791v1
collection DOAJ
language English
format Article
sources DOAJ
author Sven Linker
Michele Sevegnani
spellingShingle Sven Linker
Michele Sevegnani
Formalising Sensor Topologies for Target Counting
Electronic Proceedings in Theoretical Computer Science
author_facet Sven Linker
Michele Sevegnani
author_sort Sven Linker
title Formalising Sensor Topologies for Target Counting
title_short Formalising Sensor Topologies for Target Counting
title_full Formalising Sensor Topologies for Target Counting
title_fullStr Formalising Sensor Topologies for Target Counting
title_full_unstemmed Formalising Sensor Topologies for Target Counting
title_sort formalising sensor topologies for target counting
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2018-02-01
description We present a formal model developed to reason about topologies created by sensor ranges. This model is used to formalise the topological aspects of an existing counting algorithm to estimate the number of targets in the area covered by the sensors. To that end, we present a first-order logic tailored to specify relations between parts of the space with respect to sensor coverage. The logic serves as a specification language for Hoare-style proofs of correctness of the topological computations of the algorithm, which uncovers ambiguities in their results. Subsequently, we extend the formal model as a step towards improving the estimation of the algorithm. Finally, we sketch how the model can be extended to take mobile sensors and temporal aspects into account.
url http://arxiv.org/pdf/1802.01791v1
work_keys_str_mv AT svenlinker formalisingsensortopologiesfortargetcounting
AT michelesevegnani formalisingsensortopologiesfortargetcounting
_version_ 1725006978065891328