Data aggregator

About: Data aggregator is a research topic. Over the lifetime, 2615 publications have been published within this topic receiving 40265 citations.

An anonymous data aggregation scheme for smart grid systems

Abstract: By integrating the traditional grid with the advanced communication and information technologies, smart grid can provide a reliable and efficient energy service for our modern society. Data aggregation plays an important role in evaluating the current energy usage information of consumer domains, based on which the operation center can accommodate distributed power sources to maximize the utilization efficiency. However, it also incurs a potential risk to the consumer privacy. In this paper, we propose an anonymous multi-dimensional data aggregation for smart grid systems. With the proposed scheme, the operation center can compute both additive and non-additive aggregation functions over the collected reports from consumers. The computation cost of each consumer is independent of the number of collected data types. In addition, by using the batch verification technique, the operation center's computation cost can be significantly reduced. The security analysis demonstrates that the proposed scheme can achieve identity privacy preserving, data authentication, and confidentiality. Copyright © 2013 John Wiley & Sons, Ltd.

A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks

Abstract: Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a later stage, rather than injecting snap-shot queries containing data-reducing operators (e.g., MIN, MAX, AVG) that aggregate data. Collection of raw data poses a challenge to WSNs as very large amounts of data need to be transported through the network. This not only leads to high levels of energy consumption and thus diminished network lifetime but also results in poor data quality as much of the data may be lost due to the limited bandwidth of present-day sensor nodes. We alleviate this problem by allowing certain nodes in the network to aggregate data by taking advantage of spatial and temporal correlations of various physical parameters and thus eliminating the transmission of redundant data. In this article we present a distributed scheduling algorithm that decides when a particular node should perform this novel type of aggregation. The scheduling algorithm autonomously reassigns schedules when changes in network topology, due to failing or newly added nodes, are detected. Such changes in topology are detected using cross-layer information from the underlying MAC layer. We first present the theoretical performance bounds of our algorithm. We then present simulation results, which indicate a reduction in message transmissions of up to 85p and an increase in network lifetime of up to 92p when compared to collecting raw data. Our algorithm is also capable of completely eliminating dropped messages caused by buffer overflow.

The Economics and Regulation of Financial Privacy: An International Comparison of Credit Reporting Systems

Abstract: Introduction.- Theory of Information and Privacy.- The Institutions of Credit Reporting.- Economic Effects of Credit Reporting.- Lessons for Credit Reporting Regulation.- Conclusions.

Tradeoffs among Delay, Energy and Accuracy of Partial Data Aggregation in Wireless Sensor Networks

Abstract: Due to the Recent development in wireless technology, wireless sensor networks attract researchers’ attention because of their applicability in many fields for effective collection of sensing data with low cost. Wireless sensor networks have many applications; some of the applications are military application, environmental application and flood detection. For example, in an environmental application for forest fire detection, the sensor nodes sense the fire information, then transmit or relay the information to base station in a multi-hop way. In wireless sensor networks, energy saving is critical issue as sensor nodes are battery-powered. Here we propose, partial data aggregation as one of the energy saving technique. In this paper, we analyze the tradeoffs among communication delay, energy consumption, and data accuracy of the partial data aggregation technique and discuss the results. First, we analyze the partial data aggregation with Markovian chain; analytical result shows that, non-aggregation method suffers large energy consumption while full aggregation suffers long transmission delay. From the analysis results, we find that the proposed partial aggregation method WRP (Waterfalls Random partial aggregation) can trade off energy consumption and transmission delay. Thus, we discuss the tradeoffs among data accuracy, transmission delay and energy consumption with different criteria and parameters. The results show that we could control the significance of transmission delay, energy consumption and data accuracy by tradeoffs index (TOI). We also analyze the several applications of wireless sensor networks with different significance based on the TOI. From the observed results, we found that we could set the significance of transmission delay, energy consumption and data accuracy for different applications based on different criteria TOI. Thus, by evaluating and comparing the criteria with different data generation rate as well as aggregation factor, we get the least TOI value, which denotes the desired tradeoffs among them.