Detecting Malicious Sensor Nodes from Learned data Patterns

Sensor network applications may involve dealing with the remote, distributed monitoring of inaccessible and hostile locations. These networks are vulnerable to security breaches both physically and electronically. The sensor nodes, once compromised, can send erroneous data to the base station ,thereby possibly compromising network effectiveness. The sensor nodes are organized in a hierarchy where the non-leaf nodes serve as the aggregators of the data value sensed at the leaf level and the root node is considered the Base Station. In current researh on sensor networks outlier detection mechanisms are used by a parent node to detect erroneous children nodes among its children as it is assumed that the data reported by the children comes from the same distribution and they are of almost equal values. But outlier detection mechanisms are not applied for networks where sensed data varies widely over the region of deployment. So in such a scenario we have used offline neural network based learning technique to model spatial patterns in sensed data. Then the nets are used to predict the sensed data at any node given the data reported by its neighbors, when they work online. The differences between the value predicted and the corresponding one reported by the node is measured. Each node incrementally updates the reputations of its child nodes based on those calculated differences. We have used robust schemes like Q-learning and Beta reputation based approaches to detect compromised or faulty nodes. We have evaluated the robustness of our detection scheme by varying the members of compromised nodes, error types, patterns in sensed data

[1]  C. Karlof,et al.  Secure routing in wireless sensor networks: attacks and countermeasures , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[2]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[3]  Kang G. Shin,et al.  LiSP: A lightweight security protocol for wireless sensor networks , 2004, TECS.

[4]  Baruch Awerbuch,et al.  Provably Secure Competitive Routing against Proactive Byzantine Adversaries via Reinforcement Learning , 2003 .

[5]  Deborah Estrin,et al.  Impact of network density on data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[6]  Shivakant Mishra,et al.  INSENS: Intrusion-Tolerant Routing in Wireless Sensor Networks , 2002 .

[7]  Sencun Zhu,et al.  SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks , 2006, MobiHoc '06.

[8]  Anupam Joshi,et al.  Security in Sensor Networks , 2020, Texts in Computer Science.

[9]  Shivakant Mishra,et al.  INSENS: Intrusion-Tolerant Routing in Wireless Sensor Networks ; CU-CS-939-02 , 2002 .

[10]  Sushil Jajodia,et al.  LEAP+: Efficient security mechanisms for large-scale distributed sensor networks , 2006, TOSN.

[11]  Cyrus Shahabi,et al.  Supporting spatial aggregation in sensor network databases , 2004, GIS '04.

[12]  Tarek F. Abdelzaher,et al.  AIDA: Adaptive application-independent data aggregation in wireless sensor networks , 2004, TECS.

[13]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[14]  Mani B. Srivastava,et al.  Reputation-based framework for high integrity sensor networks , 2008, TOSN.

[15]  Haiyun Luo,et al.  Statistical en-route filtering of injected false data in sensor networks , 2005, IEEE J. Sel. Areas Commun..

[16]  Srinivasan Seshan,et al.  Cache-and-query for wide area sensor databases , 2003, SIGMOD '03.

[17]  Dawn Xiaodong Song,et al.  SIA: secure information aggregation in sensor networks , 2003, SenSys '03.