Nowadays, the Internet of Things touches all areas of our daily life, such as industry, economy, energy and agriculture. If we extend these domains to solutions related to smart homes and cars, we will count more than 50 billion connected devices in 2020. These applications transmit a high amount of data on the internet through IoT communication protocols. In some cases, the security aspect is required as the exchanged data can be sensitive. Therefore, it is necessary to develop a means to assess the confidence we can assign to such transmission protocols. In this context, the fault injection characterization mechanism speeds up the fault introduction into a transmission protocol to observe its reaction and to assess its resilience to application conditions with risks of errors occurring. This paper presents a systematic approach to identifying the moment of fault injection in the messaging protocol Message Queuing Telemetry Transport (MQTT). MQTT protocol handles exchanged messages across a distributed system where the injection instant cannot be defined through a time value as the synchronization of the distributed components is not guaranteed. New algorithms are introduced: (1) extract the send/receive messages' pairs, (2) timestamp the communication events using the vector clock, (3) filter the sending events and (4) generate alternate sent messages sequences. Events models for the publisher/broker provided services are generated. These services are: connect, disconnect and publish, obeying some required properties for services' quality.

We have examined the use of fault injections to evaluate the dependability of a transport layer protocol (i.e., TCP) in wireless sensor networks (WSN). We have focused on the layer's service i.e., congestion control, then, we have defined workload, faultload and dependability measures. The workload has two main components which are: the WSN architecture and the execution profile. We have defined in this paper the fault that may face different services and present their implementations in order to specify the faultload. We have introduced two dependability measures which are tolerance threshold and recovery time. We have demonstrated that the communication is interrupted after exceeding a given tolerance threshold (below this limit, the service employs a recovery time to resume execution). Our benchmarking targets eight different congestion control algorithms and presents several experiments to assess their dependability. According to our measures, BIC is the most dependable algorithm whereas Newreno and veno are the least dependable.

In this paper we introduce a aspect oriented modeling based-approach to build real-time application, which consists of transforming standard application into real-time ones at design time. This is performed by weaving real-time constraints, such as timing, scheduling, synchronization and architecture deployment into the standard application. We introduce a rule which defines how real-time constraints will be woven. Depending on the design language, this rule will have a set of instantiation values. We guess, in this paper, the case of UML designed standard applications which will be processed into a MARTE (UML profile for Modeling and Analyzing Real-Time and Embedded systems) real-time application model. We introduce our approach through a case study from the literature on real-time and embedded systems.

Designing real-time system is hard and costly. Real-time application designer must care about functional design and real-time constraints. Aspect oriented programming (AOP) allows the separation of the functional mechanisms from the non-functional ones. The separation of concerns (SoC) in AOP enhances the productivity and reduces the applications cost. In this paper we propose a SoC approach for designing real-time applications. The main idea is to process standard applications into real-time ones. The processing is done by ldquoweavingrdquo real-time constraints on the standard applications model. We introduce a rule which defines how real-time constraints will be woven. Depending on the design language, this rule will have a set of instantiation values. We gess, in this paper, the case of UML designed standard applications which will be processed into a MARTE (i.e. UML profile for modeling and analyzing real-time and embedded systems) real-time application model.

The goal of this paper is to assess the value of simple features that are widely available in off-the-shelf CORBA and Java platforms for the implementation of fault-tolerance mechanisms in industry-grade systems. This work builds on knowledge gained at LAAS from previous work on the prototyping of reflective fault tolerant frameworks. We describe how we used the interception and state capture mechanisms that are available in CORBA and Java to implement a simple replication strategy on a small middleware-based system built upon GNU/Linux and JOrbacus. We discuss the benefits and the limits of the resulting system from a practical point of view.