Topic
Data aggregator
About: Data aggregator is a research topic. Over the lifetime, 2615 publications have been published within this topic receiving 40265 citations.
Papers published on a yearly basis
Papers
More filters
••
09 Jun 2013TL;DR: A novel algorithm for Reliable and Timely dissemination of Aggregated Data (RTAD), which intertwines the formation of the aggregation tree and the allocation of time slots to nodes, and assigns parents to the individual nodes in order to maximize time slot reuse.
Abstract: In wireless sensor networks, in-network data aggregation filters out redundant sensor readings in order to reduce the energy and bandwidth consumed in disseminating the data to the base-station. In this paper, we investigate the problem of reliable collection of aggregated data with minimal latency. The aim is to form an aggregation tree such that there are k disjoint paths from each node to the base-station and find a collision-free schedule for node transmissions so that the aggregated data reaches the base-station in minimal time. We propose a novel algorithm for Reliable and Timely dissemination of Aggregated Data (RTAD). RTAD intertwines the formation of the aggregation tree and the allocation of time slots to nodes, and assigns parents to the individual nodes in order to maximize time slot reuse. The simulation results show that RTAD outperforms competing algorithms in the literature.
9 citations
••
28 Nov 2012TL;DR: This paper devise a novel cryptographic construction that comes in two schemes; a fully decentralized construction and its practical but semi-decentralized variant; both schemes are provably secure in the semi-honest model.
Abstract: In this paper, we revisit the private k+ data aggregation problem, and formally define the problem's security requirements as both data and user privacy goals. To achieve both goals, and to strike a balance between efficiency and functionality, we devise a novel cryptographic construction that comes in two schemes; a fully decentralized construction and its practical but semi-decentralized variant. Both schemes are provably secure in the semi-honest model. We analyze the computational and communication complexities of our construction, and show that it is much more efficient than the existing protocols in the literature.
9 citations
••
19 Dec 2011
TL;DR: A technique which makes use the order relationship of compound sensor data is proposed to compress data size during the In-network prediction to reduce the energy consumption of in-network temporal data suppression techniques.
Abstract: To reduce the energy consumption and maximize the lifetime of the wireless sensor network (WSN), different techniques are developed to reduce the communication over WSN. However, it is also critical to discuss the energy cost problems in computing and maintaining the information of aggregate queries. Currently, some in-network temporal data suppression techniques are developed for more efficiently processing data aggregation queries over WSN. With those techniques, a data source node which sends data only forwards newly collected data with its value changing beyond predefined constants, ± e to a data aggregate node which receives data. Otherwise, an aggregate node can infer the absent data report of a source node from the data history of the same source node. In order to further reduce the data communication, hence the energy consumption of the In-network temporal data suppression techniques, in this paper, a technique which makes use the order relationship of compound sensor data is proposed to compress data size during the In-network prediction. An empirical study is carried out to show the performance gains of the proposed techniques optimized by order compression comparing to the previous In-network prediction technique.
9 citations
••
01 Dec 2015TL;DR: The result shows that the CBDA technique for transmitting the information of CWSB existence in the Coffee Arabica plants, from the sensor nodes to the Base Station (BS), is effective in terms of energy consumption and aggregation ratio.
Abstract: Coffee production stands important asset in developing the economy of various countries. The serious effect to the coffee plantation is caused by the pest named Coffee White Stem Borer (CWSB). Removal of the CWSB pest by identifying its existence using fixed Wireless Sensor Networks (WSNs) results in high-yield productivity of coffee. For the enhancement in a lifetime of the WSN, optimum energy consumption is required that is a challenging task. More of the energy is consumed for data transmission and data computation. In the past, many data aggregation techniques for WSN have been proposed to lower the energy consumption used for forwarding the data from the sensor node to the Base Station (BS). In this paper, we propose a technique named Cluster-Based Data Aggregation (CBDA) for transmitting the information of CWSB existence in the Coffee Arabica plants, from the sensor nodes to the BS. Ultrasonic Active Sensors (UAS) are made use off to detect these pests in the coffee field. The UAS are placed according to their transmission range. A WSN hybrid model is designed that consists of the time-driven and event-driven model for transmitting the information procured. The proposed technique involves three phases: WSN initialization with clustering, data aggregation and routing of the aggregated data to its destination. For each sensor node in the WSN, the clustering technique adopted uses, i-band and o-band range for selecting cluster members and assigns one particular state (i-band, o-band, request for cluster-head, idle, cluster-head). To check the performance of the proposed technique simulation experiments is conducted. The result shows that the technique is effective in terms of energy consumption and aggregation ratio.
9 citations
•
01 Apr 2015
9 citations