检索结果-内蒙古大学图书馆

6th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Zhang, Mengyi Goupil, Alban Colas, Maxime Gelle, Guillaume Univ Reims CReSTIC F-51100 Reims France

ISBN: (纸本)9781479973392

The homology groups provide useful information about a space. In several applications, including sensor networks, a combinatorial space is built to reflect the data and their relations about a specific topic to be analyzed. Hence the computation of the homology groups is of prime interest. However, the combinatorial space may vary and the computation of its homology groups becomes more difficult. This paper proposes an adaptive algorithm which updates incrementally the homology groups, and because it uses mostly small local computations, it is inherently well adapted to large-scale network. In the second part of the paper, the algorithm is developed and applied to the sensing coverage problem in a sensor networks. Because of its structure, the algorithm is inherently distributed.

关键词： Homology groups distributed algorithm coverage problem discrete vector field

来源：评论

学校读者我要写书评

暂无评论

distributed APPM for On-Line Voltage Stability Assessment of the Large-Scale Power Grid

Distributed APPM for On-Line Voltage Stability Assessment of...

引用

IEEE PES General Meeting

作者： Liu, Jian-Hong Guo, Xian-Chang Chu, Chia-Chi Natl Tsing Hua Univ Dept Elect & Comp Engn Hsinchu 300 Taiwan

ISBN: (纸本)9781479964154

This paper studies iterative distributed algorithms for on-line voltage stability assessment (VSA) in energy management systems of modern smart power grids. Since VSA can be modelled as a special non-linear optimal power flow (OPF) problem, iterative decomposition-coordination approaches based on constrained augmented Lagrangian methods can be applied. The distributed scheme of Auxiliary Problem Principle Method (APPM) is investigated. A computation framework of this distributed algorithm is studied. The system partition with non-overlapping and boundary sub-systems is also investigated. Simulations on IEEE-57 bus and IEEE-118 bus systems have been tested to validate the feasibility and correctness of the distributed VSA.

关键词： Voltage Stability Assessment distributed algorithm Approximate Augmented Lagrangian Auxiliary Problem Principle Method System Partition

来源：评论

学校读者我要写书评

暂无评论

dIRIEr: distributed Influence Maximization In Social Network 20

dIRIEr: Distributed Influence Maximization In Social Network

引用

20th IEEE International Conference on Parallel and distributed Systems (ICPADS)

作者： Zong, Zhou. Li, Bo. Hu, Chunming. Beihang Univ Inst Adv Comp Technol Beijing Peoples R China

ISBN: (纸本)9781479976157

In this paper, for the first time, we tackle the scalability problem of Influence Maximization (IM) via distributed computing. First, we propose a distributed IM algorithm based on IRIE, one of the most state-of-the-art IM algorithms. Then an incremental updating method is proposed to reduce the overhead of repeated computation. Furthermore, based on some new insights, we redesign our algorithm with a strategy, which we call reservoir, to accumulate increments and delay exchange between machines. Experiments on real-world and synthetic networks show our redesigned algorithm, i.e. dIRIEr (distributed IRIE with Reservoir), reduces communication traffic dramatically and speeds up continuously as more machines are added in. dIRIEr can handle giant networks with hundreds of millions of nodes where centralized algorithms become infeasible.

关键词： distributed algorithm parallel influence maximization social network

来源：评论

学校读者我要写书评

暂无评论

distributed Connectivity Decomposition 14

Distributed Connectivity Decomposition

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Censor-Hillel, Keren Ghaffari, Mohsen Kuhn, Fabian Technion Haifa Israel MIT Cambridge MA 02139 USA Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450329446

