Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network topologies”

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 829 records · Page 46

Optimal deployment of resources for maximizing impact in spreading processes

Significance Spreading processes play an increasingly important role in marketing, opinion setting, and epidemic modeling. Most existing algorithms for optimal resource allocation in spreading processes are based on topological characteristics of the underlying network and aim to maximize impact at infinite time. Clearly, realistic and efficient real-time allocation policies should consider both network properties and details of the dynamics; additionally, control may be applied only to a restricted set of accessible nodes, and impact should be maximized in a limited time window. We introduce a probabilistic targeting framework that incorporates the dynamics and encompasses previously considered optimization formulations. It is based on a scalable dynamic message-passing approach that allows for the solution of large real-world network instances.

60 APPLIED LIFE SCIENCES↗

Reactions of Water Molecules in Silica-Based Network Glasses

Given that H{sub 2}O dissolves minimally in quartz, the mechanism for the ubiquitous dissolution of H{sub 2}O in silica glasses has been a long-standing puzzle. We report first-principles calculations in prototype silica glass networks and identify the ring topologies that allow the exothermic dissolution of H{sub 2}O as geminate Si-O-H groups. The topological constraints of these reactions explain both the observed saturation of Si-O-H concentrations and the observed increase in the average Si-Si distance. In addition, calculations of H{sub 2}O and Si-O-H dissociation account for the observed response to radiation by wet thermally grown SiO{sub 2}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Sequential Distribution System Restoration via Graph-Reinforcement Learning

We report a distribution service restoration algorithm as a fundamental resilient paradigm for system operators provides an optimally coordinated, resilient solution to enhance the restoration performance. The restoration problem is formulated to coordinate distribution generators and controllable switches optimally. A model-based control scheme is usually designed to solve this problem, relying on a precise model and resulting in low scalability. To tackle these limitations, this work proposes a graph-reinforcement learning framework for the restoration problem. We link the power system topology with a graph convolutional network, which captures the complex mechanism of network restoration in power networks and understands the mutual interactions among controllable devices. Latent features over graphical power networks produced by graph convolutional layers are exploited to learn the control policy for network restoration using deep reinforcement learning. The solution scalability is guaranteed by modeling distributed generators as agents in a multi-agent environment and a proper pre-training paradigm. Comparative studies on IEEE 123-node and 8500-node test systems demonstrate the performance of the proposed solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Columbia University Synthetic Power Grid with Geographical Coordinates

The following data set is generated based on the statistical properties of the US Western Interconnection. This data set consists of four tables, each contained in a single comma-delimited CSV file. The files contain the data regarding the buses and lines in the synthetic network generated based on the topology of the Western Interconnection (WI) power grid.

synthetic data↗

Columbia University Synthetic Power Grid with Geographical Coordinates

The following data set is generated based on the statistical properties of the US Western Interconnection. This data set consists of four tables, each contained in a single comma-delimited CSV file. The files contain the data regarding the buses and lines in the synthetic network generated based on the topology of the Western Interconnection (WI) power grid.

Soltan, Saleh↗

Design and convergence analysis of the conforming virtual element method for polyharmonic problems

In the recent years, there has been a tremendous interest to numerical methods that approximate partial differential equations (PDEs) on computational meshes with arbitrarily-shaped polygonal/polyhedral (polytopal, for short) elements. A nonexhaustive list of such methods include the Mimetic Finite Difference method [4, 9, 21, 24, 28, 33, 35, 62, 64–67], the Polygonal Finite Element Method [68, 73, 74], the polygonal Discontinuous Galerkin Finite Element Methods [5, 7, 8, 10, 13–15, 18, 36, 38, 39, 41, 50], the Hybridizable Discontinuous Galerkin and Hybrid High-Order Methods [46–48, 51], the Gradient Discretization method [49, 53, 54], the Finite Volume Method [52], and the BEM-based FEM [71]. An alternative approach that also proved to be very successful is provided by the Virtual Element method (VEM), which was originally proposed in [19] for the numerical treatment of second-order elliptic problems [43, 44], and readily extended to linear and nonlinear elasticity [22, 25, 56], plate bending problems [37], Cahn-Hilliard equation [3], Stokes equations [2], Laplace-Beltrami equation [55], Darcy-Brinkam equation [76], discrete topology optimization problems [6], fracture networks problems [29], eigenvalue problems [59, 75]. The mixed virtual element formulation was proposed in [20, 34]; the nonconforming Virtual element formulations was proposed for second-order elliptic problems in [16], and later extended to general advection-reaction-diffusion problems, Stokes equation, the biharmonic problems, the iegenvalue problem, and the Schrodinger equation in [11, 30, 42, 45, 58, 80]. The p- and hp-version of the VEM were developed in [26, 27] and efficient multigrid methods for the resulting linear system of equations in [12]. A posteriori error estimates can be found in [40].

