Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “TIME”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Adaptive time scaling for accelerating explicit finite element analysis

A method for accelerating an explicit finite element analysis (FEA) simulation of a modeled system or process includes performing an initial iteration of the FEA simulation according to a baseline time interval via an FEA computing network, and calculating a criteria ratio of a predetermined set of scaling criteria for the modeled system or process. The method includes determining a time-scaling factor using the criteria ratio via the FEA computing network as a function of the criteria ratio, and then applying the time-scaling factor to the baseline time interval to generate a scaled time interval. The scaled time interval accelerates simulation time of the FEA simulation. The method includes performing a subsequent iteration of the explicit FEA simulation at the scaled time interval using the FEA computing network. The process continues for subsequent iterations, with the time-scaling factor adapting with each iteration.

Chen, Jian↗
DOE OSTI2026

A time-parallel method for scalable heat transfer simulations of additive manufacturing

Here, a major challenge in simulating the thermal behavior in additive manufacturing processes is the disparate length and time scales between transport phenomena occurring in the melt pool and the component. A common simulation approach relies on spatial decomposition for parallel computing, but due to the nature of heat transfer in AM, where most of the computational expenditure is localized near the melt pool, the computational speedup from spatial parallelization saturates quickly. Therefore, additional parallelism by means of time-domain decomposition is needed to fully take advantage of high-performance computing (HPC) resources. This work introduces a time-parallel method to improve the computational scalability of additive manufacturing simulations on HPC systems, while maintaining high temporal resolution of heat transfer near the melt pool. The method, inspired by the nonlinear paraexp formalism, performs an iterative superposition of nonlinear solutions to the initial value problem, integrating the heat equation across overlapping time-parallel intervals. For a single layer of the NIST AMB2018–01 L7 benchmark problem, the method achieves a 38.51x speedup in wall-clock time with a maximum error in the global temperature solution of 0.99%. This reduces the total solution time from 196.72 min to 5.11 min on 128 nodes of the ORNL Frontier supercomputer. The tradeoff between accuracy and total wall-clock time is investigated and recommendations for time-parallel deployment for AM problems are made.

Additive manufacturing↗
DOE OSTI2021

An experimental comparison of a space-time multigrid method with PFASST for a reaction-diffusion problem

We consider two parallel-in-time approaches applied to a (reaction) diffusion problem, possibly non-linear. In particular, we consider PFASST (Parallel Full Approximation Scheme in Space and Time) and space-time multigrid strategies. For both approaches, we start from an integral formulation of the continuous time dependent problem. Then, a collocation form for PFASST and a discontinuous Galerkin discretization in time for the space-time multi-grid are employed, resulting in the same discrete solution at the time nodes. Strong and weak scaling of both multilevel strategies are compared for varying orders of the temporal discretization. Moreover, we investigate the respective convergence behavior for non-linear problems and highlight quantitative differences in execution times

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Benchmarking Real-Time Control Platforms Using a Matlab/Simulink Coder with Applications in the Control of DC/AC Switched Power Converters

In the control of DC/AC switched power converters (SPC), one of the most important aspects to be considered is the selection of the real-time control platform. The real-time control platform must be able to meet the high performance efficiency and regulation requirements of the DC/AC SPC, as these typically operate at switching frequencies in the order of kHz to MHz. For this reason, the hardware characteristics of the ADC and PWM, and the processing capacity of the real-time control platform are of vital importance when implementing advanced digital controllers that maintain voltage and current levels within regulatory standards. In this context, we aimed to perform a comparative study of the computation times of different real-time control platforms when implementing different control strategies for DC/AC switched power converters. We also analyzed the impact of the real-time control platforms on the THD of the voltages generated by the DC/AC switched power converters. With the help of this paper, researchers and developers will have criteria to select which real-time control platform to use in real-time control for DC/AC SPC applications.

42 ENGINEERING↗
DOE OSTI2022

High-order multirate explicit time-stepping schemes for the baroclinic-barotropic split dynamics in primitive equations

