无线蜂窝系统功率控制算法

A novel distributed power control algorithm based on interference estimation is presented for wireless cellular system. A classical result of stochastic approximation is applied in this scheme. The power control algorithm is converted to seeking for the zero point problem of a certain function. In this distributed power algorithm, each user iteratively updates its power level by estimating the interference. It does not require any knowledge of the channel gains or state information of other users. Hence, the proposed algorithm is robust. It is proved that the algorithm converges to the optimal solution by stochastic approximation approach.     

Power Control Algorithm for Wireless Cellular System

A novel distributed power control algorithm based on interference estimation is presented for wireless cellular system. A classical result of stochastic approximation is applied in this scheme. The power control algorithm is converted to seeking for the zero point problem of a certain function. In this distributed power algorithm, each user iteratively updates its power level by estimating the interference. It does not require any knowledge of the channel gains or state information of other users. Hence, the proposed algorithm is robust. It is proved that the algorithm converges to the optimal solution by stochastic approximation approach.     

Uplink resource allocation in OFDMA system using distributed antennas

In this article, we investigate uplink resource allocation in orthogonal frequency division multiple access （OFDMA） systems that use distributed antennas. The multiple distributed receiving antennas motivate us to exploit the spatial diversity to maximize the achievable rate of the system. Given constraints on the subcarrier allocation and the power limit of each user equipment （UE）, a mixed-integer optimization problem is formulated. We first propose a centralized greedy algorithm to find the maximum achievable rate of the system. Then a heuristic algorithm is proposed that can be implemented in a distributed manner. Simulation results show that the heuristic algorithm can approximately achieve the maximum achievable rate of the system and result in significant system performance improvement over the approach assigning one user to each subcarrier.     

Second Attribute Algorithm Based on Tree Expression

One view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements. Thus the problem of finding personalized solutions can be transformed into computing the reduct on an attribute order. The second attribute theorem describes the relationship between the set of attribute orders and the set of reducts, and can be used to transform the problem of searching solutions to meet user requirements into the problem of modifying reduct based on a given attribute order. An algorithm is implied based on the second attribute theorem, with computation on the discernibility matrix. Its time complexity is O（n^2 × m） （n is the number of the objects and m the number of the attributes of an information system）. This paper presents another effective second attribute algorithm for facilitating the use of the second attribute theorem, with computation on the tree expression of an information system. The time complexity of the new algorithm is linear in n. This algorithm is proved to be equivalent to the algorithm on the discernibility matrix.     

A distributed algorithm for multi-region problem in BEM

The situation of multi-region problem may oftem appear when boundary element method(BEM)is applied in practical problems especially in VLSI-CAD.It is difficult to deal with this problem if traditional methods are used.Particularly. when the problem to be solved contains a lot of materials,the advantages of using BEM such as simplicity,convenience and rapidity will be weakened due to the complexity of solving complex boundary element equation.In this paper a distributed algorithm for multi-region problem in BEM is presented.This algorithm has been implemented in a distributed system consisting of 3 workstations to extract VLSI layout parameters.The results show that the calculation time of this distributed algorithm is less than that of the traditional methods.The results also demonstrate that this algorithm can speed up the computation and has the features of parallelism and high efficiency.     

A learning particle swarm optimization algorithm for odor source localization

This paper is concerned with the problem of odor source localization using multi-robot system. A learning particle swarm optimization algorithm, which can coordinate a multi-robot system to locate the odor source, is proposed. First, in order to develop the proposed algorithm, a source probability map for a robot is built and updated by using concentration magnitude information, wind information, and swarm information. Based on the source probability map, the new position of the robot can be generated. Second, a distributed coordination architecture, by which the proposed algorithm can run on the multi-robot system, is designed. Specifically, the proposed algorithm is used on the group level to generate a new position for the robot. A consensus algorithm is then adopted on the robot level in order to control the robot to move from the current position to the new position. Finally, the effectiveness of the proposed algorithm is illustrated for the odor source localization problem.     

Analysis,design,and experimental evaluation of power calculation in digital droop-controlled parallel microgrid inverters

