Formalising Sensor Topologies for Target Counting

Sven Linker
(University of Liverpool)
Michele Sevegnani
(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.

In Danilo Pianini and Guido Salvaneschi: Proceedings First Workshop on Architectures, Languages and Paradigms for IoT (ALP4IoT 2017), Turin, Italy, September 18, 2017, Electronic Proceedings in Theoretical Computer Science 264, pp. 43–57.
Published: 3rd February 2018.

ArXived at: http://dx.doi.org/10.4204/EPTCS.264.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org