In order to treat the multiple time scales of ocean dynamics in an efficient manner, the baroclinic-barotropic splitting technique has been widely used for solving the primitive equations for ocean modeling. Based on the framework of strong stability-preserving Runge-Kutta approach, we propose two high-order multirate explicit time-stepping schemes (SSPRK2-SE and SSPRK3-SE) for the resulting split system in this paper. The proposed schemes allow for a large time step to be used for the three-dimensional baroclinic (slow) mode and a small time step for the two-dimensional barotropic (fast) mode, in which each of the two mode solves just need to satisfy their respective CFL conditions for numerical stability. Specifically, at each time step, the baroclinic velocity is first computed by advancing the baroclinic mode and fluid thickness of the system with the large time-step and the assistance of some intermediate approximations of the barotropicmode obtained by substepping with the small time step; then the barotropic velocity is corrected by using the small time step to re-advance the barotropic mode un-der an improved barotropic forcing produced by interpolation of the forcing terms from the preceding baroclinic mode solves; lastly, the fluid thickness is updated by coupling the baroclinic and barotropic velocities. Additionally, numerical inconsistencies on the discretized sea surface height caused by the mode splitting are relieved via a reconciliation process with carefully calculated flux deficits. Here, two benchmark tests from the “MPAS-Ocean” platform are carried out to numerically demonstrate the performance and parallel scalability of the proposed SSPRK-SE schemes.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Association Between Dispatch Complaint and Critical Prehospital Time Intervals in Suspected Stroke 911 Activations in the National Emergency Medical Services Information System, 2012–2016

Emergency Medical Services can help improve stroke outcomes by recognizing stroke symptoms, establishing response priority for 911 calls, and minimizing prehospital delays. This study examines 911 stroke events and evaluates associations between events dispatched as stroke and critical EMS time intervals. Data from the National Emergency Medical Services Information System, 2012 to 2016, were analyzed. Activations from 911 calls with a primary or secondary provider impression of stroke were included for adult patients transported to a hospital destination. Three prehospital time intervals were evaluated: (1) response time (RT) ≤8 min, (2) on-scene time (OST) ≤15 min, and (3) transport time (TT) ≤12 min. Associations between stroke dispatch complaint and prehospital time intervals were assessed using multivariate regression to estimate adjusted risk ratios (ARR) and 95% confidence intervals (CIs). Approximately 37% of stroke dispatch complaints were identified by EMS as a suspected stroke. Compared to stroke events without a stroke dispatch complaint, median OST was shorter for events with a stroke dispatch (16 min vs. 14 min, respectively). In adjusted analyses, events dispatched as stroke were more likely to meet the EMS time benchmark for OST ≤15 min (OST, 1.20 [1.20–1.21]), but not RT or TT (RT, [1.00–1.01]; TT, 0.95 [0.94–0.95]). Furthermore, our results indicate that dispatcher recognition of stroke symptoms reduces the time spent on-scene by EMS personnel. These findings can inform future EMS stroke education and quality improvement efforts to emphasize dispatcher recognition of stroke signs and symptoms, as EMS dispatchers play a crucial role in optimizing the prehospital response.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Uniqueness of relaxation times determined by dielectric spectroscopy

