SEARCH · Engineering Papers

Results for “ROUTING”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Multi-Flight Common Routes

Flights often experience large delays when they are routed around weather. Multi-flight common routes advisories provide delay recovery by suggesting time-saving re-routes for groups of flights whose current weather-avoidance routes have become outdated because the weather has dissipated and/or moved away. The multi-flight common routes tool provides time-saving route change advisories taking into account flight plans, wind fields, and the spatio-temporal evolution of predicted convective weather. A graphical user interface enables these advisories to be easily modified by a traffic manager for possible operational implementation.

ATD-3↗

NASA NTRSDate not supplied

Cooperative Clustering Techniques Applied to Contact Graph Routing

Routing in the space internet has to face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this presentation we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. Finally, we propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol.

Yael Kirkpatrick↗

NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Monte Carlo Tree Search Approach

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗

NASA NTRSDate not supplied

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↗

DOE OSTI2013

Zone routing in a torus network

A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Dynamic traffic routing in a network with adaptive signal control

In real traffic networks, travellers’ route choice is affected by traffic control strategies. In this work, we capture the interaction between travellers’ route choice and traffic signal control in a coherent framework. For travellers’ route choice, a VANET (Vehicular Ad hoc NETwork) is considered, where travellers have access to the real-time traffic information through V2V/V2I (Vehicle to Vehicle/Vehicle to Infrastructure) infrastructures and make route choice decisions at each intersection using hyper-path trees. We test our algorithm and control strategy by simulation in OmNet++ (A network communication simulator) and SUMO (Simulation of Urban MObility) under several scenarios. The simulation results show that with the proposed dynamic routing, the overall travel cost significantly decreases. Lastly, it is also shown that the proposed adaptive signal control reduces the average delay effectively, as well as reduces the fluctuation of the average speed within the whole network.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Evaluation of Flow Routing on the Unstructured Voronoi Meshes in Earth System Modeling

Flow routing is a fundamental process of Earth System Models' (ESMs) river component. Traditional flow routing models rely on Cartesian rectangular meshes, which exhibit limitations, particularly when coupled with unstructured mesh-based ocean components. They also lack the support for regionally refined models. While previous studies have highlighted the potential benefits of unstructured meshes for flow routing, their widespread application and comprehensive evaluation within ESMs remain limited. This study extends the river component of the Energy Exascale Earth System Model to unstructured Voronoi meshes. We evaluated the model's performance in simulating river discharge and water depth across three watersheds spanning the Arctic, temperate, and tropical regions. The results show that while providing several benefits, unstructured mesh-based flow routing can achieve comparable performance to structured mesh-based routing, and their difference is often less than 10%. Although the unstructured mesh-based method could address several existing limitations, this research also shows that additional improvements in the numerical method are needed to fully exploit the advantages of unstructured mesh for hydrologic and ESMs.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2015

Capacitated arc routing problem and its extensions in waste collection

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2018

TPR: Traffic Pattern-based Adaptive Routing for Dragonfly Networks

The Cray Cascade architecture uses Dragonfly as its interconnect topology and employs a globally adaptive routing scheme called UGAL. UGAL directs traffic based on link loads but may make inappropriate adaptive routing decisions in various situations, which degrades its performance. Here in this work, we propose traffic pattern-based adaptive routing (TPR) for Dragonfly that improves UGAL by incorporating a traffic pattern-based adaptation mechanism. The idea is to explicitly use the link usage statistics that are collected in performance counters to infer the traffic pattern, and to take the inferred traffic pattern plus link loads into consideration when making adaptive routing decisions. Furthermore, our performance evaluation results on a diverse set of traffic conditions indicate that by incorporating the traffic pattern-based adaptation mechanism, TPR is much more effective in making adaptive routing decisions and achieves significant lower latency under low load and higher throughput under high load than its underlying UGAL.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

A Physically Based Runoff Routing Model for Land Surface and Earth System Models

