SEARCH · Search NASA

Results for “Nodes”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2014

Clearance Analysis of Node 3 Aft CBM to the Stowed FGB Solar Array

In early 2011, the ISS Vehicle Configuration Office began considering the relocation of the Permanent Multipurpose Module (PMM) to the aft facing Common Berthing Mechanism (CBM) on Node 3 to open a berthing location for visiting vehicles on the Node 1 nadir CBM. In this position, computer-aided design (CAD) models indicated that the aft end of the PMM would be only a few inches from the stowed Functional Cargo Block (FGB) port solar array. To validate the CAD model clearance analysis, in the late summer of 2011 the Image Science and Analysis Group (ISAG) was asked to determine the true geometric relationship between the on-orbit aft facing Node 3 CBM and the FGB port solar array. The desired measurements could be computed easily by photogrammetric analysis if current imagery of the ISS hardware were obtained. Beginning in the fall of 2011, ISAG used the Dynamic Onboard Ubiquitous Graphics (DOUG) program to design a way to acquire imagery of the aft face of Node 3, the aft end-cone of Node 1, the port side of pressurized mating adapter 1 (PMA1), and the port side of the FGB out to the tip of the port solar array using cameras on the Space Station Remote Manipulator System (SSRMS). This was complicated by the need to thread the SSRMS under the truss, past Node 3 and the Cupola, and into the space between the aft side of Node 3 and the FGB solar array to acquire more than 100 images from multiple positions. To minimize the number of SSRMS movements, the Special Purpose Dexterous Manipulator (SPDM) would be attached to the SSRMS. This would make it possible to park the SPDM in one position and acquire multiple images by changing the viewing orientation of the SPDM body cameras using the pan/tilt units on which the cameras are mounted. Using this implementation concept, ISAG identified four SSRMS/SPDM positions from which all of the needed imagery could be acquired. Based on a photogrammetric simulation, it was estimated that the location of the FGB solar array could be measured within an accuracy of about 1 in. in each axis relative to the ISS Analysis Coordinate System (ISSACS). In October 2011, a proposed image-acquisition plan was drafted by ISAG and released for review. The ISS Robotics flight control team (ROBO) proposed minor changes to SPDM positions 1 and 4 to meet ISS proximity requirements. The updated image acquisition plan and draft chit were presented to and approved by the Systems Working Group (SWG) November 18 and were sent to the Vehicle Configuration Board (VCB) in early December 2011. Working with ROBO on 3 successive days (February 21, 22, and 23), ISAG collected 161 images of the ISS. Approximately 40 images were collected from each of the four different SSRMS/SPDM positions, with each set mapping the region from the Node 3 end cone, across Node 1, along the forward port side portion of the FGB, and out the port side FGB solar arrays. From this imagery, the best 80 images were selected for use in the analysis. The images were radiometrically enhanced to improve color and contrast and loaded into the FotoG analysis software along with the camera parameters and control data, which consisted of the coordinates for 54 handrail attachment bolts on the aft face of Node 3, in the ISSACS coordinate system. The results of this analysis produced the measured coordinates of 116 points distributed across the face of the FGB solar array panels (see figure 3) along with propagated uncertainty estimates in each coordinate axis. These results were sent to the ISS Vehicle Configuration Office, which sent them to the Configuration Analysis Modeling and Mass Properties (CAMMP) team for comparison with the Russian-provided CAD model for the retracted FGB solar arrays. The CAMMP analysis unexpectedly showed that the measured location of the port FGB solar array was up to 41-in. further outboard than the design and was slightly twisted about its rotational axis. The unexpected comparison results produced some initial concern regarding the accuracy of the photogrammetric measurements. To verify the measured results, ISAG personnel conducted a second analysis using just the imagery of the solar arrays in an arbitrary coordinate system defined by the three corner points of the inboard-most panel, with the design distance between points A1 and A10 as the only scale. The new measurements agreed with the original results to within less than 1 in. RMS in each axis, confirming the original solar array measurements. ISAG produced a final report for the ISS Vehicle Configuration Office documenting an apparent anomaly in the retracted configuration of the port FGB solar arrays. A copy of the measurement report was translated and sent to the Russian Space Agency. During a Vehicle Integrated Performance and Resources (VIPeR) teleconference September 24, 2012, the Russians acknowledged receipt of a translated copy of the ISAG report. The Russian representative stated that the head of the solar array design team claimed that the measured configuration was impossible unless the structure was physically broken. The Russians acknowledged that they had no expertise in photogrammetry, so the analysis technique employed was a "black box" to them, and they did not know how to use the ISAG results. They asked for a single image in which the overextension of the port solar array could be obviously seen. On November 10, 2012, during a face-to-face meeting with their Russian counterparts at JSC, ISAG presented nadir-view imagery of the FGB acquired during Space Shuttle rendezvous. Using the known width of the pressurized portion of the FGB as a scale, this analysis clearly showed that the port FGB solar array was extended outboard further than the Russian design for the retracted solar array.

