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

An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks

引用

COMPUTER STANDARDS & INTERFACES 2019年 62卷 32-42页

作者： Arapoglu, Ozkan Akram, Vahid Khalilpour Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

Maximal independent set (MIS) is a very important structure that provides data aggregation, topology control and routing for wireless sensor networks (WSNs). Energy-efficient and fault-tolerant construction of MIS on WSNs is one of the vital tasks. A distributed sensor network is self-stabilizing if it can initially start at any state and regain a legal state in a finite time without any external intervention. Self-stabilization is a considerable method to provide fault tolerance in WSNs. This paper presents a distributed self-stabilizing MIS algorithm which is an improved version of Turau's algorithm under a fully distributed scheduler for WSNs. The proposed algorithm is theoretically analyzed and evaluated with its counterparts. The proposed algorithm is compared with the other studies through testbed experiments on IRIS nodes and simulations on TOSSIM environment. It is shown that the proposed algorithm outperforms other algorithms in terms of move count and energy consumption.

关键词： Wireless sensor networks Maximal independent set Self-stabilizing algorithms Fully distributed scheduler distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm to reduce contention in emergency situations by deploying cognitive radio ad-hoc controllers

引用

IET COMMUNICATIONS 2019年第17期13卷 2814-2819页

作者： Sudhakaran, Chitra M, Suganthi Thiagarajar Coll Engn Dept Elect & Commun Engn Madurai Tamil Nadu India

Nowadays, the main focus of emergency communication research is directed to the use of cognitive radio ad-hoc networks for disaster scenarios. This study addresses an efficient cooperative game-theoretic channel access scheme for data offloading and cooperation of emergency user using cooperative cognitive ad-hoc controllers in order to reduce the blocking probability of the newly incoming emergency user. The main objective is to connect all the users who are in need of urgent spectrum and it is considered that their data size is too large. Also, a hybrid overlay-underlay approach was undertaken which provides higher spectrum flexibility. A distributed algorithm is proposed which comprises a criterion assignment, merge and split algorithm and an auction mechanism to provide incentives to those controllers who participate in cooperation. An aggregate throughput of 18% is obtained as an improvement when compared with other conventional heuristics algorithm.

关键词： probability cognitive radio game theory ad hoc networks telecommunication control distributed algorithms cooperative communication wireless channels distributed algorithm emergency communication research disaster scenarios data offloading hybrid overlay-underlay approach blocking probability reduction spectrum flexibility heuristics algorithm cooperative game-theoretic channel access scheme merge and split algorithm auction mechanism cooperative cognitive radio ad-hoc network controllers

来源：评论

学校读者我要写书评

暂无评论

Adaptive Exact Penalty Design for Constrained distributed Optimization

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2019年第11期64卷 4661-4667页

作者： Zhou, Hongbing Zeng, Xianlin Hong, Yiguang Nanyang Normal Univ Sch Math & Stat Nanyang 473061 Peoples R China Beijing Inst Technol Sch Automat Key Lab Intelligent Control & Decis Complex Syst Beijing 100081 Peoples R China Chinese Acad Sci Inst Syst Sci Key Lab Syst & Control Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100190 Peoples R China

This paper focuses on a distributed convex optimization problem with set constraints, where the local objective functions are convex but not necessarily differentiable. We employ an exact penalty method for the constrained optimization problem to avoid the projection of subgradients to convex sets, which may result in problems about algorithm trajectories caused by maybe nonconvex differential inclusions and quite high computational cost. To effectively find a suitable gain of the penalty function online, we propose an adaptive distributed algorithm with the help of the adaptive control idea in order to achieve an exact solution without any a priori computation or knowledge of the objective functions. By virtue of convex and nonsmooth analysis, we give a rigorous proof for the convergence of the proposed continuous-time algorithm.

关键词： Optimization distributed algorithms Linear programming Convex functions Adaptive control Convergence Adaptive algorithms Adaptive algorithm convex and nondifferentiable function distributed optimization exact penalty method

来源：评论

学校读者我要写书评

暂无评论

Reaching a Consensus with Limited Information

Reaching a Consensus with Limited Information

引用

IEEE Conference on Decision and Control

