Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodes”

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 1,369 records · Page 76

Optical Circuit Switched Protocol

The present invention is a system and method embodied in an optical circuit switched protocol for the transmission of data through a network. The optical circuit switched protocol is an all-optical circuit switched network and includes novel optical switching nodes for transmitting optical data packets within a network. Each optical switching node comprises a detector for receiving the header, header detection logic for translating the header into routing information and eliminating the header, and a controller for receiving the routing information and configuring an all optical path within the node. The all optical path located within the node is solely an optical path without having electronic storage of the data and without having optical delay of the data. Since electronic storage of the header is not necessary and the initial header is eliminated by the first detector of the first switching node. multiple identical headers are sent throughout the network so that subsequent switching nodes can receive and read the header for setting up an optical data path.

Monacos, Steve P.↗

MACS, An Instrument, and a Methodology for Simulations and Global Measurements of the Coronal Electron Temperature and the Solar Wind Velocity on the Solar Corona

The determination of the radial and latitudinal temperature and wind profiles of the solar corona is of great importance in understanding the coronal heating mechanism and the dynamics of coronal expansion. Cram presented the theory for the formation of the K-coronal spectrum and identified two important observations. He observed the existence of temperature sensitive anti-nodes at certain wavelengths in the theoretical K-coronal spectra. The anti-nodes are separated by temperature-insensitive nodes. Remarkably, Cram showed that the wavelengths of the nodes and anti-nodes are almost independent of altitude above the solar limb. Because of these features, Cram suggested that the intensity ratios at two anti-nodes could be used as a diagnostic of the electron temperature in the K-corona. Based on this temperature diagnostic technique prescribed by Cram a slit-based spectroscopic study was performed by Ichimoto et al. on the solar corona in conjunction with the total solar eclipse of 3 Nov 1994 in Putre, Chile to determine the temperature profile of the solar corona. In this thesis Cram's theory has been extended to incorporate the role of the solar wind in the formation of the K-corona, and we have identified both temperature and wind sensitive intensity ratios. The instrument, MACS, for Multi Aperture Coronal Spectrometer, a fiber optic based spectrograph, was designed for global and simultaneous measurement of the thermal electron temperature and the solar wind velocity in the solar corona. The first ever experiment of this nature was conducted in conjunction with the total solar eclipse of 11 Aug 1999 in Elazig, Turkey. In this instrument one end of each of twenty fiber optic tips were positioned in the focal plane of the telescope in such a way that we could observe conditions simultaneously at many different latitudes and two different radial distances in the solar corona. The other ends of the fibers were vertically aligned and placed at the primary focus of the collimating lens of the spectrograph to obtain simultaneous and global spectra on the solar corona. By isolating the K-coronal spectrum from the spectrum recorded by each fiber the temperature and the wind sensitive intensity ratios were calculated to obtain simultaneous and global measurements of the thermal electron temperature and the solar wind velocity. We were successful in obtaining reliable estimates of the coronal temperature at many positions in the corona. This is the first time that simultaneous measurements of coronal temperatures have been obtained at so many points. However due to instrumental scattering encountered during observations, reliable estimates of the wind velocity turned out to be impossible to obtain. Although remedial measures were taken prior to observation, this task proved to be difficult owing to the inability to replicate the conditions expected during an eclipse in the laboratory. The full extent of the instrumental scattering was apparent only when we analyzed the observational sequence. Nevertheless the experience obtained from this very first attempt to simultaneously and globally measure both the wind velocity and the temperature on the solar corona have provided valuable information to conduct any future observations successfully.

Reginald, Nelson L.↗

Applications Performance Under MPL and MPI on NAS IBM SP2