Liddle, Donn↗

NASA NTRS2006

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗

NASA NTRS2009

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes - Part 1

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

Diskin, Boris↗

NASA NTRSDate not supplied

Nodal Modeling of Tank Pressurization and Draining using a Multi-Node-Ullage Approach

The purpose of the pressurization system in liquid rocket propulsion is to control the pressure in the gas space of the propellant tank (known as the ullage space) and the propellant mass flowrate to the engine. A mathematical model is required to predict the amount of pressurant necessary to ensure that pressure and temperature levels inside the tank remain within acceptable limits and that the propellant pressure leaving the tank satisfies the net positive suction pressure (NPSP) requirement of the pump feeding the engine. Nodal codes typically model tank pressurization and draining using a single node to represent the ullage and a single node to represent the propellant. As the tank drains, the ullage node grows and the propellant node shrinks. The heat transfer between ullage to wall and ullage to propellant is governed by natural convection. Designers of liquid propulsion systems often use empirical correlations to estimate the “Collapse Factor” which represents the ratio of pressurant required with heat transfer and the amount of pressurant required without heat transfer. A single node ullage model of tank pressurization was developed using GFSSP to compute the collapse factor reasonably well and later was used to model tank pressurization during test firing of the FASTRAC rocket engine. The predicted tank pressure compared well with the test data. In the early 1970’s, pressurization and drain tests with liquid methane were performed at NASA Lewis Research Center in a vacuum chamber. A 5 ft diameter spherical aluminum tank was tested to drain from 95% to 5% full using gaseous helium, hydrogen, nitrogen and methane as pressurant. Tests were conducted with different pressurant inlet temperatures and drain times. Measured data include pressurant requirement, amount of pressurant condensed, and ullage and wall temperatures at various heights in the ullage space at the end of draining. A single node GFSSP model was developed to simulate helium pressurization of the methane tank. Predicted helium consumption was 8-23% less than measured. The average error of the six test cases was 16%. A single ullage node with multiple solid node model was developed using Thermal Desktop. Predicted helium consumption compares with the test data within 2%. This paper describes the development of a GFSSP multi-node ullage model of the test configuration and compares the predicted pressurant consumption for both helium and autogenous pressurization using gaseous methane with experimental as well as TD predictions.

Nodal Model↗

NASA NTRS1989

Space physics analysis network node directory (The Yellow Pages): Fourth edition

The Space Physics Analysis Network (SPAN) is a component of the global DECnet Internet, which has over 17,000 host computers. The growth of SPAN from its implementation in 1981 to its present size of well over 2,500 registered SPAN host computers, has created a need for users to acquire timely information about the network through a central source. The SPAN Network Information Center (SPAN-NIC) an online facility managed by the National Space Science Data Center (NSSDC) was developed to meet this need for SPAN-wide information. The remote node descriptive information in this document is not currently contained in the SPAN-NIC database, but will be incorporated in the near future. Access to this information is also available to non-DECnet users over a variety of networks such as Telenet, the NASA Packet Switched System (NPSS), and the TCP/IP Internet. This publication serves as the Yellow Pages for SPAN node information. The document also provides key information concerning other computer networks connected to SPAN, nodes associated with each SPAN routing center, science discipline nodes, contacts for primary SPAN nodes, and SPAN reference information. A section on DECnet Internetworking discusses SPAN connections with other wide-area DECnet networks (many with thousands of nodes each). Another section lists node names and their disciplines, countries, and institutions in the SPAN Network Information Center Online Data Base System. All remote sites connected to US-SPAN and European-SPAN (E-SPAN) are indexed. Also provided is information on the SPAN tail circuits, i.e., those remote nodes connected directly to a SPAN routing center, which is the local point of contact for resolving SPAN-related problems. Reference material is included for those who wish to know more about SPAN. Because of the rapid growth of SPAN, the SPAN Yellow Pages is reissued periodically.

