scholarly journals An Enhanced Scheme of Excluding Compromised Nodes in Wireless Sensor Networks

2019 ◽  
Vol 1362 ◽  
pp. 012007
Author(s):  
M Aparnaa ◽  
S Dhanush Krishna ◽  
Sibi Amaran ◽  
S Maheswari ◽  
R Soundarya
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>


2014 ◽  
Vol 13 (7) ◽  
pp. 4638-4646
Author(s):  
Vinayaka S.N ◽  
M Dakshayini

Wireless sensor networks (WSNs) are exposed and being attacked by opponents as they are randomly deployed in open environments. Opponents can extract confidential information like secret keys by inserting their own nodes as compromised nodes and uses them to introduce various security attacks. So detection of such nodes is being the major issue to be addressed. In this paper we present Compro-Moto – as an efficient intrusion detection system to detect compromised nodes in WSNs. Simulation results clearly shows the benefits of Compro-Moto :(i). It is not sensitive to any kind of security attacks (ii).It endows detection range up to 99.99%. (iii)It endows false detection rate less than 1%in WSNs.(iv).It endows less total overhead and less packet loss rate. These benefits are the  achievement of Compro-Moto system that requires little memory and less communication overhead and also it can scale up to millions of nodes.


2020 ◽  
Vol 2020 ◽  
pp. 1-22
Author(s):  
Gayathri Santhosh ◽  
Yogesh Palanichamy

Wireless sensor networks (WSNs) are open to false data injection attack when they are deployed in hostile scenarios. Attackers can easily deceive the sink by compromising sensing nodes or by injecting phoney data into the network. Such attacks can deplete the energy resources of the network by providing wrong information which in turn can affect the proper network functioning or sometimes can shut the network from further functioning. The existing schemes that deal with this problem focus on only a few aspects of the false data injection attack. To resolve this problem, we propose a Rank-based Report Filtering Scheme (RRFS), a holistic and group verification scheme for the identification of compromised nodes and the filtering of false data injected into the network. The proposed scheme verifies report among clusters, en-routers, and sink. Hence, the RRFS, a holistic scheme that is composed of three-tier verifications, successfully rejects the false data before the attackers falsify the whole environment, and this makes the system unique. Reliability Index (RI) is calculated by the nodes for fellow cluster members, and the cluster head (CH) provides the score for a node based on its RI. This, in turn, strengthens the scheme by assisting the en-routers to detect the compromised nodes. The RRFS scheme has been verified and validated by extensive simulation and meticulous performance evaluation of filtering efficiency and energy consumption against various schemes. The scheme gives high filtering efficiency against the multiple compromised nodes and also improves the network’s lifespan. The sustainability of RRFS against numerous attacks that are launched in the sensor environment is thoroughly investigated.


2012 ◽  
Vol 8 (10) ◽  
pp. 301750 ◽  
Author(s):  
Gicheol Wang ◽  
Dongkyun Kim ◽  
Gihwan Cho

In wireless sensor networks, clustering expedites many desirable functions such as load balancing, energy savings, and distributed key management. For secure clustering, it is very important to find compromised nodes and remove them during the initial cluster formation process. If some nodes are compromised and survive the censorship process, they can make some nodes have a different cluster view and can split a cluster into multiple clusters to deteriorate cluster quality as a whole. To resolve these problems, we propose a robust scheme against such attacks in this paper. First, our scheme generates large-sized clusters where any two nodes are at most two hops away from each other to raise the quality of clusters. Second, our scheme employs the verification of two-hop distant nodes to preserve the quality of the large-sized clusters and refrains from splitting the clusters. Last, our scheme prefers broadcast transmissions to save the energy of nodes. Security analysis proves that our scheme can identify compromised nodes and preserves the cluster membership agreement against the compromised nodes. In addition, simulation results prove that our scheme generates fewer clusters and is more secure and energy efficient than the scheme producing only small-sized clusters.


Sign in / Sign up

Export Citation Format

Share Document