Node-Level Trust Evaluation in Wireless Sensor Networks

•Download as DOCX, PDF•

0 likes•32 views

Node-Level Trust Evaluation in Wireless Sensor Networks To buy this project in ONLINE, Contact: Email: jpinfotechprojects@gmail.com, Website: https://www.jpinfotech.org

Education

Node-Level Trust Evaluation in Wireless Sensor Networks
ABSTRACT:
Traditional cryptographic methods do not cater to the limitations of Wireless
Sensor Networks WSNs primarily concerning code size, processing time, and
power consumption. The study in this paper enumerates the security primitives in
WSNs and accentuates the strength of trust evaluation as a security solution within
the WSN precincts. The paper proposes a trust evaluation methodology that
evaluates a node-level trust by using an internal resource of a node. It is completely
mediating technique which is independent of network topology and second-hand
information. The Challenge-Response model enables a node to evaluate trust for
itself; and with its peer-node/s with which it intends to interact using the proposed
Self-Scrutiny and Self-Attestation algorithms, respectively. The efficacy of the
proposed software-based methodology and the algorithms is demonstrated with the
actual implementation on sensor nodes. The ability to counter attack-scenarios
along with the analysis exhibit the merit of the proposed work. The average values
of the observed results illustrates the consistency and robust performance of the
proposedtrust evaluation algorithms.
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
 System : Pentium Dual Core.
 Hard Disk : 120 GB.
 Monitor : 15’’ LED

 Input Devices : Keyboard, Mouse
 Ram : 1 GB
SOFTWARE REQUIREMENTS:
 Operating system : UBUNTU/Windows XP/7
 Implementation : NS2
 NS2 Version : NS2.2.28
 Front End : OTCL (Object Oriented Tool
Command Language)
 Tool : Cygwin (To simulate in Windows
OS)
REFERENCE:
S Sundeep Desai and Manisha J Nene, “Node-Level Trust Evaluation in Wireless
Sensor Networks”, IEEE Transactions on Information Forensics and Security,
Volume: 14, Issue: 8, Aug. 2019.

What's hot

top-k query result completeness verification in tiered sensor networks

swathi78

Privacy preserving and truthful detection of packet dropping attacks in wirel...

LogicMindtech Nologies

DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Privacy preserving distributed profi...

IEEEGLOBALSOFTTECHNOLOGIES

However, the problem of authentication and pairwise key establishment in sensor networks with MSs is still not solved in the face of mobile sink replication attacks. For the basic probabilistic [12] and q-composite [13] key predistribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of the network sensor nodes, making it possible for the attacker to take control of the entire network by deploying a replicated mobile sink, preloaded with some compromised keys to authenticate and then initiate data communication with any sensor node.

The three tier security scheme in wireless

IMPULSE_TECHNOLOGY

Security is the major challenge for Wireless Sensor Networks (WSNs). The sensor nodes are deployed in non controlled environment, facing the danger of information leakage, adversary attacks and other threats. Trust and Reputation models are solutions for this problem and to identify malicious, selfish and compromised nodes. This paper aims to evaluate varying collusion effect with respect to static (SW), dynamic (DW), static with collusion (SWC), dynamic with collusion (DWC) and oscillating wireless sensor networks to derive the joint resultant of Eigen Trust Model. An attempt has been made for the same by comparing aforementioned networks that are purely dedicated to protect the WSNs from adversary attacks and maintain the security issues. The comparison has been made with respect to accuracy and path length and founded that, collusion for wireless sensor networks seems intractable with the static and dynamic WSNs when varied with specified number of fraudulent nodes in the scenario. Additionally, it consumes more energy and resources in oscillating and collusive environments.

Modelling of A Trust and Reputation Model in Wireless Networks

ijeei-iaes

Wormhole attack detection algorithms

kitechsolutions

Adaptive distributed outlier detection for ws ns

LogicMindtech Nologies

An efficient distributed trust model for wireless sensor networks

LogicMindtech Nologies