Peters, David J.↗

NASA NTRS1995

Protocol for multiple node network

The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs an antibody recognition message termination process performed by all remote nodes and a remote node polling process performed by other nodes which are master units controlling remote nodes in respective zones of the network assigned to respective master nodes. Each remote node repeats only those messages originated in the local zone, to provide isolation among the master nodes.

Kirkham, Harold↗

NASA NTRS1994

Protocol for multiple node network

Kirkham, Harold↗

NASA NTRS1990

A 4-node assumed-stress hybrid shell element with rotational degrees of freedom

An assumed-stress hybrid/mixed 4-node quadrilateral shell element is introduced that alleviates most of the deficiencies associated with such elements. The formulation of the element is based on the assumed-stress hybrid/mixed method using the Hellinger-Reissner variational principle. The membrane part of the element has 12 degrees of freedom including rotational or drilling degrees of freedom at the nodes. The bending part of the element also has 12 degrees of freedom. The bending part of the element uses the Reissner-Mindlin plate theory which takes into account the transverse shear contributions. The element formulation is derived from an 8-node isoparametric element. This process is accomplished by assuming quadratic variations for both in-plane and out-of-plane displacement fields and linear variations for both in-plane and out-of-plane rotation fields along the edges of the element. In addition, the degrees of freedom at midside nodes are approximated in terms of the degrees of freedom at corner nodes. During this process the rotational degrees of freedom at the corner nodes enter into the formulation of the element. The stress field are expressed in the element natural-coordinate system such that the element remains invariant with respect to node numbering.

Aminpour, Mohammad A.↗

NASA NTRS1995

High speed polling protocol for multiple node network

The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs a remote node polling process performed by a master node by transmitting a polling message generically addressed to all remote nodes associated with the master node. Each remote node responds upon receipt of the generically addressed polling message by transmitting a poll-answering informational message and by relaying the polling message to other adjacent remote nodes.

Kirkham, Harold↗

NASA NTRS2010

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

NASA NTRS2006

PVM Enhancement for Beowulf Multiple-Processor Nodes

A recent version of the Parallel Virtual Machine (PVM) computer program has been enhanced to enable use of multiple processors in a single node of a Beowulf system (a cluster of personal computers that runs the Linux operating system). A previous version of PVM had been enhanced by addition of a software port, denoted BEOLIN, that enables the incorporation of a Beowulf system into a larger parallel processing system administered by PVM, as though the Beowulf system were a single computer in the larger system. BEOLIN spawns tasks on (that is, automatically assigns tasks to) individual nodes within the cluster. However, BEOLIN does not enable the use of multiple processors in a single node. The present enhancement adds support for a parameter in the PVM command line that enables the user to specify which Internet Protocol host address the code should use in communicating with other Beowulf nodes. This enhancement also provides for the case in which each node in a Beowulf system contains multiple processors. In this case, by making multiple references to a single node, the user can cause the software to spawn multiple tasks on the multiple processors in that node.

Springer, Paul↗

NASA NTRS2015

Wireless Sensor Node for Autonomous Monitoring and Alerts in Remote Environments

A method, apparatus, system, and computer program products provides personal alert and tracking capabilities using one or more nodes. Each node includes radio transceiver chips operating at different frequency ranges, a power amplifier, sensors, a display, and embedded software. The chips enable the node to operate as either a mobile sensor node or a relay base station node while providing a long distance relay link between nodes. The power amplifier enables a line-of-sight communication between the one or more nodes. The sensors provide a GPS signal, temperature, and accelerometer information (used to trigger an alert condition). The embedded software captures and processes the sensor information, provides a multi-hop packet routing protocol to relay the sensor information to and receive alert information from a command center, and to display the alert information on the display.

