Search results for "Distributed algorithm"
showing 10 items of 39 documents
Optimal power flow in islanded microgrids using a simple distributed algorithm
2015
In this paper, the problem of distributed power losses minimization in islanded distribution systems is dealt with. The problem is formulated in a very simple manner and a solution is reached after a few iterations. The considered distribution system, a microgrid, will not need large bandwidth communication channels, since only closeby nodes will exchange information. The correction of generated active powers is possible by means of the active power losses partition concept that attributes a portion of the overall power losses in each branch to each generator. The experimental part shows the first results of the proposed method on an islanded microgrid. Simulation results of the distributed…
A distributed architecture for autonomous navigation of robots
2002
The paper shows a distributed architecture for autonomous robot navigation. The architecture is based on three modules that are implemented on separate and interacting agents: the target recognizer, the obsta90cle evaluator and the planner. An adaptive genetic algorithm has been studied to identify mechanisms for reaching the target and for manipulating the 2-directions of the robot; the distributed architecture has been embedded in the DAISY (Distributed Architecture for Intelligent System). Experiments have been carried out using a LEGO intelligent brick.
Overgrid: A Fully Distributed Demand Response Architecture Based on Overlay Networks
2017
In this paper, we present Overgrid, a fully distributed peer-to-peer (P2P) architecture designed to automatically control and implement distributed demand response (DR) schemes in a community of smart buildings with energy generation and storage capabilities. As overlay networks in communications establish logical links between peers regardless of the physical topology of the network, the Overgrid is able to apply some power balance criteria to its system of buildings, as they belong to a virtual microgrid, regardless of their physical location. We exploit an innovative distributed algorithm, called flow updating, for monitoring the power consumption of the buildings and the number of nodes…
Capacity and Energy-Consumption Optimization for the Cluster-Tree Topology in IEEE 802.15.4
2011
International audience; 802.15.4 proposes to use a cluster-tree hierar- chy 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 formulation provides the optimal solution for the network capacity: this con- stitutes an upper bound for any distributed algorithms permitting to construct a cluster-tree. This framework can also be used to evaluate the capacity and to compare quantitatively different cluster-tree algorithms.
Multiple UAV cooperative path planning via neuro-dynamic programming
2004
In this paper, a team of n unmanned air-vehicles (UAVs) in cooperative path planning is given the task of reaching the assigned target while i) avoiding threat zones ii) synchronizing minimum time arrivals on the target, and iii) ensuring arrivals coming from different directions. We highlight three main contributions. First we develop a novel hybrid model and suit it to the problem at hand. Second, we design consensus protocols for the management of information. Third, we synthesize local predictive controllers through a distributed, scalable and suboptimal neuro-dynamic programming (NDP) algorithm.
Distributed Coverage of Ego Networks in F2F Online Social Networks
2016
Although most online social networks rely on a centralized infrastructure, several proposals of Distributed Online Social Networks (DOSNs) have been recently presented. Since in DOSNs user profiles are stored on the peers of the users belonging to the network, one of the main challenges comes from guaranteeing the profile availability when the owner of the data is not online. In this paper, we propose a DOSN based on a friend-to-friend P2P overlay where the user's data is stored only on friend peers. Our approach is based on the ego-network concept, which models the social network from the local point of view of a single user. We propose a distributed algorithm which is based on the notion …
A task scheduling algorithm for HPC applications using colored stochastic Petri Net models
2017
The increase in demand for High Performance Computing (HPC) scientific applications motivates the efforts to reduce costs of running these applications. The problem to solve is that of dynamical multi-criterial optimal scheduling of an application on a HPC platform with a high number of heterogeneous nodes. The solution proposed by the authors is a HPC hardware-software architecture that includes the infrastructure for two level (node and inter-node level) adaptive load balancing. The article presents the development of an Coloured Petri Net(CPN) for such an architecture. The model was used for the development of a dynamic distributed algorithm for the scheduling problem. The CPN allowed a …
A Note on the Local Minimum Problem in Wireless Sensor Networks
2013
The Local Minimum Problem occurs in geographic routing scenarios. In this paper two solutions to this problem for certain network topologies are proposed. By using the notion of virtual coordinates a theoretical and a practical constructions are presented. A distributed algorithm for the practical approach is proposed.
Distributed Resource Allocation in Underlay Multicast D2D Communications
2021
Multicast device-to-device communications operating underlay with cellular networks is a spectral efficient technique for disseminating data to nearby receivers. However, due to the critical challenge of having an intelligent interference coordination between multicast groups along with the cellular network, it is necessary to judiciously perform resource allocation for the combined network. In this work, we present a framework for a joint channel and power allocation strategy to maximize the sum rate of the combined network while guaranteeing minimum rate to individual groups and cellular users. The objective function is augmented by an austerity function that penalizes excessive assignmen…
An Efficient Distributed Algorithm for Generating Multicast Distribution Trees
2005
Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is 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 complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been i…