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

Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots 1

16th International Symposium on algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)

作者： Molla, Anisur Rahaman Mondal, Kaushik K. Moses, William, Jr. Indian Stat Inst Comp & Commun Sci Kolkata India Indian Inst Technol Ropar Dept Math Rupnagar India Technion Israel Inst Technol Fac Ind Engn & Management Haifa Israel

ISBN: (数字)9783030624019

ISBN: (纸本)9783030624002;9783030624019

The problem of dispersion of mobile robots on a graph asks that n robots initially placed arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final configuration where exactly each node has at most one robot on it. This problem has been relatively well-studied when robots are non-faulty. In this paper, we introduce the notion of Byzantine faults to this problem, i.e., we formalize the problem of dispersion in the presence of up to f Byzantine robots. We then study the problem on a ring while simultaneously optimizing the time complexity of algorithms and the memory requirement per robot. Specifically, we design deterministic algorithms that attempt to match the time lower bound (Omega(n) rounds) and memory lower bound (Omega(log n) bits per robot). Our main result is a deterministic algorithm that is both time and memory optimal, i.e., O(n) rounds and O(log n) bits of memory required per robot, subject to certain constraints. We subsequently provide results that require less assumptions but are either only time or memory optimal but not both. We also provide a primitive that takes robots initially gathered at a node of the ring and disperses them in a time and memory optimal manner without additional assumptions required.

关键词： Dispersion Mobile robots distributed algorithm Byzantine faults Faulty robots Rings

来源：评论

学校读者我要写书评

暂无评论

The Design of FIR Filter Based on Improved DA and Implementation to High-Speed Ground Penetrating Radar System 16

The Design of FIR Filter Based on Improved DA and Implementa...

引用

16th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC)

作者： Li, Jixi Bai, Xu Han, Shuai Yu, Yue Harbin Inst Technol Sch Elect & Informat Engn Harbin Peoples R China China Acad Informat & Commun Technol Beijing Peoples R China

ISBN: (纸本)9781728131290

As one of the basic components of digital signal processing, digital finite impulse response (FIR) filters are widely used in image processing, speech recognition, and many other fields. This paper proposes an improved distributed algorithm (DA) to implement high-order digital FIR filters with less logical delay and hardware utilization. Firstly, the parallel DA is designed and then improved by look-up-table (LUT) decomposition. Secondly, the improved DA FIR filters are implemented on the Xilinx kintex-7 FPGA chip and used in high-speed ground penetrating radar (GPR) system to process radar signals. Finally, the performance of the DA filters with different order and structures are analyzed and compared, taking logical delay and hardware utilization as the key indicators. It comes to a conclusion that the parallel DA with LUT decomposition can implement high-order filter more effectively than traditional structures.

关键词： FIR filter Look-up-table distributed algorithm FPGA Parallel processing

来源：评论

学校读者我要写书评

暂无评论

distributed weighted least-squares estimation for networked systems with edge measurements

引用

AUTOMATICA 2020年 120卷 109091-109091页

作者： Yang, Qiqi Zhang, Zhaorong Fu, Minyue Shandong Univ Sch Control Sci & Engn Jinan 250061 Peoples R China Univ Newcastle Sch Elect Engn & Comp Callaghan NSW 2308 Australia Guangdong Univ Technol Sch Automat Guangzhou 510006 Peoples R China

This paper studies the problem of distributed weighted least-squares (WLS) estimation for an interconnected linear measurement network with additive noise. Two types of measurements are considered: self measurements for individual nodes, and edge measurements for the connecting nodes. Each node in the network carries out distributed estimation by using its own measurement and information transmitted from its neighbours. We study two distributed estimation algorithms: a recently proposed distributed WLS algorithm and the so-called Gaussian Belief Propagation (BP) algorithm. We first establish the equivalence of the two algorithms. We then prove a key result which shows that the information matrix is always generalized diagonally dominant, under some very mild condition. Using these two results and some known convergence properties of the Gaussian BP algorithm, we show that the aforementioned distributed WLS algorithm computes the exact WLS solution asymptotically. A bound on its convergence rate is also presented. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Weighted least-squares estimation distributed estimation Belief propagation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Boundary Recognition Based On Connection Information In Wireless Sensor Networks

Boundary Recognition Based On Connection Information In Wire...

引用

Chinese Automation Congress (CAC)

作者： Ge YuJun Gu De Liu Fei Jiangnan Univ Key Lab Adv Control Light Ind Proc Minist Educ Inst Automat Wuxi Jiangsu Peoples R China

ISBN: (数字)9781728176871

ISBN: (纸本)9781728176871

