Optimal Activation of Intrusion Detection Agents for Wireless Sensor Networks Yulia Ponomarchuk and Dae-Wha Seo Kyungpook National University, Republic.

Slides:



Advertisements
Similar presentations
Chris Karlof and David Wagner
Advertisements

Jason Li Jeremy Fowers. Background Information Wireless sensor network characteristics General sensor network security mechanisms DoS attacks and defenses.
Security in Mobile Ad Hoc Networks
Trust relationships in sensor networks Ruben Torres October 2004.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
Application of Bayesian Network in Computer Networks Raza H. Abedi.
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 4.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Security.
Jorge Hortelano, Juan Carlos Ruiz, Pietro Manzoni
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
Secure Routing in Sensor Networks: Attacks and Countermeasures First IEEE International Workshop on Sensor Network Protocols and Applications 5/11/2003.
SUMP: A Secure Unicast Messaging Protocol for Wireless Ad Hoc Sensor Networks Jeff Janies, Chin-Tser Huang, Nathan L. Johnson.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
1 Somya Kapoor Jorge Chang Amarnath Kolla. 2 Agenda Introduction and Architecture of WSN –Somya Kapoor Security threats on WSN – Jorge Chang & Amarnath.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Intrusion Detection in Wireless Sensor Networks Group Meeting Spring 2005 Presented by Edith Ngai.
Security in Wireless Sensor Networks Perrig, Stankovic, Wagner Jason Buckingham CSCI 7143: Secure Sensor Networks August 31, 2004.
Wireless Sensor Network Security Anuj Nagar CS 590.
Wireless Sensor Networks Security Lindsey McGrath and Christine Weiss.
Lecture 11 Intrusion Detection (cont)
Department Of Computer Engineering
Intrusion Detection System Marmagna Desai [ 520 Presentation]
INTRUSION DETECTION SYSTEMS Tristan Walters Rayce West.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
A Vehicular Ad Hoc Networks Intrusion Detection System Based on BUSNet.
Secure Localization Algorithms for Wireless Sensor Networks proposed by A. Boukerche, H. Oliveira, E. Nakamura, and A. Loureiro (2008) Maria Berenice Carrasco.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Hierarchical Trust Management for Wireless Sensor Networks and Its Application to Trust-Based Routing Fenye Bao, Ing-Ray Chen, Moonjeong Chang Presented.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
1 / 18 Fariba alamshahi Secure Routing and Intrusion Detection in Ad Hoc Networks Supervisor: Mr.zaker Translator: fariba alamshahi.
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol
INTRUSION DETECTION INTRUSION DETECTION INTRUSION DETECTION INTRUSION DETECTION INTRUSION DETECTION INTRUSION DETECTION INTRUSION DETECTION INTRUSION DETECTION.
Secure Cell Relay Routing Protocol for Sensor Networks Xiaojiang Du, Fengiing Lin Department of Computer Science North Dakota State University 24th IEEE.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Denial of Service (DoS) Attacks in Green Mobile Ad–hoc Networks Ashok M.Kanthe*, Dina Simunic**and Marijan Djurek*** MIPRO 2012, May 21-25,2012, Opatija,
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Security Patterns in Wireless Sensor Networks By Y. Serge Joseph October 8 th, 2009 Part I.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Secure routing in wireless sensor network: attacks and countermeasures Presenter: Haiou Xiang Author: Chris Karlof, David Wagner Appeared at the First.
Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Chris Karlof and David Wagner (modified by Sarjana Singh)
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Chris Karlof David Wagner University of California at Berkeley 1st IEEE International.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
I NTRUSION P REVENTION S YSTEM (IPS). O UTLINE Introduction Objectives IPS’s Detection methods Classifications IPS vs. IDS IPS vs. Firewall.
1 An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks Sencun Zhu, Sanjeev Setia, Sushil Jajodia, Peng.
Network Security Terms. Perimeter is the fortified boundary of the network that might include the following aspects: 1.Border routers 2.Firewalls 3.IDSs.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
LDTS: A Lightweight and Dependable Trust System for Clustered Wireless Sensor Networks 1 Presented by: Ting Hua Authors: Xiaoyong Li, Feng Zhou, and Junping.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Secure positioning in Wireless Networks Srdjan Capkun, Jean-Pierre Hubaux IEEE Journal on Selected area in Communication Jeon, Seung.
Energy Efficient Detection of Compromised Nodes in Wireless Sensor Networks Haengrae Cho Department of Computer Engineering, Yeungnam University Gyungbuk.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai Supervised.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Some Great Open Source Intrusion Detection Systems (IDSs)
Intrusion Detection Based on Traffic Analysis in Wireless Sensor Networks Yulia Ponomarchuk and Dae-Wha Seo Department of Electrical Engineering and Computer.
In the name of God.
Presented by Edith Ngai MPhil Term 3 Presentation
Trusted Routing in IoT Dr Ivana Tomić In collaboration with:
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
An Overview of Security Issues in Sensor Network
Cross-layer Analysis for detecting Wireless Misbehavior
A Vehicular Ad Hoc Network Intrusion Detection System Based on BUSNets
Presentation transcript:

Optimal Activation of Intrusion Detection Agents for Wireless Sensor Networks Yulia Ponomarchuk and Dae-Wha Seo Kyungpook National University, Republic of Korea Dept. of Electrical Engineering and Computer Science Mobile Computing and Embedded Systems Laboratory,

Outline Introduction Related Work  Attacks against the wireless sensor networks (WSN) and obstacles the security  Intrusion Detection Systems (IDSs) Ising model formulation for the global IDS agents activation Self-organization of the IDS agents Conclusions

Introduction: Comparison of the WSNs and Wireless Ad Hoc Networks Nodes function in unattended manner High specialization of nodes The batteries may be nonrechargeable Memory and processing power resources are very constrained Dense and random deployment The exact location is unknown The location is fixed after deployment Nodes often fail or can be compromised Any node can not be trusted Paths for transmissions are fixed within a given time interval Nodes are controlled by users No specialization of nodes Power resources are not constrained Memory and processing power resources are satisfactory Sparse deployment of nodes Each node can be supplied with GPS Nodes can be mobile Nodes rarely fail or get compromised Authenticated node can be trusted Paths for transmissions are random and change in time course Wireless ad hoc network Wireless sensor network

Related Work: Some Attacks against the WSNs Physical layer jamming: producing sufficient levels of radio interference to provoke collisions MAC layer jamming: preventing legal nodes from accessing the channel or exhausting their resources Routing layer attacks:  Spoofing, altering, or replaying routing information  Selective forwarding of packets  Black hole attack: dropping all trespassing packets  Sinkhole attack: luring traffic from the targeted area  Wormhole attack: inserting an out-of-band link to lure traffic  Sybil attack: representing several identities to its neighbors Wormhole attack Selective forwarding attack (a) Single malicious node (b) Two collaborating nodes

Obstacles to the Wireless Sensor Networks Security The nodes in the WSNs can be easily compromised Attack prevention schemes alone cannot ensure perfect security of the networks An attacker can eavesdrop packets and analyze the protocols and topology of the target network An attacker may inject false information through the compromised nodes All keying material may be obtained from a compromised node and a complex attack can be launched Resource constraints Unreliable communication Unattended operation Therefore, intrusion detection systems (IDSs) are proposed – as a second line of defense  To detect anomalies and inform the base station (BS)  To trigger the network reaction to the intrusion  To minimize the attacker’s influence on the network performance Assumption: the behavior of the intruder and the legal node can be discriminated

Intrusion Detection Systems (IDSs) An IDS is software and/or hardware designed to detect unwanted attempts at accessing, manipulating, and/or disabling of computer systems  A network IDS (NIDS) is an independent platform which identifies intrusions by examining network traffic and monitors multiple nodes  A host-based IDS (HIDS) consists of an agent on a host which identifies intrusions by analyzing system calls, application logs, file- system modifications, and other host activities and state  It is assumed that the behavior patterns of an intruder and a legitimate user in the network are different (noticeably) While data encryption and data integrity protection are used as preventive measures, an IDS acts only in reaction to the occurrence of an attack – second line of defense