A new physically based runoff routing model, called the Model for Scale Adaptive River Transport (MOSART), has been developed to be applicable across local, regional, and global scales. Within each spatial unit, surface runoff is first routed across hillslopes and then discharged along with subsurface runoff into a ‘‘tributary subnetwork’’ before entering the main channel. The spatial units are thus linked via routing through the main channel network, which is constructed in a scale-consistent way across different spatial resolutions. All model parameters are physically based, and only a small subset requires calibration.MOSART has been applied to the Columbia River basin at 1/ 168, 1/ 88, 1/ 48, and 1/ 28 spatial resolutions and was evaluated using naturalized or observed streamflow at a number of gauge stations. MOSART is compared to two other routing models widely used with land surface models, the River Transport Model (RTM) in the Community Land Model (CLM) and the Lohmann routing model, included as a postprocessor in the Variable Infiltration Capacity (VIC) model package, yielding consistent performance at multiple resolutions. MOSART is further evaluated using the channel velocities derived from field measurements or a hydraulic model at various locations and is shown to be capable of producing the seasonal variation and magnitude of channel velocities reasonably well at different resolutions. Moreover, the impacts of spatial resolution on model simulations are systematically examined at local and regional scales. Finally, the limitations ofMOSART and future directions for improvements are discussed.

runoff routing, scale adaptive↗

DOE OSTI2019

City-Wide Eco-Routing Navigation Considering Vehicular Communication Impacts

Intelligent Transportation Systems (ITSs) utilize Vehicular Ad-hoc Networks (VANETs) to collect, disseminate, and share data with the Traffic Management Center (TMC) and different actuators. Consequently, packet drop and delay in VANETs can significantly impact ITS performance. Feedback-based eco-routing (FB-ECO) is a promising ITS technology, which is expected to reduce vehicle fuel/energy consumption and pollutant emissions by routing drivers through the most environmentally friendly routes. To compute these routes, the FB-ECO utilizes VANET communication to update link costs in real-time, based on the experiences of other vehicles in the system. In this paper, we study the impact of vehicular communication on FB-ECO navigation performance in a large-scale real network with realistic calibrated traffic demand data. We conduct this study at different market penetration rates and different congestion levels. We start by conducting a sensitivity analysis of the market penetration rate on the FB-ECO system performance, and its network-wide impacts considering ideal communication. Subsequently, we study the impact of the communication network on system performance for different market penetration levels, considering the communication system. The results demonstrate that, for market penetration levels less than 30%, the eco-routing system performs adequately in both the ideal and realistic communication scenarios. It also shows that, for realistic communication, increasing the market penetration rate results in a network-wide degradation of the system performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Discrete global grid system-based flow routing datasets in the Amazon and Yukon basins

Abstract. Discrete global grid systems (DGGS) are emerging spatial data structures widely used to organize geospatial datasets across scales. While DGGS have found applications in various scientific disciplines, including atmospheric science and ecology, their integration into physically based hydrological models and Earth system models (ESMs) has been hindered by the lack of flow routing datasets based on DGGS. In response to this gap, this study pioneers the development of new flow routing datasets using icosahedral Snyder equal-area (ISEA) DGGS and a novel mesh-independent flow direction model. We present flow routing datasets for two large basins, the tropical Amazon River basin and the Arctic Yukon River basin. These datasets (1) facilitate the adoption of DGGS for hydrological models and (2) provide flow routing inputs for evaluation of DGGS-based flow routing in the Amazon and Yukon river basins. The data are available at https://doi.org/10.5281/zenodo.8377765 (Liao, 2023).

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS2016

Toward a Unified Routing Framework for Delay-Tolerant Networking

Routing in Delay-/Disruption-Tolerant Networking (DTN) has long been recognized as a challenging research topic. The difficulty lies in the fact that link intermittency and network partitioning, possibly coupled with long delays, prevent the use of Internet solutions based on an up-to-date comprehensive knowledge of network topology, as communicated by routing protocols. In the literature on DTN routing, there is a dichotomy between solutions designed for deterministic (e.g., space flight) networks, such as Contact Graph Routing (CGR), and the wide variety of protocols designed for opportunistic terrestrial networks. After a discussion of the origin and motivations of this duality, the paper presents an opportunistic extension of CGR (OCGR). The aim is to try to resolve the DTN routing dichotomy by providing a unified approach suitable for all DTN environments.

