SEARCH · Search NASA
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.
Laser propagation experiments between stabilized synchronous satellites and ground stations at visible and near-infrared wavelengths
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.
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.
No abstract available
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.
Frequency stabilized flywheel and synchronizer with magnetic core oscillator for IMP information processing system
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.
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.
Spin synchronous clock for spin-stabilized vehicles
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.
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.
Analysis of concept of spin-stabilized synchronous satellite carrying interferometer transmitting CW signals in L-band
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.
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.
The International Ultraviolet Explorer is a large astronomical observatory scheduled to be placed in a three-axis stabilized synchronous orbit in the fourth quarter of 1977. The Hydrazine Auxiliary Propulsion System (HAPS) must perform a number of spacecraft maneuvers to achieve a successful mission. This paper describes the thermal design which accomplishes temperature control between 5 and 65 C for all orbital conditions by utilizing multilayer insulation and commandable component heaters. A primary design criteria was the minimization of spacecraft power by the selective use of the solar environment. The thermal design was carefully assessed and verified in both spacecraft thermal balance and subsystem solar simulation testing.
The effect of misregistration on cloud brightness threshold is investigated by simulating radiometric data as observed from a spin stabilized synchronous satellite such as the SMS. Clouds were introduced randomly and a bidirectional reflectance model was used to create radiance data from clouds and ocean. A theoretical and an empirical reflectance model were compared.
A rapid Byzantine self-stabilizing clock synchronization protocol that self-stabilizes from any state, tolerates bursts of transient failures, and deterministically converges within a linear convergence time with respect to the self-stabilization period. Upon self-stabilization, all good clocks proceed synchronously. The Byzantine self-stabilizing clock synchronization protocol does not rely on any assumptions about the initial state of the clocks. Furthermore, there is neither a central clock nor an externally generated pulse system. The protocol converges deterministically, is scalable, and self-stabilizes in a short amount of time. The convergence time is linear with respect to the self-stabilization period.
Automatic directional-antenna position control system for ATS synchronous orbit spin- stabilized satellite