Parallel operation of distributed generation is an important topic for microgrids,which can provide a highly reliable electric supply service and good power quality to end customers when the utility is unavailable.However,there is a well-known limitation:the power sharing accuracy between distributed generators in a parallel operation.Frequency and voltage droop is a well-established control method for improving power sharing performance.In this method,the active and reactive power calculations are used to adjust the frequency and amplitude of the output voltage.This paper describes the digital implementation of a droop method,and analyzes the influence of power calculation on droop method performance.According to the analysis,the performance of droop control in a digital control system is limited by the accuracy and speed of the power calculation method.We propose an improved power calculation method based on p-q theory to improve the performance of the droop control method,and we compare our new method with two traditional power calculation methods.Finally,simulation results and experimental results from a three single-phase 1-kW-inverter system are presented,which validate the performance of our proposed method.     

Approximate K-Median of Location Streams with Redundancy and Inconsistency

Data streams produced by positioning systems such as Global Positioning System (GPS) or RFID readers can be considered as location streams[12]. Location streams are usually generated in a distributed fashion by a large scale distributed system covering a wide range of areas. Computing on distributed location streams is both practically useful and theoretically challenging. The results of computation could be used to schedule the traffic in a metropolis to avoid traffic jam, dispatch taxis to serve the passengers more quickly and display the current position of goods in supply chain management, etc. Since location streams are usually generated with very high rate in uncertain ways over hostile environments, the collected updates of location are probably redundant and inconsistent in a wide positioning system. To process distributed location streams with redundancy and inconsistency, this paper proposes a novel method based on min-wise hash. With this method, redundant updates of distributed location streams can be effiectively filtered out, while the true location could be derived from inconsistent ones. Consequently, globally uniform samples can be obtained. Based on the uniform samples, an algorithm for computing the approximate k-median of huge number of moving objects is presented in this paper. Furthermore, it is demonstrated that sketch-based methods are not necessarily effiective in processing location streams with redundancy and inconsistency. In addition to theoretical analysis, some extensive experiments are conducted to validate the efficiency and effiectiveness of the proposed approach.     

esign of power controller in CDMA system with power and SIR error minimization

In this paper, an uplink power control problem is considered for code division multiple access （CDMA） systems. A distributed algorithm is proposed based on linear quadratic optimal control theory. The proposed scheme minimizes the sum of the power and the error of signal-to-interference ratio （SIR）. A power controller is designed by constructing an optimization problem of a stochastic linear quadratic type in Krein space and solving a Kalman filter problem.     

Design of power controller in CDMA system with power and SIR error minimization

In this paper, an uplink power control problem is considered for code division multiple access (CDMA) systems. A distributed algorithm is proposed based on linear quadratic optimal control theory. The proposed scheme minimizes the sum of the power and the error of signal-to-interference ratio (SIR). A power controller is designed by constructing an optimization problem of a stochastic linear quadratic type in Krein space and solving a Kalman filter problem.     

A scalable approach to solving dense linear algebra problems on hybrid CPU‐GPU systems

Aiming to fully exploit the computing power of all CPUs and all graphics processing units (GPUs) on hybrid CPU‐GPU systems to solve dense linear algebra problems, we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, and to accommodate the heterogeneity between CPUs and GPUs. The new heterogeneous tile algorithms are executed upon our decentralized dynamic scheduling runtime system, which schedules a task graph dynamically and transfers data between compute nodes automatically. The runtime system uses a new distributed task assignment protocol to solve data dependencies between tasks without any coordination between processing units. By overlapping computation and communication through dynamic scheduling, we are able to attain scalable performance for the double‐precision Cholesky factorization and QR factorization. Our approach demonstrates a performance comparable to Intel MKL on shared‐memory multicore systems and better performance than both vendor (e.g., Intel MKL) and open source libraries (e.g., StarPU) in the following three environments: heterogeneous clusters with GPUs, conventional clusters without GPUs, and shared‐memory systems with multiple GPUs. Copyright © 2014 John Wiley & Sons, Ltd.     

Performance estimation for real-time distributed embedded systems

Many embedded computing systems are distributed systems: communicating processes executing on several CPUs/ASICs. This paper describes a performance analysis algorithm for a set of tasks executing on a heterogeneous distributed system. Tight bounds are essential to the synthesis and verification of application-specific distributed systems, such as embedded computing systems. Our bounding algorithms are valid for a general problem model: The system can contain several tasks with hard real-time deadlines and different periods; each task is partitioned into a set of processes related by data dependencies. The periods of tasks and the computation times of processes are not necessarily constant and can be specified by a lower bound and an upper bound. Such a model requires a more sophisticated algorithm, but leads to more accurate results than previous work. Our algorithm both provides tighter bounds and is faster than previous methods     