The boundary is one of the most important feature of WSN (Wireless Sensor Networks). In this paper, a scalable distributed algorithm is proposed to recognize the boundary of WSN consists by a lot of sensor nodes with decent average degree. The algorithm is based on "betweenness centrality", which only depends on the connection information within 2-hop neighborhood. Finally, the boundary is refined by the fact that boundary node has much less neighbors than the others. The simulation shows that the results of the algorithm are suitable for node deployment in different shape environments. The critical lower bound of average degree is also found in simulation.

关键词： WSN boundary detection centrality distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for optimal dispatch in smart power grids with piecewise linear cost functions

A distributed algorithm for optimal dispatch in smart power ...

引用

作者： Yasmeen, Aneela The University of Iowa

学位级别：M.S.

We consider the optimal economic dispatch of power generators in a smart electric grid for allocating power between generators to meet load requirements at minimum total cost. We assume that each generator has a piece-wise linear cost function. We first present a polynomial time algorithm that achieves optimal dispatch. We then present a decentralized algorithm where, each generator independently adjusts its power output using only the aggregate power imbalance in the network, which can be observed by each generator through local measurements of the frequency deviation on the grid. The algorithm we propose exponentially erases the power imbalance, while eventually minimizing the generation cost.

关键词： distributed algorithm economic dispatch smart grid Electrical and Computer Engineering

来源：评论

学校读者我要写书评

暂无评论

distributed event-triggered algorithms for a class of convex optimization problems over directed networks

引用

AUTOMATICA 2020年 122卷 109256-109256页

作者： Dai, Hao Fang, Xinpeng Chen, Weisheng Xidian Univ Sch Aerosp Sci & Technol Xian 710071 Peoples R China

This paper presents two distributed event-triggered algorithms under directed communication networks to solve a class of convex optimization problems such as the economic dispatch problem (EDP) with equality constraint, while the objective of optimization is the sum of all locally convex functions. One is distributed continuous-time event-triggered optimization algorithm, and the other is discrete-time algorithm based on iteration scheme. Continuous communication is not required by adopting event-triggered communication strategy. It means that the communication cost can be reduced and unnecessary waste of network resources can be avoided. Moreover, the convergence for the proposed algorithms are rigorously proved with the aid of Lyapunov stability theory under the strongly connected and weight-balanced network topology. Finally, four numerical simulations show the effectiveness and advantages of the two novel distributed event-triggered optimization algorithms. (c) 2020 Elsevier Ltd. All rights reserved.

关键词： distributed algorithm Convex optimization Equality constraint Event-triggered communication Directed network topology

来源：评论

学校读者我要写书评

暂无评论

Consensus-based distributed approach to lossy economic power dispatch of distributed energy resources

引用

INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS 2019年第7期29卷 e12041.1-e12041.17页

作者： Xing, Hao Zeng, Pingliang Mou, Yuting Wu, Qiuwei Hangzhou Dianzi Univ Sch Automat Hangzhou 310018 Zhejiang Peoples R China Catholic Univ Louvain Ctr Operat Res & Econometr Voie Roman Pays 34 Louvain La Neuve Belgium Tech Univ Denmark Dept Elect Engn Ctr Elect Power & Energy CEE DK-2800 Lyngby Denmark

Economic dispatch problem (EDP) of distributed energy resources (DERs) is the key to achieve balanced coordination and economic operation of renewable energy and conventional generation, which is of vital significance to smart grids. This paper mainly investigates the EDP of DERs with transmission losses. We formulate the lossy EDP as an optimization problem, of which the objective is to minimize the aggregated production cost under physical constraints. It is a great challenge to solve the lossy EDP in a distributed fashion, as the nonconvexity of the transmission loss formula has posed extra difficulties. This paper proposes a consensus-based distributed lambda iteration algorithm to solve the lossy EDP, and a damping mechanism is designed to overcome the oscillatory problem that conventional lambda iterations often suffer. The proposed algorithm is further improved, in order to tackle the prohibited operating zones of generators. Exhaustive simulations are presented to illustrate the proposed algorithm.

关键词： distributed algorithm economic dispatch prohibited operating zones smart grid transmission losses

来源：评论

学校读者我要写书评

暂无评论

distributed Power Control With Partial Channel State Information: Performance Characterization and Design

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第9期68卷 8982-8994页

作者： Zhang, Chao Lasaulce, Samson Agrawal, Achal Visoz, Raphael Univ Paris Saclay Lab Signaux & Syst CNRS Cent Supelec F-91190 Gif Sur Yvette France Mahindra Ecole Cent Hyderabad 500043 India Orange Labs F-92130 Issy Les Moulineaux France

