Sensor data scheduling for optimal state estimation with communication energy constraint

نویسندگان

  • Ling Shi
  • Peng Cheng
  • Jiming Chen
چکیده

In this paper, we consider sensor data scheduling with communication energy constraint. A sensor has to decide whether to send its data to a remote estimator or not due to the limited available communication energy. We construct effective sensor data scheduling schemes that minimize the estimation error and satisfy the energy constraint. Two scenarios are studied: the sensor has sufficient computation capability and the sensor has limited computation capability. For the first scenario, we are able to construct the optimal scheduling scheme. For the second scenario, we are able to provide lower and upper bounds of the minimum error and construct a scheduling scheme whose estimation error falls within the bounds. © 2011 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sensor scheduling over a packet-delaying network

Weconsider sensor scheduling for state estimation of a scalar systemover a packet-delaying network. The current measurement data can be sent over a delay-free channel if the sensor uses larger communication energy; the data will be delayed for one time step if the sensor uses less communication energy. We consider a cost function consisting of a weighted average estimation error and a weighted ...

متن کامل

Optimal Communication Scheduling and Remote Estimation over an Additive Noise Channel

This paper considers a sequential sensor scheduling and remote estimation problem with one sensor and one estimator. The sensor makes sequential observations about the state of an underlying memoryless stochastic process, and makes a decision as to whether or not to send this measurement to the estimator. The sensor and the estimator have the common objective of minimizing expected distortion i...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

Sensor Scheduling for Multi-parameter Estimation under an Energy Constraint

We consider a sensor scheduling problem for estimating multiple independent Gaussian random variables under an energy constraint. The sensor measurements are described by a linear observation model; the observation noise is assumed to be Gaussian. We formulate this problem as a stochastic sequential allocation problem. Due to the Gaussian assumption and the linear observation model, this proble...

متن کامل

A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS

Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Automatica

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2011