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

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Earnest Akofor Biao Chen Department of Electrical Engineering and Computer Science Syracuse University Syracuse NY 13244

ISBN: (纸本)9781479903573

Within the Neyman-Pearson framework we investigate the effect of feedback in two-sensor tandem fusion networks with conditionally independent observations. While there is noticeable improvement in performance of the fixed sample size Neyman-Pearson (NP) test, it is shown that feedback has no effect on the asymptotic performance characterized by the Kullback-Leibler (KL) distance. The result can be extended to an interactive fusion system where the fusion center and the sensor may undergo multiple steps of interactions.

关键词： distributed detection Interactive fusion Neyman-Pearson test Kullback-Leibler distance Fusion reactions Fusion, biological FUSION fusion (melting) Feedback Interactive fix a sample ARCHITECTURE Building construction

来源：评论

学校读者我要写书评

暂无评论

Ellipsoidal neighbourhood outlier factor for distributed anomaly detection in resource constrained networks

引用

PATTERN RECOGNITION 2014年第9期47卷 2867-2879页

作者： Rajasegarar, Sutharshan Gluhak, Alexander Imran, Muhammad Ali Nati, Michele Moshtaghi, Masud Leckie, Christopher Palaniswami, Marimuthu Univ Melbourne Dept Elect & Elect Engn Melbourne Vic 3010 Australia Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia Univ Surrey Ctr Commun Syst Res Guildford GU2 5XH Surrey England

Anomaly detection in resource constrained wireless networks is an important challenge for tasks such as intrusion detection, quality assurance and event monitoring applications. The challenge is to detect these interesting events or anomalies in a timely manner, while minimising energy consumption in the network. We propose a distributed anomaly detection architecture, which uses multiple hyperellipsoidal clusters to model the data at each sensor node, and identify global and local anomalies in the network. In particular, a novel anomaly scoring method is proposed to provide a score for each hyperellipsoidal model, based on how remote the ellipsoid is relative to their neighbours. We demonstrate using several synthetic and real datasets that our proposed scheme achieves a higher detection performance with a significant reduction in communication overhead in the network compared to centralised and existing schemes. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Anomaly detection Outlier factor Hyperellipsoidal model distributed detection Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Ensemble methods for anomaly detection and distributed intrusion detection in Mobile Ad-Hoc Networks

引用

INFORMATION FUSION 2008年第1期9卷 96-119页

作者： Cabrera, Joao B. D. Gutierrez, Carlos Mehra, Raman K. Sci Syst Co Inc Woburn MA 01801 USA

This paper examines the problem of distributed intrusion detection in Mobile Ad-Hoc Networks (MANETs), utilizing ensemble methods. A three-level hierarchical system for data collection, processing and transmission is described. Local IDSs (intrusion detection systems) are attached to each node of the MANET, collecting raw data of network operation, and computing a local anomaly index measuring the mismatch between the current node operation and a baseline of normal operation. Anomaly indexes from nodes belonging to a cluster are periodically transmitted to a cluster head, which averages the node indexes producing a cluster-level anomaly index. Cluster heads periodically transmit these cluster-level anomaly indexes to a manager which averages them. On the theoretical side, we show that averaging improves detection rates under very mild conditions concerning the distributions of the anomaly indexes of the normal class and the anomalous class. On the practical side, the paper describes clustering algorithms to update cluster centers and machine learning algorithms for computing the local anomaly indexes. The complete suite of algorithms was implemented and tested, under two types of MANET routing protocols and two types of attacks against the routing infrastructure. Performance evaluation was effected by determining the receiver operating characteristics (ROC) curves and the corresponding area under the ROC curve (AUC) metrics for various operational conditions. The overall results confirm the theoretical developments related with the benefits of averaging with detection accuracy improving as we move up in the node-cluster-manager hierarchy. (C) 2007 Elsevier B.V. All rights reserved.

关键词： multiple classifier systems ensemble methods anomaly detection distributed detection intrusion detection Mobile Ad-Hoc Networks

来源：评论

学校读者我要写书评

暂无评论

distributed Bayesian detection in the Presence of Byzantine Data

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2015年第19期63卷 5250-5263页

作者： Kailkhura, Bhavya Han, Yunghsiang S. Brahma, Swastik Varshney, Pramod K. Syracuse Univ Dept Elect Engn & Comp Sci EECS Syracuse NY 13244 USA Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 106 Taiwan

