Scheduling Binary Proximity Sensors for Robust Target Tracking

Author

La Scala, B.F.

Author_Institution

Dept. of Electr. & Electron. Eng., Melbourne Univ., Vic.

fYear

2006

fDate

10-13 July 2006

Firstpage

1

Lastpage

6

Abstract

This paper describes two scheduling algorithms designed to improve target tracking performance in a distributed network of binary proximity sensors. Tracking with such sensors is a difficult problem as they only transmit a single binary digit regarding the presence of a target. In addition, the operational status of these sensors may not be accurately known. This paper describes extensions to a Gaussian mixture-based tracking algorithm which aid in addressing these problems. These extensions reduce computational complexity and improve accuracy by scheduling status queries to selected sensors

Keywords

Gaussian processes; scheduling; target tracking; wireless sensor networks; Gaussian mixture-based tracking algorithm; binary proximity sensor; computational complexity; distributed network; robust target tracking; scheduling algorithm; Bandwidth; Batteries; Computational complexity; Processor scheduling; Robustness; Scheduling algorithm; Sensor phenomena and characterization; Sensor systems; Target tracking; Wireless sensor networks; sensor networks; sensor scheduling; target tracking;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Fusion, 2006 9th International Conference on

Conference_Location

Florence

Print_ISBN

1-4244-0953-5

Electronic_ISBN

0-9721844-6-5

Type

conf

DOI

10.1109/ICIF.2006.301714

Filename

4086000