ECE 5214 Modeling and Evaluation of Computer Networks Kavya Sagi.

Slides:



Advertisements
Similar presentations
Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection Presented by: Vijay Kumar.
Advertisements

Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
Computer Science Dr. Peng NingCSC 774 Adv. Net. Security1 CSC 774 Advanced Network Security Topic 7.3 Secure and Resilient Location Discovery in Wireless.
Optimization of intrusion detection systems for wireless sensor networks using evolutionary algorithms Martin Stehlík Faculty of Informatics Masaryk University.
Kyung Tae Kim, Hee Yong Youn (Sungkyunkwan University)
CS 795 – Spring  “Software Systems are increasingly Situated in dynamic, mission critical settings ◦ Operational profile is dynamic, and depends.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
Reliable System Design 2011 by: Amir M. Rahmani
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Differentiated Surveillance for Sensor Networks Ting Yan, Tian He, John A. Stankovic CS294-1 Jonathan Hui November 20, 2003.
Mitigating routing misbehavior in ad hoc networks Mary Baker Departments of Computer Science and.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
MANETs A Mobile Ad Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless links. Characteristics include: no fixed infrastructure.
Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
Monté Carlo Simulation MGS 3100 – Chapter 9. Simulation Defined A computer-based model used to run experiments on a real system.  Typically done on a.
Lecture 11 Intrusion Detection (cont)
CSCI 347 / CS 4206: Data Mining Module 04: Algorithms Topic 06: Regression.
Data Selection In Ad-Hoc Wireless Sensor Networks Olawoye Oyeyele 11/24/2003.
Effect Of Intrusion Detection on Reliability of Mission-Oriented Mobile Group Systems in Mobile Ad Hoc Networks Author: J.H. Cho, I.R. Chen and P.G. Feng.
Effect of Intrusion Detection on Reliability Jin-Hee Cho, Member, IEEE, Ing-Ray Chen, Member, IEEE, and Phu-Gui Feng IEEE TRANSACTIONS ON RELIABILITY,
Integrated Social and Quality of Service Trust Management of Mobile Groups in Ad Hoc Networks Ing-Ray Chen, Jia Guo, Fenye Bao, Jin-Hee Cho Communications.
Presented by: Chaitanya K. Sambhara Paper by: Maarten Ditzel, Caspar Lageweg, Johan Janssen, Arne Theil TNO Defence, Security and Safety, The Hague, The.
Intrusion Detection for Grid and Cloud Computing Author Kleber Vieira, Alexandre Schulter, Carlos Becker Westphall, and Carla Merkle Westphall Federal.
MODELING AND ANALYSIS OF ATTACKS AND COUNTER DEFENSE MECHANISMS FOR CYBER PHYSICAL SYSTEMS -Robert Mitchell, Ing-Ray Chen, Member, IEEE Presented By, Manasa.
Hierarchical Trust Management for Wireless Sensor Networks and Its Application to Trust-Based Routing Fenye Bao, Ing-Ray Chen, Moonjeong Chang Presented.
IIT Indore © Neminah Hubballi
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
POWER CONTROL IN COGNITIVE RADIO SYSTEMS BASED ON SPECTRUM SENSING SIDE INFORMATION Karama Hamdi, Wei Zhang, and Khaled Ben Letaief The Hong Kong University.
Effect of Redundancy on Mean Time to Failure of Wireless Sensor Networks Anh Phan Speer, Ing-Ray Chen Paper Presented by: Misha, Neha & Vidhya CS 5214.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
Aggregation in Sensor Networks
Demo. Overview Overall the project has two main goals: 1) Develop a method to use sensor data to determine behavior probability. 2) Use the behavior probability.
Physics 114: Exam 2 Review Lectures 11-16
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
1 Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection Fenye Bao, Ing-Ray Chen,
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.
Chin-Yu Huang Department of Computer Science National Tsing Hua University Hsinchu, Taiwan Optimal Allocation of Testing-Resource Considering Cost, Reliability,
A Distributed Coordination Framework for Wireless Sensor and Actor Networks Tommaso Melodia, Dario Pompili, Vehbi C.Gungor, Ian F.Akyildiz (MobiHoc 2005)
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
7.5 Intrusion Detection Systems Network Security / G.Steffen1.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 4: Naming and addressing.
Generalized stochastic Petri nets (GSPN)
Computational Intelligence: Methods and Applications Lecture 16 Model evaluation and ROC Włodzisław Duch Dept. of Informatics, UMK Google: W Duch.
1 Component reliability Jørn Vatn. 2 The state of a component is either “up” or “down” T 1, T 2 and T 3 are ”Uptimes” D 1 and D 2 are “Downtimes”
Sampling distributions rule of thumb…. Some important points about sample distributions… If we obtain a sample that meets the rules of thumb, then…
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
Re-Configurable Byzantine Quorum System Lei Kong S. Arun Mustaque Ahamad Doug Blough.
Tufts Wireless Laboratory Tufts University School Of Engineering Real-Time Data Services for Cyber Physical Systems Zhong Zou.
1 Channel Coding (III) Channel Decoding. ECED of 15 Topics today u Viterbi decoding –trellis diagram –surviving path –ending the decoding u Soft.
Cooperative Location- Sensing for Wireless Networks Authors : Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
MITRE 7 April 2009 CS 5214 Presenter: Phu-Gui Feng Performance Analysis of Distributed IDS Protocols for Mobile GCS Dr. Jin-Hee Cho, Dr. Ing-Ray Chen MITRE.
Hierarchical Trust Management for Wireless Sensor Networks and Its Applications to Trust-Based Routing and Intrusion Detection Wenhai Sun & Ruide Zhang.
Attacks and Counter Defense Mechanisms for Cyber-Physical Systems 1 Taha Hassan Lulu Wang CS 5214 Fall 2015.
Reliability of Wireless sensors with code attestation for intrusion detection Ing-Ray Chen, Yating Wang, Ding-Chau Wang Information Processing Letters.
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
Risk-Aware Mitigation for MANET Routing Attacks Submitted by Sk. Khajavali.
Full Design. DESIGN CONCEPTS The main idea behind this design was to create an architecture capable of performing run-time load balancing in order to.
Ing-Ray Chen, Member, IEEE, Hamid Al-Hamadi Haili Dong Secure and Reliable Multisource Multipath Routing in Clustered Wireless Sensor Networks 1.
On Survivability of Mobile Cyber Physical Systems with Intrusion Detection Authors: Robert Mitchell, Ing-Ray Chen Presented by: Ting Hua.
Talal H. Noor, Quan Z. Sheng, Lina Yao,
OPERATING SYSTEMS CS 3502 Fall 2017
Net 435: Wireless sensor network (WSN)
Authors: Ing-Ray Chen; Yating Wang Present by: Kaiqun Fu
Presentation transcript:

