Diagnosis of static Topology MANETs in faulty environment

Mobile Ad-Hoc Networks (MANETs) are set of mobile nodes that communicates wirelessly without a centralized supporting system. Faulty nodes aect the reliable transmission of messages across the network. In this thesis we deal with the fault identication problem in static topology MANETs. A comparison based approach is used where a set of tasks is given to the nodes and outcomes are compared. Based on these comparisons the nodes are classied either as faulty or fault free. Our new diagnosis model is based on the spanning tree concept in which the testing of the nodes as well as the construction of the spanning tree takes place simultaneously. As a result of which the maintenance and the repairing overhead of the spanning tree is completely avoided thus reducing the number of messages exchanged. We have also developed a simulator which can be applied to a network with large number of nodes.We have carried out the simulation in-order to nd out the total number of messages exchanged and the total diagnosis time. On analysing the results we have seen that our model performs better than its previous counterparts. The correctness and complexity proofs are also being provided which also shows that our model performs better from a communication as well as latency viewpoint

Deployment of Mobile Ad-hoc Network Ticket Based QoS Routing Protocol for Healthcare

A Mobile Adhoc Network comprises of set of portable hosts which are equipped for corresponding with one another with no aid of base stations. MANET are quick evolving topology, broad exploration is going ahead to outline directing conventions for MANETs. The Ad hoc On-Demand Distance Vector convention concerns with most limited way steering and changing the courses powerfully in work space. Quality of Service (QoS) prerequisite issues are less tended to in MANETs and the motivation behind this paper is to address QoS directing in a MANET domain and concentrate principally on ticket based QoS steering convention to figure out course fulfilling certain data transmission and delay obliges. The essential thought is to utilize tickets to keep the quantity of route searching packets to abstain from flooding and to make courses progressively to accomplish proficient Quality of Service

Data analytics for stochastic control and prognostics in cyber-physical systems

In this dissertation, several novel cyber fault diagnosis and prognosis and defense methodologies for cyber-physical systems have been proposed. First, a novel routing scheme for wireless mesh network is proposed. An effective capacity estimation for P2P and E2E path is designed to guarantee the vital transmission safety. This scheme can ensure a high quality of service (QoS) under imperfect network condition, even cyber attacks. Then, the imperfection, uncertainties, and dynamics in the cyberspace are considered both in system model and controller design. A PDF identifier is proposed to capture the time-varying delays and its distribution. With the modification of traditional stochastic optimal control using PDF of delays, the assumption of full knowledge of network imperfection in priori is relaxed. This proposed controller is considered a novel resilience control strategy for cyber fault diagnosis and prognosis. After that, we turn to the development of a general framework for cyber fault diagnosis and prognosis schemes for CPSs wherein the cyberspace performance affect the physical system and vice versa. A novel cyber fault diagnosis scheme is proposed. It is capable of detecting cyber fault by monitoring the probability of delays. Also, the isolation of cyber and physical system fault is achieved with cooperating with the traditional observer based physical system fault detection. Next, a novel cyber fault prognosis scheme, which can detect and estimate cyber fault and its negative effects on system performance ahead of time, is proposed. Moreover, soft and hard cyber faults are isolated depending on whether potential threats on system stability is predicted. Finally, one-class SVM is employed to classify healthy and erroneous delays. Then, another cyber fault prognosis based on OCSVM is proposed --Abstract, page iv

APPLICATION OF SOFT COMPUTING TECHNIQUES OVER HARD COMPUTING TECHNIQUES: A SURVEY

Soft computing is the fusion of different constituent elements. The main aim of this fusion to solve real-world problems, which are not solve by traditional approach that is hard computing. Actually, in our daily life maximum problem having uncertainty and vagueness information. So hard computing fail to solve this problems, because it give exact solution. To overcome this situation soft computing techniques plays a vital role, because it has capability to deal with uncertainty and vagueness and produce approximate result. This paper focuses on application of soft computing techniques over hard computing techniques

Techniques for locating service faults in mobile ad hoc networks

