微电脑自动均分负载电流控制器的研制

介绍了自动均分负载电流的工作原理及按此原理设计的微电脑自动均分负载电流控制器的设计思想。该控制模式结构简单、功能完善、输出电压调节范围宽、均流效果好 ,是电源模块并联供电系统中的一种理想、可靠的均分负载电流控制系统。

地铁列车控制系统的冗余信号电源设计

地铁列车控制系统是现代城市地铁运营的核心系统,稳定可靠的信号电源对于保障地铁运营安全和乘客出行至关重要。提出稳定可靠的冗余信号电源设计方案,首先介绍该冗余信号电源的总体结构,其次按照总体结构详细说明冗余电源电路、EMC防护电路、负载均分电路的具体实现方案,给出相关电路的原理图,以及所采用元器件的具体参数说明。最后对该冗余信号电源进行纹波测试、噪声测试、冲击电流测试、冗余特性测试,并详细说明实验的过程,给出实验结果。

基于阻抗功率下垂的并联逆变器功率均分策略

传统下垂控制逆变器并联时,因为线路阻抗差异导致负载功率分配不均。在此提出了一种基于阻抗功率下垂的功率均分策略,该控制策略使用了合适的前馈信号消除了逆变器固有阻抗的影响,然后使用逆变器输出的视在功率作为调整其虚拟阻抗的基准,从而实现了虚拟阻抗的自适应调节。该方法不需要高带宽的通信线路,即可有效提高逆变器并联时的负载均分能力,并且具有较好的动态性能。仿真与实验结果验证了所提方法的有效性。

使用平均电流控制的逆变器并联系统

研究了基于平均电流控制的逆变器并联系统。通过分布在各模块中的平均电路,对各模块的电流给定信号进行平均后产生共享的电流基准信号,由此实现负载均分。推导了带负载电流前馈补偿的并联系统的数学模型,其等效传递函数与单台逆变器相似;通过理论分析、仿真和实验对有、无负载电流补偿两种控制方式下的并联系统外特性和均流性能进行了对比分析。实验结果表明并联系统具有动态响应快速,均流性能好的特点。

并联三相逆变器环流的双变零矢量控制研究

并联三相逆变器的参数不可避免地存在差异,导致逆变器间会产生环流。环流会造成逆变器损耗增加、输出电压、电流波形畸变等危害。为了解决这个问题,提出通过零序占空比来抑制环流的控制策略。在建立零序环流数学模型的基础上,针对传统零序环流控制策略中基于空间矢量脉宽调制(SVPWM)算法中一个载波周期内仅单次调节零矢量的作用时间,导致环流抑制效果不佳的问题,提出在一个载波周期内进行两次零矢量作用时间调节,提高零序环流控制实时性;并基于各逆变器输出的瞬时功率反馈来实现并联逆变器负载功率自适应均分的控制方案。该方案不仅能够很好地抑制环流,实现负载均分,而且能显著地改善三相逆变器输出电压和电流波形。通过仿真和半实物仿真实验平台验证了该方案的有效性。

基于低频电流注入的船舶直流微电网线路阻抗检测

下垂控制是船舶直流微电网中一种实现系统能量分配的有效方法。在传统下垂控制中,系统内各微源之间线路阻抗不一致,导致各分布式微源承担的功率也不一致,严重时微源直流变换器甚至出现过载故障。为了解决船舶直流微电网中由线路阻抗引起的负载均流精度问题,提出利用低频注入来检测线路阻抗的方法。通过在电感电流上注入低频交流信号,检测注入后的变换器电压、电流信息,利用傅里叶变换求得线路阻抗值,进一步补偿下垂系数。该方法可以提高微电网系统直流母线电压质量,改善直流变换器并联均流时的负载均分效果,对系统稳定运行影响小。最后仿真结果验证了该方法的有效性。

微电网中并联逆变器的改进下垂控制策略

提出一种改进并联逆变器自适应下垂控制方法,该方法是在传统控制方法基础上引入功率与下垂系数的一次函数项及对引入虚拟阻抗后的电压跌落进行补偿,实现了下垂系数随功率变化的自适应调节,能有效提高并联逆变器所带负载突变时系统动态性能,具备较好负载均分能力。仿真与实验验证了所提方法的有效性。

