Computer Science – Networking and Internet Architecture
Scientific paper
2009-11-22
Computer Science
Networking and Internet Architecture
26 pages, single column, extension from a preliminary version appeared in IEEE WCNC 2009
Scientific paper
Sensor networks are vulnerable to \emph{false data injection attack} and \emph{path-based DoS} (PDoS) attack. While conventional authentication schemes are insufficient for solving these security conflicts, an \emph{en-route filtering} scheme acts as a defense against these two attacks. To construct an efficient en-route filtering scheme, this paper first presents a Constrained Function based message Authentication (CFA) scheme, which can be thought of as a hash function directly supporting the en-route filtering functionality. Together with the \emph{redundancy property} of sensor networks, which means that an event can be simultaneously observed by multiple sensor nodes, the devised CFA scheme is used to construct a CFA-based en-route filtering (CFAEF) scheme. In contrast to most of the existing methods, which rely on complicated security associations among sensor nodes, our design, which directly exploits an en-route filtering hash function, appears to be novel. We examine the CFA and CFAEF schemes from both the theoretical and numerical aspects to demonstrate their efficiency and effectiveness.
Kuo Sy-Yen
Lu Chun-Shien
Yu Chia-Mu
No associations
LandOfFree
Constrained Function Based En-Route Filtering for Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Constrained Function Based En-Route Filtering for Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constrained Function Based En-Route Filtering for Sensor Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-418009