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

distributed Beamforming and Power Allocation for Heterogeneous Networks with MISO Interference Channel

SENSORS 2021年第8期21卷 2606-2606页

作者： Lee, Kisong Dongguk Univ Dept Informat & Commun Engn Seoul 04620 South Korea

To address the limitations of centralized resource allocation, i.e., high computational complexity and signaling overhead, a distributed beamforming and power allocation strategy is proposed for heterogeneous networks with multiple-input-single-output (MISO) interference channels. In the proposed scheme, each secondary user transceiver pair (SU TP) determines the beamforming vector and transmits power to maximize its own spectral efficiency (SE) while keeping the interference to the primary user below a predetermined threshold, and such resource management for each SU TP is updated iteratively without any information sharing until the strategies for all SU TPs converge. The simulation confirms that the proposed scheme can achieve a performance comparable to that of a centralized approach with a much lower computation time, e.g., less than 5% degradation in SE while improving computation time by more than 10 times.

关键词： heterogeneous networks MISO interference channel beamforming power allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for LCL optimisation problems

Distributed algorithms for LCL optimisation problems

引用

作者： Pyry Rintahaka Aalto University

学位级别：硕士

In distributed computing, nodes of a network process information algorithmically while sending and receiving data via connections. Time complexity in LOCAL model algorithms is measured in rounds of synchronous message-passing, where in one round a message traverses from one node to an adjacent node. Local processing power or message size is not limited, and each node has a unique identifier. Locally checkable labelling (LCL) problems on distributed networks rely on small local neighbourhoods together forming a globally correct output configuration. In cycle networks, locally verifiable non-trivial problems such as 3-colouring are solvable using a number t of rounds, where t has order of a very slow-growing function (i. e. iterated logarithm, or "log-star") of the network node count n. Cycle LCLs can be divided to three distinct time complexity classes, with the other two being constant time and linear time w. r. t. n. In this thesis we establish a pair of classes for certain LCL optimisation problems – binary LCL packing and covering. For them, both possible and impossible factors of approximation are derived w. r. t. time t used when not allowing randomisation. The classes contain problems in which the aim is to either maximise or minimise (respectively) the size of the solution set. In particular, relaxing the requirement of maximality or minimality of an existing LCL set problem, e. g. maximal independent set or minimal dominating set, brings forth a maximisation or minimisation variant with measurable approximation quality. In cycles, binary LCL packing problems cannot be α -approximated in constant time with α = o ( log ∗ n ). However, if the problem is not a global one, it can be (1 + ϵ )-approximated in O ( k 3 + k log ∗ n ) time in a directed cycle, where ϵ > 0 is any small positive constant and k = O ( ϵ −1 ). The presented algorithms for directed cycles can be further optimised, and similar algorithms exist for undirected cycles. Binary LCL covering proble

关键词： distributed algorithm LCL locally checkable labellings LOCAL model optimisation deterministic cycle

来源：评论

学校读者我要写书评

暂无评论

distributed and Robust Support Vector Machine

引用

International Journal of Computational Geometry and Applications 2020年第3-4期30卷 213-233页

作者： Liu, Yangwei Ding, Hu Huang, Ziyun Xu, Jinhui Department of Computer Science and Engineering State University of New York at Buffalo Buffalo 14260-1660 NY United States School of Computer Science and Technology University of Science and Technology of China Hefei Anhui China Department of Computer Science and Software Engineering Penn State Erie Behrend College Erie 16563 PA United States

In this paper, we consider the distributed version of Support Vector Machine (SVM) under the coordinator model, where all input data (i.e., points in d space) of SVM are arbitrarily distributed among k nodes in some network with a coordinator which can communicate with all nodes. We investigate two variants of this problem, with and without outliers. For distributed SVM without outliers, we prove a lower bound on the communication complexity and give a distributed (1 - )-approximation algorithm to reach this lower bound, where is a user specified small constant. For distributed SVM with outliers, we present a (1 - )-approximation algorithm to explicitly remove the influence of outliers. Our algorithm is based on a deterministic distributed top t selection algorithm with communication complexity of O(klog(t)) in the coordinator model. © 2020 World Scientific Publishing Company.

关键词： communication complexity distributed algorithm robust algorithm SVM

来源：评论

学校读者我要写书评

暂无评论

Delay Effects on Consensus-Based distributed Economic Dispatch algorithm in Microgrid

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2018年第1期33卷 602-612页

