Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMMUNICATION NETWORKS”

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 1,153 records · Page 64

Global system data bus using the Digital Autonomous Terminal Access Communication protocol

Modern digital avionic systems with distributed processing require networking to connect the many elements. Digital Autonomous Terminal Access Communication (DATAC) is one of many such networks. DATAC has been implemented on the Transport Systems Research Vehicle (TSRV), a Boeing 737 aircraft operated by the National Aeronautics and Space Administration's Advanced Transport Operating Systems Program Office (ATOPS). This paper presents the TSRV implementation of the DATAC bus, a description of the DATAC system, a synchronization mechanism, details of data flow throughout the system, and a discussion of the modes available with DATAC. Numerous flight tests have been conducted using DATAC as the only means of communication between systems with outstanding results. DATAC is now an integral part of the TSRV and is expected to satisfy near term as well as future requirements for growth and flexibility.

Holmes, David C. E.↗

MSAT network architecture

The Mobile Satellite (MSAT) communications system will support mobile voice and data services using circuit switched and packet switched facilities with interconnection to the public switched telephone network and private networks. Control of the satellite network will reside in a Network Control System (NCS) which is being designed to be extremely flexible to provide for the operation of the system initially with one multi-beam satellite, but with capability to add additional satellites which may have other beam configurations. The architecture of the NCS is described. The signalling system must be capable of supporting the protocols for the assignment of circuits for mobile public telephone and private network calls as well as identifying packet data networks. The structure of a straw-man signalling system is discussed.

Davies, N. G.↗

The Telecommunications and Data Acquisition Progress Report 42-77

Activities in space communication, radio navigation, radio science, and ground-based astronomy are reported. Advanced systems for the Deep Space Network and its Ground-Communications Facility are discussed including station control and system technology. Network sustaining as well as data and information systems are covered. Studies of geodynamics, investigations of the microwave spectrum, and the search for extraterrestrial intelligence are reported.

Posner, E. C.↗

NASA Space Network Project Operations Management: Past, Present and Future for the Tracking and Data Relay Satellite Constellation

The NASA Space Network (SN) Operations began with the launch of the first Tracking and Data Relay Satellite (TDRS-1) on April 4, 1983 with on-orbit operations conducted from the White Sands Ground Terminal (WSGT) in Las Cruces, New Mexico. Over the past 35 years, the SN has evolved to its current configuration comprised of four strategically located satellite ground stations and a constellation of ten geosynchronous Tracking and Data Relay Satellites that provide customer support 24 hours a day, 365 days per year, at an unprecedented 99.9% proficiency. The Space Network provides total global Communications, Data Relay, and Tracking services for Low Earth Orbiting (LEO) satellites, Human Space Flight, Expendable Launch Vehicles (ELV) and Scientific missions. This paper will address the Operations Management of the NASA Space Network and the complexities associated with this responsibility, as well as significant mission support highlights.

Sobchak, Ted↗

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

DiNucci, David C.↗

A programming environment for distributed complex computing. An overview of the Framework for Interdisciplinary Design Optimization (FIDO) project. NASA Langley TOPS exhibit H120b

The Framework for Interdisciplinary Design Optimization (FIDO) is a general programming environment for automating the distribution of complex computing tasks over a networked system of heterogeneous computers. For example, instead of manually passing a complex design problem between its diverse specialty disciplines, the FIDO system provides for automatic interactions between the discipline tasks and facilitates their communications. The FIDO system networks all the computers involved into a distributed heterogeneous computing system, so they have access to centralized data and can work on their parts of the total computation simultaneously in parallel whenever possible. Thus, each computational task can be done by the most appropriate computer. Results can be viewed as they are produced and variables changed manually for steering the process. The software is modular in order to ease migration to new problems: different codes can be substituted for each of the current code modules with little or no effect on the others. The potential for commercial use of FIDO rests in the capability it provides for automatically coordinating diverse computations on a networked system of workstations and computers. For example, FIDO could provide the coordination required for the design of vehicles or electronics or for modeling complex systems.

Townsend, James C.↗

Instrumentation and data acquisition systems

A comprehensive and integrated measurement system was identified and a design and development effort initiated to meet the criteria imposed by the National Transonic Facility operating environment. Specific measurement areas receiving concentrated attention include: data acquisition, force measurement, pressure instrumentation, flow visualization techniques, model attitude and model deformation measurement, and temperature measurement. The NTF instrument complex will be centered around four 32-bit, 1-microsecond-cycle-time central processing units connected in a multipoint-distributed network configuration. The principal activities to be supported by these computers are: (1) data base management and processing; (2) research measurement data acquisition and display; (3) tunnel and model control; and (4) process monitoring and communication control. The distributed network approach was chosen to modularize the functional software into definable and implementable parts by the various groups involved in the design and to permit use of similar hardware configurations to improve reliability and maintainability.

Guarino, J. F.↗

Wireless Mesh Networks for Small Satellites Subsystems

