Target counting with Presburger constraints and its application in sensor networks

Linker, Sven and Sevegnani, Michele (2019) Target counting with Presburger constraints and its application in sensor networks. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 475 (2231). ISSN 1364-5021

Full text not available from this repository.

Abstract

One of the applications popularized by the emergence of wireless sensor networks is target counting: the computational task of determining the total number of targets located in an area by aggregating the individual counts of each sensor. The complexity of this task lies in the fact that sensing ranges may overlap, and therefore, targets may be overcounted as, in this setting, they are assumed to be indistinguishable from each other. In the literature, this problem has been proven to be unsolvable, hence the existence of several estimation algorithms. However, the main limitation currently affecting these algorithms is that no assurance regarding the precision of a solution can be given. We present a novel algorithm for target counting based on exhaustive enumeration of target distributions using linear Presburger constraints. We improve on current approaches since the estimated counts obtained by our algorithm are by construction guaranteed to be consistent with the counts of each sensor. We further extend our algorithm to allow for weighted topologies and sensing errors for applicability in real-world deployments. We evaluate our approach through an extensive collection of synthetic and real-life configurations.

Item Type:
Journal Article
Journal or Publication Title:
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600
Subjects:
Departments:
ID Code:
147773
Deposited By:
Deposited On:
28 Sep 2020 14:00
Refereed?:
Yes
Published?:
Published
Last Modified:
29 Sep 2020 05:46