Results 1 -
8 of
8
Sensor Network Data Fault Types
"... This tutorial presents a detailed study of sensor faults that occur in deployed sensor networks and a systematic approach to model these faults. We begin by reviewing the fault detection literature for sensor networks. We draw from current literature, our own experience, and data collected from scie ..."
Abstract
-
Cited by 32 (0 self)
- Add to MetaCart
(Show Context)
This tutorial presents a detailed study of sensor faults that occur in deployed sensor networks and a systematic approach to model these faults. We begin by reviewing the fault detection literature for sensor networks. We draw from current literature, our own experience, and data collected from scientific deployments to develop a set of commonly used features useful in detecting and diagnosing sensor faults. We use this feature set to systematically define commonly observed faults, and provide examples of each of these faults from sensor data collected at recent deployments. Categories and Subject Descriptors: B.8.1 [Reliability, Testing, and Fault-Tolerance]: Fault
A weighted moving average-based approach for cleaning sensor data
- in IEEE International Conference on Distributed Computing Systems
, 2007
"... Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environment, however, it is well known that the collected sensor data usually contain noises. Therefore, it is very critical to clean the sensor data ..."
Abstract
-
Cited by 23 (0 self)
- Add to MetaCart
(Show Context)
Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environment, however, it is well known that the collected sensor data usually contain noises. Therefore, it is very critical to clean the sensor data before using them to answer queries or conduct data analysis. Popular data cleaning approaches, such as moving average, cannot meet the requirements of both energy efficiency and quick response time in many sensor related applications. In this paper, we propose a hybrid sensor data cleaning approach with confidence. Specifically, we propose a smart weighted moving average (WMA) algorithm that collects confident data from sensors and computes the weighted moving average. 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 a higher confidence weight for this value, such that this important value can be quickly reflected in the mon-itoring values computed from moving average. Based on our extensive 1 simulation results, we demonstrate that, compared to the simple moving average (SMA), our WMA approach can effectively clean data and offer fast response time. 1
Energy Efficient Transmission Error Recovery for Wireless Sensor Network
- International Journal of Grid and Distributed Computing (IJGDC), December 2010
"... Transmission errors are inherent in wireless communications because of the instability of wireless channels resulting due to channel fading, time-frequency coherence, inter-band interference, etc, and thus receiving unreliable message packet. This necessitates the retransmission of packet which furt ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Transmission errors are inherent in wireless communications because of the instability of wireless channels resulting due to channel fading, time-frequency coherence, inter-band interference, etc, and thus receiving unreliable message packet. This necessitates the retransmission of packet which further results into extra processing and increased energy consumption of the sensor nodes. In this paper, we propose a new approach of an energy-efficient transmission error recovery algorithm for wireless sensor networks. In the proposed methodology, the data packet is divided into small sub-packets and retransmission is done for only corrupted portion of the sub-packets. The algorithm also helps in determining optimum size of the sub-packet. These results into minimum battery power requirement for the sensor nodes and increased lifespan of the sensor network. The results show that more than 30 % of the power savings can be achieved by implementing proposed system as compared to conventional retransmission of complete packet.
Implementing reliable event streams in large systems via distributed data flows and recursive delegation. DEBS
, 2009
"... Strong reliability properties, such as state machine replication and virtual synchrony, are hard to implement in a scalable manner. They are typically expressed in terms of global membership views. However, global membership is non-scalable. We propose a new way of modeling protocols that does not r ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
(Show Context)
Strong reliability properties, such as state machine replication and virtual synchrony, are hard to implement in a scalable manner. They are typically expressed in terms of global membership views. However, global membership is non-scalable. We propose a new way of modeling protocols that does not rely on global membership. Our approach is based on the concept of a distributed data f ow, a set of events distributed in space and time. We model protocols as networks of such f ows, constructed through recursive delegation. The resulting system uses multiple small membership services instead of a single global service while still supporting stronger properties. This paper focuses on the theoretical model and its base properties; in particular, on the concept of monotonic aggregation. We present a high-level architecture overview and initial performance results.
RD 4: Role-Differentiated Cooperative Deceptive Data Detection and Filtering in VANETs
"... Abstract—The data quality of collected sensing data, which determines the practical value of sensing systems, has been studied in several previous efforts; however, we argue that vehicular ad hoc networks (VANETs), which are a particular application of highly dynamic sensing systems, requires specif ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—The data quality of collected sensing data, which determines the practical value of sensing systems, has been studied in several previous efforts; however, we argue that vehicular ad hoc networks (VANETs), which are a particular application of highly dynamic sensing systems, requires specific treatment to guarantee data quality. In this paper, we design a mechanism, i.e., RD 4, which is a role-differentiated cooperative deceptive data-detection and filtering mechanism, to detect the false data in VANETs. RD 4 is evaluated using an extended traffic simulator. Three scenarios, i.e., freeway, road construction on a highway, and a traffic light on a local street, are deployed in general. Evaluation results show that the proposed mechanism can achieve more than 90.00 % recall and precision rate in most cases. Index Terms—Data quality, false detection, vehicle communication, vehicular ad hoc network (VANET), wireless sensor network. I.
RECENT
"... Abstract—Wireless Sensor Networks are a fast-growing class of systems. They offer many new design challenges, due to stringent requirements like tight energy budgets, low-cost components, limited processing resources, and small footprint devices. Such strict design goals call for technologies like n ..."
Abstract
- Add to MetaCart
Abstract—Wireless Sensor Networks are a fast-growing class of systems. They offer many new design challenges, due to stringent requirements like tight energy budgets, low-cost components, limited processing resources, and small footprint devices. Such strict design goals call for technologies like nanometer-scale semiconductor design and low-power wireless communication to be used. But using them would also make the sensor data more vulnerable to errors, within both the sensor nodes ’ hardware and the wireless communication links. Assuring the reliability of the data is going to be one of the major design challenges of future sensor networks. Traditional methods for reliability cannot always be used, because they introduce overheads at different levels, from hardware complexity to amount of data transmitted. This paper presents a new method that makes use of the properties of sensor data to enable reliable data collection. The approach consists of creating predictive models based on the temporal correlation in the data and using them for real-time error correction. This method handles multiple sources of errors together without imposing additional complexity or resource overhead at the sensor nodes. We demonstrate the ability to correct transient errors arising in sensor node hardware and wireless communication channels through simulation results on real sensor data. Index Terms—Reliability, data models, wireless sensor networks, error correction. Ç
Synopsis Diffusion of . . .
, 2008
"... Previous approaches for computing duplicate-sensitive aggregates in wireless sensor networks have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common in sensor ..."
Abstract
- Add to MetaCart
Previous approaches for computing duplicate-sensitive aggregates in wireless sensor networks have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common in sensor networks. In this article, we present synopsis diffusion, a general framework for achieving significantly more accurate and reliable answers by combining energy-efficient multipath routing schemes with techniques that avoid double-counting. Synopsis diffusion avoids double-counting through the use of order- and duplicate-insensitive (ODI) synopses that compactly summarize intermediate results during in-network aggregation. We provide a surprisingly simple test that makes it easy to check the correctness of an ODI synopsis. We show that the properties of ODI synopses and synopsis diffusion create implicit acknowledgments of packet delivery. Such acknowledgments enable energy-efficient adaptation of message routes to dynamic message loss conditions, even in the presence of asymmetric links. Finally, we illustrate using extensive simulations the
