Resilient security for false event detection without loss of legitimate events in wireless sensor networks

Authors:
Yuichi Sei;Shinichi Honiden
Affiliations:
Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan and Japan Society for the Promotion of Science, Tokyo, Japan;Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan and National Institute of Informatics, Tokyo, Japan
Venue:
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Year:
2007

Citing 20
Cited 0

Message authentication with one-way hash functions

ACM SIGCOMM Computer Communication Review
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
SPINS: security protocols for sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Denial of Service in Sensor Networks

Computer
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Toward resilient security in wireless sensor networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Localization and routing in sensor networks by local angle information

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A probabilistic voting-based filtering scheme in wireless sensor networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
GRAdient broadcast: a robust data delivery protocol for large scale sensor networks

Wireless Networks
Secure hierarchical in-network aggregation in sensor networks

Proceedings of the 13th ACM conference on Computer and communications security
StarDust: a flexible architecture for passive localization in wireless sensor networks

Proceedings of the 4th international conference on Embedded networked sensor systems
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms

Proceedings of the 4th international conference on Embedded networked sensor systems
STEF: A Secure Ticket-Based En-route Filtering Scheme for Wireless Sensor Networks

ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
On supporting distributed collaboration in sensor networks

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Statistical en-route filtering of injected false data in sensor networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

When large-scale wireless sensor networks are deployed in hostile environments, the adversary may compromise some sensor nodes and use them to generate false sensing reports or to modify the reports sent by other nodes. Such false events can cause the user to make bad decisions. They can also waste a significant amount of network resources. Unfortunately, most current security designs have drawbacks; they either require their own routing protocols to be used, or lose legitimate events stochastically and completely break down when more than a fixed threshold number of nodes are compromised. We propose a new method for detecting false events that does not suffer from these problems. When we set the probability of losing legitimate events to 1%, our proposal method can detect more false events than related method can. We demonstrate this by mathematical analysis and simulation.