ZONETRUST: FAST ZONE-BASED NODE COMPROMISE DETECTION AND REVOCATION IN WIRELESS SENSOR NETWORKS USING SEQUENTIAL HYPOTHESIS TESTING

ABSTRACT Due to the unattended nature of wireless sensor networks, an adversary can physically capture and compromise sensor nodes and then mount a variety of attacks with these compromised nodes. To minimize the damage incurred by compromised nodes, the system should detect and revoke them as soon as possible. To meet this need, several researchers have recently proposed a variety of node compromise detection schemes. Reputation-based trust management schemes identify malicious nodes but do not revoke them. Software-attestation schemes leverage the software attestation techni ue to detect the subverted software modules of compromised nodes. !owever, they re uire each sensor node to be attested periodically, which would incur substantial overhead. To mitigate the limitations of previous schemes, we propose a zone-based node compromise detection scheme in sensor networks. The main idea of the proposed scheme is to use se uential hypothesis testing to detect suspect regions in which compromised nodes are likely placed. "n these suspect regions, nodes perform software attestation, leading to the detection and revocation of the compromised nodes. Through analysis and simulation, we show that the proposed scheme provides effective and robust compromised sensor node detection capability with little overhead.

INTRODUCTION Sensor networks can be deployed in hostile environments where adversaries may be present. Since wireless sensor networks usually need to be controlled remotely by the network operator, they are often deployed in an unattended manner. The unattended nature of wireless sensor networks can be e#ploited by attackers. Specifically, an attacker can capture and compromise sensor nodes and launch a variety of attacks by leveraging compromised nodes.

PROBLEM STATEMENT $ttacker can simply monitor a significant fraction of the network traffic that would pass through these compromised nodes. $lternatively, he could in%ect falsified data to corrupt monitoring operation of the sensors. $ more aggressive attacker could undermine common sensor network protocols, including cluster formation, routing, and data aggregation, thereby causing continual disruption to the network operations. Therefore, an adversary with compromised nodes can paralyze the deployed mission of sensor networks. "n this sense, it is very important to detect and revoke compromised nodes as soon as possible in the network.

EXISTING SYSTEM Reputation-based trust management schemes have been proposed to manage an individual node&s trust in accordance with its activities. Software-attestation based schemes have also been proposed to attest flash image codes and detect subverted image codes of compromised sensor nodes. Disa !a"#a$%s "n Reputation-based trust management schemes, malicious nodes can be identified, but they are not easily revoked due to the risk of false positives. Software-attestation based schemes achieve high node compromise detection capability, they re uire each sensor node to be periodically attested, as it cannot be predicted when the attacker will compromise sensors. This periodic attestation will incur substantial overhead in terms of computation and communication. PROPOSED SYSTEM 'ropose a reputation-based trust management scheme that is designed to facilitate fast detection and revocation of compromised nodes. The key idea of our scheme is to detect untrustworthy zones and perform software attestation against nodes in these zones to detect and revoke the ones that are compromised. Specifically, we first divide the network into a set of zones, establish trust levels for each zone, and detect untrustworthy zones by using the Se uential 'robability Ratio Test (S'RT). The S'RT decides a zone to be untrustworthy if the zone&s trust is continuously maintained at low level or is uite often changed from high level to low level. *nce a zone is determined to be untrustworthy, the base station or the network operator performs software attestation against all nodes in the untrustworthy zone, detects compromised nodes with subverted software modules, and physically revokes them. The main benefit of this zone-based detection approach lies in achieving fast node compromise detection and revocation while saving the large amount of time and effort that would be incurred from using periodic software attestation. +y detecting an entire zone at once, the system can identify the appro#imate source of bad behavior and react uickly, rather than waiting for a specific node to be identified. $lso,

when multiple nodes are compromised in one zone, they can all be detected and revoked at one time. A !a"#a$%s This approach is also robust. "dentify untrustworthy zones with low error rates. ,here using other reputation-based systems to revoke misbehaving nodes can suffer from false positives.

ASSUMPTIONS MADE ,e study compromised node detection in a two-dimensional static sensor network in which the locations of sensor nodes do not change after deployment. ,e also assume that all direct communication links between sensor nodes are bidirectional. This communication model is common in the current generation of sensor networks.

LITERATURE SURVEY There are a number of works on node compromise detection in wireless sensor networks. Software-attestation based schemes have been proposed to detect the subverted software modules of sensor nodes. Specifically, the base station checks whether the flash image codes have been maliciously altered by performing attestation randomly chosen portions of image codes or the entire codes. $ sensor node&s image codes are attested by its neighbors. !owever, all these schemes re uire each sensor to be periodically attested and thus incur a large overhead in terms of communication and computation. Reputation-based trust management schemes have been proposed to manage individual node&s trust in accordance with its actions. Specifically, -aneriwal et al. proposed a reputation-based trust management scheme in which a +ayesian formulation is used to compute an individual node&s trust. Sun et al. proposed information theoretic frameworks for trust evaluation. Specifically, entropy-based and probability-based schemes have been proposed to compute an individual node&s trust. .i et al. leveraged node mobility to reduce an uncertainty in trust computation and speed up the trust convergence.

!owever, these trust management schemes do not revoke compromised nodes and thus compromised nodes can keep performing malicious activities in the network. "D traceback schemes have been proposed to locate the malicious source of false data. !owever, they only trace a source of the data sent to the base station and thus they do not locate the malicious sources that send false data or control messages to other benign nodes in the network. Replica node detection schemes can also be considered as related works. "n replica node attacks, the attacker generates many replicas of a compromised node to reduce the time and effort needed to compromise the e uivalent number of benign nodes. Replica nodes can be detected by leveraging a node&s location information.

SYSTEM REQUIREMENTS: Ha& 'a&% &%()i&%*%"#s: 'rocessor Ram !ard Disk 6ompact Disk "nput device *utput device S+,#'a&% &%()i&%*%"#s: *perating System .anguage :ront <nd Database / ,indows :amily. / ;D8 3.0 / ;ava Swing / 2yS=. 0.1 / $ny 'rocessor above 011 2!z. / 3452b. / 31 -b. / 701 2b. / Standard 8eyboard and 2ouse. / 9-$ and !igh Resolution 2onitor.

SYSTEM ARCHITECTURE

Base Station

ZA Node A

ZB Node B

ZC Node C

ZD Node B

Identify compromised node ZA, ZB, ZC, ZD Zone details of Node A,B,C,B respectively