This paper presents a collision-free decentralized random algorithm for robots to search an unknown 2D area with *** in this paper are based on real robots instead of particles so collisions between robots are *** mov...
详细信息
ISBN:
(纸本)9781538629185
This paper presents a collision-free decentralized random algorithm for robots to search an unknown 2D area with *** in this paper are based on real robots instead of particles so collisions between robots are *** move along edges of a grid and randomly choose the next steps in sequence based on local sensing,communication,and the repulsive force method.A rigorous mathematical proof of convergence with probability 1 is *** a complete search of the area,an equilateral triangular grid should be used and the algorithm is compared with others in the simulation.
A novel decentralized method for harmonics detection and suppression is proposed. Compared with the traditional centralized style, harmonics optimal estimation task in micro-grid system is scattered to smart phasor me...
详细信息
ISBN:
(纸本)9781538635247
A novel decentralized method for harmonics detection and suppression is proposed. Compared with the traditional centralized style, harmonics optimal estimation task in micro-grid system is scattered to smart phasor measurement unit (PMU) nodes without a monitoring host. Similar to the structure, mechanism and characteristics of biological communities, a smart PMU can communicate with adjacent nodes and operate collaboratively to complete harmonics optimal estimation in a new fully distributed flat network. The task is formulated as a constrained optimization problem conducted using basic physical equations and solved by decentralized approach with varying penalty parameter. Convergence property of the novel method is analyzed theoretically. Simulation results of the harmonics estimation in micro-grid system illustrate the effectiveness of the proposed method.
This paper presents non-iterative cooperative/parallel Kalman filtering algorithms for decentralized network navigation, in which mobile nodes cooperate in both spatial and temporal domains to infer their positions. W...
详细信息
This paper presents non-iterative cooperative/parallel Kalman filtering algorithms for decentralized network navigation, in which mobile nodes cooperate in both spatial and temporal domains to infer their positions. We begin by presenting an augmented minimum-mean-square error (MMSE) estimator for centralized navigation network, and then decouple it into a set of local sub-ones each corresponding to a mobile node;all these sub-estimators work in parallel and cooperatively-with the state estimates exchanging between neighbors-to provide results similar to those obtained by the augmented one. After that, we employ the approximation methods that adopted in the conventional nonlinear Kalman filters to calculate the second-order terms involved in these sub-estimators, and propose a decentralized cooperative/parallel Kalman filtering based network navigation framework. Finally, upon the framework, we present two cooperative/parallel Kalman filtering algorithms corresponding to the extended and unscented Kalman filters respectively, and compare them with conventional decentralized methods by simulations to show the superiority.
The unprecedented capabilities of monitoring and responding to stimuli in the physical world of wireless sensor and actuator networks (WSAN) enable these networks to provide the underpinning for several Smart City app...
详细信息
The unprecedented capabilities of monitoring and responding to stimuli in the physical world of wireless sensor and actuator networks (WSAN) enable these networks to provide the underpinning for several Smart City applications, such as structural health monitoring (SHM). In such applications, civil structures, endowed with wireless smart devices, are able to self-monitor and autonomously respond to situations using computational intelligence. This work presents a decentralized algorithm for detecting damage in structures by using a WSAN. As key characteristics, beyond presenting a fully decentralized (in-network) and collaborative approach for detecting damage in structures, our algorithm makes use of cooperative information fusion for calculating a damage coefficient. We conducted experiments for evaluating the algorithm in terms of its accuracy and efficient use of the constrained WSAN resources. We found that our collaborative and information fusion-based approach ensures the accuracy of our algorithm and that it can answer promptly to stimuli (1.091s), triggering actuators. Moreover, for 100 nodes or less in the WSAN, the communication overhead of our algorithm is tolerable and the WSAN running our algorithm, operating system and protocols can last as long as 468 days.
We introduce a framework for optimal resource allocation in smart grids. We consider two components of the smart grid;the power distribution network and the data communication network. By defining suitable utility fun...
详细信息
ISBN:
(纸本)9781457717024
We introduce a framework for optimal resource allocation in smart grids. We consider two components of the smart grid;the power distribution network and the data communication network. By defining suitable utility functions, the power and bandwidth resources are optimally allocated. This requires the solution of the, so called, local public goods problem, in mathematical economics terminology. We propose an iterative, distributed algorithm for its solution. The algorithm is scalable for deployment in large networks since it requires only O(N) messages per network user per iteration, where N is the number of users. Moreover, it is guaranteed to converge, does not require revelation of private information from each user and all algorithm actions can be realized by programmable smart devices of the smart grid.
In this paper, we develop the robust transceiver optimization for the multiple-input single-output (MISO) interference channels where each transmitter (Tx) is equipped with multiple antennas and each single-antenna re...
详细信息
ISBN:
(纸本)9781509016983
In this paper, we develop the robust transceiver optimization for the multiple-input single-output (MISO) interference channels where each transmitter (Tx) is equipped with multiple antennas and each single-antenna receiver performs simultaneous wireless information and power transfer (SWIPT) based on a power-splitting architecture. Assuming imperfect channel state information (CSI) at the Txs, we design jointly optimal transmit beamforming and receive power-splitting scheme that minimizes the total transmission power under the worst-case signal-to-interference-plus-noise ratio (SINR) and energy harvesting (EH) constraints. When the channel uncertainties are bounded by ellipsoidal regions, we show that the worst-case SINR and EH constraints can be recast into quadratic matrix inequality forms, and the intended problem can be relaxed as a tractable semi-definite program. Furthermore, relying on the alternating direction method of multipliers (ADMM), we propose a decentralized algorithm capable of computing the optimal beamforming and power-splitting schemes with local CSI and limited information exchange among the Txs.
We propose distributed algorithms for high-dimensional sparse optimization. In many applications, the parameter is sparse but high-dimensional. This is pathological for existing distributed algorithms as the latter re...
详细信息
ISBN:
(纸本)9781479999880
We propose distributed algorithms for high-dimensional sparse optimization. In many applications, the parameter is sparse but high-dimensional. This is pathological for existing distributed algorithms as the latter require an information exchange stage involving transmission of the full parameter, which may not be sparse during the intermediate steps of optimization. The novelty of this work is to develop communication efficient algorithms using the stochastic Frank-Wolfe (sFW) algorithm, where the gradient computation is inexact but controllable. For star network topology, we propose an algorithm with low communication cost and establishes its convergence. The proposed algorithm is then extended to perform decentralized optimization on general network topology. Numerical experiments are conducted to verify our findings.
This paper proposes a distributed cooperative framework for improving the energy efficiency of green cellular networks. Based on the traffic load, neighboring base stations (BSs) cooperate to optimize the BS switching...
详细信息
This paper proposes a distributed cooperative framework for improving the energy efficiency of green cellular networks. Based on the traffic load, neighboring base stations (BSs) cooperate to optimize the BS switching (sleeping) strategies so as to maximize the energy saving while guaranteeing users' minimal service requirements. The inter-BS cooperation is formulated following the principle of ecological self-organization. An interaction graph is defined to capture the network impact of the BS switching operation. Then, we formulate the problem of energy saving as a constrained graphical game, where each BS acts as a game player with the constraint of traffic load. The constrained graphical game is proved to be an exact constrained potential game. Furthermore, we prove the existence of a generalized Nash equilibrium (GNE), and the best GNE coincides with the optimal solution of total energy consumption minimization. Accordingly, we design a decentralized iterative algorithm to find the best GNE (i.e., the global optimum), where only local information exchange among the neighboring BSs is needed. Theoretical analysis and simulation results finally illustrate the convergence and optimality of the proposed algorithm.
In this paper, we develop the robust transceiver optimization for the multiple-input single-output (MISO) interference channels where each transmitter (Tx) is equipped with multiple antennas and each single-antenna re...
详细信息
ISBN:
(纸本)9781509016990
In this paper, we develop the robust transceiver optimization for the multiple-input single-output (MISO) interference channels where each transmitter (Tx) is equipped with multiple antennas and each single-antenna receiver performs simultaneous wireless information and power transfer (SWIPT) based on a power-splitting architecture. Assuming imperfect channel state information (CSI) at the Txs, we design jointly optimal transmit beamforming and receive power-splitting scheme that minimizes the total transmission power under the worst-case signal-to-interference-plus-noise ratio (SINR) and energy harvesting (EH) constraints. When the channel uncertainties are bounded by ellipsoidal regions, we show that the worst-case SINR and EH constraints can be recast into quadratic matrix inequality forms, and the intended problem can be relaxed as a tractable semi-definite program. Furthermore, relying on the alternating direction method of multipliers (ADMM), we propose a decentralized algorithm capable of computing the optimal beamforming and power-splitting schemes with local CSI and limited information exchange among the Txs.
In this paper,we propose a decentralized algorithm to solve the low-rank matrix completion problem and analyze its privacy-preserving *** that we want to recover a low-rank matrix D=[D1,D2,・・・,DL]from a subset of its ...
详细信息
In this paper,we propose a decentralized algorithm to solve the low-rank matrix completion problem and analyze its privacy-preserving *** that we want to recover a low-rank matrix D=[D1,D2,・・・,DL]from a subset of its *** a network composed of L agents,each agent i observes some entries of *** factorize the unknown matrix D as the product of a public matrix X which is common to all agents and a private matrix Y=[Y1,Y2,・・・,YL]of which Yi is held by agent i *** agent i updates Yi and its local estimate of X,denoted by X(i),in an alternating *** exchanging information with neighbors,all the agents move toward a consensus on the estimates X(i).Once the consensus is(nearly)reached throughout the network,each agent i recovers Di=X(i)Yi,thus D is *** this progress,communication through the network may disclose sensitive information about the data matrices Di to a malicious *** prove that in the proposed algorithm,D-LMaFit,if the network topology is well designed,the malicious agent is unable to reconstruct the sensitive information from others.
暂无评论