Linker, S. and Sevegnani, M. (2019) Target counting with Presburger constraints and its application in sensor networks. Proceedings of the Royal Society of London Series A: Mathematical, Physical and Engineering Sciences, 475, 20190278. (doi: 10.1098/rspa.2019.0278)
|
Text
198738.pdf - Published Version Available under License Creative Commons Attribution. 937kB |
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: | Articles |
---|---|
Additional Information: | Also funded by EP/L024845/1. |
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Sevegnani, Dr Michele |
Authors: | Linker, S., and Sevegnani, M. |
College/School: | College of Science and Engineering > School of Computing Science |
Journal Name: | Proceedings of the Royal Society of London Series A: Mathematical, Physical and Engineering Sciences |
Publisher: | The Royal Society |
ISSN: | 1364-5021 |
ISSN (Online): | 1471-2946 |
Published Online: | 06 November 2019 |
Copyright Holders: | Copyright © 2019 The Authors |
First Published: | First published in Proceedings of the Royal Society of London Series A: Mathematical, Physical and Engineering Sciences 475:20190278 |
Publisher Policy: | Reproduced under a Creative Commons license |
University Staff: Request a correction | Enlighten Editors: Update this record