• Corpus ID: 34437491

A Two Tiers Data Aggregation Scheme for Periodic Sensor Networks

  title={A Two Tiers Data Aggregation Scheme for Periodic Sensor Networks},
  author={Jacques M. Bahi and Abdallah Makhoul and Maguy Medlej},
  journal={Ad Hoc Sens. Wirel. Networks},
The expected lifetime of any wireless sensor network is a critical issue since sensor nodes are powered by small batteries. The propagation of redundant highly correlated data is costly in terms of system performance, and results in energy depletion, network overloading, and congestion. Data aggregation is regarded as an effective technique to reduce energy consumption and prevent congestion. This paper objective is to identify near duplicate nodes that generate similar sets of collected data… 
An Analysis of Variance-Based Methods for Data Aggregation in Periodic Sensor Networks
This paper proposes energy efficient two-level data aggregation technique based on clustering architecture with which data is sent periodically from nodes to their appropriate Cluster-Heads CHs with comparison with other existing data aggregation techniques.
Energy efficient filtering techniques for data aggregation in sensor networks
Experiments show that the enhancement can significantly improve the latency of the PFF technique without affecting its performance, and this paper proposes a positional filtering that exploits the order of readings both in the prefix and the suffix of a set and leads to upper bound estimations of similarity scores.
Comparison of Different Data Aggregation Techniques in Distributed Sensor Networks
This technique allows cluster-head to eliminate redundant data sets generated by neighbouring nodes by applying three data aggregation methods based on the sets similarity functions, the one-way Anova model with statistical tests and the distance functions, respectively.
A Distance-Based Data Aggregation Technique for Periodic Sensor Networks
Simulation and real experimentations show that the proposed protocol can be effectively used to reduce data transmission and increase network lifetime, while still keeping data integrity of the collected data.
K-means based clustering approach for data aggregation in periodic sensor networks
An enhanced new version of the PFF technique called KPFF technique is proposed, which proposes to integrate a K-means clustering algorithm on data before applying the P FF on the generated clusters to minimize the number of comparisons and decrease the data latency.
Data Aggregation using Difference transfer for Load Reduction in Periodic Sensor Networks
A novel, simple and easy to implement method to reduce the amount of periodic data transferred from the sensor nodes to the sink by sending the first measure, and for every subsequent measure in that time period, the difference with respect to first measure is sent.
En-Route Data Filtering Technique for Maximizing Wireless Sensor Network Lifetime
This paper proposes a new filtering technique dedicated to periodic sensor applications that uses K-nearest neighbor clustering algorithm in order to eliminate data redundancy collected by neighboring nodes.
Two level data aggregation protocol for prolonging lifetime of periodic sensor networks
A Two Level Data Aggregation (TLDA) Protocol for Prolonging the Lifetime of Periodic Sensor Networks is proposed and extensive simulation results are conducted using OMNeT++ network simulator and based on real data of sensor network to show the efficiency of the TLDA protocol compared with two existing methods.
A suffix-based enhanced technique for data aggregation in periodic sensor networks
A new prefix-suffix filtering technique for data aggregation in periodic sensor networks (PSN), which outperforms existing prefix filtering technique in reducing energy consumption and investigates the problem of finding all pair of nodes generating similar data sets.
Distributed Data Aggregation based Modified K-means technique for energy conservation in periodic wireless sensor networks
Simulation results explain that the DiDAMoK technique can efficiently decrease the consumed energy of the whole PWSN due to reducing the sensed readings number transmitted to the sink node while keeping a suitable data accuracy at the sink.


An experimental study of routing and data aggregation in sensor networks
  • O. Younis, S. Fahmy
  • Computer Science
    IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.
  • 2005
This paper designs and implements a system, iHEED, in which node clustering is integrated with multi-hop routing for TinyOS, and results indicate that the network lifetime is prolonged by a factor of 2 to 4, and successful transmissions are almost doubled.
Adaptive data aggregation scheme in clustered wireless sensor networks
A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks
A distributed scheduling algorithm that autonomously reassigns schedules when changes in network topology, due to failing or newly added nodes, are detected using cross-layer information from the underlying MAC layer is presented.
Power efficient data gathering and aggregation in wireless sensor networks
This paper proposes two new algorithms under name PEDAP (Power Efficient Data gathering and Aggregation Protocol), which are near optimal minimum spanning tree based routing schemes, where one of them is the power-aware version of the other.
The impact of data aggregation in wireless sensor networks
This paper model data-centric routing and compare its performance with traditional end-to-end routing schemes, and examines the complexity of optimal data aggregation, showing that although it is an NP-hard problem in general, there exist useful polynomial-time special cases.
Medians and beyond: new aggregation techniques for sensor networks
This paper proposes a data aggregation scheme that significantly extends the class of queries that can be answered using sensor networks, and provides strict theoretical guarantees on the approximation quality of the queries in terms of the message size.
Distributed Data Aggregation Scheduling in Wireless Sensor Networks
To the best of the knowledge, the proposed algorithm is the first distributed algorithm for data aggregation scheduling, and an adaptive strategy for updating the schedule when nodes fail or new nodes join in a network is proposed.
Aggregation in sensor networks: an energy-accuracy trade-off
A distributed estimation algorithm is presented that can be applied to explore the energy-accuracy subspace for a sub-class of periodic aggregation problems, and can also bring considerable energy savings for a typical accuracy requirement compared to repeated snapshot aggregations.
Highly Dynamic Routing Protocol for data aggregation in sensor networks
The proposed Dynamic Data-Aggregation Aware Routing Protocol (DDAARP) builds dynamic routes, which improve the cost and quality of final routing tree and has the best quality of aggregation compared with other algorithms.
Data Aggregation for Wireless Sensor Networks Using Self-organizing Map
A new network architecture, CODA (Cluster-based self-Organizing Data Aggregation), based on the Kohonen Self-organizing Map to aggregate sensor data in cluster is presented, which increases the quality of data and reduces data traffic as well as energy-conserving.