Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh networks”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2000

Efficient Use of Distributed Systems for Scientific Applications

Distributed computing has been regarded as the future of high performance computing. Nationwide high speed networks such as vBNS are becoming widely available to interconnect high-speed computers, virtual environments, scientific instruments and large data sets. One of the major issues to be addressed with distributed systems is the development of computational tools that facilitate the efficient execution of parallel applications on such systems. These tools must exploit the heterogeneous resources (networks and compute nodes) in distributed systems. This paper presents a tool, called PART, which addresses this issue for mesh partitioning. PART takes advantage of the following heterogeneous system features: (1) processor speed; (2) number of processors; (3) local network performance; and (4) wide area network performance. Further, different finite element applications under consideration may have different computational complexities, different communication patterns, and different element types, which also must be taken into consideration when partitioning. PART uses parallel simulated annealing to partition the domain, taking into consideration network and processor heterogeneity. The results of using PART for an explicit finite element application executing on two IBM SPs (located at Argonne National Laboratory and the San Diego Supercomputer Center) indicate an increase in efficiency by up to 36% as compared to METIS, a widely used mesh partitioning tool. The input to METIS was modified to take into consideration heterogeneous processor performance; METIS does not take into consideration heterogeneous networks. The execution times for these applications were reduced by up to 30% as compared to METIS. These results are given in Figure 1 for four irregular meshes with number of elements ranging from 30,269 elements for the Barth5 mesh to 11,451 elements for the Barth4 mesh. Future work with PART entails using the tool with an integrated application requiring distributed systems. In particular this application, illustrated in the document entails an integration of finite element and fluid dynamic simulations to address the cooling of turbine blades of a gas turbine engine design. It is not uncommon to encounter high-temperature, film-cooled turbine airfoils with 1,000,000s of degrees of freedom. This results because of the complexity of the various components of the airfoils, requiring fine-grain meshing for accuracy. Additional information is contained in the original.

Taylor, Valerie↗
DOE OSTI2025

Hydrologic Model Data for the East Fork Poplar Creek Watershed Simulated with the Advanced Terrestrial Simulator (ATS): Streamflow and Network Expansion–Contraction Dynamics

This dataset supports hydrologic modeling and stream network expansion–contraction analysis for the East Fork Poplar Creek (EFPC) Watershed in Tennessee. It includes a Jupyter notebook for model setup, model configuration files, simulation outputs, and derived products used to evaluate model performance and investigate stream dynamics under varying hydrologic conditions. The dataset was generated using the Watershed Workflow Python package and the Advanced Terrestrial Simulator (ATS), enabling integrated surface–subsurface hydrologic simulations using a stream-aligned mesh. Outputs include high-resolution time series of streamflow, active network length, water table depth, and related hydrologic variables. Also included are spatially explicit stream persistency indices and classifications of reaches as perennial or non-perennial. These data facilitate reproducibility and support further research on stream intermittency and variability in network extent.The model data archive is organized in following directories:1) model_setup_inputsContains the Watershed Workflow Jupyter notebooks (accessed through any open source code editor), selected input datasets, and resulting ATS input files, including XML files (access through any open source code editor), computational mesh (.exo files can be viewed using Paraview), and meteorological forcing files (.h5 files can be accessed through h5py python package and HDFView open source software). 2) model_outputsIncludes ATS simulation outputs relevant to this study. Time series of spatially integrated or averaged variables (e.g., streamflow, water table depth) are provided as CSV files. Select spatial fields (e.g., ponded depth and water table depth) are saved as pickled Python objects to reduce file size, and can be accessed through pickle package in Python. Key geometry objects from Watershed Workflow—such as the surface mesh and river tree—are also included to support analysis of streamflow persistency and expansion–contraction dynamics. These files can also be accessed through Watershed Workflow Python package.3) model_evaluationProvides observed streamflow time series and field survey-based flow regime classifications used to evaluate model performance. Jupyter notebooks for processing ATS outputs and comparing model predictions with observations to build confidence in the model prior to scientific analysis are also included.4) Q_L_relationshipsContains workflows for generating time series of discharge, active network length, and related hydrologic variables used in the stream network expansion–contraction analysis. Includes routines for delineating baseflow-dominated periods. For each catchment, notebooks and processed data (as pickled DataFrames accessed through Pandas Python package) are provided. 5) figure_scriptsProvides the Jupyter notebooks used to generate the figures presented in the paper.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1992

