Search NASA⌕ Search

SEARCH · Search NASA

Results for “synchronization stability”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Enhanced Synchronization Stability of Grid-Forming Inverters With Passivity-Based Virtual Oscillator Control

In this article, a passivity-based virtual oscillator control strategy with enhanced synchronization stability for grid-forming inverters (GFMs) is proposed. By adopting the port-controlled Hamiltonian system theory for orbital stabilization problems, an energy pumping-and-damping block is proposed to render GFMs globally asymptotically stable with respect to the prespecified solutions of the power-flow equations from any initial condition. This allows for stable integrations of GFMs to any other globally asymptotically stable systems without their explicit knowledge, e.g., helping maintain synchronism with the bulk power system in a wide range of short-circuit-ratio conditions or under large disturbances and keeping synchronism among multiple GFMs in power systems. Herein, both simulations and experiments are presented to demonstrate the proposed control approach.

42 ENGINEERING↗
NASA NTRS2011

A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

This paper presents a self-stabilizing distributed clock synchronization protocol in the absence of faults in the system. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. We present an outline of a deductive proof of the correctness of the protocol. A bounded model of the protocol was mechanically verified for a variety of topologies. Results of the mechanical proof of the correctness of the protocol are provided. The model checking results have verified the correctness of the protocol as they apply to the networks with unidirectional and bidirectional links. In addition, the results confirm the claims of determinism and linear convergence. As a result, we conjecture that the protocol solves the general case of this problem. We also present several variations of the protocol and discuss that this synchronization protocol is indeed an emergent system.

Malekpour, Mahyar R.↗
NASA NTRS2012

Model Checking A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV) for a subset of digraphs. Modeling challenges of the protocol and the system are addressed. The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period.

Malekpour, Mahyar R.↗
NASA NTRS2006

Comments on the "Byzantine Self-Stabilizing Pulse Synchronization" Protocol: Counter-examples

Embedded distributed systems have become an integral part of many safety-critical applications. There have been many attempts to solve the self-stabilization problem of clocks across a distributed system. An analysis of one such protocol called the Byzantine Self-Stabilizing Pulse Synchronization (BSS-Pulse-Synch) protocol from a paper entitled "Linear Time Byzantine Self-Stabilizing Clock Synchronization" by Daliot, et al., is presented in this report. This report also includes a discussion of the complexity and pitfalls of designing self-stabilizing protocols and provides counter-examples for the claims of the above protocol.

Malekpour, Mahyar R.↗
DOE OSTI2023

Transient Stability Preventive Control via Tuning the Parameters of Virtual Synchronous Generators

This paper presents an optimal preventive control (OPC) method to improve the power system transient stability via tuning the transient parameter of virtual synchronous generators. The novelty of this work is that we formulate the preventive control as an optimization problem so that inverter parameters can be adjusted at the pre-contingency stage. A reinforcement learning (RL)-driven method is proposed to solve the OPC problem with the fault energy-based reward function. An ANDES-based RL environment is also developed. Versatile functions included in the proposed environment have been presented in this paper. The proposed OPC formulation, the RLdriven method, and the fault energy-based reward function are verified on several standard test systems.

Inverter-based resources, virtual synchronous gene↗
DOE OSTI2023

Testing GFM and GFL Inverters Operating With Synchronous Condensers

Inverter-based resources (IBRs) are quickly evolving into a source of reliability services to the electric grid. Penetration levels of variable generation are rapidly increasing, ranging from 60% -70% in some systems. To go further, a fundamental shift is required to address challenges associated with grid stability. Synchronous condensers (SCs) are considered an important complementary technology in such transitions. This paper provides one-of-a-kind insights into real experimental results from operating a real MW-scale system consisting of a 2.2-MVA grid-forming (GFM) and grid-following (GFL) battery energy storage system, 2.5-MVA SCs, and a 3-MVA load bank operating as a small, islanded grid. Challenges that are expected in larger systems were mimicked in this small but real system to demonstrate seamless transitions from one mode to another as well as stable operation with different combinations of GFM and GFM resources, including a "loss of last synchronous generator" case. The experimental results presented in this paper are a valuable resource to everyone involved in developing and validating models or developing controls of power systems consisting of inverters and synchronous condensers.

