Search NASA⌕ Search

SEARCH · Search NASA

Results for “network optimization”

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 487 records · Page 27

A Preliminary ZEUS Lightning Location Error Analysis Using a Modified Retrieval Theory

The ZEUS long-range VLF arrival time difference lightning detection network now covers both Europe and Africa, and there are plans for further expansion into the western hemisphere. In order to fully optimize and assess ZEUS lightning location retrieval errors and to determine the best placement of future receivers expected to be added to the network, a software package is being developed jointly between the NASA Marshall Space Flight Center (MSFC) and the University of Nevada Las Vegas (UNLV). The software package, called the ZEUS Error Analysis for Lightning (ZEAL), will be used to obtain global scale lightning location retrieval error maps using both a Monte Carlo approach and chi-squared curvature matrix theory. At the core of ZEAL will be an implementation of an Iterative Oblate (IO) lightning location retrieval method recently developed at MSFC. The IO method will be appropriately modified to account for variable wave propagation speed, and the new retrieval results will be compared with the current ZEUS retrieval algorithm to assess potential improvements. In this preliminary ZEAL work effort, we defined 5000 source locations evenly distributed across the Earth. We then used the existing (as well as potential future ZEUS sites) to simulate arrival time data between source and ZEUS site. A total of 100 sources were considered at each of the 5000 locations, and timing errors were selected from a normal distribution having a mean of 0 seconds and a standard deviation of 20 microseconds. This simulated "noisy" dataset was analyzed using the IO algorithm to estimate source locations. The exact locations were compared with the retrieved locations, and the results are summarized via several color-coded "error maps."

Elander, Valjean↗

Traffic Flow Analysis for Package Delivery Drones using a Queueing Model

A key component of the small unmanned aircraft systems traffic management ecosystem is the design of scalable algorithms for strategic deconfliction of drones prior to takeoff. In this work, we focus on efficient flow management of drones on a network of intersecting edges subject to two kinds of spacing constraints: 1) between any two adjacent vehicles on an edge and 2) between any two vehicles on two different edges arriving one after the other at an intersection. The spacing is designed to enable non-intersection of operational volumes corresponding to two different vehicles thereby properly separating the vehicles inside each volume. For simplicity, we assume a constant ground speed for the drones and fixed dimensions for the operational volume blocks. The deconfliction is managed by adjusting the takeoff time of the drones, thereby regulating their arrival time at various crossing waypoints in the network. This framework allows us to study the maximum flow (throughput) of vehicles on a network of edges connecting depots to drop off sites subject to the temporal spacing constraints. The departure scheduling of individual drones results in a combinatorial optimization problem. To alleviate this, we solve a max-flow formulation and use queueing theory to simplify the analysis and provide upper bounds to the underlying optimization problem for individual drone departure scheduling. Our results indicate that throughput drops rapidly after the density of drones in the network passes the max-flow limits.

Alexey A Munishkin↗

Ikhana: A NASA UAS Supporting Long Duration Earth Science Missions

NASA's Ikhana unmanned aerial vehicle (UAV) is a General Atomics MQ-9 Predator-B modified to support the conduct of Earth science missions for the NASA Science Mission Directorate through partnerships, other government agencies and universities. Ikhana, a Native American word meaning 'intelligence', can carry over 2000 lbs of atmospheric and remote sensing instruments in the payload bay and external pods. The aircraft is capable of mission durations in excess of 24 hours at altitudes above 40,000 ft. Redundant flight control, avionics, power, and network systems increase the system reliability and allow easier access to public airspace. The aircraft is remotely piloted from a mobile ground control station (GCS) using both C-band line-of-sight and Ku-band over-the-horizon satellite datalinks. NASA's GCS has been modified to support on-site science monitoring, or the downlink data can be networked to remote sites. All ground support systems are designed to be deployable to support global Eart science investigations. On-board support capabilities include an instrumentation system and an Airborne Research Test System (ARTS). The ARTS can host research algorithms that will autonomously command and control on-board sensors, perform sensor health monitoring, conduct data analysis, and request changes to the flight plan to maximize data collection. The ARTS also has the ability to host algorithms that will autonomously control the aircraft trajectory based on sensor needs, (e.g. precision trajectory for repeat pass interferometry) or to optimize mission objectives (e.g. search for specific atmospheric conditions). Standard on-board networks will collect science data for recording and for inclusion in the aircraft's high bandwidth downlink. The Ikhana project will complete GCS development, science support systems integration, external pod integration and flight clearance, and operations crew training in early 2007. A large-area remote sensing mission is currently scheduled for the Summer 2007.