Dielectric spectroscopy is extremely powerful to study molecular dynamics, because of the very broad frequency range. Often multiple processes superimpose resulting in spectra that expand over several orders of magnitude, with some of the contributions partially hidden. For illustration, we selected two examples, (i) normal mode of high molar mass polymers partially hidden by conductivity and polarization and (ii) contour length fluctuations partially hidden by reptation using the well-studied polyisoprene melts as example. The intuitive approach to describe experimental spectra and to extract relaxation times is the addition of two or more model functions. Here, we use the empirical Havriliak-Negami function to illustrate the ambiguity of the extracted relaxation time, despite an excellent agreement of the fit with experimental data. We show that there are an infinite number of solutions for which a perfect description of experimental data can be achieved. However, a simple mathematical relationship indicates uniqueness of the pairs of the relaxation strength and relaxation time. Sacrificing the absolute value of the relaxation time enables to find the temperature dependence of the parameters with a high accuracy. For the specific cases studied here, the time temperature superposition (TTS) is very useful to confirm the principle. However, the derivation is not based on a specific temperature dependence, hence, independent from the TTS. We compare new and traditional approaches and find the same trend for the temperature dependence. The important advantage of the new technology is the knowledge of the accuracy of the relaxation times. Relaxation times determined from data for which the peak is clearly visible are the same within the experimental accuracy for traditional and new technology. However, for data where a dominant process hides the peak, substantial deviations can be observed. Finally, we conclude that the new approach is particularly helpful for cases in which relaxation times need to be determined without having access to the associated peak position.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Test beam characterization of sensor prototypes for the CMS Barrel MIP Timing Detector

The MIP Timing Detector will provide additional timing capabilities for detection of minimum ionizing particles (MIPs) at CMS during the High Luminosity LHC era, improving event reconstruction and pileup rejection. The central portion of the detector, the Barrel Timing Layer (BTL), will be instrumented with LYSO:Ce crystals and Silicon Photomultipliers (SiPMs) providing a time resolution of about 30 ps at the beginning of operation, and degrading to 50-60 ps at the end of the detector lifetime as a result of radiation damage. In this work, we present the results obtained using a 120 GeV proton beam at the Fermilab Test Beam Facility to measure the time resolution of unirradiated sensors. A proof-of-concept of the sensor layout proposed for the barrel region of the MTD, consisting of elongated crystal bars with dimensions of about 3×3×57 mm3 and with double-ended SiPM readout, is demonstrated. This design provides a robust time measurement independent of the impact point of the MIP along the crystal bar. We tested LYSO:Ce bars of different thickness (2, 3, 4 mm) with a geometry close to the reference design and coupled to SiPMs manufactured by Hamamatsu and Fondazione Bruno Kessler. The various aspects influencing the timing performance such as the crystal thickness, properties of the SiPMs (e.g. photon detection efficiency), and impact angle of the MIP are studied. A time resolution of about 28 ps is measured for MIPs crossing a 3 mm thick crystal bar, corresponding to a most probable value (MPV) of energy deposition of 2.6 MeV, and of 22 ps for the 4.2 MeV MPV energy deposition expected in the BTL, matching the detector performance target for unirradiated devices.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Multi-Time Scale Coordinated Control and Scheduling of Inverter-Based TCLs With Variable Wind Generation

To address microgrid tie flow errors caused by wind generation variability, here we propose and develop a multi-time scale coordinated control and scheduling strategy for inverter-based thermostatically controlled loads (TCLs). First, in hour-time scale, inverter-based TCLs with adjusting temperature set-point are modeled as virtual generators to compensate tie flow deviations in the day-ahead plan. Next, in minute-time scale, virtual batteries representing operating behaviors of inverter-based TCLs with frequency control are scheduled determined by the control of virtual generators in hour-time scale. The virtual batteries are scheduled to smooth out tie flow errors corresponding to day-ahead plan and hour-time scale schedules. The multi-time scale control methods are coordinated to employ the response potential of inverter-based TCLs and response curve-based methods are proposed to control inverter-based TCLs considering the customer privacy. The multi-time scale stochastic schedules which are based on response curves of inverter-based TCLs are coordinated to accommodate wind generation variability. Simulation results demonstrate that the microgrid tie flow errors are effectively mitigated by the proposed multi-time scale coordinated control and scheduling of inverter-based TCLs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding

