Learn More
In this paper we present a new heuristic called Adaptive Broadcast Consumption (ABC for short) for the Minimum-Energy Broadcast Routing (MEBR) problem. We first investigate the problem trying to understand which are the main properties not taken into account by the classic and well–studied MST and BIP heuristics, then we propose a new algorithm proving that(More)
Prolonging the lifetime of wireless sensor networks has always been a determining factor when designing and deploying such networks. Clustering is one technique that can be used to extend the lifetime of sensor networks by grouping sensors together. However, there exists the hot spot problem which causes an unbalanced energy consumption in equally formed(More)
SYNTHESIS is a tool for automatically assembling correct and distributed component-based systems. In our context, a system is correct when it is deadlock-free and performs only specified component interactions. In order to automatically synthesize the correct composition code, SYNTHESIS takes as input an high-level behavioural description for each component(More)
Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. Given an order among the colors, a coloring is said to be greedy if there does not exist a vertex for which its associated color can be replaced by a color of lower position in the fixed order without violating the property that neighbouring vertices must(More)
The paper considers a team of robots which has to explore a graph G where some nodes can be harmful. Robots are initially located at the so called home base node. The dangerous nodes are the so called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that the minimum(More)
Several attempts have been done in the literature in the last years in order to provide a formal definition of the notions of robustness and recoverability for optimization problems. Recently, a new model of recoverable robustness has been introduced in the context of railways optimization. The basic idea of recoverable robustness is to compute solutions(More)
In this paper we present new results on the performance of the Minimum Spanning Tree heuristic for the <i>Minimum-Energy Broadcast Routing</i> (MEBR) problem. We first prove that, for any number of dimensions <i>d</i> &#8805; 2, the approximation ratio of the heuristic does not increase when the power attenuation coefficient &#945;, that is the exponent to(More)
In this paper we provide efficient robust algorithms for shunting problems concerning the reordering of train cars over a hump. In particular , we study algorithms able to cope with small disruptions, as temporary and local unavailability and/or malfunctioning of key resources that can occur and affect planned operations. To this aim, a definition of robust(More)