Fast sensor scheduling with communication costs for sensor networks

Shogo Arai, Yasushi Iwatani, Koichi Hashimoto

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

4 Citations (Scopus)

Abstract

This paper is devoted to sensor scheduling for a class of sensor networks whose sensors are spatially distributed and measurements are influenced by state dependent noise. Sensor scheduling is required to achieve power saving since each sensor operates with a battery power source. The sensor scheduling problem is formulated as model predictive control which minimizes a quadratic cost function with communication costs, since communications among sensors take much power. A fast and optimal sensor scheduling algorithm is proposed for a class of sensor networks. From a theoretical standpoint, we present that computation time of the proposed algorithm increases exponentially with the number of sensor types, while that of standard algorithms is exponential in the number of the sensors. The proposed algorithm is faster than standard one, since the number of sensor types is always less than or equal to the number of sensors.

Original languageEnglish
Title of host publicationProceedings of the 2010 American Control Conference, ACC 2010
Pages295-300
Number of pages6
Publication statusPublished - 2010 Oct 15
Event2010 American Control Conference, ACC 2010 - Baltimore, MD, United States
Duration: 2010 Jun 302010 Jul 2

Publication series

NameProceedings of the 2010 American Control Conference, ACC 2010

Other

Other2010 American Control Conference, ACC 2010
CountryUnited States
CityBaltimore, MD
Period10/6/3010/7/2

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Fast sensor scheduling with communication costs for sensor networks'. Together they form a unique fingerprint.

Cite this