97 MATHEMATICS AND COMPUTING↗

Method for Coupled Electromagnetic and Circuit Simulations to Evaluate Surge Arrester Performance in Protecting Equipment Against E1 HEMP

Surge arrester behavioral modeling for realistic systems embedded in an E1 high-altitude electromagnetic pulse environment inherently encompasses three interconnected complications: (1) the need to account for signal propagation across two domains, electromagnetics and electrical; (2) the need to include both linear and nonlinear circuit components in the analysis; and (3) the need to understand that the over-current and over-voltage mitigation performance is dependent not only on the properties of the surge arrester and protected load but also on the topology of the overall electrical network. This study presents a framework to address these challenges in a systematic manner to consider the effectiveness of protective measures for a common class of equipment in power generation facilities. Full-wave simulations were carried out to derive circuit-domain (i.e., lumped element–based) equivalent models for the excitation waveform and the physical components of the system. Then, these equivalent models were imported to a circuit solver and combined with a high-frequency surge arrester model to evaluate mitigation performance. The methodology outlined is general enough such that it can be applied for other electromagnetic interference problems that involve E2/E3 HEMP or microwave emissions.

42 ENGINEERING↗

Wellbore Fracture Imaging Using Inflow Detection Measurements

One of the most striking measurements taken during DOE’s EGS Collab project at the 4850-foot depth location was the so-called ‘sewer cam’, which enabled direct visualization of the flow of water into the production well through fractures during the stimulation. The ability to see directly which fractures were flowing and (roughly) how much was a breakthrough in understanding the topology of the created fracture network. Achieving this kind of fracture flow imaging at FORGE would be more challenging because of the 225°C temperature, but equally or even more valuable if it could be achieved. In 2017, a joint project between Sandia and Stanford developed a downhole tool concept to measure the enthalpy of multiphase fluid entering a geothermal well from individual fractures (Gao et al., 2017). For the FORGE project, measuring enthalpy is of less interest because the fluid is expected to be single-phase liquid water. However, the foundation of the device was the measurement of chloride ion concentration, which could form the basis for a direct measurement of inflow from fractures. During the 2017 project, this novel chloride sensing system was implemented into a laboratory test instrument, and we confirmed the capability of the system to measure the ion concentration of fluid entering a model wellbore through a small entry port. The wellbore was a 6-inch diameter model well, and the port was approximately 0.08 inch (2mm) in diameter. The device could measure the chloride concentration accurately even when the well was flowing in a bubbly flow. Given its accuracy, the tool should be able to identify locations of water entering the wellbore even if the ion concentration differs only slightly from that of the water in the well. It is likely that different fractures may flow slightly different chloride concentrations, which would make it feasible to detect individual fractures as well as to estimate the volume of their flow. Ultimately, we could also recognize different fractures flowing back significantly different ion concentrations after fracturing in the FORGE wells. This could be realized by adding different ions in the fracturing fluids in different fractures created at different stages of stimulation (and modifying the tool to include different ion specificity). Sandia’s tool was shown during the study to have the capability to withstand the 225°C temperature, and the electrochemical sensing elements were tested in the laboratory to 225°C at 1500 psia for 24 hours. An early implementation of the fully integrated downhole electrochemical tool, including high-temperature electronics, robust housing, and wireline truck interface, had previously been constructed and tested successfully at Sandia; thus, hardware development tasks focused on advancing the technology readiness level (TRL) of this promising technology for FORGE deployment, rather than on developing a new scientific basis for its operation. The data collection electronics in this tool allowed for several other sensors (pressure, temperature, flow spinner) to be implemented in parallel as well. The research was a new collaboration between Stanford and Sandia to modify and refine the tool for FORGE deployment, to make the downhole measurements, and to characterize the evolving fractures.

15 GEOTHERMAL ENERGY↗

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗

Distributed Spacecraft Autonomy (DSA): Development of Swarm Autonomy Capability and Scalability for Spacecraft

