Search NASA⌕ Search

SEARCH · Search NASA

Results for “communication constraints”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Stochastic Gradient-Based Distributed Bayesian Estimation in Cooperative Sensor Networks

Distributed Bayesian inference provides a full quantification of uncertainty offering numerous advantages over point estimates that autonomous sensor networks are able to exploit. However, fully-decentralized Bayesian inference often requires large communication overheads and low network latency, resources that are not typically available in practical applications. In this paper, we propose a decentralized Bayesian inference approach based on stochastic gradient Langevin dynamics, which produces full posterior distributions at each of the nodes with significantly lower communication overhead. We provide analytical results on convergence of the proposed distributed algorithm to the centralized posterior, under typical network constraints. Finally, we also provide extensive simulation results to demonstrate the validity of the proposed approach.

42 ENGINEERING↗
DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗
DOE OSTI2021

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗
DOE OSTI2022

Ta compressibility to 20+ Mbar

Developing techniques for experimentally constraining equation of state (EOS) models for important programmatic materials under extreme conditions is vital for advancing our modeling and predictive capabilities. Tantalum is a frequently used standard material for both calibration and testing, and this report describes our work to both measure Ta compressibility to very high pressures and densities using the Ramp Compression Equation of State platform on the National Ignition Facility (NIF). Using a series of seven shots, increasing in peak pressure with each shot, we have made absolute measurements of the compressibility of Ta along the ramp compression path up to 2.3 TPa. Previous experimental measurements constrained the cold compressibility up to ~400 GPa, and there is a spread in the EOS models above that pressure. To improve communication and collaboration between the experimental team and the EOS development group, these new data, along with other experimental and theoretical constraints, were used to develop a Ta equation of state table, M73000. This report first describes the experimental measurements made at the NIF, and then discusses the construction of the EOS model. The ramp compression data can be found in tabular form in Appendix A. Appendix B contains some additional experimental details. In Appendix C we include some additional details on the EOS modeling. At the end of this document, we have attached a detailed report on the NIF ramp compression platform itself and in the main text referenced specific sections for additional details.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Distributed Coordination of Demand-side Flexible Resources in Microgrid with All-Time Feasibility

The prevalence of distributed renewable generators motivates microgrid operators to exploit demand-side flexible resources (DFRs). Due to their dispersed nature, distributed DFR coordination has been a vibrant research area, while there are several issues awaiting to be addressed. On one hand, DFR power is internally coupled through power flow, while DFR usually cannot access grid information. On the other hand, in time-restricted scenarios, solution feasibility cannot be guaranteed by conventional dual-based algorithms. To fill these gaps, we propose a distributed DFR coordination framework with all-time feasibility. The proposed framework accounts for the distinct access of microgrid entities to grid information. A distributed and all-time feasible algorithm is proposed for optimal DFR coordination, which allows DFRs to make local decisions without violating constraints throughout iterations. The effectiveness of the proposed algorithm is demonstrated through case studies. The impact of peer-to-peer communication links on algorithm convergence is also investigated, which emphasizes the balance between communication investment and algorithm performance.