Cobleigh, Brent R.↗

BioWires: Conductive DNA Nanowires in a Computationally-Optimized, Synthetic Biological Platform for Nanoelectronic Fabrication

DNA is an ideal template for a biological nanowire-it has a linear structure several atoms thick; it possesses addressable nucleobase geometry that can be precisely defined; and it is massively scalable into branched networks. Until now, the drawback of DNA as a conducting nanowire been, simply put, its low conductance. To address this deficiency, we extensively characterize a chemical variant of canonical DNA that exploits the affinity of natural cytosine bases for silver ions. We successfully construct chains of single silver ions inside double-stranded DNA, confirm the basic dC-Ag+-dC bond geometry and kinetics, and show length-tunability dependent on mismatch distribution, ion availability and enzyme activity. An analysis of the absorbance spectra of natural DNA and silver-binding, poly-cytosine DNA demonstrates the heightened thermostability of the ion chain and its resistance to aqueous stresses such as precipitation, dialysis and forced reduction. These chemically critical traits lend themselves to an increase in electrical conductivity of over an order of magnitude for 11-base silver-paired duplexes over natural strands when assayed by STM break junction. We further construct and implement a genetic pathway in the E. coli bacterium for the biosynthesis of highly ionizable DNA sequences. Toward future circuits, we construct a model of transcription network architectures to determine the most efficient and robust connectivity for cell-based fabrication, and we perform sequence optimization with a genetic algorithm to identify oligonucleotides robust to changes in the base-pairing energy landscape. We propose that this system will serve as a synthetic biological fabrication platform for more complex DNA nanotechnology and nanoelectronics with applications to deep space and low resource environments.

DNA↗

Efficient Simulation of Wing Modal Response: Application of 2nd Order Shape Sensitivities and Neural Networks

At the preliminary design stage of a wing structure, an efficient simulation, one needing little computation but yielding adequately accurate results for various response quantities, is essential in the search of optimal design in a vast design space. In the present paper, methods of using sensitivities up to 2nd order, and direct application of neural networks are explored. The example problem is how to decide the natural frequencies of a wing given the shape variables of the structure. It is shown that when sensitivities cannot be obtained analytically, the finite difference approach is usually more reliable than a semi-analytical approach provided an appropriate step size is used. The use of second order sensitivities is proved of being able to yield much better results than the case where only the first order sensitivities are used. When neural networks are trained to relate the wing natural frequencies to the shape variables, a negligible computation effort is needed to accurately determine the natural frequencies of a new design.

Kapania, Rakesh K.↗

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗

A VLBI variance-covariance analysis interactive computer program

An interactive computer program (in FORTRAN) for the variance covariance analysis of VLBI experiments is presented for use in experiment planning, simulation studies and optimal design problems. The interactive mode is especially suited to these types of analyses providing ease of operation as well as savings in time and cost. The geodetic parameters include baseline vector parameters and variations in polar motion and Earth rotation. A discussion of the theroy on which the program is based provides an overview of the VLBI process emphasizing the areas of interest to geodesy. Special emphasis is placed on the problem of determining correlations between simultaneous observations from a network of stations. A model suitable for covariance analyses is presented. Suggestions towards developing optimal observation schedules are included.

Bock, Y.↗

Multi-level Hierarchical Poly Tree computer architectures

Based on the concept of hierarchical substructuring, this paper develops an optimal multi-level Hierarchical Poly Tree (HPT) parallel computer architecture scheme which is applicable to the solution of finite element and difference simulations. Emphasis is given to minimizing computational effort, in-core/out-of-core memory requirements, and the data transfer between processors. In addition, a simplified communications network that reduces the number of I/O channels between processors is presented. HPT configurations that yield optimal superlinearities are also demonstrated. Moreover, to generalize the scope of applicability, special attention is given to developing: (1) multi-level reduction trees which provide an orderly/optimal procedure by which model densification/simplification can be achieved, as well as (2) methodologies enabling processor grading that yields architectures with varying types of multi-level granularity.

