Cyber-Physical Security Strategies

Cyber-physical security describes the protection of systems with close relationships between computational functions and physical ones and addresses the issue of vulnerability to attack through both cyber and physical avenues. This describes systems in a wide variety of functions, many crucial to the function of modern society, making their security of paramount importance. The development of secure system design and attack detection strategies for each potential avenue of attack is needed to combat malicious attacks. This thesis will provide an overview of the approaches to securing different aspect of cyber-physical systems. The cyber element can be designed to better prevent unauthorized entry and to be more robust to attack while its use is evaluated for signs of ongoing intrusion. Nodes in sensor networks can be evaluated by their claims to determine the likelihood of their honesty. Control systems can be designed to be robust in cases of the failure of one component and to detect signal insertion or replay attack. Through the application of these strategies, the safety and continued function of cyber-physical systems can be improved

Algorithmic Mechanism Construction bridging Secure Multiparty Computation and Intelligent Reasoning

This work presents the construction of intelligent algorithmic mechanism based on multidimensional view of intelligent reasoning, threat analytics, cryptographic solutions and secure multiparty computation. It is basically an attempt of the cross fertilization of distributed AI, algorithmic game theory and cryptography. The mechanism evaluates innate and adaptive system immunity in terms of collective, machine, collaborative, business and security intelligence. It also shows the complexity analysis of the mechanism and experimental results on three test cases: (a) intrusion detection, (b) adaptively secure broadcast and (c) health security

A metaheuristic and simheuristic approach for the p-Hub median problem from a telecommunication perspective