基于反馈控制的多逆变电源并联系统

为了实现可靠的多逆变电源并联系统,提出了基于优先级与抢占方式的控制方法,通过硬件逻辑电路、总线技术与无冲突令牌环协议实现了并联冗余技术;提出了一种基于反馈控制的改进型逆变电源并联负载均分控制策略,通过检测并联系统中的瞬时平均电流和各逆变模块中的输出电流,并对这2个电流进行分解,用其分解量进行反馈调节控制输出电压,实现并联系统的均流。仿真实验与实际系统实验证明所提方法能实现多台逆变电源并联系统的稳定可靠运行及负载的均匀分配,同时具有较好的负载适应性,在各种情况下,各逆变电源的输出电流差小于额定电流的2%。

语音指挥调度系统的设计与实现

指挥调度系统是试验任务组织指挥的专用通信设备。本文介绍一种新型的语音指挥调度系统的设计思想,从设计和实现的角度讨论了系统的组成、功能及工作原理,并分析了其实现的关键技术。

UPS逆变电源的并联控制技术综述

多模块UPS能较灵活地实现对电源系统容量的扩展,为了增加整个电源系统的可靠性,它可以组成冗余并联系统。文中对目前采用的UPS并联连接控制方式和均流控制技术进行了综述。逆变器并联的全数字化控制方案是交流电源领域的发展趋势。

共直流母线多逆变回路并联系统环流分析及其抑制

共直流母线全桥多逆变回路并联系统在容量配置灵活性、冗余可靠性及直流储能元件利用率方面具有十分明显的优势。然而,当多个逆变回路输出电压幅值或相位存在偏差时,必须考虑系统间环流问题。通过分析系统环流产生机理,得出环流与逆变电流及逆变电压之间的关系,并在此基础上提出一种基于负载电流瞬时均分的统一环流抑制策略,将负载电流均分值与输出电流实际值之间的偏差引入闭环控制,对电压指令进行调整,从而保证各逆变回路输出电压幅值及相位的一致性。最后,仿真及实验验证了所提环流抑制策略可行性与正确性。

便携设备多电池系统充放电方法研究

为了满足人们对便携式设备待机时间和满负荷工作时间的需求,部分便携式设备采用多电池供电。本文针对多电池供电的便携式设备,提出了一种高效的多电池充放电解决方案,即并联充电,负载均分,并以锂电池为例,采用凌特公司生产的LTC4412和LTC4054,设计了应用电路。

Load-balancing data distribution in publish/subscribe mode

To improve data distribution efficiency a load-balancing data distribution LBDD method is proposed in publish/subscribe mode.In the LBDD method subscribers are involved in distribution tasks and data transfers while receiving data themselves.A dissemination tree is constructed among the subscribers based on MD5 where the publisher acts as the root. The proposed method provides bucket construction target selection and path updates furthermore the property of one-way dissemination is proven.That the average out-going degree of a node is 2 is guaranteed with the proposed LBDD.The experiments on data distribution delay data distribution rate and load distribution are conducted. Experimental results show that the LBDD method aids in shaping the task load between the publisher and subscribers and outperforms the point-to-point approach.

数据中心交直流混合供电系统效率浅析

介绍了数据中心交直流混合供电系统方案产生的背景。针对目前认为交流直供承担所有负载效率最优化的观点,对交直流混合供电系统的效率进行了理论分析和试验验证,说明了交直流混合供电系统方案中系统效率的影响因素以及在现网机房中如何实现该方案的最佳效率点。作为简单的参考原则,在高压直流系统(HVDC)不休眠的情况下,在目前业界主流的产品配置下,推荐采用交流和高压直流系统(HVDC)均分负载的供电模式。

Multi-path routing algorithm in WSN using an improvedparticle swarm optimization

To slove the problems of constrained energy and unbalanced load of wireless sensor network(WSN)nodes,a multipath load balancing routing algorithm based on neighborhood subspace cooperation is proposed.The algorithm adopts the improved particle swarm optimization(PSO)algorithm,takes the shortest distance and minimum energy consumption as optimization target and divides the nodes in one-hop neighborhood near the base station area into different regions.Furthermore,the algorithm designs a fitness function to find the best node in each region as a relay node and forward the data in parallel through the different paths of the relay nodes.The simulation results show that the proposed algorithm can reduce energy consumption and average end-to-end delay,balance network load and prolong network lifetime effectively.