ECE 5214 Modeling and Evaluation of Computer Networks Kavya Sagi

Cyber Physical System (CPS) A CPS comprises of comprises sensors, actuators, control units, and physical objects for controlling and protecting a physical infrastructure. A CPS may often operate in a rough environment where energy replenishment is not possible and nodes can be compromised. Therefore, CPS systems have to be protected against malicious attacks of any form using intrusion detection and response system and thereby increase the reliability of the overall infrastructure The present paper involves development of a probability model based on Stochastic Petri nets to describe the behavior of the CPS in the presence of both malicious nodes and an intrusion detection and response system (IDRS) for detecting and responding to malicious events at runtime. A variety of attacker behaviors are considered including persistent, random and insidious attacker models to identify the best design settings of the detection strength and response strength to best balance energy conservation vs. intrusion tolerance for achieving high reliability

Intrusion Detection System Detection techniques can be classified into three types: Signature based Anomaly based Specification based Here specification based method is used rather than anomaly based or signature based techniques to avoid using resource-constrained sensors or actuators in a CPS for profiling anomaly patterns (e.g., through learning) and to avoid high false positives Automatic mapping of a specification into a state machine consisting of good and bad states is performed and a node’s deviation from good states at runtime is measured for intrusion detection These specification-based techniques are applied to host-level intrusion detection only. System-level intrusion detection is devised based on multi- trust to yield a low false alarm probability.

System Model/ Reference Configuration Reference CPS Comprises of 128 sensor carried mobile nodes at the sensor layer, where each node ranges its neighbors periodically and measures any detectable phenomena nearby Each node performs sensing and reporting functions to provide information to upper layer control devices to control and protect the CPS infrastructure and also utilizes its ranging function for node localization and intrusion detection Security Condition 1: If one-third or more of the nodes are compromised, then the system fails. This is based on the Byzantine fault model Heavy impairment due to attacks will result in a security failure when the system is not able to respond to attacks in a timely manner. This is called impairment failure