Padovan, Joe↗

Microstrip Antenna for Remote Sensing of Soil Moisture and Sea Surface Salinity

This compact, lightweight, dual-frequency antenna feed developed for future soil moisture and sea surface salinity (SSS) missions can benefit future soil and ocean studies by lowering mass, volume, and cost of the antenna system. It also allows for airborne soil moisture and salinity remote sensors operating on small aircraft. While microstrip antenna technology has been developed for radio communications, it has yet to be applied to combined radar and radiometer for Earth remote sensing. The antenna feed provides a key instrument element enabling high-resolution radiometric observations with large, deployable antennas. The design is based on the microstrip stacked-patch array (MSPA) used to feed a large, lightweight, deployable, rotating mesh antenna for spaceborne L-band (approximately equal to 1 GHz) passive and active sensing systems. The array consists of stacked patches to provide dual-frequency capability and suitable radiation patterns. The stacked-patch microstrip element was designed to cover the required L-band center frequencies at 1.26 GHz (lower patch) and 1.413 GHz (upper patch), with dual-linear polarization capabilities. The dimension of patches produces the required frequencies. To achieve excellent polarization isolation and control of antenna sidelobes for the MSPA, the orientation of each stacked-patch element within the array is optimized to reduce the cross-polarization. A specialized feed-distribution network was designed to achieve the required excitation amplitude and phase for each stacked-patch element.

Ramhat-Samii, Yahya↗

Optimal Estimation-Based Algorithm to Retrieve Aerosol Optical Properties for GEMS Measurements Over Asia

The Geostationary Environment Monitoring Spectrometer (GEMS) is scheduled to be in orbit in 2019 onboard the GEO-KOMPSAT 2B satellite and will continuously monitor air quality over Asia. The GEMS will make measurements in the UV spectrum (300-500 nm) with 0.6 nm resolution. In this study, an algorithm is developed to retrieve aerosol optical properties from UV-visible measurements for the future satellite instrument and is tested using 3 years of existing OMI L1B data. This algorithm provides aerosol optical depth (AOD), single scattering albedo (SSA) and aerosol layer height (ALH) using an optimized estimation method. The retrieved AOD shows good correlation with Aerosol Robotic Network (AERONET) AOD with correlation coefficients of 0.83, 0.73 and 0.80 for heavy-absorbing fine (HAF) particles, dust and non-absorbing (NA) particles, respectively. However, regression tests indicate underestimation and overestimation of HAF and NA AOD, respectively. In comparison with AOD from the OMI/Aura Near-UV Aerosol Optical Depth and Single Scattering Albedo 1-orbit L2 Swath 13 km x 24 km V003 (OMAERUV) algorithm, the retrieved AOD has a correlation coefficient of 0.86 and linear regression equation, AOD(sub GEMS) = 1.18AOD(sub OMAERUV) + 0.09. An uncertainty test based on a reference method, which estimates retrieval error by applying the algorithm to simulated radiance data, revealed that assumptions in the spectral dependency of aerosol absorptivity in the UV cause significant errors in aerosol property retrieval, particularly the SSA retrieval. Consequently, retrieved SSAs did not show good correlation with AERONET values. The ALH results were qualitatively compared with the Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) products and were found to be well correlated for highly absorbing aerosols. The difference between the attenuated-backscatter-weighted height from CALIOP and retrieved ALH were mostly closed to zero when the retrieved AOD is higher than 0.8 and SSA is lower than 0.93. Although retrieval accuracy was not significantly improved, the simultaneous consistent retrieval of AOD, SSA and ALH alone demonstrates the value of this stand-alone algorithm, given their nature for error using other methods. The use of these properties as input parameters for the air mass factor calculation is expected to improve the retrieval of other trace gases over Asia.

Geostationary Environment Monitoring Spectrometer ↗

Overview of Cognitive Communications and AI/ML Applications

