Search NASASearch

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 19 records

Distributed Inertia Management Under Communication Constraints

This paper presents a framework for distributed inertia management based on consensus algorithm. We propose a methodology to achieve optimal operation of inertia sources such as distributed energy resources (DERs) and synchronous generators in real time. Additionally, we analyze the algorithm under communication constraints and evaluate its robustness under scenarios involving communication time delays and packet losses. The proposed approach is validated via simulations on a 4-node system test feeder, demonstrating its effectiveness and resilience.

Yadav, Ajay [ORNL] (ORCID:000000016111881X)

Trajectory Shaper: A Solution for Disrupted Cooperative Adaptive Cruise Control

Cooperative adaptive cruise control (CACC) can effectively reduce energy consumption, alleviate traffic congestion, and enhance safety. However, communication-related constraints and uncooperative vehicle users can disrupt CACC during real-world operations, significantly undermining the putative benefits of CACC. To alleviate the negative impacts of disrupted CACC, this study develops the trajectory shaper (TS) methods as backup solutions for two scenarios: (i) communication between vehicles is infeasible, and vehicles execute adaptive cruise control (ACC) using local sensor measurements; (ii) follower vehicles reject forming a cooperative platoon and execute their local distributed controllers using the information attained via communication. When communication is infeasible, a distributed TS is devised on each vehicle to modify the sensor measurements, enabling safe and efficient ACC operations. When communication is available but uncooperative agents are involved, the lead vehicle of the platoon executes a centralized TS to modify the information shared with uncooperative agents, achieving optimal platoon-level performance. The centralized and distributed TSs are implemented based on the model predictive control algorithms to yield optimal modifications on input information. Robustness is also factored to tackle model uncertainties during TS operations to ensure safety and efficiency. Numerical experiments validate the control performance of the proposed TSs.

Zhou, Anye [ORNL] (ORCID:0000000301455579)

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan

Consensus-Based Control and Optimization of Power System Inertia

The integration of distributed energy resources (DERs), such as solar, wind, and energy storage systems, into power grids through inverter-based resources reduces power system inertia, leading to faster frequency dynamics and potential grid instability. To address this challenge, this paper proposes a distributed, consensus-based approach for the real-time control and optimization of inertia sources (synchronous generators and/or DERs) during system disturbances, enhancing both system stability and economic performance. The distributed control and optimization approach assumes each inertia source exchanges information solely with its neighbor ones, making it easily scalable to large power grid networks. The impacts of the communication connectivity among the inertia sources as well as their generation capacity limits on the distributed approach are investigated. We also demonstrate the approach’s robustness in scenarios involving communication time delays and packet losses, validating its effectiveness through numerical simulations on a 4-bus test system and a two-area 8-bus test system.

Power system inertia

Reinforcement Learning-Based Secondary Control Strategy for Voltage and Frequency Regulation in Islanded Inverter-Based Microgrids

This paper presents a reinforcement learning (RL) approach for secondary voltage and frequency control in islanded inverter-based microgrids. The proposed control strategy aims to restore voltage and frequency deviations caused by the primary droop control while ensuring proper power sharing between distributed generators. The RL agent is designed to provide correction signals to the primary control, considering communication delays and system constraints. The effectiveness of the proposed control strategy is validated through simulation results in MATLAB/Simulink environment, demonstrating superior performance in maintaining voltage and frequency within the nominal values.

