Target counting is an established challenge for sensor networks: given a set of sensors that can count (but not identify) targets, how many targets are there? The problem is complicated because of the need to disambiguate duplicate observations of the same target by different sensors. A number of approaches have been proposed in the literature, and in this paper we take an existing technique based on Euler integration and develop a fully-distributed, self-stabilising solution. We derive our algorithm within the field calculus from the centralised presentation of the underlying integration technique, and analyse the precision of the counting through simulation of several network configurations.
Self-Stabilising Target Counting in Wireless Sensor Networks Using Euler Integration / Pianini, Danilo; Dobson, Simon; Viroli, Mirko. - STAMPA. - (2017), pp. 8064025.11-8064025.20. (Intervento presentato al convegno 11th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2017 tenutosi a Tucson, AZ nel 2017) [10.1109/SASO.2017.10].
Self-Stabilising Target Counting in Wireless Sensor Networks Using Euler Integration
Pianini, Danilo;Viroli, Mirko
2017
Abstract
Target counting is an established challenge for sensor networks: given a set of sensors that can count (but not identify) targets, how many targets are there? The problem is complicated because of the need to disambiguate duplicate observations of the same target by different sensors. A number of approaches have been proposed in the literature, and in this paper we take an existing technique based on Euler integration and develop a fully-distributed, self-stabilising solution. We derive our algorithm within the field calculus from the centralised presentation of the underlying integration technique, and analyse the precision of the counting through simulation of several network configurations.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