On July 5, 1994, an IBM Scalable POWER parallel System (IBM SP2) with 64 nodes, was installed at the Numerical Aerodynamic Simulation (NAS) Facility Each node of NAS IBM SP2 is a "wide node" consisting of a RISC 6000/590 workstation module with a clock of 66.5 MHz which can perform four floating point operations per clock with a peak performance of 266 Mflop/s. By the end of 1994, 64 nodes of IBM SP2 will be upgraded to 160 nodes with a peak performance of 42.5 Gflop/s. An overview of the IBM SP2 hardware is presented. The basic understanding of architectural details of RS 6000/590 will help application scientists the porting, optimizing, and tuning of codes from other machines such as the CRAY C90 and the Paragon to the NAS SP2. Optimization techniques such as quad-word loading, effective utilization of two floating point units, and data cache optimization of RS 6000/590 is illustrated, with examples giving performance gains at each optimization step. The conversion of codes using Intel's message passing library NX to codes using native Message Passing Library (MPL) and the Message Passing Interface (NMI) library available on the IBM SP2 is illustrated. In particular, we will present the performance of Fast Fourier Transform (FFT) kernel from NAS Parallel Benchmarks (NPB) under MPL and MPI. We have also optimized some of Fortran BLAS 2 and BLAS 3 routines, e.g., the optimized Fortran DAXPY runs at 175 Mflop/s and optimized Fortran DGEMM runs at 230 Mflop/s per node. The performance of the NPB (Class B) on the IBM SP2 is compared with the CRAY C90, Intel Paragon, TMC CM-5E, and the CRAY T3D.

Saini, Subhash↗

Space Station Freedom Central Thermal Control System Evolution

The objective of the evolution study is to review the proposed growth scenarios for Space Station Freedom and identify the major CTCS hardware scars and software hooks required to facilitate planned growth and technology obsolescence. The Station's two leading evolutionary configurations are: (1) the Research and Development node, where the fundamental mission is scientific research and commercial endeavors, and (2) the Transportation node, where the emphasis is on supporting Lunar and Mars human exploration. These two nodes evolve from the from the assembly complete configuration by the addition of manned modules, pocket labs, resource nodes, attached payloads, customer servicing facility, and an upper and lower keel and boom truss structure. In the case of the R & D node, the role of the dual keel will be to support external payloads for scientific research. In the case of the Transportation node, the keel will support the Lunar (LTV) and Mars (MTV) transportation vehicle service facilities In addition to external payloads. The transverse boom is extended outboard of the alpha gimbal to accommodate the new solar dynamic arrays for power generation, which will supplement the photovoltaic system. The design, development, deployment, and operation of SSF will take place over a 30 year time period and new Innovations and maturation in technologies can be expected. Evolutionary planning must include the obsolescence and insertion of the new technologies over the life of the program, and the technology growth issues must be addressed in parallel with the development of the baseline thermal control system. Technologies that mature and are available within the next 10 years are best suited for evolutionary consideration as the growth phase begins in the year 2000. To increase TCS capability to accommodate growth using baseline technology would require some penalty in mass, volume, EVA time, manifesting, and operational support. To be cost effective the capabilities of the heat acquisition, transport, and rejection subsystems must be increased.

Bullock, Richard↗

Numerical Modeling of Conjugate Heat Transfer in Fluid Network

Fluid network modeling with conjugate heat transfer has many applications in Aerospace engineering. In modeling unsteady flow with heat transfer, it is important to know the variation of wall temperature in time and space to calculate heat transfer between solid to fluid. Since wall temperature is a function of flow, a coupled analysis of temperature of solid and fluid is necessary. In cryogenic applications, modeling of conjugate heat transfer is of great importance to correctly predict boil-off rate in propellant tanks and chill down of transfer lines. In TFAWS 2003, the present author delivered a paper to describe a general-purpose computer program, GFSSP (Generalized Fluid System Simulation Program). GFSSP calculates flow distribution in complex flow circuit for compressible/incompressible, with or without heat transfer or phase change in all real fluids or mixtures. The flow circuit constitutes of fluid nodes and branches. The mass, energy and specie conservation equations are solved at the nodes where as momentum conservation equations are solved at the branches. The proposed paper describes the extension of GFSSP to model conjugate heat transfer. The network also includes solid nodes and conductors in addition to fluid nodes and branches. The energy conservation equations for solid nodes solves to determine the temperatures of the solid nodes simultaneously with all conservation equations governing fluid flow. The numerical scheme accounts for conduction, convection and radiation heat transfer. The paper will also describe the applications of the code to predict chill down of cryogenic transfer line and boil-off rate of cryogenic propellant storage tank.

