Weighted trust evaluation-based malicious node detection for wireless sensor networks
TL;DR: A novel algorithm based on Weighted Trust Evaluation (WTE) to detect malicious nodes for hierarchical sensor networks is proposed in this paper and detects malicious nodes by examining their weights that represent the reliability of SNs.
read more
Abstract: Deployed in a hostile environment, the individual Sensor Node (SN) of a Wireless Sensor Network (WSN) could be easily compromised by an adversary due to constraints such as limited memory space and computing capability. Therefore, it is critical to detect and isolate compromised nodes in order to avoid being misled by the falsified information injected by adversaries through compromised nodes. However, it is challenging to secure the flat topology networks effectively because of the poor scalability and high communication overhead. On top of a hierarchical WSN architecture, a novel algorithm based on Weighted Trust Evaluation (WTE) to detect malicious nodes for hierarchical sensor networks is proposed in this paper. The hierarchical network can reduce the communication overhead among SNs by utilising clustered topology. The proposed algorithm models a cluster of SNs and detects malicious nodes by examining their weights that represent the reliability of SNs. Through intensive simulations, the accuracy and effectiveness of the proposed detection algorithm are verified.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Reputation-Based Frameworks for High Integrity Sensor Networks
TL;DR: In this paper, a reputation-based framework for sensor networks where nodes maintain reputation for other nodes and use it to evaluate their trustworthiness has been proposed, which provides a scalable, diverse and a generalized approach for countering all types of misbehavior resulting from malicious and faulty nodes.
766
Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection
TL;DR: This work proposes a highly scalable cluster-based hierarchical trust management protocol for wireless sensor networks (WSNs) to effectively deal with selfish or malicious nodes and discovers that there exists an optimal trust threshold for minimizing false positives and false negatives.
483
Detecting sybil attacks in clustered wireless sensor networks based on energy trust system (ETS)
TL;DR: The proposed energy trust system for WSNs to effectively detect sybil attacks employs multi-level detection based on identity and position verification and reduces communication overhead, memory overhead, and energy consumption by eliminating the exchange of feedback and recommendation messages among sensor nodes.
63
An efficient weighted trust-based malicious node detection scheme for wireless sensor networks
Firas Zawaideh,Muhammed Salamah +1 more
TL;DR: An efficient weighted trust‐based malicious node detection (WT‐MND) scheme that can detect malicious nodes in a clustered WSN and sustains its efficient characteristics without significant power consumption overheads is proposed.
41
Exposing WPA2 security protocol vulnerabilities
TL;DR: The aim of this paper is to present a methodology that demonstrates how the WPA2 security protocol can be fully exposed by malicious attacks.
34
References
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Secure routing in wireless sensor networks: attacks and countermeasures
Chris Karlof,David Wagner +1 more
- 11 May 2003
TL;DR: This work proposes security goals for routing in sensor networks, shows how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensors, and introduces two classes of novel attacks against sensor networks sinkholes and HELLO floods.
Next century challenges: scalable coordination in sensor networks
Deborah Estrin,Ramesh Govindan,John Heidemann,Satish K.S. Kumar +3 more
- 01 Aug 1999
TL;DR: This paper believes that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor network coordination.
3.1K
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Sencun Zhu,Sanjeev Setia,Sushil Jajodia +2 more
- 27 Oct 2003
TL;DR: The Localized Encryption and Authentication Protocol (LEAP) as discussed by the authors is a key management protocol for sensor networks that is designed to support in-network processing, while at the same time restricting the security impact of a node compromise to the immediate network neighborhood of the compromised node.
1.1K