System Model/ Reference Configuration (2) Attack Model At the sensor/actuator layer of the CPS architecture, a bad node can perform data spoofing attacks and bad command execution attacks At the networking layer, a bad node can perform various communication attacks including selective forwarding, packet dropping, packet spoofing, packet replaying, packet flooding and even Sybil attacks to disrupt the system’s packet routing functionality At the control layer, a bad node can perform control-level attacks including aggregated data spoofing attacks, and command spoofing attacks Three attacker models: persistent, random, and insidious are considered. A persistent attacker performs attacks with probability one whereas a random attacker performs attacks randomly with probability P random and an insidious attacker is hidden all the time to evade detection until a critical mass of compromised nodes is reached to perform “all in” attacks

System Model/ Reference Configuration (3) Host Intrusion Detection Host intrusion detection protocol design is based on two core techniques: behavior rule specification and vector similarity specification Behavior rule specification specifies the behavior of an entity by a set of rules from which a state machine is automatically derived Vector similarity specification compares similarity of a sequence of sensor readings, commands or votes among entities performing the same set of functions. A state machine is also automatically derived from which a similarity test is performed to detect outliers. A monitoring node applies snooping and overhearing techniques observing the percentage of time a neighbor node is in secure states over a detection interval, say, T IDS. A longer time in secure states indicates greater specification compliance. If the compliance degree of node i denoted by X i falls below a minimum compliance threshold denoted by C T, node i is considered compromised

Host Intrusion Detection Two host IDS techniques are applied to the reference CPS as follows: a monitoring node periodically determines a sequence of locations of a sensor-carried mobile node within radio range through ranging and detects if the location sequence (corresponding to the state sequence) deviates from the expected location sequence a monitoring node periodically collects votes from neighbor nodes who have participated in system intrusion detection and detects dissimilarity of vote sequences among these neighbors for outlier detection The compliance degree is modeled by a random variable X with G(·) = Beta(α, β) distribution [17], with the value 0 indicating that the output is totally unacceptable (zero compliance) and 1 indicating the output is totally acceptable (perfect compliance), such that G(a), 0 ≤ a ≤ 1, is given by.

Host Intrusion Detection (2) The compliance degree history collected this way is the realization of a sequence of random variables (c1, c2,..., cn) where c i is the i th compliance degree output observed during the testing phase, and n is the total number of compliance degree outputs observed The maximum likelihood estimates of α and β are obtained by numerically solving the following equations: For simplicity, we can consider a single parameter Beta(β) distribution with α equal to 1. Then maximum likelihood estimate of β is

Host Intrusion Detection (3) Host intrusion detection is characterized by per-node false negative and false positive probabilities, denoted by P fn and P fp, respectively If a bad node’s compliance degree denoted by X b is higher than a system minimum compliance threshold C T then there is a false negative. If the the compliance degree X b of a bad node is modeled in the previous manner, then the host IDS false negative probability P fn is given by: If a good node’s compliance degree denoted by X g is less than C T then there is a false positive, the host false positive probability P fp is given by: A large C T induces a small false negative probability at the expense of a large false positive probability whereas a small C T induces a small false positive probability at the expense of a large false negative probability

System Intrusion Detection System IDS technique is based on majority voting of host IDS results to cope with incomplete and uncertain information available to nodes in the CPS which involves the selection of m detectors as well as the invocation interval T IDS to best balance energy conservation vs. intrusion tolerance for achieving high reliability A random coordinator is selected by introducing a hashing function that takes in the identifier of a node concatenated with the current location of the node as the hash key and the node with the smallest returned hash value would become the coordinator The coordinator then selects m detectors randomly (including itself), and lets all detectors know each others’ identities so that each voter can send its yes/no vote to other detectors At the end of the voting process, all detectors will know the same result, that is, the node is diagnosed as good, or as bad based on the majority vote

Model and Analysis Figure 1 shows the SPN model describing the ecosystem of a CPS with intrusion detection and response under capture, impairment and Byzantine security attacks The underlying model of the SPN model is a continuous-time semi-Markov process with a state representation (N g, N b, N e, impaired, energy) Table 1 shows all the parameters used for the analysis and modeling of IDRS design Initially, all N nodes are good nodes and put in place Ng as tokens. Then transition models are used to model events. Good nodes may become compromised because of capture attacks with per-node compromising rate λc.

Model and Analysis (2) Firing TCP will move tokens one at a time (if it exists) from place N g to place N b. Tokens in place N b represent bad nodes performing impairment attacks with probability When a bad node is detected by the system IDS as compromised, so place N e will hold one more token and place N b will hold one less token. These detection events are modeled by associating transition TIDS The transition rates for different scenarios in the SPN model are given in Table 2 The system-level IDS can incorrectly identify a good node as compromised at a rate of TFP. The system energy is exhausted after time N IDS × T IDS where N IDS is the maximum number of intrusion detection intervals the CPS can possibly perform before it exhausts its energy. Energy exhaustion can be modeled by firing TENERGY

