Have a personal or library account? Click to login
Sensor network scheduling for identification of spatially distributed processes Cover

Sensor network scheduling for identification of spatially distributed processes

Open Access
|Mar 2012

Abstract

The work treats the problem of fault detection for processes described by partial differential equations as that of maximizing the power of a parametric hypothesis test which checks whether or not system parameters have nominal values. A simple node activation strategy is discussed for the design of a sensor network deployed in a spatial domain that is supposed to be used while detecting changes in the underlying parameters which govern the process evolution. The setting considered relates to a situation where from among a finite set of potential sensor locations only a subset of them can be selected because of the cost constraints. As a suitable performance measure, the Ds-optimality criterion defined on the Fisher information matrix for the estimated parameters is applied. The problem is then formulated as the determination of the density of gauged sites so as to maximize the adopted design criterion, subject to inequality constraints incorporating a maximum allowable sensor density in a given spatial domain. The search for the optimal solution is performed using a simplicial decomposition algorithm. The use of the proposed approach is illustrated by a numerical example involving sensor selection for a two-dimensional diffusion process.

DOI: https://doi.org/10.2478/v10006-012-0002-0 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 25 - 40
Published on: Mar 22, 2012
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2012 Dariusz Uciński, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 22 (2012): Issue 1 (March 2012)