Tracking Markov targets in binary sensor networks: Source coding and large deviation limits on the required number of queries

Abstract

Using concepts from coding theory, we define e-achievability for target tracking in binary sensor networks and compare this to the more usual notion of trackability: a target can be tracked in a binary sensor network through a query mechanism if the tracker obtains the correct target track history at infinitely many times almost surely. Trackability is a… (More)
DOI: 10.1109/ICICS.2011.6173553

1 Figure or Table

Topics

  • Presentations referencing similar topics