Interactive time-varying volume visualization is challenging due to its complex spatiotemporal features and sheer size of the dataset. Recent works transform the original discrete time-varying volumetric data into continuous Implicit Neural Representations (INR) to address the issues of compression, rendering, and super-resolution in both spatial and temporal domains. However, training the INR takes a long time to converge, especially when handling large-scale time-varying volumetric datasets. In this work, we proposed F-Hash, a novel feature-based multi-resolution Tesseract encoding architecture to greatly enhance the convergence speed compared with existing input encoding methods for modeling time-varying volumetric data. The proposed design incorporates multi-level collision-free hash functions that map dynamic 4D multi-resolution embedding grids without bucket waste, achieving high encoding capacity with compact encoding parameters. Our encoding method is agnostic to time-varying feature detection methods, making it a unified encoding solution for feature tracking and evolution visualization. Experiments show the F-Hash achieves state-of-the-art convergence speed in training various time-varying volumetric datasets for diverse features. We also proposed an adaptive ray marching algorithm to optimize the sample streaming for faster rendering of the time-varying neural representation.

deep learning↗
DOE OSTI2022

Asynchronous Truncated Multigrid-Reduction-in-Time

In this paper, we present the new “asynchronous truncated multigrid-reduction-in-time” (AT-MGRIT) algorithm for introducing time parallelism to the solution of discretized time-dependent problems. The new algorithm is based on the multigrid-reduction-in-time (MGRIT) approach, which, in certain settings, is equivalent to another common multilevel parallel-in-time method, Parareal. In contrast to Parareal and MGRIT that both consider a global temporal grid over the entire time interval on the coarsest level, the AT-MGRIT algorithm uses truncated local time grids on the coarsest level, each grid covering certain temporal subintervals. Further, these local grids can be solved completely in an independent way from each other, which reduces the sequential part of the algorithm and, thus, increases parallelism in the method. Here, we study the effect of using truncated local coarse grids on the convergence of the algorithm, both theoretically and numerically, and show, using challenging nonlinear problems, that the new algorithm consistently outperforms classical Parareal/MGRIT in terms of time to solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Neural correspondence to spectrum of environmental uncertainty in multiple-cue probability judgment system with time delay

Despite state-of-the-art technologies like artificial intelligence, human judgment is critically essential in cooperative systems, such as the multi-agent system (MAS), which collect information among agents based on multiple-cue judgment. Human agents can prevent impaired situational awareness of automated agents by confirming situations under environmental uncertainty. System error caused by uncertainty can result in an unreliable system environment, and this environment affects the human agent, resulting in non-optimal decision-making in MAS. Thus, it is necessary to know how human behavior is changed to capture system reliability under uncertainty. Another issue affecting MAS is time delay, which can delay agent information transfer, resulting in low performance and instability. However, it is difficult to find studies on the influence of time delay on human agents. This study is about understanding the human decision-making process under a specific system reliability environment by uncertainty with time delay. We used concepts of expected and unexpected uncertainty to implement reliability of the system usage environment with three types of time delay conditions: no time delay, regular time delay, and irregular time delay conditions. We used electroencephalogram (EEG) for human cognitive neural mechanisms in multiple-cue judgment systems to understand human decision-making. In the reliability of system usage environment, the unreliable system environment significantly creates less memory load by less utilization of system rules for decision-making. In terms of time delay, delayed information delivery does not significantly affect memory load for decision-making.

cognitive process↗
DOE OSTI2021

Efficient Space–Time Reduced Order Model for Linear Dynamical Systems in Python Using Less than 120 Lines of Code

A classical reduced order model (ROM) for dynamical problems typically involves only the spatial reduction of a given problem. Recently, a novel space–time ROM for linear dynamical problems has been developed [Choi et al., Space–tume reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems, Journal of Computational Physics, 2020], which further reduces the problem size by introducing a temporal reduction in addition to a spatial reduction without much loss in accuracy. The authors show an order of a thousand speed-up with a relative error of less than 10−5 for a large-scale Boltzmann transport problem. In this work, we present for the first time the derivation of the space–time least-squares Petrov–Galerkin (LSPG) projection for linear dynamical systems and its corresponding block structures. Utilizing these block structures, we demonstrate the ease of construction of the space–time ROM method with two model problems: 2D diffusion and 2D convection diffusion, with and without a linear source term. For each problem, we demonstrate the entire process of generating the full order model (FOM) data, constructing the space–time ROM, and predicting the reduced-order solutions, all in less than 120 lines of Python code. We compare our LSPG method with the traditional Galerkin method and show that the space–time ROMs can achieve O(10−3) to O(10−4) relative errors for these problems. Depending on parameter–separability, online speed-ups may or may not be achieved. For the FOMs with parameter–separability, the space–time ROMs can achieve O(10) online speed-ups. Finally, we present an error analysis for the space–time LSPG projection and derive an error bound, which shows an improvement compared to traditional spatial Galerkin ROM methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2015