作者： Jingxuan Zhu Yixuan Lin Ji Liu A. Stephen Morse Department of Applied Mathematics and Statistics Stony Brook University Department of Electrical and Computer Engineering Stony Brook University Department of Electrical Engineering Yale University

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can enable all of the agents to adjust or tune their "agreement variable" to the same value by utilizing real-time information obtained from their "neighbors" within the network. The aim of this paper is to study the problem of achieving a consensus in the face of limited information transfer between agents. By this it is meant that instead of each agent receiving an agreement variable or real-valued state vector from each of its neighbors, it receives a linear function of each state instead. The specific problem of interest is formulated and provably correct algorithms are developed for a number of special cases of the problem.

关键词： Sufficient conditions Privacy Protocols Machine learning Real-time systems Kernel distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A Double-Layered Fully distributed Voltage Control Method for Active Distribution Networks

引用

IEEE TRANSACTIONS ON SMART GRID 2019年第2期10卷 1465-1476页

作者： Kouveliotis-Lysikatos, Iasonas N. Koukoula, Despina, I Hatziargyriou, Nikos D. Natl Tech Univ Athens Sch Elect & Comp Engn GR-15773 Athens Greece

The increased penetration of intermittent distributed generation in distribution grids causes occasional voltage variations. The ICT infrastructure can provide the appropriate means for novel techniques to handle this kind of problems. The proposed algorithm utilizes a power flow model of the distribution grid and integrates the detection and the solution of the voltage constraint violation into a distributed double layered framework. The optimal solution of the related resource allocation problem involves the control of flexible microgenerators and loads, which can assist the grid by providing ancillary services for voltage control. The method is based on a gradient descent and a consensus algorithm for the distributed calculation of the Lagrangian multipliers. The proposed algorithm is tested in different scenarios in order to demonstrate its effectiveness.

关键词： Voltage control reactive power control distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A fully distributed learning algorithm for power allocation in heterogeneous networks

引用

COMPUTING 2019年第9期101卷 1287-1303页

作者： El Hammouti, Hajar Echabbi, Loubna El Azouzi, Rachid Natl Inst Posts & Telecommun Dept Telecommun Syst Networks & Serv Rabat Morocco Univ Avignon Dept & Lab Informat Avignon LIA Avignon France

In this work, we present a fully distributed Learning algorithm for power allocation in HetNets, referred to as the FLAPH, that reaches the global optimum given by the total social welfare. Using a mix of macro and femto base stations, we discuss opportunities to maximize users global throughput. We prove the convergence of the algorithm and compare its performance with the well-established Gibbs and Max-logit algorithms which ensure convergence to the global optimum. algorithms are compared in terms of computational complexity, memory space, and time convergence.

关键词： distributed algorithms HetNets Nash equilibrium Global optimum Gibbs-sampler Max-logit

来源：评论

学校读者我要写书评

暂无评论

Communication-free massively distributed graph generation

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2019年第0期131卷 200-217页

作者： Funke, Daniel Lamm, Sebastian Meyer, Ulrich Penschuck, Manuel Sanders, Peter Schulz, Christian Strash, Darren von Looz, Moritz Karlsruhe Inst Technol Karlsruhe Germany Univ Vienna Vienna Austria Hamilton Coll Clinton NY 13323 USA Goethe Univ Frankfurt Germany Humboldt Univ Berlin Germany

Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis and an extensive evaluation. However, engineering such algorithms is often hindered by the scarcity of publicly available datasets. Network generators serve as a tool to alleviate this problem by providing synthetic instances with controllable parameters. However, many network generators fail to provide instances on a massive scale due to their sequential nature or resource constraints. Additionally, truly scalable network generators are few and often limited in their realism. In this work, we present novel generators for a variety of network models that are frequently used as benchmarks. By making use of pseudorandomization and divide-and-conquer schemes, our generators follow a communication-free paradigm. The resulting generators are thus embarrassingly parallel and have a near optimal scaling behavior. This allows us to generate instances of up to 243 vertices and 247 edges in less than 22 min on 32 768 cores. Therefore, our generators allow new graph families to be used on an unprecedented scale. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Graph generation Communication-free distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Algorithm to Solve a System of Li near Equations With Unique or Multiple Solutions From Arbitrary Initializations

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2019年第1期6卷 82-93页