This presentation provides an overview of the Cognitive Communications project and several key technology areas that are being developed. Artificial intelligence applications for networking, adaptive and resilient links, RF interference mitigation, and system-level optimization and cognition are discussed.

Rachel Dudukovich↗

Deep Reinforcement Learning based Routing in an Air-to-Air Ad-hoc Network

This paper studies the Multiple Sources and Multiple Destinations (MSMD) routing problem in a dynamic Air-to-Air Ad-hoc Network (AAAN). We consider a spectrum limited scenario where multiple links have to share the same frequency channel so that co-channel interference becomes inevitable. As a result, routing decisions and spectrum access are coupled and must be jointly considered. This paper proposes a deep Q-learning based algorithm to find an optimal routing and channel selection strategy that minimizes the end-to-end communication delay. Specifically, under the assumption that only local information is available to every node, the Deep Q-Network (DQN) is trained offline to learn the optimal routing and channel selection strategy. After the trained DQN is implemented in every node, multiple relay nodes can simultaneously determine their next-hop relay and channel selections in real-time. Simulation results demonstrate the efficacy of our proposed algorithm.

AAAN↗

Deep Reinforcement Learning based Routing in an Air-to-Air Ad-hoc Network

This paper studies the Multiple Sources and Multiple Destinations (MSMD) routing problem in a dynamic Air-to-Air Ad-hoc Network (AAAN). We consider a spectrum limited scenario where multiple links have to share the same frequency channel so that co-channel interference becomes inevitable. As a result, routing decisions and spectrum access are coupled and must be jointly considered. This paper proposes a deep Q-learning based algorithm to find an optimal routing and channel selection strategy that minimizes the end-to-end communication delay. Specifically, under the assumption that only local information is available to every node, the Deep Q-Network (DQN) is trained offline to learn the optimal routing and channel selection strategy. After the trained DQN is implemented in every node, multiple relay nodes can simultaneously determine their next-hop relay and channel selections in real-time. Simulation results demonstrate the efficacy of our proposed algorithm.

AAAN↗

Evaluating scheduling algorithms for traffic with heterogeneous performance objectives

Two types of network traffic are considered: traffic with deadlines, for which the most important performance objective is based on loss rate, and packets without deadlines, for which the most important performance objective is based on mean delay. An optimal scheduling algorithm is presented to minimize weighted loss rate and weighted mean delay in the queues that form at the switches and at the network access points of a packet-switched network, where weights reflect the relative importance of packets. Although not practical for implementation, the algorithm is intended as a standard for the comparison of the performance of other scheduling algorithms. The algorithm is more general and lower computational complexity than previously published algorithms, enabling performance evaluation of some important scenarios that could not previously have been considered. Using the optimal performance results of this algorithm, the performance of the first-come-first-served, static priority, and earliest deadline first scheduling algorithms is evaluated. The results suggest that network efficiency could be improved by using a more sophisticated heuristic scheduling algorithm rather than one of the aforementioned algorithms.

Peha, Jon M.↗

Automatic Generation of Algorithms for the Statistical Analysis of Planetary Nebulae Images

