An Evaluation Model of Intrusion-Tolerant Topology Availability for Wireless Sensor Networks

2010 ◽  
Vol 159 ◽  
pp. 29-34
Author(s):  
Shu Ming Xiong ◽  
Xiao Qian Qu ◽  
Yong Zhao Zhan ◽  
Xin Sheng Wang ◽  
Liang Min Wang

Due to the node failures incurred by intrusion threat, a wireless sensor networks will initiate topology re-generation, which is based on correct availability evaluation of current intrusion-tolerant topology. The paper proposes an availability evaluation model based on semi-Markov process (SMP) to estimate topology availability of the intrusion-tolerant topology concerning the effects from intrusion behaviors. In view of some limitations of node computation ability and storage ability, this model reduces the complexities resulting from modeling the different intrusion threats and is set up on the uniform intruding results to simplify the model design. Using the DTMC model embedded in SMP topology availability is computed and finally we analyze the sensitivity to parameters in the model.

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhiming Zhang ◽  
Yu Yang ◽  
Wei Yang ◽  
Fuying Wu ◽  
Ping Li ◽  
...  

The current detection schemes of malicious nodes mainly focus on how to detect and locate malicious nodes in a single path; however, for the reliability of data transmission, many sensor data are transmitted by multipath in wireless sensor networks. In order to detect and locate malicious nodes in multiple paths, in this paper, we present a homomorphic fingerprinting-based detection and location of malicious nodes (HFDLMN) scheme in wireless sensor networks. In the HFDLMN scheme, using homomorphic fingerprint and coding technology, the original data is divided into n packets and sent to the base station along n paths, respectively; the base station determines whether there are malicious nodes in each path by verifying the validity of the packets; if there are malicious nodes in one or more paths, the location algorithm of the malicious node is implemented to locate the specific malicious nodes in the path; if all the packets are valid, the original data is recovered. The HFDLMN scheme does not need any complex evaluation model to evaluate and calculate the trust value of the node, nor any monitoring nodes. Theoretical analysis results show that the HFDLMN scheme is secure and effective. The simulation results demonstrate promising outcomes with respect to key parameters such as the detection probability of the malicious path and the locating probability of the malicious node.


Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R

<p>Wireless sensor networks are usually left unattended and serve hostile environment, therefore can easily be compromised. With compromised nodes an attacker can conduct several inside and outside attacks. Node replication attack is one of them which can cause severe damage to wireless sensor network if left undetected. This paper presents fuzzy based simulation framework for detection and revocation of compromised nodes in wireless sensor network. Our proposed scheme uses PDR statistics and neighbor reports to determine the probability of a cluster being compromised. Nodes in compromised cluster are then revoked and software attestation is performed.Simulation is carried out on MATLAB 2010a and performance of proposed scheme is compared with conventional algorithms on the basis of communication and storage overhead. Simulation results show that proposed scheme require less communication and storage overhead than conventional algorithms.</p>


Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R

<p>Wireless sensor networks are usually left unattended and serve hostile environment, therefore can easily be compromised. With compromised nodes an attacker can conduct several inside and outside attacks. Node replication attack is one of them which can cause severe damage to wireless sensor network if left undetected. This paper presents fuzzy based simulation framework for detection and revocation of compromised nodes in wireless sensor network. Our proposed scheme uses PDR statistics and neighbor reports to determine the probability of a cluster being compromised. Nodes in compromised cluster are then revoked and software attestation is performed.Simulation is carried out on MATLAB 2010a and performance of proposed scheme is compared with conventional algorithms on the basis of communication and storage overhead. Simulation results show that proposed scheme require less communication and storage overhead than conventional algorithms.</p>


2016 ◽  
Vol 21 (12) ◽  
pp. 3377-3385 ◽  
Author(s):  
Nan Jiang ◽  
Bin Li ◽  
Pingan Pan ◽  
Tao Wan ◽  
Lingfeng Liu

Sign in / Sign up

Export Citation Format

Share Document