An effective VAR planning to improve dynamic voltage profile of distribution networks with distributed wind generation

This paper proposes an effective VAR planning based on reactive power margin for the enhancement of dynamic voltage stability in distribution networks with distributed wind generation. The analysis is carried over a distribution test system representative of the Kumamoto area in Japan. The detailed mathematical modeling of the system is also presented. Firstly, this paper provides simulation results showing the effects of composite load on voltage dynamics in the distribution network through an accurate time-domain analysis. Then, a cost-effective combination of shunt capacitor bank and distribution static synchronous compensator (D-STATCOM) is selected to ensure fast voltage recovery after a sudden disturbance. The analysis shows that the proposed approach can reduce the size of compensating devices, which in turn, reduces the cost. It also reduces power loss of the system.

Small-signal stability assessment of active distribution networks with dynamic loads

This paper investigates small-signal stability of a distribution system with distributed generator and induction motor load, as a dynamic element. The analysis is carried out over a distribution test system with different types of induction motor loads. The system is linearised by the perturbation method. Eigenvalues and participation factors are calculated to see the modal interaction of the system. The study indicates that load voltage dynamics significantly influence the damping of a newly identified voltage mode. This mode has frequency of oscillation between the electromechanical and subsynchronous oscillation of power systems. To justify the validity of the modal analysis time domain simulation is also carried out. Finally, significant parameters of the system that affect the damping and frequency of the oscillation are identified.

Dynamic load variation and stability analysis in distribution networks with distributed generators

In this paper, the modeling of the distribution network is done in a different way where the distributed generator and dynamic loads are considered. Based on this modeling, this paper presents an analysis to investigate the dynamic and static load variation effect on the distribution network. Graphical interface industry software is used to conduct all the aspects of model implementation and carry out the extensive simulation studies. Here also focuses on the worst case scenario and the different fault effect on the generator. Finally, this paper presents the voltage profile for different penetration with different network configurations.

Impact of SCIG and DFIG type wind turbine on the stability of distribution networks: Static and dynamic aspects

This paper presents potential barriers to integrate the squirrel cage induction generator (SCIG) and doubly fed induction generator (DFIG) type wind turbine in distribution networks. The analysis is carried out over a 16 bus distribution test system. Both static and dynamic analyses are performed to see the impact of two different generators on the distribution system. The simulation results show that both SCIG and DFIG type wind turbines have significant impact on the static voltage stability, power loss, and dynamic behavior of the system, which should be taken into account to improve systems performance before integrating wind generation in existing distribution networks.

Target coverage in camera networks for manufacturing workplaces

In this paper, we investigate the camera network placement problem for target coverage in manufacturing workplaces. The problem is formulated to find the minimum number of cameras of different types and their best configurations to maximise the coverage of the monitored workplace such that the given set of target points of interest are each k-covered with a predefined minimum spatial resolution. Since the problem is NP-complete, and even NP-hard to approximate, a novel method based on Simulated Annealing is presented to solve the optimisation problem. A new neighbourhood generation function is proposed to handle the discrete nature of the problem. The visual coverage is modelled using realistic and coherent assumptions of camera intrinsic and extrinsic parameters making it suitable for many real world camera based applications. Task-specific quality of coverage measure is proposed to assist selecting the best among the set of camera network placements with equal coverage. A 3D CAD of the monitored space is used to examine physical occlusions of target points. The results show the accuracy, efficiency and scalability of the presented solution method; which can be applied effectively in the design of practical camera networks.

Ionic conductivity and molecular dynamic behavior in supramolecular ionic networks; the effect of lithium salt addition

