检索结果-内蒙古大学图书馆

distributed detection of sparse signals with censoring sensors in clustered sensor networks

INFORMATION FUSION 2022年 83卷 1-18页

作者： Li, Chengxi Li, Gang Varshney, Pramod K. Tsinghua Univ Beijing 100084 Peoples R China Syracuse Univ Syracuse NY 13244 USA

In this paper, we explore the distributed detection of sparse signals in energy-limited clustered sensor networks (CSNs). For this problem, the centralized detector based on locally most powerful test (LMPT) methodology that uses the analog data transmitted by all the sensor nodes in CSNs can be easily realized according to the prior work. However, for the centralized LMPT detector, the energy consumption caused by data transmission is excessively high, which makes its implementation in CSNs with limited energy supply impractical. To address this issue, we propose a new detector by combining the advantages of censoring and LMPT strategies, in which both the cluster head (CLH) nodes and the ordinary (ORD) nodes only send data deemed to be informative enough and the fusion center (FC) fuses the received data based on LMPT methodology. The detection performance of the proposed detector, characterized by Fisher Information, is analyzed in the asymptotic regime. Also, we analytically derive the relationship between the detection performance of the proposed censoring-based LMPT (cens-LMPT) detector and the communication rates, both of which are controlled by the censoring thresholds. We present an illustrative example by considering the detection problem with 2-CSNs, i.e., CSNs in which each cluster contains two nodes, and provide corresponding theoretical analysis and simulation results.

关键词： Censoring distributed detection Locally most powerful tests Sparse signals Clustered sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed detection of Sparse Signals With Censoring Sensors Via Locally Most Powerful Test

引用

IEEE SIGNAL PROCESSING LETTERS 2020年第0期27卷 346-350页

作者： Li, Chengxi Li, Gang Varshney, Pramod K. Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

In this letter, we consider the problem of distributed detection of stochastic sparse signals in battery-powered sensor networks (SNs). For this problem, an original locally most powerful test (oLMPT) detector has previously been developed, where compressed measurements are collected from all local sensors and then fused at the fusion center (FC) for making the global decision. However, since the sensors always operate on limited energy resources, allowing all the nodes to send their observations to the FC all the time exerts tremendous pressure on their energy consumption and hinders the longevity of the sensors. To solve this problem, we propose a new censoring LMPT (cen-LMPT) detector by combining the strengths of censoring strategy and the oLMPT detector, where sensors are designated to merely send observations deemed informative enough so as to utilize the local energy more efficiently, and the FC still makes the global decision based on LMPT. We analytically derive the relationship between the detection performance and the communication rate for the proposed detector. It is shown that, compared with the oLMPT detector, the proposed cen-LMPT detector with the same number of nodes can achieve almost the same detection performance with significantly lower communication rate and, therefore, much lower local energy consumption. The simulation results verify our theoretical findings.

关键词： Censoring sensors distributed detection energy constraints locally most powerful tests sparse signals

来源：评论

学校读者我要写书评

暂无评论

distributed detection With Vector Quantizer

引用

IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS 2016年第2期2卷 105-119页

作者： Zhao, Wenwen Lai, Lifeng Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA

Motivated by distributed inference over big datasets problems, we study multiterminal distributed inference problems when each terminal employs vector quantizer. The use of vector quantizer enables us to relax the conditional independence assumption normally used in the distributed detection with scalar quantizer scenarios. We first consider a case of practical interest in which each terminal is allowed to send zero-rate messages to a decision maker. Subject to a constraint that the error exponent of the type 1 error probability is larger than a certain level, we characterize the best error exponent of the type 2 error probability using basic properties of the r-divergent sequences. We then consider the scenario with positive rate constraints, for which we design schemes to benefit from the less strict rate constraints.

关键词： distributed detection exponential-type constraints error exponent hypothesis testing

来源：评论

学校读者我要写书评

暂无评论

distributed detection in Massive MIMO Wireless Sensor Networks Under Perfect and Imperfect CSI

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2019年第15期67卷 4055-4068页

作者： Chawla, Apoorva Patel, Adarsh Jagannatham, Aditya K. Varshney, Pramod K. Indian Inst Technol Kanpur Dept Elect Engn Kanpur 208016 Uttar Pradesh India Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

