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

Adaptive step size selection in distributed optimization with observation noise and unknown stochastic target variation

引用

AUTOMATICA 2022年 135卷 109940-109940页

作者： Xie, Siyu Nazari, Masoud H. Wang, Le Yi Yin, George Wayne State Univ Dept Elect & Comp Engn Detroit MI 48202 USA Univ Connecticut Dept Math Storrs CT 06269 USA

This paper introduces distributed adaptive algorithms for optimal step size selection in a distributed constrained optimization problem that involves stochastic target variations and noisy observations. The limit behavior of the step size sequences reflects fundamental impact that must be balanced between tracking the target changes and attenuating observation noises. algorithms for simultaneously estimating target variation, tracking the global optimal solution, and finding the optimal step size are derived, which are shown to achieve convergence on all the sequences simultaneously to their respective optimal values. (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Constrained optimization Step size selection Target variation Noisy observation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Hierarchical distributed multi-energy demand response for coordinated operation of building clusters

引用

APPLIED ENERGY 2022年 308卷 118362-118362页

作者： Zheng, Ling Zhou, Bin Cao, Yijia Or, Siu Wing Li, Yong Chan, Ka Wing Hunan Univ Coll Elect & Informat Engn Changsha 410082 Peoples R China Hong Kong Polytech Univ Dept Elect Engn Kowloon Hong Kong Peoples R China Hong Kong Branch Natl Rail Transit Elect & Automa Hong Kong Peoples R China

This paper proposes a distributed multi-energy demand response (DR) methodology for the optimal coordinated operation of smart building clusters based on a hierarchical building-aggregator interaction framework. In the proposed hierarchical framework, the aggregator acts as a digital representation of building entities to offer the multi-energy load prediction of buildings using a capsule network (CapsNet) based multi-energy demand prediction model, while these buildings leverage the load flexibility and multi-energy complementarity to implement the optimal DR for reducing individual costs. Then, a fully distributed multi-energy DR approach based on the exchange alternating direction method of multipliers (ADMM), which requires only limited information to be exchanged between the aggregator and buildings, is developed to iteratively achieve the optimal multi-energy coordination of buildings. Moreover, the proposed model can be dynamically corrected with real-time load data and weather information, and the distributed multi-energy DR approach is correspondingly optimized with rolling horizon procedures to reduce the impact of prediction uncertainties. Finally, the performance of the proposed methodology is benchmarked and validated on different scales of smart buildings, and comparative results demonstrated its superiority in solving the optimal synergistic operation problem of smart buildings.

关键词： Integrated energy system Multi-energy coordination distributed algorithm Capsule network Digital space

来源：评论

学校读者我要写书评

暂无评论

Randomized renaming in shared memory systems

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2021年 150卷 112-120页

作者： Berenbrink, Petra Brinkmann, Andre Elsaesser, Robert Friedetzky, Tom Nagel, Lars Univ Hamburg Fachbereich Informat D-22527 Hamburg Germany Johannes Gutenberg Univ Mainz Zentrum Datenverarbeitung D-55099 Mainz Germany Univ Salzburg Dept Comp Sci A-5020 Salzburg Austria Univ Durham Sch Engn & Comp Sci Durham DH1 3LE England Loughborough Univ Dept Comp Sci Loughborough LE11 3TU Leics England

Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m. The problem is called tight if m = n, and loose if m > n. In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O(log n) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = (1+ epsilon).n and constant epsilon, they achieve a step complexity of O(log log n). In this paper we consider tight as well as loose renaming and introduce randomized algorithms that achieve their tasks with high probability. The model assumed is the asynchronous shared-memory model against an adaptive adversary. Our algorithm for loose renaming maps n processes to a name space of size m = (1+2/(log n)(l)).n = (1+o(1)).n performing O(l.(log log n)(2)) test-and-set operations. In the case of tight renaming, we present a protocol that assigns n processes to n names with step complexity O(log n), but without the overhead and impracticality of the AKS network. This algorithm utilizes modern hardware features in form of a counting device which is also described in the paper. This device may have the potential to speed up other distributed algorithms as well. (c) 2021 Elsevier Inc. All rights reserved.

关键词： Tight renaming Loose renaming distributed algorithm Shared memory model Randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Learning Rate Optimization for Federated Learning Exploiting Over-the-Air Computation

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2021年第12期39卷 3742-3756页

作者： Xu, Chunmei Liu, Shengheng Yang, Zhaohui Huang, Yongming Wong, Kai-Kit Southeast Univ Sch Informat Sci & Engn Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China UCL Dept Elect & Elect Engn London WC1E 6BT England

Federated learning (FL) as a promising edge-learning framework can effectively address the latency and privacy issues by featuring distributed learning at the devices and model aggregation in the central server. In order to enable efficient wireless data aggregation, over-the-air computation (AirComp) has recently attracted great attention. However, fading of wireless channels can produce aggregate distortions in an AirComp-based FL scheme. In this paper, we propose a modified federated averaging (FedAvg) algorithm by introducing the local learning rates and present the convergence analysis. To combat the distortion, the local learning rate is optimized to adapt the fading channel, which is termed as dynamic learning rate (DLR). We begin our discussion by considering multiple-input-single-output (MISO) scenario, since the underlying optimization problem is convex and has a closed-form solution. Our studies are extended to a more general multiple-input-multiple-output (MIMO) case and an iterative method is derived. We also present the asymptotic analysis and give a near-optimal and closed-form receive beamforming solution when the number of antennas approaches infinity. Extensive simulation results demonstrate the effectiveness of the proposed DLR scheme in reducing the aggregate distortion and guaranteeing the testing accuracy on the MNIST and CIFAR10 datasets. In addition, the asymptotic analysis and the close-form solution are verified through numerical simulations.

关键词： Wireless communication Computational modeling Array signal processing Aggregates Optimization Distortion Atmospheric modeling distributed algorithm federated learning over-the-air computation learning rate beamforming

来源：评论

学校读者我要写书评

暂无评论

Efficient Link Scheduling Solutions for the Internet of Things Under Rayleigh Fading

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2021年第6期29卷 2508-2521页

作者： Yu, Kan Yu, Jiguo Cheng, Xiuzhen Yu, Dongxiao Dong, Anming Qufu Normal Univ Sch Comp Sci Rizhao 276826 Peoples R China Qilu Univ Technol Sch Comp Sci & Technol Shandong Acad Sci Jinan 250353 Peoples R China Shandong Lab Comp Networks Jinan 250014 Peoples R China Shandong Univ Sch Comp Sci & Technol Qingdao 266510 Peoples R China Qilu Univ Technol Shandong Acad Sci Sch Comp Sci & Technol Jinan 250014 Peoples R China

Link scheduling is an appealing solution for ensuring the reliability and latency requirements of Internet of Things (IoT). Most existing results on the link scheduling problem were based on the graph or SINR (Signal-to-Interference-plus-Noise-Ratio) models, which ignored the impact of the random fading gain of the signals strength. In this paper, we address the link scheduling problem under the Rayleigh fading model. Both Shortest Link Scheduling (SLS) and Maximum Link Scheduling (MLS) problems are studied. In particular, we show that a set of links can he activated simultaneously under Rayleigh fading model if all link SINR constraints are satisfied. Based on the analysis of previous Link Diversity Partition (LDP) algorithm, we propose an Improved LDP (ILDP) algorithm and a centralized algorithm by localizing the global interference (denoted by CLT), building on which we design a distributed CLT algorithm (denoted by RCRDCLT) that converges to a constant approximation factor of the optimum with the time complexity of O(ln n), where n is the number of links. Furthermore, executing repeatedly RCRDCLT can solve the SLS with an approximation factor of Theta(ln n). Extensive simulations indicate that CLT is more effective than previous six popular link scheduling algorithms, and RCRDCLT has the lowest time complexity while only losses a constant fraction of the optimum schedule.

关键词： Link scheduling Internet of Things distributed algorithm Rayleigh fading SINR

来源：评论

学校读者我要写书评

暂无评论

Robust Secrecy Competition With Aggregate Interference Constraint in Small-Cell Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第4期20卷 2325-2340页

作者： Tang, Xiao Zhang, Ruonan Wang, Wei Cai, Lin Han, Zhu Northwestern Polytech Univ Dept Commun Engn Xian 710072 Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 210016 Peoples R China Univ Victoria Dept Elect & Comp Engn Victoria BC V8P 5C2 Canada Univ Houston Dept Elect & Comp Engn Houston TX 77004 USA Kyung Hee Univ Dept Comp Sci & Engn Seoul 446701 South Korea

In this article, we address the security issue in a tiered small-cell network aiming at security optimization for small-cell users (SUEs) to defend against eavesdropping. Meanwhile, the transmissions from small-cell base stations (SBSs) are subject to the aggregate interference constraints of macro-cell users (MUEs). In particular, we consider two-fold information uncertainties in small cells, i.e., the uncertainties regarding the eavesdroppers and interference channels to the MUEs. As such, the SBSs compete for robust secrecy rate with robust protection for the MUEs. We adopt the generalized robust Nash equilibrium problem (GRNEP) formulation, for which we confirm the existence of equilibrium and analyze the condition for the uniqueness with variational inequality-assisted analysis. Furthermore, to solve for the equilibrium, we introduce the pricing mechanism and decompose the original GRNEP as a nonlinear complementarity problem with a priced NEP, where the former provides solution of price coefficients and the latter for resource allocation strategies based on given prices. Finally, extensive simulation results are provided to demonstrate the impacts of the interference constraint and uncertainties upon the security performance of an individual SUE and the overall network, which also corroborate the effectiveness of our proposal in security provisioning for the SUEs and interference protection for the MUEs.

关键词： Uncertainty Aggregates Interference channels Security Resource management Proposals Interference constraints Small-cell networks robust secrecy interference constraint resource allocation pricing mechanism equilibrium distributed algorithm variational inequality

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Router-based Management of Replica Server in Next-CDN Infrastructure

Distributed Algorithm for Router-based Management of Replica...

引用

5th International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery (CyberC)

作者： Harahap, Erwin Wijekoon, Janaka Tennekoon, Rajitha Yamaguchi, Fumito Ishida, Shinichi Nishi, Hiroaki Keio Univ Ctr Comp Sci Hiroaki Nishi Lab Tokyo 108 Japan

ISBN: (纸本)9780769551067

Extending Content Delivery Network (CDN) infrastructure that has features of router-based network management system (RNMS) is highly appealing and challenging. It allows developing a CDN architecture based upon standard design to ease interoperability, scalability, performance, and flexibility both on network monitoring and management controlled from a router. To better understand the system model, necessity, and the advantages of RNMS, this paper proposed an algorithm that distributed in to a special router called Service-oriented Router (SoR). The function of algorithm is to manage the effective and efficient number of replica server runs in the network. In CDN, minimizing the number of activated replica servers should be considered in order to reduce the operation cost of the system. We propose a semantic approached algorithm that has function to optimize the selection of active replica servers which managed from SoR. The algorithm has capability to find the best location of replica servers and performs load balancing among replica servers. Our simulation result indicates that the proposed algorithm can efficiently activate the replica servers according to user's request with 33.9% effective compared to other algorithm within about one millisecond RTT increase.

关键词： distributed algorithm content delivery networks load balancing network management bayesian network SoR service-oriented router router-based network management system rnms

来源：评论

学校读者我要写书评

暂无评论

distributed localization of wireless sensor network using communication wheel

引用

INFORMATION AND COMPUTATION 2022年第PartA期289卷

作者： Bose, Kaustav Kundu, Manash Kumar Adhikary, Ranendu Sau, Buddhadeb Indian Stat Inst Adv Comp & Microelect Unit 203 BT Rd Kolkata 700108 West Bengal India Gayeshpur Govt Polytech Kalyani 741234 West Bengal India Jadavpur Univ Dept Math 188 Raja SC Mallick Rd Kolkata 700032 West Bengal India

We study the network localization problem, i.e., the problem of determining node positions of a wireless sensor network modeled as a unit disk graph. In an arbitrarily deployed network, positions of all nodes of the network may not be uniquely determined. Computational complexity results suggest that even if the network corresponds to a unique solution, a polynomial-time algorithm is unlikely to exist. So we are interested in algorithms that efficiently localize the network partially. A widely used technique that can efficiently localize a uniquely localizable portion of the network is trilateration: starting from three anchors (nodes with known positions), nodes having at least three localized neighbors are sequentially localized. However, the performance of trilateration can substantially differ for different choices of the initial three anchors. In this paper, we propose a distributed localization scheme with a theoretical characterization of nodes that are guaranteed to be localized. In particular, our proposed distributed algorithm starts localization from a strongly interior node and provided that the subgraph induced by the strongly interior nodes is connected, it localizes all nodes of the network except some boundary nodes and isolated weakly interior nodes.(c) 2022 Elsevier Inc. All rights reserved.

关键词： Wireless sensor network Range based localization Unit disk graph Trilateration distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Anti-delay Kalman filter fusion algorithm for inter-vehicle sensor network with finite-step convergence

引用

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 2024年第7期361卷

作者： Yu, Hang Zou, Yao Li, Qingyu Zhu, Jie Li, Haojie Liu, Sipei Zhang, He Dai, Keren Nanjing Univ Sci & Technol Sch Mech Engn Nanjing 210094 Jiangsu Peoples R China Univ Sci & Technol Beijing Sch Automat & Elect Engn Beijing 100083 Peoples R China North Informat Control Res Acad Grp Co Ltd Nanjing 211153 Jiangsu Peoples R China

Intelligent vehicle applications in autonomous driving and obstacle avoidance commonly require the precise relative state of vehicles. Accordingly, this study focuses on the coordinate fusion of vehicle state problem experienced by an inter -vehicle sensor network with timevarying transmission delays. Using the ingeniously designed low -complexity integration with a consensus strategy and buffer technology, an anti -delay distributed Kalman filter (DKF) with finite -step convergence is proposed. By introducing an appropriate weight matrix to assess local estimates, the optimal fusion state result is available as a linear minimum variance. In addition, to accommodate practical engineering in intelligent vehicles, the communication weight coefficient and directed topology with unidirectional transmission are considered. From a theoretical perspective, the proof of error covariances' upper bounds with different communication topologies with delays are presented. Furthermore, the maximum allowable delays of inter -vehicle sensor network are derived backwards. Simulations verify that while considering the various non -ideal factors presented above, the proposed DFK algorithm produces more accurate and robust fusion estimation state results than those of the existing algorithms, making it more valuable in practical applications. Moreover, a mobile car trajectory tracking experiment is conducted, which further verifies the feasibility of the proposed algorithm.

关键词： Kalman filter distributed algorithm Finite-step convergence Transmission delays Intelligent vehicles

来源：评论

学校读者我要写书评

暂无评论

Resilient UAV Formation for Coverage and Connectivity of Spatially Dispersed Users

Resilient UAV Formation for Coverage and Connectivity of Spa...

引用

IEEE International Conference on Communications (ICC)

作者： Wang, Yuhui Farooq, Junaid Univ Michigan Dept Elect & Comp Engn Dearborn MI 48128 USA

ISBN: (数字)9781538683477

ISBN: (纸本)9781538683477

Unmanned aerial vehicles (UAVs) are a convenient choice for carrying mobile base stations to rapidly setup communication services for ground users. Unlike terrestrial networks, UAVs do not have fiber optic backhaul connectivity except when they are tethered to the ground, which restricts their mobility. In the absence of back-haul, e.g., in remote areas, emergency situations, or in battlefields, there is a need to ensure connectivity among UAVs in addition to coverage of ground users for creating local area networks. This paper provides a distributed and dynamic approach for UAV formation-based control for coverage and connectivity of spatially dispersed users. We use flocking dynamics as a guide to constructing tailored formations of UAVs on the fly. Simulation results demonstrate that if sufficient aerial base stations are available, the proposed approach results in a strongly connected network of UAVs that is able to provide both a backhaul and fronthaul network. The approach can be further extended to create multi-tier extra-terrestrial networks to cater for large-scale applications.

关键词： unmanned aerial vehicles connectivity resilience distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：