SPDA: A Security Protocol for Data Aggregation in Large-Scale Wireless Sensor Networks

2006 ◽  
pp. 121-130
Author(s):  
Jin Wook Lee ◽  
Yann-Hang Lee ◽  
Hasan Cam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Large Scale ◽  
Security Protocol ◽  
Wireless Sensor

scholarly journals Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Yanfei Zheng ◽  
Kefei Chen ◽  
Weidong Qiu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Large Scale ◽  
Resource Constraints ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Detection Mechanism ◽  
Aggregation Tree

Data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks (WSNs). A compromised node may forge an aggregation result and mislead base station into trusting a false reading. Efficient and secure aggregation scheme is critical in WSN applications due to the stringent resource constraints. In this paper, we propose a method to build up the representative-based aggregation tree in the WSNs such that the sensing data are aggregated along the route from the leaf cell to the root of the tree. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed aggregation and cell-by-cell communications. It also provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.

scholarly journals An Adaptive Aggregation Scheduling Algorithm Based on the Grid Partition in Large-Scale Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Xiaogang Qi ◽  
Lifang Liu ◽  
Gengzhong Zheng ◽  
Mande Xie
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Large Scale ◽  
Scheduling Algorithm ◽  
Geographical Information ◽  
Wireless Sensor ◽  
Small Scale ◽  
Grid Partition ◽  
Adaptive Aggregation

Data aggregation algorithm aims to reduce the redundant information by gathering the sensed data, save energy, and prolong the lifetime of the network. However, the data aggregation technology will increase the network transmission delay of wireless sensor networks. Minimum-latency aggregation scheduling is designed to minimize the number of scheduled time slots to perform an aggregation. In this paper, we present an Adaptive Aggregation Scheduling Algorithm based on the Grid Partition (AASA-GP) in large-scale wireless sensor networks. By dividing the network into grids based on the geographical information, we allocate the channels according to the grid coordinates. Nodes with the same grid coordinates use the same channel and the adjacent grids use the different channels, so we can effectively avoid the wireless media transmission interference, increase the parallel transfer rate, and reduce the aggregation latency. Our extensive evaluation results demonstrate the superiority of the AASA-GP. For small-scale networks, the resultant latency is comparable with the best practice, and it is more suitable for large-scale wireless sensor networks.

scholarly journals Modeling and Simulation of Vote Length Analysis for Probabilistic Voting-based Filtering in Wireless Sensor Networks: Against False report and vote injection attacks

10.29007/xs1j ◽  
2018 ◽  
Author(s):  
Su Man Nam ◽  
Tae Ho Cho
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Security Protocol ◽  
Wireless Sensor ◽  
Probabilistic Voting ◽  
Injection Attacks ◽  
False Report ◽  
Length Analysis ◽  
Hostile Environments

In large-scale wireless sensor networks, sensors are vulnerable to false report and false vote injection attacks since they are deployed in hostile environments. These attacks drain their limited energy resources of forwarding nodes and drops important data. Probabilistic voting-based filtering scheme simultaneously detects both the attacks through vote verification. To effectively detect them, it is important to define the vote length of the reports since the vote length is fixed at the initial phase. We find the effective vote length using a simulation model since it is nearly impossible to evaluate the security protocol performance on the real nodes. We demonstrate that the security protocol, in which the vote length is five, achieves better detection ratio against the two attacks.

Sign in / Sign up

Export Citation Format

Share Document