Benoit Darties

Benoit Darties
University of Burgundy | UB · Laboratoire Électronique, Informatique et Image (LE2I)

PhD

About

55
Publications
4,601
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
293
Citations
Introduction
I am Associate Professor at the Le2i laboratory, Univ. Bourgogne Franche-Comte. I work on combinatorics and operational research applied to networks operations. I obtained in 2007 a Ph.D in Computer Science at University from Montpellier, France. I also work on the design of low energy consumption mac protocols for WSN, and more recently on using graph theory concepts to analysis and processing very large data sets.
Additional affiliations
October 2019 - present
University of Burgundy
Position
  • Professor (Associate)
July 2008 - October 2009
Laboratoire d'Informatique de Grenoble
Position
  • PostDoc Position

Publications

Publications (55)
Article
This work is devoted to the study of the Balanced Connected Subgraph Problem (BCS) from a complexity, inapproximability and approximation point of view. The input is a graph G=(V,E), with each vertex having been colored, “red” or “blue”; the goal is to find a maximum connected subgraph G′=(V′,E′) from G that is color-balanced (having exactly |V′|/2...
Chapter
In the Internet of Things (IoT), sensor networks form the basis for interactions with the environment and are seeing accelerated development. This chapter introduces the IoT challenges that we are going to examine here. These are challenges that are related to functioning, confidentiality and security. The chapter describes the concepts of authenti...
Chapter
Le réseau devient embarqué dans notre vie quotidienne grâce à des composants de plus en plus petits, peu coûteux, puissants, rapides et de plus en plus connectés entre eux. Parallèlement à cette explosion quantitative des réseaux de communication, les technologies se complexifient. Cette évolution s’accompagne de challenges en termes de gestion et...
Article
Full-text available
This paper presents a new consensus algorithm, Proof of Usage (PoU), for the blockchain technology. This consensus is introduced for permissioned (or private) blockchains and is designed for a user-centric personal data market. This market is subject to specific regulations with which conventional blockchains fail to comply. Proof of Usage aims to...
Chapter
We present new complexity results for the Balanced Connected Subgraph (BCS) problem. Given a graph whose vertices are colored either blue or red, find the largest connected subgraph containing as many red vertices as blue vertices. We establish the NP-completeness of the decision variant of this problem in bounded-diameter and bounded-degree graphs...
Chapter
This paper presents new complexity and non-approximation results concerning two color propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic graphs, exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a...
Article
Full-text available
This article is devoted to the study of the complexity of POWER EDGE SET (PES), a problem occurring when monitoring power networks. We show that PES remains NP-hard in bipartite planar graphs with bounded degree. This result is extended to unit disk graphs and grids with maximum degree three. To the best of our knowledge, this is the most restricte...
Article
Full-text available
Wireless Sensor networks (WSN) today suffer from a lack of security adapted to their multiple constraints, to which authentication and trust management solutions such as PGP only partially responds. On the one hand, the constraints of autonomy and co-operation of the nodes necessary to guarantee the coherence of the network do not require a distrib...
Conference Paper
Full-text available
Nous nous intéressons au problème du placement de dispositifs de mesures de déphasage (PMU) sur les liens d'un réseau électrique. Nous montrons que le problème de placer un nombre optimal de PMU est NP-difficile même si le graphe modélisant le réseau est biparti planaire de degré borné, et proposons de nouveaux résultats d'inapproximation. Ce trava...
Article
Full-text available
This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$, $\mathcal{ETH}$). Moreover, we develop an efficient polynomial-time approximation algorithm for the specific case for which th...
Article
Full-text available
Sensor networks and Wireless Sensor Networks (WSN) are key components for the development of the Internet of Things. These networks are subject of two kinds of constraints. Adaptability by the mean of mutability and evolutivity, and constrained node resources such as energy consumption, computational complexity or memory usage. In this context, non...
Chapter
This chapter introduces the application of autonomic computing principles within vehicular ad hoc networks' (VANETs') environments in order to enhance the performance of QoS-based communications thanks to the self-management concept. In such environments, the design of a QoS-based broadcasting protocol is presented as a usage case. A state of the a...
Article
Full-text available
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges,...
Article
We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for whi...
Conference Paper
Full-text available
Dans un réseau, la recherche de plusieurs arbres couvrants avec des propriétés intéressantes a amené à l’introduction de plusieurs notions : les arbres couvrants arête-disjoints, les arbres indépendants enracinés en un sommet et les arbres complètement indépendants. Afin de généraliser ces notions, nous introduisons la notion d’arbres couvrants (i,...
Conference Paper
Full-text available
The exponential evolution of the smart camera processing performances is directly linked to the improvements on hardware processing elements. Nowadays, high processing performances can be reached considering hardware targets which enables a high level of task parallelism to be implemented. Highly regular tasks are good candidate for a reconfigurabl...
Article
Full-text available
This paper deals with broadcasting problem in vehicular ad hoc networks (VANETs). This communication mode is commonly used for sending safety messages and traffic information. However, designing an efficient broadcasting protocol is hard to achieve since it has to take into account some parameters related to the network environment, for example, th...
Article
Full-text available
We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient pol...
Article
Let $k\ge 2$ be an integer and $T_1,\ldots, T_k$ be spanning trees of a graph $G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$ in each $T_i$, $1\le i\le k$, do not contain common edges and common vertices, except the vertices $u$ and $v$, then $T_1,\ldots, T_k$ are completely independent spanning trees in $G$. For $2k$-...
Article
Full-text available
Nous étudions l’existence de r arbres couvrants complètement disjoints dans des graphes 2r-réguliers et 2r-connexes, et énonçons des conditions nécessaires à leur existence. Nous déterminons le nombre maximum d’arbres dans les produits cartésiens d’une clique et d’un cycle. Nous montrons que ce nombre n’est pas toujours r.
Article
Full-text available
The broadcasting communication mode is widely used in Vehicular Ad hoc Networks (VANETs). It is used for sending emergency messages, road-traffic information or to help routing protocols to determine routes. This communication mode is known to be hard to achieve efficiently since it depends on the network density. Indeed, broadcasting methods may c...
Conference Paper
Full-text available
We tackle the makespan minimization coupled-tasks problem in presence of incompatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility g...
Conference Paper
Full-text available
Broadcasting is widely used in Vehicular Ad hoc Networks (VANETs) but it is hard to achieve efficiently since it depends on the network density, i.e. may cause network congestion if the protocols are not well designed. This paper introduces a novel Autonomic Dissemination Method (ADM) which delivers messages in accordance with given priority and de...
Article
Full-text available
We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility...
Article
Full-text available
We tackle the makespan minimization problem of coupled- tasks in presence of compatibility constraint. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We show the relationship with bin packing problems for some configurations, and study several problems in frame...
Article
Full-text available
The broadcasting communication mode is widely used in Vehicular Ad~hoc Networks (VANETs). It is used for sending emergency messages, road-traffic information or to help routing protocols to determine routes. This communication mode is known to be hard to achieve efficiently since it depends on the network density. Indeed, broadcasting methods may c...
Article
Full-text available
The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a particular configuration for coupled tasks (any task is divided into two sub-tasks separated by an idle...
Article
Full-text available
IEEE 802.15.4 proposes to use a cluster-tree hierarchy to organize the transmissions in Wireless Sensor Networks. In this letter, we propose a framework to analyze formally the capacity and the energy consumption of this structure. We derive a Mixed Integer Linear Programming (MILP) formulation to obtain a topology compliant with the standard. This...
Conference Paper
Full-text available
This paper presents a generalization of the coupled-task scheduling problem introduced by Shapiro (Shapiro 1980), where considered tasks are subject to incompatibility con-straint depicted by an undirected graph. The motivation of this problem comes from data acquisition and processing in a mono-processor torpedo used for underwater exploration. As...
Conference Paper
Full-text available
A multi-channel MAC is a promising approach for improving network throughput by multiplexing transmissions over orthogonal channels. Molecular MAC has recently adopted this approach by proposing to modify the standard IEEE 802.11 DCF. It requires role and channel assignment to nodes: some of them use a static channel while others dynamically switch...
Article
Full-text available
Une couche MAC multicanal semble une approche intéressante afin d'optimiser le débit d'un réseau maillé radio en multiplexant les transmissions sur des canaux orthogonaux. En particulier, Molecular MAC pro- posé récemment étends I E E E 802.11 DCF afin d'offrir une telle fonctionnalité. Cependant, ce protocol requiert une assignation de rôles et cana...
Conference Paper
Full-text available
We propose an efficient way of constructing the wireless mesh structure associated with molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted weakly connected dominating set structure. After presenting a formal definition of the role assignment problem, we prove its NP-comp...
Conference Paper
Full-text available
A multichannel MAC improves throughput in wireless mesh networks by multiplexing transmissions over orthogonal channels. In this paper, we propose an efficient way for constructing the wireless mesh structure associated with Molecular MAC, a multichannel MAC layer designed for efficient packet forwarding. Molecular MAC outperforms other classical a...
Conference Paper
Full-text available
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in the following model: nodes send omnidirectional radio transmissions in synchronous slots; during a given slot, a node can receive a message from an adjacent node if and o...
Chapter
Full-text available
We present a new tool called the ”mv- decomposition”, and we describe some interesting algorithmic properties about it. We propose an algorithm with a complexity of O(m)O(m) to build a mv-decomposition for each bipartite graph. We use this mv-decomposition to propose a solution to the distance-2 broadcast problem in a synchronous multi-hops radio n...
Article
Full-text available
Nous présentons un nouvel outil, la mv-décomposition et détaillons quelques-unes de ses propriétés algorithmiques. Nous utilisons cette mv-décomposition pour proposer une solution en $O((\log n)^2)$ étapes avec un algorithme de complexité $O(m(\log n)^2)$ au problème de diffusion à distance $2$ dans un réseau radio multi-sauts synchrone avec présen...
Article
Full-text available
Nous nous intéressons à un problème de conception de réseaux radio dont la finalité est d'assurer la distribution d'un flux internet haut-débit depuis des n\oe uds sources vers des n\oe uds destinations. Le déploiement de ces réseaux est sujet à certaines contraintes techniques et de fonctionnement : degré des n\oe uds et nombre de sauts entre une...
Article
Full-text available
The last couple of years have seen the advent of wireless networks, doped by their ease of deployment and their use in multiple fields: personal WiFi networks, mobile telephony, ad hoc networks, sensors networks, ...The subject of this thesis relates to the study of algorithmic problems directly inspired by operating constraints which can be found...
Article
Full-text available
Nous étudions dans ce rapport la complexité d'un problème de conception de réseaux radio multi-sauts, posé au départ par une entreprise de télécommunications du sud de la France. L'objectif de cette entreprise est d'assurer la distribution d'un flux internet haut-débit dans des zones rurales non couvertes en technologie ADSL. Ce flux internet est r...
Article
Full-text available
Nous étudions un problème algorithmique inspiré des contraintes de routage rencontrées dans des réseaux sans-fil multisauts. Nous cherchons à satisfaire un ensemble de requêtes de communication dans un environnement radio où les émissions de deux noeuds trop proches génèrent une zone de brouillage. Pour satisfaire une requête il est possible de lui...
Article
Full-text available
This article presents an original tree-based broadcasting technique in known-topology radio networks. The main advantage of our strategy is it can be performed in asynchronous communication models using a protocol without acknowledgment. Considering this strategy, we introduce first results for the problem of finding a broadcasting solution which m...
Article
Full-text available
Diffusion dans les Réseaux Sans-Fil à Longueur d'Onde Unique
Article
Full-text available
Ces dernières années ont connu l'avènement des réseaux sans fil, dopés par leur facilité de déploiement et par leur usage dans de multiples domaines : réseaux domestiques Wi-Fi, téléphonie mobile, réseaux ad-hoc, réseaux de capteurs, ... L'objet de cette thèse porte sur l'étude de problèmes algorithmiques directement inspirés des contraintes de fon...

Network

Cited By

Projects

Projects (3)
Project
We study the complexity of Power Edge Set, a problem dedicated to the monitoring of an electric network. In such context we propose some new complexity results, and polynomial approximation algorithms for some classes of graphs. This project started on 2017 involves members of LE2I laboratory - University of Burgundy, and of LIRMM laboratory, University of Montpellier.