A fundamental problem in distributed network algorithms is to manage congestion and obtain information flow matching the graph's connectivity. In this paper, we present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. These decompositions allow us to achieve a flow with size close to the connectivity by parallelizing it along the trees. More specifically, our distributed decomposition algorithms are as follows: (I) A decomposition of each undirected graph with vertexconnectivity k into (fractionally) vertex-disjoint weighted dominating trees with total weight Omega(k/log n), in (O)over tilde(D + root n) rounds in networks, where each node can send a total of at most O(log n) bits per round. (II) A decomposition of each undirected graph with edgeconnectivity. into (fractionally) edge-disjoint weighted spanning trees with total weight inverted right perpendicular lambda-1/2right perpendicular in (O)over tilde(D+root n lambda) rounds, if in each round, each edge can carry at most O(log n) bits of information. We also show round complexity lower bounds of (Omega)over tilde(D+root n/k) and (Omega)over tilde(D+root n/lambda) for the above two decompositions, using techniques of [Das Sarma et al., STOC'11]. Moreover, our vertex-connectivity decomposition extends to centralized algorithms and improves the time complexity of [Censor-Hillel et al., SODA'14] from O(n(3)) to near-optimal (O)over tilde(m). Additional implications of our results are: a near-linear time centralized approximation of vertex connectivity (which can be seen as a step towards a conjecture of Aho, Hopcroft and Ullman), the first distributed approximating of vertex connectivity, and distributed algorithms with near-optimal competitiveness for oblivious broadcast routing.

关键词： Graph Connectivity Decomposition distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An Approach of Power Allocation Scheme for Relay Communication Networks Based on Seller-Buyer Game

An Approach of Power Allocation Scheme for Relay Communicati...

引用

第三十四届中国控制会议

作者： Peng Zhang Zhixin Liu Ling Zhao Hongjiu Yang Xinbin Li Institute of Electrical Engineering Yanshan University Key Laboratory of Advanced Forging & Stamping Technology and Science (Yanshan University) Ministry of Education of China College of Mechanical Engineering Yanshan University

ISBN: (纸本)9781467374439

In this paper, a robust optimization problem is formulated for decode-and-forward relay network via game *** uncertainty of channel gain is considered to overcome the performance degradation in practical environment. In this study,a probability threshold method is used to suppress the channel fluctuation. Besides, a seller-buyer game is formulated to jointly consider the maximum utility of source node and relay node. To reduce the overhead information exchanging, a distributed iteration algorithm is applied. Numerical results show the effectiveness of the proposed schemes, and also present the robustness of the relay network. Moreover, the proposed game is proved to converge to the unique equilibrium point.

关键词： Relay network game theory robust optimization outage probability distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Finite Time Multi-Agent Coordination of distributed Generation for Grid Reactive Support

Finite Time Multi-Agent Coordination of Distributed Generati...

引用

IEEE Innovative Smart Grid Technologies - Asia (ISGT Asia)

作者： Polymeneas, Evangelos Benosman, Mouhacine Georgia Inst Technol Atlanta GA 30332 USA Mitsubishi Elect Res Labs Cambridge MA 02139 USA

ISBN: (纸本)9781479913008

Inverter Interfaced distributed Generation (DG) in the Smart Grid has the potential to contribute to the reactive power support of the overall power system.. However, because of the large numbers and distributed nature of the DG units, using a fully centralized communication structure to achieve coordination can be prohibitive. A decentralized coordination approach is a good candidate solution to address this problem. In the literature, asymptotic consensus based algorithms have been proposed, in order to coordinate a set of DG units so that they collectively provide a certain reference reactive power. This paper presents an alternative decentralized coordination methodology that achieves the same objective in finite time. The protocol is based on linear iterative updates and known observability results from graph structured linear systems. In this paper, the methodology is customized to solve the reactive support coordination problem from distribution-connected inverters and it is modified to reduce the number of operations per step, ensuring applicability to a large distribution network. The IEEE 37-node test feeder is used as a test system, with added inverter interfaced generation in each node. For this sample system, the proposed approach is shown to coordinate the nodes faster than the asymptotic consensus approach.

关键词： distributed algorithm reactive power control smart-grid control

来源：评论

学校读者我要写书评

暂无评论

ROBUST CONSENSUS FOR MULTI-AGENT SYSTEMS OVER UNBALANCED DIRECTED NETWORKS

引用

Journal of Systems Science & Complexity 2014年第6期27卷 1121-1137页

作者： LI Dequan WANG Xiaofan YIN Zhixiang School of Science Anhui University of Science and Technology Department of Automation Shanghai Jiao Tong Universityand Key Laboratory of System Control and Information ProcessingMinistry of Education of China

In this paper,a distributed consensus protocol is proposed for discrete-time single-integer multi-agent systems with measurement noises under general fixed directed *** time-varying control gains satisfying the stochastic approximation conditions are introduced to attenuate noises,thus the closed-loop multi-agent system is intrinsically a linear time-varying stochastic difference *** the mean square consensus convergence analysis is developed based on the Lyapunov technique,and the construction of the Lyapunov function especially does not require the typical balanced network topology condition assumed for the existence of quadratic Lyapunov ***,the proposed consensus protocol can be applicable to more general networked multi-agent systems,particularly when the bidirectional and/or balanced information exchanges between agents are not *** the proposed protocol,it is proved that the state of each agent converges in mean square to a common random variable whose mathematical expectation is the weighted average of agents' initial state values;meanwhile,the random variable's variance is bounded.

关键词： Consensus directed network distributed algorithm stochastic approximation.

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for the multi-robot task allocation problem 10

A distributed algorithm for the multi-robot task allocation ...

引用

Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I

作者： Stefano Giordani Marin Lujak Francesco Martinelli Dip. Ingegneria dell'Impresa University of Rome "Tor Vergata" Italy Dip. Informatica Sistemi e Produzione University of Rome "Tor Vergata" Italy

ISBN: (纸本)9783642130212

In this work we address the Multi-Robot Task Allocation Problem (MRTA). We assume that the decision making environment is decentralized with as many decision makers (agents) as the robots in the system. To solve this problem, we developed a distributed version of the Hungarian Method for the assignment problem. The robots autonomously perform different substeps of the Hungarian algorithm on the base of the individual and the information received through the messages from the other robots in the system. It is assumed that each robot agent has an information regarding its distance from the targets in the environment. The inter-robot communication is performed over a connected dynamic communication network and the solution to the assignment problem is reached without any common coordinator or a shared memory of the system. The algorithm comes up with a global optimum solution in O(n3) cumulative time (O(n2) for each robot), with O(n3) number of messages exchanged among the n robots.

关键词： assignment problem multi robot task allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Load Balance vs Utility Maximization in Mobile Crowd Sensing: A distributed Approach

Load Balance vs Utility Maximization in Mobile Crowd Sensing...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Li, Juan Zhu, Yanmin Yu, Jiadi Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China

ISBN: (纸本)9781479935123

This paper focuses on workload allocation among mobile nodes in a mobile crowd sensing system. We take both two important objectives into account, including load balance and sensing data utility maximization. However, workload allocation achieving both objectives is particularly challenging. First, there is an intrinsic tradeoff between load balance and utility maximization. The system should strike a good balance between the two important objectives. Second, the number of mobile users can be large. A simple exhaustive search of workload allocation results can be prohibitively expensive. In this paper, we model workload allocation as a Nash bargaining game. We propose a distributed algorithm to solve the Nash bargaining game and determine the workload to each individual smartphone. It effectively decomposes the complex optimization problem into subproblems, and obtains the workload allocation solution by an iterative procedure imitating the bargaining process. This distributed algorithm can achieve a fair tradeoff between workload balance and data utility maximization, which is provably Pareto-efflcient. We have conducted extensive simulations, and the results demonstrate that our algorithm achieves Pareto optimality and fairness between the two important objectives.

关键词： Mobile Crowd Sensing Load Balance Utility Maximization Smartphone Nash Bargaining distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Energy and Spectrum Cooperation for Cellular Communication Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第10期62卷 3678-3691页

作者： Guo, Yinghao Xu, Jie Duan, Lingjie Zhang, Rui Natl Univ Singapore Dept Elect & Comp Engn Singapore 117576 Singapore Singapore Univ Technol & Design Singapore 138682 Singapore ASTAR Inst Infocomm Res Singapore 138632 Singapore

Powered by renewable energy sources, cellular communication systems usually have different wireless traffic loads and available resources over time. To match their traffics, it is beneficial for two neighboring systems to cooperate in resource sharing when one is excessive in one resource (e.g., spectrum), while the other is sufficient in another (e.g., energy). In this paper, we propose a joint energy and spectrum cooperation scheme between different cellular systems to reduce their operational costs. When the two systems are fully cooperative in nature (e.g., belonging to the same entity), we formulate the cooperation problem as a convex optimization problem to minimize their weighted sum cost and obtain the optimal solution in closed form. We also study another partially cooperative scenario where the two systems have their own interests. We show that the two systems seek for partial cooperation as long as they find inter-system complementarity between the energy and spectrum resources. Under the partial cooperation conditions, we propose a distributed algorithm for the two systems to gradually and simultaneously reduce their costs from the non-cooperative benchmark to the Pareto optimum. This distributed algorithm also has proportional fair cost reduction by reducing each system's cost proportionally over iterations. Finally, we provide numerical results to validate the convergence of the distributed algorithm to the Pareto optimality and compare the centralized and distributed cost reduction approaches for fully and partially cooperative scenarios.

关键词： Energy harvesting energy and spectrum cooperation convex optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：