Distributed Detection with Collisions in a Random, Single-Hop Wireless Sensor Network

Abstract

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 show that the optimum fusion rule is a weighted sum of the number of detections received and the number of collisions detected by the fusion node. We derive analytical expressions that characterize the performance of the system. Simulation examples compare theoretical predictions with numerical results.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 26, 2013
Accession Number
ADA617264

Entities

People

  • Emre Ertin
  • Gene T. Whipps
  • Randolph L. Moses

Organizations

  • University of Michigan

Tags

Communities of Interest

  • Energy and Power Technologies
  • Sensors

DTIC Thesaurus Topics

  • Collisions
  • Computer Access Control
  • Detection
  • Detectors
  • False Alarms
  • Military Research
  • Multiple Access
  • Networks
  • Observation
  • Probability
  • Probability Distributions
  • Random Variables
  • Sensor Networks
  • Warning Systems
  • Wireless Communications
  • Wireless Networks
  • Wireless Sensor Networks

Fields of Study

  • Engineering

Readers

  • Approximation Theory.
  • Radio communications and signal processing.
  • Sensor Fusion and Tracking Systems.