JOURNAL ARTICLE

Data aggregation with privacy-preserving for wireless sensor networks

Abstract

In-network data aggregation presents a critical challenge for data privacy in resource constraint wireless sensor networks. We propose a PAPF scheme, in which a novel p-function set taking advantage of the algebraic properties of modular operation is constructed. Thanks to the p-functions, nodes can perturb their privacy data without extra data exchange, and the aggregation result can be recovered from the perturbed data in the cluster head. Due to the flexible generation of the p-function set, PAPF scheme is adapted to node periodical reporting and sink in query response reports. Extensive analysis and simulations show that PAPF scheme is able to preserve privacy more efficiently while consuming less communication overhead, and has a good resistance to data loss.

Keywords:
Computer science Data aggregator Wireless sensor network Overhead (engineering) Modular design Computer network Scheme (mathematics) Node (physics) Information privacy Distributed computing Constraint (computer-aided design) Computer security Engineering

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
14
Refs
0.11
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Security in Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.