Fault localization in general refers to a technique for identifying the likely root causes of failures observed in systems formed from components. Fault localization in systems deployed on mobile ad hoc networks (MANETs) is a particularly challenging task because those systems are subject to a wider variety and higher incidence of faults than those deployed in xed networks, the resources available to track fault symptoms are severely limited, and many of the sources of faults in MANETs are by their nature transient. We present a method for localizing the faults occurring in service-based systems hosted on MANETs. The method is based on the use of dependence data that are discovered dynamically through decentralized observations of service interactions. We employ both Bayesian and timing-based reasoning techniques to analyze the data in the context of a speci c fault propagation model, deriving a ranked list of candidate fault locations. We present the results of an extensive set of experiments exploring a wide range of operational conditions to evaluate the accuracy of our method

Locating faults in MANET-hosted software systems

We present a method to locate faults in service-based software systems hosted on mobile ad hoc networks (MANETs). In such systems, computations are structured as interdependent services distributed across the network, collaborating to satisfy client requests. Faults, which may occur at either or both the service and network layers, propagate by cascading through some subset of the services, from their root causes back to the clients that initiate requests. Fault localization in this environment is especially challenging because the systems are typically subject to a wider variety and higher incidence of faults than those deployed in fixed networks, the resources available to collect and store analysis data are severely limited, and many of the sources of faults are by their nature transient. Our method makes use of service-dependence and fault data that are harvested in the network through decentralized, run-time observations of service interactions and fault symptoms. We have designed timing- and Bayesian-based reasoning techniques to analyze the data in the context of a specific fault propagation model. The analysis provides a ranked list of candidate fault locations. Through extensive simulations, we evaluate the performance of our method in terms of its accuracy in correctly ranking root causes under a wide range of operational conditions

The Application of System Level Diagnosis Approaches for Fault Detection and its Implementation in Ad-hoc Networks

We introduce the application of a distributed system-level fault diagnosis algorithm for detecting and diagnosing faulty processors in Dynamic Positioning System (DPS).In this paper a approach to the diagnosis problem is presented. We illustrate the procedure of diagnosis verification, which adopts a method of fault injection by setting some faults in the system by programming, and provide the basis idea, the detailed execution steps and the corresponding results. This algorithm is then on two models of ad-hoc networks. Two implementation models are presented in the first one network topology doesn’t change during diagnosis and we show that both hard and soft faults can be easily detected based on this, a diagnosis protocol is presented. The evaluation of the protocol indicates that an efficient diagnosis protocol can be designed on our model. In the second model we allow the system topology to change during diagnosis, in this case the ability of diagnosis decreases but it can be rectified too by setting up a fixed area for mobility of nodes

Fault localization in service-based systems hosted in mobile ad hoc networks

Fault localization in general refers to a technique for identifying the likely root causes of failures observed in systems formed from components. Fault localization in systems deployed on mobile ad hoc networks (MANETs) is a particularly challenging task because those systems are subject to a wider variety and higher incidence of faults than those deployed in fixed networks, the resources available to track fault symptoms are severely limited, and many of the sources of faults in MANETs are by their nature transient. We present a suite of three methods, each responsible for part of the overall task of localizing the faults occurring in service-based systems hosted on MANETs. First, we describe a dependence discovery method, designed specifically for this environment, yielding dynamic snapshots of dependence relationships discovered through decentralized observations of service interactions. Next, we present a method for localizing the faults occurring in service-based systems hosted on MANETs. We employ both Bayesian and timing-based reasoning techniques to analyze the dependence data produced by the dependence discovery method in the context of a specific fault propagation model, deriving a ranked list of candidate fault locations. In the third method, we present an epidemic protocol designed for transferring the dependence and symptom data between nodes of MANET networks with low connectivity. The protocol creates network wide synchronization overlay and transfers the data over intermediate nodes in periodic synchronization cycles. We introduce a new tool for simulation of service-based systems hosted on MANETs and use the tool for evaluation of several operational aspects of the methods. Next, we present implementation of the methods in Java EE and use emulation environment to evaluate the methods. We present the results of an extensive set of experiments exploring a wide range of operational conditions to evaluate the accuracy and performance of our methods.Open Acces

Differential Behavioral Analysis

International audienceThis paper describes an attack on cryptographic devices calledDifferential Behavioral Analysis (or DBA). This is an hybrid attackbetween two already powerful attacks: differential power analysis(DPA) for the statistical treatment and safe-error attack for the fault type. DBA, simulated on an algorithmic model of AES appears to be very efficient. The attacker is able to recover the entire secret keywith byte-wise \textquotedblleft stuck-at'' faults injected repetitively. A theorical as well as a more realistic approach are presented