Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time-varying delay”

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 55 records · Page 3

A method to account for variation of average compressor inlet pressure during instantaneous distortion analyses

Instantaneous distortion analyses compare a time-varying value of an index (or 'surge margin used up') with a critical level (or 'available surge margin' of the compressor) to determine inlet-engine compatibility. Unless freestream conditions or propulsion system controls are changing, it is generally assumed that the available surge margin of the compressor is accurately determined from the steady-state operating point. Results are presented which show that variations of average compressor inlet pressure may occur without changes in freestream conditions or propulsion system controls. The volume dynamics of the compressor will cause these pressure variations to be attenuated and delayed by the time they reach the exit. This will cause the compressor pressure ratio (and available surge margin) to vary with time. A method is presented to calculate the available surge margin as a function of time and incorporate it into an instantaneous distortion analysis. Results show that inlet pressure variations which cause only a small change at the compressor exit can cause a significant variation in the available surge margin.

Burstadt, P. L.↗

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗

Toward Time Synchronization in Delay Tolerant Network based Solar System Internetworking

The expanding presence in space will place an increased dependency on networked communications– a scalable communications infrastructure; that is, the Solar System Internet (SSI). Upcoming developments towards a SSI include NASA’s upcoming LunaNet, or lunar Internet, which provides multi-hop multi-path communications using Delay Tolerant Networking (DTN). DTN has been an active area of research and development, particularly in routing, security, and optimization. DTNs are marked by mobility, disconnection, and a wide variance of latencies (propagation and processing delays). In this paper, we outline progress towards a theory of time synchronization across such a network. An underlying assumption of DTN is that the network is time synchronized already, rather than synchronization being provided as a service. While this is necessary for schedule-based routing, which is necessarily prevalent in DTNs, it is so deeply ingrained as to be built into the primary unit of data in DTNs– the bundle. Indeed, a bundle’s creation timestamp and its time to live (called the lifetime) are based on time, and there are special recommendations for systems that lack accurate clocks. The assumption of time synchronization makes sense when limiting considerations to smaller-scale and more traditional space communication. However, just as end-to-end connectivity cannot be guaranteed in DTNs, neither can access to a reference or authoritative clock. In this more general case, it might be necessary to synchronize over time-varying meshes, and perhaps even to consider relativistic effects. Moreover, by imposing synchronization restrictions in order to sustain a network, the effectiveness of the network to achieve scalability will be necessarily muted. To work towards a time synchronization theory for DTNs, we build upon past successes in modeling DTNs using time-varying graphs and sheaves. This includes error and limitation estimation, which allows one to define domains over which schedule-based routing is possible, up to some threshold sensitivity. Despite the theoretical nature of these results, the approaches taken are also algorithmic, and hence lend themselves to practical implementations. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay Tolerant Networking↗

Particle production by time-varying dark energy and the end of cosmic expansion

We consider various possible consequences of time-varying dark energy due to a quintessence scalar field whose energy density is partially converted to particles as the field evolves down its potential. This particle production acts as a source of thermal friction on the field that can make it difficult to distinguish whether dark energy is due to a radiating field rolling down a steep potential, a purely self-interacting field moving down a flatter potential, or a cosmological constant. By reducing the acceleration of the scalar field, thermal friction increases the amount of accelerated expansion and can cause a sizable bump in the quintessence equation of state. We take special interest in the case where a steep potential rapidly changes from positive to negative as the field evolves, resulting in the end of cosmic expansion and the beginning of contraction. Even in this case, we find that thermal friction lengthens the period of accelerated expansion and consequently delays the end of cosmic expansion, making it challenging to detect the impending transition to contraction using conventional cosmological tests. However, particle production can also provide alternative avenues for detection by generating a background of thermal dark radiation, partly comprised of neutrinos or other particles, whose energy density exceeds the remnant photon energy density.

cosmological neutrinos↗

Particle Production by Time-Varying Dark Energy and the End of Cosmic Expansion