Traffic routing for multicomputer networks with virtual cut-through capability

Consideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.

Kandlur, Dilip D.↗
NASA NTRS1994

High-performance parallel analysis of coupled problems for aircraft propulsion

This research program deals with the application of high-performance computing methods for the analysis of complete jet engines. We have entitled this program by applying the two dimensional parallel aeroelastic codes to the interior gas flow problem of a bypass jet engine. The fluid mesh generation, domain decomposition, and solution capabilities were successfully tested. We then focused attention on methodology for the partitioned analysis of the interaction of the gas flow with a flexible structure and with the fluid mesh motion that results from these structural displacements. This is treated by a new arbitrary Lagrangian-Eulerian (ALE) technique that models the fluid mesh motion as that of a fictitious mass-spring network. New partitioned analysis procedures to treat this coupled three-component problem are developed. These procedures involved delayed corrections and subcycling. Preliminary results on the stability, accuracy, and MPP computational efficiency are reported.

Felippa, C. A.↗
NASA NTRS1977

CAVE: A computer code for two-dimensional transient heating analysis of conceptual thermal protection systems for hypersonic vehicles

A digital computer code CAVE (Conduction Analysis Via Eigenvalues), which finds application in the analysis of two dimensional transient heating of hypersonic vehicles is described. The CAVE is written in FORTRAN 4 and is operational on both IBM 360-67 and CDC 6600 computers. The method of solution is a hybrid analytical numerical technique that is inherently stable permitting large time steps even with the best of conductors having the finest of mesh size. The aerodynamic heating boundary conditions are calculated by the code based on the input flight trajectory or can optionally be calculated external to the code and then entered as input data. The code computes the network conduction and convection links, as well as capacitance values, given basic geometrical and mesh sizes, for four generations (leading edges, cooled panels, X-24C structure and slabs). Input and output formats are presented and explained. Sample problems are included. A brief summary of the hybrid analytical-numerical technique, which utilizes eigenvalues (thermal frequencies) and eigenvectors (thermal mode vectors) is given along with aerodynamic heating equations that have been incorporated in the code and flow charts.

Rathjen, K. A.↗
DOE OSTI2024

Modeling the Effects of Artificial Drainage on Agriculture-Dominated Watersheds Using a Fully Distributed Integrated Hydrology Model

In agriculture-dominated watersheds where natural drainage is poor, agricultural ditches (narrow engineered channels) and tile drains (perforated pipes) are widely employed to enhance surface and subsurface drainage, respectively. Despite their relatively small scale, these features exert substantial control over the hydro-biogeochemical function of watersheds and their effects need to be represented in the models. We introduce a novel strategy to incorporate the effects of artificial agricultural drainage into a fully distributed basin-scale integrated surface-subsurface hydrology models. In our approach, narrow agriculture ditches for surface drainage are resolved efficiently using ditch-aligned computational meshes that are hydrologically conditioned to ensure connectivity in the stream/ditch network. For tile drainage in the subsurface, we use the physically based Hooghoudt's drainage equation as a subgrid model and route the water drained through tiles to the nearest ditch. Without site-specific calibration, this model reproduced observed streamflow in the Portage River Watershed (>1,000 km 2 ) as recorded by a USGS gauge with good accuracy (normalized KGE = 0.81) and outperformed a calibrated SWAT model (normalized KGE = 0.68). Numerical experiments confirm that artificial drainage reduces surface inundations and effectively controls the water table. At the watershed scale, artificial drainage increases baseflow but has little effect on watershed discharges above the 90th percentile. The strong physical underpinnings and reduced need for calibration allow us to study the impacts of artificial drainage on distributed hydrological response in terms of fluxes and states and provide a platform for investigating watershed-scale nutrient transport.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Synthetic Data Generation for 3D Mesh Prediction and Spatial Reasoning During Multi-Agent Robotic Missions

