scholarly journals Query Privacy Preserving for Data Aggregation in Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
X. Liu ◽  
X. Zhang ◽  
J. Yu ◽  
C. Fu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Privacy ◽  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Sensor Nodes ◽  
Experimental Simulation ◽  
Wireless Sensor ◽  
Communication Overhead

Wireless Sensor Networks (WSNs) are increasingly involved in many applications. However, communication overhead and energy efficiency of sensor nodes are the major concerns in WSNs. In addition, the broadcast communication mode of WSNs makes the network vulnerable to privacy disclosure when the sensor nodes are subject to malicious behaviours. Based on the abovementioned issues, we present a Queries Privacy Preserving mechanism for Data Aggregation (QPPDA) which may reduce energy consumption by allowing multiple queries to be aggregated into a single packet and preserve data privacy effectively by employing a privacy homomorphic encryption scheme. The performance evaluations obtained from the theoretical analysis and the experimental simulation show that our mechanism can reduce the communication overhead of the network and protect the private data from being compromised.

Pallier Based Homomorphic Encrypted Data Aggregation in Wireless Sensor Networks

2014 ◽  
Vol 543-547 ◽  
pp. 3017-3022 ◽  
Author(s):  
Tristan Daladier Engouang ◽  
Liu Yun ◽  
Zhen Jiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Homomorphic Encryption ◽  
New Technology ◽  
Physical World ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Measures ◽  
Ongoing Research

Tiny autonomous embedded electronics (sensor nodes) devices able to communicate through wireless channels are ensuring the emission and reception of data through a communication radio between two sensors grouped by hundreds and thousands within Wireless Sensor Networks (WSNs). These amazing new technology with ongoing research worldwide, are merging networking, systems hardware, systems software and programming methodologies thus enabling applications that previously were not practical. Hence numerical simulations on computers can now visualize the physical world phenomena that could be observed through empirical means, as sensors are deployed in a dedicated environment, to fulfill their aim of sensing for any occurrence of the event of interest. The data sensed by these wireless sensors are now very sensitive, thus need to be fully protected by all means, which is why T. D. Engouang et al., argued that securityand reliability and also durability are mandatory when deploying any sensor nodes or hard device. The Pallier based homomorphic encryption data aggregation is proposed with security measures preserving data integrity and privacy.

scholarly journals SECURED DATA AGGREGATION METHODS IN WIRELESS SENSOR NETWORKS USING HOMOMORPHIC OPERATION - A REVIEW

2017 ◽  
Vol 10 (13) ◽  
pp. 328
Author(s):  
Shahina K ◽  
Vaidehi Vijayakumar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Homomorphic Encryption ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Issues ◽  
Aggregation Methods ◽  
Energy Constrained ◽  
Secured Data

Wireless sensor networks are energy constrained. Data aggregation is an important mechanism for achieving energy efficiency in such networks. The aggregation reduces redundancy in data transmission which results in improved energy usage. Several security issues are there in data aggregation, which includes data confidentiality, data integrity, availability, and freshness. Such issues become complex since WSN is deployed in hostile and unattended environment. So the sensor nodes may fail and compromised by adversaries. Secured data aggregation in sensor network is a topic of research.  Many solutions are proposed for secured data aggregation, using different encryption methods. Homomorphic encryption is one of such technique. In homomorphic encryption, all the nodes participate in the aggregation. Here, nodes can’t see any intermediate or final result but the aggregation is efficient. In this paper, secured data aggregation methods are classified and the performance is compared in terms of integrity and confidentiality.

Data Aggregation with End-to-End Security for Wireless Sensor Networks

2012 ◽  
Vol 490-495 ◽  
pp. 383-386
Author(s):  
Jiang Hong Guo ◽  
Jian Qiang Wu ◽  
Xi Hong Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Privacy ◽  
Identity Authentication ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Remote Server ◽  
Aggregation Scheme ◽  
End To End

Secure end-to-end data transmission is an important method to protect the data privacy in wireless sensor networks. Authors proposed a data aggregation scheme with end-to-end security for wireless sensor networks. The plaintext of sensor readings only appeared in source node and remote server, the aggregators completed the data integrity verification, sender identity authentication and data aggregation without the plaintext. Analysis and simulation show that our scheme has higher security in terms of resilient against malicious attacks and reduces the communication overhead effectively

Data Aggregation Based on Saving Energy and Preserving Privacy in Wireless Sensor Networks

2014 ◽  
Vol 635-637 ◽  
pp. 878-881
Author(s):  
Gui Jun Shan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Privacy Preserving ◽  
Tree Structure ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Aggregation Tree ◽  
Time Pieces ◽  
The Internet Of Things

Privacy preserving plays an important role in application of the Internet of Things (IoT). As apart of the IT, Wireless Sensor Networks (WSNs) should provide the privacy preserving in data aggregation. This paper presents a novel energy-saving private-preserving aggregation scheme (ESPART) for Wireless Sensor Networks, which uses characteristic of the data aggregation tree structure to reduce communication overhead. It assigns the random time pieces to nodes with aim to avoid collision, and limits the scope of collusion data to reinforce data—loss resilience. Compared with the SMART algorithm have less communication overhead. ESPART uses data-dependent fusion characteristics of the tree structure to eliminate SMART algorithm for unnecessary communication node, so that in case of the same privacy protection security, the data transmission amount is reduced to about 48% of SMART.

CONFLICT-AWARE DATA AGGREGATION SCHEDULING IN WIRELESS SENSOR NETWORKS WITH ADJUSTABLE TRANSMISSION RANGE

2012 ◽  
Vol 04 (03) ◽  
pp. 1250013 ◽  
Author(s):  
YI HONG ◽  
HONGWEI DU ◽  
DEYING LI ◽  
WENPING CHEN
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Base Station ◽  
Sensor Nodes ◽  
Performance Ratio ◽  
Wireless Sensor ◽  
Transmission Range ◽  
Minimum Latency ◽  
Data Aggregation Scheduling

The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.

scholarly journals Privacy-preserving robust data aggregation in wireless sensor networks

2009 ◽  
Vol 2 (2) ◽  
pp. 195-213 ◽  
Author(s):  
Mauro Conti ◽  
Lei Zhang ◽  
Sankardas Roy ◽  
Roberto Di Pietro ◽  
Sushil Jajodia ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Privacy Preserving ◽  
Wireless Sensor
Sign in / Sign up

Export Citation Format

Share Document