This paper considers the problem of distributed detection for massive multiple-input multiple-output (MIMO) wireless sensor networks (WSNs). Neyman-Pearson criterion based fusion rules are developed at the fusion center (FC) that also incorporate the local probabilities of detection and false alarm of the constituent sensor nodes. Closed-form expressions are obtained for the probabilities of detection and false alarm at the FC for various signaling schemes employed by the sensors. The fusion rules and analysis are extended to the scenario with imperfect channel state information (CSI). Furthermore, signaling matrices are determined for the massive MIMO WSN to enhance detection performance. The asymptotic detection performance of the WSN is analyzed for the large antenna regime, which yields pertinent power scaling laws with respect to the number of antennas at the FC. Simulation results demonstrate the improved performance of the proposed schemes and also validate the theoretical findings.

关键词： distributed detection massive multiple-input multiple-output (MIMO) wireless sensor networks (WSNs) Neyman-Pearson criterion

来源：评论

学校读者我要写书评

暂无评论

distributed detection in the Presence of Byzantine Attacks

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2009年第1期57卷 16-29页

作者： Marano, Stefano Matta, Vincenzo Tong, Lang Univ Salerno Dept Informat & Elect Engn DIIIE I-84084 Fisciano SA Italy Cornell Univ Dept Elect & Comp Engn Ithaca NY 14853 USA

distributed detection in the presence of cooperative (Byzantine) attack is considered. It is assumed that a fraction of the monitoring sensors are compromised by an adversary, and these compromised (Byzantine) sensors are reprogrammed to transmit fictitious observations aimed at confusing the decision maker at the fusion center. For detection under binary hypotheses with quantized sensor observations, the optimal attacking distributions for Byzantine sensors that minimize the detection error exponent are obtained using a "water-filling" procedure. The smallest error exponent, as a function of the Byzantine sensor population, characterizes the power of attack. Also obtained is the minimum fraction of Byzantine sensors that destroys the consistency of detection at the fusion center. The case when multiple measurements are made at the remote nodes is also considered, and it is shown that the detection performance scales with the number of sensors differently from the number of observations at each sensor.

关键词： Byzantine attack distributed detection network defense

来源：评论

学校读者我要写书评

暂无评论

distributed detection in Tree Networks: Byzantines and Mitigation Techniques

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2015年第7期10卷 1499-1512页

作者： Kailkhura, Bhavya Brahma, Swastik Dulek, Berkan Han, Yunghsiang S. Varshney, Pramod K. Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA Hacettepe Univ Dept Elect & Elect Engn TR-06640 Ankara Turkey Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 10607 Taiwan Natl Taipei Univ Dept Commun Engn Taipei 10617 Taiwan

In this paper, the problem of distributed detection in tree networks in the presence of Byzantines is considered. Closed form expressions for optimal attacking strategies that minimize the miss detection error exponent at the fusion center (FC) are obtained. We also look at the problem from the network designer's (FC's) perspective. We study the problem of designing optimal distributed detection parameters in a tree network in the presence of Byzantines. Next, we model the strategic interaction between the FC and the attacker as a leader-follower (Stackelberg) game. This formulation provides a methodology for predicting attacker and defender (FC) equilibrium strategies, which can be used to implement the optimal detector. Finally, a reputation-based scheme to identify Byzantines is proposed and its performance is analytically evaluated. We also provide some numerical examples to gain insights into the solution.

关键词： distributed detection data falsification Byzantines tree networks error exponent leader-follower game reputation based mitigation scheme

来源：评论

学校读者我要写书评

暂无评论

distributed detection Over Noisy Networks: Large Deviations Analysis

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第8期60卷 4306-4320页

作者： Jakovetic, Dusan Moura, Jose M. F. Xavier, Joao Univ Tecn Lisboa IST ISR P-1600011 Lisbon Portugal Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