One of the goals of this paper is to contribute to finding distributed power control strategies, which exploit efficiently the information available about the global channel state;it may be local or noisy. A suited way of measuring the global efficiency of a distributed power control scheme is to use the long-term utility region. First, we provide the utility region characterization for general utility functions when the channel state obeys an independent block fading law and the observation structure is memoryless. Second, the corresponding theorem is exploited to construct an iterative algorithm, which provides one-shot power control strategies. The performance of the proposed algorithm is assessed for energy-efficient and spectrally efficient communications and shown to perform much better than state-of-the-art techniques, with the additional advantage of being applicable even in the presence of arbitrary observation structures such as those corresponding to noisy channel gain estimates.

关键词： Wireless communication distributed algorithm resource management feedback communications information theory game theory

来源：评论

学校读者我要写书评

暂无评论

Arbitrary Pattern Formation by Opaque Fat Robots with Lights 6th

Arbitrary Pattern Formation by Opaque Fat Robots with Lights

引用

6th International Conference on algorithms and Discrete Applied Mathematics

作者： Bose, Kaustav Adhikary, Ranendu Kundu, Manash Kumar Sau, Buddhadeb Jadavpur Univ Dept Math Kolkata India Gayeshpur Govt Polytech Kalyani W Bengal India

ISBN: (纸本)9783030392185;9783030392192

ARBITRARY PATTERN FORMATION is a widely studied problem in autonomous robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous and identical mobile robots to form any arbitrary pattern given as input. The majority of the existing literature investigates this problem for robots with unobstructed visibility. In a few recent works, the problem has been studied in the obstructed visibility model, where the view of a robot can be obstructed by the presence of other robots. However, in these works, the robots have been modelled as dimensionless points in the plane. In this paper, we have considered the problem in the more realistic setting where the robots have a physical extent. In particular, the robots are modelled as opaque disks. Furthermore, the robots operate under a fully asynchronous scheduler. They do not have access to any global coordinate system, but agree on the direction and orientation of one coordinate axis. Each robot is equipped with an externally visible light which can assume a constant number of predefined colors. In this setting, we have given a complete characterization of initial configurations from where any arbitrary pattern can be formed by a deterministic distributed algorithm.

关键词： distributed algorithm Arbitrary Pattern Formation Leader election Opaque fat robots Luminous robots Asynchronous scheduler

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Self-Stabilizing Stable Marriage

Asynchronous Self-Stabilizing Stable Marriage

引用

作者： Laveau, Marie Université Paris-Saclay

学位级别：博士

Le Problème du Mariage Stable (SMP) est un problème d'appariement où les participants ont des préférences à propos de leurs partenaires potentiels.L'objectif est de trouver un appariement optimal (stable dans un sens) au regard des préférences. Ce type d'appariement a de très nombreuses applications comme les affectations d'étudiants à des universités (APB ou ParcourSup), celles des internes en médecine aux hôpitaux, les choix des donneurs pour les patients en attente d'organe, la mise en rapport des taxis et de leurs clients ou encore la diffusion de contenu sur *** de ces applications peuvent être traitées de manière centralisée tandis que d'autres, de par leur nature distribuée et la complexité de leurs données, nécessitent un traitement différent. Par exemple, dans le contexte du Cloud-Computing, des machines virtuelles sont émulées par des machines réelles situées sur la terre entiè*** algorithme centralisé causerait des délais considérables dans les prises de décision tout en étant sensible aux défaillances, ce qui est inconcevable pour un service supposé disponible à tout moment. D'un autre côté, chaque fois que des personnes sont impliquées dans un appariement, elles ont le droit de garder privées leurs données personnelles et en particulier leur liste de préférences, qui peut contenir des informations *** conséquent, il est souhaitable que les listes de préférence des personnes ne soient jamais transmises sur Internet, et encore moins rassemblées pour un traitement centralisé.C'est pourquoi la distribution, la tolérance aux défaillances (par auto-stabilisation) et la confidentialité sont les trois principaux mots-clés de cette thè*** ce contexte, nous proposons deux solutions distribuées auto-stabilisantes. De telles solutions tolèrent les défaillances (e.g., corruptions de mémoire ou de messages) transitoires (ou de courte durée) de n'importe quels *** confidentialité des listes de préférences est garantie par les deux

关键词： algorithmes distribués Modèles asynchrones Auto-Stabilisation Marriage Stable Complexité en Move Démon inéquitable Confidentialité distributed algorithm Asynchronous Model Self-Stabilization Stable Marriage Move Complexity Unfair Daemon Privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：