The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper considers the optimal energy generation problem for hierarchical system, which consists of multi-cluster power system. In particular, consensus-based distributed hierarchical coordination algorithm is proposed to meet the power generation/demand balance. By using Lagrangian-based approach, we show that the optimization problem for the hierarchical system can be separated into each layer's...
Nowadays, with the increasing number of application areas of wireless sensor networks, the need for an effective solution to the calibration problem in these networks has become increasingly apparent. In particular, considering the size of the network, accessing the entire network can be costly and/or access to all may not be possible. In this paper, the problem of consensus based distributed calibration...
We propose a distributed coordination mechanism which enables nodes in a directed graph to accurately estimate their eigenvector centrality (eigencentrality) even if they update their values at times determined by their own clocks. The clocks need neither be synchronized nor have the same speed. The main idea is to let nodes adjust the weights on outgoing links to compensate for their update speed:...
In this paper, we study completely uncoupled learning algorithms for general utility maximization. We illustrate the algorithm with a wireless network application viz distributed user association. Our main contribution is expansion of achievable rate region by allowing time sharing of resources, which the previous works based on completely uncoupled strategies have ignored. First, we present a distributed...
The distributed setting of computational mobile entities, called robots, thathave to perform tasks without global coordination has been extensively studiedin the literature. A well-known scenario is that in which robots operate inLook-Compute-Move (LCM) cycles. During each cycle, a robot acquires asnapshot of the surrounding environment (Look phase), then executes anappropriate algorithm by using...
Distributed systems have been studied thoroughly. Many applications are based on huge systems and one of the main property an algorithm running on such systems should verified is fault-tolerance. This paper presents a new randomized algorithm to solve the handshake problem in a distributed system. This algorithm is designed for an asynchronous distributed network ofanonymous processes under the message...
Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental problem in multiagent system. Distributed Gibbs (DGibbs) is a sampling-based solution method that performs a stochastic search on pseudo-trees of DCOPs. Since DGibbs is a synchronous distributed algorithm, where several agents exclusively perform local search, its message communication costs are relatively large....
This paper presents Peer Matcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pair wise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, Peer Matcher employs a novel set of heuristics that aim at converging to the optimal grouping while keeping the associated...
Betweenness centrality is a metric to measure the relative importance of vertices within a graph. The computation of betweenness centrality is based on shortest paths which requires O(n+m) space and O(mn) and O(nm+n2 log n) time on unweighted and weighted graphs, respectively. It is time-consuming to deal with large-scale graphs, which motivates us resort to distributed computing and parallel algorithms...
We consider the problem of solving a Laplacian system of equations Lx = b in a distributed fashion, where L is the Laplacian of the communication graph. Solving Laplacian systems arises in a number of applications including consensus, distributed control, clock synchronization, localization and calculating effective resistances, to name a few. We leverage our analysis on a randomized variant of Kaczmarz's...
Submodular maximization enables efficient approximation of machine learning, networking, and language processing problems. Typically, these problems have been shown to have matroid constraints, which generalize matching and partition conditions. Developing scalable, distributed submodular optimization algorithms that guarantee the same performance as centralized techniques has been an active area...
Abstract probabilistic automata (APAs) constitute a complete abstraction and specification theory for probabilistic automata (PAs) [7, 8]. APA specifications support compositionality together with a step-wise refinement methodology, and thus are useful for component-oriented design and analysis of randomized distributed systems. This paper proposes a state-space reduction technique for such systems...
Multiple access channel is a well-known communication model that deploys properties of many network systems, such as Aloha multi-access systems, local area Ethernet networks, satellite communication systems, packet radio networks. The fundamental aspect of this model is to provide efficient communication and computation in the presence of restricted access to the communication resource: at most one...
This paper presents a distributed algorithm to simultaneously compute the diameter, radius and node eccentricity in all nodes of a synchronous network. Such topological information may be useful as input to configure other algorithms. Previous approaches have been modular, progressing in sequential phases using building blocks such as BFS tree construction, thus incurring longer executions than strictly...
We consider the problem of estimation from noisy relative measurements in a network. In previous work, a distributed scheme for obtaining least-squares (LS) estimates was developed based on the Jacobi algorithm; in a synchronous version, the algorithm was shown to converge exponentially and bounds on the rate of convergence have been obtained. In this paper, we design and analyze a new class of distributed...
We address the problem of time synchronization between responsive communications jammers employed for vehicle protection against radio-controlled improvised explosive devices. Unlike barrage jammers, which continuously transmit jamming signals on pre-defined frequency bands, responsive jammers periodically perform fast wideband scans of the radio spectrum and are thus able to react to observed threat...
This work proposes algorithms to control the trajectory of a team of cameras for video surveillance. We consider a chain of cameras installed in an environment. These cameras are used to detect smart intruders, who are aware of the cameras' configuration at each time instant, and who schedule their motion to avoid detection, if possible. For this problem setup, we first obtain a lower bound on the...
This paper discusses the hardware implementation of distributed control strategies that could be used to enable the utilization of distributed energy resources for the provision of grid support services. Although the capacity of individual resources may be small, the large number of them present in many distribution networks suggests that under proper coordination and control, the collective capacity...
In this paper, we propose two {\em snap-stabilizing} distributed algorithms for the \emph{committee coordination problem}. In this problem, a committee consists of a set of processes and committee meetings are synchronized, so that each process participates in at most one committee meeting at a time. Snap-stabilization is a versatile technique allowing to design algorithms that efficiently tolerate...
In this paper, we propose a distributed algorithm to control connectivity of mobile agents in a constrained dynamic network. The connectivity property of the multi-agent system is quantified by the second smallest eigenvalue of the state dependent Laplacian of the proximity graph of agents. Motivated by k-regular graph characteristics, we consider a discrete-time model for autonomous agents. We explore...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.