Routing↗

DOE OSTI2015

Future beam experiments in the magnetosphere with plasma contactors: The electron collection and ion emission routes

Experiments where a high-voltage electron beam emitted by a spacecraft in the low-density magnetosphere is used to probe the magnetospheric configuration could greatly enhance our understanding of the near-Earth environment. Their challenge, however, resides in the fact that the background magnetospheric plasma cannot provide a return current that balances the electron beam current without charging the spacecraft to such high potential that in practice prevents beam emission. In order to overcome this problem, a possible solution is based on the emission of a high-density contactor plasma by the spacecraft prior to and after the beam. In this paper, we perform particle-in-cell simulations to investigate the conditions under which a high-voltage electron beam can be emitted from a magnetospheric spacecraft, comparing two possible routes that rely on the high-density contactor plasma. The first is an “electron collection” route, where the contactor has lower current than the electron beam and is used with the goal of connecting to the background plasma and collecting magnetospheric electrons over a much larger area than that allowed by the spacecraft alone. The second is an “ion emission” route, where the contactor has higher current than the electron beam. Ion emission is then enabled over the large quasi-spherical area of the contactor cloud, thus overcoming the space charge limits typical of ion beam emission. Finally, our results indicate that the ion emission route offers a pathway for performing beam experiments in the low-density magnetosphere, while the electron collection route is not viable because the contactor fails to draw a large neutralizing current from the background.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

Techno-economic optimization of shale gas to dimethyl ether production processes via direct and indirect synthesis routes

The shale gas to dimethyl ether process via direct synthesis route with a syngas H2/CO=1 has a higher dimethyl ether yield than that via indirect synthesis route. However, the direct synthesis route involves various energy and capital-intensive processes, such as the complicated dimethyl ether separation process, and the CO2 recycle and comprssion process. In this study, a techno-economic analysis of the shale gas to dimethyl ether process via direct and indirect synthesis routes is performed using Aspen Process Economic Analyzer based on the rigorous process model developed in Aspen Plus. Effects of different CO2 removal technologies and dimethyl ether synthesis technologies from syngas are evaluated. Both, direct and indirect plants are optimized in Aspen Plus equation-oriented environment using the rigorous process models. The effects of key design parameters (i.e. H2/CO in the syngas) as well as investment parameters (i.e. prices of raw materials, products, and utilities, plant scale) on the process economics as been evaluated. The direct dimethyl ether synthesis route processing a syngas with H2/CO =1 and using the Rectisol process for CO2 capture has the highest overall thermal efficiency on the lower heat value basis is found to be much lower than the current U.S. market diesel price indicating the feasibility of the process.

Mevawala, Chirag↗

DOE OSTI2011

Profiling of Volatile Impurities in Tetramethylenedisulfotetramine (TETS) for Synthetic-Route Determination

This study investigated the feasibility of using volatile impurities from the rodenticide tetramethylenedisulfotetramine (TETS) for the discrimination of TETS produced by three synthetic routes. Each route was used to make one batch of TETS by reacting sulfamide with one of three formaldehyde analogs in the presence of either trifluroacetic acid (TFA) or hydrochloric acid. Ten impurities useful for differentiating the three TETS batches were sampled and tentatively identified by headspace solid-phase microextraction comprehensive two-dimensional gas chromatography-mass spectrometry (HS-SPME/GC x CG-MS). Of the ten identified impurities, the alkyl trifluoroacetate and alkyl chloride impurities distinguished TETS routes based on their use of either TFA or HCl as catalyst. On the other hand, four 6-carbon ketone impurities appeared to be batch specific rather than route specific and hence potentially useful for sample matching. Interestingly, 1,3,5-trioxane was not found in the TETS batch where it was used as a reactant, but instead was found in the two batches that did not have 1,3,5-trioxane as the reactant. In summary, the limited work discussed in this paper supports: (1) the feasibility of sampling and detecting volatile organic impurities from a solid chemical-threat agent, (2) the probable forensic benefit of catalysts acting as reactants in side reactions, (3) the uniqueness of a synthetic batch’s impurity profile for potential sample matching, and (4) the possibility that some impurities, such as formaldehyde analogs, are not forensically helpful and may lead to an incorrect estimate about the synthetic route if not supported by sound chemical knowledge.

