decentralized algorithms would be useful for making network resource allocations in large-scale and complex system networks because such networks tend to lack centralized operators and are subject to continuous infras...
详细信息
decentralized algorithms would be useful for making network resource allocations in large-scale and complex system networks because such networks tend to lack centralized operators and are subject to continuous infrastructure improvements. In this paper, we consider a variational inequality for network resource allocation and devise a decentralized allocation algorithm for it. The proposed algorithm enables each user in the network to decide its own optimal resource allocation in cooperation with other users without using other users' private information such as their utility functions. Moreover, we present a convergence analysis on the algorithm and apply it to the network resource allocation problem.
Conventional algorithms for autonomous trajectory planning of multiple aircraft tend to require prohibitive computational time as the number of concerned aircraft increases. To overcome this drawback, this paper prese...
详细信息
ISBN:
(纸本)9788995003879
Conventional algorithms for autonomous trajectory planning of multiple aircraft tend to require prohibitive computational time as the number of concerned aircraft increases. To overcome this drawback, this paper presents a fast and decentralized trajectory planning algorithm which can be executed in parallel. The developed algorithm combines force field method for conflict reduction and quadratic programming for trajectory optimization. Due to the parallel nature, the computational time in the developed algorithm is not as sensitive to the number of concerned aircraft as the conventional algorithms. Several results of numerical simulations are presented to demonstrate the performance of the developed algorithm.
In edge computing, application components can be placed over a range of computational devices from cloud data centers to nodes at the network edge. Application placement can have significant impact on important metric...
详细信息
In edge computing, application components can be placed over a range of computational devices from cloud data centers to nodes at the network edge. Application placement can have significant impact on important metrics like latency and resource utilization. Thus, application placement is an important optimization problem. In edge computing, the characteristics of both the infrastructure and the application may change over time, which may require the dynamic re-optimization of the application placement. Most algorithms suggested so far for the dynamic re-optimization of edge application placement are centralized, i.e., they rely on one entity collecting information from the whole infrastructure and making decisions centrally. However, centralized approaches suffer from limited scalability and are vulnerable to *** this paper, we present a decentralized approach for the dynamic re-optimization of edge application placement. We adopt an algorithm of Malek et al. for distributed systems and modify it to make it applicable to edge computing. In this approach, each node makes decisions autonomously, using auctions for coordination. Our empirical results demonstrate that the proposed algorithm is very effective in optimizing edge application placement. In an edge system with 637 edge nodes and 563 end devices, our algorithm achieves 54% higher reduction of application latency than a previous decentralized algorithm.(c) 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons .org /licenses /by-nc -nd /4 .0/).
In many large network settings, such as computer networks, social networks, or hyperlinked text documents, much information can be obtained from the network's spectral properties. However. traditional centralized ...
详细信息
In many large network settings, such as computer networks, social networks, or hyperlinked text documents, much information can be obtained from the network's spectral properties. However. traditional centralized approaches for computing eigenvectors struggle with at least two obstacles: the data may be difficult to obtain (both due to technical reasons and because of privacy concerns), and the sheer size of the networks makes the computation expensive. A decentralized, distributed algorithm addresses both of these obstacles: it utilizes the computational power of all nodes in the network and their ability to communicate, thus speeding up the computation with the network size. And as each node knows its incident edges, the data collection problem is avoided as well, Our main result is a simple decentralized algorithm for computing the top k eigenvectors, of a symmetric weighted adjacency matrix. and a proof that it converges essentially in O(tau(mix), log(2) n) rounds of communication and computation, where tau(mix), is the mixing time of a random walk on the network. An additional contribution of our work is a decentralized way of actually detecting convergence, and diagnosing the current error. Our protocol scales well, in that the amount of computation performed at any node in any one round, and the sizes of messages sent, depend linearly on the degree of the node, polynomially on k, but not at all on the (typically much larger) number n of nodes. To achieve independence of n, the coordinates of the computed eigenvectors are held locally by the nodes to which they correspond, enabling many eigenanalyses without distributing complete global state. (c) 2007 Elsevier Inc. All rights reserved.
The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as long as possible...
详细信息
The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as long as possible and cover a surface as large as possible. While most of the time this problem is formulated as a multi-objective optimization problem we present a new decentralized approach for building a connected dominating set (CDS) coupled with attractive and repulsive forces for the movement of sensors in order to maintain the network connectivity. The approach is implemented as a hybrid decentralized algorithm: DACYCLEM (decentralized algorithm under Connectivity constraint with mobilitY for Coverage and LifEtime Maximization). The lifetime and the coverage achieved by our approach are the results of the local interactions between the sensors and were not obtained by the application of a direct optimization method. We also introduce a new metric, the speed of coverage, to evaluate the balance between coverage and lifetime. Finally, our simulation results show that one single parameter of DACYCLEM is responsible for the balancing between coverage and lifetime. (C) 2018 Elsevier B.V. All rights reserved.
This paper proposes a decentralized alternating direction method of multipliers (ADMM) algorithm for solving the optimization problem of energy scheduling in microgrids. Different from the other ADMM-based distributed...
详细信息
ISBN:
(纸本)9781728119816
This paper proposes a decentralized alternating direction method of multipliers (ADMM) algorithm for solving the optimization problem of energy scheduling in microgrids. Different from the other ADMM-based distributed approaches which decomposes the monolithic problem spatially into smaller tractable subproblems, the proposed method adopts a temporal decomposition on the scenario tree inherited from multi-stage stochastic programming. Each node in the scenario tree serves its own optimization with local variables and constraints, and iteratively updates information with adjacent nodes. By implementing the proposed ADMM algorithm in a rolling fashion, simulation results have shown the fast convergence of the temporal distribution framework, and comparisons on optimal value and computation time with other optimization approaches reveals its advantages and effectiveness.
In this paper we investigate the optimal load shifting problem via electric vehicles(EVs) in a smart grid scenario which aims at flattening the total demand curve as much as possible while each EV's local constrai...
详细信息
ISBN:
(纸本)9781538629185
In this paper we investigate the optimal load shifting problem via electric vehicles(EVs) in a smart grid scenario which aims at flattening the total demand curve as much as possible while each EV's local constraints are *** assume bidirectional energy exchange between EVs and the power grid and formulate the problem as a mixed integer quadratic programming *** solve this problem in a decentralized fashion,we propose a decentralized optimal algorithm where EVs and the aggregator cooperatively find the optimal solution by communicating in a star network and conducting local *** implement the proposed algorithm,only limited data are exchanged and the aggregator does not need any parameter information of *** proposed algorithm converges much faster than traditional centralized methods/commercial solvers,as the mixed integer part is broken down into local subproblems and solved in parallel by each *** proof of the proposed algorithm is presented and numerical experiments show the effectiveness of the proposed algorithm.
Research has shown that many social networks come into being hierarchically based on some basic building blocks called communities, within which the social interactions are very intensive, but between which they are v...
详细信息
ISBN:
(纸本)9781424445998
Research has shown that many social networks come into being hierarchically based on some basic building blocks called communities, within which the social interactions are very intensive, but between which they are very weak. Network community mining algorithms aim at efficiently and effectively discovering all such communities from a given network. Many related methods have been proposed and applied to different areas including social network analysis, gene network analysis and web clustering engine. Most of the existing methods for mining communities are centralized. In this paper, we present a multi-agent based decentralized algorithm, in which a group of autonomous agents work together to mine a network through a proposed self-aggregation and self-organization mechanism. Thanks to its decentralized feature, our method is potentially suitable for dealing with distributed networks, whose global structures are hard to obtain due to their geographical distributions, decentralized controls or huge sizes. The effectiveness of our method has been tested against different benchmark networks.
The area of operation of UAS (Unmanned Aircraft Systems) has increased substantially due to falling prizes and increased on-board computational power. Many of these applications are intended to increase the safety of ...
详细信息
ISBN:
(纸本)9783642275784
The area of operation of UAS (Unmanned Aircraft Systems) has increased substantially due to falling prizes and increased on-board computational power. Many of these applications are intended to increase the safety of the civil population or to support disaster operations. One of these applications is the measurement of the concentation of toxic gases after an incident in a chemical plant to estimate the release rate. The optimal distribution of the agents of the swarm equipped with pollution sensors in the area to be scanned is an important challenge. The communication between the individual agents as well as with the ground station is limited. Furthermore, a simple function allows a weighting of a distinguished part of the area to be scanned. This paper presents technical basics and a simple, decentralized but yet effective on-board implementation as well as results in simulation.
In many large network settings, such as computer networks, social networks, or hyperlinked text documents, much information can be obtained from the network's spectral properties. However. traditional centralized ...
详细信息
In many large network settings, such as computer networks, social networks, or hyperlinked text documents, much information can be obtained from the network's spectral properties. However. traditional centralized approaches for computing eigenvectors struggle with at least two obstacles: the data may be difficult to obtain (both due to technical reasons and because of privacy concerns), and the sheer size of the networks makes the computation expensive. A decentralized, distributed algorithm addresses both of these obstacles: it utilizes the computational power of all nodes in the network and their ability to communicate, thus speeding up the computation with the network size. And as each node knows its incident edges, the data collection problem is avoided as well, Our main result is a simple decentralized algorithm for computing the top k eigenvectors, of a symmetric weighted adjacency matrix. and a proof that it converges essentially in O(tau(mix), log(2) n) rounds of communication and computation, where tau(mix), is the mixing time of a random walk on the network. An additional contribution of our work is a decentralized way of actually detecting convergence, and diagnosing the current error. Our protocol scales well, in that the amount of computation performed at any node in any one round, and the sizes of messages sent, depend linearly on the degree of the node, polynomially on k, but not at all on the (typically much larger) number n of nodes. To achieve independence of n, the coordinates of the computed eigenvectors are held locally by the nodes to which they correspond, enabling many eigenanalyses without distributing complete global state. (c) 2007 Elsevier Inc. All rights reserved.
暂无评论