Analyzing data sets collected in experiments or by observations is a Core scientific activity. Typically, experimentd and observational data are &aught with uncertainty, and the analysis is based on a statistical model of the conjectured underlying processes, The large data volumes collected by modern instruments make computer support indispensible for this. Consequently, scientists spend significant amounts of their time with the development and refinement of the data analysis programs. AutoBayes [GF+02, FS03] is a fully automatic synthesis system for generating statistical data analysis programs. Externally, it looks like a compiler: it takes an abstract problem specification and translates it into executable code. Its input is a concise description of a data analysis problem in the form of a statistical model as shown in Figure 1; its output is optimized and fully documented C/C++ code which can be linked dynamically into the Matlab and Octave environments. Internally, however, it is quite different: AutoBayes derives a customized algorithm implementing the given model using a schema-based process, and then further refines and optimizes the algorithm into code. A schema is a parameterized code template with associated semantic constraints which define and restrict the template s applicability. The schema parameters are instantiated in a problem-specific way during synthesis as AutoBayes checks the constraints against the original model or, recursively, against emerging sub-problems. AutoBayes schema library contains problem decomposition operators (which are justified by theorems in a formal logic in the domain of Bayesian networks) as well as machine learning algorithms (e.g., EM, k-Means) and nu- meric optimization methods (e.g., Nelder-Mead simplex, conjugate gradient). AutoBayes augments this schema-based approach by symbolic computation to derive closed-form solutions whenever possible. This is a major advantage over other statistical data analysis systems which use numerical approximations even in cases where closed-form solutions exist. AutoBayes is implemented in Prolog and comprises approximately 75.000 lines of code. In this paper, we take one typical scientific data analysis problem-analyzing planetary nebulae images taken by the Hubble Space Telescope-and show how AutoBayes can be used to automate the implementation of the necessary anal- ysis programs. We initially follow the analysis described by Knuth and Hajian [KHO2] and use AutoBayes to derive code for the published models. We show the details of the code derivation process, including the symbolic computations and automatic integration of library procedures, and compare the results of the automatically generated and manually implemented code. We then go beyond the original analysis and use AutoBayes to derive code for a simple image segmentation procedure based on a mixture model which can be used to automate a manual preproceesing step. Finally, we combine the original approach with the simple segmentation which yields a more detailed analysis. This also demonstrates that AutoBayes makes it easy to combine different aspects of data analysis.

Fischer, Bernd↗

The Role of Margin in Link Design and Optimization

Link analysis is a system engineering process in the design, development, and operation of communication systems and networks. Link models that are mathematical abstractions representing the useful signal power and the undesirable noise and attenuation effects (including weather effects if the signal path transverses through the atmosphere) that are integrated into the link budget calculation that provides the estimates of signal power and noise power at the receiver. Then the link margin is applied which attempts to counteract the fluctuations of the signal and noise power to ensure reliable data delivery from transmitter to receiver. (Link margin is dictated by the link margin policy or requirements.) A simple link budgeting approach assumes link parameters to be deterministic values typically adopted a rule-of-thumb policy of 3 dB link margin. This policy works for most S- and X-band links due to their insensitivity to weather effects. But for higher frequency links like Ka-band, Ku-band, and optical communication links, it is unclear if a 3 dB link margin would guarantee link closure. Statistical link analysis that adopted the 2-sigma or 3-sigma link margin incorporates link uncertainties in the sigma calculation. (The Deep Space Network (DSN) link margin policies are 2-sigma for downlink and 3-sigma for uplink.) The link reliability can therefore be quantified statistically even for higher frequency links. However in the current statistical link analysis approach, link reliability is only expressed as the likelihood of exceeding the signal-to-noise ratio (SNR) threshold that corresponds to a given bit-error-rate (BER) or frame-error-rate (FER) requirement. The method does not provide the true BER or FER estimate of the link with margin, or the required signalto-noise ratio (SNR) that would meet the BER or FER requirement in the statistical sense. In this paper, we perform in-depth analysis on the relationship between BER/FER requirement, operating SNR, and coding performance curve, in the case when the channel coherence time of link fluctuation is comparable or larger than the time duration of a codeword. We compute the "true" SNR design point that would meet the BER/FER requirement by taking into account the fluctuation of signal power and noise power at the receiver, and the shape of the coding performance curve. This analysis yields a number of valuable insights on the design choices of coding scheme and link margin for the reliable data delivery of a communication system - space and ground. We illustrate the aforementioned analysis using a number of standard NASA error-correcting codes.

Cheung, K.↗

Optimization of Connector Position Offset for Bandwidth Enhancement of a Multimode Optical Fiber Link

The multimode fiber bandwidth enhancement techniques to meet the Gigabit Ethernet standards for local area networks (LAN) of the Kennedy Space Center and other NASA centers have been discussed. Connector with lateral offset coupling between single mode launch fiber cable and the multimode fiber cable has been thoroughly investigated. An optimization of connector position offset for 8 km long optical fiber link at 1300 nm with 9 micrometer diameter single mode fiber (SMF) and 50 micrometer diameter multimode fiber (MMF) coupling has been obtained. The optimization is done in terms of bandwidth, eye-pattern, and bit pattern measurements. It is simpler, is a highly practical approach and is cheaper as no additional cost to manufacture the offset type of connectors is involved.

Rawat, Banmali↗