The Distributed Spacecraft Autonomy project is developing a suite of software tools that enable an operator to command and receive data from a swarm as a single entity, enable a swarm to autonomously coordinate its actions via distributed decision making and reactive closed-loop control, and model swarm behavior in the presence of anomalies or failures. Our use case is the mapping of the electron density of the ionosphere using radio tomography by coordinating the selection of appropriate GPS channels, and by recording Total Electron Count (TEC)measurements. DSA will be demonstrated on board the NASA Ames Starling mission a swarm of four small, LEO spacecraft, scheduled to launch in 2021. We will also perform a ground demonstration with simulated and hardware-in-the-loop elements, to validate the tools for controlling swarms of up to 100 assets.The capability to communicate autonomously between the swarm satellites is demonstrated via a sophisticated simulation architecture. Historical Plasma sphere TEC data obtained via dual-band Novatel GPS Receivers are utilized as a representative input data set for the swarm. The representative TEC data and GPS satellite observability information is fed to the autonomous software package in place of a true real-time ground data collection process. The swarm satellites actively share status updates amongst one another and utilize multi-agent decision making to optimally identify regions of interest in the TEC distribution. The software,aware of the bandwidth limitations of the swarm satellites, prioritizes explorative measurements,which define the range of observability for the satellites, as well as exploitative measurements,which focus on maximizing the observance potential of regions with prolonged, elevated TEC density. The science of this study can ultimately be used to determine the dynamics and coupling of Earth's magnetosphere, ionosphere, and atmosphere and their response to solar and terrestrial inputs. The findings can be applied to the imaging of critical, transient phenomena in the magnetosphere in later missions. Meanwhile, the swarm autonomy capabilities have far reaching potential in future satellite missions.As an experimental demonstration of the autonomous capabilities of the network, a message is first printed within a core Flight Executive (cFE) application. Two cFE applications that communicate with one another within the same core Flight System (cFS) are shown.Communication between mission applications on the internal cFE bus is extended to utilize Data Distribution Service (DDS) for vehicle-to-vehicle networking. The DDS middle ware provides reliable delivery, routing, and topic subscription features over User Data gram Protocol (UDP).Leveraging Linux containerization, a networked set of satellite instances are generated by script to simulate swarm behavior. Swarm commanding and synchronization through the network is demonstrated under various topologies and data-loss conditions. Finally, autonomous swarms calability from 2 satellites to 100 satellites is shown.

Fugate, Jason↗

Distributed Spacecraft Autonomy - Development of Swarm Autonomy Capability and Scalability for Spacecraft

The Distributed Spacecraft Autonomy project is developing a suite of software tools that enable an operator to command and receive data from a swarm as a single entity, enable a swarm to autonomously coordinate its actions via distributed decision making and reactive closed-loop control, and model swarm behavior in the presence of anomalies or failures. Our use case is the mapping of the electron density of the ionosphere using radio tomography by coordinating the selection of appropriate GPS channels, and by recording Total Electron Count (TEC) measurements. DSA will be demonstrated onboard the NASA Ames Starling mission – a swarm of four small, LEO spacecraft, scheduled to launch in 2021. We will also perform a ground demonstration with simulated and hardware-in-the-loop elements, to validate the tools for controlling swarms of up to 100 assets. The capability to communicate autonomously between the swarm satellites is demonstrated via a sophisticated simulation architecture. Historical Plasmasphere TEC data obtained via dual-band Novatel GPS Receivers are utilized as a representative input dataset for the swarm. The representative TEC data and GPS satellite observability information is fed to the autonomous software package in place of a true real-time ground data collection process. The swarm satellites actively share status updates amongst one another and utilize multi-agent decision making to optimally identify regions of interest in the TEC distribution. The software, aware of the bandwidth limitations of the swarm satellites, prioritizes explorative measurements, which define the range of observability for the satellites, as well as exploitative measurements, which focus on maximizing the observance potential of regions with prolonged, elevated TEC density. The science of this study can ultimately be used to determine the dynamics and coupling of Earth’s magnetosphere, ionosphere, and atmosphere and their response to solar and terrestrial inputs. The findings can be applied to the imaging of critical, transient phenomena in the magnetosphere in later missions. Meanwhile, the swarm autonomy capabilities have far reaching potential in future satellite missions. As an experimental demonstration of the autonomous capabilities of the network, a message is first printed within a core Flight Executive (cFE) application. Two cFE applications that communicate with one another within the same core Flight System (cFS) are shown. Communication between mission applications on the internal cFE bus is extended to utilize Data Distribution Service (DDS) for vehicle-to-vehicle networking. The DDS middleware provides reliable delivery, routing, and topic subscription features over User Datagram Protocol (UDP). Leveraging Linux containerization, a networked set of satellite instances are generated by script to simulate swarm behavior. Swarm commanding and synchronization through the network is demonstrated under various topologies and data-loss conditions. Finally, autonomous swarm scalability from 2 satellites to 100 satellites is shown.

Distributed Autonomy↗

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

