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

American Control Conference (ACC)

作者： A. Paul M. Akar U. Mitra M.G. Safonov Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

We examine the well known distributed power control (DPC) algorithm proposed by Foschini and Miljanic and show via simulations that it may fail to converge in the presence of time-varying channels and handoff, even when the feasibility of the power control problem is maintained at all times. Simulation results also demonstrate that the percentage of instability is a function of the variance of shadow fading, interference and the target signal to interference plus noise ratio. In order to better explain these observations and provide a systematic framework to study the stability of distributed power control algorithms in general, we present the problem in the context of switched systems, which can capture the time variations of the channel and handoffs. This formulation leads to interesting stability problems, which we address using common quadratic Lyapunov functions and M-matrices.

关键词： Switched systems Power system modeling Stability analysis Power control Signal to noise ratio Fading Interference Time-varying channels Wireless networks distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

How to use multicast in distributed mutual exclusion algorithms for grid file systems

How to use multicast in distributed mutual exclusion algorit...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Aurelien Ortiz Francois Thiebolt Jacques Jorda Abdelaziz M'zoughi IRIT Université Paul Sabatier Toulouse III Toulouse Cedex France

In a file system, critical sections are represented by means of read or write operations on useful data (i.e files) as well as metadata of the system. The processes must be synchronized to reach these shared resources, thanks to mutual exclusion algorithms which guarantee data consistency. In a grid environment, processes are compared to grid nodes and their synchronization is ensured by the sending of messages on the network. Moreover, the access time to a critical section is conditioned by the high latency of the network. In this paper, we propose a method based on the use of the multicast, which makes it possible in some cases to decrease the access time to critical sections. This solution was implemented within a token- and tree-based distributed mutual exclusion algorithm and it was integrated in the grid middleware named ViSaGe.

关键词： Multicast algorithms File systems Delay Middleware Testing Network servers Network topology distributed algorithms Concurrent computing File servers

来源：评论

学校读者我要写书评

暂无评论

Approximate distributed Bellman-Ford algorithms (computer network routing)