Monacos, Steve P.↗

NASA NTRSDate not supplied

Nodal Modeling of Tank Pressurization and Draining using a Multi-Node-Ullage Approach

Pressurized expulsion tests of liquid methane were modeled by a nodal code using a multinode ullage approach. Generalized Fluid System Simulation Program (GFSSP), a finite volume based nodal code was used to model the expulsion of liquid methane from a 1.52-meter (5 ft) diameter spherical tank by pressurizing with helium and gaseous methane. The purpose of the model was to estimate the amount of pressurant required and amount of condensation and evaporation of methane during the operation. The ullage was discretized into multiple nodes and each fluid node was connected to solid nodes. Both the fluid and solid nodes grow as the tank drains. The heat and mass transfer between fluid and solid node in the tank ullage was computed. The heat and mass transfer between the bottom ullage node and the liquid methane was also computed. The model predictions were compared with data from twelve test cases. The predicted pressurant consumption for helium pressurization compares with test data with a Mean Absolute Percent Error (MAPE) of 3 %. For autogenous pressurization, where gaseous methane was used to pressurize liquid methane, the predicted pressurant consumption compares with a MAPE of 6%.

Cryogenic Propellant↗

NASA NTRSDate not supplied

Nodal Modeling of Helium Pressurization and Autogenous Pressurization and Draining using a Multi-Node-Ullage Approach

Pressurized expulsion tests of liquid methane were modeled by a nodal code using a multinode ullage approach. Generalized Fluid System Simulation Program (GFSSP), a finite volume based nodal code was used to model the expulsion of liquid methane from a 1.52-meter (5 ft) diameter spherical tank by pressurizing with helium and gaseous methane. The purpose of the model was to estimate the amount of pressurant required and amount of condensation and evaporation of methane during the operation. The ullage was discretized into multiple nodes and each fluid node was connected to solid nodes. Both the fluid and solid nodes grow as the tank drains. The heat and mass transfer between fluid and solid node in the tank ullage was computed. The heat and mass transfer between the bottom ullage node and the liquid methane was also computed. The model predictions were compared with data from twelve test cases. The predicted pressurant consumption for helium pressurization compares with test data with a Mean Absolute Percent Error (MAPE) of 3%. For autogenous pressurization, where gaseous methane was used to pressurize liquid methane, the predicted pressurant consumption compares with a MAPE of 6%.

Nodal Model↗

DOE OSTI2025

NLR HPC Eagle GPU Node Metrics