Tese (doutorado)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2018.Avanços recentes no setor das telecomunicações oferecem grandes oportunidades para cidadãos e organizações em um mundo globalmente conectado, ao mesmo tempo em que surge um vasto número de desafios complexos que os engenheiros devem enfrentar. Alguns desses desafios podem ser modelados como problemas de otimização. Alguns exemplos incluem o problema de alocação de recursos em redes de comunicações, desenho de topologias de rede que satisfaça determinadas propriedades associadas a requisitos de qualidade de serviço, sobreposição de redes multicast e outros recursos importantes para comunicação de origem a destino. O primeiro objetivo desta tese é fornecer uma revisão sobre como as metaheurísticas têm sido usadas até agora para lidar com os problemas de otimização associados aos sistemas de telecomunicações, detectando as principais tendências e desafios. Particularmente, a análise enfoca os problemas de desenho, roteamento e alocação de recursos. Além disso, devido á natureza desses desafios, o presente trabalho discute como a hibridização de metaheurísticas com metodologias como simulação pode ser empregada para ampliar as capacidades das metaheurísticas na resolução de problemas de otimização estocásticos na indústria de telecomunicações. Logo, é analisado um problema de otimização com aplicações práticas para redes de telecomunica ções: o problema das p medianas não capacitado em que um número fixo de hubs tem capacidade ilimitada, cada nó não-hub é alocado para um único hub e o número de hubs é conhecido de antemão, sendo analisado em cenários determinísticos e estocásticos. Dada a sua variedade e importância prática, o problema das p medianas vem sendo aplicado e estudado em vários contextos. Seguidamente, propõem-se dois algoritmos imune-inspirados e uma metaheurística de dois estágios, que se baseia na combinação de técnicas tendenciosas e aleatórias com uma estrutura de busca local iterada, além de sua integração com a técnica de simulação de Monte Carlo para resolver o problema das p medianas. Para demonstrar a eficiência dos algoritmos, uma série de testes computacionais é realizada, utilizando instâncias de grande porte da literatura. Estes resultados contribuem para uma compreensão mais profunda da eficácia das metaheurísticas empregadas para resolver o problema das p medianas em redes pequenas e grandes. Por último, uma aplicaçã o ilustrativa do problema das p medianas é apresentada, bem como alguns insights sobre novas possibilidades para ele, estendendo a metodologia proposta para ambientes da vida real.Recent advances in the telecommunication industry o er great opportunities to citizens and organizations in a globally-connected world, but they also arise a vast number of complex challenges that decision makers must face. Some of these challenges can be modeled as optimization problems. Examples include the framework of network utility maximization for resource allocation in communication networks, nding a network topology that satis es certain properties associated with quality of service requirements, overlay multicast networks, and other important features for source to destination communication. First, this thesis provides a review on how metaheuristics have been used so far to deal with optimization problems associated with telecommunication systems, detecting the main trends and challenges. Particularly the analysis focuses on the network design, routing, and allocation problems. In addition, due to the nature of these challenges, this work discusses how the hybridization of metaheuristics with methodologies such as simulation can be employed to extend the capabilities of metaheuristics when solving stochastic optimization problems. Then, a popular optimization problem with practical applications to the design of telecommunication networks: the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP) where a xed number of hubs have unlimited capacity, each non-hub node is allocated to a single hub and the number of hubs is known in advance is analyzed in deterministic and stochastic scenarios. p-hub median problems are concerned with optimality of telecommunication and transshipment networks, and seek to minimize the cost of transportation or establishing. Next, two immune inspired metaheuristics are proposed to solve the USApHMP, besides that, a two-stage metaheuristic which relies on the combination of biased-randomized techniques with an iterated local search framework and its integration with simulation Monte Carlo technique for solving the same problem is proposed. In order to show their e ciency, a series of computational tests are carried out using small and large size instances from the literature. These results contribute to a deeper understanding of the e ectiveness of the employed metaheuristics for solving the USApHMP in small and large networks. Finally, an illustrative application of the USApHMP is presented as well as some insights about some new possibilities for it, extending the proposed methodology to real-life environments.Els últims avenços en la industria de les telecomunicacions ofereixen grans oportunitats per ciutadans i organitzacions en un món globalment connectat, però a la vegada, presenten reptes als que s'enfronten tècnics i enginyers que prenen decisions. Alguns d'aquests reptes es poden modelitzar com problemes d'optimització. Exemples inclouen l'assignació de recursos a les xarxes de comunicació, trobant una topologia de xarxa que satisfà certes propietats associades a requisits de qualitat de servei, xarxes multicast superposades i altres funcions importants per a la comunicació origen a destinació. El primer objectiu d'aquest treball és proporcionar un revisió de la literatura sobre com s'han utilitzat aquestes tècniques, tradicionalment, per tractar els problemes d'optimització associats a sistemes de telecomunicació, detectant les principals tendències i desa aments. Particularment, l'estudi es centra en els problemes de disseny de xarxes, enrutament i problemes d'assignació de recursos. Degut a la naturalesa d'aquests problemes, aquest treball també analitza com es poden combinar les tècniques metaheurístiques amb metodologies de simulació per ampliar les capacitats de resoldre problemes d'optimització estocàstics. A més, es tracta un popular problema d'optimització amb aplicacions pràctiques per xarxes de telecomunicació, el problema de la p mediana no capacitat, analitzant-lo des d'escenaris deterministes i estocàstics. Aquest problema consisteix en determinar el nombre d'instal lacions (medianes) en una xarxa, minimitzant la suma de tots els costs o distàncies des d'un punt de demanda a la instal lació més propera. En general, el problema de la p mediana està lligat amb l'optimització de xarxes de telecomunicacions i de transport, i busquen minimitzar el cost de transport o establiment de la xarxa. Es proposa dos algoritmes immunològics i un algoritme metaheurístic de dues etapes basat en la combinació de tècniques aleatòries amb simulacions Monte Carlo. L'e ciència de les algoritmes es posa a prova mitjançant alguns dels test computacionals més utilitzats a la literatura, obtenint uns resultats molt satisfactoris, ja que es capaç de resoldre casos petits i grans en qüestió de segons i amb un baix cost computacional. Finalment, es presenta una aplicació il lustrativa del problema de la p mediana, així com algunes noves idees sobre aquest, que estenen la metodologia proposta a problemes de la vida real

Parallel and Distributed Computing

The 14 chapters presented in this book cover a wide variety of representative works ranging from hardware design to application development. Particularly, the topics that are addressed are programmable and reconfigurable devices and systems, dependability of GPUs (General Purpose Units), network topologies, cache coherence protocols, resource allocation, scheduling algorithms, peertopeer networks, largescale network simulation, and parallel routines and algorithms. In this way, the articles included in this book constitute an excellent reference for engineers and researchers who have particular interests in each of these topics in parallel and distributed computing

Enhancing Bio-inspired Intrusion Response in Ad-hoc Networks

