权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

CCSS: Quickest Detection Under Energy Constraints

CCSS：能量限制下最快的检测

基本信息

批准号：
1711468
负责人：
Lifeng Lai
金额：
$ 33万
依托单位：
University of California-Davis
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2017
资助国家：
美国
起止时间：
2017-07-15 至 2021-06-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1711468&HistoricalAwards=false
关键词：
CCSS Quickest Detection Under Energy

项目摘要

Wireless sensor networks are commonly deployed to monitor abnormal changes in their surrounding environment. These changes typically imply certain activities of severe consequences, such as structure failure or chemical/gas leak, etc. Quickest detection is a framework that focuses on the design of sequential detection algorithms to identify such changes as quickly and reliably as possible so that we can win valuable time to take proper actions. In most of existing works, it is assumed that there is no constraint on how many and when sensors can take samples. This assumption may not hold for many applications in sensor networks whose sensors are powered either by battery with limited energy or renewable energy harvested from the environment. It is important to design novel quickest detection algorithms with energy constraints so that the designed algorithms can be used to detect abnormal activities using sensors powered by battery or renewable energy with a minimal delay. The energy constraints present significant challenges and unique features to quickest detection problems. It is crucial to design adaptive sensing strategies that rely on information extracted from samples taken so far and energy level at the battery to make sample and detection decisions. Towards this end, using tools from optimal stopping theory, the project aims to achieve the following goals: 1) to characterize the optimal detection schemes for problems with additional energy constraints; 2) to understand the performance loss associated with these energy constraints; and 3) to design low-complexity but asymptotically optimal detection schemes. To achieve these goals, the project will focus on two research thrusts. In the first research thrust, the project will focus on scenarios with a hard constraint on the total number of observations that the sensor is allowed to take. The designed algorithms in this thrust will be useful for sensors powered by battery with limited energy. In the second research thrust, the project will focus on scenarios with a stochastic energy constraint. The designed algorithms are suitable for sensors powered by renewable energy.

无线传感器网络通常用于监测周围环境的异常变化。这些变化通常意味着某些活动的严重后果，如结构故障或化学/气体泄漏等。最快检测是一个框架，重点是设计顺序检测算法，以尽可能快速可靠地识别这些变化，以便我们可以赢得宝贵的时间采取适当的行动。在大多数现有的作品中，它是假设，有多少和传感器可以采取样本没有约束。这种假设可能不适用于传感器网络中的许多应用，其传感器由具有有限能量的电池或从环境中收集的可再生能源供电。重要的是设计新颖的具有能量约束的最快检测算法，使得所设计的算法可以用于使用由电池或可再生能源供电的传感器以最小延迟检测异常活动。能源约束提出了重大的挑战和独特的功能，以最快的检测问题。设计自适应传感策略至关重要，该策略依赖于从迄今为止采集的样本中提取的信息和电池的能量水平来做出样本和检测决策。为此，使用最优停止理论的工具，该项目旨在实现以下目标：1）表征具有额外能量约束的问题的最优检测方案; 2）了解与这些能量约束相关的性能损失;以及3）设计低复杂度但渐近最优的检测方案。为了实现这些目标，该项目将侧重于两个研究重点。在第一个研究重点中，该项目将重点关注对传感器允许进行的观测总数有严格限制的场景。本文所设计的算法对能量有限的电池供电的传感器具有一定的参考价值。在第二个研究重点中，该项目将侧重于具有随机能量约束的场景。所设计的算法适用于由可再生能源供电的传感器。

项目成果

期刊论文数量（15）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

Generalized Distributed Dual Coordinate Ascent in a Tree Network for Machine Learning

DOI：
10.1109/icassp.2019.8682185
发表时间：
2019-05
期刊：
ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
影响因子：
0
作者：
Myung Cho;L. Lai;Weiyu Xu
通讯作者：
Myung Cho;L. Lai;Weiyu Xu

Quickest Change-Point Detection Over Multiple Data Streams via Sequential Observations

DOI：
10.1109/icassp.2018.8461647
发表时间：
2018-04
期刊：
2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
影响因子：
0
作者：
Jun Geng;L. Lai
通讯作者：
Jun Geng;L. Lai

Distributed Gradient Descent Algorithm Robust to an Arbitrary Number of Byzantine Attackers