Li, Hongyi [Iowa State Univ., Ames, IA (United Sta↗
DOE OSTI2021

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗
DOE OSTI2020

PMU and Communication Infrastructure Restoration for Post-Attack Observability Recovery of Power Grids

This paper is concerned about recovering the observability of cyber-physical power grids after massive cyber attacks, which helps to achieve the cyber-physical resilience of the grids. For recovering the observability of the grid, the measurability of the Phasor Measurement Units (PMUs) and the connectivity of the communication network are needed to be restored. The PMU and communication infrastructure restoration problem is jointly formulated as a Mixed Integer Linear Programming (MILP) problem to minimize the observability loss of the grid over time after a cyber attack while considering the constraint of limited resources. The efficacy of the proposed optimal restoration strategy is verified by comparing with heuristic methods on the IEEE 57-bus system.

cyber security↗
DOE OSTI2022

It's Not Just About the Megawatts - ARC Industry Forum, The Future of Power Generation

As the world transitions to less carbon intensive energy portfolios, much of the attention understandably centers on generating capacity – replacing megawatts of fossil fuel with megawatts of solar, wind, nuclear, hydroelectric, hydrogen, and more. The actual operation of a reliable grid needs more than just megawatts though: adequate quantities of a portfolio of essential reliability services; flexible and capable power delivery systems; governance to operate in 5-10 minute intervals, forecast hourly, and plan and build on a generational time horizon; and dependable and secure communications. We can choose our fuel mix for climate reasons, but the grid itself and the society that relies upon it impose constraints on those choices that we ignore at our peril.

13 HYDRO ENERGY↗
DOE OSTI2025

Demonstration of a Novel Technology to Manage Electricity Demand in Grid-Independent Military Microgrids

This research was conducted by the National Renewable Energy Laboratory (NREL) in collaboration with the S&C Electric Inc. through funding provided by the ESTCP. The project demonstrates use of cybersecure Automated Demand Response (ADR) technology to effectively manage microgrid loads during grid-independent, also known as "islanded," operation. When military microgrids become isolated from the main electrical grid, they are required to balance electricity supply and demand locally. Given that local generation may be constrained, the prevailing strategy involves shedding all but the most critical loads by tripping smart circuit breakers, which then necessitate manual resetting. This approach is generally implemented at the building level, which means that the buildings with mission-critical activities are exempt from load management and remain fully powered, whereas those deemed non-critical can experience a complete loss of service. In this research we developed a method that allows building automation systems to selectively control their assets in response to load shedding request from a microgrid controller, avoiding total loss of service in contrast to the conventional control approach. A commercial OpenADR client server by GridFabric is used for communication between the microgrid controller and the building management system (BMS). The microgrid controller monitors both generation capacity and various assets within the microgrid and issues a demand reduction request when necessary. This request is communicated to the OpenADR server via Modbus. Upon receiving the request, the OpenADR server forwards it to the BMS utilizing the OpenADR protocol. The BMS is pre-configured with various levels of load reduction strategies based on the controllable assets available, allowing for a nuanced approach to demand reduction. Both lab and field tests were performed that considered load shedding needed to achieve closed transition into island mode and to accommodate changing loads and power source availability while islanded. A commercial microgrid controller was used for these tests with normal programming within the expected constraints of the system capabilities. That is, the solution did not require any specialized modification to the code base of the controller. Given the latency of the round-trip communication path between the microgrid controller and the various devices involved with the load shed processes, there are certain scenarios for which the demonstrated solution are appropriate and some which are not. The methods described in this report can be used for load shedding/restoration during transitions between islanded and grid-tied modes of operation, as well as accommodating normal variations in load and the need to remove a power source from operation for maintenance. These methods should not be used for scenarios that require load shedding within a second or two such as sudden and unanticipated significant load increases or loss of power sources through equipment faults.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Toward a persistent event-streaming system for high-performance computing applications

High-performance computing (HPC) applications have traditionally relied on parallel file systems and file transfer services to manage data movement and storage. Alternative approaches have been proposed that use direct communications between application components, trading persistence and fault tolerance for speed. Event-driven architectures, as popularized in enterprise contexts, present a compelling middle ground, avoiding the performance cost and API constraints of parallel file systems while retaining persistence and offering impedance matching between application components. However, adapting streaming frameworks to HPC workloads requires addressing challenges unique to HPC systems. This paper investigates the potential for a streaming framework designed for HPC infrastructures and use cases. We introduce Mofka, a persistent event-streaming framework designed specifically for HPC environments. Mofka combines the capabilities of a traditional streaming service with optimizations tailored to the HPC context, such as support for massively multicore nodes, efficient scaling for large producer-consumer workflows, RDMA-enabled high-performance network communications, specialized network fabrics with multiple links per node, and efficient handling of large scientific data payloads. Built using the Mochi suite of HPC data service components, Mofka provides a lightweight, modular, and high-performance solution for persistent streaming in HPC systems. We present the architecture of Mofka and evaluate its performance against Kafka and Redpanda using benchmarks on diverse platforms, including Argonne's Polaris and Oak Ridge's Frontier supercomputers, showing up to 8× improvement in throughput in some scenarios. We then demonstrate its utility in several real-world applications: a tomographic reconstruction pipeline, a workflow for the discovery of metal-organic frameworks for carbon capture, and the instrumentation of Dask workflows for provenance tracking and performance analysis.

HPC↗
DOE OSTI2025

Model-Free Control of Grid-Interactive Efficient Buildings Under Communication Time Delays

Grid-interactive efficient buildings (GEBs) have recently been used to enhance the reliability and stability of the electric grid through demand response (DR) programs. However, most existing DR control strategies require accurate modeling of the various building thermostatically controlled loads (TCLs) and are computationally expensive. To address these challenges, a model-free control (MFC)-based strategy has recently been introduced for coordinating and controlling GEBs. MFC is a data-enabled control strategy that is computationally efficient and does not require the analytical models of the various building equipment. In this paper, we numerically investigate the impact of communication time delays on the performance of MFC in maintaining the TCLs' temperatures within the desired comfort levels while meeting the assigned power allocation constraint.

Telsang, Bhagyashri [University of Tennessee, Knox↗
DOE OSTI2020

Streaming authentication and multi-level security for communications networks using quantum cryptography

Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentication tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message transmitter outputs the message and its authentication tag. A message receiver receives a message and authentication tag for the message. The message receiver derives a comparison tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message receiver checks whether the message is authentic based on a comparison of the authentication tag and the comparison tag. In example implementations, the authenticator uses stream-wise cyclic redundancy code operations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Streaming authentication and multi-level security for communications networks using quantum cryptography

Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentication tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message transmitter outputs the message and its authentication tag. A message receiver receives a message and authentication tag for the message. The message receiver derives a comparison tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message receiver checks whether the message is authentic based on a comparison of the authentication tag and the comparison tag. In example implementations, the authenticator uses stream-wise cyclic redundancy code operations.

Hughes, Richard J.↗
DOE OSTI2022

Likelihood Maximization and Moment Matching in Low SNR Gaussian Mixture Models

We derive an asymptotic expansion for the log-likelihood of Gaussian mixture models (GMMs) with equal covariance matrices in the low signal-to-noise regime. The expansion reveals an intimate connection between two types of algorithms for parameter estimation: the method of moments and likelihood optimizing algorithms such as Expectation-Maximization (EM). We show that likelihood optimization in the low SNR regime reduces to a sequence of least squares optimization problems that match the moments of the estimate to the ground truth moments one by one. This connection is a stepping stone towards the analysis of EM and maximum likelihood estimation in a wide range of models. A motivating application for the study of low SNR mixture models is cryo-electron microscopy data, which can be modeled as a GMM with algebraic constraints imposed on the mixture centers. We discuss the application of our expansion to algebraically constrained GMMs, among other example models of interest. © 2022 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Review of Software for Designing and Operating Quantum Networks

Quantum networks development is crucial to realizing a production-grade network that can support distributed sensing, secure communication, and utility-scale quantum computation. However, the transition from laboratory demonstration to deployable networks requires software implementations of architectures and protocols tailored to the unique constraints of quantum systems. This paper reviews the current state of software implementations for quantum networks, organized around a three-plane abstraction of infrastructure, logical, and control/service planes. We cover software for both designing quantum network protocols (e.g., SeQUeNCe, QuISP, and NetSquid) and operating testbeds, with a focus on essential control/service plane functions such as entanglement, topology, and resource management, in a proposed taxonomy. Our review highlights a persistent gap between theoretical architecture and protocol proposals and their realization in simulators or testbeds, particularly in dynamic topology and network management. We conclude by outlining open challenges and proposing a roadmap for developing scalable software architectures to enable hybrid, large-scale quantum networks.

Network Design↗
DOE OSTI2022

Update on Covariance Data Testing Strategy at LANL [Slides]

LANL is working towards an ENDF/B-VIII.0-based Covariance Library, with several key goals and work processes outlined. This includes processing through NJOY’s ERRORR module, identifying and correcting mathematical and physical deficiencies, communicating across pipeline from evaluator to end user, understanding use cases and interpreting results, and releasing to customers. Their testing approach includes interaction, processing, checks (mathematical properties, constraints, and physical bounds), and error propagation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗
DOE OSTI2023

Technical descriptions of the experimental dynamical downscaling simulations over North America by the CAM–MPAS variable-resolution model

Abstract. Comprehensive assessment of climate datasets is important for communicating model projections and associated uncertainties to stakeholders. Uncertainties can arise not only from assumptions and biases within the model but also from external factors such as computational constraint and data processing. To understand sources of uncertainties in global variable-resolution (VR) dynamical downscaling, we produced a regional climate dataset using the Model for Prediction Across Scales (MPAS; dynamical core version 4.0) coupled to the Community Atmosphere Model (CAM; version 5.4), which we refer to as CAM–MPAS hereafter. This document provides technical details of the model configuration, simulations, computational requirements, post-processing, and data archive of the experimental CAM–MPAS downscaling data. The CAM–MPAS model is configured with VR meshes featuring higher resolutions over North America as well as quasi-uniform-resolution meshes across the globe. The dataset includes multiple uniform- (240 and 120 km) and variable-resolution (50–200, 25–100, and 12–46 km) simulations for both the present-day (1990–2010) and future (2080–2100) periods, closely following the protocol of the North American Coordinated Regional Climate Downscaling Experiment. A deviation from the protocol is the pseudo-warming experiment for the future period, using the ocean boundary conditions produced by adding the sea surface temperature and sea-ice changes from the low-resolution version of the Max Planck Institute Earth System Model (MPI-ESM-LR) in the Coupled Model Intercomparison Project Phase 5 to the present-day ocean state from a reanalysis product. Some unique aspects of global VR models are evaluated to provide background knowledge to data users and to explore good practices for modelers who use VR models for regional downscaling. In the coarse-resolution domain, strong resolution sensitivity of the hydrological cycles exists over the tropics but does not appear to affect the midlatitude circulations in the Northern Hemisphere, including the downscaling target of North America. The pseudo-warming experiment leads to similar responses of large-scale circulations to the imposed radiative and boundary forcings in the CAM–MPAS and MPI-ESM-LR models, but their climatological states in the historical period differ over various regions, including North America. Such differences are carried to the future period, suggesting the importance of the base state climatology. Within the refined domain, precipitation statistics improve with higher resolutions, and such statistical inference is verified to be negligibly influenced by horizontal remapping during post-processing. Limited (≈50 % slower) throughput of the current code is found on a recent many-core/wide-vector high-performance computing system, which limits the lengths of the 12–46 km simulations and indirectly affects sampling uncertainty. Our experience shows that global and technical aspects of the VR downscaling framework require further investigations to reduce uncertainties for regional climate projection.

58 GEOSCIENCES↗