作者： Chen, Gang Zhao, Zhongyuan Chongqing Univ Minist Educ Key Lab Dependable Serv Comp Cyber Phys Soc Chongqing 400044 Peoples R China Chongqing Univ Coll Automat Chongqing 400044 Peoples R China

For microgrids with connected but sparse communication networks, consensus-based approach can provide a distributed solution to the economic dispatch problem. However, as time delays in communication networks are nonnegligible, performances of consensus-based distributed economic dispatch algorithms are not well disclosed and investigated. Considering the effects of time delays, we first provide a novel consensus-based economic dispatch algorithm. The algorithm is fully distributed such that the optimal dispatch of energy resources in microgrid can be implemented in a distributed manner. The influence of time delays on distributed economic dispatch is strictly analyzed. The maximum allowable delay bounds are derived by applying the generalized Nyquist criterion. Several simulations are presented to verify the effectiveness of the algorithm and the correctness of the theoretical results.

关键词： Consensus distributed algorithm economic dispatch microgrid multi-agent system time delays

来源：评论

学校读者我要写书评

暂无评论

A hybrid architecture for volt-var control in active distribution grids

引用

APPLIED ENERGY 2022年 312卷 118735-118735页

作者： Haider, Rabab Annaswamy, Anuradha M. MIT Mech Engn 77 Massachusetts Ave Cambridge MA 02139 USA

Modern active distribution grids are characterized by the increasing penetration of distributed energy resources (DERs). The proper coordination and scheduling of a large numbers of these small-scale and spatially distributed DERs is necessary, and warrants the use of novel distributed approaches. In this paper, we propose a hybrid volt-var control architecture for the distribution grid, which leverages existing centralized and local approaches to planning, decision making, and control, and augments it with distributed optimization and distributed control for DER management. First, we propose a convex model to describe the power physics of distribution grids of meshed topology and unbalanced structure, based on current injection and McCormick Envelopes. Second, we employ the distributed proximal atomic coordination (PAC) algorithm to coordinate DERs to provide voltage support. We implement volt-var optimization by optimally coordinating DERs including PV smart inverters and demand response. We present results using the IEEE-34 bus network, using real data from a distribution feeder in Hawaii, to model load and PV generation. Different levels of DER penetration and objective functions are simulated. Our results show the need for the coordination of DERs to improve voltage profiles, even in networks with existing voltage control devices. Further, we show the need for flexible reactive power capabilities to achieve desired grid performance.

关键词： Voltage control distributed algorithm Optimal power flow Distribution grid Solar Demand response

来源：评论

学校读者我要写书评

暂无评论

Layer Based Fast Data Collection in Battery-Free Wireless Sensor Networks 16th

Layer Based Fast Data Collection in Battery-Free Wireless Se...

引用

16th International Conference on Wireless algorithms, Systems, and Applications (WASA)

作者： Zhang, Jin Gao, Hong Yin, Dan Zhang, Kaiqi Harbin Inst Technol Sch Comp Sci & Technol Harbin Peoples R China Beijing Univ Civil Engn & Architecture Sch Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9783030859282;9783030859275

Battery-free Wireless Sensor Networks (BF-WSNs) is a promising technology of Wireless Sensor Networks (WSNs). Nodes in BF-WSNs are able to harvest ambient energy, so they have eternal life in theory. Although many works in this field study data collection, few works are concerned about latency. Moreover, some of them adopt unrealistic centralized scheduling manner, others are trapped in performance degradation. Thus, in this paper, we propose a distributed minimum latency data collection algorithm for BF-WSNs-Layer Based Fast Data Collection (LBFDC) algorithm. LBFDC is distributed so it is able to deal with dynamic situations in BF-WSNs. Because it adopts an adaptive routing strategy and allocates more chances to nodes to transmit, the latency of LBFDC is significantly reduced.

关键词： Battery-Free Wireless Sensor Networks Data collection Latency distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimized distributed Recursive Matrix Multiplication for Arbitrary Sized Matrices 8

An Optimized Distributed Recursive Matrix Multiplication for...

引用

8th IEEE International Conference on Big Data (Big Data)

作者： Parasrampuria, Utkarsh Misra, Chandan Bhattacharya, Sourangshu Rawky Tech LLP Mumbai Maharashtra India Xavier Univ Bhubaneswar Sch Comp Sci & Engn Bhubaneswar India Indian Inst Technol Kharagpur Dept Comp Sci & Engn Kharagpur W Bengal India

