JOURNAL ARTICLE

A cooperative single target tracking algorithm using binary sensor networks

Abstract

Sensor networks include large number of low cost sensor nodes with small processing capabilities that are deployed over an area in an attempt to do interest sensing task. In this paper we examine the role of very simple and noisy sensors for distributed tracking problem that is one of these tasks. We use a proposed binary sensor model, where each sensorpsilas value is converted reliably to one bit of information only: whether the object is moving toward the sensor or away from it and propose a cooperative distributed algorithm that can be used in real-time tracking and is efficient in power and bandwidth. We show that how an estimator sensor use information from its neighbors to estimate target location more accurately. Our extensive simulations show low error in low density sensor networks.

Keywords:
Wireless sensor network Computer science Estimator Binary number Tracking (education) Brooks–Iyengar algorithm Visual sensor network Bandwidth (computing) Real-time computing Video tracking Algorithm Block (permutation group theory) Key distribution in wireless sensor networks Object (grammar) Artificial intelligence Computer network Wireless Wireless network Mathematics Telecommunications

Metrics

1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
20
Refs
0.09
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Target Tracking and Data Fusion in Sensor Networks
Physical Sciences →  Computer Science →  Artificial Intelligence
Distributed Sensor Networks and Detection Algorithms
Physical Sciences →  Computer Science →  Computer Networks and Communications
Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.