Approximate distributed Bellman-Ford algorithms (computer ne...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： B. Awerbuch A. Bar-Noy M. Gopal Department of Mathematics Laboratory for Computer Science MIT Cambridge MA USA T.J. Watson Research Center IBM Yorktown Heights NY USA

Routing algorithms based on the distributed Bellman-Ford algorithm (DBF) suffer from exponential message complexity in some scenarios. Two modifications to the algorithm are proposed which result in polynomial message complexity without adversely affecting the response time of the algorithm. However, the new algorithms may not compute the shortest path. Instead, the paths computed can be worse than the shortest path by at most a constant factor (<3). The modifications proposed to the original algorithm are simple and easy to implement. The message complexity of the first algorithm, called the multiplicative approximation algorithm, is O(nm log (n Delta )), where Delta is the maximum length over all edges of an n-nodes m-edges network. The message complexity of the second algorithm, called the additive approximation algorithm, is O( Delta / delta nm), where is delta is the minimum length over all edges in the network.< >

关键词： Computer networks Routing distributed computing Polynomials Network topology Tires distributed algorithms Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Zero-Gradient-Sum algorithms for distributed Convex Optimization: The Continuous-Time Case

Zero-Gradient-Sum Algorithms for Distributed Convex Optimiza...

引用

2011 American Control Conference (ACC)

作者： Jie Lu Choon Yik Tang School of Electrical and Computer Engineering University of Oklahama Norman OK USA

This paper presents a family of continuous-time distributed algorithms called Zero-Gradient-Sum (ZGS) algorithms, which solve unconstrained, separable, convex optimization problems over undirected networks with fixed topologies. The ZGS algorithms are derived using a Lyapunov function candidate that exploits convexity, and get their name from the fact that they yield nonlinear networked dynamical systems whose states slide along an invariant, zero-gradient-sum manifold and converge asymptotically to the unknown minimizer. We also present a systematic way to construct ZGS algorithms, show that a subset of them converge exponentially, and obtain lower bounds on their convergence rates in terms of the convexity characteristics of the problem and the network topology, including its algebraic connectivity. Finally, we show that some of the well-studied continuous-time distributed consensus algorithms are special cases of ZGS algorithms and discuss the ramifications.

关键词： Convergence Nickel Heuristic algorithms Convex functions Trajectory Lyapunov methods distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed End Host Multicast algorithms for Irregular Overlay Mesh

Distributed End Host Multicast Algorithms for Irregular Over...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Wanqing Tu Weijia Jia Department of Computer Science City University of Hong Kong Hong Kong China

This paper proposes a set of novel distributed algorithms on top of m-D irregular mesh overlay to achieve the short delay and low network resource consumption end host multicast services. Our end host multicast fully utilizes the advantages of m-D irregular mesh to construct a two-layer architecture. Compared to previous approaches, the novelty and contribution of our end host multicast include: 1. cluster formation that partitions the group members into different clusters in the lower layer; 2. cluster core selection that selects a core who has the minimum sum of overlay hops to all other cluster members for each cluster ; 3. weighted shortest path tree construction that constructs the shortest multicast trees with the minimum number of paths to propagate the multicast traffic; 4. distributed multicast routing directs the multicast messages to be efficiently distributed along the two-layer multicast architecture in parallel without a global control. Simulation results show that our end host multicast can distributively achieves the short delay and low network resource consumption multicast services as compared with some well-know end host multicast systems.

关键词： Multicast algorithms Routing Mesh networks Multicast protocols Peer to peer computing Computer science Robustness Scalability Floods distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Forward-Reflected-Douglas-Rachford algorithms for Generalized Nash Equilibrium

Distributed Forward-Reflected-Douglas-Rachford Algorithms fo...

引用

International Conference on Electronic Engineering and Informatics (EEI)

作者： Yong Pan Chuandong Li Haonan Zhang Ziye Hou Jiang Xiong School of Computer Science and Engineering Chongqing Three Gorges University Wanzhou Chongqing China School of Electronic and Information Engineering Southwest University Chongqing China

ISBN: (数字)9798350353594

ISBN: (纸本)9798350353600

This paper focuses on the challenge of developing a distributed solution for the Generalized Nash Equilibrium (GNE) in a networked environment. In this scenario, a group of players communicate through a connected network and aim to minimize their respective objective functions while considering the impact of other players' decisions and shared resource constraints. To address this, the paper proposes a new approach that involves reformulating the local optimal solution, introducing the network-Lagrangian, and redefining GNE as a zero-finding problem for a specific operator. The effectiveness of the algorithm is verified through its application in a Nash-Cournot production game scenario.

关键词： Couplings Games Production Nash equilibrium Linear programming Informatics distributed algorithms Convergence

来源：评论

学校读者我要写书评

暂无评论

A Survey on Centralised and distributed Clustering Routing algorithms for WSNs

A Survey on Centralised and Distributed Clustering Routing A...

引用

IEEE Vehicular Technology Conference

作者： Morteza M. Zanjireh Hadi Larijani School of Engineering and Built Environment Glasgow Caledonian University

ISBN: (纸本)9781479980895

Wireless sensor networks have a wide range of applications because they can be adapted for various environments. They can operate independently in harsh places where a human presence is risky or even impossible. Since their life time is dependent on their batteries and replacing or recharging their batteries is impossible in rough places, it is necessary to find energy efficient routing protocols for them. In this paper, a number of well-know energy efficient routing algorithms for WSNs have been classified and presented based on their attributes.

关键词： Wireless Sensor Networks Clustering Energy Efficiency Centralised algorithms distributed algorithms Uniform distribution

来源：评论

学校读者我要写书评

暂无评论

Fast convergence of distributed joint spreading sequence and power control algorithms

Fast convergence of distributed joint spreading sequence and...

引用

IEEE Radio and Wireless Symposium (RWS formerly RAWCON)

作者： Catalin Lacatus David Akopian Mehdi Shadaram Department of Electrical and Computer Engineering University of Texas San Antonio San Antonio TX USA

In this paper a distributed iterative algorithm is developed for joint spreading sequence design and power control in the uplink of CDMA systems. Simultaneous iterations are implemented using gradient approaches for convex cost functions with nonlinear QoS constraints. Performing parallel iterations instead of round robin iterations, the algorithm convergence speed is significantly increased. Different from conventional approaches the algorithm convergence speed will not explicitly depend on the number of active users. Moreover, the efficiency of our method increases by increasing the number of active users.

关键词： Convergence Power control Round robin Algorithm design and analysis Multiaccess communication Iterative algorithms Feedback distributed algorithms Cost function Colored noise

来源：评论

学校读者我要写书评

暂无评论

A Dual Approach for Optimal algorithms in distributed Optimization over Networks

A Dual Approach for Optimal Algorithms in Distributed Optimi...

引用

Information Theory and Applications Workshop, ITA

作者： César A. Uribe Soomin Lee Alexander Gasnikov Angelia Nedić Laboratory for Information and Decision Systems and the Institute for Data Systems and Society Massachusetts Institute of Technology Cambridge Massachusetts USA Yahoo! Research Sunnyvale California USA Moscow Institute of Physics and Technology and Institute for Information Transmission Moscow Oblast Russia School of Electrical Computer and Energy Engineering Arizona State University Tempe Arizona USA

ISBN: (数字)9781728141909

ISBN: (纸本)9781728188256

We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum Σ i=1 m f i (z) of functions over in a network. We provide complexity bounds for four different cases, namely: each function f is strongly convex and smooth, each function is either strongly convex or smooth, and when it is convex but neither strongly convex nor smooth. Our approach is based on the dual of an appropriately formulated primal problem, which includes a graph that models the communication restrictions. We propose distributed algorithms that achieve the same optimal rates as their centralized counterparts (up to constant and logarithmic factors), with an additional optimal cost related to the spectral properties of the network. Initially, we focus on functions for which we can explicitly minimize its Legendre-Fenchel conjugate, i.e., admissible or dual friendly functions. Then, we study distributed optimization algorithms for non-dual friendly functions, as well as a method to improve the dependency on the parameters of the functions involved. Numerical analysis of the proposed algorithms is also provided.

关键词： Smoothing methods Numerical analysis Convex functions Complexity theory distributed algorithms Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Obstacle avoidance for multi-missile network via distributed coordination algorithm

引用

Chinese Journal of Aeronautics 2016年第2期29卷 441-447页

作者： Zhao Jiang Zhou Rui School of Automation Science and Electrical Engineering Beihang University

A distributed coordination algorithm is proposed to enhance the engagement of the multi-missile network in consideration of obstacle avoidance. To achieve a cooperative interception, the guidance law is developed in a simple form that consists of three individual components for tar- get capture, time coordination and obstacle avoidance. The distributed coordination algorithm enables a group of interceptor missiles to reach the target simultaneously, even if some member in the multi-missile network can only collect the information from nearest neighbors. The simula- tion results show that the guidance strategy provides a feasible tool to implement obstacle avoid- ance for the multi-missile network with satisfactory accuracy of target capture. The effects of the gain parameters are also discussed to evaluate the proposed approach.

关键词： Cooperative guidance distributed algorithms Impact time Missile guidance Multiple missiles Obstacle avoidance Proportional navigation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：