We consider various possible consequences of time-varying dark energy due to a quintessence scalar field whose energy density is partially converted to particles as the field evolves down its potential. This particle production acts as a source of thermal friction on the field that can make it difficult to distinguish whether dark energy is due to a radiating field rolling down a steep potential, a purely self-interacting field moving down a flatter potential, or a cosmological constant. By reducing the acceleration of the scalar field, thermal friction increases the amount of accelerated expansion and can cause a sizable bump in the quintessence equation of state. We take special interest in the case where a steep potential rapidly changes from positive to negative as the field evolves, resulting in the end of cosmic expansion and the beginning of contraction. Even in this case, we find that thermal friction lengthens the period of accelerated expansion and consequently delays the end of cosmic expansion, making it challenging to detect the impending transition to contraction using conventional cosmological tests. However, particle production can also provide alternative avenues for detection by generating a background of thermal dark radiation, partly comprised of neutrinos or other particles, whose energy density exceeds the remnant photon energy density.

Cosmology and Nongalactic Astrophysics (astro-ph.C↗

Lp-stability (1 less than or equal to p less than or equal to infinity) of multivariable nonlinear time-varying feedback systems that are open-loop unstable

A class of multivariable, nonlinear time-varying feedback systems with an unstable convolution subsystem as feedforward and a time-varying nonlinear gain as feedback was considered. The impulse response of the convolution subsystem is the sum of a finite number of increasing exponentials multiplied by nonnegative powers of the time t, a term that is absolutely integrable and an infinite series of delayed impulses. The main result is a theorem. It essentially states that if the unstable convolution subsystem can be stabilized by a constant feedback gain F and if incremental gain of the difference between the nonlinear gain function and F is sufficiently small, then the nonlinear system is L(p)-stable for any p between one and infinity. Furthermore, the solutions of the nonlinear system depend continuously on the inputs in any L(p)-norm. The fixed point theorem is crucial in deriving the above theorem.

Callier, F. M.↗

Analysis of response to wind-shears using the optimal control model of the human operator

The effects of wind-shears on the approach performance of a STOL aircraft are analyzed using the optimal-control model of the human operator. This analysis involves a time-varying situation that is more complex than is traditionally treated by human operator modelling techniques. The extensions to the time-varying case are discussed and results are presented that illustrate the effects of wind shears on category II window-performance and the effects on performance of pilot time-delay and of variations in pilot gain during approach.

Baron, S.↗

Lectures on algebraic system theory: Linear systems over rings

The presentation centers on four classes of systems that can be treated as linear systems over a ring. These are: (1) discrete-time systems over a ring of scalars such as the integers; (2) continuous-time systems containing time delays; (3) large-scale discrete-time systems; and (4) time-varying discrete-time systems.

Kamen, E. W.↗

Echo mapping the Balmer-emission region in NGC 3516

We use a maximum-entropy method to show that the transfer function (TF) of the broad-line region (BLR) in the Seyfert-1 galaxy NGC 3516 is time-varying. The TF decreased by nearly a factor of two over a time scale less than half a year during a monitoring campaign in 1990. We conclude that the observed time dependency is likely to be either due to variations of the spectral index of the ionizing continuum spectrum; due to a change in the number or covering fraction of broad-line clouds; due to nonlinear line response; or due to nonstationary anisotropy of the continuum source on time scales of several weeks to months. An extended continuum source could also explain the observed time-dependency. The symmetry of the time lag for variations in the red and blue wings of H-alpha indicates that the BLR kinematics is not dominated by organized radial inflow or outflow. If we assume circular orbits, the observed time lag 14 days at velocity v = 4000 km/s suggests a mass of the central object of approximately 2 x 10(exp 7) solar mass. The H-alpha TF peaks away from zero delay, indicating that the H-alpa BLR is either non-spherical or inwardly emitting.

Wanders, I.↗

A wideband channel model for land mobile satellite systems

A wideband channel model for Land Mobile Satellite (LMS) services is presented which characterizes the time-varying transmission channel between a satellite and a mobile user terminal. The channel model statistic parameters are the results of fitting procedures to measured data. The data used for fitting have a time resolution of 33 ns corresponding to a bandwidth of 30 MHz. Thus, the model is capable to characterize the channel behaviour for a wide range of services e.g., voice transmission, digital audio broadcasting (DAB), and spread spectrum modulation schemes. The model is presented for different environments and scenarios. The model is derived for a quasi-mobile user with hand-held terminal being in two different environments: rural and urban. The parameters needed for the description are (a) the number of echoes, (b) the distribution of the echo power, and (c) the distribution of the echo delay. It is shown that the direct path follows a Rician distribution whereas the reflected paths are Rayleigh/lognormal distributed. The parameters are given for an elevation angle of 25 deg.

Jahn, Axel↗

Design and architecture of the Mars relay network planning and analysis framework

In this paper we describe the design and architecture of the Mars Network planning and analysis framework that supports generation and validation of efficient planning and scheduling strategy. The goals are to minimize the transmitting time, minimize the delaying time, and/or maximize the network throughputs. The proposed framework would require (1) a client-server architecture to support interactive, batch, WEB, and distributed analysis and planning applications for the relay network analysis scheme, (2) a high-fidelity modeling and simulation environment that expresses link capabilities between spacecraft to spacecraft and spacecraft to Earth stations as time-varying resources, and spacecraft activities, link priority, Solar System dynamic events, the laws of orbital mechanics, and other limiting factors as spacecraft power and thermal constraints, (3) an optimization methodology that casts the resource and constraint models into a standard linear and nonlinear constrained optimization problem that lends itself to commercial off-the-shelf (COTS)planning and scheduling algorithms.

Mars relay network planning analysis↗

Unequal-Arm Interferometry and Ranging in Space

Space-borne interferometric gravitational wave detectors, sensitive in the low-frequency (millihertz) band, will fly in the next decade. In these detectors the spacecraft-to-spacecraft light-traveltimes will necessarily be unequal, time-varying, and (due to aberration) have different time delays on up- and down-links. By using knowledge of the inter-spacecraft light-travel-times and their time evolution it is possible to cancel in post-processing the otherwise dominant laser phase noise and obtain a variety of interferometric data combinations sensitive to gravitational radiation. This technique, which has been named Time-Delay Interferometry (TDI), can be implemented with constellations of three or more formation-flying spacecraft that coherently track each other. As an example application we consider the Laser Interferometer Space Antenna (LISA) mission and show that TDI combinations can be synthesized by properly time-shifting and linearly combining the phase measurements performed on board the three spacecraft. Since TDI exactly suppresses the laser noises when the delays coincide with the light-travel-times, we then show that TDI can also be used for estimating the time-delays needed for its implementation. This is done by performing a post-processing non-linear minimization procedure, which provides an effective, powerful, and simple way for making measurements of the inter-spacecraft light-travel-times. This processing technique, named Time-Delay Interferometric Ranging (TDIR), is highly accurate in estimating the time-delays and allows TDI to be successfully implemented without the need of a dedicated ranging subsystem.

gravitational waves↗

Fourier Domain Sensing

Methods and systems are disclosed of sensing an object. A first radiation is spatially modulated to generate a structured second radiation. The object is illuminated with the structured second radiation such that the object produces a third radiation in response. Apart from any spatially dependent delay, a time variation of the third radiation is spatially independent. With a single-element detector, a portion of the third radiation is detected from locations on the object simultaneously. At least one characteristic of a sinusoidal spatial Fourier-transform component of the object is estimated from a time-varying signal from the detected portion of the third radiation.

Feldkhun, Daniel↗

Applied Time Domain Stability Margin Assessment for Nonlinear Time-Varying Systems

The baseline stability margins for NASA's Space Launch System (SLS) launch vehicle were generated via the classical approach of linearizing the system equations of motion and determining the gain and phase margins from the resulting frequency domain model. To improve the fidelity of the classical methods, the linear frequency domain approach can be extended by replacing static, memoryless nonlinearities with describing functions. This technique, however, does not address the time varying nature of the dynamics of a launch vehicle in flight. An alternative technique for the evaluation of the stability of the nonlinear launch vehicle dynamics along its trajectory is to incrementally adjust the gain and/or time delay in the time domain simulation until the system exhibits unstable behavior. This technique has the added benefit of providing a direct comparison between the time domain and frequency domain tools in support of simulation validation. This technique was implemented by using the Stability Aerospace Vehicle Analysis Tool (SAVANT) computer simulation to evaluate the stability of the SLS system with the Adaptive Augmenting Control (AAC) active and inactive along its ascent trajectory. The gains for which the vehicle maintains apparent time-domain stability defines the gain margins, and the time delay similarly defines the phase margin. This method of extracting the control stability margins from the time-domain simulation is relatively straightforward and the resultant margins can be compared to the linearized system results. The sections herein describe the techniques employed to extract the time-domain margins, compare the results between these nonlinear and the linear methods, and provide explanations for observed discrepancies. The SLS ascent trajectory was simulated with SAVANT and the classical linear stability margins were evaluated at one second intervals. The linear analysis was performed with the AAC algorithm disabled to attain baseline stability margins. At each time point, the system was linearized about the current operating point using Simulink's built-in solver. Each linearized system in time was evaluated for its rigid-body gain margin (high frequency gain margin), rigid-body phase margin, and aero gain margin (low frequency gain margin) for each control axis. Using the stability margins derived from the baseline linearization approach, the time domain derived stability margins were determined by executing time domain simulations in which axis-specific incremental gain and phase adjustments were made to the nominal system about the expected neutral stability point at specific flight times. The baseline stability margin time histories were used to shift the system gain to various values around the zero margin point such that a precise amount of expected gain margin was maintained throughout flight. When assessing the gain margins, the gain was applied starting at the time point under consideration, thereafter following the variation in the margin found in the linear analysis. When assessing the rigid-body phase margin, a constant time delay was applied to the system starting at the time point under consideration. If the baseline stability margins were correctly determined via the linear analysis, the time domain simulation results should contain unstable behavior at certain gain and phase values. Examples will be shown from repeated simulations with variable added gain and phase lag. Faithfulness of margins calculated from the linear analysis to the nonlinear system will be demonstrated.

Kiefer, J. M.↗

LTI Representations of Adaptive Systems with Tap Delay-Line Regressors under Sinusoidal Excitation

It is shown that and adaptive system whose regressor is formed by tap delay-line (TDL) filtering of a multitone sinusoidal signal is representable as a parallel connection of a linear time-invariant (LTI) block and a linear time-varying (LTV) block. Furthermore, a norm-bound (induced 2-norm) is computed explicity on the LTV block and is shown to decrease as N -1 where N is the number of taps.

adaptive↗

Scheduling NASA's Deep Space Network: Priorities, Preferences, and Optimization

NASA's Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40\% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process --- oversubsubscription and how to "fairly'" reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗

A Zero-order Hold Approach for Fractional-delay Interpolation in Auralization

During the signal processing chain of an auralization simulating the propagation of a sound from a moving source to a stationary receiver, it is often necessary to interpolate between the samples of the source signal in order to arrive at uniformly-spaced samples at the receiver. In some cases, this interpolation is done in the receiver time frame – where the “input” samples of the source have become irregularly spaced due to time dilation effects. Canonical band-limited interpolation methods (i.e., sinc and sinc-derived approaches) cannot be applied in this case as they rely on having a uniformly-spaced input. The use of geometric interpolation methods that can handle irregularly-spaced input may not be grounded in signal processing principles and may produce unwanted artifacts and noise. This presentation outlines the possibility of embedding an irregularly-spaced zero-order hold signal within a highly over-sampled uniformly-spaced signal, and then processing down to the desired sampling rate through successive decimations. Initial distortion and noise characteristics of the approach are shown for some basic propagation geometries. The possible benefits of using such an approach in an auralization scheme with a time-varying Doppler shift are discussed including: the prevention of aliasing, processing time advantages, and the possibility for asynchronous processing.

Auralization↗

User Preference Optimization for Oversubscribed Scheduling of NASA’s Deep Space Network

NASA’s Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process — oversubsubscription and how to “fairly” reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