scholarly journals Co-operative Detection for Malicious Nodes in Under-Attack WSN

2018 ◽  
Vol 7 (2.24) ◽  
pp. 489
Author(s):  
Shweta Ranjan Vikas ◽  
B Priyalakshmi ◽  
Nikita Gautam ◽  
Sairam Potti

The network security must be taken into consideration in wireless sensor networks. In our project, we take sensor node data falsification (SNDF) attack using malicious nodes and co-operative detection is used. Fusioncentre collects information from the nodes created in a cluster environment and makes a global decision. The protocol used here is Ad-hoc-on demand distance vector[5] (AODV) and the performance analysis is done using parameters such as throughput and End-to-end delay. The stimulation is done in NS2 using network animator and graphical results are taken.The throughput will be increased compared to the existing system whereas End-to-End delay will be decreased.  

2018 ◽  
Vol 7 (2.31) ◽  
pp. 1
Author(s):  
C Cynthia, Prudhvi Krishna Saguturu ◽  
Komali Bandi ◽  
Srikanth Magulluri ◽  
T Anusha

In Wireless sensor networks and ad hoc networks nodes have a freedom to move from one place to another, they are self-configuring this type of the structure fulfil the requirements of several application. A survey on the different MANET protocols will be done in this paper. Mainly this paper will focus on the Quality of Service on the different parameters like Throughput and Delay between different protocols like AODV (Ad Hoc on Demand Distance Vector), DSDV (Destination-Sequenced Distance-Vector Routing), DSR (Dynamic Source Routing), and TORA (Temporary Ordered Routing Algorithm). DSDV is called as proactive protocol because they know everything about the nodes in the network before the communication start. DSR, AODV, TORA protocols are called reactive protocol because nodes in this network do not know anything about network. They are also called ON-DEMAND routing protocols. After this analysis you will come to know which MANET protocol is best for different application. 


The fundamental capacity of a sensor system is to accumulate and forward data to the destination. It is crucial to consider the area of gathered data, which is utilized to sort information that can be procured using confinement strategy as a piece of Wireless Sensor Networks (WSNs).Localization is a champion among the most basic progressions since it agreed as an essential part in various applications, e.g., target tracking. If the client can't gain the definite area information, the related applications can't be skillful. The crucial idea in most localization procedures is that some deployed nodes with known positions (e.g., GPS-equipped nodes) transmit signals with their coordinates so as to support other nodes to localize themselves. This paper mainly focuses on the algorithm that has been proposed to securely and robustly decide thelocation of a sensor node. The algorithm works in two phases namely Secure localization phase and Robust Localization phase. By "secure", we imply that malicious nodes should not effectively affect the accuracy of the localized nodes. By “robust”, we indicate that the algorithm works in a 3D environment even in the presence of malicious beacon nodes. The existing methodologies were proposed based on 2D localization; however in this work in addition to security and robustness, exact localization can be determined for 3D areas by utilizing anefficient localization algorithm. Simulation results exhibit that when compared to other existing algorithms, our proposed work performs better in terms of localization error and accuracy.


Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 343 ◽  
Author(s):  
Dezhi Han ◽  
Yunping Yu ◽  
Kuan-Ching Li ◽  
Rodrigo Fernandes de Mello

The Distance Vector-Hop (DV-Hop) algorithm is the most well-known range-free localization algorithm based on the distance vector routing protocol in wireless sensor networks; however, it is widely known that its localization accuracy is limited. In this paper, DEIDV-Hop is proposed, an enhanced wireless sensor node localization algorithm based on the differential evolution (DE) and improved DV-Hop algorithms, which improves the problem of potential error about average distance per hop. Introduced into the random individuals of mutation operation that increase the diversity of the population, random mutation is infused to enhance the search stagnation and premature convergence of the DE algorithm. On the basis of the generated individual, the social learning part of the Particle Swarm (PSO) algorithm is embedded into the crossover operation that accelerates the convergence speed as well as improves the optimization result of the algorithm. The improved DE algorithm is applied to obtain the global optimal solution corresponding to the estimated location of the unknown node. Among the four different network environments, the simulation results show that the proposed algorithm has smaller localization errors and more excellent stability than previous ones. Still, it is promising for application scenarios with higher localization accuracy and stability requirements.


Sign in / Sign up

Export Citation Format

Share Document