In this paper, we consider the problem of distributed Bayesian detection in the presence of Byzantines in the network. It is assumed that a fraction of the nodes in the network are compromised and reprogrammed by an adversary to transmit false information to the fusion center (FC) to degrade detection performance. The problem of distributed detection is formulated as a binary hypothesis test at the FC based on 1-bit data sent by the sensors. The expression for minimum attacking power required by the Byzantines to blind the FC is obtained. More specifically, we show that above a certain fraction of Byzantine attackers in the network, the detection scheme becomes completely incapable of utilizing the sensor data for detection. We analyze the problem under different attacking scenarios and derive results for different non-asymptotic cases. It is found that existing asymptotics-based results do not hold under several non-asymptotic scenarios. When the fraction of Byzantines is not sufficient to blind the FC, we also provide closed form expressions for the optimal attacking strategies for the Byzantines that most degrade the detection performance.

关键词： Bayesian detection Byzantine data data falsification distributed detection probability of error

来源：评论

学校读者我要写书评

暂无评论

A distributed sinkhole detection method using cluster analysis

引用

EXPERT SYSTEMS WITH APPLICATIONS 2010年第12期37卷 8486-8491页

作者： Shim, Woochul Kim, Gisung Kim, Sehun Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Taejon 305701 South Korea

In recent years, the popularity of wireless devices has grown dramatically. Mobile ad hoc networks (MANETs) are considered to be vitally important for wireless communication. However, the dynamic nature of MANETs makes their routing protocols vulnerable to attacks. In this paper, we focused on sinkhole attacks, representative of routing-disruption attacks. First, we analyzed sinkhole attacks under a dynamic source routing protocol. Unlike wired networks, where routing-disruption attacks can be prevented through authentication mechanisms, application of authentication techniques in wireless networks is nontrivial the lack of centralization hampers authentication support management. We then used a data mining technique called cluster analysis to develop a sinkhole attack detection method in wireless networks. The cluster analysis to route request packets does not require any centralized infrastructure. Robust features for detecting sinkhole attacks in a distributed manner are suggested. Simulation shows excellent classification performance and successful distributed detections. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： MANET Sinkhole Cluster analysis Features distributed detection DSR

来源：评论

学校读者我要写书评

暂无评论

distributed Binary detection Over Fading Channels: Cooperative and Parallel Architectures

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2016年第9期65卷 7090-7109页

作者： Maleki, Nahal Vosoughi, Azadeh Rahnavard, Nazanin Univ Rochester Dept Elect & Comp Engn 601 Elmwood Ave Rochester NY 14627 USA Univ Cent Florida Dept Elect Engn & Comp Orlando FL 32816 USA

This paper considers the problem of binary distributed detection of a known signal in correlated Gaussian sensing noise in a wireless sensor network, where sensors are restricted to using the likelihood ratio test (LRT) and communicating with the fusion center (FC) over bandwidth-constrained channels that are subject to fading and noise. To mitigate the deteriorating effect of fading encountered in the conventional parallel fusion architecture, in which sensors directly communicate with the FC, we propose new fusion architectures that enhance the detection performance, via harvesting cooperative gain (so-called "decision diversity gain"). In particular, we propose 1) cooperative fusion architecture with Alamouti's space-time coding scheme at sensors, 2) cooperative fusion architecture with signal fusion at sensors, and 3) parallel fusion architecture with local threshold changing at sensors. For these schemes, we derive the LRT and majority fusion rules at the FC and provide upper bounds on the average error probabilities for homogeneous sensors, subject to uncorrelated Gaussian sensing noise, in terms of signal-to-noise ratio (SNR) of communication and sensing channels. Our simulation results indicate that when the FC employs the LRT rule, except for low communication SNR and moderate/high sensing SNR, performance improvement is feasible with the new fusion architectures. When the FC utilizes the majority rule, such an improvement is possible, except for high sensing SNR.

关键词： Correlation distributed detection diversity error floor fusion and sensor rule parallel architecture space-time coding

来源：评论

学校读者我要写书评

暂无评论

Spectrum sensing using distributed sequential detection via noisy reporting MAC

引用

SIGNAL PROCESSING 2015年第0期106卷 159-173页

