Fast sensor scheduling for mobile sensor networks

Shogo Arai, Yasushi Iwatani, Koichi Hashimoto

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

In this paper, a sensor scheduling problem for a class of mobile sensor networks is addressed. It is assumed that the measurement noises of the sensors depend on the state of the system and all sensors have the same characteristics. In mobile sensor networks, the positions of the sensors have stochastic uncertainties. We show consider a sensor model which has stochastic uncertainties for the positions of the mobile sensors. The sensor scheduling problem is formulated as the model predictive control problem and a fast and optimal sensor scheduling algorithm is proposed. Computation time of the proposed algorithm is proportional to the number of the sensors and does not depend on the prediction horizon.

Original languageEnglish
Title of host publicationProceedings of SICE Annual Conference 2008 - International Conference on Instrumentation, Control and Information Technology
Pages2442-2446
Number of pages5
DOIs
Publication statusPublished - 2008
EventSICE Annual Conference 2008 - International Conference on Instrumentation, Control and Information Technology - Tokyo, Japan
Duration: 2008 Aug 202008 Aug 22

Publication series

NameProceedings of the SICE Annual Conference

Conference

ConferenceSICE Annual Conference 2008 - International Conference on Instrumentation, Control and Information Technology
Country/TerritoryJapan
CityTokyo
Period08/8/2008/8/22

Keywords

  • Hybrid dynamical systems
  • Mobile sensor networks
  • Networked control systems
  • Sensor scheduling

Fingerprint

Dive into the research topics of 'Fast sensor scheduling for mobile sensor networks'. Together they form a unique fingerprint.

Cite this