Practical applications of Ad-hoc networks are developing everyday and safeguarding their security is becoming more important. Because of their specific qualities, ad-hoc networks require an anomaly detection system that adapts to its changing behaviour quickly. Bio-inspired algorithms provide dynamic, adaptive, real-time methods of intrusion detection and particularly in initiating a response. A key component of bio-inspired response methods is the use of feedback from the network to better adapt their response to the specific attack and the type of network at hand. However, calculating an appropriate length of time at which to provide feedback is crucial - premature feedback or delayed feedback from the network can have adverse effects on the attack mitigation process. The antigen-degeneracy response selection algorithm (Schaust & Szczerbicka, 2011) is one of the few bio-inspired algorithms for selecting the appropriate response for misbehavior that considers network performance and adapts to the network. The main drawback of this algorithm is that it has no measure of the amount of time to wait before it can take performance measurements (feedback) from the network. In this thesis, we attempt to develop an understanding of the length of time required before feedback is provided in a range of types of ad-hoc network that have been subject of an attack, in order that future development of bio-inspired intrusion detection algorithms can be enhanced.Aiming toward an adaptive timer, we discuss that ad-hoc networks can be divided into Wireless Sensor Network (WSN), Wireless Personal Area Network (WPAN) and Spontaneously Networked Users (SNU). We use ns2 to simulate these three different types of ad-hoc networks, each of which is analysed for changes in its throughput after an attack is responded to, in order to calculate the corresponding feedback time. The feedback time in this case is the time it takes for the network to stabilise. Feedback time is not only essential to bio-inspired intrusion response methods, but can also be used in network applications where a stable network reading is required, e.g. security monitoring and motion tracking.Interestingly, we found that the network feedback time does not vary greatly between the different types of networks, but it was calculated to be less than half of what Schaust and Szczerbicka used in their algorith

Traveling Salesman Problem

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering

An Artificial Immune System Strategy for Robust Chemical Spectra Classification via Distributed Heterogeneous Sensors

The timely detection and classification of chemical and biological agents in a wartime environment is a critical component of force protection in hostile areas. Moreover, the possibility of toxic agent use in heavily populated civilian areas has risen dramatically in recent months. This thesis effort proposes a strategy for identifying such agents vis distributed sensors in an Artificial Immune System (AIS) network. The system may be used to complement electronic nose ( E-nose ) research being conducted in part by the Air Force Research Laboratory Sensors Directorate. In addition, the proposed strategy may facilitate fulfillment of a recent mandate by the President of the United States to the Office of Homeland Defense for the provision of a system that protects civilian populations from chemical and biological agents. The proposed system is composed of networked sensors and nodes, communicating via wireless or wired connections. Measurements are continually taken via dispersed, redundant, and heterogeneous sensors strategically placed in high threat areas. These sensors continually measure and classify air or liquid samples, alerting personnel when toxic agents are detected. Detection is based upon the Biological Immune System (BIS) model of antigens and antibodies, and alerts are generated when a measured sample is determined to be a valid toxic agent (antigen). Agent signatures (antibodies) are continually distributed throughout the system to adapt to changes in the environment or to new antigens. Antibody features are determined via data mining techniques in order to improve system performance and classification capabilities. Genetic algorithms (GAs) are critical part of the process, namely in antibody generation and feature subset selection calculations. Demonstrated results validate the utility of the proposed distributed AIS model for robust chemical spectra recognition

Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Software Defined Networking (SDN) introduced network management flexibility that eludes traditional network architecture. Nevertheless, the pervasive demand for various cloud computing services with different levels of Quality of Service requirements in our contemporary world made network service provisioning challenging. One of these challenges is path selection (PS) for routing heterogeneous traffic with end-to-end quality of service support specific to each traffic class. The challenge had gotten the research community\u27s attention to the extent that many PSAs were proposed. However, a gap still exists that calls for further study. This paper reviews the existing PSA and the Baseline Shortest Path Algorithms (BSPA) upon which many relevant PSA(s) are built to help identify these gaps. The paper categorizes the PSAs into four, based on their path selection criteria, (1) PSAs that use static or dynamic link quality to guide PSD, (2) PSAs that consider the criticality of switch in terms of an update operation, FlowTable limitation or port capacity to guide PSD, (3) PSAs that consider flow variabilities to guide PSD and (4) The PSAs that use ML optimization in their PSD. We then reviewed and compared the techniques\u27 design in each category against the identified SDN PSA design objectives, solution approach, BSPA, and validation approaches. Finally, the paper recommends directions for further research