Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Darties, Benoît"'
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
Externí odkaz:
http://arxiv.org/abs/1804.00610
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Publikováno v:
RAIRO - Operations Research, EDP Sciences, 2016, 50, pp.781 - 795
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 t
Externí odkaz:
http://arxiv.org/abs/1706.02214
Publikováno v:
Journal of Scheduling, Springer Verlag, 2011, 14 (5), pp.501-509
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 par
Externí odkaz:
http://arxiv.org/abs/1706.02202
Publikováno v:
Annals of Telecommunications - annales des t{\'e}l{\'e}communications, Springer, 2015, pp.1-10
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 s
Externí odkaz:
http://arxiv.org/abs/1706.02198
Publikováno v:
15th International Conference on Project Management and Scheduling, pp.94-97, 2016
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
Externí odkaz:
http://arxiv.org/abs/1706.02200
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
Externí odkaz:
http://arxiv.org/abs/1706.01730
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 d
Externí odkaz:
http://arxiv.org/abs/1702.08289
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 vert
Externí odkaz:
http://arxiv.org/abs/1409.6002
Publikováno v:
IEEE Conference on Local Computer Networks (LCN), Zurich : Switzerland (2009)
A multi-channel MAC seems to be an interesting approach for improving network throughput by multiplexing transmissions over orthogonal channels. In particular, Molecular MAC has recently proposed to modify the standard IEEE 802.11 DCF access method t
Externí odkaz:
http://arxiv.org/abs/0907.0649
Publikováno v:
In Journal of Discrete Algorithms September 2018 52-53:70-91