In-space assembly operations require accurate reasoning over the pose, location, and structural organization of both the autonomous agents and assembly materials. In a full six-degree-of-freedom space, an accurate understanding of the full three-dimensional structure of the object of interest greatly enriches information for pose estimation and collision planning. Current methods of predicting pose estimation require a priori understanding of the shape of the object. Additionally, visual information in the space environment is impacted by variations in contrast and illumination. Using synthetic data allows us to rapidly generate large datasets with in varying environments and lighting conditions.This work details the generation of synthetic data used to explore the use of a region-based convolutional neural networks to detect objects of interest and predict a voxel-based three-dimensional mesh in order to understand their full three-dimensional shape. This mesh provides useful spatial information during in-space assembly operations without requiring either the complexity of maintaining models over the progress of building an object or observations from multiple angles. The generated meshes are then compared to that of ground truth in order to measure its performance.

synthetic data↗
DOE OSTI2024

DECOVALEX-2023: Task F1 Final Report

DECOVALEX-2023 Task F is a comparison of models and methods for post-closure performance assessment (PA) of a deep geologic repository for radioactive waste. The general aims of Task F are to build confidence in the models, methods, and software used for PA and to stimulate additional research and development in PA methodologies. The task objectives are to motivate development of PA modelling skills and capabilities, to examine the influence of model choices on calculated repository performance, and to compare the uncertainties introduced by model choices to other sources of uncertainty. Task F involves no actual experiment or site. It is a PA modelling exercise that requires the conceptual development of hypothetical repository designs and geologic settings. Because three of the teams were interested in salt and the rest of the teams were interested in crystalline rock, Task F was split into two branches: Task F1 for crystalline rock and Task F2 for salt. This report is for Task F1, crystalline rock. Teams from seven countries (Canada, Czech Republic, Germany, Korea, Sweden, Taiwan, and United States) participated in Task F1. The teams worked together to define the features, events, and processes of the reference case repository and established a set of performance measures. In addition, they defined a set of benchmark problems designed to test and compare modelling capabilities for fracture flow and transport at different scales. The repository design and benchmark problems are documented in a Task Specification that evolved over time as the group honed the specifications. The benchmark problems verified that each team can aptly model flow and transport in fractured media in 1-, 2-, and 3-dimensions. Two general approaches were used for the 3-dimensional benchmarks: discrete fracture network (DFN) and equivalent continuous porous medium (ECPM). DFN modelling involves explicit meshing of each fracture while ECPM modelling aims to capture the effective porosity and directional permeability of each cell in a space-filling mesh as affected by intersecting fractures. In some models, a combination of the two is used, i.e., DFN for large known fractures and ECPM for the rest of the domain. Transport is solved by using either the advection-dispersion equation or particle tracking. Although some variation is observed among model breakthrough curves in the benchmark problems, there is strong agreement in breakthrough behaviour up to at least the 75 th percentile for all benchmarks. At the 90 th percentile, breakthrough results show larger differences, suggesting several models retain substantially higher fractions of tracer in regions of slower moving water. In addition to the flow and transport benchmarks, several teams completed the source term benchmark, verifying capabilities for modelling radionuclide decay and ingrowth, waste package breach, instant release fractions, fuel matrix degradation rates, and radionuclide solubility limitations. The reference case is conceptualized as a generic spent fuel repository at a depth of 450 m in fractured crystalline rock. The repository has 50 parallel backfilled drifts, each with 50 deposition holes 6 m apart. Each deposition hole contains a 4-PWR waste package and bentonite buffer. The rock domain is 5 km in length, 2 km in width, and 1 km in depth. It has 6 deterministic fractured deformation zones and a multitude of stochastic fractures. Teams generally used the ECPM approach for the entire rock or a hybrid approach in which the deterministic fracture zones are modelled with a DFN and the rest of the rock is modelled by ECPM. Of the reference case problems specified, only the results of the initial reference case problem are compared in this report. The initial problem focuses on transport from the deposition holes to the surface, i.e., it neglects waste package performance. Tracers are released at all waste package locations at time zero and tracked for their releases to the near field and ground surface. The water fluxes calculated at the ground surface entry and exit regions of the domain are similar for all models except for two that have considerably lower fluxes. For tracer transport, large differences are observed among models in the magnitude of tracer transported. Much of the difference appears to be due to how the repository is implemented and hence the different degrees of repository simplification. Models that exclude the drifts, buffer, and backfill from the domain tend to show greater release of tracers and radionuclides from the repository. The initial study presented here indicates that major differences in modelling important processes within the repository (e.g., diffusion through buffer and backfill) can produce broadly different release and transport results, especially when those processes are excluded. Even for the models that included all specified features, events, and processes, the results show significant differences and demonstrate the importance of examining multiple modelling approaches in performance assessment. The differences in results observed in this study are expected to motivate teams to either increase complexity in future versions of the reference case models or to improve methods to account for the effects of simplified features and processes. Either way, future improvements in these models are expected to produce results that more closely agree.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS2002

Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments

The problem of partitioning irregular graphs and meshes for parallel computations on homogeneous systems has been extensively studied. However, these partitioning schemes fail when the target system architecture exhibits heterogeneity in resource characteristics. With the emergence of technologies such as the Grid, it is imperative to study the partitioning problem taking into consideration the differing capabilities of such distributed heterogeneous systems. In our model, the heterogeneous system consists of processors with varying processing power and an underlying non-uniform communication network. We present in this paper a novel multilevel partitioning scheme for irregular graphs and meshes, that takes into account issues pertinent to Grid computing environments. Our partitioning algorithm, called MiniMax, generates and maps partitions onto a heterogeneous system with the objective of minimizing the maximum execution time of the parallel distributed application. For experimental performance study, we have considered both a realistic mesh problem from NASA as well as synthetic workloads. Simulation results demonstrate that MiniMax generates high quality partitions for various classes of applications targeted for parallel execution in a distributed heterogeneous environment.

Bisws, Rupak↗
NASA NTRS1993

Computation of signal delays in RC networks

A model for signal delay computation in RC networks is presented. The strength of the paradigm is its generality and simplicity. The definition of delay is applicable to RC meshes with potential resistive attenuating paths to ground. The algorithms can also be applied to undriven circuits (static charge sharing) and circuits with initial charge. To compute the delays, each node in the network is explored locally to derive a system of sparse linear equations. The solutions of the system are delay values based on the Elmore time constant at each point in the circuit.

Hidalgo, Juan Carlos↗
NASA NTRSDate not supplied

Synthetic Data Generation for 3D Mesh Prediction and Spatial Reasoning During Multi-Agent Robotic Missions

In-space assembly operations require accurate reasoning over the pose, location, and structural organization of both the autonomous agents and assembly materials. In a full six-degree-of-freedom space, an accurate understanding of the full three-dimensional structure of the object of interest greatly enriches information for pose estimation and collision planning. Current methods of predicting pose estimation require a priori understanding of the shape of the object. Additionally, visual information in the space environment is impacted by variations in contrast and illumination. Using synthetic data allows us to rapidly generate large datasets with in varying environments and lighting conditions. This work details the generation of synthetic data used to explore the use of a region-based convolutional neural networks to detect objects of interest and predict a voxel-based three-dimensional mesh in order to understand their full three-dimensional shape. This mesh provides useful spatial information during in-space assembly operations without requiring either the complexity of maintaining models over the progress of building an object or observations from multiple angles. The generated meshes are then compared to that of ground truth in order to measure its performance.

James Ecker↗
NASA NTRS1979

NASA's participation in the AVE-SESAME '79 program