Kennedy Space Center Timing and Countdown Interface to Kennedy Ground Control Subsystem

Kennedy Ground Control System (KGCS) engineers at the National Aeronautics and Space Administration (NASA) Kennedy Space Center (KSC) are developing a time-tagging process to enable reconstruction of the events during a launch countdown. Such a process can be useful in the case of anomalies or other situations where it is necessary to know the exact time an event occurred. It is thus critical for the timing information to be accurate. KGCS will synchronize all items with Coordinated Universal Time (UTC) obtained from the Timing and Countdown (T&CD) organization. Network Time Protocol (NTP) is the protocol currently in place for synchronizing UTC. However, NTP has a peak error that is too high for today's standards. Precision Time Protocol (PTP) is a newer protocol with a much smaller peak error. The focus of this project has been to implement a PTP solution on the network to increase timing accuracy while introducing and configuring the implementation of a firewall between T&CD and the KGCS network.

Protocol↗
NASA NTRS2018

Use of Open Networks and Delay-Tolerant Protocol to Decrease WAN Latency of EOS near Real-Time Data

Since 1999, NASA's Earth Observing System Data Operations System (EDOS) project at Goddard Space Flight Center (GSFC) has provided high-rate data capture, level zero processing, and product distribution services for a majority of NASA's EOS (Earth Observing System) high-rate missions, including Terra, Aqua, Aura, ICESat, EO-1, SMAP, and OCO-2. EDOS high-rate science and engineering (150-300 Mbps) data-driven capture systems are deployed at 7 worldwide ground stations which are connected via both private (closed) and public (open) wide area networks (WANs) to the centralized EDOS Level Zero Processing Facility (LZPF) located at GSFC, where the data is processed and Level 0 products are distributed to users worldwide. All data transferred over the open networks to GSFC traverse an IPSec tunnel, providing the same level of security as a VPN connection. EDOS produces both time-based and near real-time products (session-based). Near real-time data products are produced from a single ground station contact; time-based products are produced from multiple ground station contacts. EDOS is the primary supplier of EOS Level 0 data to the NASA near real-time user community known as the Land, Atmosphere Near real-time Capability for EOS (LANCE). For the past few years, EDOS has streamlined its systems to reduce WAN latency for near real-time data delivery, including implementing Quality of Service (QoS), expanding closed network bandwidth, adding open network connections with more bandwidth, and implementing a delay-tolerant protocol to mitigate long round-trip times to remote ground stations.

Delay-Tolerant Protocol↗
NASA NTRS2018

Required Time of Arrival as a Control Mechanism to Mitigate Uncertainty in Arrival Traffic Demand Management

