False Data Injection Prevention in Wireless Sensor Networks using Node-level Trust Value Computation

Author(s):  
B. Sreevidya ◽  
M. Rajesh
Author(s):  
Audrey NANGUE ◽  
◽  
Elie FUTE TAGNE ◽  
Emmanuel TONYE

The success of the mission assigned to a Wireless Sensor Network (WSN) depends heavily on the cooperation between the nodes of this network. Indeed, given the vulnerability of wireless sensor networks to attack, some entities may engage in malicious behavior aimed at undermining the proper functioning of the network. As a result, the selection of reliable nodes for task execution becomes a necessity for the network. To improve the cooperation and security of wireless sensor networks, the use of Trust Management Systems (TMS) is increasingly recommended due to their low resource consumption. The various existing trust management systems differ in their methods of estimating trust value. The existing ones are very rigid and not very accurate. In this paper, we propose a robust and accurate method (RATES) to compute direct and indirect trust between the network nodes. In RATES model, to compute the direct trust, we improve the Bayesian formula by applying the chaining of trust values, a local reward, a local penalty and a flexible global penalty based on the variation of successful interactions, failures and misbehaviors frequency. RATES thus manages to obtain a direct trust value that is accurate and representative of the node behavior in the network. In addition, we introduce the establishment of a simple confidence interval to filter out biased recommendations sent by malicious nodes to disrupt the estimation of a node's indirect trust. Mathematical theoretical analysis and evaluation of the simulation results show the best performance of our approach for detecting on-off attacks, bad-mouthing attacks and persistent attacks compared to the other existing approaches.


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):  
Gulbir Singh ◽  
Om Prakash Dubey ◽  
Gautam Kumar

Wireless mesh network represent a solution to provide wireless connectivity. There is some attacks on wireless sensor networks like black hole attack, sinkhole attack, Sybil attack, selective forwarding, etc. In this paper, we will concentrate on selective forwarding attack. Selective Forwarding Attack is one of the many security threats in wireless sensor networks which can degrade network performance. An adversary on the transmission path selectively drops the packet. The adversary same time transfers the packet, while in a few occasions it drops the packet. It is difficult to detect this type of attack since the packet loss may be due to unreliable wireless communication. The proposed scheme is based on the trust value of each node. During data transmission, a node selects a downstream node that has highest trust value, which is updated dynamically based on the number of packets a node has forwarded and dropped. We compared our scheme with the existing scheme and found that the packet loss in the proposed scheme is much less than the existing scheme.


As wireless sensor networks (WSN) deployment are broadly spreading in various fields. Therefore security becomes a vital issue. Most of the researcher's attention is only on utility of sensor network and possibility of sensor network rather than security. In our work we do focus on security for that we consider privacy and integrity the main issues of sensor networks related to security. In WSNs, various schemes have previously introduced by various researchers to manage security, but few algorithm have been considered the privacy and integrity at both sensor nodes cluster member and CH nodes. In our work we have present a secure algorithm to control integrity and privacy at both node level and cluster head level in WSN. In our protocol we have control the integrity by watermarking technique and privacy is managed using encryption technique.


Sign in / Sign up

Export Citation Format

Share Document