A Novel Energy-Efficient and Privacy-Preserving Data Aggregation for WSNs

Simin Hu, Liang Liu, Liming Fang, Fangzhou Zhou, Renjun Ye

Introduction

Wireless Sensor Networks (WSNs) are frequently deployed in hostile or remote environments for tasks like environmental monitoring or surveillance. In these scenarios, sensors must operate on limited battery power for extended periods. Data aggregation—the process of combining multiple sensor readings into a single packet—is the primary method used to conserve energy by reducing the number of transmissions.

Basic data aggregation: Sensor C combines its data with that of Sensors A and B to send a single sum to the Base Station.

However, standard aggregation exposes raw data to potential eavesdroppers. While "slicing and mixing" techniques provide privacy by fragmenting data across multiple paths, they typically impose a heavy "energy tax" because every node must perform these complex operations. Existing solutions like SMART or PECDA often require a large number of nodes to perform slicing, leading to significant communication overhead.

The CBDA Protocol

The proposed Chain-Based Data Aggregation (CBDA) protocol addresses this inefficiency through a three-phase approach. First, the network is organized into a hybrid tree-chain topology. Leaf nodes are sequentially connected to form chains, which serves as the foundation for strategic data processing.

The CBDA process: (a) Tail nodes slice data into fragments, (b) nodes mix real and fake fragments, and (c) the results are aggregated up the tree.

Unlike previous methods where every node fragments its data, CBDA limits this energy-intensive task to the tail nodes at the end of each chain. These nodes slice their sensing data into $J$ fragments. To further enhance security, tail nodes inject fake fragments into the stream. A pre-distributed key matrix allows legitimate neighbors to identify and discard these fake fragments while merging the real data. Finally, the processed data is aggregated through the tree structure to the Base Station.

Experimental Evaluation

The researchers evaluated CBDA using simulations in Java and Matlab, modeling a network of 400 nodes in both Random Distribution Networks (RDN) and Non-random Distribution Networks (NDN) containing obstacles. CBDA was benchmarked against the standard TAG protocol and secure protocols like SMART and PECDA.

Key Results

  • Communication Efficiency: CBDA achieved a 50% to 70% reduction in communication overhead compared to SMART and PECDA by minimizing the number of nodes performing data slicing.
  • Energy Longevity: The protocol proved to be 15% to 50% more energy-efficient than PECDA, significantly extending the network's operational lifespan.
  • Security and Privacy: By using fake data as a shield, CBDA maintains high privacy even under collusion attacks where multiple nodes are compromised. It effectively resists eavesdropping by making it mathematically improbable for an adversary to reconstruct original data.
  • Accuracy: The protocol maintains approximately 85% aggregation accuracy in lossy network conditions, performing comparably to non-secure aggregation methods like TAG.

Conclusion

CBDA represents a significant step forward in WSN design, proving that robust data privacy does not have to come at the cost of extreme energy consumption. By intelligently selecting which nodes perform security-intensive tasks and utilizing a hybrid topology, CBDA provides a scalable and efficient solution for secure data gathering in resource-constrained environments. Future work will focus on improving accuracy in high-collision environments and addressing fully malicious node models.

Summary updated

Abstract

Data aggregation is a fundamental and efficient algorithm to reduce the communication overhead and energy consumption in wireless sensor networks (WSNs). However, WSNs need both energy-efficient and privacy-preserving when being deployed in an unprotected area. In this paper, we propose an energy-efficient and privacy-preserving data aggregation algorithm CBDA (the chain-based data aggregation). In the CBDA, sensor nodes will be organized as a tree topology. The leaf nodes of the tree sequentially reconnect with each other to form many chain topologies. For assuring data privacy, after data gathering, <xref ref-type="disp-formula" rid="deqn1-2" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(1)</xref> the tail nodes (the nodes which on the tail of chain) need to slice their sensing data into <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$J$ </tex-math></inline-formula> fragments. One fragment is kept by themselves, and they distribute the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$J-1$ </tex-math></inline-formula> data fragments to their neighbor nodes. <xref ref-type="disp-formula" rid="deqn1-2" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(2)</xref> Each tail node will inject some fake fragments into its <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$J-1$ </tex-math></inline-formula> fragments to interfere with adversaries. The CBDA can achieve less energy consumption and higher aggregation accuracy during data aggregation. We perform a comprehensive simulation to make a comparison among the CBDA with existing algorithms. The experimental results demonstrate that the CBDA outperforms the existing algorithms.
BibTeX
@inproceedings{hu2019novel,
  author = {Simin Hu and Liang Liu and Liming Fang and Fangzhou Zhou and Renjun Ye},
  title = {{A Novel Energy-Efficient and Privacy-Preserving Data Aggregation for WSNs}},
  booktitle = {IEEE Access},
  year = {2019},
  doi = {10.1109/access.2019.2961512},
}
Figure