文献类型：期刊文献

英文题名：Sensor scheduling for lifetime maximization in centralized state estimation

作者：Yang, Chao[1];Lu, Jingyi[2];Yang, Wen[1];Shi, Hongbo[1]

机构：[1]East China Univ Sci & Technol, Key Lab Adv Control & Optimizat Chem Proc, Dept Automat, Shanghai, Peoples R China;[2]Hong Kong Univ Sci & Technol, Dept Chem & Biomol Engn, Kowloon, Hong Kong, Peoples R China

年份：2017

卷号：270

起止页码：43

外文期刊名：NEUROCOMPUTING

收录：;EI(收录号：20173504096210);WOS:【SCI-EXPANDED(收录号:WOS:000412618300007)】；

基金：The work by Chao Yang is supported by NSFC 61503139, China Postdoctoral Science Funding 2015M570337, and the Fundamental Research Funds for Central Universities 222201514330. The work by Wen Yang is supported by NSFC 61573143 and the Innovation Program of Shanghai Municipal Education Commission under Grant No. 14zz55.

语种：英文

外文关键词：Wireless sensor networks; Lifetime maximization; Centralized sensor network; Sensor scheduling; Convex optimization

摘要：This paper studies how to maximize the lifetime of a centralized sensor system and meanwhile maintain a certain level of the estimation performance. The model is as follows. A group of sensors measure the states of a dynamic process and transmit the measurements to a remote estimator, which computes the estimates of the states. Constrained by its energy budget, each sensor has limited transmission times and may not transmit data at each time slot. Meanwhile, the time duration to maintain a certain level of the estimation performance of the estimator depends on the scheduling of sensor transmission. The notion of lifetime is defined as the largest time duration within which the system maintains a required estimation performance under a given schedule. This paper aims at studying the optimal scheduling which maximizes the lifetime of the system when a level of estimation performance is required. Both the scenarios of deterministic and stochastic scheduling are considered. In deterministic scheduling, three algorithms are proposed, where the schedules are given by solving convex problems and then discretizing the scheduling variables. In stochastic scheduling, two relaxed problems are considered, where the bounds of the original objective are used. The maximum of lifetime is also studied. Examples are given in the end. (C) 2017 Elsevier B.V. All rights reserved.