Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks - Computer Science > Cryptography and SecurityReport as inadecuate




Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks - Computer Science > Cryptography and Security - Download this document for free, or read online. Document in PDF available to download.

Abstract: Wireless sensor networks place sensors into an area to collect data and sendthem back to a base station. Data fusion, which fuses the collected data beforethey are sent to the base station, is usually implemented over the network.Since the sensor is typically placed in locations accessible to maliciousattackers, information assurance of the data fusion process is very important.A witness-based approach has been proposed to validate the fusion data. In thisapproach, the base station receives the fusion data and -votes- on the datafrom a randomly chosen sensor node. The vote comes from other sensor nodes,called -witnesses,- to verify the correctness of the fusion data. Because thebase station obtains the vote through the chosen node, the chosen node couldforge the vote if it is compromised. Thus, the witness node must encrypt thevote to prevent this forgery. Compared with the vote, the encryption requiresmore bits, increasing transmission burden from the chosen node to the basestation. The chosen node consumes more power. This work improves thewitness-based approach using direct voting mechanism such that the proposedscheme has better performance in terms of assurance, overhead, and delay. Thewitness node transmits the vote directly to the base station. Forgery is not aproblem in this scheme. Moreover, fewer bits are necessary to represent thevote, significantly reducing the power consumption. Performance analysis andsimulation results indicate that the proposed approach can achieve a 40 timesbetter overhead than the witness-based approach.



Author: H.-T. Pai, Y. S. Han

Source: https://arxiv.org/







Related documents