作者： Sreedharan, Jithin K. Sharma, Vinod INRIA Sophia Antipolis F-06902 Sophia Antipolis France Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We propose algorithms based on decentralized sequential hypothesis testing in which the Cognitive Radios sequentially collect the observations, make local decisions and send them to the fusion center for further processing to make a final decision on spectrum usage. The reporting channel between the Cognitive Radios and the fusion center is assumed more realistically as a Multiple Access Channel (MAC) with receiver noise. Furthermore the communication for reporting is limited, thereby reducing the communication cost. We start with an algorithm where the fusion center uses an SPRT-like (Sequential Probability Ratio Test) procedure and theoretically analyze its performance. Asymptotically, its performance is close to the optimal centralized test without fusion center noise. We further modify this algorithm to improve its performance at practical operating points. Later we generalize these algorithms to handle uncertainties in SNR and fading. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Cooperative spectrum sensing distributed detection Sequential detection

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL distributed detection IN THE PRESENCE OF BYZANTINES

OPTIMAL DISTRIBUTED DETECTION IN THE PRESENCE OF BYZANTINES

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Bhavya Kailkhura Swastik Brahma Yunghsiang S. Han Pramod K. Varshney Department of EECS Syracuse University Department of EE National Taiwan University of Science & Technology

ISBN: (纸本)9781479903573

This paper considers the problem of optimal distributed detection with independent identical sensors in the presence of Byzantine attacks. By considering the attacker to be strategic in nature, we address the issue of designing the optimal fusion rule and the local sensor thresholds that minimize the probability of error at the fusion center (FC). We first consider the problem of finding the optimal fusion rule under the constraint of fixed local sensor thresholds and fixed Byzantine strategy. Next, we consider the problem of joint optimization of the fusion rule and local sensor thresholds for a fixed Byzantine strategy. Then we extend these results to the scenario where both the FC and the Byzantine attacker act in a strategic manner to optimize their own utilities. We model the strategic behavior of the FC and the attacker using game theory and show the existence of Nash Equilibrium. We also provide numerical results to gain insights into the solution.

关键词： distributed detection Wireless sensor networks Byzantines Game theory Game theory Wireless sensor networks Fusion reactions Fusion, biological FUSION fusion (melting) Sensors Nash equilibrium presences Fixed

来源：评论

学校读者我要写书评

暂无评论

IMPACT OF COMMON OBSERVATIONS IN PARALLEL distributed detection

IMPACT OF COMMON OBSERVATIONS IN PARALLEL DISTRIBUTED DETECT...

引用

IEEE Signal Processing and Signal Processing Education Workshop

作者： Hao Chen Tsang-Yi Wang Boise State University Depart. of Electrical and Computer Engineering Boise ID 83712 National Sun Yat-sen University Inst. of Communications Engineering Taiwan ROC

ISBN: (纸本)9781467391702

distributed detection with dependent observations is always a challenging problem. The problem of detection with shared information has many applications when sensors have overlapped measurements, e.g., when distributed detection is performed in a security system where sensors have overlapped coverages. For this shared information scenario, we investigate the distributed detection problem in parallel fusion networks. The design problem is how to best utilize the common information at both the local sensors and the fusion center to achieve best possible performance. We derive the necessary condition for the optimal sensor decision rules for all sensors. In addition, we investigate the system performance by comparing the optimal rules with suboptimal rules for distributed detection of a constant signal corrupted by Gaussian noise. The numerical results obtained by conducted examples confirm the optimality of the derived decision rules.

关键词： distributed detection Common Observations Parallel Network Conditionally Dependent Observations

来源：评论

学校读者我要写书评

暂无评论

New feedback structure and its fusion arithmetic for distributed detection

New feedback structure and its fusion arithmetic for distrib...

引用

2009 IET International Radar Conference

作者： Xia Shuang zhi Zhou Wan xing Nanjing Research Institute of Electronics Technology Nanjing China

ISBN: (纸本)9781849190107

The paper proposes new multi-step feedback scheme about the way in which the fusion centre feeds back to itself in distributed detection systems. The multi-step feedback scheme can unify former single-step feedback circumstance. And the detection performance and convergence rate of the new multi-step feedback scheme obviously excels that of single-step feedback. Additionally, under Neyman-Pearson criterion, the paper presents the fusion arithmetic corresponding to the new feedback scheme and the way of analyzing performance.

关键词： distributed detection Multi-step feedback N-P criterion Multiple sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：