Wireless mesh networks are a network topology where all the nodes of a system are able to communicate with every other node in the network. This enables an adaptable network that is scalable and has the capability to self-repair and self-configure. The Modular Rapidly Manufactured Small Sat (MRMSS) Project is a small satellite project where we are developing a modular CubeSat architecture. One of the goals of the project is to develop a system that is quick and simple to integrate with a minimal amount of wiring involved. Wireless mesh networks are well suited for this configuration because of the self- configuring and self-repairing aspects of the network. This enables a satellite developer to add subsystem nodes to the network without the need for much hardware re-design. This paper will detail the background of wireless mesh networks, the advantages and limitations of using wireless mesh networks for space applications, and the technical progress of the wireless mesh network development of the MRMSS project.

CubeSats↗

Data communications and monitor for the Penn State University profiler network

The profiler network installed by the Department of Meteorology at Penn State University utilizes a microcomputer for network monitoring and control. The network consists of two VHF and one UHF wind profiling Doppler radars. Additional measurement systems added to the network include temperature and humidity profiling radiometers, sodar for boundary layer wind profiling and selected surface based baseline systems. Remote diagnostic capabilities were also implemented in the Penn State network. It is possible to remotely analyze many specific malfunctions of the transmitter or signal processor.

Peters, R. M.↗

The Deep Impact Network Experiment Operations Center Monitor and Control System

The Interplanetary Overlay Network (ION) software at JPL is an implementation of Delay/Disruption Tolerant Networking (DTN) which has been proposed as an interplanetary protocol to support space communication. The JPL Deep Impact Network (DINET) is a technology development experiment intended to increase the technical readiness of the JPL implemented ION suite. The DINET Experiment Operations Center (EOC) developed by JPL's Protocol Technology Lab (PTL) was critical in accomplishing the experiment. EOC, containing all end nodes of simulated spaces and one administrative node, exercised publish and subscribe functions for payload data among all end nodes to verify the effectiveness of data exchange over ION protocol stacks. A Monitor and Control System was created and installed on the administrative node as a multi-tiered internet-based Web application to support the Deep Impact Network Experiment by allowing monitoring and analysis of the data delivery and statistics from ION. This Monitor and Control System includes the capability of receiving protocol status messages, classifying and storing status messages into a database from the ION simulation network, and providing web interfaces for viewing the live results in addition to interactive database queries.

Delay/Disruption Tolerant Network (DTN)↗

Rest architecture for link analysis tools portal

A web portal is under development to improve overall services provided by NASA networks that support near-­‐Earth missions. These networks are managed by Space Communication and Navigation (SCaN) Program of NASA and include the following: Deep Space Network (DSN), Space Network (SN), and Near-­‐Earth Network (NEN). DSN is a network of antennas located in three longitudinally separated sites and supports interplanetary spacecraft missions, radio science, and radar astronomy observations. SN consists of a number of geostationary Tracking and Data Relay Satellites (TDRS) and associated ground stations. NEN consists of both NASA-­‐owned ground stations and those owned by international, commercial, and academic partners. This study investigates different web access techniques for mission users to use link analysis tools that aid in operating NASA networks. We developed a web portal prototype following principles of Representational state transfer (REST) architecture to leverage scalability, independent deployment of tools, and generic interfaces. In REST architectures, requests and responses between clients and servers are built around transferring representations of resources that can be addressed in memory. We demonstrate the feasibility of using REST architecture to facilitate web-­‐service transactions via web-­‐portal.

Lee, Carlyn-­‐Ann↗

Towards the Development of a Multi-Agent Cognitive Networking System for the Lunar Environment

This paper details the development of a multi-agent cognitive system intended to optimize networking performance in the lunar environment. One concept of the future of lunar communication, LunaNet, outlines a complex network of networks. Challenges such as scalability, interoperability, and reliability must first be addressed to successfully fulfill this vision. Machine intelligence can greatly reduce the reliance on human operators and enable efficient operations for tasks such as scheduling and network management. Machine learning, artificial intelligence, and other automated decision-making techniques can be used to allow network nodes to intelligently sense and adapt to changes in the environment such as link disruptions, new nodes joining the network, and support for a diverse range of protocols. Cognitive networking seeks to evolve these technologies into an autonomous system with improved science data return, reliability, and scalability. In this paper, we study four main areas as a means to further develop cognitive networking capabilities: networking protocol development, analysis of wireless data for modeling and simulation, development of algorithms for a multi-agent system, and spectrum sensing technology.

cognitive networking↗

An executable specification for the message processor in a simple combining network

While the primary function of the network in a parallel computer is to communicate data between processors, it is often useful if the network can also perform rudimentary calculations. That is, some simple processing ability in the network itself, particularly for performing parallel prefix computations, can reduce both the volume of data being communicated and the computational load on the processors proper. Unfortunately, typical implementations of such networks require a large fraction of the hardware budget, and so combining networks are viewed as being impractical. The FFP Machine has such a combining network, and various characteristics of the machine allow a good deal of simplification in the network design. Despite being simple in construction however, the network relies on many subtle details to work correctly. This paper describes an executable model of the network which will serve several purposes. It provides a complete and detailed description of the network which can substantiate its ability to support necessary functions. It provides an environment in which algorithms to be run on the network can be designed and debugged more easily than they would on physical hardware. Finally, it provides the foundation for exploring the design of the message receiving facility which connects the network to the individual processors.

