Distributed Detection of Binary Decisions with Collisions in a Large, Random Network.

摘要

We consider the problem of distributed detection in a large network of sensors under network communication constraints. Sensor nodes are randomly deployed and follow a random sleep/wake schedule. When awake, sensor nodes perform local detection tests and communicate detections over a multiple-access channel to a fusion center. The fusion center can detect both successful communications and communication collisions in the channel. We derive fusion rules for perfect communications and a delay-constrained protocol and show that each are functions of count statistics only. We derive analytical expressions that characterize the performance of the system in terms of energy consumption and detection probability. Simulation examples compare theoretical predictions with numerical results.