Majumdar, Alok↗

Construction of Protograph LDPC Codes with Linear Minimum Distance

A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very high-degree node in the base protograph. A family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

Low-density parity-check (LDPC)↗

Re-Engineering the Tropical Rainfall Measuring Mission (TRMM) Satellite Utilizing Goddard Space Flight Center (GSFC) Mission Services Center (GMSEC) Middleware Based Technology to Enable Lights Out Operations and Autonomous Re-Dump of Lost Telemetry Data

The Tropical Rainfall Measuring Mission (TRMM) spacecraft was launched in November of 1996 in order to obtain unique three dimensional radar cross sectional observations of cloud structures with particular interest in hurricanes. The TRMM mission life was recently extended with current estimates that operations will continue through the 2012-2013 timeframe. Faced with this extended mission profile, the project has embarked on a technology refresh and re-engineering effort. TRMM has recently implemented a re-engineering effort to expand a middleware based messaging architecture to enable fully redundant lights-out of flight operations activities. The middleware approach is based on the Goddard Mission Services Evolution Center (GMSEC) architecture, tools and associated open-source Applications Programming Interface (API). Middleware based messaging systems are useful in spacecraft operations and automation systems because private node based knowledge (such as that within a telemetry and command system) can be broadcast on the middleware messaging bus and hence enable collaborative decisions to be made by multiple subsystems. In this fashion, private data is made public and distributed within the local area network and multiple nodes can remain synchronized with other nodes. This concept is useful in a fully redundant architecture whereby one node is monitoring the processing of the 'prime' node so that in the event of a failure the backup node can assume operations of the prime, without loss of state knowledge. This paper will review and present the experiences, architecture, approach and lessons learned of the TRMM re-engineering effort centered on the GMSEC middleware architecture and tool suite. Relevant information will be presented that relates to the dual redundant parallel nature of the Telemetry and Command (T and C) and Front-End systems and how these systems can interact over a middleware bus to achieve autonomous operations including autonomous commanding to recover missing science data during the same spacecraft contact.

Marius, Julio L.↗

Diagnosable structured logic array

A diagnosable structured logic array and associated process is provided. A base cell structure is provided comprising a logic unit comprising a plurality of input nodes, a plurality of selection nodes, and an output node, a plurality of switches coupled to the selection nodes, where the switches comprises a plurality of input lines, a selection line and an output line, a memory cell coupled to the output node, and a test address bus and a program control bus coupled to the plurality of input lines and the selection line of the plurality of switches. A state on each of the plurality of input nodes is verifiably loaded and read from the memory cell. A trusted memory block is provided. The associated process is provided for testing and verifying a plurality of truth table inputs of the logic unit.

Whitaker, Sterling↗

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.↗

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.↗

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.↗

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.↗

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.

Cheung, Kar-Ming↗

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.↗

Achieving Agreement in Three Rounds With Bounded-Byzantine Faults

A three-round algorithm is presented that guarantees agreement in a system of K (nodes) greater than or equal to 3F (faults) +1 nodes provided each faulty node induces no more than F faults and each good node experiences no more than F faults, where, F is the maximum number of simultaneous faults in the network. The algorithm is based on the Oral Message algorithm of Lamport et al. and is scalable with respect to the number of nodes in the system and applies equally to the traditional node-fault model as well as the link-fault model. We also present a mechanical verification of the algorithm focusing on verifying the correctness of a bounded model of the algorithm as well as confirming claims of determinism.

Malekpour, Mahyar R.↗

Systems and Methods for Locating a Target in a GPS-Denied Environment

