Data aggregator

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

Secure hop-by-hop aggregation of end-to-end concealed data in wireless sensor networks

Abstract: In-network data aggregation is an essential technique in mission critical wireless sensor networks (WSNs) for achieving effective transmission and hence better power conservation. Common security protocols for aggregated WSNs are either hop-by-hop or end-to-end, each of which has its own encryption schemes considering different security primitives. End-to-end encrypted data aggregation protocols introduce maximum data secrecy with in-efficient data aggregation and more vulnerability to active attacks, while hop-by-hop data aggregation protocols introduce maximum data integrity with efficient data aggregation and more vulnerability to passive attacks. In this paper, we propose a secure aggregation protocol for aggregated WSNs deployed in hostile environments in which dual attack modes are present. Our proposed protocol is a blend of flexible data aggregation as in hop-by-hop protocols and optimal data confidentiality as in end-to-end protocols. Our protocol introduces an efficient O(1) heuristic for checking data integrity along with cost-effective heuristic-based divide and conquer attestation process which is O(ln n) in average -O(n) in the worst scenario- for further verification of aggregated results.

Local private ordinal data distribution estimation

Abstract: The categorical data that have natural ordering between categories are termed ordinal data, which are pervasive in numerous areas, including discrete sensor readings, metering data or preference options. Though aggregating such ordinal data from the population is facilitating plenty of crowdsourcing applications, contributing such data is privacy risky and may reveal sensitive information (e.g. locations, identities) about individuals. This work studies ordinal data aggregation for distribution estimation meanwhile locally preserving individuals' data privacy (such as on their mobile devices). Under e-geo-indistinguishable constraints, which capture intrinsic dissimilarity between ordinal categories in the framework of differential privacy, we provide an efficient and effective locally private mechanism: Subset Exponential Mechanism (SEM) for ordinal data distribution estimation. The mechanism randomly responds with a fixed-size subset of the categories with calibrated probability assignment. Specially for uniform ordinal data, we propose a circling technique to symmetrically randomizing categories and estimating frequencies of categories, hence the computational/space costs and estimation performance of SEM are further optimized. Besides contributing theoretical error bounds of SEM, we also evaluate the mechanism on extensive scenarios, the evaluation results show that SEM reduces distribution estimation error on average by exp(∊/2) factor over existing private mechanisms.

An Effective Early Message Ahead Join Adaptive Data Aggregation Scheme for Sustainable IoT

Abstract: The rapid development of Internet of Things (IoT) can promote the establishment of the smart connected world by using numerous devices and sensors. Collecting the data perceived by sensing devices in a fast and energy-saving style is critical for building a stable network in IoT. In this paper, we propose an Early Message Ahead Join Adaptive Data Aggregation (E-ADA) scheme for IoT. Firstly, an advance notification mechanism based on early message is introduced to improve the probability of data aggregation, thus optimizing energy consumption and network lifetime. In this mechanism, the routing of early message is faster than that of the data packet. Nodes with data packet send an early message forward to notice, and other data packets which monitor the early message can wait for that to aggregate under the delay deadline constraints. Secondly, we propose a Delay-optimized Convergence Routing based E-ADA (DOCR-E-ADA) data collection scheme which combines advance notification mechanism and convergence routings. The duty cycle of nodes in convergence routing is adaptively adjusted, which greatly reduces transmission latency. Finally, extensive experimental results demonstrate that our DOCR-E-ADA outperforms the existing schemes in terms of network delay and lifetime.

A Hybrid Approach for Clustering-Based Data Aggregation in Wireless Sensor Networks

Abstract: In a wireless sensor network application for tracking multiple mobile targets, large amounts of sensing data can be generated by a number of sensors. These data must be controlled with efficient data aggregation techniques to reduce data transmission to the sink node. Several clustering methods were used previously to aggregate the large amounts of data produced from sensors in target tracking applications. However, such clustering based data aggregation algorithms show effectiveness only in restricted type of sensing scenarios, while posing great problems when trying to adapt to various environment changes. To alleviate the problems of existing clustering algorithms, we propose a hybrid clustering based data aggregation scheme. The proposed scheme can adaptively choose a suitable clustering technique depending on the status of the network, increasing the data aggregation efficiency as well as energy consumption and successful data transmission ratio. Performance evaluation via simulation has been made to show the effectiveness of the proposed scheme.

Near optimal scheduling of data aggregation in wireless sensor networks

Abstract: Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper focuses on the latency of data aggregation. Previously, it has been proved that the problem of minimizing the latency of data aggregation is NP-hard [1]. Many approximate algorithms have been proposed to address this issue. Using maximum independent set and first-fit algorithms, in this study we design a scheduling algorithm, Peony-tree-based Data Aggregation (PDA), which has a latency bound of 15R+@D-15, where R is the network radius (measured in hops) and @D is the maximum node degree. We theoretically analyze the performance of PDA based on different network models, and further evaluate it through extensive simulations. Both the analytical and simulation results demonstrate the advantages of PDA over the state-of-art algorithm in [2], which has a latency bound of 23R+@D-18.