We study the large deviations performance of consensus+innovations distributed detection over noisy networks, where agents at a time step cooperate with their immediate neighbors (consensus) and assimilate their new observations (innovation.) We show that, under noisy communication, all agents can still achieve an exponential error rate, even when certain (or most) agents cannot detect the event of interest in isolation. The key to achieving this is the appropriate design of the time-varying weight sequence by which agents weigh their neighbors' messages. We find a communication payoff threshold on the communication noise power, i.e., the critical noise power below which cooperation among neighbors improves detection performance and above which the noise in the communication among agents overwhelms the distributed detector performance. Numerical examples illustrate several tradeoffs among network parameters and between the time (or number of measurements) needed for a reliable decision and the transmission power invested by the agents.

关键词： Chernoff information distributed detection large deviations noisy communication

来源：评论

学校读者我要写书评

暂无评论

distributed detection of Weak Signals From One-Bit Measurements Under Observation Model Uncertainties

引用

IEEE SIGNAL PROCESSING LETTERS 2019年第3期26卷 415-419页

作者： Wang, Xueqian Li, Gang Varshney, Pramod K. Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

We consider the distributed detection of weak signals from one-hit measurements collected by a sensor network where observation model uncertainties exist at all the sensor nodes. To solve this problem, a one-bit locally most powerful test (LMPT) detector is proposed in this letter. Moreover, asymptotically optimal one-bit quantizers at all the sensor nodes are designed for the proposed one-hit LMPT detector. In this letter, model uncertainties are interpreted as multiplicative noise and its variance represents the strength of model uncertainties. Theoretical analysis indicates that, when the strength of model uncertainties is finite, the proposed detector using one-hit data with pi N/2 sensors approximately achieves the same detection performance as the clairvoyant detector that directly uses analog measurements with N sensors. Simulation results corroborate our theoretical analysis and show that, compared to the one-hit generalized likelihood ratio test detector, the proposed one-bit LMPT detector provides better detection performance in the presence of model uncertainties.

关键词： distributed detection model uncertainty quantize design Fisher information locally most powerful test

来源：评论

学校读者我要写书评

暂无评论

distributed detection/localization of change-points in high-dimensional network traffic data

引用

STATISTICS AND COMPUTING 2012年第2期22卷 485-496页

作者： Lung-Yut-Fong, A. Levy-Leduc, C. Cappe, O. Telecom ParisTech Inst Telecom F-75634 Paris 13 France Telecom ParisTech CNRS LTCI F-75634 Paris 13 France

We propose a novel approach for distributed statistical detection of change-points in high-volume network traffic. We consider more specifically the task of detecting and identifying the targets of distributed Denial of Service (DDoS) attacks. The proposed algorithm, called DTopRank, performs distributed network anomaly detection by aggregating the partial information gathered in a set of network monitors. In order to address massive data while limiting the communication overhead within the network, the approach combines record filtering at the monitor level and a nonparametric rank test for doubly censored time series at the central decision site. The performance of the DTopRank algorithm is illustrated both on synthetic data as well as from a traffic trace provided by a major Internet service provider.

关键词： distributed detection Change-point detection Rank test Censored data Network anomaly detection

来源：评论

学校读者我要写书评

暂无评论

distributed detection of Single-Stage Multipoint Cyber Attacks in a Water Treatment Plant 16

Distributed Detection of Single-Stage Multipoint Cyber Attac...

引用

11th ACM Asia Conference on Computer and Communications Security (ASIA CCS)

作者： Adepu, Sridhar Mathur, Aditya Singapore Univ Technol & Design 8 Somapah Rd Singapore 487372 Singapore

ISBN: (纸本)9781450342339

A distributed detection method is proposed to detect single stage multi-point (SSMP) attacks on a Cyber Physical System (CPS). Such attacks aim at compromising two or more sensors or actuators at any one stage of a CPS and could totally compromise a controller and prevent it from detecting the attack. However, as demonstrated in this work, using the flow properties of water from one stage to the other, a neighboring controller was found effective in detecting such attacks. The method is based on physical invariants derived for each stage of the CPS from its design. The attack detection effectiveness of the method was evaluated experimentally against an operational water treatment testbed containing 42 sensors and actuators. Results from the experiments point to high effectiveness of the method in detecting a variety of SSMP attacks but also point to its limitations. Distributing the attack detection code among various controllers adds to the scalability of the proposed method.

关键词： Cyber Attacks Cyber Physical Systems Cyber Security distributed detection Invariants SCADA Security by Design Water Treatment

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：