三对角线性方程组的一种有效分布式并行算法

提出了分布式存储环境下求解三对角线性方程的一种并行算法,该算法基于“分而治之”的策略,高效地形成并求解其缩减方程组,避免不必要的冗余计算,通过对计算量的仔细估计,较好地平衡了各处理机的负载;同时,充分利用了计算与通信重叠技术,减少处理机空闲时间,分析了自救的复杂性,给 分布存储多计算机系统上的数值试验结果,数值结果表明,算法的效率较迟利华和李晓梅的ＤＰＰ算法有较大的提高。     

Solution-Domain-Decomposition Method for Heat Transfer Problem Using Parallel Distributed Computing

Solution-domain-decomposition (SDD) method is formulated for solving heat transfer problem and generalized for solving multi-domain problem. A generalized algorithm is suggested for parallel and distributing computation. Chebyshev expansion on the dependent variables is used for pseudospectral approximation of the governing equation in this study. Linear superposition principle is adapted to incorporate the interactions between the subdomains. By effective subdivision of computational domain, significant computational efficiency and computational memory savings are accomplished without losing spectral accuracy of the solution. Owing to independent characteristics of the subdomains. the scheme is well suited for multi-processor machines. Convergence study reveals that spectra! accuracy is still conserved for the multi-domain calculation. The calculation domain is divided up to 8 subdomains and calculation is distributed up to independent CPUs. Significant speed-up ratio is obtained by distributing the subtasks through the network.     

无线传感器网络中分布式小波压缩

无线传感器网络中传感节点的资源十分有限,为了减少无线传感器网络在数据通信时的能量消耗,提出了基于提升格式的分布式小波数据压缩算法及其简化算法.这种方法一方面把整个小波变换所需的计算量分布于各个节点之中,通过简化消除额外的计算和数据传输,而且对于每个节点来说,计算量都很小,易于实现.另一方面又能有效地消除无线传感器网络中节点内和节点间的信息冗余,大大节省了无线传输所消耗的能量.仿真结果表明,与经典的方法相比,在能耗和重构信号质量上都获得了良好的效果.     

Fast Distributed Demand Response Algorithm in Smart Grid

This paper proposes a fast distributed demand response (DR) algorithm for future smart grid based on primaldual interior method and Gaussian belief propagation (GaBP) solver. At the beginning of each time slot, each end-user/energysupplier exchanges limited rounds of messages that are not private with its neighbors, and computes the amount of energy consumption/generation locally. The proposed demand response algorithm converges rapidly to a consumption/generation decision that yields the optimal social welfare when the demands of endusers are low. When the demands are high, each end-user/energysupplier estimates its energy consumption/generation quickly such that a sub-optimal social welfare is achieved and the power system is ensured to operate within its capacity constraints. The impact of distributed computation errors on the proposed algorithm is analyzed theoretically. The simulation results show a good performance of the proposed algorithm.      

对一个分布式终止探测算法的改进

DTD(distributed termination detection)是分布式算法研究中的一个重要问题.如果不能探测计算的终止,算法就失去了其现实意义.Mattern提出的credit-recovery算法实现了消息最优,但只局限于在集中式计算中应用.对其进行了改进,使其能够应用在非集中式计算中,以更适合分布式环境.     

分布式电梯群控系统多目标调度算法

基于多代理系统(MAS)的分布式电梯群控系统将电梯及群控器映射为具有不同功能的代理(agent), 呼梯信号的分派通过各agent协商解决, 使梯群调度算法的计算工作量分散到各agent. 基于拟市场模型, 分布式群控算法主要包括较厢代理(C-agent)报价算法及呼梯信号代理(HC-agent)电梯分派算法等. 设计实现了旨在同时降低平均候梯时间、平均乘梯时间及长候梯率的多目标分布式群控算法DMO. 仿真结果表明, 基于MAS的分布式电梯群控系统是可行的, 所设计的分布式群控算法能够使平均候梯时间、平均乘梯时间及长候梯率同时得到优化.