Minimalist counting in sensor networks (Noise helps)

Abstract

We propose a novel algorithm for counting N indistinguishable objects, called targets, by a collection of sensors. We adopt a minimalist scenario where sensors are unaware of the (non-empty) intersections of sensing regions, and so simple addition of all sensor counts inflates estimates of the total number of targets. The multiple counting in intersections… (More)
DOI: 10.1016/j.adhoc.2010.08.010

11 Figures and Tables

Topics

  • Presentations referencing similar topics