The objective of this study is to explore the use of Required Time of Arrival (RTA) capability on the flight deck as a control mechanism on arrival traffic management to improve traffic delivery accuracy by mitigating the effect of traffic demand uncertainty. The uncertainties are caused by various factors, such as departure error due to the difference between scheduled departure and the actual take-off time. A simulation study was conducted using the Multi Aircraft Control System (MACS) software, a comprehensive research platform developed in the Airspace Operations Laboratory (AOL) at NASA Ames Research Center. The Crossing Time (CT) performance (i.e. the difference between target crossing time and actual crossing time) of the RTA for uncertainty mitigation during cruise phase was evaluated under the influence of varying two main factors: wind severity (heavy wind vs. mild wind), and wind error (1 hour, 2 hours, and 5 hours wind forecast errors). To examine the CT performance improvement made by the RTA, the comparison to the CT of the aircraft that were not assigned with RTA (Non-RTA) under the influence of the selected factors was also made. The Newark Liberty International Airport (EWR) was chosen for this study. A total 66 inbound traffic to the EWR (34 of them were airborne when the simulation was initiated, 32 were pre-departures at that time) was simulated, where the pre-scripted departure error was assigned to each pre-departure (61 conform to their Expected Departure Clearance Time, which is +-300 seconds of their scheduled departure time). The results of the study show that the delivery accuracy improvement can be achieved by assigning RTA, regardless of the influence of the selected two factors (the wind severity and the wind information inaccuracy). Across all wind variances, 66.9 (265 out of 396) of the CT performance of the RTA assigned aircraft was within +- 60 seconds (i.e. target tolerance range) and 88.9 (352 out of 396) aircraft met +-300 seconds marginal tolerance range, while only 33.6 (133 out of 396) of the Non-RTA assigned aircrafts CT performance achieved the target tolerance range and 75.5 (299 out of 396) stayed within the marginal. Examination of the impact of different error sources i.e. departure error, wind severity, and wind error suggest that although large departure errors can significantly impact the CT performance, the impacts of wind severity and errors were modest relative the targeted +- 60 second conformance range.

required time of arrival (RTA)↗
NASA NTRSDate not supplied

Estimation of Timing Performance with Pulsed Laser Links for Small Satellite PNT

Satellite constellations are growing in size and in utility for applications as diverse as providing reliable, low-latency internet service to rural areas orEarth science missions.This expansion of satellite constellations brings attention to the need for responsive and reliable satellite communication.Current research in the PrecisionSpace Systems Laboratory at the University of Florida focuses on using pulsed laser communications as the method of relaying time signals instead of the radio frequency (RF)signals.The upcoming CLICK (CubeSat Laser Infrared CrosslinK) missions (Massachusetts Institute of Technology, University of Florida, NASA Ames Research Center) will demonstrate a spacecraft-to-spacecraft laser communication link and time-transfer.For pre-flight technology assessment of missions such as CLICK, a simulation of a spacecraft constellation in Earth orbit has been created to estimate clock synchronization and precision orbit determination based on measured instrumentation performance.We have developed a novel MATLAB-based numerical simulator to model spacecraft-to-spacecraft laser time-transfer and estimate the offset between the spacecraft clocks over time.This simulation includes timing errors associated with laser pulse generation and detection, as well as non-Gaussian clock drift models.The two on-board clocks modeled are a cesium-based Chip-Scale Atomic Clock (CSAC) and a rubidium-based Miniature Atomic Clock (MAC), both produced by Microchip.An example case of two spacecraft in a circular, low-Earth orbit receiving GPS position, GPS timing, and laser pulse time-of-flight measurements is simulated.The positions and velocities of the two spacecraft at a reference epoch and the constant clock model coefficients are estimated.Polynomial models of different orders were used as clock models. The effect of clock model order on the root-mean-square (RMS) of the clock error is apparent in the case using GPS and lasing measurements, showing that the clock model improves with increasing clock model order. Results compare the estimated clock model of a mission operation that only uses GPS measurements and a mission operation that uses both GPS and laser pulse time-of-flight measurements between spacecraft referenced to their on-board CSACs or on-board MACs. Including lasing measurements reduces the RMS clock model error by approximately 80% of the RMS of the cases with only GPS measurements.This simulation tool can be used to optimize the lasing operations schedule based on mission timing performance objectives. During this presentation, I will discuss the details of the simulation and clock model estimation, as well as discuss the results.I will compare the results of incorporating lasing timing measurements to using only GPS measurements and the outcomes of using different orders of polynomials.

Timing Performance↗
NASA NTRSDate not supplied

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↗