AICN: An Efficient Algorithm to Identify Compromised Nodes in Wireless Sensor Network

Author(s):  
R. Lu ◽  
X. Lin ◽  
C. Zhang ◽  
H. Zhu ◽  
P.-H. Ho ◽  
...  
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>


2011 ◽  
Vol 9 (5) ◽  
pp. 2092-2098
Author(s):  
Jing Wei-Peng ◽  
Liu Ya-Qiu ◽  
Zhu Liang-Kuan

2011 ◽  
Vol 403-408 ◽  
pp. 2791-2794
Author(s):  
Xiang Li Liu ◽  
Zan Li ◽  
Jiang Bo Si ◽  
Ben Jian Hao

Severe energy constraints and limited computing abilities of the nodes in a network present a major challenge in the design and deployment of a wireless sensor network. This thesis aims to present energy efficient algorithm for data delivery in a sensor network. The methodology of data delivery presented in this thesis is based on affine transform and performs coordination compression. Experimental results show that the algorithm can reduce about half of the data amount delivered by the sensor.


Sign in / Sign up

Export Citation Format

Share Document