grid-following converter↗
NASA NTRS2011

A Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

This report presents a self-stabilizing distributed clock synchronization protocol in the absence of faults in the system. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. We present an outline of a deductive proof of the correctness of the protocol. A model of the protocol was mechanically verified using the Symbolic Model Verifier (SMV) for a variety of topologies. Results of the mechanical proof of the correctness of the protocol are provided. The model checking results have verified the correctness of the protocol as they apply to the networks with unidirectional and bidirectional links. In addition, the results confirm the claims of determinism and linear convergence. As a result, we conjecture that the protocol solves the general case of this problem. We also present several variations of the protocol and discuss that this synchronization protocol is indeed an emergent system.

Malekpour, Mahyar R.↗
NASA NTRS2014

Fault-Tolerant Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

A self-stabilizing network in the form of an arbitrary, non-partitioned digraph includes K nodes having a synchronizer executing a protocol. K-1 monitors of each node may receive a Sync message transmitted from a directly connected node. When the Sync message is received, the logical clock value for the receiving node is set to between 0 and a communication latency value (gamma) if the clock value is less than a minimum event-response delay (D). A new Sync message is also transmitted to any directly connected nodes if the clock value is greater than or equal to both D and a graph threshold (T(sub S)). When the Sync message is not received the synchronizer increments the clock value if the clock value is less than a resynchronization period (P), and resets the clock value and transmits a new Sync message to all directly connected nodes when the clock value equals or exceeds P.

Malekpour, Mahyar R.↗
NASA NTRS2011

Model Checking a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.

Malekpour, Mahyar R.↗
NASA NTRS2011

Correctness Proof of a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

This report presents a deductive proof of a self-stabilizing distributed clock synchronization protocol. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. We present a deductive proof of the correctness of the protocol as it applies to the networks with unidirectional and bidirectional links. We also confirm the claims of determinism and linear convergence.

Malekpour, Mahyar R.↗
NASA NTRS1973

Nonlinear analysis of phased-locked loops with rapidly varying phase

The performance of command and telemetry systems, useful in deep-space communications, is frequently affected by the radio-frequency phase error which is introduced at the point of reception by means of the carrier tracking loop. In low data rate communications, this phase error may vary rapidly over the duration of the signaling interval. In this paper such phase variation is characterized by a sinusoidal input phase, K sin (omega sub o t+, pi/6), which models a typical phase variation in communication over turbulent media. Conditions for synchronization stability and the acquisition behavior are examined by detailed computer study of the phase-plane trajectories for the second and third-order loops with perfect integrator. It is demonstrated that for the phase variation considered the third-order loop has no real advantage over the second-order loop. Finally, it is shown that nonzero initial conditions may result in large steady-state phase error.

Chen, C.↗
NASA NTRS1976

Thermal control of the International Ultraviolet Explorer

The International Ultraviolet Explorer (IUE) is a large astronomical observatory scheduled to be placed in a three-axis stabilized synchronous orbit in the fourth quarter of 1977. The thermal control system consists of multilayer insulation, ammonia-filled grooved heat pipes, bimetallic actuated louvers, and assorted commandable heaters. The spacecraft must operate over a 135-deg solar aspect range and must be able to survive an 85-min.-zero power eclipse. It has a design lifetime of three years. To verify the thermal design, an Engineering Test Unit (ETU) was subjected to a thermal balance test in the Solar Environment Simulator (SES) at the Goddard Space Flight Center (GSFC). Heater skins were utilized to simulate four solar aspect angles, and various internal power settings were used to simulate different operational cases. Temperatures obtained corresponded within 5C of predicted values, thus verifying the thermal analytical model. In addition, two 85-min.-eclipse periods were successfully completed verifying that the thermal design of the IUE was adequate for this mission requirement.

Skladany, J. T.↗