Performance and reliability analysis of computer systems: an example-based approach using the SHARPE software package
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Location verification and trust management for resilient geographic routing
Journal of Parallel and Distributed Computing
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Reputation-based framework for high integrity sensor networks
ACM Transactions on Sensor Networks (TOSN)
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
Group-Based Trust Management Scheme for Clustered Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Hybrid trust and reputation management for sensor networks
Wireless Networks
Reliability of wireless sensors with code attestation for intrusion detection
Information Processing Letters
Mixed-Strategy game based trust management for clustered wireless sensor networks
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Hi-index | 0.00 |
In this work, we propose a highly scalable cluster-based hierarchical trust management protocol for wireless sensor networks to effectively deal with selfish or malicious nodes. Unlike prior work, we consider multidimensional trust attributes derived from communication and social networks to evaluate the overall trust of a sensor node. Our peer-to-peer trust evaluation method leverages the cluster-based hierarchical structure for efficient communications. We develop a probability model using stochastic Petri net techniques to analyze the performance of the proposed trust management protocol. We validate the protocol design by comparing subjective trust generated as a result of protocol execution against objective trust obtained from actual node status. We apply our hierarchical trust management protocol to trust-based geographical routing as an application. Our results demonstrate that trust-based geographic routing under identified design settings can approach the ideal performance level achievable by flooding-based routing in message delivery ratio and message delay without incurring substantial message overhead. Furthermore, it can significantly outperform traditional geographic routing protocols that do not use trust concept in selecting forwarding nodes in message delivery ratio over a wide range of design parameter settings.