ISBN: (纸本)9781728162515

Strassen's block-recursive matrix multiplication is amenable to parallelization via distributed recursion. Recently, distributed implementations of Strassen's algorithm using Big-data frameworks, e.g. Apache Spark have emerged for matrices of orders which are powers of 2. This paper studies an implementation of distributed block-recursive matrix multiplication algorithm for matrices of arbitrary order with minimal zero padding. The conducted experiments show that our implementation has strong scalability with increasing matrix size enabling us to multiply large matrices with upto 21% less wall clock time than MLLib, the in-built matrix multiplication implementation in Spark. We report an interesting pattern in optimal block-size as a function of matrix size.

关键词： Matrix Multiplication Strassen's algorithm Linear Algebra distributed algorithm Apache Spark

来源：评论

学校读者我要写书评

暂无评论

CONSENSUS-BASED distributed CLUSTERING FOR IOT

CONSENSUS-BASED DISTRIBUTED CLUSTERING FOR IOT

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Chen, Hui Yu, Hao Zhao, Shengjie Shi, Qingjiang Tongji Univ Sch Math Sci Shanghai Peoples R China Tongji Univ Sch Software Engn Shanghai Peoples R China

ISBN: (纸本)9781509066315

Clustering is a common technique for statistical data analysis and it has been widely used in many fields. When the data is collected via a distributed network or distributedly stored, data analysis algorithms have to be designed in a distributed fashion. This paper investigates data clustering with distributed data. Facing the distributed network challenges including data volume, communication latency, and information security, we here propose a distributed clustering algorithm where each IoT device may have data from multiple clusters. Considering that the main task of clustering is to compute each cluster center in a weighted averaging fashion, our distributed clustering method resorts to an efficient finite-time average-consensus algorithm. Experiments show that the proposed distributed clustering algorithm can offer the same convergence and clustering quality as its centralized counterpart but with less data traffic. Besides, experiments also show that our proposed algorithms outperforms the existing methods.

关键词： clustering algorithm distributed algorithm distributed consensus K-means K-means plus

来源：评论

学校读者我要写书评

暂无评论

An Efficient distributed Approach to Construct a Minimum Spanning Tree in Cognitive Radio Network 1st

An Efficient Distributed Approach to Construct a Minimum Spa...

引用

1st International Conference on Sustainable Technologies for Computational Intelligence (ICTSCI)

作者： Rohilla, Deepak Murmu, Mahendra Kumar Kulkarni, Shashidhar NIT Kurukshetra Dept Comp Engn Kurukshetra 136119 Haryana India

ISBN: (纸本)9789811500299;9789811500282

The increasing interest in cognitive radio ad hoc network (CRAHN) has driven study and development for latest approaches. The minimum spanning trees are advantageous for data broadcasting and disseminating. This article presents an associate in nursing algorithm rule for the construction of minimum spanning tree (MST) in cognitive radio network (CRN). For communication network, MST square measure is used for important network tasks like broadcast, leader election, and synchronization. We tend to be commenced our message and time restriction-based cost or weight estimation efficient distributed algorithm for construction of a minimum spanning tree. Proposed algorithm describes including facilitates of state diagram illustration. The verification demonstration of the proposed algorithm is additionally enclosed.

关键词： distributed algorithm Cognitive radio networks Minimum spanning tree

来源：评论

学校读者我要写书评

暂无评论

distributed Joint Optimization of Beamforming and Power Allocation for Maximizing the Energy Efficiency of Cognitive Heterogeneous Networks

引用

SENSORS 2021年第9期21卷 3186-3186页

作者： Lee, Kisong Dongguk Univ Dept Informat & Commun Engn Seoul 04620 South Korea

This paper investigated an energy-efficient beamforming and power allocation strategy for cognitive heterogeneous networks with multiple-input-single-output interference channels. To maximize the sum energy efficiency of secondary users (SUs) while keeping the interference to primary networks under a predetermined threshold, I propose a distributed resource allocation algorithm using dual methods, in which each SU updates its beamforming vector and transmit power iteratively without any information sharing until convergence. The simulation results verify that the performance of the proposed scheme is comparable to that of the optimal scheme but with a much shorter computation time.

关键词： cognitive heterogeneous networks MISO interference channel energy efficiency joint optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：