Julien Bourgeois

A global security architecture for intrusion detection on computer networks

Detecting all kinds of intrusions efficiently requires a global view of the monitored network. Built to increase the security of computer networks, traditional IDSs are unfortunately unable to give a global view of the security of a network. To overcome this situation, we are developing a distributed SOC (Security Operation Center) which is able to detect attacks occurring simultaneously on several sites in a network and to give a global view of the security of that network. In this article, we present the global architecture of our system, called DSOC as well as several methods used to test its accuracy and performance.

Distributed Intelligent MEMS: Progresses and Perspectives

MEMS research has until recently focused mainly on the engineering process, resulting in interesting products and a growing market. To fully realize the promise of MEMS, the next step is to add embedded intelligence. With embedded intelligence, the scalability of manufacturing will enable distributed MEMS systems consisting of thousands or millions of units which can work together to achieve a common goal. However, before such systems can become a reallity, we must come to grips with the challenge of scalability which will require paradigm-shifts both in hardware and software. Furthermore, the need for coordinated actuation, programming, communication and mobility management raises new challenges in both control and programming. The objective of this article is to report the progresses made by taking the example of two research projects and by giving the remaining challenges and the perspectives of distributed intelligent MEMS.

Distributed control architecture for smart surfaces

This paper presents a distributed control architecture to perform part recognition and closed-loop control of a distributed manipulation device. This architecture is based on decentralized cells able to communicate with their four neighbors thanks to peer-to-peer links. Various original algorithms are proposed to reconstruct, recognize and convey the object levitating on a new contactless distributed manipulation device. Experimental results show that each algorithm does a good job for itself and that all the algorithms together succeed in sorting and conveying the objects to their final destination. In the future, this architecture may be used to control MEMS-arrayed manipulation surfaces in order to develop Smart Surfaces, for conveying, fine positioning and sorting of very small parts for micro-systems assembly lines.

Efficient Simulation of Distributed Sensing and Control Environments

The rise of the Internet of Things raises many challenges among which is the ability to efficiently simulate a real 3D environment with intelligent objects able to sense and act. Furthermore, the apparition of micro-objects able to communicate forces such as a simulator to scale up in the number of simulated nodes. In this paper, we report the progresses made in the design of a new kind of simulator named VisibleSim. VisibleSim mixes a discrete-event core simulator with discrete-time functionnalities in the most efficient way so that simulations can scale up in numbers. Experiments show that VisibleSim can accurately and smoothly simulate 2 millions of nodes at a rate of 650k events/sec on a simple laptop.

A Global Security Architecture for Intrusion Detection on Computer Networks

Detecting all kinds of intrusions efficiently requires a global view of the monitored network. Built to increase the security of computer networks, traditional IDS are unfortunately unable to give a global view of the security of a network. To overcome this situation, we are developing a distributed SOC (security operation center) which is able to detect attacks occurring simultaneously on several sites in a network and to give a global view of the security of that network. In this article, we present the global architecture of our system, called DSOC as well as several methods used to test its accuracy and performance.

Video transmission adaptation on mobile devices

The development of multimedia streaming over wireless network is facing a lot of challenges. Taking into account mobility and highly variable bandwidth are the two major ones. Using scalable video content can solve the variable bandwidth problem only if the streaming architecture is able to react without latency. In this article, we present NetMoVie, an intermediate architecture based on real-time protocol which is able to adapt streams to the constraints of the wireless channel.

Using Nano-wireless Communications in Micro-Robots Applications

The emergence of nano-electromagnetic communications based on graphene nano-antennas has opened new perspectives for communications between small things, referred as to the internet of micro-things or even as the internet of nano-things. However, these antennas make use of the Terahertz band which raises many problems like the absorption of entire range of the available bandwidth by any molecule. Meanwhile, recent advances have been made in the design and fabrication of micro-robots enabling formation of microrobots networks. Nano-antennas are an interesting way of communicating between micro-robots. We envision two types of benefits using integrated nano-antennas in micro-robots. First, nano-wireless communications could enhance existing applications enabling a greater communication distance in an ensemble and broadcasting facilities. Second, nanowireless communications can create new usage and new applications. This article presents a simulation framework for micro-robots using nano-wireless communications and an application being developed within our simulator.

Adding new features in a peer-to-peer distributed computing framework

The aim of P2P computing is to build virtual computing systems dedicated to large-scale computational problems. This kind of architecture will contain several thousands of computing nodes, which need to be organized. Moreover, the architecture will deal with nodes dynamism and network scalability. JXTA proposes an underlying infrastructure, which builds a virtual network of peers on top of a physical network. This structure allows, among other features, to create peer groups. JNGI, which is one of the first P2P decentralized computing platforms, is already using these groups to structure the computing system. This article aims to demonstrate how to build new types of groups called similarity groups into the JNGI project. A similarity group is a peer group where all the peers have common characteristics like CPU speed or memory size. This is done in order to increase the relevance of task dispatching and therefore to increase the performance of JNGI.

Performance Prediction of an NAS Benchmark Program with ChronosMix Environment

The Networks of Workstations (NoW) are becoming real distributed execution platforms for scientific applications. Nevertheless, the heterogeneity of these platforms makes complex the design and the optimization of distributed applications. To overcome this problem, we have developed a performance prediction tool called ChronosMix, which can predict the execution time of a distributed algorithm on parallel or distributed architecture. In this article we present the performance prediction of an NAS Benchmark program with the ChronosMix environment. This study aims at emphasizing the contribution of our environment in the performance prediction process.

Distributed and efficient algorithm for self-reconfiguration of MEMS microrobots

Self-reconfiguration for moving MEMS microrobots currently needs a positioning system and a map of the target shape. Traditional positioning solutions like GPS or multilateration are not applicable in the micro-world and maps sharing does not scale. In this paper we present self-reconfiguration method where nodes are unaware of their positions, and where they do not have the final coordinates of each microrobots. In other words, nodes do not store the correct positions that build the target shape. Consequently memory usage for each node is reduced to O(1). This algorithm does not need message exchange to achieve the self-reconfiguration from a chain to square configuration (microrobots are organized in square shape) that represents the optimal logical topology for messages sending and it ensures a Snap-connectivity. Obtained results show a rapid convergence of the algorithm. The worst-case time complexity is of n movement rounds, where n represents the number of microrobots. Our algorithm is implemented in the declarative language MELD and executed in the simulator DPRSim.