Security failure Modeling Two conditions that cause security failures and their modeling: When the number of bad nodes (i.e., tokens in place Nb) is at least 1/3 of the total number of nodes (tokens in place Ng and Nb), the system fails because of a Byzantine failure. The system lifetime is over and is modeled again by disabling all transitions in the SPN model. Bad nodes in place N b perform attacks with probability P a and cause impairment to the system. After an impairment-failure time period is elapsed, heavy impairment due to attacks will result in a security failure. This can be modeled by firing TIF. A token is flown into place impaired when such a security failure occurs. Once a token is in place impaired, the system enters an absorbing state meaning the lifetime is over.

SPN Model Design Trade-offs SPN model is used to analyze two design tradeoffs: Detection strength vs. energy consumption: As we increase the detection frequency or the number of detectors, the detection strength increases, thus preventing the system from running into a security failure. This increases the rate at which energy is consumed, thus resulting in a shorter lifetime. Hence optimal setting of T IDS and m under will result in the system MTTF being maximized, given the node capture rate and attack model. Detection response vs. attacker strength: As the random attack probability P a decreases, the attacker strength decreases, hence the probability of security failure due to impairment attacks are reduced. Compromised nodes become more hidden and difficult to detect resulting in a higher system-level false negative probability P fn. The system can respond to instantaneous attacker strength detected and adjust C T to trade a high P fp off for a low P fn, or vice versa. Hence, there exists an optimal setting of CT as a function of attacker strength detected at time t under which the system security failure probability is minimized

MTTF Let L be a binary random variable denoting the lifetime of the system between 0 and 1 (1 stands for alive and 0 for otherwise) The expected value of L is the reliability of the system R(t) at time t The binary value assignment to L can be done by means of a reward function assigning a reward r i of 0 or 1 to state i at time t as follows: r i =1 if system is alive in state i =0 if system fails due to security or energy failure The MTTF of the system is equal to the cumulative reward to absorption, i.e.,

Parameterization We consider the reference CPS model introduced earlier in a 2 × 2 area with a network size (N) of 128 nodes. Table III lists the set of parameters and their values for the reference CPS System-Level IDS P fn and P fp : Per-host p fn and p fp are given as input. differentiate the number of active bad nodes, N a b, from the number of inactive bad nodes, N i b,+ with N a b + N i b =N b, such that at any time

P fn is calculated using the following equation. P fp is calculated in the same way replacing p fn by p fp. Host IDS p fn and p fp : The system, after a thorough testing and debugging phase, determines a minimum threshold CT such that p fn and p fp measured based on Equations 5 and 6 are acceptable to system design.

Parameterizing CT for Dynamic Intrusion Response The attacker strength of a node, say node i, may be estimated periodically by node i’s intrusion detectors. the compliance degree value of node i, X i (t), as collected by m intrusion detectors based on observations collected during [t − TI DS, t], is compared against the minimum threshold C p T set for persistent attacks. This information is passed to the control module who subsequently estimates N a b (t) representing the attacker strength at time t. C T is controlled by a linear one-to-one mapping function as follows C T (t) refers to the C T value set at time t as a response to the attacker strength measured by N a b (t) detected at time t; C p T is the minimum threshold set by the system for the persistent attack case; and δ CT is the increment to C T per active bad node detected. When C T is closer to 1, a node will more likely be considered as compromised even if it wanders only for a small amount of time in insecure states.

Energy Parameterization NIDS, the maximum number of intrusion detection cycles the system can possibly perform before energy exhaustion can be parameterized as follows: where Eo is the initial energy of the reference CPS and E TIDS is the energy consumed per T IDS interval due to ranging, sensing, and intrusion detection functions, calculated as: where.

Numerical Results Effect of Intrusion Detection Strength :

Numerical Results (2) Effect of Attacker Behaviour:

Numerical Results (3) Effect of Intrusion Response:

Numerical Results (4)

Conclusion Developed a probability model to analyze reliability of a CPS in the presence of both malicious nodes exhibiting a range of attacker behaviors, and an intrusion detection and response system Model identifies best detection strength and the best response strength for different attacker behaviors thereby maximizing the reliability of the system. Future research directions – 1.Investigating other intrusion detection criteria 2.investigating other intrusion response criteria 3.exploring other attack behavior models 4.developing a more elaborate model to describe the relationship between intrusion responses and attacker behaviors and justifying such a relationship model by means of extensive empirical studies 5.Extending the analysis to hierarchically-structured intrusion detection and response system design for a large CPS