Share Email Print

Proceedings Paper

OGUPSA sensor scheduling architecture and algorithm
Author(s): Zhixiong Zhang; Kenneth J. Hintz
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper introduces a new architecture for a sensor measurement scheduler as well as a dynamic sensor scheduling algorithm called the on-line, greedy, urgency-driven, preemptive scheduling algorithm (OGUPSA). OGUPSA incorporates a preemptive mechanism which uses three policies, (1) most-urgent-first (MUF), (2) earliest- completed-first (ECF), and (3) least-versatile-first (LVF). The three policies are used successively to dynamically allocate and schedule and distribute a set of arriving tasks among a set of sensors. OGUPSA also can detect the failure of a task to meet a deadline as well as generate an optimal schedule in the sense of minimum makespan for a group of tasks with the same priorities. A side benefit is OGUPSA's ability to improve dynamic load balance among all sensors while being a polynomial time algorithm. Results of a simulation are presented for a simple sensor system.

Paper Details

Date Published: 14 June 1996
PDF: 8 pages
Proc. SPIE 2755, Signal Processing, Sensor Fusion, and Target Recognition V, (14 June 1996); doi: 10.1117/12.243171
Show Author Affiliations
Zhixiong Zhang, George Mason Univ. (United States)
Kenneth J. Hintz, George Mason Univ. (United States)

Published in SPIE Proceedings Vol. 2755:
Signal Processing, Sensor Fusion, and Target Recognition V
Ivan Kadar; Vibeke Libby, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?