Middleton, David↗

Localization of Ad-Hoc Lunar Constellations in Communication Failure Modes for Distributed Spacecraft Autonomy

As Lunar missions increase in complexity, inspired by NASA’s Artemis Program, they will require reliable and sufficient Position, Navigation, and Timing (PNT) capability to support the upcoming Lunar users. The navigation service should also be compatible with the smaller platforms, like CubeSats, being sent by the public and private sectors. A non-dedicated, ad-hoc Lunar navigation constellation can provide PNT services on-demand using the non-dedicated swarm assets. Swarm members cooperatively and autonomously localize themselves with minimal interaction from Earth, freeing up valuable bandwidth and ground segment resources. The autonomous localization of Lunar constellations utilizes neighbor two-way intersatellite link (ISL) measurements in a distributed extended Kalman filter (DEKF) system to minimize operating costs. Because the decentralized Lunar PNT system relies on relay communication amongst the agents, network failures or loss of assets among ad-hoc Lunar constellations may impact localization performance. This study presents an evaluation of localization performance under increasing levels of network degradation. A simulation of an ad-hoc Lunar PNT swarm is augmented to include system faults and the impacts of intermittent and permanent failures on localization performance are evaluated. We investigate three potential causes of network degradation: single spacecraft loss, multiple spacecraft loss, and antenna failure. The numerical assessments from the simulation show that the LPNT system under study, based on an autonomous decentralized concept of operation, is highly robust and resilient to communication failures. Minor faults, such as single spacecraft loss, solar interference, technical malfunctions, message delays, and antenna outages, have minimal impact on state estimation, with only a 4.47% and 3.75% degradation in median position error for assets and a representative ground user, respectively, compared to an ideal communication scenario. However, major faults, such as hardware failures or meteor strikes leading to the loss of multiple spacecrafts, are more concerning. The permanent loss of three spacecraft results in a more severe performance degradation, with median position error increasing by 23.3% for assets and 11.7% for a representative ground user, despite the Lunar PNT system remaining functional.

Yeji Kim↗

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗

Delay compensation in integrated communication and control systems. I - Conceptual development and analysis

A procedure for compensating for the effects of distributed network-induced delays in integrated communication and control systems (ICCS) is proposed. The problem of analyzing systems with time-varying and possibly stochastic delays could be circumvented by use of a deterministic observer which is designed to perform under certain restrictive but realistic assumptions. The proposed delay-compensation algorithm is based on a deterministic state estimator and a linear state-variable-feedback control law. The deterministic observer can be replaced by a stochastic observer without any structural modifications of the delay compensation algorithm. However, if a feedforward-feedback control law is chosen instead of the state-variable feedback control law, the observer must be modified as a conventional nondelayed system would be. Under these circumstances, the delay compensation algorithm would be accordingly changed. The separation principle of the classical Luenberger observer holds true for the proposed delay compensator. The algorithm is suitable for ICCS in advanced aircraft, spacecraft, manufacturing automation, and chemical process applications.

Luck, Rogelio↗

Lunar Optical Communications

Numerous studies have shown that NASA’s Deep Space Network (DSN) is woefully inadequate to support the current pace of space exploration. Proposals are on the table for extensive infrastructure build-out using RF communications, which is ultimately bandwidth constrained. Optical communication offers unregulated, near-infinite bandwidth that can easily support the needs of humans at the Moon and beyond. Although not part of the proposed lunar network architecture, optical communication systems should be considered; these systems are operational now, quickly proliferating near Earth space (e.g. StarLink), and offer very high bandwidths.

lunar↗

Defining Tolerance: Impacts of Delay and Disruption when Managing Challenged Networks

Challenged networks exhibit irregularities in their communication performance stemming from node mobility, power constraints, and impacts from the operating environment. These irregularities manifest as high signal propagation delay and frequent link disruption. Understanding those limits of link disruption and propagation delay beyond which core networking features fail is an ongoing area of research. Various wireless networking communities propose tools and techniques that address these phenomena. Emerging standardization activities within the Internet Research Task Force (IRTF) and the Consultative Committee for Space Data Systems (CCSDS) look to build upon both this experience and scalability analysis. Successful research in this area is predicated upon identifying enablers for common communication functions (notably node discovery, duplex communication, state caching, and link negotiation) and how increased disruptions and delays affect their feasibility within the network. Networks that make fewer assumptions relating to these enablers provide more universal service. Specifically, reliance on node discovery and link negotiation results in network-specific operational concepts rather than scalable technical solutions. Fundamental to this debate are the definitions, assumptions, operational concepts, and anticipated scaling of these networks. This paper presents the commonalities and differences between delay and disruption tolerance, including support protocols and critical enablers. We present where and how these tolerances differ. We propose a set of use cases that must be accommodated by any standardized delay-tolerant network and discuss the implication of these on existing tool development.

mobility drivers↗