Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks Using Sequential Hypothesis Testing

N.Anitha J.Jayakodi S.Monisha

(10208104003) (10208104027) (10208104045)

Aim
A fast and effective mobile replica node detection. To detect replica node attacks Sequential Probability Ratio Test (SPRT)

Abstract
Sensor nodes report to base station. Malicious attacks in sensor networks. Dangerous attack is the replica node attack. Time and effort.

Tackle the problem of replica node.

Encrypt, decrypt and authenticate.

Clocks of all nodes are loosely synchronized.

Base station communication.

Domain
MOBILE COMPUTING Mobile replica node detection. Obtaining the distance information. Communication is bidirectional.

Null and Hypothesis testing problem.

Modules :
Neighbour node detection. Data communication. Attacker models.

Hardware requirements :

Windows operating systems.

Jdk 1.6

JavaFX 1.3
Software requirements :

Hard disk : 40GB and above.

RAM : 512MB and above. Processor : pentium iv and above

Existing System
Static sensor networks.

Static nodes mimic the movement.

No encryption and decryption.

Proposed System
Nodes to encrypt, decrypt and authenticate communications. Sequential Hypothesis Test (SHT).

Sensor networks in various applications.

Detection accuracy.

Capture the original node.

Detecting the neighbour nodes.

Tolerate potentially compromised source nodes.

Two asynchronous phases. Secure Single hop pair wise synchronization. Secure and global time synchronization.

Architecture Diagram
Base Station

SN

SN

SN

AN

SN

SN AN-Attack node Normal data Attack data

Neighbour node detection

Two-dimensional mobile sensor network

System-configured maximum speed Mobile sensor network communicate with a base station

Data communication

Bidirectional

Normal data communication

Elliptic curve cryptography Algorithm

Attacker Models
Sequential Hypothesis Testing Null hypothesis Alternative hypothesis

Literature Survey
S.N o Title, Author, Publication name, year Inference of the paper Conclusion

1.

TITLE: Localized Multicast: Efficient and Distributed Replica Detection in LargeScale Sensor Networks BY:BoZhu; Setia.S, Jajodia.S, Roy.S.,Lingyu Wang; Publication name: Mobile Networks and Applications, vol :9 Issue:7. pp. 913 926 YEAR: July 2010

Efficient in communication and memory costs in large-scale sensor networks, and at the same time achieves a higher probability of detecting node replicas.

Localized Multicast is used for detecting node replication attacks .

S.N o 2.

Title, Author, Publication name, year TITLE: Controlled Wi-Fi Sharing in Cities: A Decentralized Approach Relying on Indirect Reciprocity

Inference of the paper the provision of citywide broadband communication capability to mobile users through private Wi-Fi networks that are in range but belong to others.

Conclusion

club algorithms are used in decentralized approach.

BY:Efstathiou, E.C.Franoudis, P.A.Polyzos. Publication name: Mobile Networks and Applications, vol :9 Issue:7. pp. 1147 1160 YEAR: Aug. 2010

S.N o

Title, Author, Publication name, year

Inference of the paper

Conclusion

3.

TITLE: Multicast Authentication Based on Batch Signature

Eliminates the correlation among packets and thus provides the perfect BY: Yun Zhou; Xiaoyan resilience to packet Zhu; Yuguang Fang; loss Publication name: Mobile Networks and Applications, vol :9 Issue:7. pp. 982 993 YEAR: July 2010

Efficient cryptographic primitive called batch signature is used for authentication.

S.N o

Title, Author, Publication name, year

Inference of the paper

Conclusion

4.

TITLE: Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Route BY: Tao Shu; Krunz, M.; Sisi Liu; ; Publication name: Mobile Networks and Applications, vol :9 Issue:7. pp. 941 954 YEAR: July 2010

data delivery mechanisms that can withstand high probability black holes formed by Compromised node and denial of service attacks. .

optimization problem to minimize the endto-end energy consumption

S.N o

Title, Author, Publication name, year

Inference of the paper

Conclusion

5.

TITLE: Virtual EnergyBased Encryption and Keying for Wireless Sensor Networks BY:Uluagac.A.S.; Beyah.R.A.;YingshuLi; Copeland,J.A.; Publication name : Mobile Networks and Applications, vol :9 Issue:7. pp. 994 1007 YEAR: July 2010

Designing costefficient, secure network protocols for Wireless Sensor Networks (WSNs).

VEBEK is able to efficiently detect and filter false data injected into the network by malicious outsiders.

Application and Future Enhancement

Replica detection scheme for mobile sensor networks based on the SPRT.

Showed the limitations of a group attack strategy in which the attacker controls the movements of a group of replicas..

conclusion

Limitations of attackers strategy.

Limit on the amount of time. Nash equilibrium.

d23hwgftur

My name My position, contact information or project description

References
C.-M. Yu, C.-S. Lu, and S.-Y. Kuo, Efficient and Distributed Detection of Node Replication Attacks in Mobile Sensor Networks, Proc. IEEE Vehicular Technology Conf. Fall (VTC Fall), Sept. 2009. G. Theodorakopoulos and J.S. Baras, Game Theoretic Modeling of Malicious Users in Collaborative Networks, IEEE J. Selected Areas in Comm., vol. 26, no. 7, pp. 1317-1326, Sept. 2008.

H. Wang, B. Sheng, C.C. Tan, and Q. Li, Comparing SymmetricKey and Public-Key Based Security Schemes in Sensor Networks: A Case Study of User Access Control, Proc. IEEE Intl Conf. Distributed Computing Systems (ICDCS), pp. 11-18, June 2008. K. Xing, F. Liu, X. Cheng, and H.C. Du, Real-Time Detection of Clone Attacks in Wireless Sensor Networks, Proc. IEEE Intl Conf. Distributed Computing Systems (ICDCS), pp. 3-10, June 2008.

Thank you