Search results for "distributed algorithm"
showing 10 items of 39 documents
A distributed genetic algorithm for restoration of vertical line scratches
2008
This paper reports a distributed algorithm for the restoration of still frames corrupted by vertical line scratches. The restoration is here approached as an optimisation problem, and is solved using an ad-hoc Genetic Algorithm. The distributed algorithm is designed following a pipeline logical structure. The front end is a network of standard workstations with heterogeneous operating systems. The quality of image is appreciable and the computational time is quite low with respect the sequential version.
A distributed minimum losses optimal power flow for islanded microgrids
2017
Abstract In this work, the minimum losses optimal power dispatch problem for islanded microgrids with distributed energy resources (DER) is solved by means of a distributed heuristic approach. Optimal power management is performed almost in real time, with a predefined schedule, i.e. every 5 min, and the solution is applied to generators when the current operating solution violates voltage or current constraints or when the current configuration produces too large power losses. The operating point of both inverter-interfaced generation units as well as rotating production systems can be modified simply using local information. The latter are voltage measurements and power injections or load…
A Dynamic Distributed Algorithm for Multicast Path Setup
2005
In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…
An efficient distributed approach for dynamic multicast trees
2005
In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or…
Energy-Efficiency and Coverage Quality Management for Reliable Diagnostics in Wireless Sensor Networks
2020
International audience; The processing of data and signals provided by sensors aims at extracting rnrelevant features which can be used to assess and diagnose the health state rnof the monitored targets. Nevertheless, Wireless Sensor Networks (WSNs) present rna number of shortcomings that have an impact on the quality of the gathered rndata at the sink level, leading to imprecise diagnostics rnof the observed targets. To improve data accuracy, two main critical and related issues, namely the energy consumption and coverage quality, need to be considered. The goal is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Unfortunately, these performance…
Topology design to reduce energy consumption of distributed graph filtering in WSN
2017
The large number of nodes forming current sensor networks has made essential to introduce distributed mechanisms in many traditional applications. In the emerging field of graph signal processing, the distributed mechanism of information potentials constitutes a distributed graph filtering process that can be used to solve many different problems. An important limitation of this algorithm is that it is inherently iterative, which implies that the nodes incur in a repeated communication cost along the exchange periods of the filtering process. Since sensor nodes are battery powered and radio communications are one of the most energy demanding operations, in this work, we propose to redesign …
Reliable Coverage with Circumferential WMSNs
2021
This work tackles the closed peripheral coverage issue. Such circumferential surveillance is essential in numerous realistic applications where the goal is to ensure rapid detection of any unauthorized entry/exit of the monitored area. To respond to these requirements, peripheral WMSNs can be rapidly deployed around areas of interest (e.g., temporary military camps, natural or nuclear disasters, etc.). While it seems simple, this solution raises two major challenging issues. First, checking whether the deployed peripheral WMSN forms a closed shape around the monitored region. That is, any object trying to leave or access this area must be instantaneously detected by at least one multimedia …
A Study on scale factor in distributed differential evolution.
2011
This paper proposes the employment of multiple scale factor values within distributed differential evolution structures. Four different scale factor schemes are proposed, tested, compared and analyzed. Two schemes simply employ multiple scale factor values and two also include an update logic during the evolution. The four schemes have been integrated for comparison within three recently proposed distributed differential evolution structures and tested on several various test problems. Numerical results show that, on average, the employment of multiple scale factors is beneficial since in most cases it leads to significant improvements in performance with respect to standard distributed alg…
A Simulation Software for the Evaluation of Vulnerabilities in Reputation Management Systems
2019
Multi-agent distributed systems are characterized by autonomous entities that interact with each other to provide, and/or request, different kinds of services. In several contexts, especially when a reward is offered according to the quality of service, individual agents (or coordinated groups) may act in a selfish way. To prevent such behaviours, distributed Reputation Management Systems (RMSs) provide every agent with the capability of computing the reputation of the others according to direct past interactions, as well as indirect opinions reported by their neighbourhood. This last point introduces a weakness on gossiped information that makes RMSs vulnerable to malicious agents’ intent …
Hardware and Software Platforms for Distributed Computing on Resource Constrained Devices
2014
The basic idea of distributed computing is that it is possible to solve a large problem by using the resources of various computing devices connected in a network. Each device interacts with each other in order to process a part of a problem, contributing to the achievement of a global solution. Wireless sensor networks (WSNs) are an example of distributed computing on low resources devices. WSNs encountered a considerable success in many application areas. Due to the constraints related to the small sensor nodes capabilities, distributed computing in WSNs allows to perform complex tasks in a collaborative way, reducing power consumption and increasing battery life. Many hardware platforms …