Fraga, Carlos G.↗

DOE OSTI2012

Synthesis of high intrinsic loss power aqueous ferrofluids of iron oxide nanoparticles by citric acid-assisted hydrothermal-reduction route

Monodispersed aqueous ferrofluids of iron oxide nanoparticle were synthesized by hydrothermal-reduction route. They were characterized by X-ray diffraction analysis, Fourier transform infrared spectroscopy, scanning and transmission electron microscopy and dynamic light scattering. The results showed that certain concentrations of citric acid (CA) are required to obtain only magnetic iron oxides with mean particle sizes around 8 nm. CA acts as a modulator and reducing agent in iron oxide formation which controls nanoparticle size. The XRD, magnetic and heating measurements showed that the temperature and time of hydrothermal reaction can affect the magnetic properties of obtained ferrofluids. The synthesized ferrofluids were stable at pH 7. Their mean hydrodynamic size was around 80 nm with polydispersity index (PDI) of 0.158. The calculated intrinsic loss power (ILP) was 9.4 nHm{sup 2}/kg. So this clean and cheap route is an efficient way to synthesize high ILP aqueous ferrofluids applicable in magnetic hyperthermia. - Graphical abstract: Monodispersed aqueous ferrofluids of iron oxide nanoparticles were synthesized by hydrothermal-reduction method with citric acid as reductant which is an efficient way to synthesize aqueous ferrofluids applicable in magnetic hyperthermia. Highlights: Black-Right-Pointing-Pointer Aqueous iron oxide ferrofluids were synthesized by hydrothermal-reduction route. Black-Right-Pointing-Pointer Citric acid acted as reducing agent and surfactant in the route. Black-Right-Pointing-Pointer This is a facile, low energy and environmental friendly route. Black-Right-Pointing-Pointer The aqueous iron oxide ferrofluids were monodispersed and stable at pH of 7. Black-Right-Pointing-Pointer The calculated intrinsic loss power of the synthesized ferrofluids was very high.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2010

A study of the composition and microstructure of nanodispersed Cu-Ni alloys obtained by different routes from copper and nickel oxides

Mixtures of CuO and NiO were prepared by two different techniques, and then the oxides were reduced with H{sub 2}. Method A involved the preparation of mechanical mixtures of CuO and NiO using different milling and pelletizing processes. Method B involved the chemical synthesis of the mixture of CuO and NiO. The route used to prepare the copper and nickel oxide mixture was found to have great influence on the characteristics of bimetallic Cu-Ni particles obtained. Observations performed using the X-ray diffraction (XRD) technique showed that although both methods led to the Cu-Ni solid solution, the diffractogram of the alloy obtained with method A revealed the presence of NiO together with the alloy. The temperature-programmed reduction (TPR) experiments indicated that the alloy is formed at lower temperatures when using method B. The scanning electron microscopy (SEM) studies revealed notable differences in the morphology and size distribution of the bimetallic particles synthesized by different routes. The results of the electron probe microanalysis (EPMA) studies evidenced the existence of a small amount of oxygen in both cases and demonstrated that the alloy synthesized using method B presented a homogeneous composition with a Cu-Ni ratio close to 1:1. On the contrary, the alloy obtained using method A was not homogeneous in all the volume of the solid. The homogeneity depended on the mechanical treatment undergone by the mixture of the oxides. - Research Highlights: {yields}Study of the properties of Cu-Ni alloys synthesized by two different routes. {yields}Mixtures of Cu and Ni oxides prepared by two techniques were reduced with H{sub 2}. {yields}Mixtures of oxides were obtained by a mechanical process and the citrate-gel route. {yields}The characterizations were carried out by TPR, XRD, SEM and EPMA. {yields}The route used to prepare oxide mixtures influences on the Cu-Ni alloy obtained.

36 MATERIALS SCIENCE↗