Supramolecular ionic networks combine singular properties such as self-healing behaviour and ionic conductivity. In this work we present an insight into the ionic conductivity and molecular dynamic behaviour of an amorphous and semicrystalline supramolecular ionic networks (iNets) that were synthesised by self-assembly of difunctional imidazolium dicationic molecules coupled with (trifluoromethane-sulfonyl) imide dianionic molecules. Relatively low ionic conductivity values were obtained for the semicrystalline iNet below its melting point (Tm =101°C) in comparison with the amorphous iNet for which the conductivity significantly increased (~3 orders of magnitude) above 100°C. Upon LiTFSI doping, the semicrystalline iNet reached conductivity values ~ 10-3 Scm-1 due to enhanced mobility of the network which was supported by solid-state static NMR. Furthermore, the overlapping of 19F and 7Li resonance lines from both the semicrystalline network and the LiTFSI suggests fast molecular motions.

Managing dynamic public sector networks : effectiveness, performance, and a methodological framework in the field of national security

Networks are increasing in number and in importance across the security field as a means of providing inter-agency coordination. Based on a large qualitative study of networks in the field of national security in Australia, this article aims to advance our knowledge of the internal properties of public sector networks in the field of national security and the conditions shaping their performance. It puts forward a multi-level theoretical framework involving five interdependent levels of analysis—structural, cultural, policy, technological, and relational—which aims to account for the internal properties of networks and examines each of these levels in relation to public sector networks in the field of national security. Using detailed interviews with senior members of security, law enforcement, and intelligence agencies, the article aims to highlight the potential lessons this framework has for strategically organizing and managing dynamic networks within and beyond the field of national security.

Distributed multi-agent scheme to improve dynamic voltage stability of distribution networks

In this paper, a distributed multi-agent scheme is presented for reactive power management with renewable energy sources (RESs). The multi-agent system (MAS) framework is developed for distribution systems to improve the stability which is mostly dominated by voltage and the agents in this framework coordinate among themselves using online information and energy flow. In this paper, the agents basically perform two tasks- reactive power estimation and necessary control actions. The topology of distribution network is used to estimate the required reactive power for maintaining voltage stability where distributed static synchronous compensators (DSTATCOMs) are used to supply this reactive power. The DSTATCOM is controlled by using a linear quadratic regulator (LQR) controller within the agent framework. The proposed scheme is further compared with the conventional approach to validate the simulation results.

Modeling and analysis of artificial neural networks applied in operations research

Artificial neural networks are dynamic systems consisting of highly interconnected and parallel nonlinear processing elements. Systems based on artificial neural networks have high computational rates due to the use of a massive number of these computational elements. Neural networks with feedback connections provide a computing model capable of solving a rich class of optimization problems. In this paper, a modified Hopfield network is developed for solving problems related to operations research. The internal parameters of the network are obtained using the valid-subspace technique. Simulated examples are presented as an illustration of the proposed approach. Copyright (C) 2000 IFAC.

Using artificial neural networks for identification of electrical losses in transformers during the manufacturing phase

The paper describes a novel neural model to estimate electrical losses in transformer during the manufacturing phase. The network acts as an identifier of structural features on electrical loss process, so that output parameters can be estimated and generalized from an input parameter set. The model was trained and assessed through experimental data taking into account core losses, copper losses, resistance, current and temperature. The results obtained in the simulations have shown that the developed technique can be used as an alternative tool to make the analysis of electrical losses on distribution transformer more appropriate regarding to manufacturing process. Thus, this research has led to an improvement on the rational use of energy.

Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Dynamic Routing in Translucent WDM Optical Networks: The Intradomain Case

Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks

Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In this study, we propose an approach to support dynamic lightpath scheduling in such networks. To minimize blocking probability in a network that accommodates dynamic scheduled lightpath demands (DSLDs), resource allocation should be optimized in a dynamic manner. However, for the network users who desire deterministic services, resources must be reserved in advance and guaranteed for future use. These two objectives may be mutually incompatible. Therefore, we propose a two-phase dynamic lightpath scheduling approach to tackle this issue. The first phase is the deterministic lightpath scheduling phase. When a lightpath request arrives, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with the deterministic lightpath schedule. The second phase is the lightpath re-optimization phase, in which the network control plane re-provisions some already scheduled lightpaths. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce WDM network blocking.