作者： Wang, Peng Ren, Wei Duan, Zhisheng Univ Calif Riverside Dept Elect & Comp Engn Riverside CA 92521 USA Peking Univ Coll Engn Dept Mech & Engn Sci Beijing 100871 Peoples R China

A discrete-time distributed algorithm to solve a system of linear equations Ax = b is proposed with M-Fejer mappings. The algorithm can find a solution of Ax = b from arbitrary initializations at a geometric rate when Ax = b has either unique or multiple solutions. When Ax = b has a unique solution, the geometric convergence rate of the algorithm is proved by analyzing the mixed norm of homogeneous M-Fejer mappings. Then, when Ax = b has multiple solutions, the geometric convergence rate is proved through orthogonal decompositions of the agents' estimates onto the row space and null space of A, and the relationship between the initializations and the final convergence point is also specified. Quantitative upper bounds of the convergence rates for two special cases are given. Finally, some simulation examples are adopted to illustrate the effectiveness of the proposed algorithm.

关键词： distributed algorithms linear equations multiagent systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive distributed Association in Time-Variant Millimeter Wave Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2019年第1期18卷 459-472页

作者： Xu, Yuzhe Ghadikolaei, Hossein S. Fischione, Carlo KTH Royal Inst Technol Elect Engn Sch Access Linnaeus Ctr SE-10044 Stockholm Sweden

The underutilized millimeter-wave (mm-wave) band is a promising candidate to enable extremely high data rate communications in future wireless networks. However, the special characteristics of the mm-wave systems such as high vulnerability to obstacles (due to high penetration loss) and to mobility (due to directional communications) demand a careful design of the association between the clients and access points (APs). This challenge can be addressed by distributed association techniques that gracefully adapt to wireless channel variations and client mobilities. We formulated the association problem as a mixed-integer optimization aiming to maximize the network throughput with proportional fairness guarantees. This optimization problem is solved first by a distributed dual decomposition algorithm, and then by a novel distributed auction algorithm where the clients act asynchronously to achieve near-to-optimal association between the clients and APs. The latter algorithm has a faster convergence with a negligible drop in the resulting network throughput. A distinguishing novel feature of the proposed algorithms is that the resulting optimal association does not have to be re-computed every time the network changes (e.g., due to mobility). Instead, the algorithms continuously adapt to the network variations and are thus very efficient. We discuss the implementation of the proposed algorithms on top of existing communication standards. The numerical analysis verifies the ability of the proposed algorithms to optimize the association and to maintain optimality in the time-variant environments of the mm-wave networks.

关键词： mm-wave communication load management distributed algorithms user association

来源：评论

学校读者我要写书评

暂无评论

Finite-time distributed topology design for optimal network resilience

引用

IET CONTROL THEORY AND APPLICATIONS 2019年第17期13卷 2792-2799页

作者： Xue, Dong Hirche, Sandra Tech Univ Munich Chair Informat Oriented Control D-80209 Munich Germany

The process of enhancing the ability of a complex network against various malicious attacks through link addition/rewiring has been the subject of extensive interest and research. The performance of existing methods often highly depends on full knowledge about the network topology. In this study, the authors devote ourselves to developing new distributed strategies to perform link manipulation sequentially using only local accessible topology information. This strategy is concerned with a matrix-perturbation-based approximation of the network-based optimisation problems and a distributed algorithm to compute eigenvectors and eigenvalues of graph matrices. In addition, the development of a distributed stopping criterion, which provides the desired accuracy on the distributed estimation algorithm, enables us to solve the link-operation problem in a finite-time manner. Finally, all results are illustrated and validated using numerical demonstrations and examples.

关键词： distributed algorithms approximation theory complex networks matrix algebra network topology graph theory eigenvalues and eigenfunctions optimisation network theory (graphs) estimation theory optimal network resilience complex network malicious attacks extensive interest network topology distributed strategies link manipulation local accessible topology information matrix-perturbation-based approximation network-based optimisation problems distributed stopping criterion distributed estimation algorithm link-operation problem finite-time distributed topology design link addition-rewiring eigenvectors and eigenvalues graph matrices numerical demonstrations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：