Wireless sensor network (WSN) is regularly deployed in unattended and hostile environments. The WSN is vulnerable to security threats and susceptible to physical capture. Thus, it is necessary to use effective mechanisms to protect the network. It is widely known, that the intrusion detection is one of the most efficient security mechanisms to protect the network against malicious attacks or unauthorized access. In this paper, we propose a hybrid intrusion detection system for clustered WSN. Our intrusion framework uses a combination between the Anomaly Detection based on support vector machine (SVM) and the Misuse Detection. Experiments results show that most of routing attacks can be detected with low false alarm.

NOVEL HYBRID INTRUSION DETECTION SYSTEM FOR CLUSTERED WIRELESS SENSOR NETWORK

IJNSA Journal

Local area prediction based mobile target tracking in wireless sensor networks

LogicMindtech Nologies

A secure scheme against power exhausting attacks in hierarchical wireless sen...

LogicMindtech Nologies

Mac layer selfish misbehavior in ieee 802.11 ad hoc networks detection and de...

LogicMindtech Nologies

Bioinformatics combines the elements of biology, computer science, and statistics to work with genome sequencing. My project utilizes a sequence analysis technique, k-mer minimizers, to identify bacterium from a shotgun genomic DNA sample. We used the algorithm Bevel to compare DNA sequences against standardized reference genomes in the PATRIC whole genome bacterial database. Bevel is a sequence similarity tool that uses a minimizer database. Minimizers are representative k-mers, subsequences of length k observed to have the minimum hash value across a genomic region and are therefore unique and comparable to that genomic region. The two databases are queried against each other, resulting in a list of positions where two or more sequences match. I am developing two Python applications that first, process the results of the algorithm and secondly, return a score that enable the ranking of bacterium matches. The higher the score, the better the match between the unknown bacteria and the standardized reference genome. The goal of this experiment is to show that minimizers are a fast mean of characterizing bacterial shotgun assembly contigs.

The Use of K-mer Minimizers to Identify Bacterium Genomes in High Throughput ...

Mackenna Galicia

Wormhole attack detection algorithms in wireless network coding systems

Pvrtechnologies Nellore

Web administrators should pay special attention and closely inspect web sessions that correspond to web robots; because the traffic of these autonomous systems occupies the bandwidth, reduces the performance of web servers and in some cases, threaten the security of human users. In this research, we propose a novel fuzzy algorithm based on the decision trees. In order to overcome the curse of dimensionality issue and facilitate the designing of the fuzzy inference system, we use a correlation analysis to eliminate some features. For converting each filtered attribute to a fuzzy variable, a C4.5 decision tree is used. It is worth mentioning that making a decision tree is based on choosing the best feature with the most information gain metric in each level of the tree. Therefore, we can reduce the number of attributes again. Finally, the fuzzy rules are extracted from the C4.5 decision tree and the fuzzy inference model is made.

Mahdieh zabihi imc45-Fuzzy Inference for Intrusion Detection of Web Robots in...

Wright State University, Dayton, OH, USA

A1803060110

IOSR Journals

In wireless sensor and actor networks (WSAN), the sensor nodes have a limitation on lifetime as they are equipped with non-chargeable batteries. The failure probability of the sensor node is influenced by factors like electrical dynamism, hardware disasters, communication inaccuracy and undesired environment situations, etc. Thus, fault tolerant is a very important and critical factor in such networks. Fault tolerance also ensures that a system is available for use without any interruption in the presence of faults. In this paper an improved fault tolerance scheme is proposed to find the probability of correctly identifying a faulty node for three different types of faults based on normal bias. The nodes fault status is declared based on its confidence score that depends on the threshold valve. The aim is to find the Correct Recognition Rate (CRR) and the False Fear Rate (FFR) with respect to the different error probability (pe) introduced. The techniques, neighboring nodes, fault calculations, range and CRR for existing algorithm and proposed algorithm is also presented.

Fault Diagonosis Approach for WSN using Normal Bias Technique

IDES Editor

Hop by hop message authentication chapter 1

Selva Raj

Machine Learning Project

butest

What's hot (19)