Non-myopic sensor scheduling for a distributed sensor network

Himanshu Shah, Darryl Morrell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

When tracking a target in a sensor network with constrained resources, significant reductions in sensor communications and usage cost can be realized by using non-myopic sensor scheduling. The use of integer non-linear programming is beneficial for obtaining myopic sensor schedules [1]. In this paper, we extend its benefits to a non-myopic sensor scheduling scenario consisting of a distributed network of bearing sensors. We formulate this problem, which we call the Leader Node Scheduling problem, as an integer non-linear programming problem with the objective of minimizing the total sensor usage and communications cost over a planning horizon subject to tracking error constraints per time step.

Original languageEnglish (US)
Title of host publication2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Pages2541-2544
Number of pages4
DOIs
StatePublished - Sep 16 2008
Event2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP - Las Vegas, NV, United States
Duration: Mar 31 2008Apr 4 2008

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Country/TerritoryUnited States
CityLas Vegas, NV
Period3/31/084/4/08

Keywords

  • Integer programming
  • Non-myopic sensor scheduling
  • Outer approximation
  • Particle filtering
  • Tracking

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Non-myopic sensor scheduling for a distributed sensor network'. Together they form a unique fingerprint.

Cite this