Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks
H.-T. Pai, Y. S. Han

TL;DR
This paper introduces a power-efficient direct-voting scheme for data fusion assurance in wireless sensor networks, significantly reducing overhead and enhancing security against forgery.
Contribution
It proposes a direct voting mechanism that eliminates the need for witness encryption, lowering power consumption and transmission overhead compared to existing witness-based methods.
Findings
Achieves 40 times lower overhead than previous methods
Reduces power consumption by transmitting fewer bits
Enhances security by preventing vote forgery
Abstract
Wireless sensor networks place sensors into an area to collect data and send them back to a base station. Data fusion, which fuses the collected data before they are sent to the base station, is usually implemented over the network. Since the sensor is typically placed in locations accessible to malicious attackers, information assurance of the data fusion process is very important. A witness-based approach has been proposed to validate the fusion data. In this approach, the base station receives the fusion data and "votes" on the data from a randomly chosen sensor node. The vote comes from other sensor nodes, called "witnesses," to verify the correctness of the fusion data. Because the base station obtains the vote through the chosen node, the chosen node could forge the vote if it is compromised. Thus, the witness node must encrypt the vote to prevent this forgery. Compared with the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Distributed Sensor Networks and Detection Algorithms · Energy Efficient Wireless Sensor Networks