Classification of the IDSs according to the Detection Techniques A signature-based (or misuse detection based) IDS:  compares the traffic features with the predefined signatures of attacks or malicious actions;  allows detection of the majority of known attacks;  has a low false positive rate;  when a new type of assault is launched, a new signature should be created and broadcast to every node An anomaly-based IDS:  checks the traffic on occurrence of any behavior different from the predefined or accepted normal patterns;  can detect novel attacks;  has a high false positive rate. A specification-based IDS:  uses a set of manually defined rules, specific for the application or running protocols in the WSN;  it is recommended for the WSNs, since the specification database requires less memory General architecture of the IDSs for WSNs

Previously Proposed Approaches to the IDS Design A significant number of IDS design approaches rely on  analysis of incoming and outgoing traffic from a node and  monitoring the neighbors’ behaviors (watchdogs technique) Besemann, et al. (2004), Roman, et al. (2006), Hai, et al. (2007): suggested to use a local IDS (LIDS) agent and a global IDS (GIDS) agent for traffic analysis and nodes’ monitoring and cooperation respectively While the analysis of incoming and outgoing traffic does not require much energy resources, an active GIDS agent may quickly exhaust the battery of a node. Therefore, the algorithms for optimal deployment and activation of the GIDS agents were proposed: Anjum, et al. (2004): proposed to activate the IDS agents only at CHs, which belong to a minimum cut-set (a set of nodes, through which the most of the traffic is transferred). The CHs were assumed to be trustworthy Techateerawat and Jennings (2006): analyzed the three adaptive strategies of IDS deployment: 1) core defense – protects the CH; 2) boundary defense – protects the boundary of each cluster; 3) distributed defense – the uniform activation of IDS agents in the WSN. As soon as an intrusion is detected, alarms are broadcast to activate the IDS agents in the vicinity of the attacker Chatzigiannakis and Strikos (2007): suggested to activate the GIDS agents at the cluster heads (CHs), which are the members of a cut-set; also there are a few nodes in each cluster with active GIDS agents, which monitor the CHs behavior Hai, et al. (2007): proposed to activate GIDS agents at all CHs in order to monitor cluster members’ behaviors. All monitoring nodes were assumed to be trustworthy

Ising Model Formulation for the Activation of GIDS Agents The WSN is represented as a weighted (directed) graph G=(V, E, W):  V={v 1, v 2, …, v N } – the set of individual components (the WSN nodes)  - the set of edges (links) between components  - the set of weights assigned to edges and representing the strength of interaction between the components  Self loops are absent  Each node is assigned a spin to represent the state of its GIDS agent  B t is a time-dependent external field: is the magnitude of the local field at node v k is a scalar (anomaly) measure at the sensor node A time-dependent Hamiltonian H t : Given the spin states of nodes and anomaly measures at a given time instant, the problem of self-organization of IDS agents is reduced to estimation of the state probabilities of the possible subsequent states of the Ising system

Optimal Activation of the IDS Agents in the WSN The goal:  To estimate probabilities of the future states of the system  To determine the distribution of active GIDS agents in the sensor network  To provide adaptability to the IDS agents activation The model was simplified by the following assumptions  Markov dynamics: the future state depends only on the present state  Quasi-static equilibria at all time instants: the system follows the single-flip dynamics, large changes in system’s states are impossible  The system follows the condition of the detailed balance: P I,P J – the probabilities of the system being in states I and J respectively p IJ – the probability of transition from state I to state J, then: Other denotations:  - the weighting coefficient for the distance measure  - the coefficient, proportional to the “inverse temperature”

Algorithm: Self-Organization of the IDS Agents While (1) do  Collect traffic data from the neighboring devices  Compute local anomaly measure at the current time instant and broadcast it to the one-hop neighbors  Compute the external field:  Compute change in energy and calculate the probability of flipping the state  Change the spin state with probability for the next time period End

Conclusions The paper proposes a model for adaptive optimal activation of the GIDS agents for intrusion detection in the WSNs, which is based on  the weighted graphs and  the Ising model based on the principles of Statistical Mechanics Given the estimations of traffic anomalies, a small fraction of nodes is activated in order to watch their neighbors’ behaviors only when it is necessary The proposed scheme is distributed and lightweight in terms of computation and communication overheads It can be applied in large WSNs, since the BSs do not collect and store the traffic information from all nodes Further research will be devoted to:  the performance evaluation using simulations and  comparison to other approaches for GIDS agents deployment and activation