Ganglia node metrics and iLO (Integrated Lights Out) power data captured from six representative Eagle GPU nodes The Eagle HPC operated at NLR from 2019 through 2024. Eagle was a 2,000-node, 8-petaflop system. This dataset is a representative sample of metrics for 6 of the GPU nodes. Each GPU node contained 2 CPUs and 2 GPUs. Data provided in compressed CSV format. Ganglia and iLO Power Time Series Fields ts: Timestamp dv: Device / Node - Rack and Unit - r103u17 == r(ack)103u(nit)17 mt: Metric (only present for Ganglia) vl: Value - Value in watts for iLO power (instantaneous value at sampling time) or specified Ganglia metric below Ganglia Metrics Metric name -- Metric description -- Unit cpu_aidle -- Percent of time since boot idle CPU -- Percent cpu_idle -- Percent CPU idle -- Percent cpu_nice -- Percent CPU nice -- Percent cpu_speed -- Speed in MHz of CPU -- MHz cpu_user -- Percent CPU user -- Percent cpu_wio -- The percentage of CPU Wait I/O -- Percent gpu0_bar1_memory -- Used GPU bar1 memory -- MB gpu0_decoder_util -- GPU decoder utilization -- Percent gpu0_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu0_encoder_util -- GPU encoder utilization -- Percent gpu0_fan -- Fan speed -- RPM gpu0_fb_memory -- Used GPU framebuffer memory -- MB gpu0_graphics_clock_report -- Current clock speeds for the device -- MHz gpu0_mem_total -- Memory total -- MB gpu0_mem_util -- Memory utilization -- Percent gpu0_power_usage_report -- Power usage report -- Watts gpu0_temp -- GPU 1 temperature -- Celsius gpu1_bar1_memory -- Used GPU bar1 memory -- MB gpu1_decoder_util -- GPU decoder utilization -- Percent gpu1_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu1_encoder_util -- GPU encoder utilization -- Percent gpu1_fan -- Fan speed -- RPM gpu1_fb_memory -- Used GPU framebuffer memory -- MB gpu1_graphics_clock_report -- Current clock speeds for the GPU -- MHz gpu1_mem_total -- Memory total -- MB gpu1_mem_util -- Memory utilization -- MB gpu1_power_usage_report -- Power usage report -- Watts gpu1_temp -- GPU 1 temperature -- Celsius ipmi_cpu1_temp -- CPU 1 temperature -- Celsius ipmi_cpu2_temp -- CPU 2 temperature -- Celsius ipmi_inlet_ambient_temp -- Temperature measured at intake -- Celsius ipmi_vr_p1_temp -- CPU 1 voltage regulator temperature -- Celsius ipmi_vr_p2_temp -- CPU 2 voltage regulator temperature -- Celsius mem_buffers -- Amount of buffered memory -- Bytes mem_cached -- Amount of cached memory -- Bytes mem_free -- Amount of available memory -- Bytes mem_shared -- Amount of shared memory -- Bytes mem_total -- Amount of available memory -- Bytes

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Improving Property Graph Layouts by Leveraging Attribute Similarity for Structurally Equivalent Nodes

Many real-world networks contain structurally-equivalent nodes. These are defined as vertices that share the same set of neighboring nodes, making them interchangeable with a traditional graph layout approach. However, many real-world graphs also have properties associated with nodes, adding additional meaning to them. We present an approach for swapping locations of structurally-equivalent nodes in graph layout so that those with more similar properties have closer proximity to each other. This improves the usefulness of the visualization from an attribute perspective without negatively impacting the visualization from a structural perspective. We include an algorithm for finding these sets of nodes in linear time, as well as methodologies for ordering nodes based on their attribute similarity, which works for scalar, ordinal, multidimensional, and categorical data.

graph drawing, network visualization, property gra↗

NASA NTRS1988

Nodes packaging option for Space Station application

Space Station nodes packaging analyses are presented relative to moving environmental control and life support system (ECLSS) equipment from the habitability (HAB) module to node 4, in order to provide more living space and privacy for the crew, remove inherently noisy equipment from the crew quarter, retain crew waste collection and processing equipment in one location, and keep objectionable odor away from the living quarters. In addition, options for moving external electronic equipment from the Space Station truss to pressurized node 3 were evaluated in order to reduce the crew extravehicular-activity time required to install and maintain the equipment. Node size considered in this analysis is 3.66 m in diameter and 5.38 m long. The analysis shows that significant external electronic equipment could be relocated from the Space Station truss structure to node 3, and nonlife critical ECLSS HAB module equipment could be moved to node 4.

So, Kenneth T.↗

NASA NTRS1989

Morphological study of the innervation pattern of the rabbit sinoatrial node

The pattern of sinoatrial (SA) node innervations in rabbit was elucidated using a newly developed highly reproducible cholinesterase/silver impregnation staining procedure which made it possible to delineate large nerves, fine processes, and ganglion cells. The SA node and dominant pacemaker sites were identified by microelectrode recording. A generalized pattern of innnervation was recognized, which includes a large ganglionic complex inferior to the SA node; two or more moderately large nerves traversing the SA node parallel to the crista terminalis; nerves entering the intercaval region from the septum, the superior vena cava, and the inferior vena cava to impinge on the SA node; and a fine network of nerve processes, which was particularly dense in the SA node. From the location and distribution of the nerves and ganglionic branches, it can be inferred that the neural network in the intercaval region is capable of performing complex modulatory and integrative functions among the structures within this region.

Roberts, L. A.↗