883 resultados para Robust power allocation algorithm
Resumo:
In Wireless Sensor Networks (WSN), neglecting the effects of varying channel quality can lead to an unnecessary wastage of precious battery resources and in turn can result in the rapid depletion of sensor energy and the partitioning of the network. Fairness is a critical issue when accessing a shared wireless channel and fair scheduling must be employed to provide the proper flow of information in a WSN. In this paper, we develop a channel adaptive MAC protocol with a traffic-aware dynamic power management algorithm for efficient packet scheduling and queuing in a sensor network, with time varying characteristics of the wireless channel also taken into consideration. The proposed protocol calculates a combined weight value based on the channel state and link quality. Then transmission is allowed only for those nodes with weights greater than a minimum quality threshold and nodes attempting to access the wireless medium with a low weight will be allowed to transmit only when their weight becomes high. This results in many poor quality nodes being deprived of transmission for a considerable amount of time. To avoid the buffer overflow and to achieve fairness for the poor quality nodes, we design a Load prediction algorithm. We also design a traffic aware dynamic power management scheme to minimize the energy consumption by continuously turning off the radio interface of all the unnecessary nodes that are not included in the routing path. By Simulation results, we show that our proposed protocol achieves a higher throughput and fairness besides reducing the delay
Resumo:
Coded OFDM is a transmission technique that is used in many practical communication systems. In a coded OFDM system, source data are coded, interleaved and multiplexed for transmission over many frequency sub-channels. In a conventional coded OFDM system, the transmission power of each subcarrier is the same regardless of the channel condition. However, some subcarrier can suffer deep fading with multi-paths and the power allocated to the faded subcarrier is likely to be wasted. In this paper, we compute the FER and BER bounds of a coded OFDM system given as convex functions for a given channel coder, inter-leaver and channel response. The power optimization is shown to be a convex optimization problem that can be solved numerically with great efficiency. With the proposed power optimization scheme, near-optimum power allocation for a given coded OFDM system and channel response to minimize FER or BER under a constant transmission power constraint is obtained
Resumo:
En este trabajo se implementa una metodología para incluir momentos de orden superior en la selección de portafolios, haciendo uso de la Distribución Hiperbólica Generalizada, para posteriormente hacer un análisis comparativo frente al modelo de Markowitz.
Resumo:
In this paper, a multi-objective approach for observing the performance of distribution systems with embedded generators in the steady state, based on heuristic and power system analysis, is proposed. The proposed hybrid performance index describes the quality of the operating state in each considered distribution network configuration. In order to represent the system state, the loss allocation in the distribution systems, based on the Z-bus loss allocation method and compensation-based power flow algorithm, is determined. Also, an investigation of the impact of the integration of embedded generators on the overall performance of the distribution systems in the steady state, is performed. Results obtained from several case studies are presented and discussed. Copyright (C) 2004 John Wiley Sons, Ltd.
Resumo:
The problems of wave propagation and power flow in the distribution network composed of an overhead wire parallel to the surface of the ground have not been satisfactorily solved. While a complete solution of the actual problem is impossible, as it is explained in the famous Carson's paper (1926), the solution of the problem, where the actual earth is replaced by a plane homogenous semi-infinite solid, is of considerable interest. In this paper, a power flow algorithm in distribution networks with earth return, based on backward-forward technique, is discussed. In this novel use of the technique, the ground is explicitly represented. In addition, an iterative method for determining impedance for modelling ground effect in the extended power flow algorithm is suggested. Results obtained from single-wire and three-wire studies using IEEE test networks are presented and discussed. (C) 2003 Elsevier Ltd. All rights reserved.
Resumo:
The neutral wire in most power flow software is usually merged into phase wires using Kron's reduction. Since the neutral wire and the ground are not explicitly represented, neutral wire and ground currents and voltages remain unknown. In some applications, like power quality and safety analyses, loss analysis, etc., knowing the neutral wire and ground currents and voltages could be of special interest. In this paper, a general power flow algorithm for three-phase four-wire radial distribution networks, considering neutral grounding, based on backward-forward technique, is proposed. In this novel use of the technique, both the neutral wire and ground are explicitly represented. A problem of three-phase distribution system with earth return, as a special case of a four-wire network, is also elucidated. Results obtained from several case studies using medium- and low-voltage test feeders with unbalanced load, are presented and discussed.
Resumo:
Three-phase three-wire power flow algorithms, as any tool for power systems analysis, require reliable impedances and models in order to obtain accurate results. Kron's reduction procedure, which embeds neutral wire influence into phase wires, has shown good results when three-phase three-wire power flow algorithms based on current summation method were used. However, Kron's reduction can harm reliabilities of some algorithms whose iterative processes need loss calculation (power summation method). In this work, three three-phase three-wire power flow algorithms based on power summation method, will be compared with a three-phase four-wire approach based on backward-forward technique and current summation. Two four-wire unbalanced medium-voltage distribution networks will be analyzed and results will be presented and discussed. © 2004 IEEE.
Resumo:
Unbalance and harmonics are two major distortions in the three-phase distribution systems. In this paper an investigation into unbalance phenomena in the distribution networks using instantaneous space vector theory, is presented. Power oscillation index (POI) and effective power factor (PFe) are calculated in the network nodes for several unbalance loading conditions. For system analysis a general power flow algorithm for three-phase four-wire radial distribution networks, based on backward-forward technique, is applied. Results obtained from several case studies using medium and low voltage test feeder with unbalanced load, are presented and discussed. © 2010 Praise Worthy Prize S.r.l. - All rights reserved.
Resumo:
Distributed Generators (DG) are generally modeled as PQ or PV buses in power flow studies. But in order to integrate DG units into the distribution systems and control the reactive power injection it is necessary to know the operation mode and the type of connection to the system. This paper presents a single-phase and a three-phase mathematical model to integrate DG in power flow calculations in distribution systems, especially suited for Smart Grid calculations. If the DG is in PV mode, each step of the power flow algorithm calculates the reactive power injection from the DG to the system to keep the voltage in the bus in a predefined level, if the DG is in PQ mode, the power injection is considered as a negative load. The method is tested on two well known test system, presenting single-phase results on 85 bus system, and three-phase results in the IEEE 34 bus test system. © 2011 IEEE.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Este trabalho apresenta um método para encontrar um conjunto de pontos de operação, os quais são ótimos de Pareto com diversidade, para linhas digitais de assinante (DSL - digital subscriber line). Em diversos trabalhos encontrados na literatura, têm sido propostos algoritmos para otimização da transmissão de dados em linhas DSL, que fornecem como resultado apenas um ponto de operação para os modems. Esses trabalhos utilizam, em geral, algoritmos de balanceamento de espectro para resolver um problema de alocação de potência, o que difere da abordagem apresentada neste trabalho. O método proposto, chamado de diverseSB , utiliza um processo híbrido composto de um algoritmo evolucionário multiobjetivo (MOEA - multi-objective evolutionary algorithm), mais precisamente, um algoritmo genético com ordenamento por não-dominância (NSGA-II - Non-Dominated Sorting Genetic Algorithm II), e usando ainda, um algoritmo de balanceamento de espectro. Os resultados obtidos por simulações mostram que, para uma dada diversidade, o custo computacional para determinar os pontos de operação com diversidade usando o algoritmo diverseSB proposto é muito menor que métodos de busca de “força bruta”. No método proposto, o NSGA-II executa chamadas ao algoritmo de balanceamento de espectro adotado, por isso, diversos testes envolvendo o mesmo número de chamadas ao algoritmo foram realizadas com o método diverseSB proposto e o método de busca por força bruta, onde os resultados obtidos pelo método diverseSB proposto foram bem superiores do que os resultados do método de busca por força bruta. Por exemplo, o método de força bruta realizando 1600 chamadas ao algoritmo de balanceamento de espectro, obtém um conjunto de pontos de operação com diversidade semelhante ao do método diverseSB proposto com 535 chamadas.
Singular value analyses of voltage stability on power system considering wind generation variability
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
This Ph.D. dissertation reports on the work performed at the Wireless Communication Laboratory - University of Bologna and National Research Council - as well as, for six months, at the Fraunhofer Institute for Integrated Circuit (IIS) in Nürnberg. The work of this thesis is in the area of wireless communications, especially with regards to cooperative communications aspects in narrow-band and ultra-wideband systems, cooperative links characterization, network geometry, power allocation techniques,and synchronization between nodes. The underpinning of this work is devoted to developing a general framework for design and analysis of wireless cooperative communication systems, which depends on propagation environment, transmission technique, diversity method, power allocation for various scenarios and relay positions. The optimal power allocation for minimizing the bit error probability at the destination is derived. In addition, a syncronization algorithm for master-slave communications is proposed with the aim of jointly compensate the clock drift and offset of wireless nodes composing the network.
Resumo:
In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user requests the content of one of the available sources. We propose a novel distributed algorithm where network users determine the coding operations and the packet rates to be requested from the parent nodes, such that the decoding delay is minimized for all clients. A rate allocation problem is solved by every user, which seeks the rates that minimize the average decoding delay for its children and for itself. Since this optimization problem is a priori non-convex, we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every user needs to collect for decoding. We then decompose our original rate allocation problem into a set of convex subproblems, which are eventually combined to obtain an effective approximate solution to the delay minimization problem. The results demonstrate that the proposed scheme eliminates the bottlenecks and reduces the decoding delay experienced by users with limited bandwidth resources. We validate the performance of our distributed rate allocation algorithm in different video streaming scenarios using the NS-3 network simulator. We show that our system is able to take benefit of inter-session network coding for simultaneous delivery of video sessions in networks with path diversity.
Resumo:
HELLO protocol or neighborhood discovery is essential in wireless ad hoc networks. It makes the rules for nodes to claim their existence/aliveness. In the presence of node mobility, no fix optimal HELLO frequency and optimal transmission range exist to maintain accurate neighborhood tables while reducing the energy consumption and bandwidth occupation. Thus a Turnover based Frequency and transmission Power Adaptation algorithm (TFPA) is presented in this paper. The method enables nodes in mobile networks to dynamically adjust both their HELLO frequency and transmission range depending on the relative speed. In TFPA, each node monitors its neighborhood table to count new neighbors and calculate the turnover ratio. The relationship between relative speed and turnover ratio is formulated and optimal transmission range is derived according to battery consumption model to minimize the overall transmission energy. By taking advantage of the theoretical analysis, the HELLO frequency is adapted dynamically in conjunction with the transmission range to maintain accurate neighborhood table and to allow important energy savings. The algorithm is simulated and compared to other state-of-the-art algorithms. The experimental results demonstrate that the TFPA algorithm obtains high neighborhood accuracy with low HELLO frequency (at least 11% average reduction) and with the lowest energy consumption. Besides, the TFPA algorithm does not require any additional GPS-like device to estimate the relative speed for each node, hence the hardware cost is reduced.