Abstract

Wireless sensor networks (WSNs) are open to false data injection attack when they are deployed in hostile scenarios. Attackers can easily deceive the sink by compromising sensing nodes or by injecting phoney data into the network. Such attacks can deplete the energy resources of the network by providing wrong information which in turn can affect the proper network functioning or sometimes can shut the network from further functioning. The existing schemes that deal with this problem focus on only a few aspects of the false data injection attack. To resolve this problem, we propose a Rank-based Report Filtering Scheme (RRFS), a holistic and group verification scheme for the identification of compromised nodes and the filtering of false data injected into the network. The proposed scheme verifies report among clusters, en-routers, and sink. Hence, the RRFS, a holistic scheme that is composed of three-tier verifications, successfully rejects the false data before the attackers falsify the whole environment, and this makes the system unique. Reliability Index (RI) is calculated by the nodes for fellow cluster members, and the cluster head (CH) provides the score for a node based on its RI. This, in turn, strengthens the scheme by assisting the en-routers to detect the compromised nodes. The RRFS scheme has been verified and validated by extensive simulation and meticulous performance evaluation of filtering efficiency and energy consumption against various schemes. The scheme gives high filtering efficiency against the multiple compromised nodes and also improves the network’s lifespan. The sustainability of RRFS against numerous attacks that are launched in the sensor environment is thoroughly investigated.

Highlights

  • Wireless sensor network is a collection of sensor nodes that works together to sense various physical parameters by monitoring the given domain [1]

  • (i) Uses Message Authentication Polynomials (MAPs) (ii) Cluster-based approach (i) Does not have a fixed path (ii) Cluster-based approach (i) T threshold limitation (ii) Storage overhead (i) One-way authentication KAEF (ii) Verification based on stored information (i) New keys for every session (ii) The hash function for chain maintenance (i) Need for key reinitiation (i) Time-based filtering scheme Time-based Dynamic Keying and En-route Filtering (TICK) (ii) Key generation based on clock function (i) No need for a key exchange (i) Not for an uncontrolled environment go unnoticed/undetected

  • We analyze the capability of the Report Filtering Scheme (RRFS) scheme in sustaining the following four major attacks that are frequently launched in Wireless sensor networks (WSNs): (i) node compromise attack, (ii) false data injection attack, (iii) report disruption attack, and (iv) selective forwarding attack

Read more

Summary

Introduction

Wireless sensor network is a collection of sensor nodes that works together to sense various physical parameters by monitoring the given domain [1]. Rank-based Report Filtering Scheme (RRFS) for verifying phoney reports in wireless sensor networks is proposed in this paper to filter the false data injected into the network. The en-routers can perform cross-verification and ensure that phoney reports will be filtered with a very high probability even if some portion of the network fails in preventing them (iii) Another parameter that plays a major role in the proposed scheme is the score (S) which is calculated by the CH based on RI of the constituent nodes.

Related Works
System Model
Preliminaries
Proposed RRFS
Performance Evaluation
Discussion
Node Compromise Attack
False Data Injection Attack
Report Disruption Attack
Selective Forwarding Attack
Findings
Conclusion and Future Enhancement
Ethical Approval
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.