Spacecraft formation flying involves the coordination of states among multiple spacecraft through relative sensing, inter-spacecraft communication, and control. Most existing formation-flying estimation algorithms can only be supported via highly centralized, all-to-all, static relative sensing. New algorithms are proposed that are scalable, modular, and robust to variations in the topology and link characteristics of the formation exchange network. These distributed algorithms rely on a local information exchange network, relaxing the assumptions on existing algorithms. Distributed space systems rely on a signal transmission network among multiple spacecraft for their operation. Control and coordination among multiple spacecraft in a formation is facilitated via a network of relative sensing and interspacecraft communications. Guidance, navigation, and control rely on the sensing network. This network becomes more complex the more spacecraft are added, or as mission requirements become more complex. The observability of a formation state was observed by a set of local observations from a particular node in the formation. Formation observability can be parameterized in terms of the matrices appearing in the formation dynamics and observation matrices. An agreement protocol was used as a mechanism for observing formation states from local measurements. An agreement protocol is essentially an unforced dynamic system whose trajectory is governed by the interconnection geometry and initial condition of each node, with a goal of reaching a common value of interest. The observability of the interconnected system depends on the geometry of the network, as well as the position of the observer relative to the topology. For the first time, critical GN&C (guidance, navigation, and control estimation) subsystems are synthesized by bringing the contribution of the spacecraft information-exchange network to the forefront of algorithmic analysis and design. The result is a formation estimation algorithm that is modular and robust to variations in the topology and link properties of the underlying formation network.

Fathpour, Nanaz↗

Signal-Anticipation in Local Voltage Control in Distribution Systems

We consider the signal-anticipating behavior in local Volt/Var control for distribution systems. Such a behavior makes interaction among the nodes a game. We characterize Nash equilibrium of the game as the optimum of a global optimization problem and establish its asymptotic global stability. We also show that the signal-anticipating voltage control has less restrictive convergence condition than the signal-taking control. We then introduce the notion of price of signal-anticipation (PoSA) to characterize the impact of signal-anticipating control, and use the gap in cost between network equilibrium in the signal-taking control and Nash equilibrium in the signal-anticipating control as the metric for PoSA. We characterize how the PoSA scales with the size, topology, and heterogeneity of the distribution network for a few network settings. Our results show that the PoSA is upper bounded by a constant and the average PoSA per node will go to zero as the size of the network increases. This is desirable as it means that the PoSA will not be arbitrarily large, no matter what the size of the network is, and no mechanism is needed to mitigate the signal-anticipating behavior. We further carry out numerical experiments with a real-world distribution circuit to complement the theoretical analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Resilient Disaster Recovery Logistics of Distribution Systems: Co-Optimize Service Restoration With Repair Crew and Mobile Power Source Dispatch

Repair crews (RCs) and mobile power sources (MPSs) are critical resources for distribution system (DS) outage management after a natural disaster. However, their logistics have not been well investigated. We propose a resilient scheme for disaster recovery logistics to co-optimize DS restoration with the dispatch of RCs and MPSs. A novel co-optimization model is formulated to route RCs and MPSs in the transportation network, schedule them in the DS, and reconfigure the DS for microgrid formation coordinately, etc. The model incorporates different timescales of DS restoration and RC/MPS dispatch, the coupling of transportation and power networks, etc. To ensure radiality of the DS with variable physical structure and MPS allocation, we also model topology constraints based on the concept of spanning forest. The model is convexified equivalently and linearized into a mixed-integer linear programming. To reduce its computation time, preprocessing methods are proposed to preassign a minimal set of repair tasks to depots and reduce the number of candidate nodes for MPS connection. Resilient recovery strategies thus are generated to enhance service restoration, especially by dynamic formation of microgrids that are powered by MPSs and topologized by repair actions of RCs and network reconfiguration of the DS. Case studies demonstrate the proposed methodology.

Disaster recovery logistics↗

An in-depth longitudinal analysis of mixing patterns in a small scientific collaboration network

Many investigations of scientific collaboration are based on large-scale statistical analyses of networks constructed from bibliographic repositories. These investigations often rely on a wealth of bibliographic data, but very little or no other information about the individuals in the network, and thus, fail to illustate the broader social and academic landscape in which collaboration takes place. In this article, we perform an in-depth longitudinal analysis of a small-scale network of scientific collaboration (N = 291) constructed from the bibliographic record of a research center involved in the development and application of sensor network technologies. We perform a preliminary analysis of selected structural properties of the network, computing its range, configuration and topology. We then support our preliminary statistical analysis with an in-depth temporal investigation of the assortativity mixing of these node characteristics: academic department, affiliation, position, and country of origin of the individuals in the network. Our qualitative analysis of mixing patterns offers clues as to the nature of the scientific community being modeled in relation to its organizational, disciplinary, institutional, and international arrangements of collaboration.

99 GENERAL AND MISCELLANEOUS↗

Distributed topology control algorithm for multihop wireless netoworks

We present a network initialization algorithmfor wireless networks with distributed intelligence. Each node (agent) has only local, incomplete knowledge and it must make local decisions to meet a predefined global objective. Our objective is to use power control to establish a topology based onthe relative neighborhood graph which has good overall performance in terms of power usage, low interference, and reliability.

topology control distributed algorithm wireless ne↗