ANALYSIS AND DESIGN OF THE STABLE PARALLEL PACKET SWITCH

This paper analyzes the Parallel Packet Switch(PPS) architecture and studies how to guarantee its performance. Firstly a model of Stable PPS (SPPS) is proposed. The constraints of traffic scheduling algorithms, the number of switching layers and internal speedup, for both bufferless and buffered SPPS architecture, are theoretically analyzed. Based on these results, an example of designing a scalable SPPS with 1.28T capacity is presented, and practical considerations on implementing the scheduling algorithm are discussed. Simulations are carried out to investigate the validity and delay performance of the SPPS architecture.

Resource allocation for load balancing and fairness improvement in relay-assisted OFDMA cellular

A resource allocation scheme with the considerations of user fairness and load balancing is proposed in orthogonal frequency division multiple access （OFDMA）-based relay networks. The optimal resource allocation scheme is formulated mathematically to maximize the minimum achievable rate among all user equipments （UEs） for fairnegs improvement. The optimal problem has been proved to be N-P-hard and it is prohibitive to find the optimal solution for its computational complexity. Accordingly, this paper proposes a suboptimal scheme which considers not only user fairness but also load balancing among base stations （BS） and relay stations （RSs） during resource allocation procedure. The suboptimal scheme takes the traffic load of access nodes （BS and RSs） into consideration to balance the system traffic load, which would prevent them from overloading and throughput degradation. Simulation results show that the suboptimal scheme performs similarly to the optimal solution and can enhance the system fairness and load balancing performance significantly compared with the traditional schemes.

Fog Computing Dynamic Load Balancing Mechanism Based on Graph Repartitioning

Because of cloud computing's high degree of polymerization calculation mode, it can't give full play to the resources of the edge device such as computing, storage, etc. Fog computing can improve the resource utilization efficiency of the edge device, and solve the problem about service computing of the delay-sensitive applications. This paper researches on the framework of the fog computing, and adopts Cloud Atomization Technology to turn physical nodes in different levels into virtual machine nodes. On this basis, this paper uses the graph partitioning theory to build the fog computing's load balancing algorithm based on dynamic graph partitioning. The simulation results show that the framework of the fog computing after Cloud Atomization can build the system network flexibly, and dynamic load balancing mechanism can effectively configure system resources as well as reducing the consumption of node migration brought by system changes.

Numerical and Experimental Investigation of an Elliptical Paraboloid Shell Model

For practical engineering purpose, a new flat shell element baptized （ACM_Q4SBE1） is presented in this paper. The formulated element can be used for the analysis of thin shell structures; no matter how the geometrical shape might be. Tests on standard problems have been examined. Since, the analysis of thin shell structures has generally been purely carried out on a theoretical basis; it is of importance to present some experimental results of an elliptical paraboloid under uniformly distributed load pressure. The results obtained from both numerical and experimental work are presented.

Strong stability of Nash equilibria in load balancing games

We study strong stability of Nash equilibria in load balancing games of m(m 2)identical servers,in which every job chooses one of the m servers and each job wishes to minimize its cost,given by the workload of the server it chooses.A Nash equilibrium(NE)is a strategy profile that is resilient to unilateral deviations.Finding an NE in such a game is simple.However,an NE assignment is not stable against coordinated deviations of several jobs,while a strong Nash equilibrium(SNE)is.We study how well an NE approximates an SNE.Given any job assignment in a load balancing game,the improvement ratio(IR)of a deviation of a job is defined as the ratio between the pre-and post-deviation costs.An NE is said to be aρ-approximate SNE(ρ1)if there is no coalition of jobs such that each job of the coalition will have an IR more thanρfrom coordinated deviations of the coalition.While it is already known that NEs are the same as SNEs in the 2-server load balancing game,we prove that,in the m-server load balancing game for any given m 3,any NE is a(5/4)-approximate SNE,which together with the lower bound already established in the literature yields a tight approximation bound.This closes the final gap in the literature on the study of approximation of general NEs to SNEs in load balancing games.To establish our upper bound,we make a novel use of a graph-theoretic tool.