Wireless Sensor Networks - Where Parallel and Distributed Processing Meets the Real World

2005 ◽  
Author(s):  
D.E. Culler
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real World ◽  
Distributed Processing ◽  
Wireless Sensor ◽  
The Real ◽  
Parallel And Distributed Processing

scholarly journals Intrusion Detection in Wireless Sensor Networks with an Improved NSA Based on Space Division

2019 ◽  
Vol 2019 ◽  
pp. 1-20 ◽  
Author(s):  
Ruirui Zhang ◽  
Xin Xiao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Negative Selection ◽  
Wireless Sensor ◽  
Selection Algorithm ◽  
The Real ◽  
Negative Selection Algorithm ◽  
Detection Process ◽  
Spatial Partition

Inspired by the biological immune system, many researchers apply artificial immune principles to intrusion detection in wireless sensor networks, such as negative selection algorithms, danger theory, and dendritic cell algorithms. When applying the negative selection algorithm to wireless sensor networks, the characteristics of wireless sensor networks, such as frequent changes in network topology and limited resources, are not considered too much, which makes the detection effect to need improvement. In this paper, a negative selection algorithm based on spatial partition is proposed and applied to hierarchical wireless sensor networks. The algorithm first analyzes the distribution of self-set in the real-valued space then divides the real-valued space, and several subspaces are obtained. Selves are filled into different subspaces. We implement the negative selection algorithm in the subspace. The randomly generated candidate detector only needs to be tolerated with selves in the subspace where the detector is located, not all the selves. This operation reduces the time cost of distance calculation. In the detection process of detectors, the antigen which is to be detected only needs to match the mature detectors in the subspace where the antigen is located, rather than all the detectors. This operation speeds up the antigen detection process. Theoretical analysis and experimental results show that the algorithm has better time efficiency and quality of detectors, saves sensor node resources and reduces the energy consumption, and is an effective algorithm for wireless sensor network intrusion detection.

scholarly journals Practical Data Prediction for Real-World Wireless Sensor Networks

2015 ◽  
Vol 27 (8) ◽  
pp. 2231-2244 ◽  
Author(s):  
Usman Raza ◽  
Alessandro Camerra ◽  
Amy L. Murphy ◽  
Themis Palpanas ◽  
Gian Pietro Picco
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real World ◽  
Wireless Sensor ◽  
Data Prediction

scholarly journals Performance Evaluation of Energy Efficient Distance Based LEACH Protocol for Wireless Sensor Networks

2019 ◽  
Vol 8 (11S2) ◽  
pp. 66-70
Keyword(s):  
Wireless Sensor Networks ◽  
Performance Evaluation ◽  
Sensor Networks ◽  
Life Span ◽  
Energy Efficient ◽  
Base Station ◽  
Wireless Sensor ◽  
The Real ◽  
Communication Round ◽  
Leach Protocol

The zone of wireless sensor networks (WSNs) is one of the developing and quickly developing fields in the logical world. This has realized growing ease, low-control and multiwork sensor hubs. Nonetheless, the real certainty that sensor hubs come up short on vitality rapidly has been an issue and numerous vitality effective directing conventions have been proposed to take care of this issue and safeguard the life span of the network. The proposed EEDBLEACH chooses bunch head with most elevated leftover vitality in every communication round of transmission and furthermore considers, the briefest good ways from the base station to the hubs in the group. By accepting the separation as a parameter which diminishes the vitality utilization. The EEDBLEACH Protocol is correlation with the current LEACH convention. Reproduction results demonstrate that EEDBLEACH Protocol drags out the lifetime of the network

scholarly journals Power Grid-Oriented Cascading Failure Vulnerability Identifying Method Based on Wireless Sensors

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Shudong Li ◽  
Yanshan Chen ◽  
Xiaobo Wu ◽  
Xiaochun Cheng ◽  
Zhihong Tian
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Bearing Capacity ◽  
Real World ◽  
Wireless Sensors ◽  
Power Grid ◽  
Wireless Sensor ◽  
Cascading Failure ◽  
Cascade Effect ◽  
Network Power

In our paper, we study the vulnerability in cascading failures of the real-world network (power grid) under intentional attacks. Here, we use three indexes ( B , K , k -shell) to measure the importance of nodes; that is, we define three attacks, respectively. Under these attacks, we measure the process of cascade effect in network by the number of avalanche nodes, the time steps, and the speed of the cascade propagation. Also, we define the node’s bearing capacity as a tolerant parameter to study the robustness of the network under three attacks. Taking the power grid as an example, we have obtained a good regularity of the collapse of the network when the node’s affordability is low. In terms of time and speed, under the betweenness-based attacks, the network collapses faster, but for the number of avalanche nodes, under the degree-based attack, the number of the failed nodes is highest. When the nodes’ bearing capacity becomes large, the regularity of the network’s performances is not obvious. The findings can be applied to identify the vulnerable nodes in real networks such as wireless sensor networks and improve their robustness against different attacks.

Sign in / Sign up

Export Citation Format

Share Document