Ontology-based collaborative framework for disaster recovery scenarios

This paper aims at designing of adaptive framework for supporting collaborative work of different actors in public safety and disaster recovery missions. In such scenarios, firemen and robots interact to each other to reach a common goal; firemen team is equipped with smart devices and robots team is supplied with communication technologies, and should carry on specific tasks. Here, reliable connection is mandatory to ensure the interaction between actors. But wireless access network and communication resources are vulnerable in the event of a sudden unexpected change in the environment. Also, the continuous change in the mission requirements such as inclusion/exclusion of new actor, changing the actor's priority and the limitations of smart devices need to be monitored. To perform dynamically in such case, the presented framework is based on a generic multi-level modeling approach that ensures adaptation handled by semantic modeling. Automated self-configuration is driven by rule-based reconfiguration policies through ontology

Self-Adaptive Communication for Collaborative Mobile Entities in ERCMS

International audienceAdaptation of communication is required for maintaining the connectivity and the quality of communication in group-wide collaborative activities. This becomes challenging to handle when considering mobile entities in a wireless environment, requiring responsiveness and availability of the communication system. We address these challenges in the context of the ROSACE project where mobile ground and flying robots have to collaborate with each other and with remote human and artificial actors to save and rescue in case of disasters such as forest fires. This paper aims to expose a communication component architecture allowing to manage a cooperative adaptation which is aware of the activity and resource context into pervasive environment. This allows to provide the appropriate adaptation of the activity in response to evolutions of the activity requirements and the changes in relation with the communication resource constraints. In this paper, we present a simulation of a ROSACE use case. The results show how ROSACE entities collaborate to maintain the connectivity and to enhance the quality of communications

Rôle d'une base de connaissance dans SemIoTics, un système autonome contrôlant un appartement connecté

National audienceL'Internet des Objets représente une réalité de plus en plus concrète au fur et à mesure que se déploient de larges réseaux d'objets connectés. Ceux-ci ouvrent de larges perspectives d'applications, mais rencontrent des difficultés en terme d'interopérabilité, de configuration ou de passage à l'échelle. Ces probléma-tiques peuvent être traitées par le recours aux principes du web de données liées, d'où l'émergence d'ontologies dédiées aux applications de l'IoT, comme IoT-O, une ontologie pour l'IoT.Par ailleurs, une description en-richie des systèmes permet d'envisager leur configuration autonome : on parle alors d'autonomic computing. Ce papier présente SemIoTics, un système autonome reposant sur des bases de connaissance pour la gestion d'un appartement connecté. Nous présentons tout d'abord une vision générique d'une architecture de réseaux d'objets connectés qui permet de guider une analyse des travaux à l'interface du web sémantique et de l'IoT. Nous décrivons ensuite les deux bases de connaissances spécialisant IoT-O sur lesquelles s'appuie SemIoTics, et leur relation avec le dispositif expérimental. Enfin, la structure de ce système autonome de domotique est présenté en détails, et mis en relation avec l'architecture identifiée dans l'état de l'art

Correctness by Construction and Style Preserving Reconfigurations of Distributed Systems.

In distributed systems and dynamic environments, software architectures may evolve. A crucial issue when conducting system evolutions is to maintain the system in a consistent and functional state. Based on formal proofs in design-time, correctness by construction has recently emerged to efficiently guarantee system coherency. This article proposes a new method for the construction and specification of correct by construction system reconfigurations. Such transformations are characterized by graph rewriting rules that necessarily preserve the coherency of a system. We firstly propose operators on graph transformations and show that they conserve their correctness. Given a system specified by a graph grammar, these operators then serve to construct and characterize a set of correct transformations. We show in particular that any correct configuration can be reached starting from any other one without inconsistent intermediate step, using these transformations only

Adaptive Communication Agent for Group Communication activities

14International audienceIn group-wide collaborative environment, managing the adaptive communication is a challenging task. It implies the monitoring of sudden change in the activities while providing a solution to maintain the connection with the available resources. In this work, we design a software agent that supports autonomic computing to ensure reliable communications among the mobile devices and Autonomous Ground vehicles (AAV). This issue is addressed in the context of save and rescue missions carried out during natural disasters such as floods and forest fires by human and voluntary operators within the framework of wireless environment. The paper focuses the autonomic functionalities of the components used to monitor, analyze, plan, and execute the adaptive mechanisms in case of evolution (mission/environment). We distribute this agent among devices and vehicles to ensure the adaptive task and it is tackled by using appropriate policies used to select the decision and executed without manual intervention. This research is applied to a Crisis Management System (CMS) within the context of the French RTRA project (ROSACE)

Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract)

