In-Network Outlier Detection in Wireless Sensor Networks
Published 3 August 2006
Joel W. Branch, Bolesław K. Szymański, Chris Giannella, Ran Wolff, H. Kargupta
Citations185
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
To address the problem of unsupervised outlier detection in wireless sensor networks, we develop an algorithm that (1) is flexible with respect to the outlier definition, (2) works in-network with a communication load proportional to the outcome, and (3) reveals its outcome to all sensors. We examine the algorithm's performance using simulation with real sensor data streams. Our results demonstrate that the algorithm is accurate and imposes a reasonable communication load and level of power consumption.
Keywords
Computer Science
Computer NetworksWireless sensor networks: a survey
17,276 Citations2002Ian F. Akyildiz, Weilian Su +2 more
The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
IEEE Communications MagazineA survey on sensor networks
13,670 Citations2002Ian F. Akyildiz, Weilian Su +2 more
Ad hoc On-Demand Distance Vector (AODV) Routing
10,646 Citations2003Colin Perkins, Elizabeth M. Belding‐Royer +1 more
The Ad hoc On-Demand Distance Vector routing protocol uses destination sequence numbers to ensure loop freedom at all times, avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.
Ad-hoc on-demand distance vector routing
10,319 Citations1999Charles E. Perkins, E.M. Royer
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
IEEE Transactions on Information TheoryThe capacity of wireless networks
8,315 Citations2000Piyush Gupta, P. R. Kumar
LOF
3,862 Citations2000Markus Breunig, Hans‐Peter Kriegel +2 more
This paper contends that for many scenarios, it is more meaningful to assign to each object a degree of being an outlier, called the local outlier factor (LOF), and gives a detailed formal analysis showing that LOF enjoys many desirable properties.
Artificial Intelligence ReviewA Survey of Outlier Detection Methodologies
3,349 Citations2004Joanna Hodge, Jim Austin
Geography-informed energy conservation for Ad Hoc routing
2,825 Citations2001Ya Xu, John Heidemann +1 more
A geographical adaptive fidelity algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity.
Next century challenges
2,707 Citations1999Deborah Estrin, Ramesh Govindan +2 more
This paper believes that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor network coordination.
ACM SIGMOD RecordEfficient algorithms for mining outliers from large data sets
1,871 Citations2000Sridhar Ramaswamy, Rajeev Rastogi +1 more
Journal of the Royal Statistical Society Series A (Statistics in Society)Outliers in Statistical Data.
1,698 Citations1995Anthony C. Atkinson, V. Barnett +1 more
Outliers in Statistical Data, 3rd edition by V. Barnett and T. Lewis.
Protocols and Architectures for Wireless Sensor Networks
1,691 Citations2005Holger Karl, Andreas Willig
This book discusses the design principles for wireless sensor networks, and the many faces of forwarding and routing, and some of the approaches to combining hierarchical topologies and power control used in these networks.
Algorithms for Mining Distance-Based Outliers in Large Datasets
1,530 Citations1998Edwin M. Knorr, Raymond T. Ng
This paper provides formal and empirical evidence showing the usefulness of DB-outliers and presents two simple algorithms for computing such outliers, both having a complexity of O(k N’), k being the dimensionality and N being the number of objects in the dataset.
Gossip-based computation of aggregate information
1,481 Citations2004David Kempe, Alin Dobra +1 more
This paper analyzes the diffusion speed of uniform gossip in the presence of node and link failures, as well as for flooding-based mechanisms, and shows that this diffusion speed is at the heart of the approximation guarantees for all of the above problems.
Understanding packet delivery performance in dense wireless sensor networks
1,279 Citations2003Jerry Zhao, Ramesh Govindan
This paper reports on a systematic medium-scale measurement of packet delivery in three different environments: an indoor office building, a habitat with moderate foliage, and an open parking lot, which has interesting implications for the design and evaluation of routing and medium-access protocols for sensor networks.
Efficient algorithms for mining outliers from large data sets
1,150 Citations2000Sridhar Ramaswamy, Rajeev Rastogi +1 more
A novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor is proposed and the top n points in this ranking are declared to be outliers.
ACM SIGMOBILE Mobile Computing and Communications ReviewA taxonomy of wireless micro-sensor network models
1,011 Citations2002Sameer Tilak, Nael Abu‐Ghazaleh +1 more
This taxonomy will aid in defining appropriate communication infrastructures for different sensor network application sub-spaces, allowing network designers to choose the protocol architecture that best matches the goals of their application.
Analyzing the transitional region in low power wireless links
880 Citations2005Marco Zúñiga, Bhaskar Krishnamachari
A key finding is that for radios using narrow-band modulation, the transitional region is not an artifact of the radio non-ideality, as it would exist even with perfect-threshold receivers because of multi-path fading.
Lecture notes in computer scienceFast Outlier Detection in High Dimensional Spaces
835 Citations2002Fabrizio Angiulli, Clara Pizzuti
A new definition of distance-based outlier that considers for each point the sum of the distances from its k nearest neighbors, called weight, is proposed, which scales linearly both in the dimensionality and the size of the data set.
IEEE Transactions on Signal ProcessingMaximum likelihood multiple-source localization using acoustic energy measurements with wireless sensor networks
717 Citations2004Xiaohong Sheng, Yu Hen Hu
A maximum likelihood (ML) acoustic source location estimation method is presented for the application in a wireless ad hoc sensor network and consistently outperforms existing acoustic energy based source localization methods.
Lecture notes in computer scienceOutlier Detection Using Replicator Neural Networks
711 Citations2002Simon Hawkins, Hongxing He +2 more
Replicator neural networks (RNNs) are used to provide a measure of the outlyingness of data records and the effectiveness of the RNNs for outlier detection is demonstrated on two publicly available databases.
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
615 Citations2003Stephen D. Bay, Mark Schwabacher
This work shows that a simple nested loop algorithm that in the worst case is quadratic can give near linear time performance when the data is in random order and a simple pruning rule is used.
Sensor network-based countersniper system
577 Citations2004Gyula Simon, Miklós Maróti +7 more
In this paper, in addition to the overall system architecture, the acoustic signal detection, the most important middleware services and the unique sensor fusion algorithm are also presented.
Gossip algorithms: design, analysis and applications
571 Citations2005Stephen Boyd, Aritra Ghosh +2 more
This work analyzes the averaging problem under the gossip constraint for arbitrary network, and finds that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.
IEEE Transactions on Mobile ComputingASCENT: adaptive self-configuring sensor networks topologies
477 Citations2004Alberto Cerpa, Deborah Estrin
Proceedings - IEEE Aerospace ConferenceSTEM: Topology management for energy efficient sensor networks
279 Citations2003Curt Schurgers, Vlasios Tsiatsis +1 more
This work proposes a new technique, called sparse topology and energy management (STEM), that dramatically improves the network lifetime by exploiting the fact that most of the time, the network is only sensing its environment waiting for an event to happen.
TechnometricsSome Grubbs-Type Statistics for the Detection of Several Outliers
265 Citations1972Gary L. Tietjen, R. W. Moore
Distributed Anomaly Detection in Wireless Sensor Networks
253 Citations2006Sutharshan Rajasegarar, Christopher Leckie +2 more
This work proposes a distributed, cluster-based anomaly detection algorithm that achieves comparable accuracy compared to a centralized scheme with a significant reduction in communication overhead.
Robust decision trees: removing outliers from databases
243 Citations1995George H. John
This paper examines C4.5, a decision tree algorithm that is already quite robust - few algorithms have been shown to consistently achieve higher accuracy, and extends the pruning method to fully remove the effect of outliers, and this results in improvement on many databases.
Data Mining and Knowledge DiscoveryFast Distributed Outlier Detection in Mixed-Attribute Data Sets
232 Citations2006Matthew Eric Otey, Amol Ghoting +1 more
A tunable algorithm for distributed outlier detection in dynamic mixed-attribute data sets that are prone to concept drift and models of the data must be dynamic as well is presented.
Knowledge and Information SystemsAutomatic outlier detection for time series: an application to sensor data
230 Citations2006Sabyasachi Basu, Martin Meckesheimer
AAAI Press eBooksData Mining: Next Generation Challenges and Future Directions
204 Citations2004Hillol Kargupta, Anupam Joshi +2 more
Outlier detection in sensor networks
180 Citations2007Bo Sheng, Qun Li +2 more
A histogram-based method for outlier detection to reduce communication cost by collecting hints (in the form of a histogram) about the data distribution, and using the hints to filter out unnecessary data and identify potential outliers.
ACM SIGMOD RecordDistributed deviation detection in sensor networks
173 Citations2003Themistoklis Palpanas, Dimitris Papadopoulos +2 more
This work proposes a technique for online deviation detection in streaming data, and discusses how these techniques can operate efficiently in the distributed environment of a sensor network, and discuss the tradeoffs that arise in this setting.
Outlier Detection in Wireless Sensor Networks using Bayesian Belief Networks
168 Citations2006D. Janakiram, A.V.U.P. Kumar +1 more
An outlier detection scheme based on Bayesian belief networks, which captures the conditional dependencies among the observations of the attributes to detect the outliers in the sensor streamed data is proposed.
Information SciencesClustering distributed data streams in peer-to-peer environments
164 Citations2005Soma Bandyopadhyay, Chris Giannella +4 more
Experimental results show that, in contrast to the case when all the data is transmitted to a central location for application of the conventional clustering algorithm, the communication cost of the proposed approach is significantly smaller and the accuracy of the obtained centroids is high and the number of samples which are incorrectly labeled is also small.
K-Means Clustering Over a Large, Dynamic Network
132 Citations2006Souptik Datta, Chris Giannella +1 more
Lecture notes in computer scienceImproving K-Means by Outlier Removal
126 Citations2005Ville Hautamäki, Svetlana Cherednichenko +3 more
An Outlier Removal Clustering (ORC) algorithm that provides outlier detection and data clustering simultaneously and has a lower error on datasets with overlapping clusters than the competing methods is presented.
IEEE/ACM Transactions on NetworkingAsynchronous Distributed Averaging on Communication Networks
126 Citations2007Mortada Mehyar, D.P. Spanos +3 more
This paper presents several implementable algorithms that are robust to asynchronism and dynamic topology changes, and can be proven to converge under very general asynchronous timing assumptions.
A Weighted Moving Average-based Approach for Cleaning Sensor Data
121 Citations2007Yongzhen Zhuang, Lei Chen +2 more
The rationale behind the WMA algorithm is to draw more samples for a particular value that is of great importance to the moving average, and provide higher confidence weight for this value, such that this important value can be quickly reflected in theMoving average.
Kluwer Academic Publishers eBooksSense: A Wireless Sensor Network Simulator
98 Citations2006Gilbert Chen, Joel W. Branch +3 more
A new network simulator, called SENSE, has been developed for simulating wireless sensor networks, to address such factors as extensibility, reusability, and scalability and to take into account the needs of different users.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Association Rule Mining in Peer-to-Peer Systems
93 Citations2004Ran Wolff, Assaf Schuster
Scalable, Distributed Data Mining Using An Agent Based Architecture
93 Citations2009H. Kargupta, Ilker Hamzaoglu +1 more
The price of validity in dynamic networks
83 Citations2004Mayank Bawa, Aristides Gionis +2 more
This paper presents a class of algorithms that guarantee validity in dynamic networks, and specifies a correctness condition, single-site validity, with respect to which the above algorithms are best-effort.
Distributed classification in peer-to-peer networks
77 Citations2007Ping Luo, Hui Xiong +2 more
Experimental results on real-world P2P networks show that the proposed ensemble paradigm is effective even if there are thousands of local classifiers, and the proposed DPV0 algorithm is significantly more communication-efficient than existing algorithms for distributed plurality voting.
Neighborhood based detection of anomalies in high dimensional spatio-temporal sensor datasets
77 Citations2004Nabil R. Adam, Vandana P. Janeja +1 more
The outlier detection is addressed by refining the concept of a neighborhood of an object, which essentially characterizes similarly behaving objects into one neighborhood, which quantified in terms of the spatial relationships among the objects and other semantic relationships based on the spatial processes and spatial features in their vicinity.
Acoustic source localization in distributed sensor networks
63 Citations2005Thibaut Ajdler, I. Kozintsev +2 more
This paper studies the problem of sound source localization in a distributed wireless sensor network formed by mobile general purpose computing and communication devices with audio I/O capabilities and evaluates the Cramer-Rao bound on the variance of the location estimation and compares it with simulations and experimental results.
In-network Outlier Cleaning for Data Collection in Sensor Networks.
60 Citations2006Yongzhen Zhuang, Lei Chen
An in-network outlier cleaning approach, including wavelet based outlier correction and neighboring DTW(Dynamic Time Warping) distance-based outlier removal is proposed, which can effectively clean the sensing data and reduce outlier traffic.
Advances in Pervasive Computing and Networking
42 Citations2005Bolesław K. Szymański, Yener, Bülent
The scope of Advances in Pervasive Computing and Networking ranges from fundamental theory of pervasive computing and networking to crucial challenges and emerging applications, such as cooperative communication in mobile, wireless and sensor networks, methods for maximizing aggregate throughput in 802.11 mesh networks with a physical carrier, and self-configuring location discovery systems for smart environments.
Scalable, distributed data mining—an agent architecture
40 Citations1997Hillol Kargupta, Ilker Hamzaoglu +1 more
The PADMA (PArallel Data Mining Agents) architecture will be described, along with experiments on text to address scalability, which offer parallel data access, and hierarchical clustering, with results visualized through a JAVA web-interface.
Towards Data Mining in Large and Fully Distributed Peer-to-Peer Overlay Networks
39 Citations2003Wojtek Kowalczyk M, Jelasity A. E. Eiben
This paper presents distributed algorithms for effectively calculating basic statistics of data using the recently introduced newscast model of computation and demonstrates how to implement basic data mining algorithms based on these techniques.
Lecture notes in computer scienceA Local Facility Location Algorithm for Sensor Networks
39 Citations2005Denis Krivitski, Assaf Schuster +1 more
The local facility location algorithm described is entirely asynchronous, seamlessly supports failures and changes in the data during calculation, poses modest memory and computational requirements, and can provide an anytime solution which is guaranteed to converge to the exact same one that would be computed by a centralized algorithm given the entire data.
Local L2-Thresholding Based Data Mining in Peer-to-Peer Systems
38 Citations2006Ran Wolff, Kanishka Bhaduri +1 more
A highly efficient local algorithm which detect when the L2 norm of the average data surpasses a threshold is described and is used as a feedback loop for the monitoring of complex predicates on the data – such as the data’s k-means clustering.
Uniform Data Sampling from a Peer-to-Peer Network
37 Citations2007Souptik Datta, Hillol Kargupta
This paper proposes a random walk-based sampling algorithm that can be used to sample data tuples uniformly from a large, unstructured P2P network and model the random walk as a Markov chain and derive conditions to bound the length of the randomWalk necessary to achieve uniformity.
IEEE Transactions on Knowledge and Data EngineeringDistributed Identification of Top-l Inner Product Elements and its Application in a Peer-to-Peer Network
31 Citations2008Kunal Das, Kanishka Bhaduri +2 more
An approximate local algorithm for identifying top-l, inner products among pairs of feature vectors in a large asynchronous distributed environment such as a peer-to-peer (P2P) network is presented and a probabilistic algorithm for this purpose is developed using order statistics and the Hoeffding bound.
Self-selective routing for wireless ad hoc networks
29 Citations2006G. G. Chen, Joel W. Branch +1 more
Journal of Computer and System SciencesThe price of validity in dynamic networks
28 Citations2006Mayank Bawa, Aristides Gionis +2 more
Learning from class-imbalanced data in wireless sensor networks
28 Citations2003Predrag Radivojac, Uttara Korad +2 more
This paper incorporates machine learning strategies to intelligently reduce the amount of transmitted data, in order to increase life-span of the sensors and thus profitability of the system.
Journal of Grid ComputingA Local Facility Location Algorithm for Large-scale Distributed Systems
24 Citations2007Denis Krivitski, Assaf Schuster +1 more
The algorithm presented here is extremely scalable, entirely decentralized, requires no routing capabilities, and is resilient to failures and changes in the data throughout its execution.
Lecture notes in computer scienceImproving kNN Text Categorization by Removing Outliers from Training Set
22 Citations2006Kwangcheol Shin, Ajith Abraham +1 more
It is shown that excluding outliers from the training data significantly improves kNN classifier, which in this case performs about 10% better than the best know method—Centroid-based classifier.
Lecture notes in computer scienceContinuous Adaptive Outlier Detection on Distributed Data Streams
22 Citations2007Su Liang, Weihong Han +3 more
This paper formalizes the problem of outlier detection using the kernel density estimation technique, and adopts the fading strategy to keep pace with the transient and evolving natures of stream data, and mico-cluster technique to conquer the data partition and "one-pass" scan.
Lecture notes in computer scienceESCORT: Energy-Efficient Sensor Network Communal Routing Topology Using Signal Quality Metrics
18 Citations2005Joel W. Branch, Gilbert G. Chen +1 more
Simulation demonstrates that ESCORT enables nodes to deactivate their radios more than 60% of the time while sustaining acceptable communication performance and reducing the energy cost of communication in dense sensor networks.
An efficient <i>local</i> Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
17 Citations2008Kanishka Bhaduri, Hillol Kargupta
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments that monitors the “quality” of the current regression model and uses this algorithm as a feedback mechanism for rebuilding the model.
A neural network classifier for occluded images
14 Citations2003Takio Kurita, Takashi Takahashi +1 more
A neural network classifier which can automatically detect the occluded regions in the given image and replace that regions with estimated values, designed by integrating this associative memory with a simple classifier.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIESelf-healing routing: a study in efficiency and resiliency of data delivery in wireless sensor networks
13 Citations2007Kamil Wasilewski, Joel W. Branch +2 more
This paper presents the results of implementation of a novel protocol, Self-Healing Routing, for opportunistic multi-hop wireless communication, on MicaZ sensor motes and compared it with two traditional protocols: MintRoute and AODV.
ASYNCHRONOUS PEER-TO-PEER COMMUNICATION FOR FAILURE RESILIENT DISTRIBUTED GENETIC ALGORITHMS
8 Citations2003JosCarlos Clemente, Kenji Satou
The proposed solution extensively uses peer-to-peer technology and epidemic protocols in order to improve scalability and failure resilience and considerably relaxes the model traditional ly used by genetic algorithm libraries.