NASA's Marshall Space Flight Center participated with its AVE (Atmospheric Variability Experiment) in a large interagency mesoscale and severe storms experiment identified herein as AVE-SESAME '79 (Atmospheric Variability Experiment-Severe Environmental Storms and Mesoscale Experiment 1979). A primary objective of NASA was to support an effort to acquire carefully edited sets of rawinsonde data during selected severe weather events for use in correlative and diagnostic studies with satellite and radar data obtained at approximately the same times. Data were acquired during six individual 24-h experiments on both the regional and storm scales over a network in the central United States that utilized approximately 20 supplemental rawinsonde sites meshed among 23 standard National Weather Service sites. Included among the six experiments are data obtained between 1200 GMT on April 10 and 1200 GMT on April 11, encompassing the formation and development period for the tornado-producing systems that devastated Wichita Falls, Texas, and other sections of Oklahoma and Texas. The other dates for which data sets are available are April 19-20 and 25-26, May 9-10 and 20-21, and June 7-8, 1979.

Hill, K.↗
NASA NTRS2017

Strategies Toward Automation of Overset Structured Surface Grid Generation

An outline of a strategy for automation of overset structured surface grid generation on complex geometries is described. The starting point of the process consists of an unstructured surface triangulation representation of the geometry derived from a native CAD, STEP, or IGES definition, and a set of discretized surface curves that captures all geometric features of interest. The procedure for surface grid generation is decomposed into an algebraic meshing step, a hyperbolic meshing step, and a gap-filling step. This paper will focus primarily on the high-level plan with details on the algebraic step. The algorithmic procedure for the algebraic step involves analyzing the topology of the network of surface curves, distributing grid points appropriately on these curves, identifying domains bounded by four curves that can be meshed algebraically, concatenating the resulting grids into fewer patches, and extending appropriate boundaries of the concatenated grids to provide proper overlap. Results are presented for grids created on various aerospace vehicle components.

overset↗
NASA NTRS2009

Solar Thermal Vacuum Test of Deployable Astromesh Reflector

On September 10, 2008, a 36-hour Solar Thermal Vacuum Test of a 5m deployable mesh reflector was completed in JPL's 25' Space Simulator by the Advanced Deployable Structures Group at JPL. The testing was performed under NASA's Innovative Partnership Program (IPP) as a risk reduction effort for two JPL Decadal Survey Missions: DESDynI and SMAP. The 5.0 m aperture Astromesh reflector was provided by Northrop Grumman Aerospace Systems (NGAS) Astro Aerospace, our IPP industry partner. The testing utilized a state-of-the-art photogrammetry system to measure deformation of the reflector under LN2 cold soak, 0.25 Earth sun, 0.5 sun and 1.0 sun. An intricate network of thermocouples (approximately 200 in total) was used to determine the localized temperature across the mesh as well as on the perimeter truss of the reflector. Half of the reflector was in a fixed shadow to maximize thermal gradients. A mobility system was built for remotely actuating the cryo-vacuum capable photogrammetry camera around the circumference of the Solar Simulator. Photogrammetric resolution of 0.025 mm RMS (0.001") was achieved over the entire 5 meter aperture for each test case. The data will be used for thermo-elastic model correlation and validation, which will benefit the planned Earth Science Missions.

Photogrammetry↗
NASA NTRS1996

Full Mesh Audio Conferencing Using the Point-to-Multipoint On-Board Switching Capability of ACTS

The purpose of this paper is to describe an implementation of audio conferencing using the ACTS T1-VSAT network. In particular, this implementation evaluates the use of the on-board switching capability of the satellite as a viable alternative for providing the multipoint connectivity normally provided by terrestrial audio bridge equipment The system that was implemented provides full mesh, full-duplex audio conferencing, with end-to-end voice paths between all participants requiring only a single hop (i.e. 250 msec. delay). Moreover, it addresses the lack of spontaneity in current systems by allowing a user to easily start a conference from any standard telephone handset connected to an ACTS earth station, and quickly add new members to the conference at any time using the 'hook flash' capability. No prior scheduling of resources is required and there is no central point of control, thereby providing the user with the spontaneity desired in audio conference control.

Rivett, Mary L.↗
DOE OSTI2025

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗
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↗