A system for locating an object in a GPS-denied environment includes first and second stationary nodes of a network and an object out of synchronization with a common time base of the network. The system includes one or more processors that are configured to estimate distances between the first stationary node and the object and a distance between the second stationary node and the object by comparing time-stamps of messages relayed between the object and the nodes. A position of the object can then be trilaterated using a location of each of the first and second stationary nodes and the measured distances between the object and each of the first and second stationary nodes.

Murdock, Ronald G.↗

Human Systems Risk Network - A Ranking Analysis of Risks

INTRODUCTION The Human Systems Risk Board (HSRB) is responsible for understanding, managing, and mitigating the risks associated with spaceflight. For a particular mission, the HSRB assigns each human system risk a rating on a 5x5 grid assessing its likelihood and consequence, which is ultimately used to compare and rank the risks. The HSRB approaches risk management by primarily establishing the context of each human system risk individually with the understanding that mitigating one risk might affect the likelihood, consequence, and mitigation approaches of another. To support this effort the HSRB, subject matter experts, and risk custodian teams created directed acyclic graphs (DAG), often called a causal graph, for the twenty-nine risks. In this presentation, we propose a new ranking algorithm for the risks which includes the downstream influence of each risk according to the information in the DAGs and provide an application of graph theoretic tools. METHODS In 2014, Mindock and Klaus proposed a taxonomy for human system risk influences which we have adopted to categorize the nodes in each DAG. Analyzing the nodes that correspond to the risks in this taxonomy allows us to analyze and understand how each risk influences the others. We construct an auxiliary network, which we call the Primary Risk Network (PRN), where the nodes are the twenty-nine space flight risks and, a directed edge connects Risk A to Risk B if Risk A has some influence on the likelihood or consequence of Risk B as described in the DAGS. We perform a variety of graph theoretic ranking methods on the nodes (or risks) in the PRN, including Katz centrality. RESULTS We rank the nodes in the PRN using the Katz centrality score. The ten risks with the highest score are pictured in Figure 1, colored (light to dark) according to their score. We analyze other centrality measures like betweenness centrality, eigenvector centrality, and the Estrada index, and provide the meaning of the corresponding rankings in terms of the risks. Future work includes analyzing the other categories in the taxonomy defined by Mindock and Klaus [1]. For example, we are interested in analyzing the nodes that are labeled as countermeasures or capabilities and perform similar analysis to measure their effect on certain medical conditions.

dag↗

Distributed Vision Sensing of Small Uncrewed Aircraft Systems in Urban Traffic Corridors

The NASA Advanced Air Mobility mission will enable widespread low altitude passenger travel, cargo delivery, and a variety of public services through the development of Uncrewed Aerial Systems (UAS) operations. Ensuring safe, autonomous operations in densely populated environments requires careful consideration towards hazards including other aircraft, infrastructure, and evolving weather. Small Uncrewed Aerial Systems (SUAS) present a unique hazard to UAS operations as they share airspace and may be readily operated in a non-cooperative fashion. This work investigates distributed sensing of SUAS traversing an air traffic corridor in an urban setting. This work develops a distributed vision detect and track strategy at NASA Langley Research Center. Three nodes, each with at least one global shutter camera, are distributed around a traffic corridor to surveil flight operations for two SUAS performing low altitude flight operations. Each node is equipped with a GPS and cellular modem to enable timestamping and remote control of acquisition. Node one faces a traffic roundabout with buildings in the background and achieves 99% surveillance coverage for two SUAS against building and tree backgrounds at ranges 50 to 130m. The second node points down Langley Boulevard with trees and buildings in the background and achieves 99% coverage at separation distances between 70 and 180m. The analysis for the second node is limited to ranges below 180m due to low contrast against dark, tree backgrounds. Finally, the third node points down Langley Boulevard from another perspective and achieves 99% coverage at ranges 60m to 200m against mostly building with a few sections of trees in the background.

Chester V Dolph↗