International audienceMethodologies for correct by construction reconfigu-rations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non functional perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and their related dependencies. In order to lift these restrictions, an extension to graph rewriting systems is proposed herein. The suitability of this approach, as well as the restraints of currently available ones, are illustrated, analysed and experimentally evaluated with reference to a concrete example. This investigation demonstrates that the conceived solution can: (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; (v) guarantee theoretical properties of a grammar, like its termination. This is an extended abstract for the Models 2015 Conference of the journal paper of the same name [1]. I. MOTIVATION Dynamic software architectures enable adaptation in evolving distributed systems. A crucial undesirable implication of such adaptations is a potential loss of correctness, the system withdrawing from its scope of consistency. Besides correctness, the system has evolving non-functional requirements, which are tightly linked to its appropriateness or efficiency. The satisfaction of these objectives depends on the properties of the system, its components, and their relations. On one hand, graph-based models are appropriate for the design of adaptation rules that necessarily preserve the system's consistency. On the other, currently available graph based methods exhibit limitations with regard to the description of system properties, in particular regarding their evolution and inter-dependencies

Generic approach for graph-based description of dynamically reconfigurable architectures

Architectural adaptation is studied for handling adaptation in autonomic distributed systems. It is achieved by implementing a model-based approach for managing reconfiguration of dynamic architectures. Describing such architectures includes defining rules for describing both architectural styles and theirs reconfiguration mechanisms. Within this research context, the work presented in this paper is conducted using formal specification based on graphs and graph rewriting appropriately for tackling architectural adaptation problems. A graph-based general approach for describing architectures and handling their dynamic reconfiguration is introduced. Our approach is illustrated in the context of a distributed hierarchical application. The formal models that allow the generation of a graph grammar for dynamic architecture description and the automatic definition of transformation rules for achieving intern self-protecting during the adaptation are elaborated

Caractérisation de la reconfiguration dynamique des architectures logicielles par les grammaires de graphe

National audienceL'adaptabilité automatique d'une application est devenue impérative dans un contexte dynamique de syst emes complexes fortement distribués et contenant un grand nombre de composants. La résolution de cette problématique peut etre obtenue grâcè a l'adaptation structurelle impliquant une re-configuration de la structure architecturale de l'application. Nous présentons dans cet article un formalisme permettant, en utilisant les grammaires de graphes, de caractériser le style architectural d'une application et les transformations applicables lors de son exécution

Model-based provisioning and management of adaptive distributed communication in mobile cooperative systems

Adaptation of communication is required to maintain the reliable connection and to ensure the minimum quality in collaborative activities. Within the framework of wireless environment, how can host entities be handled in the event of a sudden unexpected change in communication and reliable sources? This challenging issue is addressed in the context of Emergency rescue system carried out by mobile devices and robots during calamities or disaster. For this kind of scenario, this book proposes an adaptive middleware to support reconfigurable, reliable group communications. Here, the system structure has been viewed at two different states, a control center with high processing power and uninterrupted energy level is responsible for global task and entities like autonomous robots and firemen owning smart devices act locally in the mission. Adaptation at control center is handled by semantic modeling whereas at local entities, it is managed by a software module called communication agent (CA). Modeling follows the well-known SWRL instructions which establish the degree of importance of each communication link or component. Providing generic and scalable solutions for automated self-configuration is driven by rule-based reconfiguration policies. To perform dynamically in changing environment, a trigger mechanism should force this model to take an adaptive action in order to accomplish a certain task, for example, the group chosen in the beginning of a mission need not be the same one during the whole mission. Local entity adaptive mechanisms are handled by CA that manages internal service APIs to configure, set up, and monitors communication services and manages the internal resources to satisfy telecom service requirements

Enhanced Graph Rewriting Systems for Complex Software Domain

International audienceMethodologies for correct by construction reconfigurations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non functional perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and their related dependencies. In order to lift these restrictions, an extension to graph rewriting systems is proposed herein. The suitability of this approach, as well as the restraints of currently available ones, are illustrated, analysed and experimentally evaluated with reference to a concrete example. This investigation demonstrates that the conceived solution can: (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; (v) guarantee theoretical properties of a grammar, like its termination