Rodriguez Martinez, Omar Felipe [University of Pue

What exactly does Bekenstein bound?

The Bekenstein bound posits a maximum entropy for matter with finite energy confined to a spatial region. It is often interpreted as a fundamental limit on the information that can be stored by physical objects. In this work, we test this interpretation by asking whether the Bekenstein bound imposes constraints on a channel's communication capacity, a context in which information can be given a mathematically rigorous and operationally meaningful definition. We study specifically the Unruh channel that describes a stationary Alice exciting different species of free scalar fields to send information to an accelerating Bob, who is confined to a Rindler wedge and exposed to the noise of Unruh radiation. We show that the classical and quantum capacities of the Unruh channel obey the Bekenstein bound that pertains to the decoder Bob. In contrast, even at high temperatures, the Unruh channel can transmit a significant number of zero-bits , which are quantum communication resources that can be used for quantum identification and many other primitive protocols. Therefore, unlike classical bits and qubits, zero-bits and their associated information processing capability are generally not constrained by the Bekenstein bound. However, we further show that when both the encoder and the decoder are restricted, the Bekenstein bound does constrain the channel capacities, including the zero-bit capacity.

Hayden, Patrick [Stanford University, CA (United S

Passive Environment-Assisted Quantum Communication with GKP States

Bosonic pure-loss channel, which represents the process of photons decaying into a vacuum environment, has zero quantum capacity when the channel’s transmissivity is less than 50%. Modeled as a beam splitter interaction between the system and its environment, the performance of bosonic pure-loss channel can be enhanced by controlling the environment state. We show that by choosing the ideal Gottesman-Kitaev-Preskill (GKP) states for the system and its environment, perfect transmission of quantum information through a beam splitter is achievable at arbitrarily low transmissivities. Our explicit constructions allow for experimental demonstration of the improved performance of a quantum channel through passive environment assistance, which is potentially useful for quantum transduction where the environment state can be naturally controlled. In practice, it is crucial to consider finite-energy constraints, and high-fidelity quantum communication through a beam splitter remains achievable with GKP states at the few-photon level.

Wang, Zhaoyou [Univ. of Chicago, IL (United States

Best Practices for Resilience Hub Development and Management

The Carbon League and its community partners in East St. Louis, Illinois, have identified five facilities to serve as resilience hubs. These hubs are intended to support the local community through a range of services and resources during blue-sky (everyday), gray-sky (pre-event), and black-sky (emergency) conditions. Transforming these facilities into fully functional resilience hubs requires a broad operational improvement and programmatic planning roadmap. This memo outlines best practices to guide the development of these resilience hubs in East St. Louis, including recommendations for infrastructure services; safety and physical protection; community services; operational protocols; and a phased implementation strategy aligned with realistic funding and capacity constraints. Infrastructure recommendations include strengthening electric power, communications, water, sanitation, and transportation/logistics capabilities, all of which are essential for hubs that may serve as cooling and warming centers, distribution points, and information hubs during emergencies. Safety recommendations focus on accessibility, emergency action planning, indoor air quality, and secure storage of critical equipment. A phased roadmap provides guidance from immediate, low-cost readiness actions to long-term optimization and community integration. Performance metrics and maintenance protocols ensure continuous improvement and operational readiness. This guidance draws on best practices that can be used to support the development of resilient, community-centered hubs capable of enhancing public safety, health, and well-being during everyday operations and emergencies alike.

99 GENERAL AND MISCELLANEOUS

Modeling Grid Data Flows for Transmission and Distribution Operations: Review, Design, Next Steps

Operational scenarios of the power grids grow multifold to accommodate the diverse needs of both the utilities and end consumers, and the various other stakeholders in-between. To comprehensively model and apply analytics to support objectives and business functions of grid sectors, a reliable approach to characterize and design data flows is crucial. The flows bridge business functions with communications protocols, stakeholders such as the grid actors, and data interfaces comprising different data objects. Additionally, constraints applied to the flow such as cybersecurity, trust, privacy, and ownership among others intersect these entities, requiring the delineation of their interactions under different scenarios. This paper aims to not only highlight relevant research in the space of grid data flows, but also proposes, for the transmission-distribution sector, a novel modeling approach that marries the aforementioned entities: objectives, business functions, data interfaces, communication protocols, data stakeholders, and flow constraints. It elaborates on the design philosophy and the significance of each entity within the model and applies it to an example function of fault location, isolation and service restoration (FLISR). Finally, the next steps to extend the application of this data flow model for other practical operational scenarios are discussed.

Sundararajan, Aditya [ORNL] (ORCID:000000033577854

Efficiently Computable Limits on EPR Pair Generation in Quantum Broadcast Channels

We investigate the generation of EPR pairs between three observers in a general causally structured setting, where communication occurs via a noisy quantum broadcast channel. The most general quantum codes for this setup take the form of tripartite quantum channels. Since the receivers are constrained by causal ordering, additional temporal relationships naturally emerge between the parties. These causal constraints enforce intrinsic no-signalling conditions on any tripartite operation, ensuring that it constitutes a physically realizable quantum code for a quantum broadcast channel. We analyze these constraints and, more broadly, characterize the most general quantum codes for communication over such channels. We examine the capabilities of codes that are fully no-signalling among the three parties, positive partial transpose (PPT)-preserving, or both, and derive simple semidefinite programs to compute the achievable entanglement fidelity. We then establish a hierarchy of semidefinite programming converse bounds -- both weak and strong -- for the capacity of quantum broadcast channels for EPR pair generation, in both one-shot and asymptotic regimes. Notably, in the special case of a point-to-point channel, our strong converse bound recovers and strengthens existing results. Finally, we demonstrate how the PPT-preserving codes we develop can be leveraged to construct PPT-preserving entanglement combing schemes, and vice versa.

FOS: Physical sciences

CMIP7 data request: impacts and adaptation priorities and opportunities

The Coupled Model Intercomparison Project Phase 7 (CMIP7) undertook an extensive process to gather community input and refine data requests related to impacts and adaptation applications of Earth System Model (ESM) outputs. The Impacts and Adaptation (I&A) Data Request Team worked with CMIP7 leadership to distribute an open solicitation across many communities that use climate model outputs requesting inputs for new and existing variables, the most applicable temporal characteristics, and groupings of variables that together allow for specific application opportunities. This input was then collated and translated into CMIP7 standard templates for inclusion in the broader data request, leading to 13 I&A data request opportunities, 60 variable groups and 539 unique variables sought by vulnerability, impacts, adaptation, and climate services user communities. Here, we describe these opportunities and variable groups, as well as new insights into how ESM groups can prioritize outputs that set off a chain of further analyses, ultimately informing decisions impacting society and natural systems. These include an emphasis on high-resolution outputs to allow further modeling of climate impacts at regional and local scales, improved representation of extreme weather events, enhanced accuracy of downscaling and bias-adjustment techniques, and support for more detailed assessments for decision-making in adaptation and mitigation strategies. There is also broad interest in more extensive provisioning of two-dimensional variables at the Earth's surface, prioritizing experiments that enhance our understanding of both the recent past and future scenarios, and providing outputs that allow further downscaling and bias adjustment. We emphasize that variable groups are the fundamental level at which to engage with the I&A data request, matching the scale of input and the way output provision enables specific I&A applications. Given resource constraints, we applaud CMIP7 efforts to foster strong engagement and communication between ESM groups and the I&A team to build consensus around prudent compromises in priority variables, temporal resolutions, simulation experiments, time subsets, and ensemble members.

Ruane, Alex C. [NASA Goddard Inst. for Space Studi

Finding MIDDLE Ground: Scalable and Secure Distributed Learning

Edge computing methods allow devices to efficiently train a high-performing, robust, and personalized model for predictive tasks. However, these methods succumb to privacy and scalability concerns such as adversarial data recovery and expensive model communication. Furthermore, edge computing methods unrealistically assume that all devices train an identical model. In practice, edge devices have varying computational and memory constraints which may not allow certain devices to have the space or speed to train a specific model. To overcome these issues, we propose MIDDLE: a model independent distributed learning algorithm which allows heterogeneous edge devices to assist each other’s training while communicating only non-sensitive information. MIDDLE unlocks the ability for edge devices, regardless of computational or memory constraints, to assist each other even with completely different model architectures. Furthermore, MIDDLE does not require model or gradient communication which greatly reduces communication size and time. We prove that MIDDLE attains the optimal convergence rate O(1/sqrt(TM)) of stochastic gradient descent for convex and non-convex smooth optimization (for total iterations T and batch size M). Finally, our experimental results demonstrate that MIDDLE (even in non-IID data settings) attains robust and high-performing models without model or gradient communication.

Bornstein, Marc I.

Synchrophasor Data Anomaly Detection on Grid Edge by 5G Communication and Adjacent Compute

The fifth-generation mobile communication (5G) technology offers the opportunities to enhance the grid real-time monitoring. The 5G-enabled phasor measurement units (PMUs) features flexible positioning and cost-effective long-term maintenance, without constraints of fixing wire. This paper is the first to demonstrate the applicability of 5G in PMU communication, and the experiment was carried out at Verizon non-standalone testbed at Pacific Northwest National Laboratory (PNNL) Advanced Wireless Communication lab. The performance of 5G-enabled PMU communication setup is reviewed and discussed in this paper, and the paper presents a real-time dynamic linear model (DML) based synchrophasor data anomaly detection application. Last but not least, the practicability of implementing 5G for wide-area protection strategies is explored and discussed by analyzing the experimental results.

5G, Synchrophasor data, machine learning, anomaly

Implementing One Sided Partitioned Communication in Open MPI

This report introduces partitioned communication, a new MPI 4.0 interface that enables early bird communication by overlapping communication and computation. By partitioning messages into smaller sub-messages, MPI can start partial data transfers early. Performance studies show that the RMA implementation outperforms the Persistent implementation, despite some constraints. This report details a new opt-in RMA implementation, offering a high-performance option for partitioned communication that imposes some additional limitations.

97 MATHEMATICS AND COMPUTING

Quantum routing with teleportation

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation—showing an O ( N log N ) upper bound on the separation in routing time for any interaction graph—and give tighter bounds for some common classes of graphs. Published by the American Physical Society 2024

Devulapalli, Dhruv (ORCID:000000022612308X)

Scrambling Signal Modularity in Bottom-up Assembled Synthetic Pseudomonas Consortia Reveals Robust Information Transfer

There is immense potential in crafting synthetic microbial communities for application in human health, agriculture, the environment, and even biomanufacturing where an appropriately constructed consortium can be assembled with tremendous biosynthetic or degradative capabilities. In many of these cases, bacterial signaling serves as a form of intercellular information transfer that guides the collective’s behavior. Such communication is complex, as many signals, signal disruptors, microbial species, physical barriers, and spatiotemporal constraints may be involved. Here, in this work, we demonstrate that a multisignal pathway for molecular information transfer within a consortium of several Pseudomonas spp. can be scrambled (genetically and organizationally) while the original message is still effectively conveyed. Assembled from the bottom up, we have employed two types of signaling molecules (i) a redox active secondary metabolite (rhizospheric signal, phloroglucinol), and (ii) a bacterial quorum sensing signal (3-oxo-C12 acylhomoserine lactone, AI-1). These signals can be intraconverted and acted upon by designated community members. We show how the order in which the signals are received, transduced, and subsequently transmitted can be rearranged with minimal impact on the intended outcome. In the consortial context, we found this messaging structure can be remarkably robust. Inspired by rhizospheric molecular signaling mechanisms, this work provides a conceptual framework for designing signaling and information transfer processes within assembled communities.

Biological and medical sciences

Hurricane Helene: Energy Systems Impact and Situational Insights in East Tennessee

This situational report focuses specifically on energy system performance and interdependencies associated with Hurricane Helene’s impacts across East Tennessee. It does not attempt to identify root causes, evaluate broader emergency response structures, or assess agency effectiveness. Rather, it aims to illuminate how energy disruptions intersected with other lifeline services, particularly water, transportation, and communications, and identify the infrastructural and logistical conditions that shaped those outcomes. Where possible, this report seeks to highlight both constraints and successful practices that emerged during the event.

29 ENERGY PLANNING, POLICY, AND ECONOMY

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian