Active pixel sensor with intra-pixel charge transfer

NASA Technical Reports Server (NTRS)

Fossum, Eric R. (Inventor); Mendis, Sunetra (Inventor); Kemeny, Sabrina E. (Inventor)

1995-01-01

An imaging device formed as a monolithic complementary metal oxide semiconductor integrated circuit in an industry standard complementary metal oxide semiconductor process, the integrated circuit including a focal plane array of pixel cells, each one of the cells including a photogate overlying the substrate for accumulating photo-generated charge in an underlying portion of the substrate, a readout circuit including at least an output field effect transistor formed in the substrate, and a charge coupled device section formed on the substrate adjacent the photogate having a sensing node connected to the output transistor and at least one charge coupled device stage for transferring charge from the underlying portion of the substrate to the sensing node.

Active pixel sensor with intra-pixel charge transfer

NASA Technical Reports Server (NTRS)

Fossum, Eric R. (Inventor); Mendis, Sunetra (Inventor); Kemeny, Sabrina E. (Inventor)

2003-01-01

An imaging device formed as a monolithic complementary metal oxide semiconductor integrated circuit in an industry standard complementary metal oxide semiconductor process, the integrated circuit including a focal plane array of pixel cells, each one of the cells including a photogate overlying the substrate for accumulating photo-generated charge in an underlying portion of the substrate, a readout circuit including at least an output field effect transistor formed in the substrate, and a charge coupled device section formed on the substrate adjacent the photogate having a sensing node connected to the output transistor and at least one charge coupled device stage for transferring charge from the underlying portion of the substrate to the sensing node.

Active pixel sensor with intra-pixel charge transfer

NASA Technical Reports Server (NTRS)

Fossum, Eric R. (Inventor); Mendis, Sunetra (Inventor); Kemeny, Sabrina E. (Inventor)

2004-01-01

An imaging device formed as a monolithic complementary metal oxide semiconductor integrated circuit in an industry standard complementary metal oxide semiconductor process, the integrated circuit including a focal plane array of pixel cells, each one of the cells including a photogate overlying the substrate for accumulating photo-generated charge in an underlying portion of the substrate, a readout circuit including at least an output field effect transistor formed in the substrate, and a charge coupled device section formed on the substrate adjacent the photogate having a sensing node connected to the output transistor and at least one charge coupled device stage for transferring charge from the underlying portion of the substrate to the sensing node.

Cooperation among wirelessly connected static and mobile sensor nodes for surveillance applications.

PubMed

de Freitas, Edison Pignaton; Heimfarth, Tales; Vinel, Alexey; Wagner, Flávio Rech; Pereira, Carlos Eduardo; Larsson, Tony

2013-09-25

This paper presents a bio-inspired networking strategy to support the cooperation between static sensors on the ground and mobile sensors in the air to perform surveillance missions in large areas. The goal of the proposal is to provide low overhead in the communication among sensor nodes, while allocating the mobile sensors to perform sensing activities requested by the static ones. Simulations have shown that the strategy is efficient in maintaining low overhead and achieving the desired coordination.

Method of acquiring an image from an optical structure having pixels with dedicated readout circuits

NASA Technical Reports Server (NTRS)

Fossum, Eric R. (Inventor); Mendis, Sunetra (Inventor); Kemeny, Sabrina E. (Inventor)

2006-01-01

An imaging device formed as a monolithic complementary metal oxide semiconductor integrated circuit in an industry standard complementary metal oxide semiconductor process, the integrated circuit including a focal plane array of pixel cells, each one of the cells including a photogate overlying the substrate for accumulating photo-generated charge in an underlying portion of the substrate, a readout circuit including at least an output field effect transistor formed in the substrate, and a charge coupled device section formed on the substrate adjacent the photogate having a sensing node connected to the output transistor and at least one charge coupled device stage for transferring charge from the underlying portion of the substrate to the sensing node.

Hybrid networking sensing system for structural health monitoring of a concrete cable-stayed bridge

NASA Astrophysics Data System (ADS)

Torbol, Marco; Kim, Sehwan; Chien, Ting-Chou; Shinozuka, Masanobu

2013-04-01

The purpose of this study is the remote structural health monitoring to identify the torsional natural frequencies and mode shapes of a concrete cable-stayed bridge using a hybrid networking sensing system. The system consists of one data aggregation unit, which is daisy-chained to one or more sensing nodes. A wireless interface is used between the data aggregation units, whereas a wired interface is used between a data aggregation unit and the sensing nodes. Each sensing node is equipped with high-precision MEMS accelerometers with adjustable sampling frequency from 0.2 Hz to 1.2 kHz. The entire system was installed inside the reinforced concrete box-girder deck of Hwamyung Bridge, which is a cable stayed bridge in Busan, South Korea, to protect the system from the harsh environmental conditions. This deployment makes wireless communication a challenge due to the signal losses and the high levels of attenuation. To address these issues, the concept of hybrid networking system is introduced with the efficient local power distribution technique. The theoretical communication range of Wi-Fi is 100m. However, inside the concrete girder, the peer to peer wireless communication cannot exceed about 20m. The distance is further reduced by the line of sight between the antennas. However, the wired daisy-chained connection between sensing nodes is useful because the data aggregation unit can be placed in the optimal location for transmission. To overcome the limitation of the wireless communication range, we adopt a high-gain antenna that extends the wireless communication distance to 50m. Additional help is given by the multi-hopping data communication protocol. The 4G modem, which allows remote access to the system, is the only component exposed to the external environment.

Islands and Bridges: Making Sense of Marked Nodes in Large Graphs

DTIC Science & Technology

2012-08-01

time-evolving graphs. References [1] Nouf M. Kh. Alsudairy, Vijay V. Raghavan, Alaaeldin M. Hafez, and Hassan I Mathkour. Connection subgraphs: A survey...Riedy, David A. Bader, Karl Jiang, Pushkar Pande, , and Richa Sharma . Detecting communities from given seeds in social networks. Technical Report GT-CSE

A Cluster-Based Architecture to Structure the Topology of Parallel Wireless Sensor Networks

PubMed Central

Lloret, Jaime; Garcia, Miguel; Bri, Diana; Diaz, Juan R.

2009-01-01

A wireless sensor network is a self-configuring network of mobile nodes connected by wireless links where the nodes have limited capacity and energy. In many cases, the application environment requires the design of an exclusive network topology for a particular case. Cluster-based network developments and proposals in existence have been designed to build a network for just one type of node, where all nodes can communicate with any other nodes in their coverage area. Let us suppose a set of clusters of sensor nodes where each cluster is formed by different types of nodes (e.g., they could be classified by the sensed parameter using different transmitting interfaces, by the node profile or by the type of device: laptops, PDAs, sensor etc.) and exclusive networks, as virtual networks, are needed with the same type of sensed data, or the same type of devices, or even the same type of profiles. In this paper, we propose an algorithm that is able to structure the topology of different wireless sensor networks to coexist in the same environment. It allows control and management of the topology of each network. The architecture operation and the protocol messages will be described. Measurements from a real test-bench will show that the designed protocol has low bandwidth consumption and also demonstrates the viability and the scalability of the proposed architecture. Our ccluster-based algorithm is compared with other algorithms reported in the literature in terms of architecture and protocol measurements. PMID:22303185

Earthquake Complex Network applied along the Chilean Subduction Zone.

NASA Astrophysics Data System (ADS)

Martin, F.; Pasten, D.; Comte, D.

2017-12-01

In recent years the earthquake complex networks have been used as a useful tool to describe and characterize the behavior of seismicity. The earthquake complex network is built in space, dividing the three dimensional space in cubic cells. If the cubic cell contains a hypocenter, we call this cell like a node. The connections between nodes follows the time sequence of the occurrence of the seismic events. In this sense, we have a spatio-temporal configuration of a specific region using the seismicity in that zone. In this work, we are applying complex networks to characterize the subduction zone along the coast of Chile using two networks: a directed and an undirected network. The directed network takes in consideration the time-direction of the connections, that is very important for the connectivity of the network: we are considering the connectivity, ki of the i-th node, like the number of connections going out from the node i and we add the self-connections (if two seismic events occurred successive in time in the same cubic cell, we have a self-connection). The undirected network is the result of remove the direction of the connections and the self-connections from the directed network. These two networks were building using seismic data events recorded by CSN (Chilean Seismological Center) in Chile. This analysis includes the last largest earthquakes occurred in Iquique (April 2014) and in Illapel (September 2015). The result for the directed network shows a change in the value of the critical exponent along the Chilean coast. The result for the undirected network shows a small-world behavior without important changes in the topology of the network. Therefore, the complex network analysis shows a new form to characterize the Chilean subduction zone with a simple method that could be compared with another methods to obtain more details about the behavior of the seismicity in this region.

Dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job

DOE Office of Scientific and Technical Information (OSTI.GOV)

Budnik, Thomas A; Knudson, Brant L; Megerian, Mark G

Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of computemore » nodes running the re-launched job.« less

New strategies for SHM based on a multichannel wireless AE node

NASA Astrophysics Data System (ADS)

Godinez-Azcuaga, Valery; Ley, Obdulia

2014-03-01

This paper discusses the development of an Acoustic Emission (AE) wireless node and its application for SHM (Structural Health Monitoring). The instrument development was planned for applications monitoring steel and concrete bridges components. The final product, now commercially available, is a sensor node which includes multiple sensing elements, on board signal processing and analysis capabilities, signal conditioning electronics, power management circuits, wireless data transmission element and energy harvesting unit. The sensing elements are capable of functioning in both passive and active modes, while the multiple parametric inputs are available for connecting various sensor types to measure external characteristics affecting the performance of the structure under monitoring. The output of all these sensors are combined and analyzed at the node in order to minimize the data transmission rate, which consumes significant amount of power. Power management circuits are used to reduce the data collection intervals through selective data acquisition strategies and minimize the sensor node power consumption. This instrument, known as the 1284, is an excellent platform to deploy SHM in the original bridge applications, but initial prototypes has shown significant potential in monitoring composite wind turbine blades and composites mockups of Unmanned Autonomous Vehicles (UAV) components; currently we are working to extend the use of this system to fields such as coal flow, power transformer, and off-shore platform monitoring.

New Markov-Shannon Entropy models to assess connectivity quality in complex networks: from molecular to cellular pathway, Parasite-Host, Neural, Industry, and Legal-Social networks.

PubMed

Riera-Fernández, Pablo; Munteanu, Cristian R; Escobar, Manuel; Prado-Prado, Francisco; Martín-Romalde, Raquel; Pereira, David; Villalba, Karen; Duardo-Sánchez, Aliuska; González-Díaz, Humberto

2012-01-21

Graph and Complex Network theory is expanding its application to different levels of matter organization such as molecular, biological, technological, and social networks. A network is a set of items, usually called nodes, with connections between them, which are called links or edges. There are many different experimental and/or theoretical methods to assign node-node links depending on the type of network we want to construct. Unfortunately, the use of a method for experimental reevaluation of the entire network is very expensive in terms of time and resources; thus the development of cheaper theoretical methods is of major importance. In addition, different methods to link nodes in the same type of network are not totally accurate in such a way that they do not always coincide. In this sense, the development of computational methods useful to evaluate connectivity quality in complex networks (a posteriori of network assemble) is a goal of major interest. In this work, we report for the first time a new method to calculate numerical quality scores S(L(ij)) for network links L(ij) (connectivity) based on the Markov-Shannon Entropy indices of order k-th (θ(k)) for network nodes. The algorithm may be summarized as follows: (i) first, the θ(k)(j) values are calculated for all j-th nodes in a complex network already constructed; (ii) A Linear Discriminant Analysis (LDA) is used to seek a linear equation that discriminates connected or linked (L(ij)=1) pairs of nodes experimentally confirmed from non-linked ones (L(ij)=0); (iii) the new model is validated with external series of pairs of nodes; (iv) the equation obtained is used to re-evaluate the connectivity quality of the network, connecting/disconnecting nodes based on the quality scores calculated with the new connectivity function. This method was used to study different types of large networks. The linear models obtained produced the following results in terms of overall accuracy for network reconstruction: Metabolic networks (72.3%), Parasite-Host networks (93.3%), CoCoMac brain cortex co-activation network (89.6%), NW Spain fasciolosis spreading network (97.2%), Spanish financial law network (89.9%) and World trade network for Intelligent & Active Food Packaging (92.8%). In order to seek these models, we studied an average of 55,388 pairs of nodes in each model and a total of 332,326 pairs of nodes in all models. Finally, this method was used to solve a more complicated problem. A model was developed to score the connectivity quality in the Drug-Target network of US FDA approved drugs. In this last model the θ(k) values were calculated for three types of molecular networks representing different levels of organization: drug molecular graphs (atom-atom bonds), protein residue networks (amino acid interactions), and drug-target network (compound-protein binding). The overall accuracy of this model was 76.3%. This work opens a new door to the computational reevaluation of network connectivity quality (collation) for complex systems in molecular, biomedical, technological, and legal-social sciences as well as in world trade and industry. Copyright © 2011 Elsevier Ltd. All rights reserved.

An Electronic-Nose Sensor Node Based on a Polymer-Coated Surface Acoustic Wave Array for Wireless Sensor Network Applications

PubMed Central

Tang, Kea-Tiong; Li, Cheng-Han; Chiu, Shih-Wen

2011-01-01

This study developed an electronic-nose sensor node based on a polymer-coated surface acoustic wave (SAW) sensor array. The sensor node comprised an SAW sensor array, a frequency readout circuit, and an Octopus II wireless module. The sensor array was fabricated on a large K2 128° YX LiNbO3 sensing substrate. On the surface of this substrate, an interdigital transducer (IDT) was produced with a Cr/Au film as its metallic structure. A mixed-mode frequency readout application specific integrated circuit (ASIC) was fabricated using a TSMC 0.18 μm process. The ASIC output was connected to a wireless module to transmit sensor data to a base station for data storage and analysis. This sensor node is applicable for wireless sensor network (WSN) applications. PMID:22163865

An electronic-nose sensor node based on a polymer-coated surface acoustic wave array for wireless sensor network applications.

PubMed

Tang, Kea-Tiong; Li, Cheng-Han; Chiu, Shih-Wen

2011-01-01

This study developed an electronic-nose sensor node based on a polymer-coated surface acoustic wave (SAW) sensor array. The sensor node comprised an SAW sensor array, a frequency readout circuit, and an Octopus II wireless module. The sensor array was fabricated on a large K(2) 128° YX LiNbO3 sensing substrate. On the surface of this substrate, an interdigital transducer (IDT) was produced with a Cr/Au film as its metallic structure. A mixed-mode frequency readout application specific integrated circuit (ASIC) was fabricated using a TSMC 0.18 μm process. The ASIC output was connected to a wireless module to transmit sensor data to a base station for data storage and analysis. This sensor node is applicable for wireless sensor network (WSN) applications.

Implementation of Multiple Host Nodes in Wireless Sensing Node Network System for Landslide Monitoring

NASA Astrophysics Data System (ADS)

Abas, Faizulsalihin bin; Takayama, Shigeru

2015-02-01

This paper proposes multiple host nodes in Wireless Sensing Node Network System (WSNNS) for landslide monitoring. As landslide disasters damage monitoring system easily, one major demand in landslide monitoring is the flexibility and robustness of the system to evaluate the current situation in the monitored area. For various reasons WSNNS can provide an important contribution to reach that aim. In this system, acceleration sensors and GPS are deployed in sensing nodes. Location information by GPS, enable the system to estimate network topology and enable the system to perceive the location in emergency by monitoring the node mode. Acceleration sensors deployment, capacitate this system to detect slow mass movement that can lead to landslide occurrence. Once deployed, sensing nodes self-organize into an autonomous wireless ad hoc network. The measurement parameter data from sensing nodes is transmitted to Host System via host node and "Cloud" System. The implementation of multiple host nodes in Local Sensing Node Network System (LSNNS), improve risk- management of the WSNNS for real-time monitoring of landslide disaster.

A Coral Reef Algorithm Based on Learning Automata for the Coverage Control Problem of Heterogeneous Directional Sensor Networks

PubMed Central

Li, Ming; Miao, Chunyan; Leung, Cyril

2015-01-01

Coverage control is one of the most fundamental issues in directional sensor networks. In this paper, the coverage optimization problem in a directional sensor network is formulated as a multi-objective optimization problem. It takes into account the coverage rate of the network, the number of working sensor nodes and the connectivity of the network. The coverage problem considered in this paper is characterized by the geographical irregularity of the sensed events and heterogeneity of the sensor nodes in terms of sensing radius, field of angle and communication radius. To solve this multi-objective problem, we introduce a learning automata-based coral reef algorithm for adaptive parameter selection and use a novel Tchebycheff decomposition method to decompose the multi-objective problem into a single-objective problem. Simulation results show the consistent superiority of the proposed algorithm over alternative approaches. PMID:26690162

A Coral Reef Algorithm Based on Learning Automata for the Coverage Control Problem of Heterogeneous Directional Sensor Networks.

PubMed

Li, Ming; Miao, Chunyan; Leung, Cyril

2015-12-04

Coverage control is one of the most fundamental issues in directional sensor networks. In this paper, the coverage optimization problem in a directional sensor network is formulated as a multi-objective optimization problem. It takes into account the coverage rate of the network, the number of working sensor nodes and the connectivity of the network. The coverage problem considered in this paper is characterized by the geographical irregularity of the sensed events and heterogeneity of the sensor nodes in terms of sensing radius, field of angle and communication radius. To solve this multi-objective problem, we introduce a learning automata-based coral reef algorithm for adaptive parameter selection and use a novel Tchebycheff decomposition method to decompose the multi-objective problem into a single-objective problem. Simulation results show the consistent superiority of the proposed algorithm over alternative approaches.

Node Redeployment Algorithm Based on Stratified Connected Tree for Underwater Sensor Networks

PubMed Central

Liu, Jun; Jiang, Peng; Wu, Feng; Yu, Shanen; Song, Chunyue

2016-01-01

During the underwater sensor networks (UWSNs) operation, node drift with water environment causes network topology changes. Periodic node location examination and adjustment are needed to maintain good network monitoring quality as long as possible. In this paper, a node redeployment algorithm based on stratified connected tree for UWSNs is proposed. At every network adjustment moment, self-examination and adjustment on node locations are performed firstly. If a node is outside the monitored space, it returns to the last location recorded in its memory along straight line. Later, the network topology is stratified into a connected tree that takes the sink node as the root node by broadcasting ready information level by level, which can improve the network connectivity rate. Finally, with synthetically considering network coverage and connectivity rates, and node movement distance, the sink node performs centralized optimization on locations of leaf nodes in the stratified connected tree. Simulation results show that the proposed redeployment algorithm can not only keep the number of nodes in the monitored space as much as possible and maintain good network coverage and connectivity rates during network operation, but also reduce node movement distance during node redeployment and prolong the network lifetime. PMID:28029124

Queues on a Dynamically Evolving Graph

NASA Astrophysics Data System (ADS)

Mandjes, Michel; Starreveld, Nicos J.; Bekker, René

2018-04-01

This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in parallel. The links that connect the queues have the special feature that they are unreliable, in the sense that their status alternates between `up' and `down'. If a link between two nodes is down, with a fixed probability each of the clients attempting to use that link is lost; otherwise the client remains at the origin node and reattempts using the link (and jumps to the destination node when it finds the link restored). For these networks we present the following results: (a) a system of coupled partial differential equations that describes the joint probability generating function corresponding to the queues' time-dependent behavior (and a system of ordinary differential equations for its stationary counterpart), (b) an algorithm to evaluate the (time-dependent and stationary) moments, and procedures to compute user-perceived performance measures which facilitate the quantification of the impact of the links' outages, (c) a diffusion limit for the joint queue length process. We include explicit results for a series relevant special cases, such as tandem networks and symmetric fully connected networks.

A Wireless Electronic Nose System Using a Fe2O3 Gas Sensing Array and Least Squares Support Vector Regression

PubMed Central

Song, Kai; Wang, Qi; Liu, Qi; Zhang, Hongquan; Cheng, Yingguo

2011-01-01

This paper describes the design and implementation of a wireless electronic nose (WEN) system which can online detect the combustible gases methane and hydrogen (CH4/H2) and estimate their concentrations, either singly or in mixtures. The system is composed of two wireless sensor nodes—a slave node and a master node. The former comprises a Fe2O3 gas sensing array for the combustible gas detection, a digital signal processor (DSP) system for real-time sampling and processing the sensor array data and a wireless transceiver unit (WTU) by which the detection results can be transmitted to the master node connected with a computer. A type of Fe2O3 gas sensor insensitive to humidity is developed for resistance to environmental influences. A threshold-based least square support vector regression (LS-SVR)estimator is implemented on a DSP for classification and concentration measurements. Experimental results confirm that LS-SVR produces higher accuracy compared with artificial neural networks (ANNs) and a faster convergence rate than the standard support vector regression (SVR). The designed WEN system effectively achieves gas mixture analysis in a real-time process. PMID:22346587

mDARAL: A Multi-Radio Version for the DARAL Routing Algorithm.

PubMed

Estévez, Francisco José; Castillo-Secilla, José María; González, Jesús; Olivares, Joaquín; Glösekötter, Peter

2017-02-09

Smart Cities are called to change the daily life of human beings. This concept permits improving the efficiency of our cities in several areas such as the use of water, energy consumption, waste treatment, and mobility both for people as well as vehicles throughout the city. This represents an interconnected scenario in which thousands of embedded devices need to work in a collaborative way both for sensing and modifying the environment properly. Under this scenario, the majority of devices will use wireless protocols for communicating among them, representing a challenge for optimizing the use of the electromagnetic spectrum. When the density of deployed nodes increases, the competition for using the physical medium becomes harder and, in consequence, traffic collisions will be higher, affecting data-rates in the communication process. This work presents mDARAL , a multi-radio routing algorithm based on the Dynamic and Adaptive Radio Algorithm ( DARAL ), which has the capability of isolating groups of nodes into sub-networks. The nodes of each sub-network will communicate among them using a dedicated radio frequency, thus isolating the use of the radio channel to a reduced number of nodes. Each sub-network will have a master node with two physical radios, one for communicating with its neighbours and the other for being the contact point among its group and other sub-networks. The communication among sub-networks is done through master nodes in a dedicated radio frequency. The algorithm works to maximize the overall performance of the network through the distribution of the traffic messages into unoccupied frequencies. The obtained results show that mDARAL achieves great improvement in terms of the number of control messages necessary to connect a node to the network, convergence time and energy consumption during the connection phase compared to DARAL .

mDARAL: A Multi-Radio Version for the DARAL Routing Algorithm

PubMed Central

Estévez, Francisco José; Castillo-Secilla, José María; González, Jesús; Olivares, Joaquín; Glösekötter, Peter

2017-01-01

Smart Cities are called to change the daily life of human beings. This concept permits improving the efficiency of our cities in several areas such as the use of water, energy consumption, waste treatment, and mobility both for people as well as vehicles throughout the city. This represents an interconnected scenario in which thousands of embedded devices need to work in a collaborative way both for sensing and modifying the environment properly. Under this scenario, the majority of devices will use wireless protocols for communicating among them, representing a challenge for optimizing the use of the electromagnetic spectrum. When the density of deployed nodes increases, the competition for using the physical medium becomes harder and, in consequence, traffic collisions will be higher, affecting data-rates in the communication process. This work presents mDARAL, a multi-radio routing algorithm based on the Dynamic and Adaptive Radio Algorithm (DARAL), which has the capability of isolating groups of nodes into sub-networks. The nodes of each sub-network will communicate among them using a dedicated radio frequency, thus isolating the use of the radio channel to a reduced number of nodes. Each sub-network will have a master node with two physical radios, one for communicating with its neighbours and the other for being the contact point among its group and other sub-networks. The communication among sub-networks is done through master nodes in a dedicated radio frequency. The algorithm works to maximize the overall performance of the network through the distribution of the traffic messages into unoccupied frequencies. The obtained results show that mDARAL achieves great improvement in terms of the number of control messages necessary to connect a node to the network, convergence time and energy consumption during the connection phase compared to DARAL. PMID:28208760

Monitoring Traffic Information with a Developed Acceleration Sensing Node.

PubMed

Ye, Zhoujing; Wang, Linbing; Xu, Wen; Gao, Zhifei; Yan, Guannan

2017-12-05

In this paper, an acceleration sensing node for pavement vibration was developed to monitor traffic information, including vehicle speed, vehicle types, and traffic flow, where a hardware design with low energy consumption and node encapsulation could be accomplished. The service performance of the sensing node was evaluated, by methods including waterproof test, compression test, sensing performance analysis, and comparison test. The results demonstrate that the sensing node is low in energy consumption, high in strength, IPX8 waterproof, and high in sensitivity and resolution. These characteristics can be applied to practical road environments. Two sensing nodes were spaced apart in the direction of travelling. In the experiment, three types of vehicles passed by the monitoring points at several different speeds and values of d (the distance between the sensor and the nearest tire center line). Based on cross-correlation with kernel pre-smoothing, a calculation method was applied to process the raw data. New algorithms for traffic flow, speed, and axle length were proposed. Finally, the effects of vehicle speed, vehicle weight, and d value on acceleration amplitude were statistically evaluated. It was found that the acceleration sensing node can be used for traffic flow, vehicle speed, and other types of monitoring.

Monitoring Traffic Information with a Developed Acceleration Sensing Node

PubMed Central

Ye, Zhoujing; Wang, Linbing; Xu, Wen; Gao, Zhifei; Yan, Guannan

2017-01-01

In this paper, an acceleration sensing node for pavement vibration was developed to monitor traffic information, including vehicle speed, vehicle types, and traffic flow, where a hardware design with low energy consumption and node encapsulation could be accomplished. The service performance of the sensing node was evaluated, by methods including waterproof test, compression test, sensing performance analysis, and comparison test. The results demonstrate that the sensing node is low in energy consumption, high in strength, IPX8 waterproof, and high in sensitivity and resolution. These characteristics can be applied to practical road environments. Two sensing nodes were spaced apart in the direction of travelling. In the experiment, three types of vehicles passed by the monitoring points at several different speeds and values of d (the distance between the sensor and the nearest tire center line). Based on cross-correlation with kernel pre-smoothing, a calculation method was applied to process the raw data. New algorithms for traffic flow, speed, and axle length were proposed. Finally, the effects of vehicle speed, vehicle weight, and d value on acceleration amplitude were statistically evaluated. It was found that the acceleration sensing node can be used for traffic flow, vehicle speed, and other types of monitoring. PMID:29206169

Evaluation of the impact of furniture on communications performance for ubiquitous deployment of Wireless Sensor Networks in smart homes.

PubMed

Bleda, Andrés L; Jara, Antonio J; Maestre, Rafael; Santa, Guadalupe; Gómez Skarmeta, Antonio F

2012-01-01

The extensions of the environment with the integration of sensing systems in any space, in conjunction with ubiquitous computing are enabling the so-called Smart Space Sensor Networks. This new generation of networks are offering full connectivity with any object, through the Internet of Things (IoT) and/or the Web, i.e., the Web of Things. These connectivity capabilities are making it feasible to sense the behaviours of people at home and act accordingly. These sensing systems must be integrated within typical elements found at home such as furniture. For that reason, this work considers furniture as an interesting element for the transparent location of sensors. Furniture is a ubiquitous object, i.e., it can be found everywhere at home or the office, and it can integrate and hide the sensors of a network. This work addresses the lack of an exhaustive study of the effect of furniture on signal losses. In addition an easy-to-use tool for estimating the robustness of the communication channel among the sensor nodes and gateways is proposed. Specifically, the losses in a sensor network signal due to the materials found within the communication link are evaluated. Then, this work proposes a software tool that gathers the obtained results and is capable of evaluating the impact of a given set of materials on the communications. This tool also provides a mechanism to optimize the sensor network deployments during the definition of smart spaces. Specifically, it provides information such as: maximum distances between sensor nodes, most suitable type of furniture to integrate sensors, or battery life of sensor nodes. This tool has been validated empirically in the lab, and it is currently being used by several enterprise partners of the Technological Centre of Furniture and Wood in the southeast of Spain.

Evaluation of the Impact of Furniture on Communications Performance for Ubiquitous Deployment of Wireless Sensor Networks in Smart Homes

PubMed Central

Bleda, Andrés L.; Jara, Antonio J.; Maestre, Rafael; Santa, Guadalupe; Gómez Skarmeta, Antonio F.

2012-01-01

The extensions of the environment with the integration of sensing systems in any space, in conjunction with ubiquitous computing are enabling the so-called Smart Space Sensor Networks. This new generation of networks are offering full connectivity with any object, through the Internet of Things (IoT) and/or the Web, i.e., the Web of Things. These connectivity capabilities are making it feasible to sense the behaviours of people at home and act accordingly. These sensing systems must be integrated within typical elements found at home such as furniture. For that reason, this work considers furniture as an interesting element for the transparent location of sensors. Furniture is a ubiquitous object, i.e., it can be found everywhere at home or the office, and it can integrate and hide the sensors of a network. This work addresses the lack of an exhaustive study of the effect of furniture on signal losses. In addition an easy-to-use tool for estimating the robustness of the communication channel among the sensor nodes and gateways is proposed. Specifically, the losses in a sensor network signal due to the materials found within the communication link are evaluated. Then, this work proposes a software tool that gathers the obtained results and is capable of evaluating the impact of a given set of materials on the communications. This tool also provides a mechanism to optimize the sensor network deployments during the definition of smart spaces. Specifically, it provides information such as: maximum distances between sensor nodes, most suitable type of furniture to integrate sensors, or battery life of sensor nodes. This tool has been validated empirically in the lab, and it is currently being used by several enterprise partners of the Technological Centre of Furniture and Wood in the southeast of Spain. PMID:22778653

Node property of weighted networks considering connectability to nodes within two degrees of separation.

PubMed

Amano, Sun-Ichi; Ogawa, Ken-Ichiro; Miyake, Yoshihiro

2018-05-31

Weighted networks have been extensively studied because they can represent various phenomena in which the diversity of edges is essential. To investigate the properties of weighted networks, various centrality measures have been proposed, such as strength, weighted clustering coefficients, and weighted betweenness centrality. In such measures, only direct connections or entire network connectivity from arbitrary nodes have been used to calculate the connectivity of each node. However, in weighted networks composed of autonomous elements such as humans, middle ranges from each node are also considered to be meaningful for characterizing each node's connectability. In this study, we define a new node property in weighted networks to consider connectability to nodes within a range of two degrees of separation, then apply this new centrality to face-to-face human communication networks in corporate organizations. Our results show that the proposed centrality distinguishes inherent communities corresponding to the job types in each organization with a high degree of accuracy. This indicates the possibility that connectability to nodes within two degrees of separation reveals potential trends of weighted networks that are not apparent from conventional measures.

Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.

PubMed

Itoh, Takayuki; Klein, Karsten

2015-01-01

Many graph-drawing methods apply node-clustering techniques based on the density of edges to find tightly connected subgraphs and then hierarchically visualize the clustered graphs. However, users may want to focus on important nodes and their connections to groups of other nodes for some applications. For this purpose, it is effective to separately visualize the key nodes detected based on adjacency and attributes of the nodes. This article presents a graph visualization technique for attribute-embedded graphs that applies a graph-clustering algorithm that accounts for the combination of connections and attributes. The graph clustering step divides the nodes according to the commonality of connected nodes and similarity of feature value vectors. It then calculates the distances between arbitrary pairs of clusters according to the number of connecting edges and the similarity of feature value vectors and finally places the clusters based on the distances. Consequently, the technique separates important nodes that have connections to multiple large clusters and improves the visibility of such nodes' connections. To test this technique, this article presents examples with human relationship graph datasets, including a coauthorship and Twitter communication network dataset.

Shaper design in CMOS for high dynamic range

DOEpatents

De Geronimo, Gianluigi; Li, Shaorui

2015-06-30

An analog filter is presented that comprises a chain of filter stages, a feedback resistor for providing a negative feedback, and a feedback capacitor for providing a positive feedback. Each filter stage has an input node and an output node. The output node of a filter stage is connected to the input node of an immediately succeeding filter stage through a resistor. The feedback resistor has a first end connected to the output node of the last filter stage along the chain of filter stages, and a second end connected to the input node of a first preceding filter stage. The feedback capacitor has a first end connected to the output node of one of the chain of filter stages, and a second end connected to the input node of a second preceding filter stage.

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks

PubMed Central

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-01-01

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network. PMID:27754405

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks.

PubMed

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-10-14

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network.

An Efficient Distributed Compressed Sensing Algorithm for Decentralized Sensor Network.

PubMed

Liu, Jing; Huang, Kaiyu; Zhang, Guoxian

2017-04-20

We consider the joint sparsity Model 1 (JSM-1) in a decentralized scenario, where a number of sensors are connected through a network and there is no fusion center. A novel algorithm, named distributed compact sensing matrix pursuit (DCSMP), is proposed to exploit the computational and communication capabilities of the sensor nodes. In contrast to the conventional distributed compressed sensing algorithms adopting a random sensing matrix, the proposed algorithm focuses on the deterministic sensing matrices built directly on the real acquisition systems. The proposed DCSMP algorithm can be divided into two independent parts, the common and innovation support set estimation processes. The goal of the common support set estimation process is to obtain an estimated common support set by fusing the candidate support set information from an individual node and its neighboring nodes. In the following innovation support set estimation process, the measurement vector is projected into a subspace that is perpendicular to the subspace spanned by the columns indexed by the estimated common support set, to remove the impact of the estimated common support set. We can then search the innovation support set using an orthogonal matching pursuit (OMP) algorithm based on the projected measurement vector and projected sensing matrix. In the proposed DCSMP algorithm, the process of estimating the common component/support set is decoupled with that of estimating the innovation component/support set. Thus, the inaccurately estimated common support set will have no impact on estimating the innovation support set. It is proven that under the condition the estimated common support set contains the true common support set, the proposed algorithm can find the true innovation set correctly. Moreover, since the innovation support set estimation process is independent of the common support set estimation process, there is no requirement for the cardinality of both sets; thus, the proposed DCSMP algorithm is capable of tackling the unknown sparsity problem successfully.

Connecting node and method for constructing a connecting node

NASA Technical Reports Server (NTRS)

Johnson, Christopher J. (Inventor); Raboin, Jasen L. (Inventor); Spexarth, Gary R. (Inventor)

2011-01-01

A connecting node comprises a polyhedral structure comprising a plurality of panels joined together at its side edges to form a spherical approximation, wherein at least one of the plurality of panels comprises a faceted surface being constructed with a passage for integrating with one of a plurality of elements comprising a docking port, a hatch, and a window that is attached to the connecting node. A method for manufacturing a connecting node comprises the steps of providing a plurality of panels, connecting the plurality of panels to form a spherical approximation, wherein each edge of each panel of the plurality is joined to another edge of another panel, and constructing at least one of the plurality of panels to include a passage for integrating at least one of a plurality of elements that may be attached to the connecting node.

Node-based measures of connectivity in genetic networks.

PubMed

Koen, Erin L; Bowman, Jeff; Wilson, Paul J

2016-01-01

At-site environmental conditions can have strong influences on genetic connectivity, and in particular on the immigration and settlement phases of dispersal. However, at-site processes are rarely explored in landscape genetic analyses. Networks can facilitate the study of at-site processes, where network nodes are used to model site-level effects. We used simulated genetic networks to compare and contrast the performance of 7 node-based (as opposed to edge-based) genetic connectivity metrics. We simulated increasing node connectivity by varying migration in two ways: we increased the number of migrants moving between a focal node and a set number of recipient nodes, and we increased the number of recipient nodes receiving a set number of migrants. We found that two metrics in particular, the average edge weight and the average inverse edge weight, varied linearly with simulated connectivity. Conversely, node degree was not a good measure of connectivity. We demonstrated the use of average inverse edge weight to describe the influence of at-site habitat characteristics on genetic connectivity of 653 American martens (Martes americana) in Ontario, Canada. We found that highly connected nodes had high habitat quality for marten (deep snow and high proportions of coniferous and mature forest) and were farther from the range edge. We recommend the use of node-based genetic connectivity metrics, in particular, average edge weight or average inverse edge weight, to model the influences of at-site habitat conditions on the immigration and settlement phases of dispersal. © 2015 John Wiley & Sons Ltd.

Smart sensing surveillance system

NASA Astrophysics Data System (ADS)

Hsu, Charles; Chu, Kai-Dee; O'Looney, James; Blake, Michael; Rutar, Colleen

2010-04-01

Unattended ground sensor (UGS) networks have been widely used in remote battlefield and other tactical applications over the last few decades due to the advances of the digital signal processing. The UGS network can be applied in a variety of areas including border surveillance, special force operations, perimeter and building protection, target acquisition, situational awareness, and force protection. In this paper, a highly-distributed, fault-tolerant, and energyefficient Smart Sensing Surveillance System (S4) is presented to efficiently provide 24/7 and all weather security operation in a situation management environment. The S4 is composed of a number of distributed nodes to collect, process, and disseminate heterogeneous sensor data. Nearly all S4 nodes have passive sensors to provide rapid omnidirectional detection. In addition, Pan- Tilt- Zoom- (PTZ) Electro-Optics EO/IR cameras are integrated to selected nodes to track the objects and capture associated imagery. These S4 camera-connected nodes will provide applicable advanced on-board digital image processing capabilities to detect and track the specific objects. The imaging detection operations include unattended object detection, human feature and behavior detection, and configurable alert triggers, etc. In the S4, all the nodes are connected with a robust, reconfigurable, LPI/LPD (Low Probability of Intercept/ Low Probability of Detect) wireless mesh network using Ultra-wide band (UWB) RF technology, which can provide an ad-hoc, secure mesh network and capability to relay network information, communicate and pass situational awareness and messages. The S4 utilizes a Service Oriented Architecture such that remote applications can interact with the S4 network and use the specific presentation methods. The S4 capabilities and technologies have great potential for both military and civilian applications, enabling highly effective security support tools for improving surveillance activities in densely crowded environments and near perimeters and borders. The S4 is compliant with Open Geospatial Consortium - Sensor Web Enablement (OGC-SWE®) standards. It would be directly applicable to solutions for emergency response personnel, law enforcement, and other homeland security missions, as well as in applications requiring the interoperation of sensor networks with handheld or body-worn interface devices.

Securing Collaborative Spectrum Sensing against Untrustworthy Secondary Users in Cognitive Radio Networks

NASA Astrophysics Data System (ADS)

Wang, Wenkai; Li, Husheng; Sun, Yan(Lindsay); Han, Zhu

2009-12-01

Cognitive radio is a revolutionary paradigm to migrate the spectrum scarcity problem in wireless networks. In cognitive radio networks, collaborative spectrum sensing is considered as an effective method to improve the performance of primary user detection. For current collaborative spectrum sensing schemes, secondary users are usually assumed to report their sensing information honestly. However, compromised nodes can send false sensing information to mislead the system. In this paper, we study the detection of untrustworthy secondary users in cognitive radio networks. We first analyze the case when there is only one compromised node in collaborative spectrum sensing schemes. Then we investigate the scenario that there are multiple compromised nodes. Defense schemes are proposed to detect malicious nodes according to their reporting histories. We calculate the suspicious level of all nodes based on their reports. The reports from nodes with high suspicious levels will be excluded in decision-making. Compared with existing defense methods, the proposed scheme can effectively differentiate malicious nodes and honest nodes. As a result, it can significantly improve the performance of collaborative sensing. For example, when there are 10 secondary users, with the primary user detection rate being equal to 0.99, one malicious user can make the false alarm rate [InlineEquation not available: see fulltext.] increase to 72%. The proposed scheme can reduce it to 5%. Two malicious users can make [InlineEquation not available: see fulltext.] increase to 85% and the proposed scheme reduces it to 8%.

Networks in plant epidemiology: from genes to landscapes, countries, and continents.

PubMed

Moslonka-Lefebvre, Mathieu; Finley, Ann; Dorigatti, Ilaria; Dehnen-Schmutz, Katharina; Harwood, Tom; Jeger, Michael J; Xu, Xiangming; Holdenrieder, Ottmar; Pautasso, Marco

2011-04-01

There is increasing use of networks in ecology and epidemiology, but still relatively little application in phytopathology. Networks are sets of elements (nodes) connected in various ways by links (edges). Network analysis aims to understand system dynamics and outcomes in relation to network characteristics. Many existing natural, social, and technological networks have been shown to have small-world (local connectivity with short-cuts) and scale-free (presence of super-connected nodes) properties. In this review, we discuss how network concepts can be applied in plant pathology from the molecular to the landscape and global level. Wherever disease spread occurs not just because of passive/natural dispersion but also due to artificial movements, it makes sense to superimpose realistic models of the trade in plants on spatially explicit models of epidemic development. We provide an example of an emerging pathosystem (Phytophthora ramorum) where a theoretical network approach has proven particularly fruitful in analyzing the spread of disease in the UK plant trade. These studies can help in assessing the future threat posed by similar emerging pathogens. Networks have much potential in plant epidemiology and should become part of the standard curriculum.

Adaptive Connectivity Restoration from Node Failure(s) in Wireless Sensor Networks

PubMed Central

Wang, Huaiyuan; Ding, Xu; Huang, Cheng; Wu, Xiaobei

2016-01-01

Recently, there is a growing interest in the applications of wireless sensor networks (WSNs). A set of sensor nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks in some of the applications, such as battlefield reconnaissance. Due to the harsh deployment environments and limited energy supply, nodes may fail, which impacts the connectivity of the whole network. Since a single node failure (cut-vertex) will destroy the connectivity and divide the network into disjoint blocks, most of the existing studies focus on the problem of single node failure. However, the failure of multiple nodes would be a disaster to the whole network and must be repaired effectively. Only few studies are proposed to handle the problem of multiple cut-vertex failures, which is a special case of multiple node failures. Therefore, this paper proposes a comprehensive solution to address the problems of node failure (single and multiple). Collaborative Single Node Failure Restoration algorithm (CSFR) is presented to solve the problem of single node failure only with cooperative communication, but CSFR-M, which is the extension of CSFR, handles the single node failure problem more effectively with node motion. Moreover, Collaborative Connectivity Restoration Algorithm (CCRA) is proposed on the basis of cooperative communication and node maneuverability to restore network connectivity after multiple nodes fail. CSFR-M and CCRA are reactive methods that initiate the connectivity restoration after detecting the node failure(s). In order to further minimize the energy dissipation, CCRA opts to simplify the recovery process by gridding. Moreover, the distance that an individual node needs to travel during recovery is reduced by choosing the nearest suitable candidates. Finally, extensive simulations validate the performance of CSFR, CSFR-M and CCRA. PMID:27690030

Value-Based Caching in Information-Centric Wireless Body Area Networks

PubMed Central

Al-Turjman, Fadi M.; Imran, Muhammad; Vasilakos, Athanasios V.

2017-01-01

We propose a resilient cache replacement approach based on a Value of sensed Information (VoI) policy. To resolve and fetch content when the origin is not available due to isolated in-network nodes (fragmentation) and harsh operational conditions, we exploit a content caching approach. Our approach depends on four functional parameters in sensory Wireless Body Area Networks (WBANs). These four parameters are: age of data based on periodic request, popularity of on-demand requests, communication interference cost, and the duration for which the sensor node is required to operate in active mode to capture the sensed readings. These parameters are considered together to assign a value to the cached data to retain the most valuable information in the cache for prolonged time periods. The higher the value, the longer the duration for which the data will be retained in the cache. This caching strategy provides significant availability for most valuable and difficult to retrieve data in the WBANs. Extensive simulations are performed to compare the proposed scheme against other significant caching schemes in the literature while varying critical aspects in WBANs (e.g., data popularity, cache size, publisher load, connectivity-degree, and severe probabilities of node failures). These simulation results indicate that the proposed VoI-based approach is a valid tool for the retrieval of cached content in disruptive and challenging scenarios, such as the one experienced in WBANs, since it allows the retrieval of content for a long period even while experiencing severe in-network node failures. PMID:28106817

Distributed downhole drilling network

DOEpatents

Hall, David R.; Hall, Jr., H. Tracy; Fox, Joe; Pixton, David S.

2006-11-21

A high-speed downhole network providing real-time data from downhole components of a drilling strings includes a bottom-hole node interfacing to a bottom-hole assembly located proximate the bottom end of a drill string. A top-hole node is connected proximate the top end of the drill string. One or several intermediate nodes are located along the drill string between the bottom-hole node and the top-hole node. The intermediate nodes are configured to receive and transmit data packets transmitted between the bottom-hole node and the top-hole node. A communications link, integrated into the drill string, is used to operably connect the bottom-hole node, the intermediate nodes, and the top-hole node. In selected embodiments, a personal or other computer may be connected to the top-hole node, to analyze data received from the intermediate and bottom-hole nodes.

Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures

NASA Astrophysics Data System (ADS)

Dettmann, Carl P.

2018-05-01

Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes is Poisson distributed, and the probability of no isolated nodes is equal to the probability the whole graph is connected. Here we examine these properties for several self-similar node distributions, including smooth and fractal, uniform and nonuniform, and finitely ramified or otherwise. We show that nonuniformity can break the Poisson distribution property, but it strengthens the link between isolation and connectivity. It also stretches out the connectivity transition. Finite ramification is another mechanism for lack of connectivity. The same considerations apply to fractal distributions as smooth, with some technical differences in evaluation of the integrals and analytical arguments.

Node Self-Deployment Algorithm Based on Pigeon Swarm Optimization for Underwater Wireless Sensor Networks

PubMed Central

Yu, Shanen; Xu, Yiming; Jiang, Peng; Wu, Feng; Xu, Huan

2017-01-01

At present, free-to-move node self-deployment algorithms aim at event coverage and cannot improve network coverage under the premise of considering network connectivity, network reliability and network deployment energy consumption. Thus, this study proposes pigeon-based self-deployment algorithm (PSA) for underwater wireless sensor networks to overcome the limitations of these existing algorithms. In PSA, the sink node first finds its one-hop nodes and maximizes the network coverage in its one-hop region. The one-hop nodes subsequently divide the network into layers and cluster in each layer. Each cluster head node constructs a connected path to the sink node to guarantee network connectivity. Finally, the cluster head node regards the ratio of the movement distance of the node to the change in the coverage redundancy ratio as the target function and employs pigeon swarm optimization to determine the positions of the nodes. Simulation results show that PSA improves both network connectivity and network reliability, decreases network deployment energy consumption, and increases network coverage. PMID:28338615

Robustness and percolation of holes in complex networks

NASA Astrophysics Data System (ADS)

Zhou, Andu; Maletić, Slobodan; Zhao, Yi

2018-07-01

Efficient robustness and fault tolerance of complex network is significantly influenced by its connectivity, commonly modeled by the structure of pairwise relations between network elements, i.e., nodes. Nevertheless, aggregations of nodes build higher-order structures embedded in complex network, which may be more vulnerable when the fraction of nodes is removed. The structure of higher-order aggregations of nodes can be naturally modeled by simplicial complexes, whereas the removal of nodes affects the values of topological invariants, like the number of higher-dimensional holes quantified with Betti numbers. Following the methodology of percolation theory, as the fraction of nodes is removed, new holes appear, which have the role of merger between already present holes. In the present article, relationship between the robustness and homological properties of complex network is studied, through relating the graph-theoretical signatures of robustness and the quantities derived from topological invariants. The simulation results of random failures and intentional attacks on networks suggest that the changes of graph-theoretical signatures of robustness are followed by differences in the distribution of number of holes per cluster under different attack strategies. In the broader sense, the results indicate the importance of topological invariants research for obtaining further insights in understanding dynamics taking place over complex networks.

La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks.

PubMed

Sun, Guodong; Shang, Xinna; Zuo, Yan

2018-02-02

In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user's burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency.

Service-Oriented Node Scheduling Scheme for Wireless Sensor Networks Using Markov Random Field Model

PubMed Central

Cheng, Hongju; Su, Zhihuang; Lloret, Jaime; Chen, Guolong

2014-01-01

Future wireless sensor networks are expected to provide various sensing services and energy efficiency is one of the most important criterions. The node scheduling strategy aims to increase network lifetime by selecting a set of sensor nodes to provide the required sensing services in a periodic manner. In this paper, we are concerned with the service-oriented node scheduling problem to provide multiple sensing services while maximizing the network lifetime. We firstly introduce how to model the data correlation for different services by using Markov Random Field (MRF) model. Secondly, we formulate the service-oriented node scheduling issue into three different problems, namely, the multi-service data denoising problem which aims at minimizing the noise level of sensed data, the representative node selection problem concerning with selecting a number of active nodes while determining the services they provide, and the multi-service node scheduling problem which aims at maximizing the network lifetime. Thirdly, we propose a Multi-service Data Denoising (MDD) algorithm, a novel multi-service Representative node Selection and service Determination (RSD) algorithm, and a novel MRF-based Multi-service Node Scheduling (MMNS) scheme to solve the above three problems respectively. Finally, extensive experiments demonstrate that the proposed scheme efficiently extends the network lifetime. PMID:25384005

An Autonomous Connectivity Restoration Algorithm Based on Finite State Machine for Wireless Sensor-Actor Networks.

PubMed

Zhang, Ying; Wang, Jun; Hao, Guan

2018-01-08

With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity algorithms play an important role in data exchange, collaborative detection and information fusion. Due to the harsh application environment, abnormal nodes often appear, and the network connectivity will be prone to be lost. Network self-healing mechanisms have become critical for these systems. In order to decrease the movement overhead of the sensor-actor nodes, an autonomous connectivity restoration algorithm based on finite state machine is proposed. The idea is to identify whether a node is a critical node by using a finite state machine, and update the connected dominating set in a timely way. If an abnormal node is a critical node, the nearest non-critical node will be relocated to replace the abnormal node. In the case of multiple node abnormality, a regional network restoration algorithm is introduced. It is designed to reduce the overhead of node movements while restoration happens. Simulation results indicate the proposed algorithm has better performance on the total moving distance and the number of total relocated nodes compared with some other representative restoration algorithms.

An Autonomous Connectivity Restoration Algorithm Based on Finite State Machine for Wireless Sensor-Actor Networks

PubMed Central

Zhang, Ying; Wang, Jun; Hao, Guan

2018-01-01

With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity algorithms play an important role in data exchange, collaborative detection and information fusion. Due to the harsh application environment, abnormal nodes often appear, and the network connectivity will be prone to be lost. Network self-healing mechanisms have become critical for these systems. In order to decrease the movement overhead of the sensor-actor nodes, an autonomous connectivity restoration algorithm based on finite state machine is proposed. The idea is to identify whether a node is a critical node by using a finite state machine, and update the connected dominating set in a timely way. If an abnormal node is a critical node, the nearest non-critical node will be relocated to replace the abnormal node. In the case of multiple node abnormality, a regional network restoration algorithm is introduced. It is designed to reduce the overhead of node movements while restoration happens. Simulation results indicate the proposed algorithm has better performance on the total moving distance and the number of total relocated nodes compared with some other representative restoration algorithms. PMID:29316702

Mobile Router Developed and Tested

NASA Technical Reports Server (NTRS)

Ivancic, William D.

2002-01-01

The NASA Glenn Research Center, under a NASA Space Act Agreement with Cisco Systems, has been performing joint networking research to apply Internet-based technologies and protocols to space-based communications. As a result of this research, NASA performed stringent performance testing of the mobile router, including the interaction of routing and the transport-level protocol. In addition, Cisco Systems developed the mobile router for both commercial and Government markets. The code has become part of the Cisco Systems Internetworking Operating System (IOS) as of release 12.2 (4) T--which will make this capability available to the community at large. The mobile router is software code that resides in a network router and enables entire networks to roam while maintaining connectivity to the Internet. This router code is pertinent to a myriad of applications for both Government and commercial sectors, including the "wireless battlefield." NASA and the Department of Defense will utilize this technology for near-planetary observation and sensing spacecraft. It is also a key enabling technology for aviation-based information applications. Mobile routing will make it possible for information such as weather, air traffic control, voice, and video to be transmitted to aircraft using Internet-based protocols. This technology shows great promise in reducing congested airways and mitigating aviation disasters due to bad weather. The mobile router can also be incorporated into emergency vehicles (such as ambulances and life-flight aircraft) to provide real-time connectivity back to the hospital and health-care experts, enabling the timely application of emergency care. Commercial applications include entertainment services, Internet protocol (IP) telephone, and Internet connectivity for cruise ships, commercial shipping, tour buses, aircraft, and eventually cars. A mobile router, which is based on mobile IP, allows hosts (mobile nodes) to seamlessly "roam" among various IP subnetworks. This is essential in many wireless networks. A mobile router, unlike a mobile IP node, allows entire networks to roam. Hence, a device connected to the mobile router does not need to be a mobile node because the mobile router provides the roaming capabilities. There are three basic elements in the mobile IP: the home agent, the foreign agent, and the mobile node. The home agent is a router on a mobile node's home network that tunnels datagrams for delivery to the mobile node when it is away from home. The foreign agent is a router on a remote network that provides routing services to a registered mobile node. The mobile node is a host or router that changes its point of attachment from one network or subnetwork to another. In mobile routing, virtual communications are maintained by the home agent, which forwards all packets for the mobile networks to the foreign agent. The foreign agent passes the packets to the mobile router, which then forwards the packets to the devices on its networks. As the mobile router moves, it will register with its home agent on its whereabouts via the foreign agent to assure continuous connectivity.

Node Self-Deployment Algorithm Based on an Uneven Cluster with Radius Adjusting for Underwater Sensor Networks

PubMed Central

Jiang, Peng; Xu, Yiming; Wu, Feng

2016-01-01

Existing move-restricted node self-deployment algorithms are based on a fixed node communication radius, evaluate the performance based on network coverage or the connectivity rate and do not consider the number of nodes near the sink node and the energy consumption distribution of the network topology, thereby degrading network reliability and the energy consumption balance. Therefore, we propose a distributed underwater node self-deployment algorithm. First, each node begins the uneven clustering based on the distance on the water surface. Each cluster head node selects its next-hop node to synchronously construct a connected path to the sink node. Second, the cluster head node adjusts its depth while maintaining the layout formed by the uneven clustering and then adjusts the positions of in-cluster nodes. The algorithm originally considers the network reliability and energy consumption balance during node deployment and considers the coverage redundancy rate of all positions that a node may reach during the node position adjustment. Simulation results show, compared to the connected dominating set (CDS) based depth computation algorithm, that the proposed algorithm can increase the number of the nodes near the sink node and improve network reliability while guaranteeing the network connectivity rate. Moreover, it can balance energy consumption during network operation, further improve network coverage rate and reduce energy consumption. PMID:26784193

Compression in wearable sensor nodes: impacts of node topology.

PubMed

Imtiaz, Syed Anas; Casson, Alexander J; Rodriguez-Villegas, Esther

2014-04-01

Wearable sensor nodes monitoring the human body must operate autonomously for very long periods of time. Online and low-power data compression embedded within the sensor node is therefore essential to minimize data storage/transmission overheads. This paper presents a low-power MSP430 compressive sensing implementation for providing such compression, focusing particularly on the impact of the sensor node architecture on the compression performance. Compression power performance is compared for four different sensor nodes incorporating different strategies for wireless transmission/on-sensor-node local storage of data. The results demonstrate that the compressive sensing used must be designed differently depending on the underlying node topology, and that the compression strategy should not be guided only by signal processing considerations. We also provide a practical overview of state-of-the-art sensor node topologies. Wireless transmission of data is often preferred as it offers increased flexibility during use, but in general at the cost of increased power consumption. We demonstrate that wireless sensor nodes can highly benefit from the use of compressive sensing and now can achieve power consumptions comparable to, or better than, the use of local memory.

A mobile sensing system for structural health monitoring: design and validation

NASA Astrophysics Data System (ADS)

Zhu, Dapeng; Yi, Xiaohua; Wang, Yang; Lee, Kok-Meng; Guo, Jiajie

2010-05-01

This paper describes a new approach using mobile sensor networks for structural health monitoring. Compared with static sensors, mobile sensor networks offer flexible system architectures with adaptive spatial resolutions. The paper first describes the design of a mobile sensing node that is capable of maneuvering on structures built with ferromagnetic materials. The mobile sensing node can also attach/detach an accelerometer onto/from the structural surface. The performance of the prototype mobile sensor network has been validated through laboratory experiments. Two mobile sensing nodes are adopted for navigating on a steel portal frame and providing dense acceleration measurements. Transmissibility function analysis is conducted to identify structural damage using data collected by the mobile sensing nodes. This preliminary work is expected to spawn transformative changes in the use of mobile sensors for future structural health monitoring.

An efficient management system for wireless sensor networks.

PubMed

Ma, Yi-Wei; Chen, Jiann-Liang; Huang, Yueh-Min; Lee, Mei-Yu

2010-01-01

Wireless sensor networks have garnered considerable attention recently. Networks typically have many sensor nodes, and are used in commercial, medical, scientific, and military applications for sensing and monitoring the physical world. Many researchers have attempted to improve wireless sensor network management efficiency. A Simple Network Management Protocol (SNMP)-based sensor network management system was developed that is a convenient and effective way for managers to monitor and control sensor network operations. This paper proposes a novel WSNManagement system that can show the connections stated of relationships among sensor nodes and can be used for monitoring, collecting, and analyzing information obtained by wireless sensor networks. The proposed network management system uses collected information for system configuration. The function of performance analysis facilitates convenient management of sensors. Experimental results show that the proposed method enhances the alive rate of an overall sensor node system, reduces the packet lost rate by roughly 5%, and reduces delay time by roughly 0.2 seconds. Performance analysis demonstrates that the proposed system is effective for wireless sensor network management.

A Multi-Hop Clustering Mechanism for Scalable IoT Networks.

PubMed

Sung, Yoonyoung; Lee, Sookyoung; Lee, Meejeong

2018-03-23

It is expected that up to 26 billion Internet of Things (IoT) equipped with sensors and wireless communication capabilities will be connected to the Internet by 2020 for various purposes. With a large scale IoT network, having each node connected to the Internet with an individual connection may face serious scalability issues. The scalability problem of the IoT network may be alleviated by grouping the nodes of the IoT network into clusters and having a representative node in each cluster connect to the Internet on behalf of the other nodes in the cluster instead of having a per-node Internet connection and communication. In this paper, we propose a multi-hop clustering mechanism for IoT networks to minimize the number of required Internet connections. Specifically, the objective of proposed mechanism is to select the minimum number of coordinators, which take the role of a representative node for the cluster, i.e., having the Internet connection on behalf of the rest of the nodes in the cluster and to map a partition of the IoT nodes onto the selected set of coordinators to minimize the total distance between the nodes and their respective coordinator under a certain constraint in terms of maximum hop count between the IoT nodes and their respective coordinator. Since this problem can be mapped into a set cover problem which is known as NP-hard, we pursue a heuristic approach to solve the problem and analyze the complexity of the proposed solution. Through a set of experiments with varying parameters, the proposed scheme shows 63-87.3% reduction of the Internet connections depending on the number of the IoT nodes while that of the optimal solution is 65.6-89.9% in a small scale network. Moreover, it is shown that the performance characteristics of the proposed mechanism coincide with expected performance characteristics of the optimal solution in a large-scale network.

A Multi-Hop Clustering Mechanism for Scalable IoT Networks

PubMed Central

2018-01-01

It is expected that up to 26 billion Internet of Things (IoT) equipped with sensors and wireless communication capabilities will be connected to the Internet by 2020 for various purposes. With a large scale IoT network, having each node connected to the Internet with an individual connection may face serious scalability issues. The scalability problem of the IoT network may be alleviated by grouping the nodes of the IoT network into clusters and having a representative node in each cluster connect to the Internet on behalf of the other nodes in the cluster instead of having a per-node Internet connection and communication. In this paper, we propose a multi-hop clustering mechanism for IoT networks to minimize the number of required Internet connections. Specifically, the objective of proposed mechanism is to select the minimum number of coordinators, which take the role of a representative node for the cluster, i.e., having the Internet connection on behalf of the rest of the nodes in the cluster and to map a partition of the IoT nodes onto the selected set of coordinators to minimize the total distance between the nodes and their respective coordinator under a certain constraint in terms of maximum hop count between the IoT nodes and their respective coordinator. Since this problem can be mapped into a set cover problem which is known as NP-hard, we pursue a heuristic approach to solve the problem and analyze the complexity of the proposed solution. Through a set of experiments with varying parameters, the proposed scheme shows 63–87.3% reduction of the Internet connections depending on the number of the IoT nodes while that of the optimal solution is 65.6–89.9% in a small scale network. Moreover, it is shown that the performance characteristics of the proposed mechanism coincide with expected performance characteristics of the optimal solution in a large-scale network. PMID:29570691

Scalable Wrap-Around Shuffle Exchange Network with Deflection Routing

NASA Technical Reports Server (NTRS)

Monacos, Steve P. (Inventor)

1997-01-01

The invention in one embodiment is a communication network including plural non-blocking crossbar nodes, first apparatus for connecting the nodes in a first layer of connecting links, and second apparatus for connecting links independent of the first layer, whereby each layer is connected to the other layer at each point of the nodes. Preferably, each one of the layers of connecting links corresponds to one recirculating network topology that closes in on itself.

Energy-efficient digital and wireless IC design for wireless smart sensing

NASA Astrophysics Data System (ADS)

Zhou, Jun; Huang, Xiongchuan; Wang, Chao; Tae-Hyoung Kim, Tony; Lian, Yong

2017-10-01

Wireless smart sensing is now widely used in various applications such as health monitoring and structural monitoring. In conventional wireless sensor nodes, significant power is consumed in wirelessly transmitting the raw data. Smart sensing adds local intelligence to the sensor node and reduces the amount of wireless data transmission via on-node digital signal processing. While the total power consumption is reduced compared to conventional wireless sensing, the power consumption of the digital processing becomes as dominant as wireless data transmission. This paper reviews the state-of-the-art energy-efficient digital and wireless IC design techniques for reducing the power consumption of the wireless smart sensor node to prolong battery life and enable self-powered applications.

Fault tolerant hypercube computer system architecture

NASA Technical Reports Server (NTRS)

Madan, Herb S. (Inventor); Chow, Edward (Inventor)

1989-01-01

A fault-tolerant multiprocessor computer system of the hypercube type comprising a hierarchy of computers of like kind which can be functionally substituted for one another as necessary is disclosed. Communication between the working nodes is via one communications network while communications between the working nodes and watch dog nodes and load balancing nodes higher in the structure is via another communications network separate from the first. A typical branch of the hierarchy reporting to a master node or host computer comprises, a plurality of first computing nodes; a first network of message conducting paths for interconnecting the first computing nodes as a hypercube. The first network provides a path for message transfer between the first computing nodes; a first watch dog node; and a second network of message connecting paths for connecting the first computing nodes to the first watch dog node independent from the first network, the second network provides an independent path for test message and reconfiguration affecting transfers between the first computing nodes and the first switch watch dog node. There is additionally, a plurality of second computing nodes; a third network of message conducting paths for interconnecting the second computing nodes as a hypercube. The third network provides a path for message transfer between the second computing nodes; a fourth network of message conducting paths for connecting the second computing nodes to the first watch dog node independent from the third network. The fourth network provides an independent path for test message and reconfiguration affecting transfers between the second computing nodes and the first watch dog node; and a first multiplexer disposed between the first watch dog node and the second and fourth networks for allowing the first watch dog node to selectively communicate with individual ones of the computing nodes through the second and fourth networks; as well as, a second watch dog node operably connected to the first multiplexer whereby the second watch dog node can selectively communicate with individual ones of the computing nodes through the second and fourth networks. The branch is completed by a first load balancing node; and a second multiplexer connected between the first load balancing node and the first and second watch dog nodes, allowing the first load balancing node to selectively communicate with the first and second watch dog nodes.

Understanding the implementation of evidence-based care: a structural network approach.

PubMed

Parchman, Michael L; Scoglio, Caterina M; Schumm, Phillip

2011-02-24

Recent study of complex networks has yielded many new insights into phenomenon such as social networks, the internet, and sexually transmitted infections. The purpose of this analysis is to examine the properties of a network created by the 'co-care' of patients within one region of the Veterans Health Affairs. Data were obtained for all outpatient visits from 1 October 2006 to 30 September 2008 within one large Veterans Integrated Service Network. Types of physician within each clinic were nodes connected by shared patients, with a weighted link representing the number of shared patients between each connected pair. Network metrics calculated included edge weights, node degree, node strength, node coreness, and node betweenness. Log-log plots were used to examine the distribution of these metrics. Sizes of k-core networks were also computed under multiple conditions of node removal. There were 4,310,465 encounters by 266,710 shared patients between 722 provider types (nodes) across 41 stations or clinics resulting in 34,390 edges. The number of other nodes to which primary care provider nodes have a connection (172.7) is 42% greater than that of general surgeons and two and one-half times as high as cardiology. The log-log plot of the edge weight distribution appears to be linear in nature, revealing a 'scale-free' characteristic of the network, while the distributions of node degree and node strength are less so. The analysis of the k-core network sizes under increasing removal of primary care nodes shows that about 10 most connected primary care nodes play a critical role in keeping the k-core networks connected, because their removal disintegrates the highest k-core network. Delivery of healthcare in a large healthcare system such as that of the US Department of Veterans Affairs (VA) can be represented as a complex network. This network consists of highly connected provider nodes that serve as 'hubs' within the network, and demonstrates some 'scale-free' properties. By using currently available tools to explore its topology, we can explore how the underlying connectivity of such a system affects the behavior of providers, and perhaps leverage that understanding to improve quality and outcomes of care.

Using Internet of Things technologies for wireless sensor networks

NASA Astrophysics Data System (ADS)

Martinez, K.; Hart, J. K.; Basford, P. J.; Bragg, G. M.; Ward, T.

2013-12-01

Numerous authors have envisioned the future internet where anything will be connected: the Internet of Things (IoT). The idea is an extrapolation of the spread of networked devices such as phones, tablets etc. Each device is expected to have its own Internet address and thus be easy to access. The key building blocks of any IoT system are networking, hardware platforms and node software - so they are similar to wireless sensor network requirements. Most existing IoT demonstrators and applications have been gadget-style objects where power and connectivity problems are not too restricting. Environmental sensor networks can benefit from using some of the technologies involved in IoT development. However it is expected that tuning the networking and power management will be necessary to make them as efficient as state of the art wireless sensor networks. Some IoT assumptions such as always-connected nodes and full IP capability need to be considered. This paper will illustrate the advantages and disadvantages of IoT techniques for environment sensing drawing on a range of employment scenarios. We also describe a glacial 'Internet of things' project, which aims to monitor glacial processes. In particular we describe the IoT developments in a deployment in Iceland to examine glacier seismicity, velocity and provide camera images.

A multi-sensor RSS spatial sensing-based robust stochastic optimization algorithm for enhanced wireless tethering.

PubMed

Parasuraman, Ramviyas; Fabry, Thomas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel

2014-12-12

The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the "server-relay-client" framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions.

A Multi-Sensor RSS Spatial Sensing-Based Robust Stochastic Optimization Algorithm for Enhanced Wireless Tethering

PubMed Central

Parasuraman, Ramviyas; Fabry, Thomas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel

2014-01-01

The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the “server-relay-client” framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions. PMID:25615734

Moving target tracking through distributed clustering in directional sensor networks.

PubMed

Enayet, Asma; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-12-18

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.

Moving Target Tracking through Distributed Clustering in Directional Sensor Networks

PubMed Central

Enayet, Asma; Razzaque, Md. Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-01-01

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works. PMID:25529205

A Wireless Multi-Sensor Dielectric Impedance Spectroscopy Platform

PubMed Central

Ghaffari, Seyed Alireza; Caron, William-O.; Loubier, Mathilde; Rioux, Maxime; Viens, Jeff; Gosselin, Benoit; Messaddeq, Younes

2015-01-01

This paper describes the development of a low-cost, miniaturized, multiplexed, and connected platform for dielectric impedance spectroscopy (DIS), designed for in situ measurements and adapted to wireless network architectures. The platform has been tested and used as a DIS sensor node on ZigBee mesh and was able to interface up to three DIS sensors at the same time and relay the information through the network for data analysis and storage. The system is built from low-cost commercial microelectronics components, performs dielectric spectroscopy ranging from 5 kHz to 100 kHz, and benefits from an on-the-fly calibration system that makes sensor calibration easy. The paper describes the microelectronics design, the Nyquist impedance response, the measurement sensitivity and accuracy, and the testing of the platform for in situ dielectric impedance spectroscopy applications pertaining to fertilizer sensing, water quality sensing, and touch sensing. PMID:26393587

A Web Service-Based Framework Model for People-Centric Sensing Applications Applied to Social Networking

PubMed Central

Nunes, David; Tran, Thanh-Dien; Raposo, Duarte; Pinto, André; Gomes, André; Silva, Jorge Sá

2012-01-01

As the Internet evolved, social networks (such as Facebook) have bloomed and brought together an astonishing number of users. Mashing up mobile phones and sensors with these social environments enables the creation of people-centric sensing systems which have great potential for expanding our current social networking usage. However, such systems also have many associated technical challenges, such as privacy concerns, activity detection mechanisms or intermittent connectivity, as well as limitations due to the heterogeneity of sensor nodes and networks. Considering the openness of the Web 2.0, good technical solutions for these cases consist of frameworks that expose sensing data and functionalities as common Web-Services. This paper presents our RESTful Web Service-based model for people-centric sensing frameworks, which uses sensors and mobile phones to detect users’ activities and locations, sharing this information amongst the user’s friends within a social networking site. We also present some screenshot results of our experimental prototype. PMID:22438732

A Web Service-based framework model for people-centric sensing applications applied to social networking.

PubMed

Nunes, David; Tran, Thanh-Dien; Raposo, Duarte; Pinto, André; Gomes, André; Silva, Jorge Sá

2012-01-01

As the Internet evolved, social networks (such as Facebook) have bloomed and brought together an astonishing number of users. Mashing up mobile phones and sensors with these social environments enables the creation of people-centric sensing systems which have great potential for expanding our current social networking usage. However, such systems also have many associated technical challenges, such as privacy concerns, activity detection mechanisms or intermittent connectivity, as well as limitations due to the heterogeneity of sensor nodes and networks. Considering the openness of the Web 2.0, good technical solutions for these cases consist of frameworks that expose sensing data and functionalities as common Web-Services. This paper presents our RESTful Web Service-based model for people-centric sensing frameworks, which uses sensors and mobile phones to detect users' activities and locations, sharing this information amongst the user's friends within a social networking site. We also present some screenshot results of our experimental prototype.

Analyzing the Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks.

PubMed

Rashed, Sarmad; Soyturk, Mujdat

2017-02-20

Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area (e.g., the regions that are hardly accessed by human beings). In such kinds of networks, datacollectionbecomesoneofthemajorissues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage-especially Unmanned Aerial Vehicles (UAVs)-is the most convenient approach to covering the area and accessing each sensor node in such a large-scale WSN. However, the operation of the UAV depends on some parameters, such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various UAV mobility patterns that follow different paths to sweep the operation area in order to seek the best area coverage with the maximum number of covered nodes in the least amount of time needed by the mobile sink. We also introduce a new metric to formulate the tradeoff between maximizing the covered nodes and minimizing the operation time when choosing the appropriate mobility pattern. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time to choose the appropriate mobility pattern.

Analyzing the Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks

PubMed Central

Rashed, Sarmad; Soyturk, Mujdat

2017-01-01

Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area (e.g., the regions that are hardly accessed by human beings). In such kinds of networks, data collection becomes one of the major issues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage—especially Unmanned Aerial Vehicles (UAVs)—is the most convenient approach to covering the area and accessing each sensor node in such a large-scale WSN. However, the operation of the UAV depends on some parameters, such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various UAV mobility patterns that follow different paths to sweep the operation area in order to seek the best area coverage with the maximum number of covered nodes in the least amount of time needed by the mobile sink. We also introduce a new metric to formulate the tradeoff between maximizing the covered nodes and minimizing the operation time when choosing the appropriate mobility pattern. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time to choose the appropriate mobility pattern. PMID:28230727

Routing Based on Length of Time of Available Connection

NASA Technical Reports Server (NTRS)

Anandappan, Thanga (Inventor); Roy, Aloke (Inventor); Malve, Sharath Babu (Inventor); Toth, Louis T. (Inventor)

2016-01-01

In an embodiment, a method of routing packets at a first node in an ad-hoc network is provided. The method includes receiving, at the first node, a plurality of route-alive messages corresponding to a destination, each of the plurality of route-alive messages including a route time indicating a length of time in which a communicative connection is available between the second node that sent the respective route-alive message and the destination. The method also includes determining an updated route time for each second node. The updated route time corresponds to a length of time in which a communication connection is available between the first node and the destination through the respective second node. A second node is selected for sending a packet to based on the updated route time for each of the second nodes, wherein a node having a longer updated route time is given higher priority for selection.

La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks

PubMed Central

Sun, Guodong; Shang, Xinna; Zuo, Yan

2018-01-01

In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user’s burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency. PMID:29393876

Limit of a nonpreferential attachment multitype network model

NASA Astrophysics Data System (ADS)

Shang, Yilun

2017-02-01

Here, we deal with a model of multitype network with nonpreferential attachment growth. The connection between two nodes depends asymmetrically on their types, reflecting the implication of time order in temporal networks. Based upon graph limit theory, we analytically determined the limit of the network model characterized by a kernel, in the sense that the number of copies of any fixed subgraph converges when network size tends to infinity. The results are confirmed by extensive simulations. Our work thus provides a theoretical framework for quantitatively understanding grown temporal complex networks as a whole.

Complex Network Simulation of Forest Network Spatial Pattern in Pearl River Delta

NASA Astrophysics Data System (ADS)

Zeng, Y.

2017-09-01

Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network's power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network's degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network's main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc.) for networking a standard and base datum.

Power module assembly

DOEpatents

Campbell, Jeremy B [Torrance, CA; Newson, Steve [Redondo Beach, CA

2011-11-15

A power module assembly of the type suitable for deployment in a vehicular power inverter, wherein the power inverter has a grounded chassis, is provided. The power module assembly comprises a conductive base layer electrically coupled to the chassis, an insulating layer disposed on the conductive base layer, a first conductive node disposed on the insulating layer, a second conductive node disposed on the insulating layer, wherein the first and second conductive nodes are electrically isolated from each other. The power module assembly also comprises a first capacitor having a first electrode electrically connected to the conductive base layer, and a second electrode electrically connected to the first conductive node, and further comprises a second capacitor having a first electrode electrically connected to the conductive base layer, and a second electrode electrically connected to the second conductive node.

Image sensor with motion artifact supression and anti-blooming

NASA Technical Reports Server (NTRS)

Pain, Bedabrata (Inventor); Wrigley, Chris (Inventor); Yang, Guang (Inventor); Yadid-Pecht, Orly (Inventor)

2006-01-01

An image sensor includes pixels formed on a semiconductor substrate. Each pixel includes a photoactive region in the semiconductor substrate, a sense node, and a power supply node. A first electrode is disposed near a surface of the semiconductor substrate. A bias signal on the first electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the sense node. A second electrode is disposed near the surface of the semiconductor substrate. A bias signal on the second electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the power supply node. The image sensor includes a controller that causes bias signals to be provided to the electrodes so that photocharges generated in the photoactive region are accumulated in the photoactive region during a pixel integration period, the accumulated photocharges are transferred to the sense node during a charge transfer period, and photocharges generated in the photoactive region are transferred to the power supply node during a third period without passing through the sense node. The imager can operate at high shutter speeds with simultaneous integration of pixels in the array. High quality images can be produced free from motion artifacts. High quantum efficiency, good blooming control, low dark current, low noise and low image lag can be obtained.

High speed CMOS imager with motion artifact supression and anti-blooming

NASA Technical Reports Server (NTRS)

Pain, Bedabrata (Inventor); Wrigley, Chris (Inventor); Yang, Guang (Inventor); Yadid-Pecht, Orly (Inventor)

2001-01-01

An image sensor includes pixels formed on a semiconductor substrate. Each pixel includes a photoactive region in the semiconductor substrate, a sense node, and a power supply node. A first electrode is disposed near a surface of the semiconductor substrate. A bias signal on the first electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the sense node. A second electrode is disposed near the surface of the semiconductor substrate. A bias signal on the second electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the power supply node. The image sensor includes a controller that causes bias signals to be provided to the electrodes so that photocharges generated in the photoactive region are accumulated in the photoactive region during a pixel integration period, the accumulated photocharges are transferred to the sense node during a charge transfer period, and photocharges generated in the photoactive region are transferred to the power supply node during a third period without passing through the sense node. The imager can operate at high shutter speeds with simultaneous integration of pixels in the array. High quality images can be produced free from motion artifacts. High quantum efficiency, good blooming control, low dark current, low noise and low image lag can be obtained.

Geospatial-temporal semantic graph representations of trajectories from remote sensing and geolocation data

DOEpatents

Perkins, David Nikolaus; Brost, Randolph; Ray, Lawrence P.

2017-08-08

Various technologies for facilitating analysis of large remote sensing and geolocation datasets to identify features of interest are described herein. A search query can be submitted to a computing system that executes searches over a geospatial temporal semantic (GTS) graph to identify features of interest. The GTS graph comprises nodes corresponding to objects described in the remote sensing and geolocation datasets, and edges that indicate geospatial or temporal relationships between pairs of nodes in the nodes. Trajectory information is encoded in the GTS graph by the inclusion of movable nodes to facilitate searches for features of interest in the datasets relative to moving objects such as vehicles.

Compressed sensing based missing nodes prediction in temporal communication network

NASA Astrophysics Data System (ADS)

Cheng, Guangquan; Ma, Yang; Liu, Zhong; Xie, Fuli

2018-02-01

The reconstruction of complex network topology is of great theoretical and practical significance. Most research so far focuses on the prediction of missing links. There are many mature algorithms for link prediction which have achieved good results, but research on the prediction of missing nodes has just begun. In this paper, we propose an algorithm for missing node prediction in complex networks. We detect the position of missing nodes based on their neighbor nodes under the theory of compressed sensing, and extend the algorithm to the case of multiple missing nodes using spectral clustering. Experiments on real public network datasets and simulated datasets show that our algorithm can detect the locations of hidden nodes effectively with high precision.

Node Deployment with k-Connectivity in Sensor Networks for Crop Information Full Coverage Monitoring

PubMed Central

Liu, Naisen; Cao, Weixing; Zhu, Yan; Zhang, Jingchao; Pang, Fangrong; Ni, Jun

2016-01-01

Wireless sensor networks (WSNs) are suitable for the continuous monitoring of crop information in large-scale farmland. The information obtained is great for regulation of crop growth and achieving high yields in precision agriculture (PA). In order to realize full coverage and k-connectivity WSN deployment for monitoring crop growth information of farmland on a large scale and to ensure the accuracy of the monitored data, a new WSN deployment method using a genetic algorithm (GA) is here proposed. The fitness function of GA was constructed based on the following WSN deployment criteria: (1) nodes must be located in the corresponding plots; (2) WSN must have k-connectivity; (3) WSN must have no communication silos; (4) the minimum distance between node and plot boundary must be greater than a specific value to prevent each node from being affected by the farmland edge effect. The deployment experiments were performed on natural farmland and on irregular farmland divided based on spatial differences of soil nutrients. Results showed that both WSNs gave full coverage, there were no communication silos, and the minimum connectivity of nodes was equal to k. The deployment was tested for different values of k and transmission distance (d) to the node. The results showed that, when d was set to 200 m, as k increased from 2 to 4 the minimum connectivity of nodes increases and is equal to k. When k was set to 2, the average connectivity of all nodes increased in a linear manner with the increase of d from 140 m to 250 m, and the minimum connectivity does not change. PMID:27941704

A New Measure of Centrality for Brain Networks

PubMed Central

Joyce, Karen E.; Laurienti, Paul J.; Burdette, Jonathan H.; Hayasaka, Satoru

2010-01-01

Recent developments in network theory have allowed for the study of the structure and function of the human brain in terms of a network of interconnected components. Among the many nodes that form a network, some play a crucial role and are said to be central within the network structure. Central nodes may be identified via centrality metrics, with degree, betweenness, and eigenvector centrality being three of the most popular measures. Degree identifies the most connected nodes, whereas betweenness centrality identifies those located on the most traveled paths. Eigenvector centrality considers nodes connected to other high degree nodes as highly central. In the work presented here, we propose a new centrality metric called leverage centrality that considers the extent of connectivity of a node relative to the connectivity of its neighbors. The leverage centrality of a node in a network is determined by the extent to which its immediate neighbors rely on that node for information. Although similar in concept, there are essential differences between eigenvector and leverage centrality that are discussed in this manuscript. Degree, betweenness, eigenvector, and leverage centrality were compared using functional brain networks generated from healthy volunteers. Functional cartography was also used to identify neighborhood hubs (nodes with high degree within a network neighborhood). Provincial hubs provide structure within the local community, and connector hubs mediate connections between multiple communities. Leverage proved to yield information that was not captured by degree, betweenness, or eigenvector centrality and was more accurate at identifying neighborhood hubs. We propose that this metric may be able to identify critical nodes that are highly influential within the network. PMID:20808943

Voltage balanced multilevel voltage source converter system

DOEpatents

Peng, Fang Zheng; Lai, Jih-Sheng

1997-01-01

A voltage balanced multilevel converter for high power AC applications such as adjustable speed motor drives and back-to-back DC intertie of adjacent power systems. This converter provides a multilevel rectifier, a multilevel inverter, and a DC link between the rectifier and the inverter allowing voltage balancing between each of the voltage levels within the multilevel converter. The rectifier is equipped with at least one phase leg and a source input node for each of the phases. The rectifier is further equipped with a plurality of rectifier DC output nodes. The inverter is equipped with at least one phase leg and a load output node for each of the phases. The inverter is further equipped with a plurality of inverter DC input nodes. The DC link is equipped with a plurality of rectifier charging means and a plurality of inverter discharging means. The plurality of rectifier charging means are connected in series with one of the rectifier charging means disposed between and connected in an operable relationship with each adjacent pair of rectifier DC output nodes. The plurality of inverter discharging means are connected in series with one of the inverter discharging means disposed between and connected in an operable relationship with each adjacent pair of inverter DC input nodes. Each of said rectifier DC output nodes are individually electrically connected to the respective inverter DC input nodes. By this means, each of the rectifier DC output nodes and each of the inverter DC input nodes are voltage balanced by the respective charging and discharging of the rectifier charging means and the inverter discharging means.

Voltage balanced multilevel voltage source converter system

DOEpatents

Peng, F.Z.; Lai, J.S.

1997-07-01

Disclosed is a voltage balanced multilevel converter for high power AC applications such as adjustable speed motor drives and back-to-back DC intertie of adjacent power systems. This converter provides a multilevel rectifier, a multilevel inverter, and a DC link between the rectifier and the inverter allowing voltage balancing between each of the voltage levels within the multilevel converter. The rectifier is equipped with at least one phase leg and a source input node for each of the phases. The rectifier is further equipped with a plurality of rectifier DC output nodes. The inverter is equipped with at least one phase leg and a load output node for each of the phases. The inverter is further equipped with a plurality of inverter DC input nodes. The DC link is equipped with a plurality of rectifier charging means and a plurality of inverter discharging means. The plurality of rectifier charging means are connected in series with one of the rectifier charging means disposed between and connected in an operable relationship with each adjacent pair of rectifier DC output nodes. The plurality of inverter discharging means are connected in series with one of the inverter discharging means disposed between and connected in an operable relationship with each adjacent pair of inverter DC input nodes. Each of said rectifier DC output nodes are individually electrically connected to the respective inverter DC input nodes. By this means, each of the rectifier DC output nodes and each of the inverter DC input nodes are voltage balanced by the respective charging and discharging of the rectifier charging means and the inverter discharging means. 15 figs.

Fog-Based Two-Phase Event Monitoring and Data Gathering in Vehicular Sensor Networks

PubMed Central

Yang, Fan; Su, Jinsong; Zhou, Qifeng; Wang, Tian; Zhang, Lu; Xu, Yifan

2017-01-01

Vehicular nodes are equipped with more and more sensing units, and a large amount of sensing data is generated. Recently, more and more research considers cooperative urban sensing as the heart of intelligent and green city traffic management. The key components of the platform will be a combination of a pervasive vehicular sensing system, as well as a central control and analysis system, where data-gathering is a fundamental component. However, the data-gathering and monitoring are also challenging issues in vehicular sensor networks because of the large amount of data and the dynamic nature of the network. In this paper, we propose an efficient continuous event-monitoring and data-gathering framework based on fog nodes in vehicular sensor networks. A fog-based two-level threshold strategy is adopted to suppress unnecessary data upload and transmissions. In the monitoring phase, nodes sense the environment in low cost sensing mode and generate sensed data. When the probability of the event is high and exceeds some threshold, nodes transfer to the event-checking phase, and some nodes would be selected to transfer to the deep sensing mode to generate more accurate data of the environment. Furthermore, it adaptively adjusts the threshold to upload a suitable amount of data for decision making, while at the same time suppressing unnecessary message transmissions. Simulation results showed that the proposed scheme could reduce more than 84 percent of the data transmissions compared with other existing algorithms, while it detects the events and gathers the event data. PMID:29286320

Peregrine System Configuration | High-Performance Computing | NREL

Science.gov Websites

nodes and storage are connected by a high speed InfiniBand network. Compute nodes are diskless with an directories are mounted on all nodes, along with a file system dedicated to shared projects. A brief processors with 64 GB of memory. All nodes are connected to the high speed Infiniband network and and a

Motion video compression system with neural network having winner-take-all function

NASA Technical Reports Server (NTRS)

Fang, Wai-Chi (Inventor); Sheu, Bing J. (Inventor)

1997-01-01

A motion video data system includes a compression system, including an image compressor, an image decompressor correlative to the image compressor having an input connected to an output of the image compressor, a feedback summing node having one input connected to an output of the image decompressor, a picture memory having an input connected to an output of the feedback summing node, apparatus for comparing an image stored in the picture memory with a received input image and deducing therefrom pixels having differences between the stored image and the received image and for retrieving from the picture memory a partial image including the pixels only and applying the partial image to another input of the feedback summing node, whereby to produce at the output of the feedback summing node an updated decompressed image, a subtraction node having one input connected to received the received image and another input connected to receive the partial image so as to generate a difference image, the image compressor having an input connected to receive the difference image whereby to produce a compressed difference image at the output of the image compressor.

The Development of a Monitoring System Using a Wireless and Powerless Sensing Node Deployed Inside a Spindle

PubMed Central

Chang, Liang-Cheng; Lee, Da-Sheng

2012-01-01

Installation of a Wireless and Powerless Sensing Node (WPSN) inside a spindle enables the direct transmission of monitoring signals through a metal case of a certain thickness instead of the traditional method of using connecting cables. Thus, the node can be conveniently installed inside motors to measure various operational parameters. This study extends this earlier finding by applying this advantage to the monitoring of spindle systems. After over 2 years of system observation and optimization, the system has been verified to be superior to traditional methods. The innovation of fault diagnosis in this study includes the unmatched assembly dimensions of the spindle system, the unbalanced system, and bearing damage. The results of the experiment demonstrate that the WPSN provides a desirable signal-to-noise ratio (SNR) in all three of the simulated faults, with the difference of SNR reaching a maximum of 8.6 dB. Following multiple repetitions of the three experiment types, 80% of the faults were diagnosed when the spindle revolved at 4,000 rpm, significantly higher than the 30% fault recognition rate of traditional methods. The experimental results of monitoring of the spindle production line indicated that monitoring using the WPSN encounters less interference from noise compared to that of traditional methods. Therefore, this study has successfully developed a prototype concept into a well-developed monitoring system, and the monitoring can be implemented in a spindle production line or real-time monitoring of machine tools. PMID:22368456

The development of a monitoring system using a Wireless and Powerless Sensing Node deployed inside a spindle.

PubMed

Chang, Liang-Cheng; Lee, Da-Sheng

2012-01-01

Installation of a Wireless and Powerless Sensing Node (WPSN) inside a spindle enables the direct transmission of monitoring signals through a metal case of a certain thickness instead of the traditional method of using connecting cables. Thus, the node can be conveniently installed inside motors to measure various operational parameters. This study extends this earlier finding by applying this advantage to the monitoring of spindle systems. After over 2 years of system observation and optimization, the system has been verified to be superior to traditional methods. The innovation of fault diagnosis in this study includes the unmatched assembly dimensions of the spindle system, the unbalanced system, and bearing damage. The results of the experiment demonstrate that the WPSN provides a desirable signal-to-noise ratio (SNR) in all three of the simulated faults, with the difference of SNR reaching a maximum of 8.6 dB. Following multiple repetitions of the three experiment types, 80% of the faults were diagnosed when the spindle revolved at 4,000 rpm, significantly higher than the 30% fault recognition rate of traditional methods. The experimental results of monitoring of the spindle production line indicated that monitoring using the WPSN encounters less interference from noise compared to that of traditional methods. Therefore, this study has successfully developed a prototype concept into a well-developed monitoring system, and the monitoring can be implemented in a spindle production line or real-time monitoring of machine tools.

An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

PubMed Central

Hasbullah, Halabi; Nazir, Babar; Khan, Imran Ali

2014-01-01

Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results. PMID:25152924

Enhanced Deployment Strategy for Role-based Hierarchical Application Agents in Wireless Sensor Networks with Established Clusterheads

NASA Astrophysics Data System (ADS)

Gendreau, Audrey

Efficient self-organizing virtual clusterheads that supervise data collection based on their wireless connectivity, risk, and overhead costs, are an important element of Wireless Sensor Networks (WSNs). This function is especially critical during deployment when system resources are allocated to a subsequent application. In the presented research, a model used to deploy intrusion detection capability on a Local Area Network (LAN), in the literature, was extended to develop a role-based hierarchical agent deployment algorithm for a WSN. The resulting model took into consideration the monitoring capability, risk, deployment distribution cost, and monitoring cost associated with each node. Changing the original LAN methodology approach to model a cluster-based sensor network depended on the ability to duplicate a specific parameter that represented the monitoring capability. Furthermore, other parameters derived from a LAN can elevate costs and risk of deployment, as well as jeopardize the success of an application on a WSN. A key component of the approach presented in this research was to reduce the costs when established clusterheads in the network were found to be capable of hosting additional detection agents. In addition, another cost savings component of the study addressed the reduction of vulnerabilities associated with deployment of agents to high volume nodes. The effectiveness of the presented method was validated by comparing it against a type of a power-based scheme that used each node's remaining energy as the deployment value. While available energy is directly related to the model used in the presented method, the study deliberately sought out nodes that were identified with having superior monitoring capability, cost less to create and sustain, and are at low-risk of an attack. This work investigated improving the efficiency of an intrusion detection system (IDS) by using the proposed model to deploy monitoring agents after a temperature sensing application had established the network traffic flow to the sink. The same scenario was repeated using a power-based IDS to compare it against the proposed model. To identify a clusterhead's ability to host monitoring agents after the temperature sensing application terminated, the deployed IDS utilized the communication history and other network factors in order to rank the nodes. Similarly, using the node's communication history, the deployed power-based IDS ranked nodes based on their remaining power. For each individual scenario, and after the IDS application was deployed, the temperature sensing application was run for a second time. This time, to monitor the temperature sensing agents as the data flowed towards the sink, the network traffic was rerouted through the new intrusion detection clusterheads. Consequently, if the clusterheads were shared, the re-routing step was not preformed. Experimental results in this research demonstrated the effectiveness of applying a robust deployment metric to improve upon the energy efficiency of a deployed application in a multi-application WSN. It was found that in the scenarios with the intrusion detection application that utilized the proposed model resulted in more remaining energy than in the scenarios that implemented the power-based IDS. The algorithm especially had a positive impact on the small, dense, and more homogeneous networks. This finding was reinforced by the smaller percentage of new clusterheads that was selected. Essentially, the energy cost of the route to the sink was reduced because the network traffic was rerouted through fewer new clusterheads. Additionally, it was found that the intrusion detection topology that used the proposed approach formed smaller and more connected sets of clusterheads than the power-based IDS. As a consequence, this proposed approach essentially achieved the research objective for enhancing energy use in a multi-application WSN.

Connecting Network Properties of Rapidly Disseminating Epizoonotics

PubMed Central

Rivas, Ariel L.; Fasina, Folorunso O.; Hoogesteyn, Almira L.; Konah, Steven N.; Febles, José L.; Perkins, Douglas J.; Hyman, James M.; Fair, Jeanne M.; Hittner, James B.; Smith, Steven D.

2012-01-01

Background To effectively control the geographical dissemination of infectious diseases, their properties need to be determined. To test that rapid microbial dispersal requires not only susceptible hosts but also a pre-existing, connecting network, we explored constructs meant to reveal the network properties associated with disease spread, which included the road structure. Methods Using geo-temporal data collected from epizoonotics in which all hosts were susceptible (mammals infected by Foot-and-mouth disease virus, Uruguay, 2001; birds infected by Avian Influenza virus H5N1, Nigeria, 2006), two models were compared: 1) ‘connectivity’, a model that integrated bio-physical concepts (the agent’s transmission cycle, road topology) into indicators designed to measure networks (‘nodes’ or infected sites with short- and long-range links), and 2) ‘contacts’, which focused on infected individuals but did not assess connectivity. Results The connectivity model showed five network properties: 1) spatial aggregation of cases (disease clusters), 2) links among similar ‘nodes’ (assortativity), 3) simultaneous activation of similar nodes (synchronicity), 4) disease flows moving from highly to poorly connected nodes (directionality), and 5) a few nodes accounting for most cases (a “20∶80″ pattern). In both epizoonotics, 1) not all primary cases were connected but at least one primary case was connected, 2) highly connected, small areas (nodes) accounted for most cases, 3) several classes of nodes were distinguished, and 4) the contact model, which assumed all primary cases were identical, captured half the number of cases identified by the connectivity model. When assessed together, the synchronicity and directionality properties explained when and where an infectious disease spreads. Conclusions Geo-temporal constructs of Network Theory’s nodes and links were retrospectively validated in rapidly disseminating infectious diseases. They distinguished classes of cases, nodes, and networks, generating information usable to revise theory and optimize control measures. Prospective studies that consider pre-outbreak predictors, such as connecting networks, are recommended. PMID:22761900

Sandwich node architecture for agile wireless sensor networks for real-time structural health monitoring applications

NASA Astrophysics Data System (ADS)

Wang, Zi; Pakzad, Shamim; Cheng, Liang

2012-04-01

In recent years, wireless sensor network (WSN), as a powerful tool, has been widely applied to structural health monitoring (SHM) due to its low cost of deployment. Several commercial hardware platforms of wireless sensor networks (WSN) have been developed and used for structural monitoring applications [1,2]. A typical design of a node includes a sensor board and a mote connected to it. Sensing units, analog filters and analog-to-digital converters (ADCs) are integrated on the sensor board and the mote consists of a microcontroller and a wireless transceiver. Generally, there are a set of sensor boards compatible with the same model of mote and the selection of the sensor board depends on the specific applications. A WSN system based on this node lacks the capability of interrupting its scheduled task to start a higher priority task. This shortcoming is rooted in the hardware architecture of the node. The proposed sandwich-node architecture is designed to remedy the shortcomings of the existing one for task preemption. A sandwich node is composed of a sensor board and two motes. The first mote is dedicated to managing the sensor board and processing acquired data. The second mote controls the first mote via commands. A prototype has been implemented using Imote2 and verified by an emulation in which one mote is triggered by a remote base station and then preempts the running task at the other mote for handling an emergency event.

Weighted compactness function based label propagation algorithm for community detection

NASA Astrophysics Data System (ADS)

Zhang, Weitong; Zhang, Rui; Shang, Ronghua; Jiao, Licheng

2018-02-01

Community detection in complex networks, is to detect the community structure with the internal structure relatively compact and the external structure relatively sparse, according to the topological relationship among nodes in the network. In this paper, we propose a compactness function which combines the weight of nodes, and use it as the objective function to carry out the node label propagation. Firstly, according to the node degree, we find the sets of core nodes which have great influence on the network. The more the connections between the core nodes and the other nodes are, the larger the amount of the information these kernel nodes receive and transform. Then, according to the similarity of the nodes between the core nodes sets and the nodes degree, we assign weights to the nodes in the network. So the label of the nodes with great influence will be the priority in the label propagation process, which effectively improves the accuracy of the label propagation. The compactness function between nodes and communities in this paper is based on the nodes influence. It combines the connections between nodes and communities with the degree of the node belongs to its neighbor communities based on calculating the node weight. The function effectively uses the information of nodes and connections in the network. The experimental results show that the proposed algorithm can achieve good results in the artificial network and large-scale real networks compared with the 8 contrast algorithms.

Resting-State Network Topology Differentiates Task Signals across the Adult Life Span.

PubMed

Chan, Micaela Y; Alhazmi, Fahd H; Park, Denise C; Savalia, Neil K; Wig, Gagan S

2017-03-08

Brain network connectivity differs across individuals. For example, older adults exhibit less segregated resting-state subnetworks relative to younger adults (Chan et al., 2014). It has been hypothesized that individual differences in network connectivity impact the recruitment of brain areas during task execution. While recent studies have described the spatial overlap between resting-state functional correlation (RSFC) subnetworks and task-evoked activity, it is unclear whether individual variations in the connectivity pattern of a brain area (topology) relates to its activity during task execution. We report data from 238 cognitively normal participants (humans), sampled across the adult life span (20-89 years), to reveal that RSFC-based network organization systematically relates to the recruitment of brain areas across two functionally distinct tasks (visual and semantic). The functional activity of brain areas (network nodes) were characterized according to their patterns of RSFC: nodes with relatively greater connections to nodes in their own functional system ("non-connector" nodes) exhibited greater activity than nodes with relatively greater connections to nodes in other systems ("connector" nodes). This "activation selectivity" was specific to those brain systems that were central to each of the tasks. Increasing age was accompanied by less differentiated network topology and a corresponding reduction in activation selectivity (or differentiation) across relevant network nodes. The results provide evidence that connectional topology of brain areas quantified at rest relates to the functional activity of those areas during task. Based on these findings, we propose a novel network-based theory for previous reports of the "dedifferentiation" in brain activity observed in aging. SIGNIFICANCE STATEMENT Similar to other real-world networks, the organization of brain networks impacts their function. As brain network connectivity patterns differ across individuals, we hypothesized that individual differences in network connectivity would relate to differences in brain activity. Using functional MRI in a group of individuals sampled across the adult life span (20-89 years), we measured correlations at rest and related the functional connectivity patterns to measurements of functional activity during two independent tasks. Brain activity varied in relation to connectivity patterns revealed by large-scale network analysis. This relationship tracked the differences in connectivity patterns accompanied by older age, providing important evidence for a link between the topology of areal connectivity measured at rest and the functional recruitment of these areas during task performance. Copyright © 2017 Chan et al.

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

DOEpatents

Archer, Charles J; Faraj, Ahmad A; Inglett, Todd A; Ratterman, Joseph D

2013-04-16

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

Unpowered wireless ultrasound tomography system

NASA Astrophysics Data System (ADS)

Zahedi, Farshad; Huang, Haiying

2016-04-01

In this paper, an unpowered wireless ultrasound tomography system is presented. The system consists of two subsystems; the wireless interrogation unit (WIU) and three wireless nodes installed on the structure. Each node is designed to work in generation and sensing modes, but operates at a specific microwave frequency. Wireless transmission of the ultrasound signals between the WIU and the wireless nodes is achieved by converting ultrasound signals to microwave signals and vice versa, using a microwave carrier signal. In the generation mode, both a carrier signal and an ultrasound modulated microwave signal are transmitted to the sensor nodes. Only the node whose operating frequency matches the carrier signal will receive these signals and demodulate them to recover the original ultrasound signal. In the sensing mode, a microwave carrier signal with two different frequency components matching the operating frequencies of the sensor nodes is broadcasted by the WIU. The sensor nodes, in turn, receive the corresponding carrier signals, modulate it with the ultrasound sensing signal, and wirelessly transmit the modulated signal back to the WIU. The demodulation of the sensing signals is performed in the WIU using a digital signal processing. Implementing a software receiver significantly reduces the complexity and the cost of the WIU. A wireless ultrasound tomography system is realized by interchanging the carrier frequencies so that the wireless transducers can take turn to serve as the actuator and sensors.

A Framework to Design the Computational Load Distribution of Wireless Sensor Networks in Power Consumption Constrained Environments

PubMed Central

Sánchez-Álvarez, David; Rodríguez-Pérez, Francisco-Javier

2018-01-01

In this paper, we present a work based on the computational load distribution among the homogeneous nodes and the Hub/Sink of Wireless Sensor Networks (WSNs). The main contribution of the paper is an early decision support framework helping WSN designers to take decisions about computational load distribution for those WSNs where power consumption is a key issue (when we refer to “framework” in this work, we are considering it as a support tool to make decisions where the executive judgment can be included along with the set of mathematical tools of the WSN designer; this work shows the need to include the load distribution as an integral component of the WSN system for making early decisions regarding energy consumption). The framework takes advantage of the idea that balancing sensors nodes and Hub/Sink computational load can lead to improved energy consumption for the whole or at least the battery-powered nodes of the WSN. The approach is not trivial and it takes into account related issues such as the required data distribution, nodes, and Hub/Sink connectivity and availability due to their connectivity features and duty-cycle. For a practical demonstration, the proposed framework is applied to an agriculture case study, a sector very relevant in our region. In this kind of rural context, distances, low costs due to vegetable selling prices and the lack of continuous power supplies may lead to viable or inviable sensing solutions for the farmers. The proposed framework systematize and facilitates WSN designers the required complex calculations taking into account the most relevant variables regarding power consumption, avoiding full/partial/prototype implementations, and measurements of different computational load distribution potential solutions for a specific WSN. PMID:29570645

Water Catchment and Storage Monitoring

NASA Astrophysics Data System (ADS)

Bruenig, Michael; Dunbabin, Matt; Moore, Darren

2010-05-01

Sensors and Sensor Networks technologies provide the means for comprehensive understanding of natural processes in the environment by radically increasing the availability of empirical data about the natural world. This step change is achieved through a dramatic reduction in the cost of data acquisition and many orders of magnitude increase in the spatial and temporal granularity of measurements. Australia's Commonwealth Scientific and Industrial Research Organisation (CSIRO) is undertaking a strategic research program developing wireless sensor network technology for environmental monitoring. As part of this research initiative, we are engaging with government agencies to densely monitor water catchments and storages, thereby enhancing understanding of the environmental processes that affect water quality. In the Gold Coast hinterland in Queensland, Australia, we are building sensor networks to monitor restoration of rainforest within the catchment, and to monitor methane flux release and water quality in the water storages. This poster will present our ongoing work in this region of eastern Australia. The Springbrook plateau in the Gold Coast hinterland lies within a World Heritage listed area, has uniquely high rainfall, hosts a wide range of environmental gradients, and forms part of the catchment for Gold Coast's water storages. Parts of the plateau are being restored from agricultural grassland to native rainforest vegetation. Since April 2008, we have had a 10-node, multi-hop sensor network deployed there to monitor microclimate variables. This network will be expanded to 50-nodes in February 2010, and to around 200-nodes and 1000 sensors by mid-2011, spread over an area of approximately 0.8 square kilometers. The extremely dense microclimate sensing will enhance knowledge of the environmental factors that enhance or inhibit the regeneration of native rainforest. The final network will also include nodes with acoustic and image sensing capability for monitoring higher level parameters such as fauna diversity. The regenerating rainforest environment presents a number of interesting challenges for wireless sensor networks related to energy harvesting and to reliable low-power wireless communications through dense and wet vegetation. Located downstream from the Springbrook plateau, the Little Nerang and Hinze dams are the two major water supply storages for the Gold Coast region. In September 2009 we fitted methane, light, wind, and sonar sensors to our autonomous electric boat platform and successfully demonstrated autonomous collection of methane flux release data on Little Nerang Dam. Sensor and boat status data were relayed back to a human operator on the shore of the dam via a small network of our Fleck™ nodes. The network also included 4 floating nodes each fitted with a string of 6 temperature sensors for profiling temperature at different water depths. We plan to expand the network further during 2010 to incorporate floating methane nodes, additional temperature sensing nodes, as well as land-based microclimate nodes. The overall monitoring system will provide significant data to understand the connected catchment-to-storage system and will provide continuous data to monitor and understand change trends within this world heritage area.

The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference

PubMed Central

Deng, Changjian

2013-01-01

Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to explore algebraic connectivity characteristics and network robustness performance. It is found that nodes density has the effect on algebraic connectivity distribution in the random graph model; high density nodes carry more connections, use more throughputs, and may be more unreliable. Moreover, the results show that, when network should be more error tolerant or robust by repairing nodes or adding new nodes, the network should be better clustered in median and high scale wireless sensor networks and be meshing topology in small scale networks. PMID:24363613

Wireless and Powerless Sensing Node System Developed for Monitoring Motors.

PubMed

Lee, Dasheng

2008-08-27

Reliability and maintainability of tooling systems can be improved through condition monitoring of motors. However, it is difficult to deploy sensor nodes due to the harsh environment of industrial plants. Sensor cables are easily damaged, which renders the monitoring system deployed to assure the machine's reliability itself unreliable. A wireless and powerless sensing node integrated with a MEMS (Micro Electro-Mechanical System) sensor, a signal processor, a communication module, and a self-powered generator was developed in this study for implementation of an easily mounted network sensor for monitoring motors. A specially designed communication module transmits a sequence of electromagnetic (EM) pulses in response to the sensor signals. The EM pulses can penetrate through the machine's metal case and delivers signals from the sensor inside the motor to the external data acquisition center. By using induction power, which is generated by the motor's shaft rotation, the sensor node is self-sustaining; therefore, no power line is required. A monitoring system, equipped with novel sensing nodes, was constructed to test its performance. The test results illustrate that, the novel sensing node developed in this study can effectively enhance the reliability of the motor monitoring system and it is expected to be a valuable technology, which will be available to the plant for implementation in a reliable motor management program.

Wireless and Powerless Sensing Node System Developed for Monitoring Motors

PubMed Central

Lee, Dasheng

2008-01-01

Reliability and maintainability of tooling systems can be improved through condition monitoring of motors. However, it is difficult to deploy sensor nodes due to the harsh environment of industrial plants. Sensor cables are easily damaged, which renders the monitoring system deployed to assure the machine's reliability itself unreliable. A wireless and powerless sensing node integrated with a MEMS (Micro Electro-Mechanical System) sensor, a signal processor, a communication module, and a self-powered generator was developed in this study for implementation of an easily mounted network sensor for monitoring motors. A specially designed communication module transmits a sequence of electromagnetic (EM) pulses in response to the sensor signals. The EM pulses can penetrate through the machine's metal case and delivers signals from the sensor inside the motor to the external data acquisition center. By using induction power, which is generated by the motor's shaft rotation, the sensor node is self-sustaining; therefore, no power line is required. A monitoring system, equipped with novel sensing nodes, was constructed to test its performance. The test results illustrate that, the novel sensing node developed in this study can effectively enhance the reliability of the motor monitoring system and it is expected to be a valuable technology, which will be available to the plant for implementation in a reliable motor management program. PMID:27873798

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Archer, Charles J.; Faraj, Daniel A.; Inglett, Todd A.

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selectedmore » link to the adjacent compute node connected to the compute node through the selected link.« less

GaN-based sensor nodes for in situ detection of gases

NASA Technical Reports Server (NTRS)

Son, Kyung-Ah (Inventor); Prokopuk, Nicholas (Inventor); Moon, Jeong-Sun (Inventor)

2008-01-01

A system for detecting chemical/biological substances and a detection method. The system comprises a plurality of sensing units or nodes and a radiofrequency link. Each unit has several sensors with different sensing curves. Each sensor is able to transmit information related to the sensed substance on a specific frequency. The sensors preferably comprise AlGaN/GaN high electron mobility transistors.

A transmission power optimization with a minimum node degree for energy-efficient wireless sensor networks with full-reachability.

PubMed

Chen, Yi-Ting; Horng, Mong-Fong; Lo, Chih-Cheng; Chu, Shu-Chuan; Pan, Jeng-Shyang; Liao, Bin-Yih

2013-03-20

Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments.

A Transmission Power Optimization with a Minimum Node Degree for Energy-Efficient Wireless Sensor Networks with Full-Reachability

PubMed Central

Chen, Yi-Ting; Horng, Mong-Fong; Lo, Chih-Cheng; Chu, Shu-Chuan; Pan, Jeng-Shyang; Liao, Bin-Yih

2013-01-01

Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments. PMID:23519351

Self-assembly of the yeast actomyosin contractile ring as an aggregation process: kinetics of formation and instability regimes

NASA Astrophysics Data System (ADS)

Ojkic, Nikola; Vavylonis, Dimitrios

2009-03-01

Fission yeast cells assemble an equatorial contractile ring for cytokinesis, the last step of mitosis. The ring assembles from ˜ 65 membrane-bound ``nodes''' containing myosin motors and other proteins. Actin filaments that grow out from the nodes establish transient connections among the nodes and aid in pulling them together in a process that appears as pair-wise attraction (Vavylonis et al. Science 97:319, 2008). We used scaling arguments, coarse grained stability analysis of homogeneous states, and Monte Carlo simulations of simple models, to explore the conditions that yield fast and efficient ring formation, as opposed to formation of isolated clumps. We described our results as a function of: number of nodes, rate of establishing connections, range of node interaction, distance traveled per node interaction and broad band width, w. Uniform cortical 2d distributions of nodes are stable over short times due to randomness of connections among nodes, but become unstable over long times due to fluctuations in the initial node distribution. Successful condensation of nodes into a ring requires sufficiently small w such that lateral contraction occurs faster then clump formation.

Development of Light Powered Sensor Networks for Thermal Comfort Measurement

PubMed Central

Lee, Dasheng

2008-01-01

Recent technological advances in wireless communications have enabled easy installation of sensor networks with air conditioning equipment control applications. However, the sensor node power supply, through either power lines or battery power, still presents obstacles to the distribution of the sensing systems. In this study, a novel sensor network, powered by the artificial light, was constructed to achieve wireless power transfer and wireless data communications for thermal comfort measurements. The sensing node integrates an IC-based temperature sensor, a radiation thermometer, a relative humidity sensor, a micro machined flow sensor and a microprocessor for predicting mean vote (PMV) calculation. The 935 MHz band RF module was employed for the wireless data communication with a specific protocol based on a special energy beacon enabled mode capable of achieving zero power consumption during the inactive periods of the nodes. A 5W spotlight, with a dual axis tilt platform, can power the distributed nodes over a distance of up to 5 meters. A special algorithm, the maximum entropy method, was developed to estimate the sensing quantity of climate parameters if the communication module did not receive any response from the distributed nodes within a certain time limit. The light-powered sensor networks were able to gather indoor comfort-sensing index levels in good agreement with the comfort-sensing vote (CSV) preferred by a human being and the experimental results within the environment suggested that the sensing system could be used in air conditioning systems to implement a comfort-optimal control strategy. PMID:27873877

Development of an LSI for Tactile Sensor Systems on the Whole-Body of Robots

NASA Astrophysics Data System (ADS)

Muroyama, Masanori; Makihata, Mitsutoshi; Nakano, Yoshihiro; Matsuzaki, Sakae; Yamada, Hitoshi; Yamaguchi, Ui; Nakayama, Takahiro; Nonomura, Yutaka; Fujiyoshi, Motohiro; Tanaka, Shuji; Esashi, Masayoshi

We have developed a network type tactile sensor system, which realizes high-density tactile sensors on the whole-body of nursing and communication robots. The system consists of three kinds of nodes: host, relay and sensor nodes. Roles of the sensor node are to sense forces and, to encode the sensing data and to transmit the encoded data on serial channels by interruption handling. Relay nodes and host deal with a number of the encoded sensing data from the sensor nodes. A sensor node consists of a capacitive MEMS force sensor and a signal processing/transmission LSI. In this paper, details of an LSI for the sensor node are described. We designed experimental sensor node LSI chips by a commercial 0.18µm standard CMOS process. The 0.18µm LSIs were supplied in wafer level for MEMS post-process. The LSI chip area is 2.4mm × 2.4mm, which includes logic, CF converter and memory circuits. The maximum clock frequency of the chip with a large capacitive load is 10MHz. Measured power consumption at 10MHz clock is 2.23mW. Experimental results indicate that size, response time, sensor sensitivity and power consumption are all enough for practical tactile sensor systems.

An Efficient Interactive Model for On-Demand Sensing-As-A-Servicesof Sensor-Cloud

PubMed Central

Dinh, Thanh; Kim, Younghan

2016-01-01

This paper proposes an efficient interactive model for the sensor-cloud to enable the sensor-cloud to efficiently provide on-demand sensing services for multiple applications with different requirements at the same time. The interactive model is designed for both the cloud and sensor nodes to optimize the resource consumption of physical sensors, as well as the bandwidth consumption of sensing traffic. In the model, the sensor-cloud plays a key role in aggregating application requests to minimize the workloads required for constrained physical nodes while guaranteeing that the requirements of all applications are satisfied. Physical sensor nodes perform their sensing under the guidance of the sensor-cloud. Based on the interactions with the sensor-cloud, physical sensor nodes adapt their scheduling accordingly to minimize their energy consumption. Comprehensive experimental results show that our proposed system achieves a significant improvement in terms of the energy consumption of physical sensors, the bandwidth consumption from the sink node to the sensor-cloud, the packet delivery latency, reliability and scalability, compared to current approaches. Based on the obtained results, we discuss the economical benefits and how the proposed system enables a win-win model in the sensor-cloud. PMID:27367689

An Efficient Interactive Model for On-Demand Sensing-As-A-Servicesof Sensor-Cloud.

PubMed

Dinh, Thanh; Kim, Younghan

2016-06-28

This paper proposes an efficient interactive model for the sensor-cloud to enable the sensor-cloud to efficiently provide on-demand sensing services for multiple applications with different requirements at the same time. The interactive model is designed for both the cloud and sensor nodes to optimize the resource consumption of physical sensors, as well as the bandwidth consumption of sensing traffic. In the model, the sensor-cloud plays a key role in aggregating application requests to minimize the workloads required for constrained physical nodes while guaranteeing that the requirements of all applications are satisfied. Physical sensor nodes perform their sensing under the guidance of the sensor-cloud. Based on the interactions with the sensor-cloud, physical sensor nodes adapt their scheduling accordingly to minimize their energy consumption. Comprehensive experimental results show that our proposed system achieves a significant improvement in terms of the energy consumption of physical sensors, the bandwidth consumption from the sink node to the sensor-cloud, the packet delivery latency, reliability and scalability, compared to current approaches. Based on the obtained results, we discuss the economical benefits and how the proposed system enables a win-win model in the sensor-cloud.

Fault-Tolerant Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R. (Inventor)

2014-01-01

A self-stabilizing network in the form of an arbitrary, non-partitioned digraph includes K nodes having a synchronizer executing a protocol. K-1 monitors of each node may receive a Sync message transmitted from a directly connected node. When the Sync message is received, the logical clock value for the receiving node is set to between 0 and a communication latency value (gamma) if the clock value is less than a minimum event-response delay (D). A new Sync message is also transmitted to any directly connected nodes if the clock value is greater than or equal to both D and a graph threshold (T(sub S)). When the Sync message is not received the synchronizer increments the clock value if the clock value is less than a resynchronization period (P), and resets the clock value and transmits a new Sync message to all directly connected nodes when the clock value equals or exceeds P.

Network analysis of functional brain connectivity in borderline personality disorder using resting-state fMRI

PubMed Central

Xu, Tingting; Cullen, Kathryn R.; Mueller, Bryon; Schreiner, Mindy W.; Lim, Kelvin O.; Schulz, S. Charles; Parhi, Keshab K.

2016-01-01

Borderline personality disorder (BPD) is associated with symptoms such as affect dysregulation, impaired sense of self, and self-harm behaviors. Neuroimaging research on BPD has revealed structural and functional abnormalities in specific brain regions and connections. However, little is known about the topological organizations of brain networks in BPD. We collected resting-state functional magnetic resonance imaging (fMRI) data from 20 patients with BPD and 10 healthy controls, and constructed frequency-specific functional brain networks by correlating wavelet-filtered fMRI signals from 82 cortical and subcortical regions. We employed graph-theory based complex network analysis to investigate the topological properties of the brain networks, and employed network-based statistic to identify functional dysconnections in patients. In the 0.03–0.06 Hz frequency band, compared to controls, patients with BPD showed significantly larger measures of global network topology, including the size of largest connected graph component, clustering coefficient, small-worldness, and local efficiency, indicating increased local cliquishness of the functional brain network. Compared to controls, patients showed lower nodal centrality at several hub nodes but greater centrality at several non-hub nodes in the network. Furthermore, an interconnected subnetwork in 0.03–0.06 Hz frequency band was identified that showed significantly lower connectivity in patients. The links in the subnetwork were mainly long-distance connections between regions located at different lobes; and the mean connectivity of this subnetwork was negatively correlated with the increased global topology measures. Lastly, the key network measures showed high correlations with several clinical symptom scores, and classified BPD patients against healthy controls with high accuracy based on linear discriminant analysis. The abnormal topological properties and connectivity found in this study may add new knowledge to the current understanding of functional brain networks in BPD. However, due to limitation of small sample sizes, the results of the current study should be viewed as exploratory and need to be validated on large samples in future works. PMID:26977400

Network analysis of functional brain connectivity in borderline personality disorder using resting-state fMRI.

PubMed

Xu, Tingting; Cullen, Kathryn R; Mueller, Bryon; Schreiner, Mindy W; Lim, Kelvin O; Schulz, S Charles; Parhi, Keshab K

2016-01-01

Borderline personality disorder (BPD) is associated with symptoms such as affect dysregulation, impaired sense of self, and self-harm behaviors. Neuroimaging research on BPD has revealed structural and functional abnormalities in specific brain regions and connections. However, little is known about the topological organizations of brain networks in BPD. We collected resting-state functional magnetic resonance imaging (fMRI) data from 20 patients with BPD and 10 healthy controls, and constructed frequency-specific functional brain networks by correlating wavelet-filtered fMRI signals from 82 cortical and subcortical regions. We employed graph-theory based complex network analysis to investigate the topological properties of the brain networks, and employed network-based statistic to identify functional dysconnections in patients. In the 0.03-0.06 Hz frequency band, compared to controls, patients with BPD showed significantly larger measures of global network topology, including the size of largest connected graph component, clustering coefficient, small-worldness, and local efficiency, indicating increased local cliquishness of the functional brain network. Compared to controls, patients showed lower nodal centrality at several hub nodes but greater centrality at several non-hub nodes in the network. Furthermore, an interconnected subnetwork in 0.03-0.06 Hz frequency band was identified that showed significantly lower connectivity in patients. The links in the subnetwork were mainly long-distance connections between regions located at different lobes; and the mean connectivity of this subnetwork was negatively correlated with the increased global topology measures. Lastly, the key network measures showed high correlations with several clinical symptom scores, and classified BPD patients against healthy controls with high accuracy based on linear discriminant analysis. The abnormal topological properties and connectivity found in this study may add new knowledge to the current understanding of functional brain networks in BPD. However, due to limitation of small sample sizes, the results of the current study should be viewed as exploratory and need to be validated on large samples in future works.

λ-augmented tree for robust data collection in Advanced Metering Infrastructure

DOE PAGES

Kamto, Joseph; Qian, Lijun; Li, Wei; ...

2016-01-01

In this study, tree multicast configuration of smart meters (SMs) can maintain the connectivity and meet the latency requirements for the Advanced Metering Infrastructure (AMI). However, such topology is extremely weak as any single failure suffices to break its connectivity. On the other hand, the impact of a SM node failure can be more or less significant: a noncut SM node will have a limited local impact compared to a cut SM node that will break the network connectivity. In this work, we design a highly connected tree with a set of backup links to minimize the weakness of treemore » topology of SMs. A topology repair scheme is proposed to address the impact of a SM node failure on the connectivity of the augmented tree network. It relies on a loop detection scheme to define the criticality of a SM node and specifically targets cut SM node by selecting backup parent SM to cover its children. Detailed algorithms to create such AMI tree and related theoretical and complexity analysis are provided with insightful simulation results: sufficient redundancy is provided to alleviate data loss at the cost of signaling overhead. It is however observed that biconnected tree provides the best compromise between the two entities.« less

λ-augmented tree for robust data collection in Advanced Metering Infrastructure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kamto, Joseph; Qian, Lijun; Li, Wei

In this study, tree multicast configuration of smart meters (SMs) can maintain the connectivity and meet the latency requirements for the Advanced Metering Infrastructure (AMI). However, such topology is extremely weak as any single failure suffices to break its connectivity. On the other hand, the impact of a SM node failure can be more or less significant: a noncut SM node will have a limited local impact compared to a cut SM node that will break the network connectivity. In this work, we design a highly connected tree with a set of backup links to minimize the weakness of treemore » topology of SMs. A topology repair scheme is proposed to address the impact of a SM node failure on the connectivity of the augmented tree network. It relies on a loop detection scheme to define the criticality of a SM node and specifically targets cut SM node by selecting backup parent SM to cover its children. Detailed algorithms to create such AMI tree and related theoretical and complexity analysis are provided with insightful simulation results: sufficient redundancy is provided to alleviate data loss at the cost of signaling overhead. It is however observed that biconnected tree provides the best compromise between the two entities.« less

A review of variables of urban street connectivity for spatial connection

NASA Astrophysics Data System (ADS)

Mohamad, W. S. N. W.; Said, I.

2014-02-01

Several studies on street connectivity in cities and towns have been modeled on topology, morphology, technology and psychology of people living in the urban environment. Street connectivity means the connection of streets that offers people alternative routes. However, there emerge difficulties to determine the suitable variables and analysis to be chosen in defining the accurate result for studies street connectivity. The aim of this paper is to identify variables of street connectivity by applying GIS and Space Syntax. This paper reviews the variables of street connectivity from 15 past articles done in 1990s to early 2000s from journals of nine disciplines on Environment and Behavior, Planning and Design, Computers, Environment and Urban Systems, Applied Earth Observation and Geo-information, Environment and Planning, Physica A: Statistical Mechanics and its Applications, Environmental Psychology, Social Science and Medicine and Building and Environment. From the review, there are four variables found for street connectivity: link (streets-streets, street-nodes or node-streets, nodes-nodes), accessibility, least-angle, and centrality. Space syntax and GIS are suitable tools to analyze the four variables relating to systematic street systems for pedestrians. This review implies that planners of the street systems, in the aspect of street connectivity in cities and towns, should consider these four variables.

Preferential attachment in evolutionary earthquake networks

NASA Astrophysics Data System (ADS)

Rezaei, Soghra; Moghaddasi, Hanieh; Darooneh, Amir Hossein

2018-04-01

Earthquakes as spatio-temporal complex systems have been recently studied using complex network theory. Seismic networks are dynamical networks due to addition of new seismic events over time leading to establishing new nodes and links to the network. Here we have constructed Iran and Italy seismic networks based on Hybrid Model and testified the preferential attachment hypothesis for the connection of new nodes which states that it is more probable for newly added nodes to join the highly connected nodes comparing to the less connected ones. We showed that the preferential attachment is present in the case of earthquakes network and the attachment rate has a linear relationship with node degree. We have also found the seismic passive points, the most probable points to be influenced by other seismic places, using their preferential attachment values.

Communication analysis for feedback control of civil infrastructure using cochlea-inspired sensing nodes

NASA Astrophysics Data System (ADS)

Peckens, Courtney A.; Cook, Ireana; Lynch, Jerome P.

2016-04-01

Wireless sensor networks (WSNs) have emerged as a reliable, low-cost alternative to the traditional wired sensing paradigm. While such networks have made significant progress in the field of structural monitoring, significantly less development has occurred for feedback control applications. Previous work in WSNs for feedback control has highlighted many of the challenges of using this technology including latency in the wireless communication channel and computational inundation at the individual sensing nodes. This work seeks to overcome some of those challenges by drawing inspiration from the real-time sensing and control techniques employed by the biological central nervous system and in particular the mammalian cochlea. A novel bio-inspired wireless sensor node was developed that employs analog filtering techniques to perform time-frequency decomposition of a sensor signal, thus encompassing the functionality of the cochlea. The node then utilizes asynchronous sampling of the filtered signal to compress the signal prior to communication. This bio-inspired sensing architecture is extended to a feedback control application in order to overcome the traditional challenges currently faced by wireless control. In doing this, however, the network experiences high bandwidths of low-significance information exchange between nodes, resulting in some lost data. This study considers the impact of this lost data on the control capabilities of the bio-inspired control architecture and finds that it does not significantly impact the effectiveness of control.

A Distributed Compressive Sensing Scheme for Event Capture in Wireless Visual Sensor Networks

NASA Astrophysics Data System (ADS)

Hou, Meng; Xu, Sen; Wu, Weiling; Lin, Fei

2018-01-01

Image signals which acquired by wireless visual sensor network can be used for specific event capture. This event capture is realized by image processing at the sink node. A distributed compressive sensing scheme is used for the transmission of these image signals from the camera nodes to the sink node. A measurement and joint reconstruction algorithm for these image signals are proposed in this paper. Make advantage of spatial correlation between images within a sensing area, the cluster head node which as the image decoder can accurately co-reconstruct these image signals. The subjective visual quality and the reconstruction error rate are used for the evaluation of reconstructed image quality. Simulation results show that the joint reconstruction algorithm achieves higher image quality at the same image compressive rate than the independent reconstruction algorithm.

Connectivity disruption sparks explosive epidemic spreading.

PubMed

Böttcher, L; Woolley-Meza, O; Goles, E; Helbing, D; Herrmann, H J

2016-04-01

We investigate the spread of an infection or other malfunction of cascading nature when a system component can recover only if it remains reachable from a functioning central component. We consider the susceptible-infected-susceptible model, typical of mathematical epidemiology, on a network. Infection spreads from infected to healthy nodes, with the addition that infected nodes can only recover when they remain connected to a predefined central node, through a path that contains only healthy nodes. In this system, clusters of infected nodes will absorb their noninfected interior because no path exists between the central node and encapsulated nodes. This gives rise to the simultaneous infection of multiple nodes. Interestingly, the system converges to only one of two stationary states: either the whole population is healthy or it becomes completely infected. This simultaneous cluster infection can give rise to discontinuous jumps of different sizes in the number of failed nodes. Larger jumps emerge at lower infection rates. The network topology has an important effect on the nature of the transition: we observed hysteresis for networks with dominating local interactions. Our model shows how local spread can abruptly turn uncontrollable when it disrupts connectivity at a larger spatial scale.

Applications of graph theory to landscape genetics

PubMed Central

Garroway, Colin J; Bowman, Jeff; Carr, Denis; Wilson, Paul J

2008-01-01

We investigated the relationships among landscape quality, gene flow, and population genetic structure of fishers (Martes pennanti) in ON, Canada. We used graph theory as an analytical framework considering each landscape as a network node. The 34 nodes were connected by 93 edges. Network structure was characterized by a higher level of clustering than expected by chance, a short mean path length connecting all pairs of nodes, and a resiliency to the loss of highly connected nodes. This suggests that alleles can be efficiently spread through the system and that extirpations and conservative harvest are not likely to affect their spread. Two measures of node centrality were negatively related to both the proportion of immigrants in a node and node snow depth. This suggests that central nodes are producers of emigrants, contain high-quality habitat (i.e., deep snow can make locomotion energetically costly) and that fishers were migrating from high to low quality habitat. A method of community detection on networks delineated five genetic clusters of nodes suggesting cryptic population structure. Our analyses showed that network models can provide system-level insight into the process of gene flow with implications for understanding how landscape alterations might affect population fitness and evolutionary potential. PMID:25567802

Empirical study on a directed and weighted bus transport network in China

NASA Astrophysics Data System (ADS)

Feng, Shumin; Hu, Baoyu; Nie, Cen; Shen, Xianghao

2016-01-01

Bus transport networks are directed complex networks that consist of routes, stations, and passenger flow. In this study, the concept of duplication factor is introduced to analyze the differences between uplinks and downlinks for the bus transport network of Harbin (BTN-H). Further, a new representation model for BTNs is proposed, named as directed-space P. Two empirical characteristics of BTN-H are reported in this paper. First, the cumulative distributions of weighted degree, degree, number of routes that connect to each station, and node weight (peak-hour trips at a station) uniformly follow the exponential law. Meanwhile, the node weight shows positive correlations with the corresponding weighted degree, degree, and number of routes that connect to a station. Second, a new richness parameter of a node is explored by its node weight and the connectivity, weighted connectivity, average shortest path length and efficiency between rich nodes can be fitted by composite exponential functions to demonstrate the rich-club phenomenon.

Fault current limiter and alternating current circuit breaker

DOEpatents

Boenig, Heinrich J.

1998-01-01

A solid-state circuit breaker and current limiter for a load served by an alternating current source having a source impedance, the solid-state circuit breaker and current limiter comprising a thyristor bridge interposed between the alternating current source and the load, the thyristor bridge having four thyristor legs and four nodes, with a first node connected to the alternating current source, and a second node connected to the load. A coil is connected from a third node to a fourth node, the coil having an impedance of a value calculated to limit the current flowing therethrough to a predetermined value. Control means are connected to the thyristor legs for limiting the alternating current flow to the load under fault conditions to a predetermined level, and for gating the thyristor bridge under fault conditions to quickly reduce alternating current flowing therethrough to zero and thereafter to maintain the thyristor bridge in an electrically open condition preventing the alternating current from flowing therethrough for a predetermined period of time.

Fault current limiter and alternating current circuit breaker

DOEpatents

Boenig, H.J.

1998-03-10

A solid-state circuit breaker and current limiter are disclosed for a load served by an alternating current source having a source impedance, the solid-state circuit breaker and current limiter comprising a thyristor bridge interposed between the alternating current source and the load, the thyristor bridge having four thyristor legs and four nodes, with a first node connected to the alternating current source, and a second node connected to the load. A coil is connected from a third node to a fourth node, the coil having an impedance of a value calculated to limit the current flowing therethrough to a predetermined value. Control means are connected to the thyristor legs for limiting the alternating current flow to the load under fault conditions to a predetermined level, and for gating the thyristor bridge under fault conditions to quickly reduce alternating current flowing therethrough to zero and thereafter to maintain the thyristor bridge in an electrically open condition preventing the alternating current from flowing therethrough for a predetermined period of time. 9 figs.

Influence of Time-Series Normalization, Number of Nodes, Connectivity and Graph Measure Selection on Seizure-Onset Zone Localization from Intracranial EEG.

PubMed

van Mierlo, Pieter; Lie, Octavian; Staljanssens, Willeke; Coito, Ana; Vulliémoz, Serge

2018-04-26

We investigated the influence of processing steps in the estimation of multivariate directed functional connectivity during seizures recorded with intracranial EEG (iEEG) on seizure-onset zone (SOZ) localization. We studied the effect of (i) the number of nodes, (ii) time-series normalization, (iii) the choice of multivariate time-varying connectivity measure: Adaptive Directed Transfer Function (ADTF) or Adaptive Partial Directed Coherence (APDC) and (iv) graph theory measure: outdegree or shortest path length. First, simulations were performed to quantify the influence of the various processing steps on the accuracy to localize the SOZ. Afterwards, the SOZ was estimated from a 113-electrodes iEEG seizure recording and compared with the resection that rendered the patient seizure-free. The simulations revealed that ADTF is preferred over APDC to localize the SOZ from ictal iEEG recordings. Normalizing the time series before analysis resulted in an increase of 25-35% of correctly localized SOZ, while adding more nodes to the connectivity analysis led to a moderate decrease of 10%, when comparing 128 with 32 input nodes. The real-seizure connectivity estimates localized the SOZ inside the resection area using the ADTF coupled to outdegree or shortest path length. Our study showed that normalizing the time-series is an important pre-processing step, while adding nodes to the analysis did only marginally affect the SOZ localization. The study shows that directed multivariate Granger-based connectivity analysis is feasible with many input nodes (> 100) and that normalization of the time-series before connectivity analysis is preferred.

Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold

NASA Astrophysics Data System (ADS)

Korsnes, Reinert

2010-07-01

This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied problem where for example Dijkstra’s algorithm provides a solution for non-negative edge weights. The present contribution shows by simulation examples that simple modifications of known distributed approaches here can provide significant improvements in performance. Phase transition phenomena, which are known to take place in networks close to percolation thresholds, may explain these observations. An initial method, which here serves as reference, assumes the sink node starts organisation of the network (tree) by transmitting a control message advertising its availability for its neighbours. These neighbours then advertise their current cost estimate for routing a message to the sink. A node which in this way receives a message implying an improved route to the sink, advertises its new finding and remembers which neighbouring node the message came from. This activity proceeds until there are no more improvements to advertise to neighbours. The result is a tree network for cost effective transmission of messages to the sink (root). This distributed approach has potential for simple improvements which are of interest when minimisation of storage and communication of network information are a concern. Fast organisation of the network takes place when the number k of connections for each node ( degree) is close above its critical value for global network percolation and at the same time there is a threshold for the nodes to decide to advertise network route updates.

Methods for operating parallel computing systems employing sequenced communications

DOEpatents

Benner, R.E.; Gustafson, J.L.; Montry, G.R.

1999-08-10

A parallel computing system and method are disclosed having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system. 15 figs.

Methods for operating parallel computing systems employing sequenced communications

DOEpatents

Benner, Robert E.; Gustafson, John L.; Montry, Gary R.

1999-01-01

A parallel computing system and method having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system.

Method for simultaneous overlapped communications between neighboring processors in a multiple

DOEpatents

Benner, Robert E.; Gustafson, John L.; Montry, Gary R.

1991-01-01

A parallel computing system and method having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system.

Multi-directional fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D.; Smith, Brian Edward

2010-11-23

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Multi-directional fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2009-03-17

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Multi-directional fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D.; Smith, Brian Edward

2010-06-29

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Maximal switchability of centralized networks

NASA Astrophysics Data System (ADS)

Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu

2016-08-01

We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.

Value of peripheral nodes in controlling multilayer scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Yan; Garas, Antonios; Schweitzer, Frank

2016-01-01

We analyze the controllability of a two-layer network, where driver nodes can be chosen randomly only from one layer. Each layer contains a scale-free network with directed links and the node dynamics depends on the incoming links from other nodes. We combine the in-degree and out-degree values to assign an importance value w to each node, and distinguish between peripheral nodes with low w and central nodes with high w . Based on numerical simulations, we find that the controllable part of the network is larger when choosing low w nodes to connect the two layers. The control is as efficient when peripheral nodes are driver nodes as it is for the case of more central nodes. However, if we assume a cost to utilize nodes that is proportional to their overall degree, utilizing peripheral nodes to connect the two layers or to act as driver nodes is not only the most cost-efficient solution, it is also the one that performs best in controlling the two-layer network among the different interconnecting strategies we have tested.

Uncovering hidden nodes in complex networks in the presence of noise

PubMed Central

Su, Ri-Qi; Lai, Ying-Cheng; Wang, Xiao; Do, Younghae

2014-01-01

Ascertaining the existence of hidden objects in a complex system, objects that cannot be observed from the external world, not only is curiosity-driven but also has significant practical applications. Generally, uncovering a hidden node in a complex network requires successful identification of its neighboring nodes, but a challenge is to differentiate its effects from those of noise. We develop a completely data-driven, compressive-sensing based method to address this issue by utilizing complex weighted networks with continuous-time oscillatory or discrete-time evolutionary-game dynamics. For any node, compressive sensing enables accurate reconstruction of the dynamical equations and coupling functions, provided that time series from this node and all its neighbors are available. For a neighboring node of the hidden node, this condition cannot be met, resulting in abnormally large prediction errors that, counterintuitively, can be used to infer the existence of the hidden node. Based on the principle of differential signal, we demonstrate that, when strong noise is present, insofar as at least two neighboring nodes of the hidden node are subject to weak background noise only, unequivocal identification of the hidden node can be achieved. PMID:24487720

Link failure detection in a parallel computer

DOEpatents

Archer, Charles J.; Blocksome, Michael A.; Megerian, Mark G.; Smith, Brian E.

2010-11-09

Methods, apparatus, and products are disclosed for link failure detection in a parallel computer including compute nodes connected in a rectangular mesh network, each pair of adjacent compute nodes in the rectangular mesh network connected together using a pair of links, that includes: assigning each compute node to either a first group or a second group such that adjacent compute nodes in the rectangular mesh network are assigned to different groups; sending, by each of the compute nodes assigned to the first group, a first test message to each adjacent compute node assigned to the second group; determining, by each of the compute nodes assigned to the second group, whether the first test message was received from each adjacent compute node assigned to the first group; and notifying a user, by each of the compute nodes assigned to the second group, whether the first test message was received.

Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

DOEpatents

Archer, Charles J.; Faraj, Ahmad A.; Inglett, Todd A.; Ratterman, Joseph D.

2012-10-23

Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

SOUNET: Self-Organized Underwater Wireless Sensor Network.

PubMed

Kim, Hee-Won; Cho, Ho-Shin

2017-02-02

In this paper, we propose an underwater wireless sensor network (UWSN) named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR), and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.

SOUNET: Self-Organized Underwater Wireless Sensor Network

PubMed Central

Kim, Hee-won; Cho, Ho-Shin

2017-01-01

In this paper, we propose an underwater wireless sensor network (UWSN) named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the time-varying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR), and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment. PMID:28157164

Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication

NASA Astrophysics Data System (ADS)

Jakovetic, Dusan; Xavier, João; Moura, José M. F.

2011-08-01

We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

PKIX Certificate Status in Hybrid MANETs

NASA Astrophysics Data System (ADS)

Muñoz, Jose L.; Esparza, Oscar; Gañán, Carlos; Parra-Arnau, Javier

Certificate status validation is a hard problem in general but it is particularly complex in Mobile Ad-hoc Networks (MANETs) because we require solutions to manage both the lack of fixed infrastructure inside the MANET and the possible absence of connectivity to trusted authorities when the certification validation has to be performed. In this sense, certificate acquisition is usually assumed as an initialization phase. However, certificate validation is a critical operation since the node needs to check the validity of certificates in real-time, that is, when a particular certificate is going to be used. In such MANET environments, it may happen that the node is placed in a part of the network that is disconnected from the source of status data at the moment the status checking is required. Proposals in the literature suggest the use of caching mechanisms so that the node itself or a neighbour node has some status checking material (typically on-line status responses or lists of revoked certificates). However, to the best of our knowledge the only criterion to evaluate the cached (obsolete) material is the time. In this paper, we analyse how to deploy a certificate status checking PKI service for hybrid MANET and we propose a new criterion based on risk to evaluate cached status data that is much more appropriate and absolute than time because it takes into account the revocation process.

Quantum connectivity optimization algorithms for entanglement source deployment in a quantum multi-hop network

NASA Astrophysics Data System (ADS)

Zou, Zhen-Zhen; Yu, Xu-Tao; Zhang, Zai-Chen

2018-04-01

At first, the entanglement source deployment problem is studied in a quantum multi-hop network, which has a significant influence on quantum connectivity. Two optimization algorithms are introduced with limited entanglement sources in this paper. A deployment algorithm based on node position (DNP) improves connectivity by guaranteeing that all overlapping areas of the distribution ranges of the entanglement sources contain nodes. In addition, a deployment algorithm based on an improved genetic algorithm (DIGA) is implemented by dividing the region into grids. From the simulation results, DNP and DIGA improve quantum connectivity by 213.73% and 248.83% compared to random deployment, respectively, and the latter performs better in terms of connectivity. However, DNP is more flexible and adaptive to change, as it stops running when all nodes are covered.

Adaptive Data Aggregation and Compression to Improve Energy Utilization in Solar-Powered Wireless Sensor Networks

PubMed Central

Yoon, Ikjune; Kim, Hyeok; Noh, Dong Kun

2017-01-01

A node in a solar-powered wireless sensor network (WSN) collects energy when the sun shines and stores it in a battery or capacitor for use when no solar power is available, in particular at night. In our scheme, each tiny node in a WSN periodically determines its energy budget, which takes into account its residual energy, and its likely acquisition and consumption. If it expects to acquire more energy than it can store, the data which has it has sensed is aggregated with data from other nodes, compressed, and transmitted. Otherwise, the node continues to sense data, but turns off its wireless communication to reduce energy consumption. We compared several schemes by simulation. Our scheme reduced the number of nodes forced to black out due to lack of energy so that more data arrives at the sink node. PMID:28555010

Adaptive Data Aggregation and Compression to Improve Energy Utilization in Solar-Powered Wireless Sensor Networks.

PubMed

Yoon, Ikjune; Kim, Hyeok; Noh, Dong Kun

2017-05-27

A node in a solar-powered wireless sensor network (WSN) collects energy when the sun shines and stores it in a battery or capacitor for use when no solar power is available, in particular at night. In our scheme, each tiny node in a WSN periodically determines its energy budget, which takes into account its residual energy, and its likely acquisition and consumption. If it expects to acquire more energy than it can store, the data which has it has sensed is aggregated with data from other nodes, compressed, and transmitted. Otherwise, the node continues to sense data, but turns off its wireless communication to reduce energy consumption. We compared several schemes by simulation. Our scheme reduced the number of nodes forced to black out due to lack of energy so that more data arrives at the sink node.

Local area network with fault-checking, priorities, and redundant backup

NASA Technical Reports Server (NTRS)

Morales, Sergio (Inventor); Friedman, Gary L. (Inventor)

1989-01-01

This invention is a redundant error detecting and correcting local area networked computer system having a plurality of nodes each including a network connector board within the node for connecting to an interfacing transceiver operably attached to a network cable. There is a first network cable disposed along a path to interconnect the nodes. The first network cable includes a plurality of first interfacing transceivers attached thereto. A second network cable is disposed in parallel with the first cable and, in like manner, includes a plurality of second interfacing transceivers attached thereto. There are a plurality of three position switches each having a signal input, three outputs for individual selective connection to the input, and a control input for receiving signals designating which of the outputs is to be connected to the signal input. Each of the switches includes means for designating a response address for responding to addressed signals appearing at the control input and each of the switches further has its signal input connected to a respective one of the input/output lines from the nodes. Also, one of the three outputs is connected to a repective one of the plurality of first interfacing transceivers. There is master switch control means having an output connected to the control inputs of the plurality of three position switches and an input for receiving directive signals for outputting addressed switch position signals to the three position switches as well as monitor and control computer means having a pair of network connector boards therein connected to respective ones of one of the first interfacing transceivers and one of the second interfacing transceivers and an output connected to the input of the master switch means for monitoring the status of the networked computer system by sending messages to the nodes and receiving and verifying messages therefrom and for sending control signals to the master switch to cause the master switch to cause respective ones of the nodes to use a desired one of the first and second cables for transmitting and receiving messages and for disconnecting desired ones of the nodes from both cables.

Bio-Inspired Stretchable Absolute Pressure Sensor Network

PubMed Central

Guo, Yue; Li, Yu-Hung; Guo, Zhiqiang; Kim, Kyunglok; Chang, Fu-Kuo; Wang, Shan X.

2016-01-01

A bio-inspired absolute pressure sensor network has been developed. Absolute pressure sensors, distributed on multiple silicon islands, are connected as a network by stretchable polyimide wires. This sensor network, made on a 4’’ wafer, has 77 nodes and can be mounted on various curved surfaces to cover an area up to 0.64 m × 0.64 m, which is 100 times larger than its original size. Due to Micro Electro-Mechanical system (MEMS) surface micromachining technology, ultrathin sensing nodes can be realized with thicknesses of less than 100 µm. Additionally, good linearity and high sensitivity (~14 mV/V/bar) have been achieved. Since the MEMS sensor process has also been well integrated with a flexible polymer substrate process, the entire sensor network can be fabricated in a time-efficient and cost-effective manner. Moreover, an accurate pressure contour can be obtained from the sensor network. Therefore, this absolute pressure sensor network holds significant promise for smart vehicle applications, especially for unmanned aerial vehicles. PMID:26729134

Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster.

PubMed

Fan, Hangyu; Wang, Huandong; Li, Yong

2018-01-23

Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance.

Capacity planning of a wide-sense nonblocking generalized survivable network

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2006-06-01

Generalized survivable networks (GSNs) have two interesting properties that are essential attributes for future backbone networks--full survivability against link failures and support for dynamic traffic demands. GSNs incorporate the nonblocking network concept into the survivable network models. Given a set of nodes and a topology that is at least two-edge connected, a certain minimum capacity is required for each edge to form a GSN. The edge capacity is bounded because each node has an input-output capacity limit that serves as a constraint for any allowable traffic demand matrix. The GSN capacity planning problem is nondeterministic polynomial time (NP) hard. We first give a rigorous mathematical framework; then we offer two different solution approaches. The two-phase approach is fast, but the joint optimization approach yields a better bound. We carried out numerical computations for eight networks with different topologies and found that the cost of a GSN is only a fraction (from 52% to 89%) more than that of a static survivable network.

Action and semantic tool knowledge - Effective connectivity in the underlying neural networks.

PubMed

Kleineberg, Nina N; Dovern, Anna; Binder, Ellen; Grefkes, Christian; Eickhoff, Simon B; Fink, Gereon R; Weiss, Peter H

2018-04-26

Evidence from neuropsychological and imaging studies indicate that action and semantic knowledge about tools draw upon distinct neural substrates, but little is known about the underlying interregional effective connectivity. With fMRI and dynamic causal modeling (DCM) we investigated effective connectivity in the left-hemisphere (LH) while subjects performed (i) a function knowledge and (ii) a value knowledge task, both addressing semantic tool knowledge, and (iii) a manipulation (action) knowledge task. Overall, the results indicate crosstalk between action nodes and semantic nodes. Interestingly, effective connectivity was weakened between semantic nodes and action nodes during the manipulation task. Furthermore, pronounced modulations of effective connectivity within the fronto-parietal action system of the LH (comprising lateral occipito-temporal cortex, intraparietal sulcus, supramarginal gyrus, inferior frontal gyrus) were observed in a bidirectional manner during the processing of action knowledge. In contrast, the function and value knowledge tasks resulted in a significant strengthening of the effective connectivity between visual cortex and fusiform gyrus. Importantly, this modulation was present in both semantic tasks, indicating that processing different aspects of semantic knowledge about tools evokes similar effective connectivity patterns. Data revealed that interregional effective connectivity during the processing of tool knowledge occurred in a bidirectional manner with a weakening of connectivity between areas engaged in action and semantic knowledge about tools during the processing of action knowledge. Moreover, different semantic tool knowledge tasks elicited similar effective connectivity patterns. © 2018 Wiley Periodicals, Inc.

All row, planar fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D; Smith, Brian Edward

2013-07-23

An apparatus, program product and method for detecting nodal faults may simultaneously cause designated nodes of a cell to communicate with all nodes adjacent to each of the designated nodes. Furthermore, all nodes along the axes of the designated nodes are made to communicate with their adjacent nodes, and the communications are analyzed to determine if a node or connection is faulty.

The genetic network of greater sage-grouse: Range-wide identification of keystone hubs of connectivity

Treesearch

Todd B. Cross; Michael K. Schwartz; David E. Naugle; Brad C. Fedy; Jeffrey R. Row; Sara J. Oyler-McCance

2018-01-01

Genetic networks can characterize complex genetic relationships among groups of individuals, which can be used to rank nodes most important to the overall connectivity of the system. Ranking allows scarce resources to be guided toward nodes integral to connectivity. The greater sage-grouse (Centrocercus urophasianus) is a species of conservation concern that breeds on...

Method and systems for a radiation tolerant bus interface circuit

NASA Technical Reports Server (NTRS)

Kinstler, Gary A. (Inventor)

2007-01-01

A bus management tool that allows communication to be maintained between a group of nodes operatively connected on two busses in the presence of radiation by transmitting periodically a first message from one to another of the nodes on one of the busses, determining whether the first message was received by the other of the nodes on the first bus, and when it is determined that the first message was not received by the other of the nodes, transmitting a recovery command to the other of the nodes on a second of the of busses. Methods, systems, and articles of manufacture consistent with the present invention also provide for a bus recovery tool on the other node that re-initializes a bus interface circuit operatively connecting the other node to the first bus in response to the recovery command.

Building gene co-expression networks using transcriptomics data for systems biology investigations: Comparison of methods using microarray data

PubMed Central

Kadarmideen, Haja N; Watson-haigh, Nathan S

2012-01-01

Gene co-expression networks (GCN), built using high-throughput gene expression data are fundamental aspects of systems biology. The main aims of this study were to compare two popular approaches to building and analysing GCN. We use real ovine microarray transcriptomics datasets representing four different treatments with Metyrapone, an inhibitor of cortisol biosynthesis. We conducted several microarray quality control checks before applying GCN methods to filtered datasets. Then we compared the outputs of two methods using connectivity as a criterion, as it measures how well a node (gene) is connected within a network. The two GCN construction methods used were, Weighted Gene Co-expression Network Analysis (WGCNA) and Partial Correlation and Information Theory (PCIT) methods. Nodes were ranked based on their connectivity measures in each of the four different networks created by WGCNA and PCIT and node ranks in two methods were compared to identify those nodes which are highly differentially ranked (HDR). A total of 1,017 HDR nodes were identified across one or more of four networks. We investigated HDR nodes by gene enrichment analyses in relation to their biological relevance to phenotypes. We observed that, in contrast to WGCNA method, PCIT algorithm removes many of the edges of the most highly interconnected nodes. Removal of edges of most highly connected nodes or hub genes will have consequences for downstream analyses and biological interpretations. In general, for large GCN construction (with > 20000 genes) access to large computer clusters, particularly those with larger amounts of shared memory is recommended. PMID:23144540

Noninvasive Electromagnetic Source Imaging and Granger Causality Analysis: An Electrophysiological Connectome (eConnectome) Approach

PubMed Central

Sohrabpour, Abbas; Ye, Shuai; Worrell, Gregory A.; Zhang, Wenbo

2016-01-01

Objective Combined source imaging techniques and directional connectivity analysis can provide useful information about the underlying brain networks in a non-invasive fashion. Source imaging techniques have been used successfully to either determine the source of activity or to extract source time-courses for Granger causality analysis, previously. In this work, we utilize source imaging algorithms to both find the network nodes (regions of interest) and then extract the activation time series for further Granger causality analysis. The aim of this work is to find network nodes objectively from noninvasive electromagnetic signals, extract activation time-courses and apply Granger analysis on the extracted series to study brain networks under realistic conditions. Methods Source imaging methods are used to identify network nodes and extract time-courses and then Granger causality analysis is applied to delineate the directional functional connectivity of underlying brain networks. Computer simulations studies where the underlying network (nodes and connectivity pattern) is known were performed; additionally, this approach has been evaluated in partial epilepsy patients to study epilepsy networks from inter-ictal and ictal signals recorded by EEG and/or MEG. Results Localization errors of network nodes are less than 5 mm and normalized connectivity errors of ~20% in estimating underlying brain networks in simulation studies. Additionally, two focal epilepsy patients were studied and the identified nodes driving the epileptic network were concordant with clinical findings from intracranial recordings or surgical resection. Conclusion Our study indicates that combined source imaging algorithms with Granger causality analysis can identify underlying networks precisely (both in terms of network nodes location and internodal connectivity). Significance The combined source imaging and Granger analysis technique is an effective tool for studying normal or pathological brain conditions. PMID:27740473

Noninvasive Electromagnetic Source Imaging and Granger Causality Analysis: An Electrophysiological Connectome (eConnectome) Approach.

PubMed

Sohrabpour, Abbas; Ye, Shuai; Worrell, Gregory A; Zhang, Wenbo; He, Bin

2016-12-01

Combined source-imaging techniques and directional connectivity analysis can provide useful information about the underlying brain networks in a noninvasive fashion. Source-imaging techniques have been used successfully to either determine the source of activity or to extract source time-courses for Granger causality analysis, previously. In this work, we utilize source-imaging algorithms to both find the network nodes [regions of interest (ROI)] and then extract the activation time series for further Granger causality analysis. The aim of this work is to find network nodes objectively from noninvasive electromagnetic signals, extract activation time-courses, and apply Granger analysis on the extracted series to study brain networks under realistic conditions. Source-imaging methods are used to identify network nodes and extract time-courses and then Granger causality analysis is applied to delineate the directional functional connectivity of underlying brain networks. Computer simulations studies where the underlying network (nodes and connectivity pattern) is known were performed; additionally, this approach has been evaluated in partial epilepsy patients to study epilepsy networks from interictal and ictal signals recorded by EEG and/or Magnetoencephalography (MEG). Localization errors of network nodes are less than 5 mm and normalized connectivity errors of ∼20% in estimating underlying brain networks in simulation studies. Additionally, two focal epilepsy patients were studied and the identified nodes driving the epileptic network were concordant with clinical findings from intracranial recordings or surgical resection. Our study indicates that combined source-imaging algorithms with Granger causality analysis can identify underlying networks precisely (both in terms of network nodes location and internodal connectivity). The combined source imaging and Granger analysis technique is an effective tool for studying normal or pathological brain conditions.

Constructing fMRI connectivity networks: a whole brain functional parcellation method for node definition.

PubMed

Maggioni, Eleonora; Tana, Maria Gabriella; Arrigoni, Filippo; Zucca, Claudio; Bianchi, Anna Maria

2014-05-15

Functional Magnetic Resonance Imaging (fMRI) is used for exploring brain functionality, and recently it was applied for mapping the brain connection patterns. To give a meaningful neurobiological interpretation to the connectivity network, it is fundamental to properly define the network framework. In particular, the choice of the network nodes may affect the final connectivity results and the consequent interpretation. We introduce a novel method for the intra subject topological characterization of the nodes of fMRI brain networks, based on a whole brain parcellation scheme. The proposed whole brain parcellation algorithm divides the brain into clusters that are homogeneous from the anatomical and functional point of view, each of which constitutes a node. The functional parcellation described is based on the Tononi's cluster index, which measures instantaneous correlation in terms of intrinsic and extrinsic statistical dependencies. The method performance and reliability were first tested on simulated data, then on a real fMRI dataset acquired on healthy subjects during visual stimulation. Finally, the proposed algorithm was applied to epileptic patients' fMRI data recorded during seizures, to verify its usefulness as preparatory step for effective connectivity analysis. For each patient, the nodes of the network involved in ictal activity were defined according to the proposed parcellation scheme and Granger Causality Analysis (GCA) was applied to infer effective connectivity. We showed that the algorithm 1) performed well on simulated data, 2) was able to produce reliable inter subjects results and 3) led to a detailed definition of the effective connectivity pattern. Copyright © 2014 Elsevier B.V. All rights reserved.

A large-scale photonic node architecture that utilizes interconnected OXC subsystems.

PubMed

Iwai, Yuto; Hasegawa, Hiroshi; Sato, Ken-ichi

2013-01-14

We propose a novel photonic node architecture that is composed of interconnected small-scale optical cross-connect subsystems. We also developed an efficient dynamic network control algorithm that complies with a restriction on the number of intra-node fibers used for subsystem interconnection. Numerical evaluations verify that the proposed architecture offers almost the same performance as the equivalent single large-scale cross-connect switch, while enabling substantial hardware scale reductions.

Epidemic dynamics on a risk-based evolving social network

NASA Astrophysics Data System (ADS)

Antwi, Shadrack; Shaw, Leah

2013-03-01

Social network models have been used to study how behavior affects the dynamics of an infection in a population. Motivated by HIV, we consider how a trade-off between benefits and risks of sexual connections determine network structure and disease prevalence. We define a stochastic network model with formation and breaking of links as changes in sexual contacts. Each node has an intrinsic benefit its neighbors derive from connecting to it. Nodes' infection status is not apparent to others, but nodes with more connections (higher degree) are assumed more likely to be infected. The probability to form and break links is determined by a payoff computed from the benefit and degree-dependent risk. The disease is represented by a SI (susceptible-infected) model. We study network and epidemic evolution via Monte Carlo simulation and analytically predict the behavior with a heterogeneous mean field approach. The dependence of network connectivity and infection threshold on parameters is determined, and steady state degree distribution and epidemic levels are obtained. We also study a situation where system-wide infection levels alter perception of risk and cause nodes to adjust their behavior. This is a case of an adaptive network, where node status feeds back to change network geometry.

Effects of local and global network connectivity on synergistic epidemics

NASA Astrophysics Data System (ADS)

Broder-Rodgers, David; Pérez-Reche, Francisco J.; Taraskin, Sergei N.

2015-12-01

Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbors. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks that have both local and global connectivity obtained by random bond-rewiring to nodes within a certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role in epidemic spread, i.e., it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low.

Effects of local and global network connectivity on synergistic epidemics.

PubMed

Broder-Rodgers, David; Pérez-Reche, Francisco J; Taraskin, Sergei N

2015-12-01

Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbors. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks that have both local and global connectivity obtained by random bond-rewiring to nodes within a certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role in epidemic spread, i.e., it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low.

Row fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2008-10-14

An apparatus, program product and method checks for nodal faults in a row of nodes by causing each node in the row to concurrently communicate with its adjacent neighbor nodes in the row. The communications are analyzed to determine a presence of a faulty node or connection.

Row fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2012-02-07

An apparatus, program product and method check for nodal faults in a row of nodes by causing each node in the row to concurrently communicate with its adjacent neighbor nodes in the row. The communications are analyzed to determine a presence of a faulty node or connection.

Row fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D.; Smith, Brian Edward

2010-02-23

An apparatus and program product check for nodal faults in a row of nodes by causing each node in the row to concurrently communicate with its adjacent neighbor nodes in the row. The communications are analyzed to determine a presence of a faulty node or connection.

Wireless Data-Acquisition System for Testing Rocket Engines

NASA Technical Reports Server (NTRS)

Lin, Chujen; Lonske, Ben; Hou, Yalin; Xu, Yingjiu; Gang, Mei

2007-01-01

A prototype wireless data-acquisition system has been developed as a potential replacement for a wired data-acquisition system heretofore used in testing rocket engines. The traditional use of wires to connect sensors, signal-conditioning circuits, and data acquisition circuitry is time-consuming and prone to error, especially when, as is often the case, many sensors are used in a test. The system includes one master and multiple slave nodes. The master node communicates with a computer via an Ethernet connection. The slave nodes are powered by rechargeable batteries and are packaged in weatherproof enclosures. The master unit and each of the slave units are equipped with a time-modulated ultra-wide-band (TMUWB) radio transceiver, which spreads its RF energy over several gigahertz by transmitting extremely low-power and super-narrow pulses. In this prototype system, each slave node can be connected to as many as six sensors: two sensors can be connected directly to analog-to-digital converters (ADCs) in the slave node and four sensors can be connected indirectly to the ADCs via signal conditioners. The maximum sampling rate for streaming data from any given sensor is about 5 kHz. The bandwidth of one channel of the TM-UWB radio communication system is sufficient to accommodate streaming of data from five slave nodes when they are fully loaded with data collected through all possible sensor connections. TM-UWB radios have a much higher spatial capacity than traditional sinusoidal wave-based radios. Hence, this TM-UWB wireless data-acquisition can be scaled to cover denser sensor setups for rocket engine test stands. Another advantage of TM-UWB radios is that it will not interfere with existing wireless transmission. The maximum radio-communication range between the master node and a slave node for this prototype system is about 50 ft (15 m) when the master and slave transceivers are equipped with small dipole antennas. The range can be increased by changing to larger antennas and/or greater transmission power. The battery life of a slave node ranges from about six hours during operation at full capacity to as long as three days when the system is in a "sleep" mode used to conserve battery charge during times between setup and rocket-engine testing. Batteries can be added to prolong operational lifetimes. The radio transceiver dominates the power consumption.

Selection of test paths for solder joint intermittent connection faults under DC stimulus

NASA Astrophysics Data System (ADS)

Huakang, Li; Kehong, Lv; Jing, Qiu; Guanjun, Liu; Bailiang, Chen

2018-06-01

The test path of solder joint intermittent connection faults under direct-current stimulus is examined in this paper. According to the physical structure of the circuit, a network model is established first. A network node is utilised to represent the test node. The path edge refers to the number of intermittent connection faults in the path. Then, the selection criteria of the test path based on the node degree index are proposed and the solder joint intermittent connection faults are covered using fewer test paths. Finally, three circuits are selected to verify the method. To test if the intermittent fault is covered by the test paths, the intermittent fault is simulated by a switch. The results show that the proposed method can detect the solder joint intermittent connection fault using fewer test paths. Additionally, the number of detection steps is greatly reduced without compromising fault coverage.

A Test Methodology for Evaluating Cognitive Radio Systems

DTIC Science & Technology

2014-03-27

assumes that there are base stations which facilitate spectrum coordination by acting as spectrum brokers. Individual sensing nodes may feed local...spectrum information to the base stations [17]. The base station spectrum broker has a geolocation database of known licensed transmitters, but supplements...Sensing nodes are required to feed spectrum knowledge back to the central base station , though this act 8 does not require cognition. Instead, all

Compressive sensing of high betweenness centrality nodes in networks

NASA Astrophysics Data System (ADS)

Mahyar, Hamidreza; Hasheminezhad, Rouzbeh; Ghalebi K., Elahe; Nazemian, Ali; Grosu, Radu; Movaghar, Ali; Rabiee, Hamid R.

2018-05-01

Betweenness centrality is a prominent centrality measure expressing importance of a node within a network, in terms of the fraction of shortest paths passing through that node. Nodes with high betweenness centrality have significant impacts on the spread of influence and idea in social networks, the user activity in mobile phone networks, the contagion process in biological networks, and the bottlenecks in communication networks. Thus, identifying k-highest betweenness centrality nodes in networks will be of great interest in many applications. In this paper, we introduce CS-HiBet, a new method to efficiently detect top- k betweenness centrality nodes in networks, using compressive sensing. CS-HiBet can perform as a distributed algorithm by using only the local information at each node. Hence, it is applicable to large real-world and unknown networks in which the global approaches are usually unrealizable. The performance of the proposed method is evaluated by extensive simulations on several synthetic and real-world networks. The experimental results demonstrate that CS-HiBet outperforms the best existing methods with notable improvements.

An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network

PubMed Central

Brennan, Robert W.

2017-01-01

With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network. PMID:28906452

An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network.

PubMed

Taboun, Mohammed S; Brennan, Robert W

2017-09-14

With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network.

An Environment IoT Sensor Network for Monitoring the Environment

NASA Astrophysics Data System (ADS)

Martinez, K.; Hart, J. K.; Bragg, O.; Black, A.; Bader, S.; Basford, P. J.; Bragg, G. M.; Fabre, A.

2016-12-01

The Internet of Things is a term which has emerged to describe the increase of Internet connectivity of everyday objects. While wireless sensor networks have developed highly energy efficient designs they need a step-change in their interoperability and usability to become more commonly used in Earth Science. IoT techniques can bring many of these advances while reusing some of the technologies developed for low power sensing. Here we concentrate on developing effective use of internet protocols throughout a low power sensor network. This includes 6LowPAN to provide a mesh IPv6 network, 40mW 868 MHz CC1120 radio transceivers to save power but provide kilometre range, a CC2538 ARM® Cortex®-M3 as main processor and CoAP to provide a binary HTTP-like interface to the nodes. We discuss in detail a system we deployed to monitor periglacial, peat and fluvial processes in the Scottish Highlands. The system linked initial nodes 3km away further up the mountain 2km away and used a CoAP GET sequence from a base station in the valley to gather the data. The IPv6 addressing and tunnelling allowed direct connectivity to desktops in Southampton. This provides insights into how the combination of low power techniques and emerging internet standards will bring advantages in interoperability, heterogeneity, usability and maintainability.

Tracking trade transactions in water resource systems: A node-arc optimization formulation

NASA Astrophysics Data System (ADS)

Erfani, Tohid; Huskova, Ivana; Harou, Julien J.

2013-05-01

We formulate and apply a multicommodity network flow node-arc optimization model capable of tracking trade transactions in complex water resource systems. The model uses a simple node to node network connectivity matrix and does not require preprocessing of all possible flow paths in the network. We compare the proposed node-arc formulation with an existing arc-path (flow path) formulation and explain the advantages and difficulties of both approaches. We verify the proposed formulation model on a hypothetical water distribution network. Results indicate the arc-path model solves the problem with fewer constraints, but the proposed formulation allows using a simple network connectivity matrix which simplifies modeling large or complex networks. The proposed algorithm allows converting existing node-arc hydroeconomic models that broadly represent water trading to ones that also track individual supplier-receiver relationships (trade transactions).

Broad Learning System: An Effective and Efficient Incremental Learning System Without the Need for Deep Architecture.

PubMed

Chen, C L Philip; Liu, Zhulin

2018-01-01

Broad Learning System (BLS) that aims to offer an alternative way of learning in deep structure is proposed in this paper. Deep structure and learning suffer from a time-consuming training process because of a large number of connecting parameters in filters and layers. Moreover, it encounters a complete retraining process if the structure is not sufficient to model the system. The BLS is established in the form of a flat network, where the original inputs are transferred and placed as "mapped features" in feature nodes and the structure is expanded in wide sense in the "enhancement nodes." The incremental learning algorithms are developed for fast remodeling in broad expansion without a retraining process if the network deems to be expanded. Two incremental learning algorithms are given for both the increment of the feature nodes (or filters in deep structure) and the increment of the enhancement nodes. The designed model and algorithms are very versatile for selecting a model rapidly. In addition, another incremental learning is developed for a system that has been modeled encounters a new incoming input. Specifically, the system can be remodeled in an incremental way without the entire retraining from the beginning. Satisfactory result for model reduction using singular value decomposition is conducted to simplify the final structure. Compared with existing deep neural networks, experimental results on the Modified National Institute of Standards and Technology database and NYU NORB object recognition dataset benchmark data demonstrate the effectiveness of the proposed BLS.

A conceptual model for quantifying connectivity using graph theory and cellular (per-pixel) approach

NASA Astrophysics Data System (ADS)

Singh, Manudeo; Sinha, Rajiv; Tandon, Sampat K.

2016-04-01

The concept of connectivity is being increasingly used for understanding hydro-geomorphic processes at all spatio-temporal scales. Connectivity is defined as the potential for energy and material flux (water, sediments, nutrients, heat, etc.) to navigate within or between the landscape systems and has two components, structural connectivity and dynamic connectivity. Structural connectivity is defined by the spatially connected features (physical linkages) through which energy and materials flow. Dynamic connectivity is a process defined connectivity component. These two connectivity components also interact with each other by forming a feedback system. This study attempts to explore a method to quantify structural and dynamic connectivity. In fluvial transport systems, sediment and water can flow in either a diffused manner or in a channelized way. At all the scales, hydrological and sediment fluxes can be tracked using a cellular (per-pixel) approach and can be quantified using graphical approach. The material flux, slope and LULC (Land Use Land Cover) weightage factors of a pixel together determine if it will contribute towards connectivity of the landscape/system. In a graphical approach, all the contributing pixels will form a node at their centroid and this node will be connected to the next 'down-node' via a directed edge with 'least cost path'. The length of the edge will depend on the desired spatial scale and its path direction will depend on the traversed pixel's slope and the LULC (weightage) factors. The weightage factors will lie in-between 0 to 1. This value approaches 1 for the LULC factors which promote connectivity. For example, in terms of sediment connectivity, the weightage could be RUSLE (Revised Universal Soil Loss Equation) C-factors with bare unconsolidated surfaces having values close to 1. This method is best suited for areas with low slopes, where LULC can be a deciding as well as dominating factor. The degree of connectivity and its pathways will show changes under different LULC conditions even if the slope remains the same. The graphical approach provides the statistics of connected and disconnected graph elements (edges, nodes) and graph components, thereby allowing the quantification of structural connectivity. This approach also quantifies the dynamic connectivity by allowing the measurement of the fluxes (e.g. via hydrographs or sedimentographs) at any node as well as at any system outlet. The contribution of any sub-system can be understood by removing the remaining sub-systems which can be conveniently achieved by masking associated graph elements.

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

NASA Technical Reports Server (NTRS)

Peters, David J.; Sisson, Patricia L.; Green, James L.; Thomas, Valerie L.

1989-01-01

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.

Quantum statistics in complex networks

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra

The Barabasi-Albert (BA) model for a complex network shows a characteristic power law connectivity distribution typical of scale free systems. The Ising model on the BA network shows that the ferromagnetic phase transition temperature depends logarithmically on its size. We have introduced a fitness parameter for the BA network which describes the different abilities of nodes to compete for links. This model predicts the formation of a scale free network where each node increases its connectivity in time as a power-law with an exponent depending on its fitness. This model includes the fact that the node connectivity and growth rate do not depend on the node age alone and it reproduces non trivial correlation properties of the Internet. We have proposed a model of bosonic networks by a generalization of the BA model where the properties of quantum statistics can be applied. We have introduced a fitness eta i = e-bei where the temperature T = 1/ b is determined by the noise in the system and the energy ei accounts for qualitative differences of each node for acquiring links. The results of this work show that a power law network with exponent gamma = 2 can give a Bose condensation where a single node grabs a finite fraction of all the links. In order to address the connection with self-organized processes we have introduced a model for a growing Cayley tree that generalizes the dynamics of invasion percolation. At each node we associate a parameter ei (called energy) such that the probability to grow for each node is given by pii ∝ ebei where T = 1/ b is a statistical parameter of the system determined by the noise called the temperature. This model has been solved analytically with a similar mathematical technique as the bosonic scale-free networks and it shows the self organization of the low energy nodes at the interface. In the thermodynamic limit the Fermi distribution describes the probability of the energy distribution at the interface.

Chimera-like states in structured heterogeneous networks

NASA Astrophysics Data System (ADS)

Li, Bo; Saad, David

2017-04-01

Chimera-like states are manifested through the coexistence of synchronous and asynchronous dynamics and have been observed in various systems. To analyze the role of network topology in giving rise to chimera-like states, we study a heterogeneous network model comprising two groups of nodes, of high and low degrees of connectivity. The architecture facilitates the analysis of the system, which separates into a densely connected coherent group of nodes, perturbed by their sparsely connected drifting neighbors. It describes a synchronous behavior of the densely connected group and scaling properties of the induced perturbations.

Network discovery with DCM

PubMed Central

Friston, Karl J.; Li, Baojuan; Daunizeau, Jean; Stephan, Klaas E.

2011-01-01

This paper is about inferring or discovering the functional architecture of distributed systems using Dynamic Causal Modelling (DCM). We describe a scheme that recovers the (dynamic) Bayesian dependency graph (connections in a network) using observed network activity. This network discovery uses Bayesian model selection to identify the sparsity structure (absence of edges or connections) in a graph that best explains observed time-series. The implicit adjacency matrix specifies the form of the network (e.g., cyclic or acyclic) and its graph-theoretical attributes (e.g., degree distribution). The scheme is illustrated using functional magnetic resonance imaging (fMRI) time series to discover functional brain networks. Crucially, it can be applied to experimentally evoked responses (activation studies) or endogenous activity in task-free (resting state) fMRI studies. Unlike conventional approaches to network discovery, DCM permits the analysis of directed and cyclic graphs. Furthermore, it eschews (implausible) Markovian assumptions about the serial independence of random fluctuations. The scheme furnishes a network description of distributed activity in the brain that is optimal in the sense of having the greatest conditional probability, relative to other networks. The networks are characterised in terms of their connectivity or adjacency matrices and conditional distributions over the directed (and reciprocal) effective connectivity between connected nodes or regions. We envisage that this approach will provide a useful complement to current analyses of functional connectivity for both activation and resting-state studies. PMID:21182971

Performance Evaluation Modeling of Network Sensors

NASA Technical Reports Server (NTRS)

Clare, Loren P.; Jennings, Esther H.; Gao, Jay L.

2003-01-01

Substantial benefits are promised by operating many spatially separated sensors collectively. Such systems are envisioned to consist of sensor nodes that are connected by a communications network. A simulation tool is being developed to evaluate the performance of networked sensor systems, incorporating such metrics as target detection probabilities, false alarms rates, and classification confusion probabilities. The tool will be used to determine configuration impacts associated with such aspects as spatial laydown, and mixture of different types of sensors (acoustic, seismic, imaging, magnetic, RF, etc.), and fusion architecture. The QualNet discrete-event simulation environment serves as the underlying basis for model development and execution. This platform is recognized for its capabilities in efficiently simulating networking among mobile entities that communicate via wireless media. We are extending QualNet's communications modeling constructs to capture the sensing aspects of multi-target sensing (analogous to multiple access communications), unimodal multi-sensing (broadcast), and multi-modal sensing (multiple channels and correlated transmissions). Methods are also being developed for modeling the sensor signal sources (transmitters), signal propagation through the media, and sensors (receivers) that are consistent with the discrete event paradigm needed for performance determination of sensor network systems. This work is supported under the Microsensors Technical Area of the Army Research Laboratory (ARL) Advanced Sensors Collaborative Technology Alliance.

Empowering smartphone users with sensor node for air quality measurement

NASA Astrophysics Data System (ADS)

Oletic, Dinko; Bilas, Vedran

2013-06-01

We present an architecture of a sensor node developed for use with smartphones for participatory sensing of air quality in urban environments. Our solution features inexpensive metal-oxide semiconductor gas sensors (MOX) for measurement of CO, O3, NO2 and VOC, along with sensors for ambient temperature and humidity. We focus on our design of sensor interface consisting of power-regulated heater temperature control, and the design of resistance sensing circuit. Accuracy of the sensor interface is characterized. Power consumption of the sensor node is analysed. Preliminary data obtained from the CO gas sensors in laboratory conditions and during the outdoor field-test is shown.

Bisectional fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2012-02-14

An apparatus, program product and method logically divide a group of nodes and causes node pairs comprising a node from each section to communicate. Results from the communications may be analyzed to determine performance characteristics, such as bandwidth and proper connectivity.

Bisectional fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2009-08-04

An apparatus and program product logically divide a group of nodes and causes node pairs comprising a node from each section to communicate. Results from the communications may be analyzed to determine performance characteristics, such as bandwidth and proper connectivity.

Bisectional fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2008-11-11

An apparatus, program product and method logically divides a group of nodes and causes node pairs comprising a node from each section to communicate. Results from the communications may be analyzed to determine performance characteristics, such as bandwidth and proper connectivity.

Model Checking a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2011-01-01

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.

From Micro to Nano: The Evolution of Wireless Sensor-Based Health Care.

PubMed

Sarkar, Subhadeep; Misra, Sudip

2016-01-01

Over the past decade, embedded systems and microelectromechanical systems have evolved in a radical way, redefining our standard of living and enhancing the quality of life. Health care, among various other fields, has benefited vastly from this technological development. The concept of using sensors for health care purposes originated in the late 1980s when sensors were developed to measure certain physiological parameters associated with the human body. In traditional sensor nodes, the signal sources are mostly different environmental phenomena (such as temperature, vibration, and luminosity) or man-made events (such as intrusion and mobile target tracking), whereas in case of the physiological sensors, the signal source is living human tissue. These sensor nodes, as their primary sensing element, have a diaphragm that converts pressure into displacement. This displacement, in turn, is subsequently transformed into an electrical signal. The concept of wireless physiological sensor nodes, however, gained popularity in the mid-2000s, with the sensed data from the nodes transmitted to the hub via a wireless medium. The network formed by this heterogeneous set of wireless body sensor nodes is termed a wireless body-area network (WBAN). Each WBAN is essentially a composition of multiple wireless body sensor nodes and a single hub. The hub is primarily responsible for acquisition of the raw sensed data from all the component sensor nodes and first-level aggregation of the data before transmitting the aggregated data for further analysis to a remote data acquisition center. Here, we outline the evolution of WBANs in the context of modern health care and its convergence with nanotechnology.

Inter-trabecular angle: A parameter of trabecular bone architecture in the human proximal femur that reveals underlying topological motifs.

PubMed

Reznikov, Natalie; Chase, Hila; Ben Zvi, Yehonatan; Tarle, Victoria; Singer, Matthew; Brumfeld, Vlad; Shahar, Ron; Weiner, Steve

2016-10-15

Trabecular bone is an intricate 3D network of struts and plates. Although the structure-function relations in trabecular bone have been studied since the time of Julius Wolff, controversy still exists regarding the architectural parameters responsible for its stability and resilience. We present a parameter that measures the angle between two connected trabeculae - the Inter-Trabecular Angle (ITA). We studied the ITA values derived from μCT scans of different regions of the proximal femora of 5 individuals of different age and sex. We show that the ITA angle distribution of nodes with 3 connecting trabeculae has a mean close to 120°, nodes with 4 connecting trabeculae has a mean close to 109° and nodes of higher connectivity have mean ITA values around 100°. This tendency to spread the ITAs around geometrically symmetrical motifs is highly conserved. The implication is that the ITAs are optimized such that the smallest amount of material spans the maximal 3D volume, and possibly by so doing trabecular bone might be better adapted to multidirectional loading. We also draw a parallel between trabecular bone and tensegrity structures - where lightweight, resilient and stable tetrahedron-based shapes contribute to strain redistribution amongst all the elements and to collective impact dampening. The Inter-Trabecular Angle (ITA) is a new topological parameter of trabecular bone. The ITA characterizes the way trabeculae connect with each other at nodes, regardless of their thickness and shape. The mean ITA value of nodes with 3 trabeculae is close to 120°, of nodes with 4 trabeculae is just below 109°, and the mean ITA of nodes with 5 and more trabeculae is around 100°. Thus the connections of trabeculae trend towards adopting symmetrical shapes. This implies that trabeculae can maximally span 3D space using the minimal amount of material. We draw a parallel between this motif and the concept of tensegrity - an engineering premise to which many living creatures conform at multiple levels of organization. Copyright © 2016 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Ventral Striatum Functional Connectivity as a Predictor of Adolescent Depressive Disorder in a Longitudinal Community-Based Sample.

PubMed

Pan, Pedro Mario; Sato, João R; Salum, Giovanni A; Rohde, Luis A; Gadelha, Ary; Zugman, Andre; Mari, Jair; Jackowski, Andrea; Picon, Felipe; Miguel, Eurípedes C; Pine, Daniel S; Leibenluft, Ellen; Bressan, Rodrigo A; Stringaris, Argyris

2017-11-01

Previous studies have implicated aberrant reward processing in the pathogenesis of adolescent depression. However, no study has used functional connectivity within a distributed reward network, assessed using resting-state functional MRI (fMRI), to predict the onset of depression in adolescents. This study used reward network-based functional connectivity at baseline to predict depressive disorder at follow-up in a community sample of adolescents. A total of 637 children 6-12 years old underwent resting-state fMRI. Discovery and replication analyses tested intrinsic functional connectivity (iFC) among nodes of a putative reward network. Logistic regression tested whether striatal node strength, a measure of reward-related iFC, predicted onset of a depressive disorder at 3-year follow-up. Further analyses investigated the specificity of this prediction. Increased left ventral striatum node strength predicted increased risk for future depressive disorder (odds ratio=1.54, 95% CI=1.09-2.18), even after excluding participants who had depressive disorders at baseline (odds ratio=1.52, 95% CI=1.05-2.20). Among 11 reward-network nodes, only the left ventral striatum significantly predicted depression. Striatal node strength did not predict other common adolescent psychopathology, such as anxiety, attention deficit hyperactivity disorder, and substance use. Aberrant ventral striatum functional connectivity specifically predicts future risk for depressive disorder. This finding further emphasizes the need to understand how brain reward networks contribute to youth depression.

Multi-scale dynamics and relaxation of a tethered membrane in a solvent by Monte Carlo simulations

NASA Astrophysics Data System (ADS)

Pandey, Ras; Anderson, Kelly; Farmer, Barry

2006-03-01

A tethered membrane modeled by a flexible sheet dissipates entropy as it wrinkles and crumples. Nodes of a coarse grained membrane are connected via multiple pathways for dynamical modes to propagate. We consider a sheet with nodes connected by fluctuating bonds on a cubic lattice. The empty lattice sites constitute an effective solvent medium via node-solvent interaction. Each node execute its stochastic motion with the Metropolis algorithm subject to bond fluctuations, excluded volume constraints, and interaction energy. Dynamics and conformation of the sheet are examined at a low and a high temperature with attractive and repulsive node-node interactions for the contrast in an attractive solvent medium. Variations of the mean square displacement of the center node of the sheet and that of its center of mass with the time steps are examined in detail which show different power-law motion from short to long time regimes. Relaxation of the gyration radius and scaling of its asymptotic value with the molecular weight are examined.

Reconstruction of Complex Network based on the Noise via QR Decomposition and Compressed Sensing.

PubMed

Li, Lixiang; Xu, Dafei; Peng, Haipeng; Kurths, Jürgen; Yang, Yixian

2017-11-08

It is generally known that the states of network nodes are stable and have strong correlations in a linear network system. We find that without the control input, the method of compressed sensing can not succeed in reconstructing complex networks in which the states of nodes are generated through the linear network system. However, noise can drive the dynamics between nodes to break the stability of the system state. Therefore, a new method integrating QR decomposition and compressed sensing is proposed to solve the reconstruction problem of complex networks under the assistance of the input noise. The state matrix of the system is decomposed by QR decomposition. We construct the measurement matrix with the aid of Gaussian noise so that the sparse input matrix can be reconstructed by compressed sensing. We also discover that noise can build a bridge between the dynamics and the topological structure. Experiments are presented to show that the proposed method is more accurate and more efficient to reconstruct four model networks and six real networks by the comparisons between the proposed method and only compressed sensing. In addition, the proposed method can reconstruct not only the sparse complex networks, but also the dense complex networks.

Dynamic fair node spectrum allocation for ad hoc networks using random matrices

NASA Astrophysics Data System (ADS)

Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

2015-05-01

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

AISIM (Automated Interactive Simulation Modeling System) VAX Version Training Manual.

DTIC Science & Technology

1985-02-01

node to which the link is to run, a-nd-(3) a user-given name of the link. To pi’ace a link called " LINKI " from NODE1 to NODE2, type CON NODE1,NODE2...example, to eliminate the connection between NODEI and NODE2 type DELETE LINKI The result on the screen would be that the link named "LINK1" would...the user should now enter the command: DEFINE PATH,NODE2 ,NODE4, LINKI ,LINK4 not only would the path from NODE2 to NODE4 be established, but the path

Towards understanding the behavior of physical systems using information theory

NASA Astrophysics Data System (ADS)

Quax, Rick; Apolloni, Andrea; Sloot, Peter M. A.

2013-09-01

One of the goals of complex network analysis is to identify the most influential nodes, i.e., the nodes that dictate the dynamics of other nodes. In the case of autonomous systems or transportation networks, highly connected hubs play a preeminent role in diffusing the flow of information and viruses; in contrast, in language evolution most linguistic norms come from the peripheral nodes who have only few contacts. Clearly a topological analysis of the interactions alone is not sufficient to identify the nodes that drive the state of the network. Here we show how information theory can be used to quantify how the dynamics of individual nodes propagate through a system. We interpret the state of a node as a storage of information about the state of other nodes, which is quantified in terms of Shannon information. This information is transferred through interactions and lost due to noise, and we calculate how far it can travel through a network. We apply this concept to a model of opinion formation in a complex social network to calculate the impact of each node by measuring how long its opinion is remembered by the network. Counter-intuitively we find that the dynamics of opinions are not determined by the hubs or peripheral nodes, but rather by nodes with an intermediate connectivity.

Standards-Based Wireless Sensor Networking Protocols for Spaceflight Applications

NASA Technical Reports Server (NTRS)

Barton, Richard J.; Wagner, Raymond S.

2009-01-01

Wireless sensor networks (WSNs) have the capacity to revolutionize data gathering in both spaceflight and terrestrial applications. WSNs provide a huge advantage over traditional, wired instrumentation since they do not require wiring trunks to connect sensors to a central hub. This allows for easy sensor installation in hard to reach locations, easy expansion of the number of sensors or sensing modalities, and reduction in both system cost and weight. While this technology offers unprecedented flexibility and adaptability, implementing it in practice is not without its difficulties. Any practical WSN deployment must contend with a number of difficulties in its radio frequency (RF) environment. Multi-path reflections can distort signals, limit data rates, and cause signal fades that prevent nodes from having clear access to channels, especially in a closed environment such as a spacecraft. Other RF signal sources, such as wireless internet, voice, and data systems may contend with the sensor nodes for bandwidth. Finally, RF noise from electrical systems and periodic scattering from moving objects such as crew members will all combine to give an incredibly unpredictable, time-varying communication environment.

Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster

PubMed Central

Fan, Hangyu; Wang, Huandong; Li, Yong

2018-01-01

Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance. PMID:29360792

Simulation of Physical and Media Access Control (MAC) for Resilient and Scalable Wireless Sensor Networks

DTIC Science & Technology

2006-03-01

schedules uniform wakeup for all the nodes. When data is transmitted, only specific destination nodes need to remain awake. Other nodes not participating...of Carrier Sense ....................................................................30 3. Synchronous vs Asynchronous Wakeup Mechanisms...proposal is to have each pair of node schedule their “wake-up” or “beacons” independent of the IEEE 802.11 PSM beacon. In the ideal scenario, where

Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks.

PubMed

Zhou, Zhangbing; Xing, Riliang; Duan, Yucong; Zhu, Yueqin; Xiang, Jianming

2015-12-15

With the advent of the Internet of Underwater Things, smart things are deployed in the ocean space and establish underwater wireless sensor networks for the monitoring of vast and dynamic underwater environments. When events are found to have possibly occurred, accurate event coverage should be detected, and potential event sources should be determined for the enactment of prompt and proper responses. To address this challenge, a technique that detects event coverage and determines event sources is developed in this article. Specifically, the occurrence of possible events corresponds to a set of neighboring sensor nodes whose sensory data may deviate from a normal sensing range in a collective fashion. An appropriate sensor node is selected as the relay node for gathering and routing sensory data to sink node(s). When sensory data are collected at sink node(s), the event coverage is detected and represented as a weighted graph, where the vertices in this graph correspond to sensor nodes and the weight specified upon the edges reflects the extent of sensory data deviating from a normal sensing range. Event sources are determined, which correspond to the barycenters in this graph. The results of the experiments show that our technique is more energy efficient, especially when the network topology is relatively steady.

Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks

PubMed Central

Zhou, Zhangbing; Xing, Riliang; Duan, Yucong; Zhu, Yueqin; Xiang, Jianming

2015-01-01

With the advent of the Internet of Underwater Things, smart things are deployed in the ocean space and establish underwater wireless sensor networks for the monitoring of vast and dynamic underwater environments. When events are found to have possibly occurred, accurate event coverage should be detected, and potential event sources should be determined for the enactment of prompt and proper responses. To address this challenge, a technique that detects event coverage and determines event sources is developed in this article. Specifically, the occurrence of possible events corresponds to a set of neighboring sensor nodes whose sensory data may deviate from a normal sensing range in a collective fashion. An appropriate sensor node is selected as the relay node for gathering and routing sensory data to sink node(s). When sensory data are collected at sink node(s), the event coverage is detected and represented as a weighted graph, where the vertices in this graph correspond to sensor nodes and the weight specified upon the edges reflects the extent of sensory data deviating from a normal sensing range. Event sources are determined, which correspond to the barycenters in this graph. The results of the experiments show that our technique is more energy efficient, especially when the network topology is relatively steady. PMID:26694394

Network modelling methods for FMRI.

PubMed

Smith, Stephen M; Miller, Karla L; Salimi-Khorshidi, Gholamreza; Webster, Matthew; Beckmann, Christian F; Nichols, Thomas E; Ramsey, Joseph D; Woolrich, Mark W

2011-01-15

There is great interest in estimating brain "networks" from FMRI data. This is often attempted by identifying a set of functional "nodes" (e.g., spatial ROIs or ICA maps) and then conducting a connectivity analysis between the nodes, based on the FMRI timeseries associated with the nodes. Analysis methods range from very simple measures that consider just two nodes at a time (e.g., correlation between two nodes' timeseries) to sophisticated approaches that consider all nodes simultaneously and estimate one global network model (e.g., Bayes net models). Many different methods are being used in the literature, but almost none has been carefully validated or compared for use on FMRI timeseries data. In this work we generate rich, realistic simulated FMRI data for a wide range of underlying networks, experimental protocols and problematic confounds in the data, in order to compare different connectivity estimation approaches. Our results show that in general correlation-based approaches can be quite successful, methods based on higher-order statistics are less sensitive, and lag-based approaches perform very poorly. More specifically: there are several methods that can give high sensitivity to network connection detection on good quality FMRI data, in particular, partial correlation, regularised inverse covariance estimation and several Bayes net methods; however, accurate estimation of connection directionality is more difficult to achieve, though Patel's τ can be reasonably successful. With respect to the various confounds added to the data, the most striking result was that the use of functionally inaccurate ROIs (when defining the network nodes and extracting their associated timeseries) is extremely damaging to network estimation; hence, results derived from inappropriate ROI definition (such as via structural atlases) should be regarded with great caution. Copyright © 2010 Elsevier Inc. All rights reserved.

A Support Vector Learning-Based Particle Filter Scheme for Target Localization in Communication-Constrained Underwater Acoustic Sensor Networks

PubMed Central

Zhang, Chenglin; Yan, Lei; Han, Song; Guan, Xinping

2017-01-01

Target localization, which aims to estimate the location of an unknown target, is one of the key issues in applications of underwater acoustic sensor networks (UASNs). However, the constrained property of an underwater environment, such as restricted communication capacity of sensor nodes and sensing noises, makes target localization a challenging problem. This paper relies on fractional sensor nodes to formulate a support vector learning-based particle filter algorithm for the localization problem in communication-constrained underwater acoustic sensor networks. A node-selection strategy is exploited to pick fractional sensor nodes with short-distance pattern to participate in the sensing process at each time frame. Subsequently, we propose a least-square support vector regression (LSSVR)-based observation function, through which an iterative regression strategy is used to deal with the distorted data caused by sensing noises, to improve the observation accuracy. At the same time, we integrate the observation to formulate the likelihood function, which effectively update the weights of particles. Thus, the particle effectiveness is enhanced to avoid “particle degeneracy” problem and improve localization accuracy. In order to validate the performance of the proposed localization algorithm, two different noise scenarios are investigated. The simulation results show that the proposed localization algorithm can efficiently improve the localization accuracy. In addition, the node-selection strategy can effectively select the subset of sensor nodes to improve the communication efficiency of the sensor network. PMID:29267252

A Support Vector Learning-Based Particle Filter Scheme for Target Localization in Communication-Constrained Underwater Acoustic Sensor Networks.

PubMed

Li, Xinbin; Zhang, Chenglin; Yan, Lei; Han, Song; Guan, Xinping

2017-12-21

Target localization, which aims to estimate the location of an unknown target, is one of the key issues in applications of underwater acoustic sensor networks (UASNs). However, the constrained property of an underwater environment, such as restricted communication capacity of sensor nodes and sensing noises, makes target localization a challenging problem. This paper relies on fractional sensor nodes to formulate a support vector learning-based particle filter algorithm for the localization problem in communication-constrained underwater acoustic sensor networks. A node-selection strategy is exploited to pick fractional sensor nodes with short-distance pattern to participate in the sensing process at each time frame. Subsequently, we propose a least-square support vector regression (LSSVR)-based observation function, through which an iterative regression strategy is used to deal with the distorted data caused by sensing noises, to improve the observation accuracy. At the same time, we integrate the observation to formulate the likelihood function, which effectively update the weights of particles. Thus, the particle effectiveness is enhanced to avoid "particle degeneracy" problem and improve localization accuracy. In order to validate the performance of the proposed localization algorithm, two different noise scenarios are investigated. The simulation results show that the proposed localization algorithm can efficiently improve the localization accuracy. In addition, the node-selection strategy can effectively select the subset of sensor nodes to improve the communication efficiency of the sensor network.

Brain connectivity aberrations in anabolic-androgenic steroid users.

PubMed

Westlye, Lars T; Kaufmann, Tobias; Alnæs, Dag; Hullstein, Ingunn R; Bjørnebekk, Astrid

2017-01-01

Sustained anabolic-androgenic steroid (AAS) use has adverse behavioral consequences, including aggression, violence and impulsivity. Candidate mechanisms include disruptions of brain networks with high concentrations of androgen receptors and critically involved in emotional and cognitive regulation. Here, we tested the effects of AAS on resting-state functional brain connectivity in the largest sample of AAS-users to date. We collected resting-state functional magnetic resonance imaging (fMRI) data from 151 males engaged in heavy resistance strength training. 50 users tested positive for AAS based on the testosterone to epitestosterone (T/E) ratio and doping substances in urine. 16 previous users and 59 controls tested negative. We estimated brain network nodes and their time-series using ICA and dual regression and defined connectivity matrices as the between-node partial correlations. In line with the emotional and behavioral consequences of AAS, current users exhibited reduced functional connectivity between key nodes involved in emotional and cognitive regulation, in particular reduced connectivity between the amygdala and default-mode network (DMN) and between the dorsal attention network (DAN) and a frontal node encompassing the superior and inferior frontal gyri (SFG/IFG) and the anterior cingulate cortex (ACC), with further reductions as a function of dependency, lifetime exposure, and cycle state (on/off).

Method and apparatus for connecting finite element meshes and performing simulations therewith

DOEpatents

Dohrmann, Clark R.; Key, Samuel W.; Heinstein, Martin W.

2003-05-06

The present invention provides a method of connecting dissimilar finite element meshes. A first mesh, designated the master mesh, and a second mesh, designated the slave mesh, each have interface surfaces proximal the other. Each interface surface has a corresponding interface mesh comprising a plurality of interface nodes. Each slave interface node is assigned new coordinates locating the interface node on the interface surface of the master mesh. The slave interface surface is further redefined to be the projection of the slave interface mesh onto the master interface surface.

Analysis and Enhancement of Low-Light-Level Performance of Photodiode-Type CMOS Active Pixel Images Operated with Sub-Threshold Reset

NASA Technical Reports Server (NTRS)

Pain, Bedabrata; Yang, Guang; Ortiz, Monico; Wrigley, Christopher; Hancock, Bruce; Cunningham, Thomas

2000-01-01

Noise in photodiode-type CMOS active pixel sensors (APS) is primarily due to the reset (kTC) noise at the sense node, since it is difficult to implement in-pixel correlated double sampling for a 2-D array. Signal integrated on the photodiode sense node (SENSE) is calculated by measuring difference between the voltage on the column bus (COL) - before and after the reset (RST) is pulsed. Lower than kTC noise can be achieved with photodiode-type pixels by employing "softreset" technique. Soft-reset refers to resetting with both drain and gate of the n-channel reset transistor kept at the same potential, causing the sense node to be reset using sub-threshold MOSFET current. However, lowering of noise is achieved only at the expense higher image lag and low-light-level non-linearity. In this paper, we present an analysis to explain the noise behavior, show evidence of degraded performance under low-light levels, and describe new pixels that eliminate non-linearity and lag without compromising noise.

Short-term memory capacity in networks via the restricted isometry property.

PubMed

Charles, Adam S; Yap, Han Lun; Rozell, Christopher J

2014-06-01

Cortical networks are hypothesized to rely on transient network activity to support short-term memory (STM). In this letter, we study the capacity of randomly connected recurrent linear networks for performing STM when the input signals are approximately sparse in some basis. We leverage results from compressed sensing to provide rigorous nonasymptotic recovery guarantees, quantifying the impact of the input sparsity level, the input sparsity basis, and the network characteristics on the system capacity. Our analysis demonstrates that network memory capacities can scale superlinearly with the number of nodes and in some situations can achieve STM capacities that are much larger than the network size. We provide perfect recovery guarantees for finite sequences and recovery bounds for infinite sequences. The latter analysis predicts that network STM systems may have an optimal recovery length that balances errors due to omission and recall mistakes. Furthermore, we show that the conditions yielding optimal STM capacity can be embodied in several network topologies, including networks with sparse or dense connectivities.

Realtime Gas Emission Monitoring at Hazardous Sites Using a Distributed Point-Source Sensing Infrastructure.

PubMed

Manes, Gianfranco; Collodi, Giovanni; Gelpi, Leonardo; Fusco, Rosanna; Ricci, Giuseppe; Manes, Antonio; Passafiume, Marco

2016-01-20

This paper describes a distributed point-source monitoring platform for gas level and leakage detection in hazardous environments. The platform, based on a wireless sensor network (WSN) architecture, is organised into sub-networks to be positioned in the plant's critical areas; each sub-net includes a gateway unit wirelessly connected to the WSN nodes, hence providing an easily deployable, stand-alone infrastructure featuring a high degree of scalability and reconfigurability. Furthermore, the system provides automated calibration routines which can be accomplished by non-specialized maintenance operators without system reliability reduction issues. Internet connectivity is provided via TCP/IP over GPRS (Internet standard protocols over mobile networks) gateways at a one-minute sampling rate. Environmental and process data are forwarded to a remote server and made available to authenticated users through a user interface that provides data rendering in various formats and multi-sensor data fusion. The platform is able to provide real-time plant management with an effective; accurate tool for immediate warning in case of critical events.

A Depth-Adjustment Deployment Algorithm Based on Two-Dimensional Convex Hull and Spanning Tree for Underwater Wireless Sensor Networks.

PubMed

Jiang, Peng; Liu, Shuai; Liu, Jun; Wu, Feng; Zhang, Le

2016-07-14

Most of the existing node depth-adjustment deployment algorithms for underwater wireless sensor networks (UWSNs) just consider how to optimize network coverage and connectivity rate. However, these literatures don't discuss full network connectivity, while optimization of network energy efficiency and network reliability are vital topics for UWSN deployment. Therefore, in this study, a depth-adjustment deployment algorithm based on two-dimensional (2D) convex hull and spanning tree (NDACS) for UWSNs is proposed. First, the proposed algorithm uses the geometric characteristics of a 2D convex hull and empty circle to find the optimal location of a sleep node and activate it, minimizes the network coverage overlaps of the 2D plane, and then increases the coverage rate until the first layer coverage threshold is reached. Second, the sink node acts as a root node of all active nodes on the 2D convex hull and then forms a small spanning tree gradually. Finally, the depth-adjustment strategy based on time marker is used to achieve the three-dimensional overall network deployment. Compared with existing depth-adjustment deployment algorithms, the simulation results show that the NDACS algorithm can maintain full network connectivity with high network coverage rate, as well as improved network average node degree, thus increasing network reliability.

A Depth-Adjustment Deployment Algorithm Based on Two-Dimensional Convex Hull and Spanning Tree for Underwater Wireless Sensor Networks

PubMed Central

Jiang, Peng; Liu, Shuai; Liu, Jun; Wu, Feng; Zhang, Le

2016-01-01

Most of the existing node depth-adjustment deployment algorithms for underwater wireless sensor networks (UWSNs) just consider how to optimize network coverage and connectivity rate. However, these literatures don’t discuss full network connectivity, while optimization of network energy efficiency and network reliability are vital topics for UWSN deployment. Therefore, in this study, a depth-adjustment deployment algorithm based on two-dimensional (2D) convex hull and spanning tree (NDACS) for UWSNs is proposed. First, the proposed algorithm uses the geometric characteristics of a 2D convex hull and empty circle to find the optimal location of a sleep node and activate it, minimizes the network coverage overlaps of the 2D plane, and then increases the coverage rate until the first layer coverage threshold is reached. Second, the sink node acts as a root node of all active nodes on the 2D convex hull and then forms a small spanning tree gradually. Finally, the depth-adjustment strategy based on time marker is used to achieve the three-dimensional overall network deployment. Compared with existing depth-adjustment deployment algorithms, the simulation results show that the NDACS algorithm can maintain full network connectivity with high network coverage rate, as well as improved network average node degree, thus increasing network reliability. PMID:27428970

Method and system for monitoring environmental conditions

DOEpatents

Kulesz, James J [Oak Ridge, TN; Lee, Ronald W [Oak Ridge, TN

2010-11-16

A system for detecting the occurrence of anomalies includes a plurality of spaced apart nodes, with each node having adjacent nodes, each of the nodes having one or more sensors associated with the node and capable of detecting anomalies, and each of the nodes having a controller connected to the sensors associated with the node. The system also includes communication links between adjacent nodes, whereby the nodes form a network. At least one software agent is capable of changing the operation of at least one of the controllers in response to the detection of an anomaly by a sensor.

Frequency of an accessory popliteal efferent lymphatic pathway in dogs.

PubMed

Mayer, Monique N; Sweet, Katherine A; Patsikas, Michael N; Sukut, Sally L; Waldner, Cheryl L

2018-05-01

Staging and therapeutic planning for dogs with malignant disease in the popliteal lymph node are based on the expected patterns of lymphatic drainage from the lymph node. The medial iliac lymph nodes are known to receive efferent lymph from the popliteal lymph node; however, an accessory popliteal efferent pathway with direct connection to the sacral lymph nodes has also been less frequently reported. The primary objective of this prospective, anatomic study was to describe the frequency of various patterns of lymphatic drainage of the popliteal lymph node. With informed client consent, 50 adult dogs with no known disease of the lymphatic system underwent computed tomographic lymphography after ultrasound-guided, percutaneous injection of 350 mg/ml iohexol into a popliteal lymph node. In all 50 dogs, the popliteal lymph node drained directly to the ipsilateral medial iliac lymph node through multiple lymphatic vessels that coursed along the medial thigh. In 26% (13/50) of dogs, efferent vessels also drained from the popliteal lymph node directly to the internal iliac and/or sacral lymph nodes, coursing laterally through the gluteal region and passing over the dorsal aspect of the pelvis. Lymphatic connections between the right and left medial iliac and right and left internal iliac lymph nodes were found. Based on our findings, the internal iliac and sacral lymph nodes should be considered when staging or planning therapy for dogs with malignant disease in the popliteal lymph node. © 2018 American College of Veterinary Radiology.

Pulled microcapillary tube resonators with electrical readout for mass sensing applications

PubMed Central

Lee, Donghyuk; Kim, Joonhui; Cho, Nam-Joon; Kang, Taewook; Kauh, Sangken; Lee, Jungchul

2016-01-01

This paper reports a microfabrication-free approach to make hollow channel mass sensors by pulling a glass capillary and suspending it on top of a machined jig. A part of the pulled section makes simple contact with an actuation node and a quartz tuning fork (QTF) which acts as a sensing node. The two nodes define a pulled micro capillary tube resonator (PμTR) simply supported at two contacts. While a piezo actuator beneath the actuation node excites the PμTR, the QTF senses the resonance frequency of the PμTR. The proposed concept was validated by electrical and optical measurements of resonant spectra of PμTR. Then, different liquid samples including water, ethanol, glycerol, and their binary mixtures were introduced into the PμTR and the resonance frequency of the PμTR was measured as a function of liquid density. Density responsivity of −3,088 Hz-g−1 cm3 obtained is comparable to those of microfabricated hollow resonators. With a micro droplet generation chip configured in series with the PμTR, size distribution of oil droplets suspended in water was successfully measured with the radius resolution of 31 nm at the average droplet radius, 28.47 μm. Overall, typical off-the-shelf parts simply constitute a resonant mass sensing system along with a convenient electrical readout. PMID:27694852

A Low-Noise X-ray Astronomical Silicon-On-Insulator Pixel Detector Using a Pinned Depleted Diode Structure

PubMed Central

Kamehama, Hiroki; Kawahito, Shoji; Shrestha, Sumeet; Nakanishi, Syunta; Yasutomi, Keita; Takeda, Ayaki; Tsuru, Takeshi Go

2017-01-01

This paper presents a novel full-depletion Si X-ray detector based on silicon-on-insulator pixel (SOIPIX) technology using a pinned depleted diode structure, named the SOIPIX-PDD. The SOIPIX-PDD greatly reduces stray capacitance at the charge sensing node, the dark current of the detector, and capacitive coupling between the sensing node and SOI circuits. These features of the SOIPIX-PDD lead to low read noise, resulting high X-ray energy resolution and stable operation of the pixel. The back-gate surface pinning structure using neutralized p-well at the back-gate surface and depleted n-well underneath the p-well for all the pixel area other than the charge sensing node is also essential for preventing hole injection from the p-well by making the potential barrier to hole, reducing dark current from the Si-SiO2 interface and creating lateral drift field to gather signal electrons in the pixel area into the small charge sensing node. A prototype chip using 0.2 μm SOI technology shows very low readout noise of 11.0 e−rms, low dark current density of 56 pA/cm2 at −35 °C and the energy resolution of 200 eV(FWHM) at 5.9 keV and 280 eV (FWHM) at 13.95 keV. PMID:29295523

A Low-Noise X-ray Astronomical Silicon-On-Insulator Pixel Detector Using a Pinned Depleted Diode Structure.

PubMed

Kamehama, Hiroki; Kawahito, Shoji; Shrestha, Sumeet; Nakanishi, Syunta; Yasutomi, Keita; Takeda, Ayaki; Tsuru, Takeshi Go; Arai, Yasuo

2017-12-23

This paper presents a novel full-depletion Si X-ray detector based on silicon-on-insulator pixel (SOIPIX) technology using a pinned depleted diode structure, named the SOIPIX-PDD. The SOIPIX-PDD greatly reduces stray capacitance at the charge sensing node, the dark current of the detector, and capacitive coupling between the sensing node and SOI circuits. These features of the SOIPIX-PDD lead to low read noise, resulting high X-ray energy resolution and stable operation of the pixel. The back-gate surface pinning structure using neutralized p-well at the back-gate surface and depleted n-well underneath the p-well for all the pixel area other than the charge sensing node is also essential for preventing hole injection from the p-well by making the potential barrier to hole, reducing dark current from the Si-SiO₂ interface and creating lateral drift field to gather signal electrons in the pixel area into the small charge sensing node. A prototype chip using 0.2 μm SOI technology shows very low readout noise of 11.0 e - rms , low dark current density of 56 pA/cm² at -35 °C and the energy resolution of 200 eV(FWHM) at 5.9 keV and 280 eV (FWHM) at 13.95 keV.

An Adaptive Data Gathering Scheme for Multi-Hop Wireless Sensor Networks Based on Compressed Sensing and Network Coding.

PubMed

Yin, Jun; Yang, Yuwang; Wang, Lei

2016-04-01

Joint design of compressed sensing (CS) and network coding (NC) has been demonstrated to provide a new data gathering paradigm for multi-hop wireless sensor networks (WSNs). By exploiting the correlation of the network sensed data, a variety of data gathering schemes based on NC and CS (Compressed Data Gathering--CDG) have been proposed. However, these schemes assume that the sparsity of the network sensed data is constant and the value of the sparsity is known before starting each data gathering epoch, thus they ignore the variation of the data observed by the WSNs which are deployed in practical circumstances. In this paper, we present a complete design of the feedback CDG scheme where the sink node adaptively queries those interested nodes to acquire an appropriate number of measurements. The adaptive measurement-formation procedure and its termination rules are proposed and analyzed in detail. Moreover, in order to minimize the number of overall transmissions in the formation procedure of each measurement, we have developed a NP-complete model (Maximum Leaf Nodes Minimum Steiner Nodes--MLMS) and realized a scalable greedy algorithm to solve the problem. Experimental results show that the proposed measurement-formation method outperforms previous schemes, and experiments on both datasets from ocean temperature and practical network deployment also prove the effectiveness of our proposed feedback CDG scheme.

Interferon-α acutely impairs whole-brain functional connectivity network architecture - A preliminary study.

PubMed

Dipasquale, Ottavia; Cooper, Ella A; Tibble, Jeremy; Voon, Valerie; Baglio, Francesca; Baselli, Giuseppe; Cercignani, Mara; Harrison, Neil A

2016-11-01

Interferon-alpha (IFN-α) is a key mediator of antiviral immune responses used to treat Hepatitis C infection. Though clinically effective, IFN-α rapidly impairs mood, motivation and cognition, effects that can appear indistinguishable from major depression and provide powerful empirical support for the inflammation theory of depression. Though inflammation has been shown to modulate activity within discrete brain regions, how it affects distributed information processing and the architecture of whole brain functional connectivity networks have not previously been investigated. Here we use a graph theoretic analysis of resting state functional magnetic resonance imaging (rfMRI) to investigate acute effects of systemic interferon-alpha (IFN-α) on whole brain functional connectivity architecture and its relationship to IFN-α-induced mood change. Twenty-two patients with Hepatitis-C infection, initiating IFN-α-based therapy were scanned at baseline and 4h after their first IFN-α dose. The whole brain network was parcellated into 110 cortical and sub-cortical nodes based on the Oxford-Harvard Atlas and effects assessed on higher-level graph metrics, including node degree, betweenness centrality, global and local efficiency. IFN-α was associated with a significant reduction in global network connectivity (node degree) (p=0.033) and efficiency (p=0.013), indicating a global reduction of information transfer among the nodes forming the whole brain network. Effects were similar for highly connected (hub) and non-hub nodes, with no effect on betweenness centrality (p>0.1). At a local level, we identified regions with reduced efficiency of information exchange and a sub-network with decreased functional connectivity after IFN-α. Changes in local and particularly global functional connectivity correlated with associated changes in mood measured on the Profile of Mood States (POMS) questionnaire. IFN-α rapidly induced a profound shift in whole brain network structure, impairing global functional connectivity and the efficiency of parallel information exchange. Correlations with multiple indices of mood change support a role for global changes in brain functional connectivity architecture in coordinated behavioral responses to IFN-α. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

A distributed monitoring system for photovoltaic arrays based on a two-level wireless sensor network

NASA Astrophysics Data System (ADS)

Su, F. P.; Chen, Z. C.; Zhou, H. F.; Wu, L. J.; Lin, P. J.; Cheng, S. Y.; Li, Y. F.

2017-11-01

In this paper, a distributed on-line monitoring system based on a two-level wireless sensor network (WSN) is proposed for real time status monitoring of photovoltaic (PV) arrays to support the fine management and maintenance of PV power plants. The system includes the sensing nodes installed on PV modules (PVM), sensing and routing nodes installed on combiner boxes of PV sub-arrays (PVA), a sink node and a data management centre (DMC) running on a host computer. The first level WSN is implemented by the low-cost wireless transceiver nRF24L01, and it is used to achieve single hop communication between the PVM nodes and their corresponding PVA nodes. The second level WSN is realized by the CC2530 based ZigBee network for multi-hop communication among PVA nodes and the sink node. The PVM nodes are used to monitor the PVM working voltage and backplane temperature, and they send the acquired data to their PVA node via the nRF24L01 based first level WSN. The PVA nodes are used to monitor the array voltage, PV string current and environment irradiance, and they send the acquired and received data to the DMC via the ZigBee based second level WSN. The DMC is designed using the MATLAB GUIDE and MySQL database. Laboratory experiment results show that the system can effectively acquire, display, store and manage the operating and environment parameters of PVA in real time.

An Effective Collaborative Mobile Weighted Clustering Schemes for Energy Balancing in Wireless Sensor Networks.

PubMed

Tang, Chengpei; Shokla, Sanesy Kumcr; Modhawar, George; Wang, Qiang

2016-02-19

Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain.

Resting connectivity between salience nodes predicts recognition memory.

PubMed

Andreano, Joseph M; Touroutoglou, Alexandra; Dickerson, Bradford C; Barrett, Lisa F

2017-06-01

The resting connectivity of the brain's salience network, particularly the ventral subsystem of the salience network, has been previously associated with various measures of affective reactivity. Numerous studies have demonstrated that increased affective arousal leads to enhanced consolidation of memory. This suggests that individuals with greater ventral salience network connectivity will exhibit greater responses to affective experience, leading to a greater enhancement of memory by affect. To test this hypothesis, resting ventral salience connectivity was measured in 41 young adults, who were then exposed to neutral and negative affect inductions during a paired associate memory test. Memory performance for material learned under both negative and neutral induction was tested for correlation with resting connectivity between major ventral salience nodes. The results showed a significant interaction between mood induction (negative vs neutral) and connectivity between ventral anterior insula and pregenual anterior cingulate cortex, indicating that salience node connectivity predicted memory for material encoded under negative, but not neutral induction. These findings suggest that the network state of the perceiver, measured prior to affective experience, meaningfully influences the extent to which affect modulates memory. Implications of these findings for individuals with affective disorder, who show alterations in both connectivity and memory, are considered. © The Author (2017). Published by Oxford University Press.

Earthquake Complex Network Analysis Before and After the Mw 8.2 Earthquake in Iquique, Chile

NASA Astrophysics Data System (ADS)

Pasten, D.

2017-12-01

The earthquake complex networks have shown that they are abble to find specific features in seismic data set. In space, this networkshave shown a scale-free behavior for the probability distribution of connectivity, in directed networks and theyhave shown a small-world behavior, for the undirected networks.In this work, we present an earthquake complex network analysis for the large earthquake Mw 8.2 in the north ofChile (near to Iquique) in April, 2014. An earthquake complex network is made dividing the three dimensional space intocubic cells, if one of this cells contain an hypocenter, we name this cell like a node. The connections between nodes aregenerated in time. We follow the time sequence of seismic events and we are making the connections betweennodes. Now, we have two different networks: a directed and an undirected network. Thedirected network takes in consideration the time-direction of the connections, that is very important for the connectivityof the network: we are considering the connectivity, ki of the i-th node, like the number of connections going out ofthe node i plus the self-connections (if two seismic events occurred successive in time in the same cubic cell, we havea self-connection). The undirected network is made removing the direction of the connections and the self-connectionsfrom the directed network. For undirected networks, we are considering only if two nodes are or not connected.We have built a directed complex network and an undirected complex network, before and after the large earthquake in Iquique. We have used magnitudes greater than Mw = 1.0 and Mw = 3.0. We found that this method can recognize the influence of thissmall seismic events in the behavior of the network and we found that the size of the cell used to build the network isanother important factor to recognize the influence of the large earthquake in this complex system. This method alsoshows a difference in the values of the critical exponent γ (for the probability distribution of connectivity in the directednetwork) before and after the large earthquake, but this method does not show a change in the clustering behavior ofthe undirected network, before and after the large earthquake, showing a small-world behavior for the network beforeand after of this large seismic event.

Social network analysis for assessment of avian influenza spread and trading patterns of backyard chickens in Nakhon Pathom, Suphan Buri and Ratchaburi, Thailand.

PubMed

Poolkhet, C; Chairatanayuth, P; Thongratsakul, S; Yatbantoong, N; Kasemsuwan, S; Damchoey, D; Rukkwamsuk, T

2013-09-01

The aim of this study is to explain the social networks of the backyard chicken in Ratchaburi, Suphan Buri and Nakhon Pathom Provinces. In this study, we designed the nodes as groups of persons or places involved in activities relating to backyard chickens. The ties are all activities related to the nodes. The study applied a partial network approach to assess the spreading pattern of avian influenza. From 557 questionnaires collected from the nodes, the researchers found that the degree (the numbers of ties that a node has) and closeness (the distance from one node to the others) centralities of Nakhon Pathom were significantly higher than those of the others (P<0.001). The results show that compared with the remaining areas, this area is more quickly connected to many links. If the avian influenza virus subtype H5N1 was released into the network, the disease would spread throughout this province more rapidly than in Ratchaburi and Suphan Buri. The betweenness centrality in each of these provinces showed no differences (P>0.05). In this study, the nodes that play an important role in all networks are farmers who raise consumable chicken, farmers who raise both consumable chicken and fighting cocks, farmers' households that connect with dominant nodes, and the owners and observers of fighting cocks at arenas and training fields. In this study, we did not find cut points or blocks in the network. Moreover, we detected a random network in all provinces. Thus, connectivity between the nodes covers long or short distances, with less predictable behaviour. Finally, this study suggests that activities between the important nodes must receive special attention for disease control during future disease outbreaks. © 2012 Blackwell Verlag GmbH.

Enhancement of large fluctuations to extinction in adaptive networks

NASA Astrophysics Data System (ADS)

Hindes, Jason; Schwartz, Ira B.; Shaw, Leah B.

2018-01-01

During an epidemic, individual nodes in a network may adapt their connections to reduce the chance of infection. A common form of adaption is avoidance rewiring, where a noninfected node breaks a connection to an infected neighbor and forms a new connection to another noninfected node. Here we explore the effects of such adaptivity on stochastic fluctuations in the susceptible-infected-susceptible model, focusing on the largest fluctuations that result in extinction of infection. Using techniques from large-deviation theory, combined with a measurement of heterogeneity in the susceptible degree distribution at the endemic state, we are able to predict and analyze large fluctuations and extinction in adaptive networks. We find that in the limit of small rewiring there is a sharp exponential reduction in mean extinction times compared to the case of zero adaption. Furthermore, we find an exponential enhancement in the probability of large fluctuations with increased rewiring rate, even when holding the average number of infected nodes constant.

Entropy of spatial network ensembles

NASA Astrophysics Data System (ADS)

Coon, Justin P.; Dettmann, Carl P.; Georgiou, Orestis

2018-04-01

We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly in space and links formed independently between pairs of nodes with probability given by a specified function (the "pair connection function") of their mutual distance. We consider the general case where randomness arises in node positions as well as pairwise connections (i.e., for a given pair distance, the corresponding edge state is a random variable). Classical random geometric graph and exponential graph models can be recovered in certain limits. We derive a simple bound for the entropy of a spatial network ensemble and calculate the conditional entropy of an ensemble given the node location distribution for hard and soft (probabilistic) pair connection functions. Under this formalism, we derive the connection function that yields maximum entropy under general constraints. Finally, we apply our analytical framework to study two practical examples: ad hoc wireless networks and the US flight network. Through the study of these examples, we illustrate that both exhibit properties that are indicative of nearly maximally entropic ensembles.

Prioritizing Urban Habitats for Connectivity Conservation: Integrating Centrality and Ecological Metrics.

PubMed

Poodat, Fatemeh; Arrowsmith, Colin; Fraser, David; Gordon, Ascelin

2015-09-01

Connectivity among fragmented areas of habitat has long been acknowledged as important for the viability of biological conservation, especially within highly modified landscapes. Identifying important habitat patches in ecological connectivity is a priority for many conservation strategies, and the application of 'graph theory' has been shown to provide useful information on connectivity. Despite the large number of metrics for connectivity derived from graph theory, only a small number have been compared in terms of the importance they assign to nodes in a network. This paper presents a study that aims to define a new set of metrics and compares these with traditional graph-based metrics, used in the prioritization of habitat patches for ecological connectivity. The metrics measured consist of "topological" metrics, "ecological metrics," and "integrated metrics," Integrated metrics are a combination of topological and ecological metrics. Eight metrics were applied to the habitat network for the fat-tailed dunnart within Greater Melbourne, Australia. A non-directional network was developed in which nodes were linked to adjacent nodes. These links were then weighted by the effective distance between patches. By applying each of the eight metrics for the study network, nodes were ranked according to their contribution to the overall network connectivity. The structured comparison revealed the similarity and differences in the way the habitat for the fat-tailed dunnart was ranked based on different classes of metrics. Due to the differences in the way the metrics operate, a suitable metric should be chosen that best meets the objectives established by the decision maker.

Throughput Maximization for Sensor-Aided Cognitive Radio Networks with Continuous Energy Arrivals

PubMed Central

Nguyen, Thanh-Tung; Koo, Insoo

2015-01-01

We consider a Sensor-Aided Cognitive Radio Network (SACRN) in which sensors capable of harvesting energy are distributed throughout the network to support secondary transmitters for sensing licensed channels in order to improve both energy and spectral efficiency. Harvesting ambient energy is one of the most promising solutions to mitigate energy deficiency, prolong device lifetime, and partly reduce the battery size of devices. So far, many works related to SACRN have considered single secondary users capable of harvesting energy in whole slot as well as short-term throughput. In the paper, we consider two types of energy harvesting sensor nodes (EHSN): Type-I sensor nodes will harvest ambient energy in whole slot duration, whereas type-II sensor nodes will only harvest energy after carrying out spectrum sensing. In the paper, we also investigate long-term throughput in the scheduling window, and formulate the throughput maximization problem by considering energy-neutral operation conditions of type-I and -II sensors and the target detection probability. Through simulations, it is shown that the sensing energy consumption of all sensor nodes can be efficiently managed with the proposed scheme to achieve optimal long-term throughput in the window. PMID:26633393

Small worlds in space: Synchronization, spatial and relational modularity

NASA Astrophysics Data System (ADS)

Brede, M.

2010-06-01

In this letter we investigate networks that have been optimized to realize a trade-off between enhanced synchronization and cost of wire to connect the nodes in space. Analyzing the evolved arrangement of nodes in space and their corresponding network topology, a class of small-world networks characterized by spatial and network modularity is found. More precisely, for low cost of wire optimal configurations are characterized by a division of nodes into two spatial groups with maximum distance from each other, whereas network modularity is low. For high cost of wire, the nodes organize into several distinct groups in space that correspond to network modules connected on a ring. In between, spatially and relationally modular small-world networks are found.

Communication efficiency and congestion of signal traffic in large-scale brain networks.

PubMed

Mišić, Bratislav; Sporns, Olaf; McIntosh, Anthony R

2014-01-01

The complex connectivity of the cerebral cortex suggests that inter-regional communication is a primary function. Using computational modeling, we show that anatomical connectivity may be a major determinant for global information flow in brain networks. A macaque brain network was implemented as a communication network in which signal units flowed between grey matter nodes along white matter paths. Compared to degree-matched surrogate networks, information flow on the macaque brain network was characterized by higher loss rates, faster transit times and lower throughput, suggesting that neural connectivity may be optimized for speed rather than fidelity. Much of global communication was mediated by a "rich club" of hub regions: a sub-graph comprised of high-degree nodes that are more densely interconnected with each other than predicted by chance. First, macaque communication patterns most closely resembled those observed for a synthetic rich club network, but were less similar to those seen in a synthetic small world network, suggesting that the former is a more fundamental feature of brain network topology. Second, rich club regions attracted the most signal traffic and likewise, connections between rich club regions carried more traffic than connections between non-rich club regions. Third, a number of rich club regions were significantly under-congested, suggesting that macaque connectivity actively shapes information flow, funneling traffic towards some nodes and away from others. Together, our results indicate a critical role of the rich club of hub nodes in dynamic aspects of global brain communication.

Communication Efficiency and Congestion of Signal Traffic in Large-Scale Brain Networks

PubMed Central

Mišić, Bratislav; Sporns, Olaf; McIntosh, Anthony R.

2014-01-01

The complex connectivity of the cerebral cortex suggests that inter-regional communication is a primary function. Using computational modeling, we show that anatomical connectivity may be a major determinant for global information flow in brain networks. A macaque brain network was implemented as a communication network in which signal units flowed between grey matter nodes along white matter paths. Compared to degree-matched surrogate networks, information flow on the macaque brain network was characterized by higher loss rates, faster transit times and lower throughput, suggesting that neural connectivity may be optimized for speed rather than fidelity. Much of global communication was mediated by a “rich club” of hub regions: a sub-graph comprised of high-degree nodes that are more densely interconnected with each other than predicted by chance. First, macaque communication patterns most closely resembled those observed for a synthetic rich club network, but were less similar to those seen in a synthetic small world network, suggesting that the former is a more fundamental feature of brain network topology. Second, rich club regions attracted the most signal traffic and likewise, connections between rich club regions carried more traffic than connections between non-rich club regions. Third, a number of rich club regions were significantly under-congested, suggesting that macaque connectivity actively shapes information flow, funneling traffic towards some nodes and away from others. Together, our results indicate a critical role of the rich club of hub nodes in dynamic aspects of global brain communication. PMID:24415931

Construction of Protograph LDPC Codes with Linear Minimum Distance

NASA Technical Reports Server (NTRS)

Divsalar, Dariush; Dolinar, Sam; Jones, Christopher

2006-01-01

A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very high-degree node in the base protograph. A family of high- to low-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.

Opinion formation on adaptive networks with intensive average degree

NASA Astrophysics Data System (ADS)

Schmittmann, B.; Mukhopadhyay, Abhishek

2010-12-01

We study the evolution of binary opinions on a simple adaptive network of N nodes. At each time step, a randomly selected node updates its state (“opinion”) according to the majority opinion of the nodes that it is linked to; subsequently, all links are reassigned with probability p˜ (q˜) if they connect nodes with equal (opposite) opinions. In contrast to earlier work, we ensure that the average connectivity (“degree”) of each node is independent of the system size (“intensive”), by choosing p˜ and q˜ to be of O(1/N) . Using simulations and analytic arguments, we determine the final steady states and the relaxation into these states for different system sizes. We find two absorbing states, characterized by perfect consensus, and one metastable state, characterized by a population split evenly between the two opinions. The relaxation time of this state grows exponentially with the number of nodes, N . A second metastable state, found in the earlier studies, is no longer observed.

Assembly Mechanism of the Contractile Ring for Cytokinesis by Fission Yeast

NASA Astrophysics Data System (ADS)

Vavylonis, Dimitrios; Wu, Jian-Qiu; Huang, Xiaolei; O'Shaughnessy, Ben; Pollard, Thomas

2008-03-01

Animals and fungi assemble a contractile ring of actin filaments and the motor protein myosin to separate into individual daughter cells during cytokinesis. We studied the mechanism of contractile ring assembly in fission yeast with high time resolution confocal microscopy, computational image analysis methods, and numerical simulations. Approximately 63 nodes containing myosin, broadly distributed around the cell equator, assembled into a ring through stochastic motions, making many starts, stops, and changes of direction as they condense into a ring. Estimates of node friction coefficients from the mean square displacement of stationary nodes imply forces for node movement are greater than ˜ 4 pN, similarly to forces by a few molecular motors. Skeletonization and topology analysis of images of cells expressing fluorescent actin filament markers showed transient linear elements extending in all directions from myosin nodes and establishing connections among them. We propose a model with traction between nodes depending on transient connections established by stochastic search and capture (``search, capture, pull and release''). Numerical simulations of the model using parameter values obtained from experiment succesfully condense nodes into a continuous ring.

Design and Implementation of Secure Area Expansion Scheme for Public Wireless LAN Services

NASA Astrophysics Data System (ADS)

Watanabe, Ryu; Tanaka, Toshiaki

Recently, wireless LAN (WLAN) technology has become a major wireless communication method. The communication bandwidth is increasing and speeds have attained rates exceeding 100 Mbps. Therefore, WLAN technology is regarded as one of the promising communication methods for future networks. In addition, public WLAN connection services can be used in many locations. However, the number of the access points (AP) is insufficient for seamless communication and it cannot be said that users can use the service ubiquitously. An ad-hoc network style connection can be used to expand the coverage area of a public WLAN service. By relaying the user messages among the user nodes, a node can obtain an Internet connection via an AP, even though the node is located outside the AP's direct wireless connection area. Such a coverage area extending technology has many advantages thanks to the feature that no additional infrastructure is required. Therefore, there is a strong demand for this technology as it allows the cost-effective construction of future networks. When a secure ad-hoc routing protocol is used for message exchange in the WLAN service, the message routes are protected from malicious behavior such as route forging and can be maintained appropriately. To do this, however, a new node that wants to join the WLAN service has to obtain information such as the public key certificate and IP address in order to start secure ad-hoc routing. In other words, an initial setup is required for every network node to join the WLAN service properly. Ordinarily, such information should be assigned from the AP. However, new nodes cannot always contact an AP directly. Therefore, there are problems about information delivery in the initial setup of a network node. These problems originate in the multi hop connection based on the ad-hoc routing protocols. In order to realize an expanded area WLAN service, in this paper, the authors propose a secure public key certificate and address provision scheme during the initial setup phase on mobile nodes for the service. The proposed scheme also considers the protection of user privacy. Accordingly, none of the user nodes has to reveal their unique and persistent information to other nodes. Instead of using such information, temporary values are sent by an AP to mobile nodes and used for secure ad-hoc routing operations. Therefore, our proposed scheme prevents tracking by malicious parties by avoiding the use of unique information. Moreover, a test bed was also implemented based on the proposal and an evaluation was carried out in order to confirm performance. In addition, the authors describe a countermeasure against denial of service (DoS) attacks based on the approach to privacy protection described in our proposal.

Network challenges for cyber physical systems with tiny wireless devices: a case study on reliable pipeline condition monitoring.

PubMed

Ali, Salman; Qaisar, Saad Bin; Saeed, Husnain; Khan, Muhammad Farhan; Naeem, Muhammad; Anpalagan, Alagan

2015-03-25

The synergy of computational and physical network components leading to the Internet of Things, Data and Services has been made feasible by the use of Cyber Physical Systems (CPSs). CPS engineering promises to impact system condition monitoring for a diverse range of fields from healthcare, manufacturing, and transportation to aerospace and warfare. CPS for environment monitoring applications completely transforms human-to-human, human-to-machine and machine-to-machine interactions with the use of Internet Cloud. A recent trend is to gain assistance from mergers between virtual networking and physical actuation to reliably perform all conventional and complex sensing and communication tasks. Oil and gas pipeline monitoring provides a novel example of the benefits of CPS, providing a reliable remote monitoring platform to leverage environment, strategic and economic benefits. In this paper, we evaluate the applications and technical requirements for seamlessly integrating CPS with sensor network plane from a reliability perspective and review the strategies for communicating information between remote monitoring sites and the widely deployed sensor nodes. Related challenges and issues in network architecture design and relevant protocols are also provided with classification. This is supported by a case study on implementing reliable monitoring of oil and gas pipeline installations. Network parameters like node-discovery, node-mobility, data security, link connectivity, data aggregation, information knowledge discovery and quality of service provisioning have been reviewed.

Network Challenges for Cyber Physical Systems with Tiny Wireless Devices: A Case Study on Reliable Pipeline Condition Monitoring

PubMed Central

Ali, Salman; Qaisar, Saad Bin; Saeed, Husnain; Farhan Khan, Muhammad; Naeem, Muhammad; Anpalagan, Alagan

2015-01-01

The synergy of computational and physical network components leading to the Internet of Things, Data and Services has been made feasible by the use of Cyber Physical Systems (CPSs). CPS engineering promises to impact system condition monitoring for a diverse range of fields from healthcare, manufacturing, and transportation to aerospace and warfare. CPS for environment monitoring applications completely transforms human-to-human, human-to-machine and machine-to-machine interactions with the use of Internet Cloud. A recent trend is to gain assistance from mergers between virtual networking and physical actuation to reliably perform all conventional and complex sensing and communication tasks. Oil and gas pipeline monitoring provides a novel example of the benefits of CPS, providing a reliable remote monitoring platform to leverage environment, strategic and economic benefits. In this paper, we evaluate the applications and technical requirements for seamlessly integrating CPS with sensor network plane from a reliability perspective and review the strategies for communicating information between remote monitoring sites and the widely deployed sensor nodes. Related challenges and issues in network architecture design and relevant protocols are also provided with classification. This is supported by a case study on implementing reliable monitoring of oil and gas pipeline installations. Network parameters like node-discovery, node-mobility, data security, link connectivity, data aggregation, information knowledge discovery and quality of service provisioning have been reviewed. PMID:25815444

Waggle: A Framework for Intelligent Attentive Sensing and Actuation

NASA Astrophysics Data System (ADS)

Sankaran, R.; Jacob, R. L.; Beckman, P. H.; Catlett, C. E.; Keahey, K.

2014-12-01

Advances in sensor-driven computation and computationally steered sensing will greatly enable future research in fields including environmental and atmospheric sciences. We will present "Waggle," an open-source hardware and software infrastructure developed with two goals: (1) reducing the separation and latency between sensing and computing and (2) improving the reliability and longevity of sensing-actuation platforms in challenging and costly deployments. Inspired by "deep-space probe" systems, the Waggle platform design includes features that can support longitudinal studies, deployments with varying communication links, and remote management capabilities. Waggle lowers the barrier for scientists to incorporate real-time data from their sensors into their computations and to manipulate the sensors or provide feedback through actuators. A standardized software and hardware design allows quick addition of new sensors/actuators and associated software in the nodes and enables them to be coupled with computational codes both insitu and on external compute infrastructure. The Waggle framework currently drives the deployment of two observational systems - a portable and self-sufficient weather platform for study of small-scale effects in Chicago's urban core and an open-ended distributed instrument in Chicago that aims to support several research pursuits across a broad range of disciplines including urban planning, microbiology and computer science. Built around open-source software, hardware, and Linux OS, the Waggle system comprises two components - the Waggle field-node and Waggle cloud-computing infrastructure. Waggle field-node affords a modular, scalable, fault-tolerant, secure, and extensible platform for hosting sensors and actuators in the field. It supports insitu computation and data storage, and integration with cloud-computing infrastructure. The Waggle cloud infrastructure is designed with the goal of scaling to several hundreds of thousands of Waggle nodes. It supports aggregating data from sensors hosted by the nodes, staging computation, relaying feedback to the nodes and serving data to end-users. We will discuss the Waggle design principles and their applicability to various observational research pursuits, and demonstrate its capabilities.

Information transmission on hybrid networks

NASA Astrophysics Data System (ADS)

Chen, Rongbin; Cui, Wei; Pu, Cunlai; Li, Jie; Ji, Bo; Gakis, Konstantinos; Pardalos, Panos M.

2018-01-01

Many real-world communication networks often have hybrid nature with both fixed nodes and moving modes, such as the mobile phone networks mainly composed of fixed base stations and mobile phones. In this paper, we discuss the information transmission process on the hybrid networks with both fixed and mobile nodes. The fixed nodes (base stations) are connected as a spatial lattice on the plane forming the information-carrying backbone, while the mobile nodes (users), which are the sources and destinations of information packets, connect to their current nearest fixed nodes respectively to deliver and receive information packets. We observe the phase transition of traffic load in the hybrid network when the packet generation rate goes from below and then above a critical value, which measures the network capacity of packets delivery. We obtain the optimal speed of moving nodes leading to the maximum network capacity. We further improve the network capacity by rewiring the fixed nodes and by considering the current load of fixed nodes during packets transmission. Our purpose is to optimize the network capacity of hybrid networks from the perspective of network science, and provide some insights for the construction of future communication infrastructures.

Method and apparatus for eliminating unsuccessful tries in a search tree

NASA Technical Reports Server (NTRS)

Peterson, John C. (Inventor); Chow, Edward (Inventor); Madan, Herb S. (Inventor)

1991-01-01

A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, (HSN) connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings (headers) on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.

Connected component analysis of review-SEM images for sub-10nm node process verification

NASA Astrophysics Data System (ADS)

Halder, Sandip; Leray, Philippe; Sah, Kaushik; Cross, Andrew; Parisi, Paolo

2017-03-01

Analysis of hotspots is becoming more and more critical as we scale from node to node. To define true process windows at sub-14 nm technology nodes, often defect inspections are being included to weed out design weak spots (often referred to as hotspots). Defect inspection sub 28 nm nodes is a two pass process. Defect locations identified by optical inspection tools need to be reviewed by review-SEM's to understand exactly which feature is failing in the region flagged by the optical tool. The images grabbed by the review-SEM tool are used for classification but rarely for quantification. The goal of this paper is to see if the thousands of review-SEM images which are existing can be used for quantification and further analysis. More specifically we address the SEM quantification problem with connected component analysis.

Correctness Proof of a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2011-01-01

This report presents a deductive proof of a self-stabilizing distributed clock synchronization protocol. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. We present a deductive proof of the correctness of the protocol as it applies to the networks with unidirectional and bidirectional links. We also confirm the claims of determinism and linear convergence.

Hidden Connectivity in Networks with Vulnerable Classes of Nodes

NASA Astrophysics Data System (ADS)

Krause, Sebastian M.; Danziger, Michael M.; Zlatić, Vinko

2016-10-01

In many complex systems representable as networks, nodes can be separated into different classes. Often these classes can be linked to a mutually shared vulnerability. Shared vulnerabilities may be due to a shared eavesdropper or correlated failures. In this paper, we show the impact of shared vulnerabilities on robust connectivity and how the heterogeneity of node classes can be exploited to maintain functionality by utilizing multiple paths. Percolation is the field of statistical physics that is generally used to analyze connectivity in complex networks, but in its existing forms, it cannot treat the heterogeneity of multiple vulnerable classes. To analyze the connectivity under these constraints, we describe each class as a color and develop a "color-avoiding" percolation. We present an analytic theory for random networks and a numerical algorithm for all networks, with which we can determine which nodes are color-avoiding connected and whether the maximal set percolates in the system. We find that the interaction of topology and color distribution implies a rich critical behavior, with critical values and critical exponents depending both on the topology and on the color distribution. Applying our physics-based theory to the Internet, we show how color-avoiding percolation can be used as the basis for new topologically aware secure communication protocols. Beyond applications to cybersecurity, our framework reveals a new layer of hidden structure in a wide range of natural and technological systems.

A Digital Compressed Sensing-Based Energy-Efficient Single-Spot Bluetooth ECG Node

PubMed Central

Cai, Zhipeng; Zou, Fumin; Zhang, Xiangyu

2018-01-01

Energy efficiency is still the obstacle for long-term real-time wireless ECG monitoring. In this paper, a digital compressed sensing- (CS-) based single-spot Bluetooth ECG node is proposed to deal with the challenge in wireless ECG application. A periodic sleep/wake-up scheme and a CS-based compression algorithm are implemented in a node, which consists of ultra-low-power analog front-end, microcontroller, Bluetooth 4.0 communication module, and so forth. The efficiency improvement and the node's specifics are evidenced by the experiments using the ECG signals sampled by the proposed node under daily activities of lay, sit, stand, walk, and run. Under using sparse binary matrix (SBM), block sparse Bayesian learning (BSBL) method, and discrete cosine transform (DCT) basis, all ECG signals were essentially undistorted recovered with root-mean-square differences (PRDs) which are less than 6%. The proposed sleep/wake-up scheme and data compression can reduce the airtime over energy-hungry wireless links, the energy consumption of proposed node is 6.53 mJ, and the energy consumption of radio decreases 77.37%. Moreover, the energy consumption increase caused by CS code execution is negligible, which is 1.3% of the total energy consumption. PMID:29599945

A Digital Compressed Sensing-Based Energy-Efficient Single-Spot Bluetooth ECG Node.

PubMed

Luo, Kan; Cai, Zhipeng; Du, Keqin; Zou, Fumin; Zhang, Xiangyu; Li, Jianqing

2018-01-01

Energy efficiency is still the obstacle for long-term real-time wireless ECG monitoring. In this paper, a digital compressed sensing- (CS-) based single-spot Bluetooth ECG node is proposed to deal with the challenge in wireless ECG application. A periodic sleep/wake-up scheme and a CS-based compression algorithm are implemented in a node, which consists of ultra-low-power analog front-end, microcontroller, Bluetooth 4.0 communication module, and so forth. The efficiency improvement and the node's specifics are evidenced by the experiments using the ECG signals sampled by the proposed node under daily activities of lay, sit, stand, walk, and run. Under using sparse binary matrix (SBM), block sparse Bayesian learning (BSBL) method, and discrete cosine transform (DCT) basis, all ECG signals were essentially undistorted recovered with root-mean-square differences (PRDs) which are less than 6%. The proposed sleep/wake-up scheme and data compression can reduce the airtime over energy-hungry wireless links, the energy consumption of proposed node is 6.53 mJ, and the energy consumption of radio decreases 77.37%. Moreover, the energy consumption increase caused by CS code execution is negligible, which is 1.3% of the total energy consumption.

Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

NASA Astrophysics Data System (ADS)

Bellingeri, Michele; Lu, Zhe-Ming; Cassi, Davide; Scotognella, Francesco

2018-02-01

Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.

PubMed

Uwitonze, Alfred; Huang, Jiaqing; Ye, Yuanqing; Cheng, Wenqing

2017-04-20

The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomial time heuristic algorithm, namely, Relay Placement using Space Network Coding (RPSNC), to solve this problem, where Space Network Coding, also called Space Information Flow (SIF), is a new research paradigm that studies network coding in Euclidean space, in which extra relay nodes can be introduced to reduce the cost of communication. Unlike contemporary schemes that are often based on Minimum Spanning Tree (MST), Euclidean Steiner Minimal Tree (ESMT) or a combination of MST with ESMT, RPSNC is a new min-cost multicast space network coding approach that combines Delaunay triangulation and non-uniform partitioning techniques for generating a number of candidate relay nodes, and then linear programming is applied for choosing the optimal relay nodes and computing their connection links with terminals. Subsequently, an equilibrium method is used to refine the locations of the optimal relay nodes, by moving them to balanced positions. RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals. The performance and complexity of RPSNC are analyzed and its performance is validated through simulation experiments.

An Effective Collaborative Mobile Weighted Clustering Schemes for Energy Balancing in Wireless Sensor Networks

PubMed Central

Tang, Chengpei; Shokla, Sanesy Kumcr; Modhawar, George; Wang, Qiang

2016-01-01

Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain. PMID:26907285

Understanding network concepts in modules

PubMed Central

2007-01-01

Background Network concepts are increasingly used in biology and genetics. For example, the clustering coefficient has been used to understand network architecture; the connectivity (also known as degree) has been used to screen for cancer targets; and the topological overlap matrix has been used to define modules and to annotate genes. Dozens of potentially useful network concepts are known from graph theory. Results Here we study network concepts in special types of networks, which we refer to as approximately factorizable networks. In these networks, the pairwise connection strength (adjacency) between 2 network nodes can be factored into node specific contributions, named node 'conformity'. The node conformity turns out to be highly related to the connectivity. To provide a formalism for relating network concepts to each other, we define three types of network concepts: fundamental-, conformity-based-, and approximate conformity-based concepts. Fundamental concepts include the standard definitions of connectivity, density, centralization, heterogeneity, clustering coefficient, and topological overlap. The approximate conformity-based analogs of fundamental network concepts have several theoretical advantages. First, they allow one to derive simple relationships between seemingly disparate networks concepts. For example, we derive simple relationships between the clustering coefficient, the heterogeneity, the density, the centralization, and the topological overlap. The second advantage of approximate conformity-based network concepts is that they allow one to show that fundamental network concepts can be approximated by simple functions of the connectivity in module networks. Conclusion Using protein-protein interaction, gene co-expression, and simulated data, we show that a) many networks comprised of module nodes are approximately factorizable and b) in these types of networks, simple relationships exist between seemingly disparate network concepts. Our results are implemented in freely available R software code, which can be downloaded from the following webpage: http://www.genetics.ucla.edu/labs/horvath/ModuleConformity/ModuleNetworks PMID:17547772

Contextual Hub Analysis Tool (CHAT): A Cytoscape app for identifying contextually relevant hubs in biological networks.

PubMed

Muetze, Tanja; Goenawan, Ivan H; Wiencko, Heather L; Bernal-Llinares, Manuel; Bryan, Kenneth; Lynn, David J

2016-01-01

Highly connected nodes (hubs) in biological networks are topologically important to the structure of the network and have also been shown to be preferentially associated with a range of phenotypes of interest. The relative importance of a hub node, however, can change depending on the biological context. Here, we report a Cytoscape app, the Contextual Hub Analysis Tool (CHAT), which enables users to easily construct and visualize a network of interactions from a gene or protein list of interest, integrate contextual information, such as gene expression or mass spectrometry data, and identify hub nodes that are more highly connected to contextual nodes (e.g. genes or proteins that are differentially expressed) than expected by chance. In a case study, we use CHAT to construct a network of genes that are differentially expressed in Dengue fever, a viral infection. CHAT was used to identify and compare contextual and degree-based hubs in this network. The top 20 degree-based hubs were enriched in pathways related to the cell cycle and cancer, which is likely due to the fact that proteins involved in these processes tend to be highly connected in general. In comparison, the top 20 contextual hubs were enriched in pathways commonly observed in a viral infection including pathways related to the immune response to viral infection. This analysis shows that such contextual hubs are considerably more biologically relevant than degree-based hubs and that analyses which rely on the identification of hubs solely based on their connectivity may be biased towards nodes that are highly connected in general rather than in the specific context of interest. CHAT is available for Cytoscape 3.0+ and can be installed via the Cytoscape App Store ( http://apps.cytoscape.org/apps/chat).

Modulation aware cluster size optimisation in wireless sensor networks

NASA Astrophysics Data System (ADS)

Sriram Naik, M.; Kumar, Vinay

2017-07-01

Wireless sensor networks (WSNs) play a great role because of their numerous advantages to the mankind. The main challenge with WSNs is the energy efficiency. In this paper, we have focused on the energy minimisation with the help of cluster size optimisation along with consideration of modulation effect when the nodes are not able to communicate using baseband communication technique. Cluster size optimisations is important technique to improve the performance of WSNs. It provides improvement in energy efficiency, network scalability, network lifetime and latency. We have proposed analytical expression for cluster size optimisation using traditional sensing model of nodes for square sensing field with consideration of modulation effects. Energy minimisation can be achieved by changing the modulation schemes such as BPSK, 16-QAM, QPSK, 64-QAM, etc., so we are considering the effect of different modulation techniques in the cluster formation. The nodes in the sensing fields are random and uniformly deployed. It is also observed that placement of base station at centre of scenario enables very less number of modulation schemes to work in energy efficient manner but when base station placed at the corner of the sensing field, it enable large number of modulation schemes to work in energy efficient manner.

Pinning impulsive control algorithms for complex network

NASA Astrophysics Data System (ADS)

Sun, Wen; Lü, Jinhu; Chen, Shihua; Yu, Xinghuo

2014-03-01

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

Mapping higher-order relations between brain structure and function with embedded vector representations of connectomes.

PubMed

Rosenthal, Gideon; Váša, František; Griffa, Alessandra; Hagmann, Patric; Amico, Enrico; Goñi, Joaquín; Avidan, Galia; Sporns, Olaf

2018-06-05

Connectomics generates comprehensive maps of brain networks, represented as nodes and their pairwise connections. The functional roles of nodes are defined by their direct and indirect connectivity with the rest of the network. However, the network context is not directly accessible at the level of individual nodes. Similar problems in language processing have been addressed with algorithms such as word2vec that create embeddings of words and their relations in a meaningful low-dimensional vector space. Here we apply this approach to create embedded vector representations of brain networks or connectome embeddings (CE). CE can characterize correspondence relations among brain regions, and can be used to infer links that are lacking from the original structural diffusion imaging, e.g., inter-hemispheric homotopic connections. Moreover, we construct predictive deep models of functional and structural connectivity, and simulate network-wide lesion effects using the face processing system as our application domain. We suggest that CE offers a novel approach to revealing relations between connectome structure and function.

A Novel Wireless Power Transfer-Based Weighed Clustering Cooperative Spectrum Sensing Method for Cognitive Sensor Networks.

PubMed

Liu, Xin

2015-10-30

In a cognitive sensor network (CSN), the wastage of sensing time and energy is a challenge to cooperative spectrum sensing, when the number of cooperative cognitive nodes (CNs) becomes very large. In this paper, a novel wireless power transfer (WPT)-based weighed clustering cooperative spectrum sensing model is proposed, which divides all the CNs into several clusters, and then selects the most favorable CNs as the cluster heads and allows the common CNs to transfer the received radio frequency (RF) energy of the primary node (PN) to the cluster heads, in order to supply the electrical energy needed for sensing and cooperation. A joint resource optimization is formulated to maximize the spectrum access probability of the CSN, through jointly allocating sensing time and clustering number. According to the resource optimization results, a clustering algorithm is proposed. The simulation results have shown that compared to the traditional model, the cluster heads of the proposed model can achieve more transmission power and there exists optimal sensing time and clustering number to maximize the spectrum access probability.

Distributed cluster management techniques for unattended ground sensor networks

NASA Astrophysics Data System (ADS)

Essawy, Magdi A.; Stelzig, Chad A.; Bevington, James E.; Minor, Sharon

2005-05-01

Smart Sensor Networks are becoming important target detection and tracking tools. The challenging problems in such networks include the sensor fusion, data management and communication schemes. This work discusses techniques used to distribute sensor management and multi-target tracking responsibilities across an ad hoc, self-healing cluster of sensor nodes. Although miniaturized computing resources possess the ability to host complex tracking and data fusion algorithms, there still exist inherent bandwidth constraints on the RF channel. Therefore, special attention is placed on the reduction of node-to-node communications within the cluster by minimizing unsolicited messaging, and distributing the sensor fusion and tracking tasks onto local portions of the network. Several challenging problems are addressed in this work including track initialization and conflict resolution, track ownership handling, and communication control optimization. Emphasis is also placed on increasing the overall robustness of the sensor cluster through independent decision capabilities on all sensor nodes. Track initiation is performed using collaborative sensing within a neighborhood of sensor nodes, allowing each node to independently determine if initial track ownership should be assumed. This autonomous track initiation prevents the formation of duplicate tracks while eliminating the need for a central "management" node to assign tracking responsibilities. Track update is performed as an ownership node requests sensor reports from neighboring nodes based on track error covariance and the neighboring nodes geo-positional location. Track ownership is periodically recomputed using propagated track states to determine which sensing node provides the desired coverage characteristics. High fidelity multi-target simulation results are presented, indicating the distribution of sensor management and tracking capabilities to not only reduce communication bandwidth consumption, but to also simplify multi-target tracking within the cluster.

Disintegration of Sensorimotor Brain Networks in Schizophrenia.

PubMed

Kaufmann, Tobias; Skåtun, Kristina C; Alnæs, Dag; Doan, Nhat Trung; Duff, Eugene P; Tønnesen, Siren; Roussos, Evangelos; Ueland, Torill; Aminoff, Sofie R; Lagerberg, Trine V; Agartz, Ingrid; Melle, Ingrid S; Smith, Stephen M; Andreassen, Ole A; Westlye, Lars T

2015-11-01

Schizophrenia is a severe mental disorder associated with derogated function across various domains, including perception, language, motor, emotional, and social behavior. Due to its complex symptomatology, schizophrenia is often regarded a disorder of cognitive processes. Yet due to the frequent involvement of sensory and perceptual symptoms, it has been hypothesized that functional disintegration between sensory and cognitive processes mediates the heterogeneous and comprehensive schizophrenia symptomatology. Here, using resting-state functional magnetic resonance imaging in 71 patients and 196 healthy controls, we characterized the standard deviation in BOLD (blood-oxygen-level-dependent) signal amplitude and the functional connectivity across a range of functional brain networks. We investigated connectivity on the edge and node level using network modeling based on independent component analysis and utilized the brain network features in cross-validated classification procedures. Both amplitude and connectivity were significantly altered in patients, largely involving sensory networks. Reduced standard deviation in amplitude was observed in a range of visual, sensorimotor, and auditory nodes in patients. The strongest differences in connectivity implicated within-sensorimotor and sensorimotor-thalamic connections. Furthermore, sensory nodes displayed widespread alterations in the connectivity with higher-order nodes. We demonstrated robustness of effects across subjects by significantly classifying diagnostic group on the individual level based on cross-validated multivariate connectivity features. Taken together, the findings support the hypothesis of disintegrated sensory and cognitive processes in schizophrenia, and the foci of effects emphasize that targeting the sensory and perceptual domains may be key to enhance our understanding of schizophrenia pathophysiology. © The Author 2015. Published by Oxford University Press on behalf of the Maryland Psychiatric Research Center. All rights reserved. For permissions, please email: journals.permissions@oup.com.

Complex Network Analysis of CA3 Transcriptome Reveals Pathogenic and Compensatory Pathways in Refractory Temporal Lobe Epilepsy

PubMed Central

Bando, Silvia Yumi; Silva, Filipi Nascimento; Costa, Luciano da Fontoura; Silva, Alexandre V.; Pimentel-Silva, Luciana R.; Castro, Luiz HM.; Wen, Hung-Tzu; Amaro, Edson; Moreira-Filho, Carlos Alberto

2013-01-01

We previously described – studying transcriptional signatures of hippocampal CA3 explants – that febrile (FS) and afebrile (NFS) forms of refractory mesial temporal lobe epilepsy constitute two distinct genomic phenotypes. That network analysis was based on a limited number (hundreds) of differentially expressed genes (DE networks) among a large set of valid transcripts (close to two tens of thousands). Here we developed a methodology for complex network visualization (3D) and analysis that allows the categorization of network nodes according to distinct hierarchical levels of gene-gene connections (node degree) and of interconnection between node neighbors (concentric node degree). Hubs are highly connected nodes, VIPs have low node degree but connect only with hubs, and high-hubs have VIP status and high overall number of connections. Studying the whole set of CA3 valid transcripts we: i) obtained complete transcriptional networks (CO) for FS and NFS phenotypic groups; ii) examined how CO and DE networks are related; iii) characterized genomic and molecular mechanisms underlying FS and NFS phenotypes, identifying potential novel targets for therapeutic interventions. We found that: i) DE hubs and VIPs are evenly distributed inside the CO networks; ii) most DE hubs and VIPs are related to synaptic transmission and neuronal excitability whereas most CO hubs, VIPs and high hubs are related to neuronal differentiation, homeostasis and neuroprotection, indicating compensatory mechanisms. Complex network visualization and analysis is a useful tool for systems biology approaches to multifactorial diseases. Network centrality observed for hubs, VIPs and high hubs of CO networks, is consistent with the network disease model, where a group of nodes whose perturbation leads to a disease phenotype occupies a central position in the network. Conceivably, the chance for exerting therapeutic effects through the modulation of particular genes will be higher if these genes are highly interconnected in transcriptional networks. PMID:24278214

Parameters affecting the resilience of scale-free networks to random failures.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran

2005-09-01

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degreemore » of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.« less

Reconfiguration in Robust Distributed Real-Time Systems Based on Global Checkpoints

DTIC Science & Technology

1991-12-01

achieved by utilizing distributed systems in which a single application program executes on multiple processors, connected to a network. The distributed...single application program executes on multiple proces- sors, connected to a network. The distributed nature of such systems make it possible to ...resident at every node. How - ever, the responsibility for execution of a particular function is assigned to only one node in this framework. This function

ORA User’s Guide 2013

DTIC Science & Technology

2013-06-03

and a C++ computational backend . The most current version of ORA (3.0.8.5) software is available on the casos website: http://casos.cs.cmu.edu...optimizing a network’s design structure. ORA uses a Java interface for ease of use, and a C++ computational backend . The most current version of ORA...Eigenvector Centrality : Node most connected to other highly connected nodes. Assists in identifying those who can mobilize others Entity Class

Viewing socio-affective stimuli increases connectivity within an extended default mode network.

PubMed

Göttlich, Martin; Ye, Zheng; Rodriguez-Fornells, Antoni; Münte, Thomas F; Krämer, Ulrike M

2017-03-01

Empathy is an essential ability for prosocial behavior. Previous imaging studies identified a number of brain regions implicated in affective and cognitive aspects of empathy. In this study, we investigated the neural correlates of empathy from a network perspective using graph theory and beta-series correlations. Two independent data sets were acquired using the same paradigm that elicited empathic responses to socio-affective stimuli. One data set was used to define the network nodes and modular structure, the other data set was used to investigate the effects of emotional versus neutral stimuli on network connectivity. Emotional relative to neutral stimuli increased connectivity between 74 nodes belonging to different networks. Most of these nodes belonged to an extended default mode network (eDMN). The other nodes belonged to a cognitive control network or visual networks. Within the eDMN, posterior STG/TPJ regions were identified as provincial hubs. The eDMN also showed stronger connectivity to the cognitive control network encompassing lateral PFC regions. Connector hubs between the two networks were posterior cingulate cortex and ventrolateral PFC. This stresses the advantage of a network approach as regions similarly modulated by task conditions can be dissociated into distinct networks and regions crucial for network integration can be identified. Copyright © 2017 Elsevier Inc. All rights reserved.

Broadcasting a message in a parallel computer

DOEpatents

Archer, Charles J; Faraj, Ahmad A

2013-04-16

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

Broadcasting a message in a parallel computer

DOE Office of Scientific and Technical Information (OSTI.GOV)

None

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the childmore » nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.« less

Method and Circuit for Injecting a Precise Amount of Charge onto a Circuit Node

NASA Technical Reports Server (NTRS)

Hancock, Bruce R. (Inventor)

2016-01-01

A method and circuit for injecting charge into a circuit node, comprising (a) resetting a capacitor's voltage through a first transistor; (b) after the resetting, pre-charging the capacitor through the first transistor; and (c) after the pre-charging, further charging the capacitor through a second transistor, wherein the second transistor is connected between the capacitor and a circuit node, and the further charging draws charge through the second transistor from the circuit node, thereby injecting charge into the circuit node.

Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes

NASA Astrophysics Data System (ADS)

Yang, Hui; Tang, Ming; Gross, Thilo

2015-08-01

One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.

Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes.

PubMed

Yang, Hui; Tang, Ming; Gross, Thilo

2015-08-21

One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.

Highly designable phenotypes and mutational buffers emerge from a systematic mapping between network topology and dynamic output.

PubMed

Nochomovitz, Yigal D; Li, Hao

2006-03-14

Deciphering the design principles for regulatory networks is fundamental to an understanding of biological systems. We have explored the mapping from the space of network topologies to the space of dynamical phenotypes for small networks. Using exhaustive enumeration of a simple model of three- and four-node networks, we demonstrate that certain dynamical phenotypes can be generated by an atypically broad spectrum of network topologies. Such dynamical outputs are highly designable, much like certain protein structures can be designed by an unusually broad spectrum of sequences. The network topologies that encode a highly designable dynamical phenotype possess two classes of connections: a fully conserved core of dedicated connections that encodes the stable dynamical phenotype and a partially conserved set of variable connections that controls the transient dynamical flow. By comparing the topologies and dynamics of the three- and four-node network ensembles, we observe a large number of instances of the phenomenon of "mutational buffering," whereby addition of a fourth node suppresses phenotypic variation amongst a set of three-node networks.

Network theory may explain the vulnerability of medieval human settlements to the Black Death pandemic.

PubMed

Gómez, José M; Verdú, Miguel

2017-03-06

Epidemics can spread across large regions becoming pandemics by flowing along transportation and social networks. Two network attributes, transitivity (when a node is connected to two other nodes that are also directly connected between them) and centrality (the number and intensity of connections with the other nodes in the network), are widely associated with the dynamics of transmission of pathogens. Here we investigate how network centrality and transitivity influence vulnerability to diseases of human populations by examining one of the most devastating pandemic in human history, the fourteenth century plague pandemic called Black Death. We found that, after controlling for the city spatial location and the disease arrival time, cities with higher values of both centrality and transitivity were more severely affected by the plague. A simulation study indicates that this association was due to central cities with high transitivity undergo more exogenous re-infections. Our study provides an easy method to identify hotspots in epidemic networks. Focusing our effort in those vulnerable nodes may save time and resources by improving our ability of controlling deadly epidemics.

Dynamical Response of Networks Under External Perturbations: Exact Results

NASA Astrophysics Data System (ADS)

Chinellato, David D.; Epstein, Irving R.; Braha, Dan; Bar-Yam, Yaneer; de Aguiar, Marcus A. M.

2015-04-01

We give exact statistical distributions for the dynamic response of influence networks subjected to external perturbations. We consider networks whose nodes have two internal states labeled 0 and 1. We let nodes be frozen in state 0, in state 1, and the remaining nodes change by adopting the state of a connected node with a fixed probability per time step. The frozen nodes can be interpreted as external perturbations to the subnetwork of free nodes. Analytically extending and to be smaller than 1 enables modeling the case of weak coupling. We solve the dynamical equations exactly for fully connected networks, obtaining the equilibrium distribution, transition probabilities between any two states and the characteristic time to equilibration. Our exact results are excellent approximations for other topologies, including random, regular lattice, scale-free and small world networks, when the numbers of fixed nodes are adjusted to take account of the effect of topology on coupling to the environment. This model can describe a variety of complex systems, from magnetic spins to social networks to population genetics, and was recently applied as a framework for early warning signals for real-world self-organized economic market crises.

Infectious disease control using contact tracing in random and scale-free networks

PubMed Central

Kiss, Istvan Z; Green, Darren M; Kao, Rowland R

2005-01-01

Contact tracing aims to identify and isolate individuals that have been in contact with infectious individuals. The efficacy of contact tracing and the hierarchy of traced nodes—nodes with higher degree traced first—is investigated and compared on random and scale-free (SF) networks with the same number of nodes N and average connection K. For values of the transmission rate larger than a threshold, the final epidemic size on SF networks is smaller than that on corresponding random networks. While in random networks new infectious and traced nodes from all classes have similar average degrees, in SF networks the average degree of nodes that are in more advanced stages of the disease is higher at any given time. On SF networks tracing removes possible sources of infection with high average degree. However a higher tracing effort is required to control the epidemic than on corresponding random networks due to the high initial velocity of spread towards the highly connected nodes. An increased latency period fails to significantly improve contact tracing efficacy. Contact tracing has a limited effect if the removal rate of susceptible nodes is relatively high, due to the fast local depletion of susceptible nodes. PMID:16849217

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks.

PubMed

Sendiña-Nadal, I; Danziger, M M; Wang, Z; Havlin, S; Boccaletti, S

2016-02-18

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph's hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks

NASA Astrophysics Data System (ADS)

Sendiña-Nadal, I.; Danziger, M. M.; Wang, Z.; Havlin, S.; Boccaletti, S.

2016-02-01

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph’s hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Scaling of Average Weighted Receiving Time on Double-Weighted Koch Networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Ye, Dandan; Hou, Jie; Li, Xingyi

2015-03-01

In this paper, we introduce a model of the double-weighted Koch networks based on actual road networks depending on the two weight factors w,r ∈ (0, 1]. The double weights represent the capacity-flowing weight and the cost-traveling weight, respectively. Denote by wFij the capacity-flowing weight connecting the nodes i and j, and denote by wCij the cost-traveling weight connecting the nodes i and j. Let wFij be related to the weight factor w, and let wCij be related to the weight factor r. This paper assumes that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. We define the average weighted receiving time (AWRT) on the double-weighted Koch networks. The obtained result displays that in the large network, the AWRT grows as power-law function of the network order with the exponent, represented by θ(w,r) = ½ log2(1 + 3wr). We show that the AWRT exhibits a sublinear or linear dependence on network order. Thus, the double-weighted Koch networks are more efficient than classic Koch networks in receiving information.

Stability of a giant connected component in a complex network

NASA Astrophysics Data System (ADS)

Kitsak, Maksim; Ganin, Alexander A.; Eisenberg, Daniel A.; Krapivsky, Pavel L.; Krioukov, Dmitri; Alderson, David L.; Linkov, Igor

2018-01-01

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.

A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning.

PubMed

Mabu, Shingo; Hirasawa, Kotaro; Hu, Jinglu

2007-01-01

This paper proposes a graph-based evolutionary algorithm called Genetic Network Programming (GNP). Our goal is to develop GNP, which can deal with dynamic environments efficiently and effectively, based on the distinguished expression ability of the graph (network) structure. The characteristics of GNP are as follows. 1) GNP programs are composed of a number of nodes which execute simple judgment/processing, and these nodes are connected by directed links to each other. 2) The graph structure enables GNP to re-use nodes, thus the structure can be very compact. 3) The node transition of GNP is executed according to its node connections without any terminal nodes, thus the past history of the node transition affects the current node to be used and this characteristic works as an implicit memory function. These structural characteristics are useful for dealing with dynamic environments. Furthermore, we propose an extended algorithm, "GNP with Reinforcement Learning (GNPRL)" which combines evolution and reinforcement learning in order to create effective graph structures and obtain better results in dynamic environments. In this paper, we applied GNP to the problem of determining agents' behavior to evaluate its effectiveness. Tileworld was used as the simulation environment. The results show some advantages for GNP over conventional methods.

Automatic Multi-sensor Data Quality Checking and Event Detection for Environmental Sensing

NASA Astrophysics Data System (ADS)

LIU, Q.; Zhang, Y.; Zhao, Y.; Gao, D.; Gallaher, D. W.; Lv, Q.; Shang, L.

2017-12-01

With the advances in sensing technologies, large-scale environmental sensing infrastructures are pervasively deployed to continuously collect data for various research and application fields, such as air quality study and weather condition monitoring. In such infrastructures, many sensor nodes are distributed in a specific area and each individual sensor node is capable of measuring several parameters (e.g., humidity, temperature, and pressure), providing massive data for natural event detection and analysis. However, due to the dynamics of the ambient environment, sensor data can be contaminated by errors or noise. Thus, data quality is still a primary concern for scientists before drawing any reliable scientific conclusions. To help researchers identify potential data quality issues and detect meaningful natural events, this work proposes a novel algorithm to automatically identify and rank anomalous time windows from multiple sensor data streams. More specifically, (1) the algorithm adaptively learns the characteristics of normal evolving time series and (2) models the spatial-temporal relationship among multiple sensor nodes to infer the anomaly likelihood of a time series window for a particular parameter in a sensor node. Case studies using different data sets are presented and the experimental results demonstrate that the proposed algorithm can effectively identify anomalous time windows, which may resulted from data quality issues and natural events.

The Node Acquisition and Integration Technique: A Node-Link Based Teaching/Learning Strategy.

ERIC Educational Resources Information Center

Diekhoff, George M.

This paper presents the results of three experiments conducted in connection with development of a node-link based teaching/learning strategy. In experiment 1, subjects were instructed to either define concepts selected from a unit of introductory psychology or to describe the relationships existing between pairs of concepts. The cognitive…

Use of Networked Collaborative Concept Mapping To Measure Team Processes and Team Outcomes.

ERIC Educational Resources Information Center

Chung, Gregory K. W. K.; O'Neil, Harold F., Jr.; Herl, Howard E.; Dennis, Robert A.

The feasibility of using a computer-based networked collaborative concept mapping system to measure teamwork skills was studied. A concept map is a node-link-node representation of content, where the nodes represent concepts and links represent relationships between connected concepts. Teamwork processes were examined for a group concept mapping…

Eradicating catastrophic collapse in interdependent networks via reinforced nodes

PubMed Central

Yuan, Xin; Hu, Yanqing; Havlin, Shlomo

2017-01-01

In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources, together with their connected neighbors can still be functioning after disconnected from the giant component. Here, we propose and study a generalized percolation model that introduces a fraction of reinforced nodes in the interdependent networks that can function and support their neighborhood. We analyze, both analytically and via simulations, the order parameter—the functioning component—comprising both the giant component and smaller components that include at least one reinforced node. Remarkably, it is found that, for interdependent networks, we need to reinforce only a small fraction of nodes to prevent abrupt catastrophic collapses. Moreover, we find that the universal upper bound of this fraction is 0.1756 for two interdependent Erdős–Rényi (ER) networks: regular random (RR) networks and scale-free (SF) networks with large average degrees. We also generalize our theory to interdependent networks of networks (NONs). These findings might yield insight for designing resilient interdependent infrastructure networks. PMID:28289204

Community detection using preference networks

NASA Astrophysics Data System (ADS)

Tasgin, Mursel; Bingol, Haluk O.

2018-04-01

Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses in identifying similar functions or roles of nodes in many biological, social and computer networks. With the availability of very large networks in recent years, performance and scalability of community detection algorithms become crucial, i.e. if time complexity of an algorithm is high, it cannot run on large networks. In this paper, we propose a new community detection algorithm, which has a local approach and is able to run on large networks. It has a simple and effective method; given a network, algorithm constructs a preference network of nodes where each node has a single outgoing edge showing its preferred node to be in the same community with. In such a preference network, each connected component is a community. Selection of the preferred node is performed using similarity based metrics of nodes. We use two alternatives for this purpose which can be calculated in 1-neighborhood of nodes, i.e. number of common neighbors of selector node and its neighbors and, the spread capability of neighbors around the selector node which is calculated by the gossip algorithm of Lind et.al. Our algorithm is tested on both computer generated LFR networks and real-life networks with ground-truth community structure. It can identify communities accurately in a fast way. It is local, scalable and suitable for distributed execution on large networks.

Analysis and Tools for Improved Management of Connectionless and Connection-Oriented BLE Devices Coexistence

PubMed Central

Del Campo, Antonio; Cintioni, Lorenzo; Spinsante, Susanna; Gambi, Ennio

2017-01-01

With the introduction of low-power wireless technologies, like Bluetooth Low Energy (BLE), new applications are approaching the home automation, healthcare, fitness, automotive and consumer electronics markets. BLE devices are designed to maximize the battery life, i.e., to run for long time on a single coin-cell battery. In typical application scenarios of home automation and Ambient Assisted Living (AAL), the sensors that monitor relatively unpredictable and rare events should coexist with other sensors that continuously communicate health or environmental parameter measurements. The former usually work in connectionless mode, acting as advertisers, while the latter need a persistent connection, acting as slave nodes. The coexistence of connectionless and connection-oriented networks, that share the same central node, can be required to reduce the number of handling devices, thus keeping the network complexity low and limiting the packet’s traffic congestion. In this paper, the medium access management, operated by the central node, has been modeled, focusing on the scheduling procedure in both connectionless and connection-oriented communication. The models have been merged to provide a tool supporting the configuration design of BLE devices, during the network design phase that precedes the real implementation. The results highlight the suitability of the proposed tool: the ability to set the device parameters to allow us to keep a practical discovery latency for event-driven sensors and avoid undesired overlaps between scheduled scanning and connection phases due to bad management performed by the central node. PMID:28387724

Analysis and Tools for Improved Management of Connectionless and Connection-Oriented BLE Devices Coexistence.

PubMed

Del Campo, Antonio; Cintioni, Lorenzo; Spinsante, Susanna; Gambi, Ennio

2017-04-07

With the introduction of low-power wireless technologies, like Bluetooth Low Energy (BLE), new applications are approaching the home automation, healthcare, fitness, automotive and consumer electronics markets. BLE devices are designed to maximize the battery life, i.e., to run for long time on a single coin-cell battery. In typical application scenarios of home automation and Ambient Assisted Living (AAL), the sensors that monitor relatively unpredictable and rare events should coexist with other sensors that continuously communicate health or environmental parameter measurements. The former usually work in connectionless mode, acting as advertisers, while the latter need a persistent connection, acting as slave nodes. The coexistence of connectionless and connection-oriented networks, that share the same central node, can be required to reduce the number of handling devices, thus keeping the network complexity low and limiting the packet's traffic congestion. In this paper, the medium access management, operated by the central node, has been modeled, focusing on the scheduling procedure in both connectionless and connection-oriented communication. The models have been merged to provide a tool supporting the configuration design of BLE devices, during the network design phase that precedes the real implementation. The results highlight the suitability of the proposed tool: the ability to set the device parameters to allow us to keep a practical discovery latency for event-driven sensors and avoid undesired overlaps between scheduled scanning and connection phases due to bad management performed by the central node.

Exploring anti-community structure in networks with application to incompatibility of traditional Chinese medicine

NASA Astrophysics Data System (ADS)

Zhu, Jiajing; Liu, Yongguo; Zhang, Yun; Liu, Xiaofeng; Xiao, Yonghua; Wang, Shidong; Wu, Xindong

2017-11-01

Community structure is one of the most important properties in networks, in which a node shares its most connections with the others in the same community. On the contrary, the anti-community structure means the nodes in the same group have few or no connections with each other. In Traditional Chinese Medicine (TCM), the incompatibility problem of herbs is a challenge to the clinical medication safety. In this paper, we propose a new anti-community detection algorithm, Random non-nEighboring nOde expansioN (REON), to find anti-communities in networks, in which a new evaluation criterion, anti-modularity, is designed to measure the quality of the obtained anti-community structure. In order to establish anti-communities in REON, we expand the node set by non-neighboring node expansion and regard the node set with the highest anti-modularity as an anti-community. Inspired by the phenomenon that the node with higher degree has greater contribution to the anti-modularity, an improved algorithm called REONI is developed by expanding node set by the non-neighboring node with the maximum degree, which greatly enhances the efficiency of REON. Experiments on synthetic and real-world networks demonstrate the superiority of the proposed algorithms over the existing methods. In addition, by applying REONI to the herb network, we find that it can discover incompatible herb combinations.

Efficiency analysis of diffusion on T-fractals in the sense of random walks.

PubMed

Peng, Junhao; Xu, Guoai

2014-04-07

Efficiently controlling the diffusion process is crucial in the study of diffusion problem in complex systems. In the sense of random walks with a single trap, mean trapping time (MTT) and mean diffusing time (MDT) are good measures of trapping efficiency and diffusion efficiency, respectively. They both vary with the location of the node. In this paper, we analyze the effects of node's location on trapping efficiency and diffusion efficiency of T-fractals measured by MTT and MDT. First, we provide methods to calculate the MTT for any target node and the MDT for any source node of T-fractals. The methods can also be used to calculate the mean first-passage time between any pair of nodes. Then, using the MTT and the MDT as the measure of trapping efficiency and diffusion efficiency, respectively, we compare the trapping efficiency and diffusion efficiency among all nodes of T-fractal and find the best (or worst) trapping sites and the best (or worst) diffusing sites. Our results show that the hub node of T-fractal is the best trapping site, but it is also the worst diffusing site; and that the three boundary nodes are the worst trapping sites, but they are also the best diffusing sites. Comparing the maximum of MTT and MDT with their minimums, we find that the maximum of MTT is almost 6 times of the minimum of MTT and the maximum of MDT is almost equal to the minimum for MDT. Thus, the location of target node has large effect on the trapping efficiency, but the location of source node almost has no effect on diffusion efficiency. We also simulate random walks on T-fractals, whose results are consistent with the derived results.

Experimental and computational analysis of a large protein network that controls fat storage reveals the design principles of a signaling network.

PubMed

Al-Anzi, Bader; Arpp, Patrick; Gerges, Sherif; Ormerod, Christopher; Olsman, Noah; Zinn, Kai

2015-05-01

An approach combining genetic, proteomic, computational, and physiological analysis was used to define a protein network that regulates fat storage in budding yeast (Saccharomyces cerevisiae). A computational analysis of this network shows that it is not scale-free, and is best approximated by the Watts-Strogatz model, which generates "small-world" networks with high clustering and short path lengths. The network is also modular, containing energy level sensing proteins that connect to four output processes: autophagy, fatty acid synthesis, mRNA processing, and MAP kinase signaling. The importance of each protein to network function is dependent on its Katz centrality score, which is related both to the protein's position within a module and to the module's relationship to the network as a whole. The network is also divisible into subnetworks that span modular boundaries and regulate different aspects of fat metabolism. We used a combination of genetics and pharmacology to simultaneously block output from multiple network nodes. The phenotypic results of this blockage define patterns of communication among distant network nodes, and these patterns are consistent with the Watts-Strogatz model.

Fine-Grained Parcellation of Brain Connectivity Improves Differentiation of States of Consciousness During Graded Propofol Sedation.

PubMed

Liu, Xiaolin; Lauer, Kathryn K; Ward, B Douglas; Roberts, Christopher J; Liu, Suyan; Gollapudy, Suneeta; Rohloff, Robert; Gross, William; Xu, Zhan; Chen, Guangyu; Binder, Jeffrey R; Li, Shi-Jiang; Hudetz, Anthony G

2017-08-01

Conscious perception relies on interactions between spatially and functionally distinct modules of the brain at various spatiotemporal scales. These interactions are altered by anesthesia, an intervention that leads to fading consciousness. Relatively little is known about brain functional connectivity and its anesthetic modulation at a fine spatial scale. Here, we used functional imaging to examine propofol-induced changes in functional connectivity in brain networks defined at a fine-grained parcellation based on a combination of anatomical and functional features. Fifteen healthy volunteers underwent resting-state functional imaging in wakeful baseline, mild sedation, deep sedation, and recovery of consciousness. Compared with wakeful baseline, propofol produced widespread, dose-dependent functional connectivity changes that scaled with the extent to which consciousness was altered. The dominant changes in connectivity were associated with the frontal lobes. By examining node pairs that demonstrated a trend of functional connectivity change between wakefulness and deep sedation, quadratic discriminant analysis differentiated the states of consciousness in individual participants more accurately at a fine-grained parcellation (e.g., 2000 nodes) than at a coarse-grained parcellation (e.g., 116 anatomical nodes). Our study suggests that defining brain networks at a high granularity may provide a superior imaging-based distinction of the graded effect of anesthesia on consciousness.

STS-88 Crew Interview: Nancy Currie

NASA Technical Reports Server (NTRS)

1998-01-01

Nancy Currie discusses the seven-day mission that will be highlighted by the mating of the U.S.-built Node 1 station element to the Functional Energy Block (FGB) which will already be in orbit, and two spacewalks to connect power and data transmission cables between the Node and the FGB. Node 1 will be the first Space Station hardware delivered by the Space Shuttle. He also disscusses the assembly sequence. The crew will conduct a series of rendezvous maneuvers similar to those conducted on other Shuttle missions to reach the orbiting FGB. Once the two elements are docked, Ross and Newman will conduct two scheduled spacewalks to connect power and data cables between the Node, PMAs and the FGB. The day following the spacewalks, Endeavour will undock from the two components, completing the first Space Station assembly mission.

Reconfigureable network node

DOEpatents

Vanderveen, Keith B [Tracy, CA; Talbot, Edward B [Livermore, CA; Mayer, Laurence E [Davis, CA

2008-04-08

Nodes in a network having a plurality of nodes establish communication links with other nodes using available transmission media, as the ability to establish such links becomes available and desirable. The nodes predict when existing communications links will fail, become overloaded or otherwise degrade network effectiveness and act to establish substitute or additional links before the node's ability to communicate with the other nodes on the network is adversely affected. A node stores network topology information and programmed link establishment rules and criteria. The node evaluates characteristics that predict existing links with other nodes becoming unavailable or degraded. The node then determines whether it can form a communication link with a substitute node, in order to maintain connectivity with the network. When changing its communication links, a node broadcasts that information to the network. Other nodes update their stored topology information and consider the updated topology when establishing new communications links for themselves.

Petaflops router

DOEpatents

Baker, Zachary Kent; Power, John Fredrick; Tripp, Justin Leonard; Dunham, Mark Edward; Stettler, Matthew W; Jones, John Alexander

2014-10-14

Disclosed is a method and system for performing operations on at least one input data vector in order to produce at least one output vector to permit easy, scalable and fast programming of a petascale equivalent supercomputer. A PetaFlops Router may comprise one or more PetaFlops Nodes, which may be connected to each other and/or external data provider/consumers via a programmable crossbar switch external to the PetaFlops Node. Each PetaFlops Node has a FPGA and a programmable intra-FPGA crossbar switch that permits input and output variables to be configurably connected to various physical operators contained in the FPGA as desired by a user. This allows a user to specify the instruction set of the system on a per-application basis. Further, the intra-FPGA crossbar switch permits the output of one operation to be delivered as an input to a second operation. By configuring the external crossbar switch, the output of a first operation on a first PetaFlops Node may be used as the input for a second operation on a second PetaFlops Node. An embodiment may provide an ability for the system to recognize and generate pipelined functions. Streaming operators may be connected together at run-time and appropriately staged to allow data to flow through a series of functions. This allows the system to provide high throughput and parallelism when possible. The PetaFlops Router may implement the user desired instructions by appropriately configuring the intra-FPGA crossbar switch on each PetaFlops Node and the external crossbar switch.

Going End to End to Deliver High-Speed Data

NASA Technical Reports Server (NTRS)

2005-01-01

By the end of the 1990s, the optical fiber "backbone" of the telecommunication and data-communication networks had evolved from megabits-per-second transmission rates to gigabits-per-second transmission rates. Despite this boom in bandwidth, however, users at the end nodes were still not being reached on a consistent basis. (An end node is any device that does not behave like a router or a managed hub or switch. Examples of end node objects are computers, printers, serial interface processor phones, and unmanaged hubs and switches.) The primary reason that prevents bandwidth from reaching the end nodes is the complex local network topology that exists between the optical backbone and the end nodes. This complex network topology consists of several layers of routing and switch equipment which introduce potential congestion points and network latency. By breaking down the complex network topology, a true optical connection can be achieved. Access Optical Networks, Inc., is making this connection a reality with guidance from NASA s nondestructive evaluation experts.

Modeling Dynamic Evolution of Online Friendship Network

NASA Astrophysics Data System (ADS)

Wu, Lian-Ren; Yan, Qiang

2012-10-01

In this paper, we study the dynamic evolution of friendship network in SNS (Social Networking Site). Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community, but also on the friendship network generated by those friends. In addition, we propose a model which is based on two processes: first, connecting nearest neighbors; second, strength driven attachment mechanism. The model reflects two facts: first, in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes which have larger weights and interactions, a phenomenon called strength driven attachment (also called weight driven attachment). From the simulation results, we find that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data.

Protograph LDPC Codes with Node Degrees at Least 3

NASA Technical Reports Server (NTRS)

Divsalar, Dariush; Jones, Christopher

2006-01-01

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.

KENNEDY SPACE CENTER, FLA. - An overhead crane in the Space Station Processing Facility lifts the U.S. Node 2 out of its shipping container. The node will be moved to a workstand. The second of three connecting modules on the International Space Station, the Italian-built Node 2 attaches to the end of the U.S. Lab and provides attach locations for the Japanese laboratory, European laboratory, the Centrifuge Accommodation Module and, later, Multipurpose Logistics Modules. It will provide the primary docking location for the Shuttle when a pressurized mating adapter is attached to Node 2. Installation of the module will complete the U.S. Core of the ISS. Node 2 is the designated payload for mission STS-120. No orbiter or launch date has been determined yet.

NASA Image and Video Library

2003-06-03

KENNEDY SPACE CENTER, FLA. - An overhead crane in the Space Station Processing Facility lifts the U.S. Node 2 out of its shipping container. The node will be moved to a workstand. The second of three connecting modules on the International Space Station, the Italian-built Node 2 attaches to the end of the U.S. Lab and provides attach locations for the Japanese laboratory, European laboratory, the Centrifuge Accommodation Module and, later, Multipurpose Logistics Modules. It will provide the primary docking location for the Shuttle when a pressurized mating adapter is attached to Node 2. Installation of the module will complete the U.S. Core of the ISS. Node 2 is the designated payload for mission STS-120. No orbiter or launch date has been determined yet.

Anatomical and neurohistological observations on the heart of the rose ringed parakeet, Psittacula krameri.

PubMed

Qayyum, M A; Shaad, F U

1976-01-01

Anatomy, histology and innervation of the heart of the rose ringed parakeet, Psittacula krameri have been studied in the present investigation. The sinuatrial node is found to be well-developed. It is located towards the right side of the cephalic end of the interatrial septum and composed of a few nucleated cells and a large fibrous mass. The atrioventricular node is poorly defined, present at the caudal end of the interatrial septum. The node is somewhat triangular in shape and is composed of elongated and multinucleated specialized fibres. The node is not covered by any connective tissue sheath. The poor development of the atrio ventricular node and the absence of any sheath around it may be correlated with the fast rate of the heart beat. The atrioventricular bundle is observed at the cephalic end of the interventricular septum. A branch from the right limb of the atrioventricular bundle is noted to pass directly into the right atrioventricular valve. The heart is richly innervated. Ganglion cells along with nerve fibres have been observed at the sulcus terminalis and the atrioventricular junction. A direct nervous connection could be observed between the sinuatrial and atrioventricular nodes. It is argued that the impulse which originates in the sinuatrial node would reach the atrioventricular node through the unspecialized muscle fibres and nerve fibres of the interatrial septum. Nerve cells could not be traced in the substance of the sinuatrial node, atrioventricular node and atrioventricular bundle.

Masked Proportional Routing

NASA Technical Reports Server (NTRS)

Wolpert, David H. (Inventor)

2003-01-01

Distributed approach for determining a path connecting adjacent network nodes, for probabilistically or deterministically transporting an entity, with entity characteristic mu from a source node to a destination node. Each node i is directly connected to an arbitrary number J(mu) of nodes, labeled or numbered j=jl, j2, .... jJ(mu). In a deterministic version, a J(mu)-component baseline proportion vector p(i;mu) is associated with node i. A J(mu)-component applied proportion vector p*(i;mu) is determined from p(i;mu) to preclude an entity visiting a node more than once. Third and fourth J(mu)-component vectors, with components iteratively determined by Target(i;n(mu);mu),=alpha(mu).Target(i;n(mu)-1;mu)j+beta(mu).p* (i;mu)j and Actual(i;n(mu);+a(mu)j. Actual(i;n(mu)-l;mu)j+beta(mu).Sent(i;j'(mu);n(mu)-1;mu)j, are computed, where n(mu) is an entity sequence index and alpha(mu) and beta(mu) are selected numbers. In one embodiment, at each node i, the node j=j'(mu) with the largest vector component difference, Target(i;n(mu);mu)j'- Actual (i;n(mu);mu)j'. is chosen for the next link for entity transport, except in special gap circumstances, where the same link is optionally used for transporting consecutively arriving entities. The network nodes may be computer-controlled routers that switch collections of packets, frames, cells or other information units. Alternatively, the nodes may be waypoints for movement of physical items in a network or for transformation of a physical item. The nodes may be states of an entity undergoing state transitions, where allowed transitions are specified by the network and/or the destination node.

Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks

DOEpatents

Archer, Charles J.; Inglett, Todd A.; Ratterman, Joseph D.; Smith, Brian E.

2010-03-02

Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.

Adaptive triangular mesh generation

NASA Technical Reports Server (NTRS)

Erlebacher, G.; Eiseman, P. R.

1984-01-01

A general adaptive grid algorithm is developed on triangular grids. The adaptivity is provided by a combination of node addition, dynamic node connectivity and a simple node movement strategy. While the local restructuring process and the node addition mechanism take place in the physical plane, the nodes are displaced on a monitor surface, constructed from the salient features of the physical problem. An approximation to mean curvature detects changes in the direction of the monitor surface, and provides the pulling force on the nodes. Solutions to the axisymmetric Grad-Shafranov equation demonstrate the capturing, by triangles, of the plasma-vacuum interface in a free-boundary equilibrium configuration.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rodenbeck, Christopher T; Girardi, Michael

Internal nodes of a constituent integrated circuit (IC) package of a multichip module (MCM) are protected from excessive charge during plasma cleaning of the MCM. The protected nodes are coupled to an internal common node of the IC package by respectively associated discharge paths. The common node is connected to a bond pad of the IC package. During MCM assembly, and before plasma cleaning, this bond pad receives a wire bond to a ground bond pad on the MCM substrate.

Dimensionless, Scale Invariant, Edge Weight Metric for the Study of Complex Structural Networks

PubMed Central

Colon-Perez, Luis M.; Spindler, Caitlin; Goicochea, Shelby; Triplett, William; Parekh, Mansi; Montie, Eric; Carney, Paul R.; Price, Catherine; Mareci, Thomas H.

2015-01-01

High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is introduced to measure node connectivity. This edge weight metric provides reasonable and consistent values over any size scale (e.g. rodents to humans) used to quantify the strength of connection. Firstly, simulations were used to assess the effects of tractography seed point density and random errors in the estimated fiber orientations; with sufficient signal-to-noise ratio (SNR), edge weight estimates improve as the seed density increases. Secondly to evaluate the application of the edge weight in the human brain, ten repeated measures of DWI in the same healthy human subject were analyzed. Mean edge weight values within the cingulum and corpus callosum were consistent and showed low variability. Thirdly, using excised rat brains to study the effects of spatial resolution, the weight of edges connecting major structures in the temporal lobe were used to characterize connectivity in this local network. The results indicate that with adequate resolution and SNR, connections between network nodes are characterized well by this edge weight metric. Therefore this new dimensionless, scale-invariant edge weight metric provides a robust measure of network connectivity that can be applied in any size regime. PMID:26173147

Minimum spanning tree analysis of the human connectome

PubMed Central

Sommer, Iris E.; Bohlken, Marc M.; Tewarie, Prejaas; Draaisma, Laurijn; Zalesky, Andrew; Di Biase, Maria; Brown, Jesse A.; Douw, Linda; Otte, Willem M.; Mandl, René C.W.; Stam, Cornelis J.

2018-01-01

Abstract One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections. In this study, we used minimum spanning tree (MST; a unique, acyclic subnetwork with a fixed number of connections) analysis to characterize the human brain network to create an empirical reference network. Such a reference network could be used as a null model of connections that form the backbone structure of the human brain. We analyzed the MST in three diffusion‐weighted imaging datasets of healthy adults. The MST of the group mean connectivity matrix was used as the empirical null‐model. The MST of individual subjects matched this reference MST for a mean 58%–88% of connections, depending on the analysis pipeline. Hub nodes in the MST matched with previously reported locations of hub regions, including the so‐called rich club nodes (a subset of high‐degree, highly interconnected nodes). Although most brain network studies have focused primarily on cortical connections, cortical–subcortical connections were consistently present in the MST across subjects. Brain network efficiency was higher when these connections were included in the analysis, suggesting that these tracts may be utilized as the major neural communication routes. Finally, we confirmed that MST characteristics index the effects of brain aging. We conclude that the MST provides an elegant and straightforward approach to analyze structural brain networks, and to test network topological features of individual subjects in comparison to empirical null models. PMID:29468769

Dimensionless, Scale Invariant, Edge Weight Metric for the Study of Complex Structural Networks.

PubMed

Colon-Perez, Luis M; Spindler, Caitlin; Goicochea, Shelby; Triplett, William; Parekh, Mansi; Montie, Eric; Carney, Paul R; Price, Catherine; Mareci, Thomas H

2015-01-01

High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is introduced to measure node connectivity. This edge weight metric provides reasonable and consistent values over any size scale (e.g. rodents to humans) used to quantify the strength of connection. Firstly, simulations were used to assess the effects of tractography seed point density and random errors in the estimated fiber orientations; with sufficient signal-to-noise ratio (SNR), edge weight estimates improve as the seed density increases. Secondly to evaluate the application of the edge weight in the human brain, ten repeated measures of DWI in the same healthy human subject were analyzed. Mean edge weight values within the cingulum and corpus callosum were consistent and showed low variability. Thirdly, using excised rat brains to study the effects of spatial resolution, the weight of edges connecting major structures in the temporal lobe were used to characterize connectivity in this local network. The results indicate that with adequate resolution and SNR, connections between network nodes are characterized well by this edge weight metric. Therefore this new dimensionless, scale-invariant edge weight metric provides a robust measure of network connectivity that can be applied in any size regime.

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment.

PubMed

Sohail, Muhammad; Wang, Liangmin

2018-03-14

Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node's transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.

Low voltage to high voltage level shifter and related methods

NASA Technical Reports Server (NTRS)

Mentze, Erik J. (Inventor); Buck, Kevin M. (Inventor); Hess, Herbert L. (Inventor); Cox, David F. (Inventor)

2006-01-01

A shifter circuit comprises a high and low voltage buffer stages and an output buffer stage. The high voltage buffer stage comprises multiple transistors arranged in a transistor stack having a plurality of intermediate nodes connecting individual transistors along the stack. The transistor stack is connected between a voltage level being shifted to and an input voltage. An inverter of this stage comprises multiple inputs and an output. Inverter inputs are connected to a respective intermediate node of the transistor stack. The low voltage buffer stage has an input connected to the input voltage and an output, and is operably connected to the high voltage buffer stage. The low voltage buffer stage is connected between a voltage level being shifted away from and a lower voltage. The output buffer stage is driven by the outputs of the high voltage buffer stage inverter and the low voltage buffer stage.

Cell boundary fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2009-05-05

A method determines a nodal fault along the boundary, or face, of a computing cell. Nodes on adjacent cell boundaries communicate with each other, and the communications are analyzed to determine if a node or connection is faulty.

Realtime Gas Emission Monitoring at Hazardous Sites Using a Distributed Point-Source Sensing Infrastructure

PubMed Central

Manes, Gianfranco; Collodi, Giovanni; Gelpi, Leonardo; Fusco, Rosanna; Ricci, Giuseppe; Manes, Antonio; Passafiume, Marco

2016-01-01

This paper describes a distributed point-source monitoring platform for gas level and leakage detection in hazardous environments. The platform, based on a wireless sensor network (WSN) architecture, is organised into sub-networks to be positioned in the plant’s critical areas; each sub-net includes a gateway unit wirelessly connected to the WSN nodes, hence providing an easily deployable, stand-alone infrastructure featuring a high degree of scalability and reconfigurability. Furthermore, the system provides automated calibration routines which can be accomplished by non-specialized maintenance operators without system reliability reduction issues. Internet connectivity is provided via TCP/IP over GPRS (Internet standard protocols over mobile networks) gateways at a one-minute sampling rate. Environmental and process data are forwarded to a remote server and made available to authenticated users through a user interface that provides data rendering in various formats and multi-sensor data fusion. The platform is able to provide real-time plant management with an effective; accurate tool for immediate warning in case of critical events. PMID:26805832

Reliable appropriate topology design for multiple-processor systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chou, C.P.

1987-01-01

A Shift and Replace Graph which is a very appropriate candidate for the topology of a multiple-processor system is a function of two positive integers r and m, and is denoted as SRF(r,m). Pradhan and Reddy proved that the node connectivity of SRG(r,m) is at least r and also give a routing algorithm which generally requires 2m jumps if the number of node failures is no larger than r - 1. Later, Esfahanian and Hakimi proved that SRG(r,m) has maximum node connectivity 2r - 2 and give routing algorithms which require: (1) at most m + 3 + log/sub r/mmore » jumps if 3 + log/sub r/m does not exceed m and the number of node failures is at most r - 1; (2) at most m + 5 + log/sub r/m jumps if 4 + log/sub r/m less than or equal to m and the number of node failures if less than or equal to 2r - 3; (3) all the other situations require no more than 2m jumps. By modifying the SRG(r,m), it is first proved that node connectivity of SRG(r,m) can be increased to: (1) 2r - 1 when r = 2, m = 2, and (2) 2r when (r = 2, m > 2) or (r > 2, m greater than or equal to 2, m greater than or equal to 2). The routing algorithms are also given for the modified SRG (r,m), which require at most 2m + 3 jumps when the number of node failures is less than or equal to 2r - 1.« less

Finding Minimum-Power Broadcast Trees for Wireless Networks

NASA Technical Reports Server (NTRS)

Arabshahi, Payman; Gray, Andrew; Das, Arindam; El-Sharkawi, Mohamed; Marks, Robert, II

2004-01-01

Some algorithms have been devised for use in a method of constructing tree graphs that represent connections among the nodes of a wireless communication network. These algorithms provide for determining the viability of any given candidate connection tree and for generating an initial set of viable trees that can be used in any of a variety of search algorithms (e.g., a genetic algorithm) to find a tree that enables the network to broadcast from a source node to all other nodes while consuming the minimum amount of total power. The method yields solutions better than those of a prior algorithm known as the broadcast incremental power algorithm, albeit at a slightly greater computational cost.

Reliability Evaluation for Clustered WSNs under Malware Propagation.

PubMed

Shen, Shigen; Huang, Longjun; Liu, Jianhua; Champion, Adam C; Yu, Shui; Cao, Qiying

2016-06-10

We consider a clustered wireless sensor network (WSN) under epidemic-malware propagation conditions and solve the problem of how to evaluate its reliability so as to ensure efficient, continuous, and dependable transmission of sensed data from sensor nodes to the sink. Facing the contradiction between malware intention and continuous-time Markov chain (CTMC) randomness, we introduce a strategic game that can predict malware infection in order to model a successful infection as a CTMC state transition. Next, we devise a novel measure to compute the Mean Time to Failure (MTTF) of a sensor node, which represents the reliability of a sensor node continuously performing tasks such as sensing, transmitting, and fusing data. Since clustered WSNs can be regarded as parallel-serial-parallel systems, the reliability of a clustered WSN can be evaluated via classical reliability theory. Numerical results show the influence of parameters such as the true positive rate and the false positive rate on a sensor node's MTTF. Furthermore, we validate the method of reliability evaluation for a clustered WSN according to the number of sensor nodes in a cluster, the number of clusters in a route, and the number of routes in the WSN.

Resilient Wireless Sensor Networks Using Topology Control: A Review

PubMed Central

Huang, Yuanjiang; Martínez, José-Fernán; Sendra, Juana; López, Lourdes

2015-01-01

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs. PMID:26404272

Graph theoretic analysis of structural connectivity across the spectrum of Alzheimer's disease: The importance of graph creation methods

PubMed Central

Phillips, David J.; McGlaughlin, Alec; Ruth, David; Jager, Leah R.; Soldan, Anja

2015-01-01

Graph theory is increasingly being used to study brain connectivity across the spectrum of Alzheimer's disease (AD), but prior findings have been inconsistent, likely reflecting methodological differences. We systematically investigated how methods of graph creation (i.e., type of correlation matrix and edge weighting) affect structural network properties and group differences. We estimated the structural connectivity of brain networks based on correlation maps of cortical thickness obtained from MRI. Four groups were compared: 126 cognitively normal older adults, 103 individuals with Mild Cognitive Impairment (MCI) who retained MCI status for at least 3 years (stable MCI), 108 individuals with MCI who progressed to AD-dementia within 3 years (progressive MCI), and 105 individuals with AD-dementia. Small-world measures of connectivity (characteristic path length and clustering coefficient) differed across groups, consistent with prior studies. Groups were best discriminated by the Randić index, which measures the degree to which highly connected nodes connect to other highly connected nodes. The Randić index differentiated the stable and progressive MCI groups, suggesting that it might be useful for tracking and predicting the progression of AD. Notably, however, the magnitude and direction of group differences in all three measures were dependent on the method of graph creation, indicating that it is crucial to take into account how graphs are constructed when interpreting differences across diagnostic groups and studies. The algebraic connectivity measures showed few group differences, independent of the method of graph construction, suggesting that global connectivity as it relates to node degree is not altered in early AD. PMID:25984446

Smart sensing surveillance system

NASA Astrophysics Data System (ADS)

Hsu, Charles; Chu, Kai-Dee; O'Looney, James; Blake, Michael; Rutar, Colleen

2010-04-01

An effective public safety sensor system for heavily-populated applications requires sophisticated and geographically-distributed infrastructures, centralized supervision, and deployment of large-scale security and surveillance networks. Artificial intelligence in sensor systems is a critical design to raise awareness levels, improve the performance of the system and adapt to a changing scenario and environment. In this paper, a highly-distributed, fault-tolerant, and energy-efficient Smart Sensing Surveillance System (S4) is presented to efficiently provide a 24/7 and all weather security operation in crowded environments or restricted areas. Technically, the S4 consists of a number of distributed sensor nodes integrated with specific passive sensors to rapidly collect, process, and disseminate heterogeneous sensor data from near omni-directions. These distributed sensor nodes can cooperatively work to send immediate security information when new objects appear. When the new objects are detected, the S4 will smartly select the available node with a Pan- Tilt- Zoom- (PTZ) Electro-Optics EO/IR camera to track the objects and capture associated imagery. The S4 provides applicable advanced on-board digital image processing capabilities to detect and track the specific objects. The imaging detection operations include unattended object detection, human feature and behavior detection, and configurable alert triggers, etc. Other imaging processes can be updated to meet specific requirements and operations. In the S4, all the sensor nodes are connected with a robust, reconfigurable, LPI/LPD (Low Probability of Intercept/ Low Probability of Detect) wireless mesh network using Ultra-wide band (UWB) RF technology. This UWB RF technology can provide an ad-hoc, secure mesh network and capability to relay network information, communicate and pass situational awareness and messages. The Service Oriented Architecture of S4 enables remote applications to interact with the S4 network and use the specific presentation methods. In addition, the S4 is compliant with Open Geospatial Consortium - Sensor Web Enablement (OGC-SWE) standards to efficiently discover, access, use, and control heterogeneous sensors and their metadata. These S4 capabilities and technologies have great potential for both military and civilian applications, enabling highly effective security support tools for improving surveillance activities in densely crowded environments. The S4 system is directly applicable to solutions for emergency response personnel, law enforcement, and other homeland security missions, as well as in applications requiring the interoperation of sensor networks with handheld or body-worn interface devices.

Mechanical end joint system for structural column elements

NASA Technical Reports Server (NTRS)

Bush, H. G.; Wallsom, R. E. (Inventor)

1982-01-01

A mechanical end joint system, useful for the transverse connection of strut elements to a common node, comprises a node joint half with a semicircular tongue and groove, and a strut joint half with a semicircular tongue and groove. The two joint halves are engaged transversely and the connection is made secure by the inherent physical property characteristics of locking latches and/or by a spring-actioned shaft. A quick release mechanism provides rapid disengagement of the joint halves.

Smart Sensor Network for Aircraft Corrosion Monitoring

DTIC Science & Technology

2010-02-01

Network Elements – Hub, Network capable application processor ( NCAP ) – Node, Smart transducer interface module (STIM)  Corrosion Sensing and...software Transducer software Network Protocol 1451.2 1451.3 1451.5 1451.6 1451.7 I/O Node -processor Power TEDS Smart Sensor Hub ( NCAP ) IEEE 1451.0 and

Disruptions of brain structural network in end-stage renal disease patients with long-term hemodialysis and normal-appearing brain tissues.

PubMed

Chou, Ming-Chung; Ko, Chih-Hung; Chang, Jer-Ming; Hsieh, Tsyh-Jyi

2018-05-04

End-stage renal disease (ESRD) patients on hemodialysis were demonstrated to exhibit silent and invisible white-matter alterations which would likely lead to disruptions of brain structural networks. Therefore, the purpose of this study was to investigate the disruptions of brain structural network in ESRD patients. Thiry-three ESRD patients with normal-appearing brain tissues and 29 age- and gender-matched healthy controls were enrolled in this study and underwent both cognitive ability screening instrument (CASI) assessment and diffusion tensor imaging (DTI) acquisition. Brain structural connectivity network was constructed using probabilistic tractography with automatic anatomical labeling template. Graph-theory analysis was performed to detect the alterations of node-strength, node-degree, node-local efficiency, and node-clustering coefficient in ESRD patients. Correlational analysis was performed to understand the relationship between network measures, CASI score, and dialysis duration. Structural connectivity, node-strength, node-degree, and node-local efficiency were significantly decreased, whereas node-clustering coefficient was significantly increased in ESRD patients as compared with healthy controls. The disrupted local structural networks were generally associated with common neurological complications of ESRD patients, but the correlational analysis did not reveal significant correlation between network measures, CASI score, and dialysis duration. Graph-theory analysis was helpful to investigate disruptions of brain structural network in ESRD patients with normal-appearing brain tissues. Copyright © 2018. Published by Elsevier Masson SAS.

KENNEDY SPACE CENTER, FLA. - STS-120 Mission Specialists Piers Sellers and Michael Foreman are in the Space Station Processing Facility for hardware familiarization. The mission will deliver the second of three Station connecting modules, Node 2, which attaches to the end of U.S. Lab. It will provide attach locations for the Japanese laboratory, European laboratory, the Centrifuge Accommodation Module and later Multi-Purpose Logistics Modules. The addition of Node 2 will complete the U.S. core of the International Space Station.

NASA Image and Video Library

2003-07-18

KENNEDY SPACE CENTER, FLA. - STS-120 Mission Specialists Piers Sellers and Michael Foreman are in the Space Station Processing Facility for hardware familiarization. The mission will deliver the second of three Station connecting modules, Node 2, which attaches to the end of U.S. Lab. It will provide attach locations for the Japanese laboratory, European laboratory, the Centrifuge Accommodation Module and later Multi-Purpose Logistics Modules. The addition of Node 2 will complete the U.S. core of the International Space Station.

Photonic Quantum Networks formed from NV− centers

PubMed Central

Nemoto, Kae; Trupke, Michael; Devitt, Simon J.; Scharfenberger, Burkhard; Buczak, Kathrin; Schmiedmayer, Jörg; Munro, William J.

2016-01-01

In this article we present a simple repeater scheme based on the negatively-charged nitrogen vacancy centre in diamond. Each repeater node is built from modules comprising an optical cavity containing a single NV−, with one nuclear spin from 15N as quantum memory. The module uses only deterministic processes and interactions to achieve high fidelity operations (>99%), and modules are connected by optical fiber. In the repeater node architecture, the processes between modules by photons can be in principle deterministic, however current limitations on optical components lead the processes to be probabilistic but heralded. Our resource-modest repeater architecture contains two modules at each node, and the repeater nodes are then connected by entangled photon pairs. We discuss the performance of such a quantum repeater network with modest resources and then incorporate more resource-intense strategies step by step. Our architecture should allow large-scale quantum information networks with existing or near future technology. PMID:27215433

Multinode reconfigurable pipeline computer

NASA Technical Reports Server (NTRS)

Nosenchuck, Daniel M. (Inventor); Littman, Michael G. (Inventor)

1989-01-01

A multinode parallel-processing computer is made up of a plurality of innerconnected, large capacity nodes each including a reconfigurable pipeline of functional units such as Integer Arithmetic Logic Processors, Floating Point Arithmetic Processors, Special Purpose Processors, etc. The reconfigurable pipeline of each node is connected to a multiplane memory by a Memory-ALU switch NETwork (MASNET). The reconfigurable pipeline includes three (3) basic substructures formed from functional units which have been found to be sufficient to perform the bulk of all calculations. The MASNET controls the flow of signals from the memory planes to the reconfigurable pipeline and vice versa. the nodes are connectable together by an internode data router (hyperspace router) so as to form a hypercube configuration. The capability of the nodes to conditionally configure the pipeline at each tick of the clock, without requiring a pipeline flush, permits many powerful algorithms to be implemented directly.

Photonic Quantum Networks formed from NV(-) centers.

PubMed

Nemoto, Kae; Trupke, Michael; Devitt, Simon J; Scharfenberger, Burkhard; Buczak, Kathrin; Schmiedmayer, Jörg; Munro, William J

2016-05-24

In this article we present a simple repeater scheme based on the negatively-charged nitrogen vacancy centre in diamond. Each repeater node is built from modules comprising an optical cavity containing a single NV(-), with one nuclear spin from (15)N as quantum memory. The module uses only deterministic processes and interactions to achieve high fidelity operations (>99%), and modules are connected by optical fiber. In the repeater node architecture, the processes between modules by photons can be in principle deterministic, however current limitations on optical components lead the processes to be probabilistic but heralded. Our resource-modest repeater architecture contains two modules at each node, and the repeater nodes are then connected by entangled photon pairs. We discuss the performance of such a quantum repeater network with modest resources and then incorporate more resource-intense strategies step by step. Our architecture should allow large-scale quantum information networks with existing or near future technology.

Analysis of Handoff Mechanisms in Mobile IP

NASA Astrophysics Data System (ADS)

Jayaraj, Maria Nadine Simonel; Issac, Biju; Haldar, Manas Kumar

2011-06-01

One of the most important challenges in mobile Internet Protocol (IP) is to provide service for a mobile node to maintain its connectivity to network when it moves from one domain to another. IP is responsible for routing packets across network. The first major version of IP is the Internet Protocol version 4 (IPv4). It is one of the dominant protocols relevant to wireless network. Later a newer version of IP called the IPv6 was proposed. Mobile IPv6 is mainly introduced for the purpose of mobility. Mobility management enables network to locate roaming nodes in order to deliver packets and maintain connections with them when moving into new domains. Handoff occurs when a mobile node moves from one network to another. It is a key factor of mobility because a mobile node can trigger several handoffs during a session. This paper briefly explains on mobile IP and its handoff issues, along with the drawbacks of mobile IP.

Analysis of Network Vulnerability Under Joint Node and Link Attacks

NASA Astrophysics Data System (ADS)

Li, Yongcheng; Liu, Shumei; Yu, Yao; Cao, Ting

2018-03-01

The security problem of computer network system is becoming more and more serious. The fundamental reason is that there are security vulnerabilities in the network system. Therefore, it’s very important to identify and reduce or eliminate these vulnerabilities before they are attacked. In this paper, we are interested in joint node and link attacks and propose a vulnerability evaluation method based on the overall connectivity of the network to defense this attack. Especially, we analyze the attack cost problem from the attackers’ perspective. The purpose is to find the set of least costs for joint links and nodes, and their deletion will lead to serious network connection damage. The simulation results show that the vulnerable elements obtained from the proposed method are more suitable for the attacking idea of the malicious persons in joint node and link attack. It is easy to find that the proposed method has more realistic protection significance.

Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Li, Deying; Li, Zheng; Ma, Wenkai; Chen, Wenping

An Underwater Acoustic Wireless Sensor Network (UA-WSN) consists of many resource-constrained Underwater Sensor Nodes (USNs), which are deployed to perform collaborative monitoring tasks over a given region. One way to preserve network connectivity while guaranteing other network QoS is to deploy some Relay Nodes (RNs) in the networks, in which RNs' function is more powerful than USNs and their cost is more expensive. This paper addresses Constrained Low-interference Relay Node Deployment (C-LRND) problem for 3-D UA-WSNs in which the RNs are placed at a subset of candidate locations to ensure connectivity between the USNs, under both the number of RNs deployed and the value of total incremental interference constraints. We first prove that it is NP-hard, then present a general approximation algorithm framework and get two polynomial time O(1)-approximation algorithms.

Quantitative methods of identifying the key nodes in the illegal wildlife trade network

PubMed Central

Patel, Nikkita Gunvant; Rorres, Chris; Joly, Damien O.; Brownstein, John S.; Boston, Ray; Levy, Michael Z.; Smith, Gary

2015-01-01

Innovative approaches are needed to combat the illegal trade in wildlife. Here, we used network analysis and a new database, HealthMap Wildlife Trade, to identify the key nodes (countries) that support the illegal wildlife trade. We identified key exporters and importers from the number of shipments a country sent and received and from the number of connections a country had to other countries over a given time period. We used flow betweenness centrality measurements to identify key intermediary countries. We found the set of nodes whose removal from the network would cause the maximum disruption to the network. Selecting six nodes would fragment 89.5% of the network for elephants, 92.3% for rhinoceros, and 98.1% for tigers. We then found sets of nodes that would best disseminate an educational message via direct connections through the network. We would need to select 18 nodes to reach 100% of the elephant trade network, 16 nodes for rhinoceros, and 10 for tigers. Although the choice of locations for interventions should be customized for the animal and the goal of the intervention, China was the most frequently selected country for network fragmentation and information dissemination. Identification of key countries will help strategize illegal wildlife trade interventions. PMID:26080413

International Space Station Node 1 is moved for leak test

NASA Technical Reports Server (NTRS)

1998-01-01

Node 1, the first element for the International Space Station, and attached Pressurized Mating Adapter-1 continue with prelaunch preparation activities at KSC's Space Station Processing Facility. Node 1 is a connecting passageway to the living and working areas of the space station. The node is being removed from the element rotation stand, or test stand, where it underwent an interim weight and center of gravity determination. (The final determination is planned to be performed prior to transporting Node 1 to the launch pad.) Now the node is being moved to the Shuttle payload transportation canister, where the doors will be closed for a two-week leak check. Node 1 is scheduled to fly on STS-88.

Suppressing epidemics on networks by exploiting observer nodes.

PubMed

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

Suppressing epidemics on networks by exploiting observer nodes

NASA Astrophysics Data System (ADS)

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

Morphogenetic events in the perinodal connective tissue in a metastatic cancer model.

PubMed

Conti, G; Minicozzi, A; Merigo, F; Marzola, P; Osculati, F; Cordiano, C; Sbarbati, A

2013-02-01

The modifications of connective tissue surrounding metastatic lymph nodes in a murine model of rectal cancer are described. Athymic nude mice (n=36) were inoculated with 10×10(5) ht-29 cancer cells into the submucosal layer of the rectum. Control mice (n=5) were treated with a sterile buffer. Tumor and the involved lymph nodes were visualized in vivo by magnetic resonance imaging at 1 to 4 weeks after cell injection. After the sacrifice, the excised samples were processed for histology. After one week from cell injection all treated animals developed rectal cancer. Since the first week, neoplastic cells were visible in the nodes. In the surrounding connective tissue, the diameter of the adipocytes was reduced and a mesenchymal-like pattern with stellate cells embedded in an oedematous environment was visible. Since the second week, in the perinodal connective an enlargement of the stroma was present. The tissue was organized in cords and areas with extracellular accumulation of lipids were found. At the fourth week, we observed an enlargement of multilocular areas and lobules of elongated elements almost devoid of lipid droplets. In control animals, in absence of neoplastic masses, pelvic nodes were surrounded by a typical connective tissue characterized by unilocular adipocytes with groups of multilocular adipocytes. We have developed a model of rectal cancer with nodal metastases. Using this model, the work demonstrates that around secondary lesions, the morphogenetic events follow a standard evolution characterized by an early phase with lipolysis and mesenchymalization and later phases with a brown-like phenotype acquisition. Copyright © 2012. Published by Elsevier SAS.

Network robustness assessed within a dual connectivity framework: joint dynamics of the Active and Idle Networks.

PubMed

Tejedor, Alejandro; Longjas, Anthony; Zaliapin, Ilya; Ambroj, Samuel; Foufoula-Georgiou, Efi

2017-08-17

Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. But current definition of robustness is only accounting for half of the story: the connectivity of the nodes unaffected by the attack. Here we propose a new framework to assess network robustness, wherein the connectivity of the affected nodes is also taken into consideration, acknowledging that it plays a crucial role in properly evaluating the overall network robustness in terms of its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and that of building-up the IN. We show, via analysis of well-known prototype networks and real world data, that trade-offs between the efficiency of Active and Idle Network dynamics give rise to surprising robustness crossovers and re-rankings, which can have significant implications for decision making.

Popularity versus similarity in growing networks.

PubMed

Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M Ángeles; Boguñá, Marián; Krioukov, Dmitri

2012-09-27

The principle that 'popularity is attractive' underlies preferential attachment, which is a common explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections possessed by nodes follows power laws, as observed in many real networks. Preferential attachment has been directly validated for some real networks (including the Internet), and can be a consequence of different underlying processes based on node fitness, ranking, optimization, random walks or duplication. Here we show that popularity is just one dimension of attractiveness; another dimension is similarity. We develop a framework in which new connections optimize certain trade-offs between popularity and similarity, instead of simply preferring popular nodes. The framework has a geometric interpretation in which popularity preference emerges from local optimization. As opposed to preferential attachment, our optimization framework accurately describes the large-scale evolution of technological (the Internet), social (trust relationships between people) and biological (Escherichia coli metabolic) networks, predicting the probability of new links with high precision. The framework that we have developed can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon.

OPUS: A Comprehensive Search Tool for Remote Sensing Observations of the Outer Planets. Now with Enhanced Geometric Metadata for Cassini and New Horizons Optical Remote Sensing Instruments.

NASA Astrophysics Data System (ADS)

Gordon, M. K.; Showalter, M. R.; Ballard, L.; Tiscareno, M.; French, R. S.; Olson, D.

2017-06-01

The PDS RMS Node hosts OPUS - an accurate, comprehensive search tool for spacecraft remote sensing observations. OPUS supports Cassini: CIRS, ISS, UVIS, VIMS; New Horizons: LORRI, MVIC; Galileo SSI; Voyager ISS; and Hubble: ACS, STIS, WFC3, WFPC2.

Low-rank network decomposition reveals structural characteristics of small-world networks

NASA Astrophysics Data System (ADS)

Barranca, Victor J.; Zhou, Douglas; Cai, David

2015-12-01

Small-world networks occur naturally throughout biological, technological, and social systems. With their prevalence, it is particularly important to prudently identify small-world networks and further characterize their unique connection structure with respect to network function. In this work we develop a formalism for classifying networks and identifying small-world structure using a decomposition of network connectivity matrices into low-rank and sparse components, corresponding to connections within clusters of highly connected nodes and sparse interconnections between clusters, respectively. We show that the network decomposition is independent of node indexing and define associated bounded measures of connectivity structure, which provide insight into the clustering and regularity of network connections. While many existing network characterizations rely on constructing benchmark networks for comparison or fail to describe the structural properties of relatively densely connected networks, our classification relies only on the intrinsic network structure and is quite robust with respect to changes in connection density, producing stable results across network realizations. Using this framework, we analyze several real-world networks and reveal new structural properties, which are often indiscernible by previously established characterizations of network connectivity.

Real time network traffic monitoring for wireless local area networks based on compressed sensing

NASA Astrophysics Data System (ADS)

Balouchestani, Mohammadreza

2017-05-01

A wireless local area network (WLAN) is an important type of wireless networks which connotes different wireless nodes in a local area network. WLANs suffer from important problems such as network load balancing, large amount of energy, and load of sampling. This paper presents a new networking traffic approach based on Compressed Sensing (CS) for improving the quality of WLANs. The proposed architecture allows reducing Data Delay Probability (DDP) to 15%, which is a good record for WLANs. The proposed architecture is increased Data Throughput (DT) to 22 % and Signal to Noise (S/N) ratio to 17 %, which provide a good background for establishing high qualified local area networks. This architecture enables continuous data acquisition and compression of WLAN's signals that are suitable for a variety of other wireless networking applications. At the transmitter side of each wireless node, an analog-CS framework is applied at the sensing step before analog to digital converter in order to generate the compressed version of the input signal. At the receiver side of wireless node, a reconstruction algorithm is applied in order to reconstruct the original signals from the compressed signals with high probability and enough accuracy. The proposed algorithm out-performs existing algorithms by achieving a good level of Quality of Service (QoS). This ability allows reducing 15 % of Bit Error Rate (BER) at each wireless node.

Analysis of the Spatial Organization of Pastures as a Contact Network, Implications for Potential Disease Spread and Biosecurity in Livestock, France, 2010.

PubMed

Palisson, Aurore; Courcoul, Aurélie; Durand, Benoit

2017-01-01

The use of pastures is part of common herd management practices for livestock animals, but contagion between animals located on neighbouring pastures is one of the major modes of infectious disease transmission between herds. At the population level, this transmission is strongly constrained by the spatial organization of pastures. The aim of this study was to answer two questions: (i) is the spatial configuration of pastures favourable to the spread of infectious diseases in France? (ii) would biosecurity measures allow decreasing this vulnerability? Based on GIS data, the spatial organization of pastures was represented using networks. Nodes were the 3,159,787 pastures reported in 2010 by the French breeders to claim the Common Agricultural Policy subsidies. Links connected pastures when the distance between them was below a predefined threshold. Premises networks were obtained by aggregating into a single node all the pastures under the same ownership. Although the pastures network was very fragmented when the distance threshold was short (1.5 meters, relevant for a directly-transmitted disease), it was not the case when the distance threshold was larger (500 m, relevant for a vector-borne disease: 97% of the nodes in the largest connected component). The premises network was highly connected as the largest connected component always included more than 83% of the nodes, whatever the distance threshold. Percolation analyses were performed to model the population-level efficacy of biosecurity measures. Percolation thresholds varied according to the modelled biosecurity measures and to the distance threshold. They were globally high (e.g. >17% of nodes had to be removed, mimicking the confinement of animals inside farm buildings, to obtain the disappearance of the large connected component). The network of pastures thus appeared vulnerable to the spread of diseases in France. Only a large acceptance of biosecurity measures by breeders would allow reducing this structural risk.

Analysis of the Spatial Organization of Pastures as a Contact Network, Implications for Potential Disease Spread and Biosecurity in Livestock, France, 2010

PubMed Central

Palisson, Aurore; Courcoul, Aurélie; Durand, Benoit

2017-01-01

The use of pastures is part of common herd management practices for livestock animals, but contagion between animals located on neighbouring pastures is one of the major modes of infectious disease transmission between herds. At the population level, this transmission is strongly constrained by the spatial organization of pastures. The aim of this study was to answer two questions: (i) is the spatial configuration of pastures favourable to the spread of infectious diseases in France? (ii) would biosecurity measures allow decreasing this vulnerability? Based on GIS data, the spatial organization of pastures was represented using networks. Nodes were the 3,159,787 pastures reported in 2010 by the French breeders to claim the Common Agricultural Policy subsidies. Links connected pastures when the distance between them was below a predefined threshold. Premises networks were obtained by aggregating into a single node all the pastures under the same ownership. Although the pastures network was very fragmented when the distance threshold was short (1.5 meters, relevant for a directly-transmitted disease), it was not the case when the distance threshold was larger (500 m, relevant for a vector-borne disease: 97% of the nodes in the largest connected component). The premises network was highly connected as the largest connected component always included more than 83% of the nodes, whatever the distance threshold. Percolation analyses were performed to model the population-level efficacy of biosecurity measures. Percolation thresholds varied according to the modelled biosecurity measures and to the distance threshold. They were globally high (e.g. >17% of nodes had to be removed, mimicking the confinement of animals inside farm buildings, to obtain the disappearance of the large connected component). The network of pastures thus appeared vulnerable to the spread of diseases in France. Only a large acceptance of biosecurity measures by breeders would allow reducing this structural risk. PMID:28060913

KENNEDY SPACE CENTER, FLA. - An overhead crane in the Space Station Processing Facility is attached to the U.S. Node 2 to lift it out of its shipping container. The node will be moved to a workstand. The second of three connecting modules on the International Space Station, the Italian-built Node 2 attaches to the end of the U.S. Lab and provides attach locations for the Japanese laboratory, European laboratory, the Centrifuge Accommodation Module and, later, Multipurpose Logistics Modules. It will provide the primary docking location for the Shuttle when a pressurized mating adapter is attached to Node 2. Installation of the module will complete the U.S. Core of the ISS. Node 2 is the designated payload for mission STS-120. No orbiter or launch date has been determined yet.

NASA Image and Video Library

2003-06-03

KENNEDY SPACE CENTER, FLA. - An overhead crane in the Space Station Processing Facility is attached to the U.S. Node 2 to lift it out of its shipping container. The node will be moved to a workstand. The second of three connecting modules on the International Space Station, the Italian-built Node 2 attaches to the end of the U.S. Lab and provides attach locations for the Japanese laboratory, European laboratory, the Centrifuge Accommodation Module and, later, Multipurpose Logistics Modules. It will provide the primary docking location for the Shuttle when a pressurized mating adapter is attached to Node 2. Installation of the module will complete the U.S. Core of the ISS. Node 2 is the designated payload for mission STS-120. No orbiter or launch date has been determined yet.

Node 1 and PMA-1 are moved for weight and center of gravity determination

NASA Technical Reports Server (NTRS)

1998-01-01

Node 1, the first U.S. element for the International Space Station, and Pressurized Mating Adapter-1 (PMA-1) continue with prelaunch preparation activities at KSC's Space Station Processing Facility. Node 1 is a connecting passageway to the living and working areas of the space station. The node and PMA-1 are being moved to an element rotation stand, or test stand, where they will undergo an interim weight and center of gravity determination. The final determination is planned to be performed prior to transporting Node 1 to the launch pad. Node 1 is scheduled to fly on STS-88.

Locating hardware faults in a data communications network of a parallel computer

DOEpatents

Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

2010-01-12

Hardware faults location in a data communications network of a parallel computer. Such a parallel computer includes a plurality of compute nodes and a data communications network that couples the compute nodes for data communications and organizes the compute node as a tree. Locating hardware faults includes identifying a next compute node as a parent node and a root of a parent test tree, identifying for each child compute node of the parent node a child test tree having the child compute node as root, running a same test suite on the parent test tree and each child test tree, and identifying the parent compute node as having a defective link connected from the parent compute node to a child compute node if the test suite fails on the parent test tree and succeeds on all the child test trees.

Cell boundary fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2011-04-19

An apparatus and program product determine a nodal fault along the boundary, or face, of a computing cell. Nodes on adjacent cell boundaries communicate with each other, and the communications are analyzed to determine if a node or connection is faulty.

Connectivity, Coverage and Placement in Wireless Sensor Networks

PubMed Central

Li, Ji; Andrew, Lachlan L.H.; Foh, Chuan Heng; Zukerman, Moshe; Chen, Hsiao-Hwa

2009-01-01

Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes. PMID:22408474

Hyperswitch Network For Hypercube Computer

NASA Technical Reports Server (NTRS)

Chow, Edward; Madan, Herbert; Peterson, John

1989-01-01

Data-driven dynamic switching enables high speed data transfer. Proposed hyperswitch network based on mixed static and dynamic topologies. Routing header modified in response to congestion or faults encountered as path established. Static topology meets requirement if nodes have switching elements that perform necessary routing header revisions dynamically. Hypercube topology now being implemented with switching element in each computer node aimed at designing very-richly-interconnected multicomputer system. Interconnection network connects great number of small computer nodes, using fixed hypercube topology, characterized by point-to-point links between nodes.

A multi-hop teleportation protocol of arbitrary four-qubit states through intermediate nodes

NASA Astrophysics Data System (ADS)

Choudhury, Binayak S.; Samanta, Soumen

Teleportation processes over long distances become affected by the almost inevitable existence of noise which interferes with the entangled quantum channels. In view of this, intermediate nodes are introduced in the scheme. These nodes are connected in series through quantum entanglement. In this paper, we present a protocol for transferring an entangled four-particle cluster-type state in an integrated manner through the intermediate nodes. Its efficiency and advantage over the corresponding part by part teleportation process is discussed.

In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection

NASA Astrophysics Data System (ADS)

Albano, Michele; Gao, Jie

In a sensor network of n nodes in which k of them have sensed interesting data, we perform in-network erasure coding such that each node stores a linear combination of all the network data with random coefficients. This scheme greatly improves data resilience to node failures: as long as there are k nodes that survive an attack, all the data produced in the sensor network can be recovered with high probability. The in-network coding storage scheme also improves data collection rate by mobile mules and allows for easy scheduling of data mules.

Minimum spanning tree analysis of the human connectome.

PubMed

van Dellen, Edwin; Sommer, Iris E; Bohlken, Marc M; Tewarie, Prejaas; Draaisma, Laurijn; Zalesky, Andrew; Di Biase, Maria; Brown, Jesse A; Douw, Linda; Otte, Willem M; Mandl, René C W; Stam, Cornelis J

2018-06-01

One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections. In this study, we used minimum spanning tree (MST; a unique, acyclic subnetwork with a fixed number of connections) analysis to characterize the human brain network to create an empirical reference network. Such a reference network could be used as a null model of connections that form the backbone structure of the human brain. We analyzed the MST in three diffusion-weighted imaging datasets of healthy adults. The MST of the group mean connectivity matrix was used as the empirical null-model. The MST of individual subjects matched this reference MST for a mean 58%-88% of connections, depending on the analysis pipeline. Hub nodes in the MST matched with previously reported locations of hub regions, including the so-called rich club nodes (a subset of high-degree, highly interconnected nodes). Although most brain network studies have focused primarily on cortical connections, cortical-subcortical connections were consistently present in the MST across subjects. Brain network efficiency was higher when these connections were included in the analysis, suggesting that these tracts may be utilized as the major neural communication routes. Finally, we confirmed that MST characteristics index the effects of brain aging. We conclude that the MST provides an elegant and straightforward approach to analyze structural brain networks, and to test network topological features of individual subjects in comparison to empirical null models. © 2018 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.

Announcing Supercomputer Summit

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wells, Jack; Bland, Buddy; Nichols, Jeff

Summit is the next leap in leadership-class computing systems for open science. With Summit we will be able to address, with greater complexity and higher fidelity, questions concerning who we are, our place on earth, and in our universe. Summit will deliver more than five times the computational performance of Titan’s 18,688 nodes, using only approximately 3,400 nodes when it arrives in 2017. Like Titan, Summit will have a hybrid architecture, and each node will contain multiple IBM POWER9 CPUs and NVIDIA Volta GPUs all connected together with NVIDIA’s high-speed NVLink. Each node will have over half a terabyte ofmore » coherent memory (high bandwidth memory + DDR4) addressable by all CPUs and GPUs plus 800GB of non-volatile RAM that can be used as a burst buffer or as extended memory. To provide a high rate of I/O throughput, the nodes will be connected in a non-blocking fat-tree using a dual-rail Mellanox EDR InfiniBand interconnect. Upon completion, Summit will allow researchers in all fields of science unprecedented access to solving some of the world’s most pressing challenges.« less

A framework for detecting communities of unbalanced sizes in networks

NASA Astrophysics Data System (ADS)

Žalik, Krista Rizman; Žalik, Borut

2018-01-01

Community detection in large networks has been a focus of recent research in many of fields, including biology, physics, social sciences, and computer science. Most community detection methods partition the entire network into communities, groups of nodes that have many connections within communities and few connections between them and do not identify different roles that nodes can have in communities. We propose a community detection model that integrates more different measures that can fast identify communities of different sizes and densities. We use node degree centrality, strong similarity with one node from community, maximal similarity of node to community, compactness of communities and separation between communities. Each measure has its own strength and weakness. Thus, combining different measures can benefit from the strengths of each one and eliminate encountered problems of using an individual measure. We present a fast local expansion algorithm for uncovering communities of different sizes and densities and reveals rich information on input networks. Experimental results show that the proposed algorithm is better or as effective as the other community detection algorithms for both real-world and synthetic networks while it requires less time.

Synchronization and long-time memory in neural networks with inhibitory hubs and synaptic plasticity

NASA Astrophysics Data System (ADS)

Bertolotti, Elena; Burioni, Raffaella; di Volo, Matteo; Vezzani, Alessandro

2017-01-01

We investigate the dynamical role of inhibitory and highly connected nodes (hub) in synchronization and input processing of leaky-integrate-and-fire neural networks with short term synaptic plasticity. We take advantage of a heterogeneous mean-field approximation to encode the role of network structure and we tune the fraction of inhibitory neurons fI and their connectivity level to investigate the cooperation between hub features and inhibition. We show that, depending on fI, highly connected inhibitory nodes strongly drive the synchronization properties of the overall network through dynamical transitions from synchronous to asynchronous regimes. Furthermore, a metastable regime with long memory of external inputs emerges for a specific fraction of hub inhibitory neurons, underlining the role of inhibition and connectivity also for input processing in neural networks.

Growth and structure of the World Wide Web: Towards realistic modeling

NASA Astrophysics Data System (ADS)

Tadić, Bosiljka

2002-08-01

We simulate evolution of the World Wide Web from the dynamic rules incorporating growth, bias attachment, and rewiring. We show that the emergent double-hierarchical structure with distinct distributions of out- and in-links is comparable with the observed empirical data when the control parameter (average graph flexibility β) is kept in the range β=3-4. We then explore the Web graph by simulating (a) Web crawling to determine size and depth of connected components, and (b) a random walker that discovers the structure of connected subgraphs with dominant attractor and promoter nodes. A random walker that adapts its move strategy to mimic local node linking preferences is shown to have a short access time to "important" nodes on the Web graph.

An unusual 2p-3d-4f heterometallic coordination polymer featuring Ln8Na and Cu8I clusters as nodes

NASA Astrophysics Data System (ADS)

Zhao, Mingjuan; Chen, Shimin; Huang, Yutian; Dan, Youmeng

2017-01-01

A new cluster-based three-dimensional 2p-3d-4f heterometallic framework {[Ho8Na(OH)6Cu16I2(CPT)24](NO3)9(H2O)6(CH3CN)18}n (1, HCPT = 4-(4-carboxyphenyl)-1,2,4 triazole) has been prepared under solvothermal condition by using a custom-designed bifunctional organic ligand. The single-crystal structure analysis reveals that this framework features novel Ln8Na and Cu8I clusters as nodes, these nodes are further connected by the CPT ligands to give rise to a (6,14)-connected network. The magnetic property of this framework has also been investigated.

Properties of centralized cooperative sensing in cognitive radio networks

NASA Astrophysics Data System (ADS)

Skokowski, Paweł; Malon, Krzysztof; Łopatka, Jerzy

2017-04-01

Spectrum sensing is a functionality that enables network creation in the cognitive radio technology. Spectrum sensing is use for building the situation awareness knowledge for better use of radio resources and to adjust network parameters in case of jamming, interferences from legacy systems, decreasing link quality caused e.g. by nodes positions changes. This paper presents results from performed tests to compare cooperative centralized sensing versus local sensing. All tests were performed in created simulator developed in Matlab/Simulink environment.

KSC-04pd1676

NASA Image and Video Library

2004-08-24

KENNEDY SPACE CENTER, FLA. - In the Space Station Processing Facility, a worker observes data from the Traveled Work Systems Test (TWST) conducted on the Node 2. The TWST executes open work that traveled with the Node 2 from Italy and simulates the on-orbit activation sequence. Node 2 was powered up Aug. 19 for the testing. The second of three Space Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Node 2 is scheduled to launch on mission STS-120, assembly flight 10A to the International Space Station.

Field test of a practical secure communication network with decoy-state quantum cryptography.

PubMed

Chen, Teng-Yun; Liang, Hao; Liu, Yang; Cai, Wen-Qi; Ju, Lei; Liu, Wei-Yue; Wang, Jian; Yin, Hao; Chen, Kai; Chen, Zeng-Bing; Peng, Cheng-Zhi; Pan, Jian-Wei

2009-04-13

We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption.

Surname complex network for Brazil and Portugal

NASA Astrophysics Data System (ADS)

Ferreira, G. D.; Viswanathan, G. M.; da Silva, L. R.; Herrmann, H. J.

2018-06-01

We present a study of social networks based on the analysis of Brazilian and Portuguese family names (surnames). We construct networks whose nodes are names of families and whose edges represent parental relations between two families. From these networks we extract the connectivity distribution, clustering coefficient, shortest path and centrality. We find that the connectivity distribution follows an approximate power law. We associate the number of hubs, centrality and entropy to the degree of miscegenation in the societies in both countries. Our results show that Portuguese society has a higher miscegenation degree than Brazilian society. All networks analyzed lead to approximate inverse square power laws in the degree distribution. We conclude that the thermodynamic limit is reached for small networks (3 or 4 thousand nodes). The assortative mixing of all networks is negative, showing that the more connected vertices are connected to vertices with lower connectivity. Finally, the network of surnames presents some small world characteristics.

Broadcasting collective operation contributions throughout a parallel computer

DOEpatents

Faraj, Ahmad [Rochester, MN

2012-02-21

Methods, systems, and products are disclosed for broadcasting collective operation contributions throughout a parallel computer. The parallel computer includes a plurality of compute nodes connected together through a data communications network. Each compute node has a plurality of processors for use in collective parallel operations on the parallel computer. Broadcasting collective operation contributions throughout a parallel computer according to embodiments of the present invention includes: transmitting, by each processor on each compute node, that processor's collective operation contribution to the other processors on that compute node using intra-node communications; and transmitting on a designated network link, by each processor on each compute node according to a serial processor transmission sequence, that processor's collective operation contribution to the other processors on the other compute nodes using inter-node communications.

Information Selection in Intelligence Processing

DTIC Science & Technology

2011-12-01

given. Edges connecting nodes representing irrelevant persons with either relevant or irrelevant persons are added randomly, as in an Erdos- Renyi ...graph (Erdos at Renyi , 1959): For each irrelevant node i , and another node j (either relevant or irrelevant) there is a predetermined probability that...statistics for engineering and the sciences (7th ed.). Boston: Duxbury Press. Erdos, P., & Renyi , A. (1959). “On Random Graphs,” Publicationes

Methods and apparatus for controlling respective load currents of multiple series-connected loads

DOEpatents

Datta, Michael; Lys, Ihor

2014-05-27

A lighting apparatus (100) includes one or more first LEDs (202) for generating a first spectrum of radiation (503), and one or more second LEDs (204) for generating a second different spectrum radiation (505). The first and second LEDs are electrically connected in series between a first node (516A) and a second node (516B), between which a series current (550) flows with the application of an operating voltage (516) across the nodes. A controllable current path (518) is connected in parallel with one or both of the first and second LEDs so as to at least partially divert the series current, such that a first current (552) through the first LED(s) and a second current (554) through the second LED(s) are different. Such current diversion techniques may be employed to compensate for shifts in color or color temperature of generated light during thermal transients, due to different temperature-dependent current-to-flux relationships for different types of LEDs.

International Space Station Node 1 is moved for leak test

NASA Technical Reports Server (NTRS)

1998-01-01

Node 1, the first element for the International Space Station, and attached Pressurized Mating Adapter-1 continue with prelaunch preparation activities at KSC's Space Station Processing Facility. Node 1 is a connecting passageway to the living and working areas of the space station. The node is seen here being moved into the Shuttle payload transportation canister, where the doors will be closed for a two-week leak check. The node was moved to the canister from the element rotation stand, or test stand, where it underwent an interim weight and center of gravity determination. The final determination is planned to be performed prior to transporting Node 1 to the launch pad. Node 1 is scheduled to fly on STS-88.

International Space Station Node 1 is moved for leak test

NASA Technical Reports Server (NTRS)

1998-01-01

Node 1, the first U.S. element for the International Space Station, and attached Pressurized Mating Adapter-1 continue with prelaunch preparation activities at KSC's Space Station Processing Facility. Node 1 is a connecting passageway to the living and working areas of the space station. The node and PMA-1 are being removed from the element rotation stand, or test stand, where they underwent an interim weight and center of gravity determination. (The final determination is planned to be performed prior to transporting Node 1 to the launch pad.) Now the node is being moved to the Shuttle payload transportation canister, where the doors will be closed for a two-week leak check. Node 1 is scheduled to fly on STS-88.

Bad data packet capture device

DOEpatents

Chen, Dong; Gara, Alan; Heidelberger, Philip; Vranas, Pavlos

2010-04-20

An apparatus and method for capturing data packets for analysis on a network computing system includes a sending node and a receiving node connected by a bi-directional communication link. The sending node sends a data transmission to the receiving node on the bi-directional communication link, and the receiving node receives the data transmission and verifies the data transmission to determine valid data and invalid data and verify retransmissions of invalid data as corresponding valid data. A memory device communicates with the receiving node for storing the invalid data and the corresponding valid data. A computing node communicates with the memory device and receives and performs an analysis of the invalid data and the corresponding valid data received from the memory device.

Design and validation of a wearable "DRL-less" EEG using a novel fully-reconfigurable architecture.

PubMed

Mahajan, Ruhi; Morshed, Bashir I; Bidelman, Gavin M

2016-08-01

The conventional EEG system consists of a driven-right-leg (DRL) circuit, which prohibits modularization of the system. We propose a Lego-like connectable fully reconfigurable architecture of wearable EEG that can be easily customized and deployed at naturalistic settings for collecting neurological data. We have designed a novel Analog Front End (AFE) that eliminates the need for DRL while maintaining a comparable signal quality of EEG. We have prototyped this AFE for a single channel EEG, referred to as Smart Sensing Node (SSN), that senses brain signals and sends it to a Command Control Node (CCN) via an I2C bus. The AFE of each SSN (referential-montage) consists of an off-the-shelf instrumentation amplifier (gain=26), an active notch filter fc = 60Hz), 2nd-order active Butterworth low-pass filter followed by a passive low pass filter (fc = 47.5 Hz, gain = 1.61) and a passive high pass filter fc = 0.16 Hz, gain = 0.83). The filtered signals are digitized using a low-power microcontroller (MSP430F5528) with a 12-bit ADC at 512 sps, and transmitted to the CCN every 1 s at a bus rate of 100 kbps. The CCN can further transmit this data wirelessly using Bluetooth to the paired computer at a baud rate of 115.2 kbps. We have compared temporal and frequency-domain EEG signals of our system with a research-grade EEG. Results show that the proposed reconfigurable EEG captures comparable signals, and is thus promising for practical routine neurological monitoring in non-clinical settings where a flexible number of EEG channels are needed.

Implementation of Distributed Services for a Deep Sea Moored Instrument Network

NASA Astrophysics Data System (ADS)

Oreilly, T. C.; Headley, K. L.; Risi, M.; Davis, D.; Edgington, D. R.; Salamy, K. A.; Chaffey, M.

2004-12-01

The Monterey Ocean Observing System (MOOS) is a moored observatory network consisting of interconnected instrument nodes on the sea surface, midwater, and deep sea floor. We describe Software Infrastructure and Applications for MOOS ("SIAM"), which implement the management, control, and data acquisition infrastructure for the moored observatory. Links in the MOOS network include fiber-optic and 10-BaseT copper connections between the at-sea nodes. A Globalstar satellite transceiver or 900 MHz Freewave terrestrial line-of-sight RF modem provides the link to shore. All of these links support Internet protocols, providing TCP/IP connectivity throughout a system that extends from shore to sensor nodes at the air-sea interface, through the oceanic water column to a benthic network of sensor nodes extending across the deep sea floor. Exploiting this TCP/IP infrastructure as well as capabilities provided by MBARI's MOOS mooring controller, we use powerful Internet software technologies to implement a distributed management, control and data acquisition system for the moored observatory. The system design meets the demanding functional requirements specified for MOOS. Nodes and their instruments are represented by Java RMI "services" having well defined software interfaces. Clients anywhere on the network can interact with any node or instrument through its corresponding service. A client may be on the same node as the service, may be on another node, or may reside on shore. Clients may be human, e.g. when a scientist on shore accesses a deployed instrument in real-time through a user interface. Clients may also be software components that interact autonomously with instruments and nodes, e.g. for purposes such as system resource management or autonomous detection and response to scientifically interesting events. All electrical power to the moored network is provided by solar and wind energy, and the RF shore-to-mooring links are intermittent and relatively low-bandwidth connections. Thus power and wireless bandwidth are limited resources that constrain our choice of service technologies and wireless access strategy. We describe and evaluate system performance in light of actual deployment of observatory elements in Monterey Bay, and discuss how the system can be developed further. We also consider management and control strategies for the cable-to-shore observatory known as MARS ("Monterey Accelerated Research System"). The MARS cable will provide high power and continuous high-bandwidth connectivity between seafloor instrument nodes and shore, thus removing key limitations of the moored observatory. Moreover MARS functional requirements may differ significantly from MOOS requirements. In light of these differences, we discuss how elements of our MOOS moored observatory architecture might be adapted to MARS.

CoAP-Based Mobility Management for the Internet of Things

PubMed Central

Chun, Seung-Man; Kim, Hyun-Su; Park, Jong-Tae

2015-01-01

Most of the current mobility management protocols such as Mobile IP and its variants standardized by the IETF may not be suitable to support mobility management for Web-based applications in an Internet of Things (IoT) environment. This is because the sensor nodes have limited power capacity, usually operating in sleep/wakeup mode in a constrained wireless network. In addition, sometimes the sensor nodes may act as the server using the CoAP protocol in an IoT environment. This makes it difficult for Web clients to properly retrieve the sensing data from the mobile sensor nodes in an IoT environment. In this article, we propose a mobility management protocol, named CoMP, which can effectively retrieve the sensing data of sensor nodes while they are moving. The salient feature of CoMP is that it makes use of the IETF CoAP protocol for mobility management, instead of using Mobile IP. Thus CoMP can eliminates the additional signaling overhead of Mobile IP, provides reliable mobility management, and prevents the packet loss. CoMP employs a separate location management server to keep track of the location of the mobile sensor nodes. In order to prevent the loss of important sensing data during movement, a holding mode of operation has been introduced. All the signaling procedures including discovery, registration, binding and holding have been designed by extending the IETF CoAP protocol. The numerical analysis and simulation have been done for performance evaluation in terms of the handover latency and packet loss. The results show that the proposed CoMP is superior to previous mobility management protocols, i.e., Mobile IPv4/v6 (MIPv4/v6), Hierarchical Mobile IPv4/v6 (HMIPv4/v6), in terms of the handover latency and packet loss. PMID:26151214

Application Level Processing for Long-Lived and Information Rich Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Wilkins, R.; Gaura, E.; Brusey, J.

2013-12-01

A primary design goal in Wireless Sensor Networks (WSNs) is to ensure the longest possible node lifetime with the available power budget while still meeting application requirements. Since radio transmissions often consume the most power in WSN devices, it follows that a node should aim to maximise its lifetime by transmitting only the data or information required to enable the motivating application. Full raw data streams are often not required since summaries of data are sufficient to meet application needs summaries are often performed at a central point after collection). When raw data is not a requirement, it makes sense to perform as much application-specific processing on-node as possible to minimise the amount of transmissions a node must make. For example, in home environment monitoring, the amount of time a room spends within an acceptable temperature range is more important than the raw stream of temperature measurements. The work presents Bare Necessities (BN) which implements the calculation of application-specific summaries on-node. In the case of knowing the amount time a room spends within an acceptable temperature range, BN encodes the raw signal as a distribution over bins (e.g. a bin might comprise temperatures between 18 °C and 22 °C). BN conserves power by only transmitting when changes to the distribution occur only sending the bare necessities of information the end user is interested in (thus the algorithm name). In the case of home monitoring it has been shown that BN can lead to a packet transmission reduction of 99.98%, increasing a nodes lifetime by a factor of 14 when compared to sense-and-send nodes. A summary of the Bare Necessities process at the node.

Design and Verification of Remote Sensing Image Data Center Storage Architecture Based on Hadoop

NASA Astrophysics Data System (ADS)

Tang, D.; Zhou, X.; Jing, Y.; Cong, W.; Li, C.

2018-04-01

The data center is a new concept of data processing and application proposed in recent years. It is a new method of processing technologies based on data, parallel computing, and compatibility with different hardware clusters. While optimizing the data storage management structure, it fully utilizes cluster resource computing nodes and improves the efficiency of data parallel application. This paper used mature Hadoop technology to build a large-scale distributed image management architecture for remote sensing imagery. Using MapReduce parallel processing technology, it called many computing nodes to process image storage blocks and pyramids in the background to improve the efficiency of image reading and application and sovled the need for concurrent multi-user high-speed access to remotely sensed data. It verified the rationality, reliability and superiority of the system design by testing the storage efficiency of different image data and multi-users and analyzing the distributed storage architecture to improve the application efficiency of remote sensing images through building an actual Hadoop service system.

Sampling networks with prescribed degree correlations

NASA Astrophysics Data System (ADS)

Del Genio, Charo; Bassler, Kevin; Erdos, Péter; Miklos, István; Toroczkai, Zoltán

2014-03-01

A feature of a network known to affect its structural and dynamical properties is the presence of correlations amongst the node degrees. Degree correlations are a measure of how much the connectivity of a node influences the connectivity of its neighbours, and they are fundamental in the study of processes such as the spreading of information or epidemics, the cascading failures of damaged systems and the evolution of social relations. We introduce a method, based on novel mathematical results, that allows the exact sampling of networks where the number of connections between nodes of any given connectivity is specified. Our algorithm provides a weight associated to each sample, thereby allowing network observables to be measured according to any desired distribution, and it is guaranteed to always terminate successfully in polynomial time. Thus, our new approach provides a preferred tool for scientists to model complex systems of current relevance, and enables researchers to precisely study correlated networks with broad societal importance. CIDG acknowledges support by the European Commission's FP7 through grant No. 288021. KEB acknowledges support from the NSF through grant DMR?1206839. KEB, PE, IM and ZT acknowledge support from AFSOR and DARPA through grant FA?9550-12-1-0405.

Reconfigurable routing protocol for free space optical sensor networks.

PubMed

Xie, Rong; Yang, Won-Hyuk; Kim, Young-Chon

2012-01-01

Recently, free space optical sensor networks (FSOSNs), which are based on free space optics (FSO) instead of radio frequency (RF), have gained increasing visibility over traditional wireless sensor networks (WSNs) due to their advantages such as larger capacity, higher security, and lower cost. However, the performance of FSOSNs is restricted to the requirement of a direct line-of-sight (LOS) path between a sender and a receiver pair. Once a node dies of energy depletion, the network would probably suffer from a dramatic decrease of connectivity, resulting in a huge loss of data packets. Thus, this paper proposes a reconfigurable routing protocol (RRP) to overcome this problem by dynamically reconfiguring the network virtual topology. The RRP works in three phases: (1) virtual topology construction, (2) routing establishment, and (3) reconfigurable routing. When data transmission begins, the data packets are first routed through the shortest hop paths. Then a reconfiguration is initiated by the node whose residual energy falls below a threshold. Nodes affected by this dying node are classified into two types, namely maintenance nodes and adjustment nodes, and they are reconfigured according to the types. An energy model is designed to evaluate the performance of RRP through OPNET simulation. Our simulation results indicate that the RRP achieves better performance compared with the simple-link protocol and a direct reconfiguration scheme in terms of connectivity, network lifetime, packet delivery ratio and the number of living nodes.

PeerShield: determining control and resilience criticality of collaborative cyber assets in networks

NASA Astrophysics Data System (ADS)

Cam, Hasan

2012-06-01

As attackers get more coordinated and advanced in cyber attacks, cyber assets are required to have much more resilience, control effectiveness, and collaboration in networks. Such a requirement makes it essential to take a comprehensive and objective approach for measuring the individual and relative performances of cyber security assets in network nodes. To this end, this paper presents four techniques as to how the relative importance of cyber assets can be measured more comprehensively and objectively by considering together the main variables of risk assessment (e.g., threats, vulnerabilities), multiple attributes (e.g., resilience, control, and influence), network connectivity and controllability among collaborative cyber assets in networks. In the first technique, a Bayesian network is used to include the random variables for control, recovery, and resilience attributes of nodes, in addition to the random variables of threats, vulnerabilities, and risk. The second technique shows how graph matching and coloring can be utilized to form collaborative pairs of nodes to shield together against threats and vulnerabilities. The third technique ranks the security assets of nodes by incorporating multiple weights and thresholds of attributes into a decision-making algorithm. In the fourth technique, the hierarchically well-separated tree is enhanced to first identify critical nodes of a network with respect to their attributes and network connectivity, and then selecting some nodes as driver nodes for network controllability.

Adaption of the temporal correlation coefficient calculation for temporal networks (applied to a real-world pig trade network).

PubMed

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

The average topological overlap of two graphs of two consecutive time steps measures the amount of changes in the edge configuration between the two snapshots. This value has to be zero if the edge configuration changes completely and one if the two consecutive graphs are identical. Current methods depend on the number of nodes in the network or on the maximal number of connected nodes in the consecutive time steps. In the first case, this methodology breaks down if there are nodes with no edges. In the second case, it fails if the maximal number of active nodes is larger than the maximal number of connected nodes. In the following, an adaption of the calculation of the temporal correlation coefficient and of the topological overlap of the graph between two consecutive time steps is presented, which shows the expected behaviour mentioned above. The newly proposed adaption uses the maximal number of active nodes, i.e. the number of nodes with at least one edge, for the calculation of the topological overlap. The three methods were compared with the help of vivid example networks to reveal the differences between the proposed notations. Furthermore, these three calculation methods were applied to a real-world network of animal movements in order to detect influences of the network structure on the outcome of the different methods.

Limited-path-length entanglement percolation in quantum complex networks

NASA Astrophysics Data System (ADS)

Cuquet, Martí; Calsamiglia, John

2011-03-01

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

Network Robustness: the whole story

NASA Astrophysics Data System (ADS)

Longjas, A.; Tejedor, A.; Zaliapin, I. V.; Ambroj, S.; Foufoula-Georgiou, E.

2014-12-01

A multitude of actual processes operating on hydrological networks may exhibit binary outcomes such as clean streams in a river network that may become contaminated. These binary outcomes can be modeled by node removal processes (attacks) acting in a network. Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. However, the current definition of robustness is only accounting for the connectivity of the nodes unaffected by the attack. Here, we put forward the idea that the connectivity of the affected nodes can play a crucial role in proper evaluation of the overall network robustness and its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and the efficiency of building-up the IN. This approach is motivated by concrete applied problems, since, for example, if we study the dynamics of contamination in river systems, it is necessary to know both the connectivity of the healthy and contaminated parts of the river to assess its ecological functionality. We show that trade-offs between the efficiency of the Active and Idle network dynamics give rise to surprising crossovers and re-ranking of different attack strategies, pointing to significant implications for decision making.

A Component-Based Diffusion Model With Structural Diversity for Social Networks.

PubMed

Qing Bao; Cheung, William K; Yu Zhang; Jiming Liu

2017-04-01

Diffusion on social networks refers to the process where opinions are spread via the connected nodes. Given a set of observed information cascades, one can infer the underlying diffusion process for social network analysis. The independent cascade model (IC model) is a widely adopted diffusion model where a node is assumed to be activated independently by any one of its neighbors. In reality, how a node will be activated also depends on how its neighbors are connected and activated. For instance, the opinions from the neighbors of the same social group are often similar and thus redundant. In this paper, we extend the IC model by considering that: 1) the information coming from the connected neighbors are similar and 2) the underlying redundancy can be modeled using a dynamic structural diversity measure of the neighbors. Our proposed model assumes each node to be activated independently by different communities (or components) of its parent nodes, each weighted by its effective size. An expectation maximization algorithm is derived to infer the model parameters. We compare the performance of the proposed model with the basic IC model and its variants using both synthetic data sets and a real-world data set containing news stories and Web blogs. Our empirical results show that incorporating the community structure of neighbors and the structural diversity measure into the diffusion model significantly improves the accuracy of the model, at the expense of only a reasonable increase in run-time.

Structure, Function, and Propagation of Information across Living Two, Four, and Eight Node Degree Topologies.

PubMed

Alagapan, Sankaraleengam; Franca, Eric; Pan, Liangbin; Leondopulos, Stathis; Wheeler, Bruce C; DeMarse, Thomas B

2016-01-01

In this study, we created four network topologies composed of living cortical neurons and compared resultant structural-functional dynamics including the nature and quality of information transmission. Each living network was composed of living cortical neurons and were created using microstamping of adhesion promoting molecules and each was "designed" with different levels of convergence embedded within each structure. Networks were cultured over a grid of electrodes that permitted detailed measurements of neural activity at each node in the network. Of the topologies we tested, the "Random" networks in which neurons connect based on their own intrinsic properties transmitted information embedded within their spike trains with higher fidelity relative to any other topology we tested. Within our patterned topologies in which we explicitly manipulated structure, the effect of convergence on fidelity was dependent on both topology and time-scale (rate vs. temporal coding). A more detailed examination using tools from network analysis revealed that these changes in fidelity were also associated with a number of other structural properties including a node's degree, degree-degree correlations, path length, and clustering coefficients. Whereas information transmission was apparent among nodes with few connections, the greatest transmission fidelity was achieved among the few nodes possessing the highest number of connections (high degree nodes or putative hubs). These results provide a unique view into the relationship between structure and its affect on transmission fidelity, at least within these small neural populations with defined network topology. They also highlight the potential role of tools such as microstamp printing and microelectrode array recordings to construct and record from arbitrary network topologies to provide a new direction in which to advance the study of structure-function relationships.

Vulnerability of animal trade networks to the spread of infectious diseases: a methodological approach applied to evaluation and emergency control strategies in cattle, France, 2005.

PubMed

Rautureau, S; Dufour, B; Durand, B

2011-04-01

Besides farming, trade of livestock is a major component of agricultural economy. However, the networks generated by live animal movements are the major support for the propagation of infectious agents between farms, and their structure strongly affects how fast a disease may spread. Structural characteristics may thus be indicators of network vulnerability to the spread of infectious disease. The method proposed here is based upon the analysis of specific subnetworks: the giant strongly connected components (GSCs). Their existence, size and geographic extent are used to assess network vulnerability. Their disappearance when targeted nodes are removed allows studying how network vulnerability may be controlled under emergency conditions. The method was applied to the cattle trade network in France, 2005. Giant strongly connected components were present and widely spread all over the country in yearly, monthly and weekly networks. Among several tested approaches, the most efficient way to make GSCs disappear was based on the ranking of nodes by decreasing betweenness centrality (the proportion of shortest paths between nodes on which a specific node lies). Giant strongly connected components disappearance was obtained after removal of <1% of network nodes. Under emergency conditions, suspending animal trade activities in a small subset of holdings may thus allow to control the spread of an infectious disease through the animal trade network. Nodes representing markets and dealers were widely affected by these simulated control measures. This confirms their importance as 'hubs' for infectious diseases spread. Besides emergency conditions, specific sensitization and preventive measures should be dedicated to this population. © 2010 Blackwell Verlag GmbH.

Three faces of node importance in network epidemiology: Exact results for small graphs

NASA Astrophysics Data System (ADS)

Holme, Petter

2017-12-01

We investigate three aspects of the importance of nodes with respect to susceptible-infectious-removed (SIR) disease dynamics: influence maximization (the expected outbreak size given a set of seed nodes), the effect of vaccination (how much deleting nodes would reduce the expected outbreak size), and sentinel surveillance (how early an outbreak could be detected with sensors at a set of nodes). We calculate the exact expressions of these quantities, as functions of the SIR parameters, for all connected graphs of three to seven nodes. We obtain the smallest graphs where the optimal node sets are not overlapping. We find that (i) node separation is more important than centrality for more than one active node, (ii) vaccination and influence maximization are the most different aspects of importance, and (iii) the three aspects are more similar when the infection rate is low.

Experimental tests and numerical analyses of steel truss bridge gusset connections.

DOT National Transportation Integrated Search

2012-11-01

Gusset plates connect individual steel truss bridge members together at a node. In 10% of the 200,000 steel bridges in US in 2008, failure of a : single truss or connection could lead to collapse. Regular inspection and load rating are essential for ...

KENNEDY SPACE CENTER, FLA. - Astronaut Tim Kopra aids in Intravehicular Activity (IVA) constraints testing on the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

NASA Image and Video Library

2004-02-03

KENNEDY SPACE CENTER, FLA. - Astronaut Tim Kopra aids in Intravehicular Activity (IVA) constraints testing on the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

KENNEDY SPACE CENTER, FLA. - In the Space Station Processing Facility, workers check over the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

NASA Image and Video Library

2004-02-03

KENNEDY SPACE CENTER, FLA. - In the Space Station Processing Facility, workers check over the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

A game-theoretic approach to optimize ad hoc networks inspired by small-world network topology

NASA Astrophysics Data System (ADS)

Tan, Mian; Yang, Tinghong; Chen, Xing; Yang, Gang; Zhu, Guoqing; Holme, Petter; Zhao, Jing

2018-03-01

Nodes in ad hoc networks are connected in a self-organized manner. Limited communication radius makes information transmit in multi-hop mode, and each forwarding needs to consume the energy of nodes. Insufficient communication radius or exhaustion of energy may cause the absence of some relay nodes and links, further breaking network connectivity. On the other hand, nodes in the network may refuse to cooperate due to objective faulty or personal selfish, hindering regular communication in the network. This paper proposes a model called Repeated Game in Small World Networks (RGSWN). In this model, we first construct ad hoc networks with small-world feature by forming "communication shortcuts" between multiple-radio nodes. Small characteristic path length reduces average forwarding times in networks; meanwhile high clustering coefficient enhances network robustness. Such networks still maintain relative low global power consumption, which is beneficial to extend the network survival time. Then we use MTTFT strategy (Mend-Tolerance Tit-for-Tat) for repeated game as a rule for the interactions between neighbors in the small-world networks. Compared with other five strategies of repeated game, this strategy not only punishes the nodes' selfishness more reasonably, but also has the best tolerance to the network failure. This work is insightful for designing an efficient and robust ad hoc network.

Model Checking A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2012-01-01

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV) for a subset of digraphs. Modeling challenges of the protocol and the system are addressed. The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period.

A novel topology control approach to maintain the node degree in dynamic wireless sensor networks.

PubMed

Huang, Yuanjiang; Martínez, José-Fernán; Díaz, Vicente Hernández; Sendra, Juana

2014-03-07

Topology control is an important technique to improve the connectivity and the reliability of Wireless Sensor Networks (WSNs) by means of adjusting the communication range of wireless sensor nodes. In this paper, a novel Fuzzy-logic Topology Control (FTC) is proposed to achieve any desired average node degree by adaptively changing communication range, thus improving the network connectivity, which is the main target of FTC. FTC is a fully localized control algorithm, and does not rely on location information of neighbors. Instead of designing membership functions and if-then rules for fuzzy-logic controller, FTC is constructed from the training data set to facilitate the design process. FTC is proved to be accurate, stable and has short settling time. In order to compare it with other representative localized algorithms (NONE, FLSS, k-Neighbor and LTRT), FTC is evaluated through extensive simulations. The simulation results show that: firstly, similar to k-Neighbor algorithm, FTC is the best to achieve the desired average node degree as node density varies; secondly, FTC is comparable to FLSS and k-Neighbor in terms of energy-efficiency, but is better than LTRT and NONE; thirdly, FTC has the lowest average maximum communication range than other algorithms, which indicates that the most energy-consuming node in the network consumes the lowest power.

In/Out Status Monitoring in Mobile Asset Tracking with Wireless Sensor Networks

PubMed Central

Kim, Kwangsoo; Chung, Chin-Wan

2010-01-01

A mobile asset with a sensor node in a mobile asset tracking system moves around a monitoring area, leaves it, and then returns to the region repeatedly. The system monitors the in/out status of the mobile asset. Due to the continuous movement of the mobile asset, the system may generate an error for the in/out status of the mobile asset. When the mobile asset is inside the region, the system might determine that it is outside, or vice versa. In this paper, we propose a method to detect and correct the incorrect in/out status of the mobile asset. To solve this problem, our approach uses data about the connection state transition and the battery lifetime of the mobile node attached to the mobile asset. The connection state transition is used to classify the mobile node as normal or abnormal. The battery lifetime is used to predict a valid working period for the mobile node. We evaluate our method using real data generated by a medical asset tracking system. The experimental results show that our method, by using the estimated battery life time or by using the invalid connection state, can detect and correct most cases of incorrect in/out statuses generated by the conventional approach. PMID:22319268

In/out status monitoring in mobile asset tracking with wireless sensor networks.

PubMed

Kim, Kwangsoo; Chung, Chin-Wan

2010-01-01

A mobile asset with a sensor node in a mobile asset tracking system moves around a monitoring area, leaves it, and then returns to the region repeatedly. The system monitors the in/out status of the mobile asset. Due to the continuous movement of the mobile asset, the system may generate an error for the in/out status of the mobile asset. When the mobile asset is inside the region, the system might determine that it is outside, or vice versa. In this paper, we propose a method to detect and correct the incorrect in/out status of the mobile asset. To solve this problem, our approach uses data about the connection state transition and the battery lifetime of the mobile node attached to the mobile asset. The connection state transition is used to classify the mobile node as normal or abnormal. The battery lifetime is used to predict a valid working period for the mobile node. We evaluate our method using real data generated by a medical asset tracking system. The experimental results show that our method, by using the estimated battery life time or by using the invalid connection state, can detect and correct most cases of incorrect in/out statuses generated by the conventional approach.

Landslide and Flood Warning System Prototypes based on Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Hloupis, George; Stavrakas, Ilias; Triantis, Dimos

2010-05-01

Wireless sensor networks (WSNs) are one of the emerging areas that received great attention during the last few years. This is mainly due to the fact that WSNs have provided scientists with the capability of developing real-time monitoring systems equipped with sensors based on Micro-Electro-Mechanical Systems (MEMS). WSNs have great potential for many applications in environmental monitoring since the sensor nodes that comprised from can host several MEMS sensors (such as temperature, humidity, inertial, pressure, strain-gauge) and transducers (such as position, velocity, acceleration, vibration). The resulting devices are small and inexpensive but with limited memory and computing resources. Each sensor node contains a sensing module which along with an RF transceiver. The communication is broadcast-based since the network topology can change rapidly due to node failures [1]. Sensor nodes can transmit their measurements to central servers through gateway nodes without any processing or they make preliminary calculations locally in order to produce results that will be sent to central servers [2]. Based on the above characteristics, two prototypes using WSNs are presented in this paper: A Landslide detection system and a Flood warning system. Both systems sent their data to central processing server where the core of processing routines exists. Transmission is made using Zigbee and IEEE 802.11b protocol but is capable to use VSAT communication also. Landslide detection system uses structured network topology. Each measuring node comprises of a columnar module that is half buried to the area under investigation. Each sensing module contains a geophone, an inclinometer and a set of strain gauges. Data transmitted to central processing server where possible landslide evolution is monitored. Flood detection system uses unstructured network topology since the failure rate of sensor nodes is expected higher. Each sensing module contains a custom water level sensor (based on plastic optical fiber). Data transmitted directly to server where the early warning algorithms monitor the water level variations in real time. Both sensor nodes use power harvesting techniques in order to extend their battery life as much as possible. [1] Yick J.; Mukherjee, B.; Ghosal, D. Wireless sensor network survey. Comput. Netw. 2008, 52, 2292-2330. [2] Garcia, M.; Bri, D.; Boronat, F.; Lloret, J. A new neighbor selection strategy for group-based wireless sensor networks, In The Fourth International Conference on Networking and Services (ICNS 2008), Gosier, Guadalupe, March 16-21, 2008.

The Analysis of Alpha Beta Pruning and MTD(f) Algorithm to Determine the Best Algorithm to be Implemented at Connect Four Prototype

NASA Astrophysics Data System (ADS)

Tommy, Lukas; Hardjianto, Mardi; Agani, Nazori

2017-04-01

Connect Four is a two-player game which the players take turns dropping discs into a grid to connect 4 of one’s own discs next to each other vertically, horizontally, or diagonally. At Connect Four, Computer requires artificial intelligence (AI) in order to play properly like human. There are many AI algorithms that can be implemented to Connect Four, but the suitable algorithms are unknown. The suitable algorithm means optimal in choosing move and its execution time is not slow at search depth which is deep enough. In this research, analysis and comparison between standard alpha beta (AB) Pruning and MTD(f) will be carried out at the prototype of Connect Four in terms of optimality (win percentage) and speed (execution time and the number of leaf nodes). Experiments are carried out by running computer versus computer mode with 12 different conditions, i.e. varied search depth (5 through 10) and who moves first. The percentage achieved by MTD(f) based on experiments is win 45,83%, lose 37,5% and draw 16,67%. In the experiments with search depth 8, MTD(f) execution time is 35, 19% faster and evaluate 56,27% fewer leaf nodes than AB Pruning. The results of this research are MTD(f) is as optimal as AB Pruning at Connect Four prototype, but MTD(f) on average is faster and evaluates fewer leaf nodes than AB Pruning. The execution time of MTD(f) is not slow and much faster than AB Pruning at search depth which is deep enough.

Large-Scale Hypoconnectivity Between Resting-State Functional Networks in Unmedicated Adolescent Major Depressive Disorder.

PubMed

Sacchet, Matthew D; Ho, Tiffany C; Connolly, Colm G; Tymofiyeva, Olga; Lewinn, Kaja Z; Han, Laura Km; Blom, Eva H; Tapert, Susan F; Max, Jeffrey E; Frank, Guido Kw; Paulus, Martin P; Simmons, Alan N; Gotlib, Ian H; Yang, Tony T

2016-11-01

Major depressive disorder (MDD) often emerges during adolescence, a critical period of brain development. Recent resting-state fMRI studies of adults suggest that MDD is associated with abnormalities within and between resting-state networks (RSNs). Here we tested whether adolescent MDD is characterized by abnormalities in interactions among RSNs. Participants were 55 unmedicated adolescents diagnosed with MDD and 56 matched healthy controls. Functional connectivity was mapped using resting-state fMRI. We used the network-based statistic (NBS) to compare large-scale connectivity between groups and also compared the groups on graph metrics. We further assessed whether group differences identified using nodes defined from functionally defined RSNs were also evident when using anatomically defined nodes. In addition, we examined relations between network abnormalities and depression severity and duration. Finally, we compared intranetwork connectivity between groups and assessed the replication of previously reported MDD-related abnormalities in connectivity. The NBS indicated that, compared with controls, depressed adolescents exhibited reduced connectivity (p<0.024, corrected) between a specific set of RSNs, including components of the attention, central executive, salience, and default mode networks. The NBS did not identify group differences in network connectivity when using anatomically defined nodes. Longer duration of depression was significantly correlated with reduced connectivity in this set of network interactions (p=0.020, corrected), specifically with reduced connectivity between components of the dorsal attention network. The dorsal attention network was also characterized by reduced intranetwork connectivity in the MDD group. Finally, we replicated previously reported abnormal connectivity in individuals with MDD. In summary, adolescents with MDD show hypoconnectivity between large-scale brain networks compared with healthy controls. Given that connectivity among these networks typically increases during adolescent neurodevelopment, these results suggest that adolescent depression is associated with abnormalities in neural systems that are still developing during this critical period.

Large-Scale Hypoconnectivity Between Resting-State Functional Networks in Unmedicated Adolescent Major Depressive Disorder

PubMed Central

Sacchet, Matthew D; Ho, Tiffany C; Connolly, Colm G; Tymofiyeva, Olga; Lewinn, Kaja Z; Han, Laura KM; Blom, Eva H; Tapert, Susan F; Max, Jeffrey E; Frank, Guido KW; Paulus, Martin P; Simmons, Alan N; Gotlib, Ian H; Yang, Tony T

2016-01-01

Major depressive disorder (MDD) often emerges during adolescence, a critical period of brain development. Recent resting-state fMRI studies of adults suggest that MDD is associated with abnormalities within and between resting-state networks (RSNs). Here we tested whether adolescent MDD is characterized by abnormalities in interactions among RSNs. Participants were 55 unmedicated adolescents diagnosed with MDD and 56 matched healthy controls. Functional connectivity was mapped using resting-state fMRI. We used the network-based statistic (NBS) to compare large-scale connectivity between groups and also compared the groups on graph metrics. We further assessed whether group differences identified using nodes defined from functionally defined RSNs were also evident when using anatomically defined nodes. In addition, we examined relations between network abnormalities and depression severity and duration. Finally, we compared intranetwork connectivity between groups and assessed the replication of previously reported MDD-related abnormalities in connectivity. The NBS indicated that, compared with controls, depressed adolescents exhibited reduced connectivity (p<0.024, corrected) between a specific set of RSNs, including components of the attention, central executive, salience, and default mode networks. The NBS did not identify group differences in network connectivity when using anatomically defined nodes. Longer duration of depression was significantly correlated with reduced connectivity in this set of network interactions (p=0.020, corrected), specifically with reduced connectivity between components of the dorsal attention network. The dorsal attention network was also characterized by reduced intranetwork connectivity in the MDD group. Finally, we replicated previously reported abnormal connectivity in individuals with MDD. In summary, adolescents with MDD show hypoconnectivity between large-scale brain networks compared with healthy controls. Given that connectivity among these networks typically increases during adolescent neurodevelopment, these results suggest that adolescent depression is associated with abnormalities in neural systems that are still developing during this critical period. PMID:27238621

Corticocortical evoked potentials reveal projectors and integrators in human brain networks.

PubMed

Keller, Corey J; Honey, Christopher J; Entz, Laszlo; Bickel, Stephan; Groppe, David M; Toth, Emilia; Ulbert, Istvan; Lado, Fred A; Mehta, Ashesh D

2014-07-02

The cerebral cortex is composed of subregions whose functional specialization is largely determined by their incoming and outgoing connections with each other. In the present study, we asked which cortical regions can exert the greatest influence over other regions and the cortical network as a whole. Previous research on this question has relied on coarse anatomy (mapping large fiber pathways) or functional connectivity (mapping inter-regional statistical dependencies in ongoing activity). Here we combined direct electrical stimulation with recordings from the cortical surface to provide a novel insight into directed, inter-regional influence within the cerebral cortex of awake humans. These networks of directed interaction were reproducible across strength thresholds and across subjects. Directed network properties included (1) a decrease in the reciprocity of connections with distance; (2) major projector nodes (sources of influence) were found in peri-Rolandic cortex and posterior, basal and polar regions of the temporal lobe; and (3) major receiver nodes (receivers of influence) were found in anterolateral frontal, superior parietal, and superior temporal regions. Connectivity maps derived from electrical stimulation and from resting electrocorticography (ECoG) correlations showed similar spatial distributions for the same source node. However, higher-level network topology analysis revealed differences between electrical stimulation and ECoG that were partially related to the reciprocity of connections. Together, these findings inform our understanding of large-scale corticocortical influence as well as the interpretation of functional connectivity networks. Copyright © 2014 the authors 0270-6474/14/349152-12$15.00/0.

Consensus between Pipelines in Structural Brain Networks

PubMed Central

Parker, Christopher S.; Deligianni, Fani; Cardoso, M. Jorge; Daga, Pankaj; Modat, Marc; Dayan, Michael; Clark, Chris A.

2014-01-01

Structural brain networks may be reconstructed from diffusion MRI tractography data and have great potential to further our understanding of the topological organisation of brain structure in health and disease. Network reconstruction is complex and involves a series of processesing methods including anatomical parcellation, registration, fiber orientation estimation and whole-brain fiber tractography. Methodological choices at each stage can affect the anatomical accuracy and graph theoretical properties of the reconstructed networks, meaning applying different combinations in a network reconstruction pipeline may produce substantially different networks. Furthermore, the choice of which connections are considered important is unclear. In this study, we assessed the similarity between structural networks obtained using two independent state-of-the-art reconstruction pipelines. We aimed to quantify network similarity and identify the core connections emerging most robustly in both pipelines. Similarity of network connections was compared between pipelines employing different atlases by merging parcels to a common and equivalent node scale. We found a high agreement between the networks across a range of fiber density thresholds. In addition, we identified a robust core of highly connected regions coinciding with a peak in similarity across network density thresholds, and replicated these results with atlases at different node scales. The binary network properties of these core connections were similar between pipelines but showed some differences in atlases across node scales. This study demonstrates the utility of applying multiple structural network reconstrution pipelines to diffusion data in order to identify the most important connections for further study. PMID:25356977

Peer-to-peer model for the area coverage and cooperative control of mobile sensor networks

NASA Astrophysics Data System (ADS)

Tan, Jindong; Xi, Ning

2004-09-01

This paper presents a novel model and distributed algorithms for the cooperation and redeployment of mobile sensor networks. A mobile sensor network composes of a collection of wireless connected mobile robots equipped with a variety of sensors. In such a sensor network, each mobile node has sensing, computation, communication, and locomotion capabilities. The locomotion ability enhances the autonomous deployment of the system. The system can be rapidly deployed to hostile environment, inaccessible terrains or disaster relief operations. The mobile sensor network is essentially a cooperative multiple robot system. This paper first presents a peer-to-peer model to define the relationship between neighboring communicating robots. Delaunay Triangulation and Voronoi diagrams are used to define the geometrical relationship between sensor nodes. This distributed model allows formal analysis for the fusion of spatio-temporal sensory information of the network. Based on the distributed model, this paper discusses a fault tolerant algorithm for autonomous self-deployment of the mobile robots. The algorithm considers the environment constraints, the presence of obstacles and the nonholonomic constraints of the robots. The distributed algorithm enables the system to reconfigure itself such that the area covered by the system can be enlarged. Simulation results have shown the effectiveness of the distributed model and deployment algorithms.

Tyurin works on a CPA in the hatch between the MPLM and Node 1

NASA Image and Video Library

2001-08-01

ISS003-E-5136 (August 2001) --- Mikhail Tyurin of Rosaviakosmos, Expedition Three flight engineer, secures a connection on a Controller Power Assembly (CPA) in a hatchway on Unity Node 1. This image was taken with a digital still camera.

Closed-loop control of a fragile network: application to seizure-like dynamics of an epilepsy model

PubMed Central

Ehrens, Daniel; Sritharan, Duluxan; Sarma, Sridevi V.

2015-01-01

It has recently been proposed that the epileptic cortex is fragile in the sense that seizures manifest through small perturbations in the synaptic connections that render the entire cortical network unstable. Closed-loop therapy could therefore entail detecting when the network goes unstable, and then stimulating with an exogenous current to stabilize the network. In this study, a non-linear stochastic model of a neuronal network was used to simulate both seizure and non-seizure activity. In particular, synaptic weights between neurons were chosen such that the network's fixed point is stable during non-seizure periods, and a subset of these connections (the most fragile) were perturbed to make the same fixed point unstable to model seizure events; and, the model randomly transitions between these two modes. The goal of this study was to measure spike train observations from this epileptic network and then apply a feedback controller that (i) detects when the network goes unstable, and then (ii) applies a state-feedback gain control input to the network to stabilize it. The stability detector is based on a 2-state (stable, unstable) hidden Markov model (HMM) of the network, and detects the transition from the stable mode to the unstable mode from using the firing rate of the most fragile node in the network (which is the output of the HMM). When the unstable mode is detected, a state-feedback gain is applied to generate a control input to the fragile node bringing the network back to the stable mode. Finally, when the network is detected as stable again, the feedback control input is switched off. High performance was achieved for the stability detector, and feedback control suppressed seizures within 2 s after onset. PMID:25784851

Wide-area-distributed storage system for a multimedia database

NASA Astrophysics Data System (ADS)

Ueno, Masahiro; Kinoshita, Shigechika; Kuriki, Makato; Murata, Setsuko; Iwatsu, Shigetaro

1998-12-01

We have developed a wide-area-distribution storage system for multimedia databases, which minimizes the possibility of simultaneous failure of multiple disks in the event of a major disaster. It features a RAID system, whose member disks are spatially distributed over a wide area. Each node has a device, which includes the controller of the RAID and the controller of the member disks controlled by other nodes. The devices in the node are connected to a computer, using fiber optic cables and communicate using fiber-channel technology. Any computer at a node can utilize multiple devices connected by optical fibers as a single 'virtual disk.' The advantage of this system structure is that devices and fiber optic cables are shared by the computers. In this report, we first described our proposed system, and a prototype was used for testing. We then discussed its performance; i.e., how to read and write throughputs are affected by data-access delay, the RAID level, and queuing.

Hopping in the Crowd to Unveil Network Topology.

PubMed

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-13

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

Hopping in the Crowd to Unveil Network Topology

NASA Astrophysics Data System (ADS)

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-01

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

GFSSP Training Course Lectures

NASA Technical Reports Server (NTRS)

Majumdar, Alok K.

2008-01-01

GFSSP has been extended to model conjugate heat transfer Fluid Solid Network Elements include: a) Fluid nodes and Flow Branches; b) Solid Nodes and Ambient Nodes; c) Conductors connecting Fluid-Solid, Solid-Solid and Solid-Ambient Nodes. Heat Conduction Equations are solved simultaneously with Fluid Conservation Equations for Mass, Momentum, Energy and Equation of State. The extended code was verified by comparing with analytical solution for simple conduction-convection problem The code was applied to model: a) Pressurization of Cryogenic Tank; b) Freezing and Thawing of Metal; c) Chilldown of Cryogenic Transfer Line; d) Boil-off from Cryogenic Tank.

Fighting for resources: Two leaders in the money addicted social hierarchies

NASA Astrophysics Data System (ADS)

Dybiec, Bartłomiej

Building of hierarchy is inevitably associated with the constant competition for resources and attention. Here, we show how presence of two favored (leading) nodes affects properties of the network connecting individuals. In particular, we study how nodes characteristics depend on relative asymmetry between two leading nodes. It is shown that without strong and rigorous avoidance mechanism, individuals can support both dominating nodes. Slow redistribution of resources enhances this effect. Moreover, slow redistribution of resources results in development of social networks with a very limited number of layers.

Integrated Social and QoS Trust-Based Routing in Mobile Ad Hoc Delay Tolerant Networks

DTIC Science & Technology

2010-11-15

d-connectivity, honesty, or unselfishness) with: encounter*,. , A ^// m = / (3) {•p ounter,x r. , . .-, ( Ti x m (t), ifm =j ^indirect. X, T...take into account node »’ s belief in node m in the calculation ofT(jreet’ x(t + At). This models the decay of trust as trust is derived from a distant...directly based on node /’ s past experiences with node m up to time t + At, including the current encounter. Taking the fact that /? a + /?2 = 1, we obtain

Communities and classes in symmetric fractals

NASA Astrophysics Data System (ADS)

Krawczyk, Małgorzata J.

2015-07-01

Two aspects of fractal networks are considered: the community structure and the class structure, where classes of nodes appear as a consequence of a local symmetry of nodes. The analyzed systems are the networks constructed for two selected symmetric fractals: the Sierpinski triangle and the Koch curve. Communities are searched for by means of a set of differential equations. Overlapping nodes which belong to two different communities are identified by adding some noise to the initial connectivity matrix. Then, a node can be characterized by a spectrum of probabilities of belonging to different communities. Our main goal is that the overlapping nodes with the same spectra belong to the same class.

Lymphatic system of the pancreas.

PubMed

O'Morchoe, C C

A network of lymphatic vessels exists within the pancreas. The majority of vessels forming this network lie in the interlobular septa of connective tissue that subdivide the pancreas into lobes and lobules. Peripheral extensions of these interlobular lymphatics can be found within the lobules, but these intralobular lymphatics are relatively sparse. In the main, the intimate relationships of these internal pancreatic lymphatics are with the blood vessels and associated connective tissue. However in random areas, both intra- and interlobular lymphatics come into close relationship with acinar cells. Rarely are there lymphatics associated with islets of Langerhans, and then only where lymphatic vessels in connective tissue septa pass close to a pancreatic lobule that contains an islet at its periphery. Intra- and interlobular lymphatics are similar in structure. Both are thin walled having an endothelial lining and a delicate component of connective tissue. The pattern of interendothelial cell contacts and the sparsity of gaps between adjacent cells suggest that fluid movement through the intracytoplasmic system of vesicles is important in lymph formation in the pancreas. However intercellular transport is also likely to occur by a dynamic process involving fluid movement through dilatations between cells from interstitium to lymphatic lumen. Both exocrine and endocrine secretions of the pancreas may enter thoracic duct lymph directly in pancreatic lymph, but in normal circumstances this route of entry is not quantitatively important. The structural relationships between lymphatics and pancreatic parenchymal cells also make clear that lymph is not a significant pathway for their secretory products. Rather, the arrangement of lymphatics in the pancreas supports the view that lymph is primarily the drainage medium for substances that, for whatever reason, enter the interstitium. In addition, the low flow of lymph compared with that of plasma lends credence to the view that lymph is not a functionally important pathway for endocrine secretions from the pancreas to reach the blood. Both structural and functional evidence suggests that the proper functioning of the lymphatic system is of critical importance in the homeostasis of the pancreas. The lymphatic system of the pancreas, like that in other organs, is essential in the removal of excess fluid from the interstitium. In this sense, the lymphatics may be considered to serve as an overflow, protective, or safety system. When the system is inadequate or its capacity is exceeded, as in inflammation of the pancreas, exocrine secretions entering the interstitium are not cleared and the proteolytic enzymes cause major damage to the tissue. This, in turn, exacerbates the edema, accentuates the inability of lymphatics to drain the fluid, and results in further damage. The fibrosis that ensues damages the lymphatics either directly or through stricture of the surrounding connective tissue. In consequence, they become inadequate at an even earlier stage in subsequent attacks of inflammation and thereby predispose to chronic and recurrent pancreatitis. The larger interlobular lymphatics formed by the junction of their tributaries emerge upon the surface of the pancreas. There they travel primarily with blood vessels and stream toward a ring of lymph nodes that intimately surrounds the pancreas. A second system of nodes extensively involved in drainage from the pancreas is related to the front and sides of the aorta from the level of the celiac trunk to the origin of the superior mesenteric artery. This second set of nodes receives lymph either directly from the pancreas or indirectly from the first echelon of nodes that rings the organ. Although there is general agreement on the disposition of the groups within these sets of nodes, confusion results from the different classifications used by various authors. These classifications range from being purely descriptive, through an alpha and num

Constructing networks from a dynamical system perspective for multivariate nonlinear time series.

PubMed

Nakamura, Tomomichi; Tanizawa, Toshihiro; Small, Michael

2016-03-01

We describe a method for constructing networks for multivariate nonlinear time series. We approach the interaction between the various scalar time series from a deterministic dynamical system perspective and provide a generic and algorithmic test for whether the interaction between two measured time series is statistically significant. The method can be applied even when the data exhibit no obvious qualitative similarity: a situation in which the naive method utilizing the cross correlation function directly cannot correctly identify connectivity. To establish the connectivity between nodes we apply the previously proposed small-shuffle surrogate (SSS) method, which can investigate whether there are correlation structures in short-term variabilities (irregular fluctuations) between two data sets from the viewpoint of deterministic dynamical systems. The procedure to construct networks based on this idea is composed of three steps: (i) each time series is considered as a basic node of a network, (ii) the SSS method is applied to verify the connectivity between each pair of time series taken from the whole multivariate time series, and (iii) the pair of nodes is connected with an undirected edge when the null hypothesis cannot be rejected. The network constructed by the proposed method indicates the intrinsic (essential) connectivity of the elements included in the system or the underlying (assumed) system. The method is demonstrated for numerical data sets generated by known systems and applied to several experimental time series.

Preferential degradation of cognitive networks differentiates Alzheimer's disease from ageing.

PubMed

Chhatwal, Jasmeer P; Schultz, Aaron P; Johnson, Keith A; Hedden, Trey; Jaimes, Sehily; Benzinger, Tammie L S; Jack, Clifford; Ances, Beau M; Ringman, John M; Marcus, Daniel S; Ghetti, Bernardino; Farlow, Martin R; Danek, Adrian; Levin, Johannes; Yakushev, Igor; Laske, Christoph; Koeppe, Robert A; Galasko, Douglas R; Xiong, Chengjie; Masters, Colin L; Schofield, Peter R; Kinnunen, Kirsi M; Salloway, Stephen; Martins, Ralph N; McDade, Eric; Cairns, Nigel J; Buckles, Virginia D; Morris, John C; Bateman, Randall; Sperling, Reisa A

2018-05-01

Converging evidence from structural, metabolic and functional connectivity MRI suggests that neurodegenerative diseases, such as Alzheimer's disease, target specific neural networks. However, age-related network changes commonly co-occur with neuropathological cascades, limiting efforts to disentangle disease-specific alterations in network function from those associated with normal ageing. Here we elucidate the differential effects of ageing and Alzheimer's disease pathology through simultaneous analyses of two functional connectivity MRI datasets: (i) young participants harbouring highly-penetrant mutations leading to autosomal-dominant Alzheimer's disease from the Dominantly Inherited Alzheimer's Network (DIAN), an Alzheimer's disease cohort in which age-related comorbidities are minimal and likelihood of progression along an Alzheimer's disease trajectory is extremely high; and (ii) young and elderly participants from the Harvard Aging Brain Study, a cohort in which imaging biomarkers of amyloid burden and neurodegeneration can be used to disambiguate ageing alone from preclinical Alzheimer's disease. Consonant with prior reports, we observed the preferential degradation of cognitive (especially the default and dorsal attention networks) over motor and sensory networks in early autosomal-dominant Alzheimer's disease, and found that this distinctive degradation pattern was magnified in more advanced stages of disease. Importantly, a nascent form of the pattern observed across the autosomal-dominant Alzheimer's disease spectrum was also detectable in clinically normal elderly with clear biomarker evidence of Alzheimer's disease pathology (preclinical Alzheimer's disease). At the more granular level of individual connections between node pairs, we observed that connections within cognitive networks were preferentially targeted in Alzheimer's disease (with between network connections relatively spared), and that connections between positively coupled nodes (correlations) were preferentially degraded as compared to connections between negatively coupled nodes (anti-correlations). In contrast, ageing in the absence of Alzheimer's disease biomarkers was characterized by a far less network-specific degradation across cognitive and sensory networks, of between- and within-network connections, and of connections between positively and negatively coupled nodes. We go on to demonstrate that formalizing the differential patterns of network degradation in ageing and Alzheimer's disease may have the practical benefit of yielding connectivity measurements that highlight early Alzheimer's disease-related connectivity changes over those due to age-related processes. Together, the contrasting patterns of connectivity in Alzheimer's disease and ageing add to prior work arguing against Alzheimer's disease as a form of accelerated ageing, and suggest multi-network composite functional connectivity MRI metrics may be useful in the detection of early Alzheimer's disease-specific alterations co-occurring with age-related connectivity changes. More broadly, our findings are consistent with a specific pattern of network degradation associated with the spreading of Alzheimer's disease pathology within targeted neural networks.

Supporting Students in Making Sense of Connections and in Becoming Perceptually Fluent in Making Connections among Multiple Graphical Representations

ERIC Educational Resources Information Center

Rau, Martina A.; Aleven, Vincent; Rummel, Nikol

2017-01-01

Prior research shows that multiple representations can enhance learning, provided that students make connections among them. We hypothesized that support for connection making is most effective in enhancing learning of domain knowledge if it helps students both in making sense of these connections and in becoming perceptually fluent in making…

Metropolitan all-pass and inter-city quantum communication network.

PubMed

Chen, Teng-Yun; Wang, Jian; Liang, Hao; Liu, Wei-Yue; Liu, Yang; Jiang, Xiao; Wang, Yuan; Wan, Xu; Cai, Wei-Qi; Ju, Lei; Chen, Luo-Kan; Wang, Liu-Jun; Gao, Yuan; Chen, Kai; Peng, Cheng-Zhi; Chen, Zeng-Bing; Pan, Jian-Wei

2010-12-20

We have demonstrated a metropolitan all-pass quantum communication network in field fiber for four nodes. Any two nodes of them can be connected in the network to perform quantum key distribution (QKD). An optical switching module is presented that enables arbitrary 2-connectivity among output ports. Integrated QKD terminals are worked out, which can operate either as a transmitter, a receiver, or even both at the same time. Furthermore, an additional link in another city of 60 km fiber (up to 130 km) is seamless integrated into this network based on a trusted relay architecture. On all the links, we have implemented protocol of decoy state scheme. All of necessary electrical hardware, synchronization, feedback control, network software, execution of QKD protocols are made by tailored designing, which allow a completely automatical and stable running. Our system has been put into operation in Hefei in August 2009, and publicly demonstrated during an evaluation conference on quantum network organized by the Chinese Academy of Sciences on August 29, 2009. Real-time voice telephone with one-time pad encoding between any two of the five nodes (four all-pass nodes plus one additional node through relay) is successfully established in the network within 60 km.

Announcing Supercomputer Summit

ScienceCinema

Wells, Jack; Bland, Buddy; Nichols, Jeff; Hack, Jim; Foertter, Fernanda; Hagen, Gaute; Maier, Thomas; Ashfaq, Moetasim; Messer, Bronson; Parete-Koon, Suzanne

2018-01-16

Summit is the next leap in leadership-class computing systems for open science. With Summit we will be able to address, with greater complexity and higher fidelity, questions concerning who we are, our place on earth, and in our universe. Summit will deliver more than five times the computational performance of Titan’s 18,688 nodes, using only approximately 3,400 nodes when it arrives in 2017. Like Titan, Summit will have a hybrid architecture, and each node will contain multiple IBM POWER9 CPUs and NVIDIA Volta GPUs all connected together with NVIDIA’s high-speed NVLink. Each node will have over half a terabyte of coherent memory (high bandwidth memory + DDR4) addressable by all CPUs and GPUs plus 800GB of non-volatile RAM that can be used as a burst buffer or as extended memory. To provide a high rate of I/O throughput, the nodes will be connected in a non-blocking fat-tree using a dual-rail Mellanox EDR InfiniBand interconnect. Upon completion, Summit will allow researchers in all fields of science unprecedented access to solving some of the world’s most pressing challenges.

Fog Computing and Edge Computing Architectures for Processing Data From Diabetes Devices Connected to the Medical Internet of Things.

PubMed

Klonoff, David C

2017-07-01

The Internet of Things (IoT) is generating an immense volume of data. With cloud computing, medical sensor and actuator data can be stored and analyzed remotely by distributed servers. The results can then be delivered via the Internet. The number of devices in IoT includes such wireless diabetes devices as blood glucose monitors, continuous glucose monitors, insulin pens, insulin pumps, and closed-loop systems. The cloud model for data storage and analysis is increasingly unable to process the data avalanche, and processing is being pushed out to the edge of the network closer to where the data-generating devices are. Fog computing and edge computing are two architectures for data handling that can offload data from the cloud, process it nearby the patient, and transmit information machine-to-machine or machine-to-human in milliseconds or seconds. Sensor data can be processed near the sensing and actuating devices with fog computing (with local nodes) and with edge computing (within the sensing devices). Compared to cloud computing, fog computing and edge computing offer five advantages: (1) greater data transmission speed, (2) less dependence on limited bandwidths, (3) greater privacy and security, (4) greater control over data generated in foreign countries where laws may limit use or permit unwanted governmental access, and (5) lower costs because more sensor-derived data are used locally and less data are transmitted remotely. Connected diabetes devices almost all use fog computing or edge computing because diabetes patients require a very rapid response to sensor input and cannot tolerate delays for cloud computing.

Theoretical Manual for Analysis of Arch Dams

DTIC Science & Technology

1993-07-01

eight nodes lying on the midsurface , half-way between the corresponding surface nodes (Pawsey 1970). Each node on the midsurface has five DOF’s, three...translations in the global directions, and two rotations about two axes perpendicular to the midsurface normal (Figure 5-4). The sixth DOF, associated...Figure 5-3). The coordinates of any point within the element are described in terms of the midsurface coordinates and a vector connecting the two upper

Employing linear tetranuclear [Zn4(COO)4(OH)2] clusters as building subunits to construct a new Zn(II) coordination polymer with tunable luminescent properties

NASA Astrophysics Data System (ADS)

Li, Wu-Wu; Zhang, Zun-Ting

2016-02-01

A new Zn(II) coordination polymer, [Zn2(btc) (biimpy) (OH)]n (1 H3btc = 1,3,5-benzenetricarboxylic acid, biimpy = 2,6-bis(1-imdazoly)pyridine) has been successfully synthesized and characterized by elemental analysis, powder single crystal X-ray diffraction analyses. Compound 1 features a 3D framework employing linear tetranuclear [Zn4(COO)4(OH)2] cluster as building subunits. Topological analysis reveals it represents a (3,10)-connected structural topology by viewing btc3-, linear tetranuclear clusters and biimpy as 3-connected nodes, 10-connected nodes, linear linkers, respectively. Moreover, the thermal stability and luminescent property of compound 1 have been well investigated.

Using the OASES-A to illustrate how network analysis can be applied to understand the experience of stuttering.

PubMed

Siew, Cynthia S Q; Pelczarski, Kristin M; Yaruss, J Scott; Vitevitch, Michael S

Network science uses mathematical and computational techniques to examine how individual entities in a system, represented by nodes, interact, as represented by connections between nodes. This approach has been used by Cramer et al. (2010) to make "symptom networks" to examine various psychological disorders. In the present analysis we examined a network created from the items in the Overall Assessment of the Speaker's Experience of Stuttering-Adult (OASES-A), a commonly used measure for evaluating adverse impact in the lives of people who stutter. The items of the OASES-A were represented as nodes in the network. Connections between nodes were placed if responses to those two items in the OASES-A had a correlation coefficient greater than ±0.5. Several network analyses revealed which nodes were "important" in the network. Several centrally located nodes and "key players" in the network were identified. A community detection analysis found groupings of nodes that differed slightly from the subheadings of the OASES-A. Centrally located nodes and "key players" in the network may help clinicians prioritize treatment. The different community structure found for people who stutter suggests that the way people who stutter view stuttering may differ from the way that scientists and clinicians view stuttering. Finally, the present analyses illustrate how the network approach might be applied to other speech, language, and hearing disorders to better understand how those disorders are experienced and to provide insights for their treatment. Copyright © 2016 Elsevier Inc. All rights reserved.

Network of dedicated processors for finding lowest-cost map path

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P. (Inventor)

1991-01-01

A method and associated apparatus are disclosed for finding the lowest cost path of several variable paths. The paths are comprised of a plurality of linked cost-incurring areas existing between an origin point and a destination point. The method comprises the steps of connecting a purality of nodes together in the manner of the cost-incurring areas; programming each node to have a cost associated therewith corresponding to one of the cost-incurring areas; injecting a signal into one of the nodes representing the origin point; propagating the signal through the plurality of nodes from inputs to outputs; reducing the signal in magnitude at each node as a function of the respective cost of the node; and, starting at one of the nodes representing the destination point and following a path having the least reduction in magnitude of the signal from node to node back to one of the nodes representing the origin point whereby the lowest cost path from the origin point to the destination point is found.

Standards-Based Wireless Sensor Networking Protocols for Spaceflight Applications

NASA Technical Reports Server (NTRS)

Wagner, Raymond S.

2010-01-01

Wireless sensor networks (WSNs) have the capacity to revolutionize data gathering in both spaceflight and terrestrial applications. WSNs provide a huge advantage over traditional, wired instrumentation since they do not require wiring trunks to connect sensors to a central hub. This allows for easy sensor installation in hard to reach locations, easy expansion of the number of sensors or sensing modalities, and reduction in both system cost and weight. While this technology offers unprecedented flexibility and adaptability, implementing it in practice is not without its difficulties. Recent advances in standards-based WSN protocols for industrial control applications have come a long way to solving many of the challenges facing practical WSN deployments. In this paper, we will overview two of the more promising candidates - WirelessHART from the HART Communication Foundation and ISA100.11a from the International Society of Automation - and present the architecture for a new standards-based sensor node for networking and applications research.

Robustness of a network formed by n interdependent networks with a one-to-one correspondence of dependent nodes.

PubMed

Gao, Jianxi; Buldyrev, S V; Havlin, S; Stanley, H E

2012-06-01

Many real-world networks interact with and depend upon other networks. We develop an analytical framework for studying a network formed by n fully interdependent randomly connected networks, each composed of the same number of nodes N. The dependency links connecting nodes from different networks establish a unique one-to-one correspondence between the nodes of one network and the nodes of the other network. We study the dynamics of the cascades of failures in such a network of networks (NON) caused by a random initial attack on one of the networks, after which a fraction p of its nodes survives. We find for the fully interdependent loopless NON that the final state of the NON does not depend on the dynamics of the cascades but is determined by a uniquely defined mutual giant component of the NON, which generalizes both the giant component of regular percolation of a single network (n=1) and the recently studied case of the mutual giant component of two interdependent networks (n=2). We also find that the mutual giant component does not depend on the topology of the NON and express it in terms of generating functions of the degree distributions of the network. Our results show that, for any n≥2 there exists a critical p=p(c)>0 below which the mutual giant component abruptly collapses from a finite nonzero value for p≥p(c) to zero for p2, a RR NON is stable for any n with p(c)<1). This results arises from the critical role played by singly connected nodes which exist in an ER NON and enhance the cascading failures, but do not exist in a RR NON.

Ubiquitous-health (U-Health) monitoring systems for elders and caregivers

NASA Astrophysics Data System (ADS)

Moon, Gyu; Lim, Kyung-won; Yoo, Young-min; An, Hye-min; Lee, Ki Seop; Szu, Harold

2011-06-01

This paper presents two aordable low-tack system for household biomedical wellness monitoring. The rst system, JIKIMI (pronounced caregiver in Korean), is a remote monitoring system that analyzes the behavior patterns of elders that live alone. JIKIMI is composed of an in-house sensing system, a set of wireless sensor nodes containing a pyroelectric infrared sensor to detect the motion of elders, an emergency button and a magnetic sensor that detects the opening and closing of doors. The system is also equipped with a server system, which is comprised of a database and web server. The server provides the mechanism for web-based monitoring to caregivers. The second system, Reader of Bottle Information (ROBI), is an assistant system which advises the contents of bottles for elders. ROBI is composed of bottles that have connected RFID tags and an advice system, which is composed of a wireless RFID reader, a gateway and a remote database server. The RFID tags are connected to the caps of the bottles are used in conjunction with the advice system These systems have been in use for three years and have proven to be useful for caregivers to provide more ecient and eective care services.

Graph analysis of functional brain networks: practical issues in translational neuroscience

PubMed Central

De Vico Fallani, Fabrizio; Richiardi, Jonas; Chavez, Mario; Achard, Sophie

2014-01-01

The brain can be regarded as a network: a connected system where nodes, or units, represent different specialized regions and links, or connections, represent communication pathways. From a functional perspective, communication is coded by temporal dependence between the activities of different brain areas. In the last decade, the abstract representation of the brain as a graph has allowed to visualize functional brain networks and describe their non-trivial topological properties in a compact and objective way. Nowadays, the use of graph analysis in translational neuroscience has become essential to quantify brain dysfunctions in terms of aberrant reconfiguration of functional brain networks. Despite its evident impact, graph analysis of functional brain networks is not a simple toolbox that can be blindly applied to brain signals. On the one hand, it requires the know-how of all the methodological steps of the pipeline that manipulate the input brain signals and extract the functional network properties. On the other hand, knowledge of the neural phenomenon under study is required to perform physiologically relevant analysis. The aim of this review is to provide practical indications to make sense of brain network analysis and contrast counterproductive attitudes. PMID:25180301

Adjacency Matrix-Based Transmit Power Allocation Strategies in Wireless Sensor Networks

PubMed Central

Consolini, Luca; Medagliani, Paolo; Ferrari, Gianluigi

2009-01-01

In this paper, we present an innovative transmit power control scheme, based on optimization theory, for wireless sensor networks (WSNs) which use carrier sense multiple access (CSMA) with collision avoidance (CA) as medium access control (MAC) protocol. In particular, we focus on schemes where several remote nodes send data directly to a common access point (AP). Under the assumption of finite overall network transmit power and low traffic load, we derive the optimal transmit power allocation strategy that minimizes the packet error rate (PER) at the AP. This approach is based on modeling the CSMA/CA MAC protocol through a finite state machine and takes into account the network adjacency matrix, depending on the transmit power distribution and determining the network connectivity. It will be then shown that the transmit power allocation problem reduces to a convex constrained minimization problem. Our results show that, under the assumption of low traffic load, the power allocation strategy, which guarantees minimal delay, requires the maximization of network connectivity, which can be equivalently interpreted as the maximization of the number of non-zero entries of the adjacency matrix. The obtained theoretical results are confirmed by simulations for unslotted Zigbee WSNs. PMID:22346705

Improvement of the SEP protocol based on community structure of node degree

NASA Astrophysics Data System (ADS)

Li, Donglin; Wei, Suyuan

2017-05-01

Analyzing the Stable election protocol (SEP) in wireless sensor networks and aiming at the problem of inhomogeneous cluster-heads distribution and unreasonable cluster-heads selectivity and single hop transmission in the SEP, a SEP Protocol based on community structure of node degree (SEP-CSND) is proposed. In this algorithm, network node deployed by using grid deployment model, and the connection between nodes established by setting up the communication threshold. The community structure constructed by node degree, then cluster head is elected in the community structure. On the basis of SEP, the node's residual energy and node degree is added in cluster-heads election. The information is transmitted with mode of multiple hops between network nodes. The simulation experiments showed that compared to the classical LEACH and SEP, this algorithm balances the energy consumption of the entire network and significantly prolongs network lifetime.

Emergence of Rich-Club Topology and Coordinated Dynamics in Development of Hippocampal Functional Networks In Vitro

PubMed Central

Charlesworth, Paul; Kitzbichler, Manfred G.; Paulsen, Ole

2015-01-01

Recent studies demonstrated that the anatomical network of the human brain shows a “rich-club” organization. This complex topological feature implies that highly connected regions, hubs of the large-scale brain network, are more densely interconnected with each other than expected by chance. Rich-club nodes were traversed by a majority of short paths between peripheral regions, underlining their potential importance for efficient global exchange of information between functionally specialized areas of the brain. Network hubs have also been described at the microscale of brain connectivity (so-called “hub neurons”). Their role in shaping synchronous dynamics and forming microcircuit wiring during development, however, is not yet fully understood. The present study aimed to investigate the role of hubs during network development, using multi-electrode arrays and functional connectivity analysis during spontaneous multi-unit activity (MUA) of dissociated primary mouse hippocampal neurons. Over the first 4 weeks in vitro, functional connectivity significantly increased in strength, density, and size, with mature networks demonstrating a robust modular and small-world topology. As expected by a “rich-get-richer” growth rule of network evolution, MUA graphs were found to form rich-clubs at an early stage in development (14 DIV). Later on, rich-club nodes were a consistent topological feature of MUA graphs, demonstrating high nodal strength, efficiency, and centrality. Rich-club nodes were also found to be crucial for MUA dynamics. They often served as broker of spontaneous activity flow, confirming that hub nodes and rich-clubs may play an important role in coordinating functional dynamics at the microcircuit level. PMID:25855164

Default Mode Network Interference in Mild Traumatic Brain Injury – A Pilot Resting State Study

PubMed Central

Sours, Chandler; Zhuo, Jiachen; Janowich, Jacqueline; Aarabi, Bizhan; Shanmuganathan, Kathirkamanthan; Gullapalli, Rao P

2013-01-01

In this study we investigated the functional connectivity in 23 Mild TBI (mTBI) patients with and without memory complaints using resting state fMRI in the sub-acute stage of injury as well as a group of control participants. Results indicate that mTBI patients with memory complaints performed significantly worse than patients without memory complaints on tests assessing memory from the Automated Neuropsychological Assessment Metrics (ANAM). Altered functional connectivity was observed between the three groups between the default mode network (DMN) and the nodes of the task positive network (TPN). Altered functional connectivity was also observed between both the TPN and DMN and nodes associated with the Salience Network (SN). Following mTBI there is a reduction in anti-correlated networks for both those with and without memory complaints for the DMN, but only a reduction in the anti-correlated network in mTBI patients with memory complaints for the TPN. Furthermore, an increased functional connectivity between the TPN and SN appears to be associated with reduced performance on memory assessments. Overall the results suggest that a disruption in the segregation of the DMN and the TPN at rest may be mediated through both a direct pathway of increased FC between various nodes of the TPN and DMN, and through an indirect pathway that links the TPN and DMN through nodes of the SN. This disruption between networks may cause a detrimental impact on memory functioning following mTBI, supporting the Default Mode Interference Hypothesis in the context of mTBI related memory deficits. PMID:23994210

Default mode network interference in mild traumatic brain injury - a pilot resting state study.

PubMed

Sours, Chandler; Zhuo, Jiachen; Janowich, Jacqueline; Aarabi, Bizhan; Shanmuganathan, Kathirkamanthan; Gullapalli, Rao P

2013-11-06

In this study we investigated the functional connectivity in 23 Mild TBI (mTBI) patients with and without memory complaints using resting state fMRI in the sub-acute stage of injury as well as a group of control participants. Results indicate that mTBI patients with memory complaints performed significantly worse than patients without memory complaints on tests assessing memory from the Automated Neuropsychological Assessment Metrics (ANAM). Altered functional connectivity was observed between the three groups between the default mode network (DMN) and the nodes of the task positive network (TPN). Altered functional connectivity was also observed between both the TPN and DMN and nodes associated with the Salience Network (SN). Following mTBI there is a reduction in anti-correlated networks for both those with and without memory complaints for the DMN, but only a reduction in the anti-correlated network in mTBI patients with memory complaints for the TPN. Furthermore, an increased functional connectivity between the TPN and SN appears to be associated with reduced performance on memory assessments. Overall the results suggest that a disruption in the segregation of the DMN and the TPN at rest may be mediated through both a direct pathway of increased FC between various nodes of the TPN and DMN, and through an indirect pathway that links the TPN and DMN through nodes of the SN. This disruption between networks may cause a detrimental impact on memory functioning following mTBI, supporting the Default Mode Interference Hypothesis in the context of mTBI related memory deficits. © 2013 Elsevier B.V. All rights reserved.

A Family of Algorithms for Computing Consensus about Node State from Network Data

PubMed Central

Brush, Eleanor R.; Krakauer, David C.; Flack, Jessica C.

2013-01-01

Biological and social networks are composed of heterogeneous nodes that contribute differentially to network structure and function. A number of algorithms have been developed to measure this variation. These algorithms have proven useful for applications that require assigning scores to individual nodes–from ranking websites to determining critical species in ecosystems–yet the mechanistic basis for why they produce good rankings remains poorly understood. We show that a unifying property of these algorithms is that they quantify consensus in the network about a node's state or capacity to perform a function. The algorithms capture consensus by either taking into account the number of a target node's direct connections, and, when the edges are weighted, the uniformity of its weighted in-degree distribution (breadth), or by measuring net flow into a target node (depth). Using data from communication, social, and biological networks we find that that how an algorithm measures consensus–through breadth or depth– impacts its ability to correctly score nodes. We also observe variation in sensitivity to source biases in interaction/adjacency matrices: errors arising from systematic error at the node level or direct manipulation of network connectivity by nodes. Our results indicate that the breadth algorithms, which are derived from information theory, correctly score nodes (assessed using independent data) and are robust to errors. However, in cases where nodes “form opinions” about other nodes using indirect information, like reputation, depth algorithms, like Eigenvector Centrality, are required. One caveat is that Eigenvector Centrality is not robust to error unless the network is transitive or assortative. In these cases the network structure allows the depth algorithms to effectively capture breadth as well as depth. Finally, we discuss the algorithms' cognitive and computational demands. This is an important consideration in systems in which individuals use the collective opinions of others to make decisions. PMID:23874167

IoGET: Internet of Geophysical and Environmental Things

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mudunuru, Maruti Kumar

The objective of this project is to provide novel and fast reduced-order models for onboard computation at sensor nodes for real-time analysis. The approach will require that LANL perform high-fidelity numerical simulations, construct simple reduced-order models (ROMs) using machine learning and signal processing algorithms, and use real-time data analysis for ROMs and compressive sensing at sensor nodes.

Reliability Evaluation for Clustered WSNs under Malware Propagation

PubMed Central

Shen, Shigen; Huang, Longjun; Liu, Jianhua; Champion, Adam C.; Yu, Shui; Cao, Qiying

2016-01-01

We consider a clustered wireless sensor network (WSN) under epidemic-malware propagation conditions and solve the problem of how to evaluate its reliability so as to ensure efficient, continuous, and dependable transmission of sensed data from sensor nodes to the sink. Facing the contradiction between malware intention and continuous-time Markov chain (CTMC) randomness, we introduce a strategic game that can predict malware infection in order to model a successful infection as a CTMC state transition. Next, we devise a novel measure to compute the Mean Time to Failure (MTTF) of a sensor node, which represents the reliability of a sensor node continuously performing tasks such as sensing, transmitting, and fusing data. Since clustered WSNs can be regarded as parallel-serial-parallel systems, the reliability of a clustered WSN can be evaluated via classical reliability theory. Numerical results show the influence of parameters such as the true positive rate and the false positive rate on a sensor node’s MTTF. Furthermore, we validate the method of reliability evaluation for a clustered WSN according to the number of sensor nodes in a cluster, the number of clusters in a route, and the number of routes in the WSN. PMID:27294934

Securing While Sampling in Wireless Body Area Networks With Application to Electrocardiography.

PubMed

Dautov, Ruslan; Tsouri, Gill R

2016-01-01

Stringent resource constraints and broadcast transmission in wireless body area network raise serious security concerns when employed in biomedical applications. Protecting data transmission where any minor alteration is potentially harmful is of significant importance in healthcare. Traditional security methods based on public or private key infrastructure require considerable memory and computational resources, and present an implementation obstacle in compact sensor nodes. This paper proposes a lightweight encryption framework augmenting compressed sensing with wireless physical layer security. Augmenting compressed sensing to secure information is based on the use of the measurement matrix as an encryption key, and allows for incorporating security in addition to compression at the time of sampling an analog signal. The proposed approach eliminates the need for a separate encryption algorithm, as well as the predeployment of a key thereby conserving sensor node's limited resources. The proposed framework is evaluated using analysis, simulation, and experimentation applied to a wireless electrocardiogram setup consisting of a sensor node, an access point, and an eavesdropper performing a proximity attack. Results show that legitimate communication is reliable and secure given that the eavesdropper is located at a reasonable distance from the sensor node and the access point.

On-demand information retrieval in sensor networks with localised query and energy-balanced data collection.

PubMed

Teng, Rui; Zhang, Bing

2011-01-01

On-demand information retrieval enables users to query and collect up-to-date sensing information from sensor nodes. Since high energy efficiency is required in a sensor network, it is desirable to disseminate query messages with small traffic overhead and to collect sensing data with low energy consumption. However, on-demand query messages are generally forwarded to sensor nodes in network-wide broadcasts, which create large traffic overhead. In addition, since on-demand information retrieval may introduce intermittent and spatial data collections, the construction and maintenance of conventional aggregation structures such as clusters and chains will be at high cost. In this paper, we propose an on-demand information retrieval approach that exploits the name resolution of data queries according to the attribute and location of each sensor node. The proposed approach localises each query dissemination and enable localised data collection with maximised aggregation. To illustrate the effectiveness of the proposed approach, an analytical model that describes the criteria of sink proxy selection is provided. The evaluation results reveal that the proposed scheme significantly reduces energy consumption and improves the balance of energy consumption among sensor nodes by alleviating heavy traffic near the sink.

A Delay-Aware and Reliable Data Aggregation for Cyber-Physical Sensing

PubMed Central

Zhang, Jinhuan; Long, Jun; Zhang, Chengyuan; Zhao, Guihu

2017-01-01

Physical information sensed by various sensors in a cyber-physical system should be collected for further operation. In many applications, data aggregation should take reliability and delay into consideration. To address these problems, a novel Tiered Structure Routing-based Delay-Aware and Reliable Data Aggregation scheme named TSR-DARDA for spherical physical objects is proposed. By dividing the spherical network constructed by dispersed sensor nodes into circular tiers with specifically designed widths and cells, TSTR-DARDA tries to enable as many nodes as possible to transmit data simultaneously. In order to ensure transmission reliability, lost packets are retransmitted. Moreover, to minimize the latency while maintaining reliability for data collection, in-network aggregation and broadcast techniques are adopted to deal with the transmission between data collecting nodes in the outer layer and their parent data collecting nodes in the inner layer. Thus, the optimization problem is transformed to minimize the delay under reliability constraints by controlling the system parameters. To demonstrate the effectiveness of the proposed scheme, we have conducted extensive theoretical analysis and comparisons to evaluate the performance of TSR-DARDA. The analysis and simulations show that TSR-DARDA leads to lower delay with reliability satisfaction. PMID:28218668

Using Link Disconnection Entropy Disorder to Detect Fast Moving Nodes in MANETs.

PubMed

Alvarez, Carlos F; Palafox, Luis E; Aguilar, Leocundo; Sanchez, Mauricio A; Martinez, Luis G

2016-01-01

Mobile ad-hoc networks (MANETs) are dynamic by nature; this dynamism comes from node mobility, traffic congestion, and other transmission conditions. Metrics to evaluate the effects of those conditions shine a light on node's behavior in an ad-hoc network, helping to identify the node or nodes with better conditions of connection. In this paper, we propose a relative index to evaluate a single node reliability, based on the link disconnection entropy disorder using neighboring nodes as reference. Link disconnection entropy disorder is best used to identify fast moving nodes or nodes with unstable communications, this without the need of specialized sensors such as GPS. Several scenarios were studied to verify the index, measuring the effects of Speed and traffic density on the link disconnection entropy disorder. Packet delivery ratio is associated to the metric detecting a strong relationship, enabling the use of the link disconnection entropy disorder to evaluate the stability of a node to communicate with other nodes. To expand the utilization of the link entropy disorder, we identified nodes with higher speeds in network simulations just by using the link entropy disorder.

Network geometry inference using common neighbors

NASA Astrophysics Data System (ADS)

Papadopoulos, Fragkiskos; Aldecoa, Rodrigo; Krioukov, Dmitri

2015-08-01

We introduce and explore a method for inferring hidden geometric coordinates of nodes in complex networks based on the number of common neighbors between the nodes. We compare this approach to the HyperMap method, which is based only on the connections (and disconnections) between the nodes, i.e., on the links that the nodes have (or do not have). We find that for high degree nodes, the common-neighbors approach yields a more accurate inference than the link-based method, unless heuristic periodic adjustments (or "correction steps") are used in the latter. The common-neighbors approach is computationally intensive, requiring O (t4) running time to map a network of t nodes, versus O (t3) in the link-based method. But we also develop a hybrid method with O (t3) running time, which combines the common-neighbors and link-based approaches, and we explore a heuristic that reduces its running time further to O (t2) , without significant reduction in the mapping accuracy. We apply this method to the autonomous systems (ASs) Internet, and we reveal how soft communities of ASs evolve over time in the similarity space. We further demonstrate the method's predictive power by forecasting future links between ASs. Taken altogether, our results advance our understanding of how to efficiently and accurately map real networks to their latent geometric spaces, which is an important necessary step toward understanding the laws that govern the dynamics of nodes in these spaces, and the fine-grained dynamics of network connections.

Noise-induced relations between network connectivity and dynamics

NASA Astrophysics Data System (ADS)

Ching, Emily Sc

Many biological systems of interest can be represented as networks of many nodes that are interacting with one another. Often these systems are subject to external influence or noise. One of the central issues is to understand the relation between dynamics and the interaction pattern of the system or the connectivity structure of the network. In particular, a challenging problem is to infer the network connectivity structure from the dynamics. In this talk, we show that for stochastic dynamical systems subjected to noise, the presence of noise gives rise to mathematical relations between the network connectivity structure and quantities that can be calculated using solely the time-series measurements of the dynamics of the nodes. We present these relations for both undirected networks with bidirectional coupling and directed networks with directional coupling and discuss how such relations can be utilized to infer the network connectivity structure of the systems. Work supported by the Hong Kong Research Grants Council under Grant No. CUHK 14300914.

PRP: peripheral routing protocol for WSN realistic marginal mobility model

NASA Astrophysics Data System (ADS)

Tudorache, I. G.; Popescu, A. M.; Kemp, A. H.

2017-02-01

This article proposes a new routing protocol called Peripheral Routing Protocol (PRP) for the scenario where the mobile destination (D) moves at the wireless sensor network (WSN) periphery for gathering data. From a connectivity point of view, when D follows the marginal mobility model (MMM), the WSN becomes a hybrid network: a sparse network, because of the interrupted connectivity between D and the rest of the nodes and a well-connected network, because of the connectivity between all the other nodes of the WSN except D. It will be proven through MATLAB simulations that, for a military application scenario where D's connectivity to the WSN varies between 10% and 95%, compared with the 100% case, PRP outperforms routing protocols recommended for Mobile Ad-hoc Networks (MANET) in three ways: it maintains an average Packet Delivery Ratio (PDR) over 90%, a below 10% and 5% increase for the Average End to End Delay (AETED) and energy per transmitted packet.

Throughput assurance of wireless body area networks coexistence based on stochastic geometry

PubMed Central

Wang, Yinglong; Shu, Minglei; Wu, Shangbin

2017-01-01

Wireless body area networks (WBANs) are expected to influence the traditional medical model by assisting caretakers with health telemonitoring. Within WBANs, the transmit power of the nodes should be as small as possible owing to their limited energy capacity but should be sufficiently large to guarantee the quality of the signal at the receiving nodes. When multiple WBANs coexist in a small area, the communication reliability and overall throughput can be seriously affected due to resource competition and interference. We show that the total network throughput largely depends on the WBANs distribution density (λp), transmit power of their nodes (Pt), and their carrier-sensing threshold (γ). Using stochastic geometry, a joint carrier-sensing threshold and power control strategy is proposed to meet the demand of coexisting WBANs based on the IEEE 802.15.4 standard. Given different network distributions and carrier-sensing thresholds, the proposed strategy derives a minimum transmit power according to varying surrounding environment. We obtain expressions for transmission success probability and throughput adopting this strategy. Using numerical examples, we show that joint carrier-sensing thresholds and transmit power strategy can effectively improve the overall system throughput and reduce interference. Additionally, this paper studies the effects of a guard zone on the throughput using a Matern hard-core point process (HCPP) type II model. Theoretical analysis and simulation results show that the HCPP model can increase the success probability and throughput of networks. PMID:28141841

Prediction-based Dynamic Energy Management in Wireless Sensor Networks

PubMed Central

Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei

2007-01-01

Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

Circuit theory and model-based inference for landscape connectivity

USGS Publications Warehouse

Hanks, Ephraim M.; Hooten, Mevin B.

2013-01-01

Circuit theory has seen extensive recent use in the field of ecology, where it is often applied to study functional connectivity. The landscape is typically represented by a network of nodes and resistors, with the resistance between nodes a function of landscape characteristics. The effective distance between two locations on a landscape is represented by the resistance distance between the nodes in the network. Circuit theory has been applied to many other scientific fields for exploratory analyses, but parametric models for circuits are not common in the scientific literature. To model circuits explicitly, we demonstrate a link between Gaussian Markov random fields and contemporary circuit theory using a covariance structure that induces the necessary resistance distance. This provides a parametric model for second-order observations from such a system. In the landscape ecology setting, the proposed model provides a simple framework where inference can be obtained for effects that landscape features have on functional connectivity. We illustrate the approach through a landscape genetics study linking gene flow in alpine chamois (Rupicapra rupicapra) to the underlying landscape.

Topological relationships between brain and social networks.

PubMed

Sakata, Shuzo; Yamamori, Tetsuo

2007-01-01

Brains are complex networks. Previously, we revealed that specific connected structures are either significantly abundant or rare in cortical networks. However, it remains unknown whether systems from other disciplines have similar architectures to brains. By applying network-theoretical methods, here we show topological similarities between brain and social networks. We found that the statistical relevance of specific tied structures differs between social "friendship" and "disliking" networks, suggesting relation-type-specific topology of social networks. Surprisingly, overrepresented connected structures in brain networks are more similar to those in the friendship networks than to those in other networks. We found that balanced and imbalanced reciprocal connections between nodes are significantly abundant and rare, respectively, whereas these results are unpredictable by simply counting mutual connections. We interpret these results as evidence of positive selection of balanced mutuality between nodes. These results also imply the existence of underlying common principles behind the organization of brain and social networks.

Adaptive MCS selection and resource planning for energy-efficient communication in LTE-M based IoT sensing platform.

PubMed

Dao, Nhu-Ngoc; Park, Minho; Kim, Joongheon; Cho, Sungrae

2017-01-01

As an important part of IoTization trends, wireless sensing technologies have been involved in many fields of human life. In cellular network evolution, the long term evolution advanced (LTE-A) networks including machine-type communication (MTC) features (named LTE-M) provide a promising infrastructure for a proliferation of Internet of things (IoT) sensing platform. However, LTE-M may not be optimally exploited for directly supporting such low-data-rate devices in terms of energy efficiency since it depends on core technologies of LTE that are originally designed for high-data-rate services. Focusing on this circumstance, we propose a novel adaptive modulation and coding selection (AMCS) algorithm to address the energy consumption problem in the LTE-M based IoT-sensing platform. The proposed algorithm determines the optimal pair of MCS and the number of primary resource blocks (#PRBs), at which the transport block size is sufficient to packetize the sensing data within the minimum transmit power. In addition, a quantity-oriented resource planning (QORP) technique that utilizes these optimal MCS levels as main criteria for spectrum allocation has been proposed for better adapting to the sensing node requirements. The simulation results reveal that the proposed approach significantly reduces the energy consumption of IoT sensing nodes and #PRBs up to 23.09% and 25.98%, respectively.

Adaptive MCS selection and resource planning for energy-efficient communication in LTE-M based IoT sensing platform

PubMed Central

Dao, Nhu-Ngoc; Park, Minho; Kim, Joongheon

2017-01-01

As an important part of IoTization trends, wireless sensing technologies have been involved in many fields of human life. In cellular network evolution, the long term evolution advanced (LTE-A) networks including machine-type communication (MTC) features (named LTE-M) provide a promising infrastructure for a proliferation of Internet of things (IoT) sensing platform. However, LTE-M may not be optimally exploited for directly supporting such low-data-rate devices in terms of energy efficiency since it depends on core technologies of LTE that are originally designed for high-data-rate services. Focusing on this circumstance, we propose a novel adaptive modulation and coding selection (AMCS) algorithm to address the energy consumption problem in the LTE-M based IoT-sensing platform. The proposed algorithm determines the optimal pair of MCS and the number of primary resource blocks (#PRBs), at which the transport block size is sufficient to packetize the sensing data within the minimum transmit power. In addition, a quantity-oriented resource planning (QORP) technique that utilizes these optimal MCS levels as main criteria for spectrum allocation has been proposed for better adapting to the sensing node requirements. The simulation results reveal that the proposed approach significantly reduces the energy consumption of IoT sensing nodes and #PRBs up to 23.09% and 25.98%, respectively. PMID:28796804

Escape and evade control policies for ensuring the physical security of nonholonomic, ground-based, unattended mobile sensor nodes

NASA Astrophysics Data System (ADS)

Mascarenas, David; Stull, Christopher; Farrar, Charles

2011-06-01

In order to realize the wide-scale deployment of high-endurance, unattended mobile sensing technologies, it is vital to ensure the self-preservation of the sensing assets. Deployed mobile sensor nodes face a variety of physical security threats including theft, vandalism and physical damage. Unattended mobile sensor nodes must be able to respond to these threats with control policies that facilitate escape and evasion to a low-risk state. In this work the Precision Immobilization Technique (PIT) problem has been considered. The PIT maneuver is a technique that a pursuing, car-like vehicle can use to force a fleeing vehicle to abruptly turn ninety degrees to the direction of travel. The abrupt change in direction generally causes the fleeing driver to lose control and stop. The PIT maneuver was originally developed by law enforcement to end vehicular pursuits in a manner that minimizes damage to the persons and property involved. It is easy to imagine that unattended autonomous convoys could be targets of this type of action by adversarial agents. This effort focused on developing control policies unattended mobile sensor nodes could employ to escape, evade and recover from PIT-maneuver-like attacks. The development of these control policies involved both simulation as well as small-scale experimental testing. The goal of this work is to be a step toward ensuring the physical security of unattended sensor node assets.

Neighboring and connectivity-aware routing in VANETs.

PubMed

Ghafoor, Huma; Koo, Insoo; Gohar, Nasir-ud-Din

2014-01-01

A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

Dynamic graph system for a semantic database

DOEpatents

Mizell, David

2016-04-12

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Dynamic graph system for a semantic database

DOEpatents

Mizell, David

2015-01-27

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

KENNEDY SPACE CENTER, FLA. - Astronaut Tim Kopra (facing camera) aids in Intravehicular Activity (IVA) constraints testing on the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

NASA Image and Video Library

2004-02-03

KENNEDY SPACE CENTER, FLA. - Astronaut Tim Kopra (facing camera) aids in Intravehicular Activity (IVA) constraints testing on the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

KENNEDY SPACE CENTER, FLA. - Astronaut Tim Kopra talks to a technician (off-camera) during Intravehicular Activity (IVA) constraints testing on the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

NASA Image and Video Library

2004-02-03

KENNEDY SPACE CENTER, FLA. - Astronaut Tim Kopra talks to a technician (off-camera) during Intravehicular Activity (IVA) constraints testing on the Italian-built Node 2, a future element of the International Space Station. The second of three Station connecting modules, the Node 2 attaches to the end of the U.S. Lab and provides attach locations for several other elements. Kopra is currently assigned technical duties in the Space Station Branch of the Astronaut Office, where his primary focus involves the testing of crew interfaces for two future ISS modules as well as the implementation of support computers and operational Local Area Network on ISS. Node 2 is scheduled to launch on mission STS-120, Station assembly flight 10A.

A Novel Topology Control Approach to Maintain the Node Degree in Dynamic Wireless Sensor Networks

PubMed Central

Huang, Yuanjiang; Martínez, José-Fernán; Díaz, Vicente Hernández; Sendra, Juana

2014-01-01

Topology control is an important technique to improve the connectivity and the reliability of Wireless Sensor Networks (WSNs) by means of adjusting the communication range of wireless sensor nodes. In this paper, a novel Fuzzy-logic Topology Control (FTC) is proposed to achieve any desired average node degree by adaptively changing communication range, thus improving the network connectivity, which is the main target of FTC. FTC is a fully localized control algorithm, and does not rely on location information of neighbors. Instead of designing membership functions and if-then rules for fuzzy-logic controller, FTC is constructed from the training data set to facilitate the design process. FTC is proved to be accurate, stable and has short settling time. In order to compare it with other representative localized algorithms (NONE, FLSS, k-Neighbor and LTRT), FTC is evaluated through extensive simulations. The simulation results show that: firstly, similar to k-Neighbor algorithm, FTC is the best to achieve the desired average node degree as node density varies; secondly, FTC is comparable to FLSS and k-Neighbor in terms of energy-efficiency, but is better than LTRT and NONE; thirdly, FTC has the lowest average maximum communication range than other algorithms, which indicates that the most energy-consuming node in the network consumes the lowest power. PMID:24608008

Interference Effects Redress over Power-Efficient Wireless-Friendly Mesh Networks for Ubiquitous Sensor Communications across Smart Cities.

PubMed

Santana, Jose; Marrero, Domingo; Macías, Elsa; Mena, Vicente; Suárez, Álvaro

2017-07-21

Ubiquitous sensing allows smart cities to take control of many parameters (e.g., road traffic, air or noise pollution levels, etc.). An inexpensive Wireless Mesh Network can be used as an efficient way to transport sensed data. When that mesh is autonomously powered (e.g., solar powered), it constitutes an ideal portable network system which can be deployed when needed. Nevertheless, its power consumption must be restrained to extend its operational cycle and for preserving the environment. To this end, our strategy fosters wireless interface deactivation among nodes which do not participate in any route. As we show, this contributes to a significant power saving for the mesh. Furthermore, our strategy is wireless-friendly, meaning that it gives priority to deactivation of nodes receiving (and also causing) interferences from (to) the rest of the smart city. We also show that a routing protocol can adapt to this strategy in which certain nodes deactivate their own wireless interfaces.

Interference Effects Redress over Power-Efficient Wireless-Friendly Mesh Networks for Ubiquitous Sensor Communications across Smart Cities

PubMed Central

Marrero, Domingo; Macías, Elsa; Mena, Vicente

2017-01-01

Ubiquitous sensing allows smart cities to take control of many parameters (e.g., road traffic, air or noise pollution levels, etc.). An inexpensive Wireless Mesh Network can be used as an efficient way to transport sensed data. When that mesh is autonomously powered (e.g., solar powered), it constitutes an ideal portable network system which can be deployed when needed. Nevertheless, its power consumption must be restrained to extend its operational cycle and for preserving the environment. To this end, our strategy fosters wireless interface deactivation among nodes which do not participate in any route. As we show, this contributes to a significant power saving for the mesh. Furthermore, our strategy is wireless-friendly, meaning that it gives priority to deactivation of nodes receiving (and also causing) interferences from (to) the rest of the smart city. We also show that a routing protocol can adapt to this strategy in which certain nodes deactivate their own wireless interfaces. PMID:28754013

A Data-Gathering Scheme with Joint Routing and Compressive Sensing Based on Modified Diffusion Wavelets in Wireless Sensor Networks.

PubMed

Gu, Xiangping; Zhou, Xiaofeng; Sun, Yanjing

2018-02-28

Compressive sensing (CS)-based data gathering is a promising method to reduce energy consumption in wireless sensor networks (WSNs). Traditional CS-based data-gathering approaches require a large number of sensor nodes to participate in each CS measurement task, resulting in high energy consumption, and do not guarantee load balance. In this paper, we propose a sparser analysis that depends on modified diffusion wavelets, which exploit sensor readings' spatial correlation in WSNs. In particular, a novel data-gathering scheme with joint routing and CS is presented. A modified ant colony algorithm is adopted, where next hop node selection takes a node's residual energy and path length into consideration simultaneously. Moreover, in order to speed up the coverage rate and avoid the local optimal of the algorithm, an improved pheromone impact factor is put forward. More importantly, theoretical proof is given that the equivalent sensing matrix generated can satisfy the restricted isometric property (RIP). The simulation results demonstrate that the modified diffusion wavelets' sparsity affects the sensor signal and has better reconstruction performance than DFT. Furthermore, our data gathering with joint routing and CS can dramatically reduce the energy consumption of WSNs, balance the load, and prolong the network lifetime in comparison to state-of-the-art CS-based methods.

75 FR 52555 - Notice of Availability of a Draft Site-Specific Environmental Assessment and Notice of Public...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-26

... vessel cruises (expeditions) as the predominate means to make direct measurements of the ocean. Remote sensing (use of satellites) has greatly advanced abilities to measure ocean surface characteristics over... sensing in the Eastern Pacific and Atlantic oceans. The Regional-Scale Nodes (RSN) off the coast of...

Optimal Quantum Spatial Search on Random Temporal Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Word embeddings and recurrent neural networks based on Long-Short Term Memory nodes in supervised biomedical word sense disambiguation.

PubMed

Jimeno Yepes, Antonio

2017-09-01

Word sense disambiguation helps identifying the proper sense of ambiguous words in text. With large terminologies such as the UMLS Metathesaurus ambiguities appear and highly effective disambiguation methods are required. Supervised learning algorithm methods are used as one of the approaches to perform disambiguation. Features extracted from the context of an ambiguous word are used to identify the proper sense of such a word. The type of features have an impact on machine learning methods, thus affect disambiguation performance. In this work, we have evaluated several types of features derived from the context of the ambiguous word and we have explored as well more global features derived from MEDLINE using word embeddings. Results show that word embeddings improve the performance of more traditional features and allow as well using recurrent neural network classifiers based on Long-Short Term Memory (LSTM) nodes. The combination of unigrams and word embeddings with an SVM sets a new state of the art performance with a macro accuracy of 95.97 in the MSH WSD data set. Copyright © 2017 Elsevier Inc. All rights reserved.

Energy Analysis of Decoders for Rakeness-Based Compressed Sensing of ECG Signals.

PubMed

Pareschi, Fabio; Mangia, Mauro; Bortolotti, Daniele; Bartolini, Andrea; Benini, Luca; Rovatti, Riccardo; Setti, Gianluca

2017-12-01

In recent years, compressed sensing (CS) has proved to be effective in lowering the power consumption of sensing nodes in biomedical signal processing devices. This is due to the fact the CS is capable of reducing the amount of data to be transmitted to ensure correct reconstruction of the acquired waveforms. Rakeness-based CS has been introduced to further reduce the amount of transmitted data by exploiting the uneven distribution to the sensed signal energy. Yet, so far no thorough analysis exists on the impact of its adoption on CS decoder performance. The latter point is of great importance, since body-area sensor network architectures may include intermediate gateway nodes that receive and reconstruct signals to provide local services before relaying data to a remote server. In this paper, we fill this gap by showing that rakeness-based design also improves reconstruction performance. We quantify these findings in the case of ECG signals and when a variety of reconstruction algorithms are used either in a low-power microcontroller or a heterogeneous mobile computing platform.

The imaging node for the Planetary Data System

USGS Publications Warehouse

Eliason, E.M.; LaVoie, S.K.; Soderblom, L.A.

1996-01-01

The Planetary Data System Imaging Node maintains and distributes the archives of planetary image data acquired from NASA's flight projects with the primary goal of enabling the science community to perform image processing and analysis on the data. The Node provides direct and easy access to the digital image archives through wide distribution of the data on CD-ROM media and on-line remote-access tools by way of Internet services. The Node provides digital image processing tools and the expertise and guidance necessary to understand the image collections. The data collections, now approaching one terabyte in volume, provide a foundation for remote sensing studies for virtually all the planetary systems in our solar system (except for Pluto). The Node is responsible for restoring data sets from past missions in danger of being lost. The Node works with active flight projects to assist in the creation of their archive products and to ensure that their products and data catalogs become an integral part of the Node's data collections.

Performance Evaluation of AODV with Blackhole Attack

NASA Astrophysics Data System (ADS)

Dara, Karuna

2010-11-01

A Mobile Ad Hoc Network (MANET) is a temporary network set up by a wireless mobile computers moving arbitrary in the places that have no network infrastructure. These nodes maintain connectivity in a decentralized manner. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network. Thus the nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, mobile ad-hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. In this paper, we simulated the black hole attack in various mobile ad-hoc network scenarios using AODV routing protocol of MANET and have tried to find a effect if number of nodes are increased with increase in malicious nodes.

Tau burden and the functional connectome in Alzheimer's disease and progressive supranuclear palsy.

PubMed

Cope, Thomas E; Rittman, Timothy; Borchert, Robin J; Jones, P Simon; Vatansever, Deniz; Allinson, Kieren; Passamonti, Luca; Vazquez Rodriguez, Patricia; Bevan-Jones, W Richard; O'Brien, John T; Rowe, James B

2018-02-01

Alzheimer's disease and progressive supranuclear palsy (PSP) represent neurodegenerative tauopathies with predominantly cortical versus subcortical disease burden. In Alzheimer's disease, neuropathology and atrophy preferentially affect 'hub' brain regions that are densely connected. It was unclear whether hubs are differentially affected by neurodegeneration because they are more likely to receive pathological proteins that propagate trans-neuronally, in a prion-like manner, or whether they are selectively vulnerable due to a lack of local trophic factors, higher metabolic demands, or differential gene expression. We assessed the relationship between tau burden and brain functional connectivity, by combining in vivo PET imaging using the ligand AV-1451, and graph theoretic measures of resting state functional MRI in 17 patients with Alzheimer's disease, 17 patients with PSP, and 12 controls. Strongly connected nodes displayed more tau pathology in Alzheimer's disease, independently of intrinsic connectivity network, validating the predictions of theories of trans-neuronal spread but not supporting a role for metabolic demands or deficient trophic support in tau accumulation. This was not a compensatory phenomenon, as the functional consequence of increasing tau burden in Alzheimer's disease was a progressive weakening of the connectivity of these same nodes, reducing weighted degree and local efficiency and resulting in weaker 'small-world' properties. Conversely, in PSP, unlike in Alzheimer's disease, those nodes that accrued pathological tau were those that displayed graph metric properties associated with increased metabolic demand and a lack of trophic support rather than strong functional connectivity. Together, these findings go some way towards explaining why Alzheimer's disease affects large scale connectivity networks throughout cortex while neuropathology in PSP is concentrated in a small number of subcortical structures. Further, we demonstrate that in PSP increasing tau burden in midbrain and deep nuclei was associated with strengthened cortico-cortical functional connectivity. Disrupted cortico-subcortical and cortico-brainstem interactions meant that information transfer took less direct paths, passing through a larger number of cortical nodes, reducing closeness centrality and eigenvector centrality in PSP, while increasing weighted degree, clustering, betweenness centrality and local efficiency. Our results have wide-ranging implications, from the validation of models of tau trafficking in humans to understanding the relationship between regional tau burden and brain functional reorganization. © The Author(s) (2018). Published by Oxford University Press on behalf of the Guarantors of Brain.

Strength of Structural and Functional Frontostriatal Connectivity Predicts Self-Control in the Healthy Elderly

PubMed Central

Hänggi, Jürgen; Lohrey, Corinna; Drobetz, Reinhard; Baetschmann, Hansruedi; Forstmeier, Simon; Maercker, Andreas; Jäncke, Lutz

2016-01-01

Self-regulation refers to the successful use of executive functions and initiation of top-down processes to control one's thoughts, behavior, and emotions, and it is crucial to perform self-control. Self-control is needed to overcome impulses and can be assessed by delay of gratification (DoG) and delay discounting (DD) paradigms. In children/adolescents, good DoG/DD ability depends on the maturity of frontostriatal connectivity, and its decline in strength with advancing age might adversely affect self-control because prefrontal brain regions are more prone to normal age-related atrophy than other regions. Here, we aimed at highlighting the relationship between frontostriatal connectivity strength and DoG performance in advanced age. We recruited 40 healthy elderly individuals (mean age 74.0 ± 7.7 years) and assessed the DoG ability using the German version of the DoG test for adults in addition to the delay discounting (DD) paradigm. Based on diffusion-weighted and resting-state functional magnetic resonance imaging data, respectively, the structural and functional whole-brain connectome were reconstructed based on 90 different brain regions of interest in addition to a 12-node frontostriatal DoG-specific network and the resulting connectivity matrices were subjected to network-based statistics. The 90-nodes whole-brain connectome analyses revealed subnetworks significantly associated with DoG and DD with a preponderance of frontostriatal nodes involved suggesting a high specificity of the findings. Structural and functional connectivity strengths between the putamen, caudate nucleus, and nucleus accumbens on the one hand and orbitofrontal, dorsal, and ventral lateral prefrontal cortices on the other hand showed strong positive correlations with DoG and negative correlations with DD corrected for age, sex, intracranial volume, and head motion parameters. These associations cannot be explained by differences in impulsivity and executive functioning. This pattern of correlations between structural or functional frontostriatal connectivity strength and self-control suggests that, in addition to the importance of the frontostriatal nodes itself, the structural and functional properties of different connections within the frontostriatal network are crucial for self-controlled behaviors in the healthy elderly. Because high DoG/low DD is a significant predictor of willpower and wellbeing in the elderly population, interventions aiming at strengthening frontostriatal connectivity to strengthen self-controlled behavior are needed in the future. PMID:28105013

Laterality effects in functional connectivity of the angular gyrus during rest and episodic retrieval.

PubMed

Bellana, Buddhika; Liu, Zhongxu; Anderson, John A E; Moscovitch, Morris; Grady, Cheryl L

2016-01-08

The angular gyrus (AG) is consistently reported in neuroimaging studies of episodic memory retrieval and is a fundamental node within the default mode network (DMN). Its specific contribution to episodic memory is debated, with some suggesting it is important for the subjective experience of episodic recollection, rather than retrieval of objective episodic details. Across studies of episodic retrieval, the left AG is recruited more reliably than the right. We explored functional connectivity of the right and left AG with the DMN during rest and retrieval to assess whether connectivity could provide insight into the nature of this laterality effect. Using data from the publically available 1000 Functional Connectome Project, 8min of resting fMRI data from 180 healthy young adults were analysed. Whole-brain functional connectivity at rest was measured using a seed-based Partial Least Squares (seed-PLS) approach (McIntosh and Lobaugh, 2004) with bilateral AG seeds. A subsequent analysis used 6-min of rest and 6-min of unconstrained, silent retrieval of autobiographical events from a new sample of 20 younger adults. Analysis of this dataset took a more targeted approach to functional connectivity analysis, consisting of univariate pairwise correlations restricted to nodes of the DMN. The seed-PLS analysis resulted in two Latent Variables that together explained ~86% of the shared cross-block covariance. The first LV revealed a common network consistent with the DMN and engaging the AG bilaterally, whereas the second LV revealed a less robust, yet significant, laterality effect in connectivity - the left AG was more strongly connected to the DMN. Univariate analyses of the second sample again revealed better connectivity between the left AG and the DMN at rest. However, during retrieval the left AG was more strongly connected than the right to non-medial temporal (MTL) nodes of the DMN, and MTL nodes were more strongly connected to the right AG. The multivariate analysis of resting connectivity revealed that the left and right AG show similar connectivity with the DMN. Only after accounting for this commonality were we able to detect a left laterality effect in DMN connectivity. Further probing with univariate connectivity analyses during retrieval demonstrates that the left preference we observe is restricted to the non-MTL regions of the DMN, whereas the right AG shows significantly better connectivity with the MTL. These data suggest bilateral involvement of the AG during retrieval, despite the focus on the left AG in the literature. Furthermore, the results suggest that the contribution of the left AG to retrieval may be separable from that of the MTL, consistent with a role for the left AG in the subjective aspects of recollection in memory, whereas the MTL and the right AG may contribute to objective recollection of specific memory details. Copyright © 2015 Elsevier Ltd. All rights reserved.

Remodeling of sinus node function after catheter ablation of right atrial flutter.

PubMed

Daoud, Emile G; Weiss, Raul; Augostini, Ralph S; Kalbfleisch, Steven J; Schroeder, Jason; Polsinelli, Georgia; Hummel, John D

2002-01-01

The purpose of this study was to investigate the effect of ablation of right atrial flutter upon sinus node function in humans. This study enrolled 35 patients. Twenty-four patients (16 men and 8 women; age 68 +/- 11 years) were referred for ablation of persistent atrial flutter (duration 8 +/- 11 months). After ablation, there was abnormal sinus node function defined as a corrected sinus node recovery time (CSNRT) > or = 550 msec. The control group consisted of 11 patients who were undergoing pacemaker implantation for sinus node disease but did not have a history of atrial dysrhythmias or ablation. Within 24 hours of ablation or pacemaker implantation, baseline maximal CSNRT was measured through a permanent pacemaker by AAI pacing at six cycle lengths: 600, 550, 500, 450, 400, and 350 msec. CSNRT then was measured in the same manner at 48 hours, 14 days, and 3 months after ablation/pacemaker implantation. P wave amplitude and duration, and percent atrial sensing also were assessed at the same intervals. For patients undergoing atrial flutter ablation, there was progressive temporal recovery of CSNRT (1,204 +/- 671 msec at baseline vs 834 +/- 380 msec at 3 months; P < 0.001) and a significant increase in the percent atrial sensing and P wave amplitude at 3 months compared with baseline (P < 0.001). In control subjects, there was no change in the CSNRT, percent atrial pacing, or P wave amplitude. After ablation of persistent atrial flutter, there is temporal recovery of CSNRT and increase in spontaneous atrial activity. These findings suggest that atrial flutter induces reversible changes in sinus node function.

The BlueGene/L supercomputer

NASA Astrophysics Data System (ADS)

Bhanota, Gyan; Chen, Dong; Gara, Alan; Vranas, Pavlos

2003-05-01

The architecture of the BlueGene/L massively parallel supercomputer is described. Each computing node consists of a single compute ASIC plus 256 MB of external memory. The compute ASIC integrates two 700 MHz PowerPC 440 integer CPU cores, two 2.8 Gflops floating point units, 4 MB of embedded DRAM as cache, a memory controller for external memory, six 1.4 Gbit/s bi-directional ports for a 3-dimensional torus network connection, three 2.8 Gbit/s bi-directional ports for connecting to a global tree network and a Gigabit Ethernet for I/O. 65,536 of such nodes are connected into a 3-d torus with a geometry of 32×32×64. The total peak performance of the system is 360 Teraflops and the total amount of memory is 16 TeraBytes.

Indentations and Starting Points in Traveling Sales Tour Problems: Implications for Theory

ERIC Educational Resources Information Center

MacGregor, James N.

2012-01-01

A complete, non-trivial, traveling sales tour problem contains at least one "indentation", where nodes in the interior of the point set are connected between two adjacent nodes on the boundary. Early research reported that human tours exhibited fewer such indentations than expected. A subsequent explanation proposed that this was because…

Effect of resource constraints on intersimilar coupled networks.

PubMed

Shai, S; Dobson, S

2012-12-01

Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.

EdgeMaps: visualizing explicit and implicit relations

NASA Astrophysics Data System (ADS)

Dörk, Marian; Carpendale, Sheelagh; Williamson, Carey

2011-01-01

In this work, we introduce EdgeMaps as a new method for integrating the visualization of explicit and implicit data relations. Explicit relations are specific connections between entities already present in a given dataset, while implicit relations are derived from multidimensional data based on shared properties and similarity measures. Many datasets include both types of relations, which are often difficult to represent together in information visualizations. Node-link diagrams typically focus on explicit data connections, while not incorporating implicit similarities between entities. Multi-dimensional scaling considers similarities between items, however, explicit links between nodes are not displayed. In contrast, EdgeMaps visualize both implicit and explicit relations by combining and complementing spatialization and graph drawing techniques. As a case study for this approach we chose a dataset of philosophers, their interests, influences, and birthdates. By introducing the limitation of activating only one node at a time, interesting visual patterns emerge that resemble the aesthetics of fireworks and waves. We argue that the interactive exploration of these patterns may allow the viewer to grasp the structure of a graph better than complex node-link visualizations.

Information spreading on mobile communication networks: A new model that incorporates human behaviors

NASA Astrophysics Data System (ADS)

Ren, Fei; Li, Sai-Ping; Liu, Chuang

2017-03-01

Recently, there is a growing interest in the modeling and simulation based on real social networks among researchers in multi-disciplines. Using an empirical social network constructed from the calling records of a Chinese mobile service provider, we here propose a new model to simulate the information spreading process. This model takes into account two important ingredients that exist in real human behaviors: information prevalence and preferential spreading. The fraction of informed nodes when the system reaches an asymptotically stable state is primarily determined by information prevalence, and the heterogeneity of link weights would slow down the information diffusion. Moreover, the sizes of blind clusters which consist of connected uninformed nodes show a power-law distribution, and these uninformed nodes correspond to a particular portion of nodes which are located at special positions in the network, namely at the edges of large clusters or inside the clusters connected through weak links. Since the simulations are performed on a real world network, the results should be useful in the understanding of the influences of social network structures and human behaviors on information propagation.

Effect of resource constraints on intersimilar coupled networks

NASA Astrophysics Data System (ADS)

Shai, S.; Dobson, S.

2012-12-01

Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.

A convex optimization method for self-organization in dynamic (FSO/RF) wireless networks

NASA Astrophysics Data System (ADS)

Llorca, Jaime; Davis, Christopher C.; Milner, Stuart D.

2008-08-01

Next generation communication networks are becoming increasingly complex systems. Previously, we presented a novel physics-based approach to model dynamic wireless networks as physical systems which react to local forces exerted on network nodes. We showed that under clear atmospheric conditions the network communication energy can be modeled as the potential energy of an analogous spring system and presented a distributed mobility control algorithm where nodes react to local forces driving the network to energy minimizing configurations. This paper extends our previous work by including the effects of atmospheric attenuation and transmitted power constraints in the optimization problem. We show how our new formulation still results in a convex energy minimization problem. Accordingly, an updated force-driven mobility control algorithm is presented. Forces on mobile backbone nodes are computed as the negative gradient of the new energy function. Results show how in the presence of atmospheric obscuration stronger forces are exerted on network nodes that make them move closer to each other, avoiding loss of connectivity. We show results in terms of network coverage and backbone connectivity and compare the developed algorithms for different scenarios.

Network testbed creation and validation

DOEpatents

Thai, Tan Q.; Urias, Vincent; Van Leeuwen, Brian P.; Watts, Kristopher K.; Sweeney, Andrew John

2017-03-21

Embodiments of network testbed creation and validation processes are described herein. A "network testbed" is a replicated environment used to validate a target network or an aspect of its design. Embodiments describe a network testbed that comprises virtual testbed nodes executed via a plurality of physical infrastructure nodes. The virtual testbed nodes utilize these hardware resources as a network "fabric," thereby enabling rapid configuration and reconfiguration of the virtual testbed nodes without requiring reconfiguration of the physical infrastructure nodes. Thus, in contrast to prior art solutions which require a tester manually build an emulated environment of physically connected network devices, embodiments receive or derive a target network description and build out a replica of this description using virtual testbed nodes executed via the physical infrastructure nodes. This process allows for the creation of very large (e.g., tens of thousands of network elements) and/or very topologically complex test networks.

Global epidemic invasion thresholds in directed cattle subpopulation networks having source, sink, and transit nodes.

PubMed

Schumm, Phillip; Scoglio, Caterina; Zhang, Qian; Balcan, Duygu

2015-02-21

Through the characterization of a metapopulation cattle disease model on a directed network having source, transit, and sink nodes, we derive two global epidemic invasion thresholds. The first threshold defines the conditions necessary for an epidemic to successfully spread at the global scale. The second threshold defines the criteria that permit an epidemic to move out of the giant strongly connected component and to invade the populations of the sink nodes. As each sink node represents a final waypoint for cattle before slaughter, the existence of an epidemic among the sink nodes is a serious threat to food security. We find that the relationship between these two thresholds depends on the relative proportions of transit and sink nodes in the system and the distributions of the in-degrees of both node types. These analytic results are verified through numerical realizations of the metapopulation cattle model. Published by Elsevier Ltd.

Line-plane broadcasting in a data communications network of a parallel computer

DOEpatents

Archer, Charles J.; Berg, Jeremy E.; Blocksome, Michael A.; Smith, Brian E.

2010-06-08

Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

Line-plane broadcasting in a data communications network of a parallel computer

DOEpatents

Archer, Charles J.; Berg, Jeremy E.; Blocksome, Michael A.; Smith, Brian E.

2010-11-23

Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

Network testbed creation and validation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Thai, Tan Q.; Urias, Vincent; Van Leeuwen, Brian P.

Embodiments of network testbed creation and validation processes are described herein. A "network testbed" is a replicated environment used to validate a target network or an aspect of its design. Embodiments describe a network testbed that comprises virtual testbed nodes executed via a plurality of physical infrastructure nodes. The virtual testbed nodes utilize these hardware resources as a network "fabric," thereby enabling rapid configuration and reconfiguration of the virtual testbed nodes without requiring reconfiguration of the physical infrastructure nodes. Thus, in contrast to prior art solutions which require a tester manually build an emulated environment of physically connected network devices,more » embodiments receive or derive a target network description and build out a replica of this description using virtual testbed nodes executed via the physical infrastructure nodes. This process allows for the creation of very large (e.g., tens of thousands of network elements) and/or very topologically complex test networks.« less

Connecting to HPC VPN | High-Performance Computing | NREL

Science.gov Websites

and password will match your NREL network account login/password. From OS X or Linux, open a terminal finalized. Open a Remote Desktop connection using server name WINHPC02 (this is the login node). Mac Mac

Joint Information Theoretic and Differential Geometrical Approach for Robust Automated Target Recognition

DTIC Science & Technology

2012-02-29

surface and Swiss roll) and real-world data sets (UCI Machine Learning Repository [12] and USPS digit handwriting data). In our experiments, we use...less than µn ( say µ = 0.8), we can first use screening technique to select µn candidate nodes, and then apply BIPS on them for further selection and...identified from node j to node i. So we can say the probability for the existence of this connection is approximately 82%. Given the probability matrix

Emergence of rich-club topology and coordinated dynamics in development of hippocampal functional networks in vitro.

PubMed

Schroeter, Manuel S; Charlesworth, Paul; Kitzbichler, Manfred G; Paulsen, Ole; Bullmore, Edward T

2015-04-08

Recent studies demonstrated that the anatomical network of the human brain shows a "rich-club" organization. This complex topological feature implies that highly connected regions, hubs of the large-scale brain network, are more densely interconnected with each other than expected by chance. Rich-club nodes were traversed by a majority of short paths between peripheral regions, underlining their potential importance for efficient global exchange of information between functionally specialized areas of the brain. Network hubs have also been described at the microscale of brain connectivity (so-called "hub neurons"). Their role in shaping synchronous dynamics and forming microcircuit wiring during development, however, is not yet fully understood. The present study aimed to investigate the role of hubs during network development, using multi-electrode arrays and functional connectivity analysis during spontaneous multi-unit activity (MUA) of dissociated primary mouse hippocampal neurons. Over the first 4 weeks in vitro, functional connectivity significantly increased in strength, density, and size, with mature networks demonstrating a robust modular and small-world topology. As expected by a "rich-get-richer" growth rule of network evolution, MUA graphs were found to form rich-clubs at an early stage in development (14 DIV). Later on, rich-club nodes were a consistent topological feature of MUA graphs, demonstrating high nodal strength, efficiency, and centrality. Rich-club nodes were also found to be crucial for MUA dynamics. They often served as broker of spontaneous activity flow, confirming that hub nodes and rich-clubs may play an important role in coordinating functional dynamics at the microcircuit level. Copyright © 2015 the authors 0270-6474/15/355459-12$15.00/0.

Sensor node for remote monitoring of waterborne disease-causing bacteria.

PubMed

Kim, Kyukwang; Myung, Hyun

2015-05-05

A sensor node for sampling water and checking for the presence of harmful bacteria such as E. coli in water sources was developed in this research. A chromogenic enzyme substrate assay method was used to easily detect coliform bacteria by monitoring the color change of the sampled water mixed with a reagent. Live webcam image streaming to the web browser of the end user with a Wi-Fi connected sensor node shows the water color changes in real time. The liquid can be manipulated on the web-based user interface, and also can be observed by webcam feeds. Image streaming and web console servers run on an embedded processor with an expansion board. The UART channel of the expansion board is connected to an external Arduino board and a motor driver to control self-priming water pumps to sample the water, mix the reagent, and remove the water sample after the test is completed. The sensor node can repeat water testing until the test reagent is depleted. The authors anticipate that the use of the sensor node developed in this research can decrease the cost and required labor for testing samples in a factory environment and checking the water quality of local water sources in developing countries.

The raw disk i/o performance of compaq storage works RAID arrays under tru64 unix

DOE Office of Scientific and Technical Information (OSTI.GOV)

Uselton, A C

2000-10-19

We report on the raw disk i/o performance of a set of Compaq StorageWorks RAID arrays connected to our cluster of Compaq ES40 computers via Fibre Channel. The best cumulative peak sustained data rate is l17MB/s per node for reads and 77MB/s per node for writes. This value occurs for a configuration in which a node has two Fibre Channel interfaces to a switch, which in turn has two connections to each of two Compaq StorageWorks RAID arrays. Each RAID array has two HSG80 RAID controllers controlling (together) two 5+p RAID chains. A 10% more space efficient arrangement using amore » single 1l+p RAID chain in place of the two 5+P chains is 25% slower for reads and 40% slower for writes.« less

The stability of financial market networks

NASA Astrophysics Data System (ADS)

Yan, Xin-Guo; Xie, Chi; Wang, Gang-Jin

2014-08-01

We investigate the stability of a financial market network by measuring its topological robustness, namely the ability of the network to resist structural or topological changes. The closing prices of 710 stocks in the Shanghai Stock Exchange (SSE) from 2005 to 2011 are chosen as the empirical data. We divide the period into three sub-periods: before, during, and after the US sub-prime crisis. By monitoring the size of the clusters which fall apart from the network after removing the nodes (i.e., the listed companies in the SSE), we find that: i) the SSE network is sensitive to the nodes' failure, which implies that the network is unstable. ii) the SSE network before the financial crisis has the strongest robustness against the intentional topological damage; iii) the hubs (i.e., highly connected nodes) connect with each other directly and play a vital important role in maintaining SSE network's stability.

Multiple Sensing Application on Wireless Sensor Network Simulation using NS3

NASA Astrophysics Data System (ADS)

Kurniawan, I. F.; Bisma, R.

2018-01-01

Hardware enhancement provides opportunity to install various sensor device on single monitoring node which then enables users to acquire multiple data simultaneously. Constructing multiple sensing application in NS3 is a challenging task since numbers of aspects such as wireless communication, packet transmission pattern, and energy model must be taken into account. Despite of numerous types of monitoring data available, this study only considers two types such as periodic, and event-based data. Periodical data will generate monitoring data follows configured interval, while event-based transmit data when certain determined condition is met. Therefore, this study attempts to cover mentioned aspects in NS3. Several simulations are performed with different number of nodes on arbitrary communication scheme.

New modeling method for the dielectric relaxation of a DRAM cell capacitor

NASA Astrophysics Data System (ADS)

Choi, Sujin; Sun, Wookyung; Shin, Hyungsoon

2018-02-01

This study proposes a new method for automatically synthesizing the equivalent circuit of the dielectric relaxation (DR) characteristic in dynamic random access memory (DRAM) without frequency dependent capacitance measurement. Charge loss due to DR can be observed by a voltage drop at the storage node and this phenomenon can be analyzed by an equivalent circuit. The Havariliak-Negami model is used to accurately determine the electrical characteristic parameters of an equivalent circuit. The DRAM sensing operation is performed in HSPICE simulations to verify this new method. The simulation demonstrates that the storage node voltage drop resulting from DR and the reduction in the sensing voltage margin, which has a critical impact on DRAM read operation, can be accurately estimated using this new method.

A new centrality measure for identifying influential nodes in social networks

NASA Astrophysics Data System (ADS)

Rhouma, Delel; Ben Romdhane, Lotfi

2018-04-01

The identification of central nodes has been a key problem in the field of social network analysis. In fact, it is a measure that accounts the popularity or the visibility of an actor within a network. In order to capture this concept, various measures, either sample or more elaborate, has been developed. Nevertheless, many of "traditional" measures are not designed to be applicable to huge data. This paper sets out a new node centrality index suitable for large social network. It uses the amount of the neighbors of a node and connections between them to characterize a "pivot" node in the graph. We presented experimental results on real data sets which show the efficiency of our proposal.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bradonjic, Milan; Elsasser, Robert; Friedrich, Tobias

A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the criticalmore » value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).« less

Energy efficient sensor network implementations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Frigo, Janette R; Raby, Eric Y; Brennan, Sean M

In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, sleep(wake-up), data acquisition, data processing modes using low power, high performance embedded technology such as specialized embedded DSP processors and a low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm) as a case study.more » We report performance and total energy usage for our system implementations and discuss the system architecture design trade offs.« less

Broadcasting a message in a parallel computer

DOEpatents

Berg, Jeremy E [Rochester, MN; Faraj, Ahmad A [Rochester, MN

2011-08-02

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

Distributed Multihoming Routing Method by Crossing Control MIPv6 with SCTP

NASA Astrophysics Data System (ADS)

Shi, Hongbo; Hamagami, Tomoki

There are various wireless communication technologies, such as 3G, WiFi, used widely in the world. Recently, not only the laptop but also the smart phones can be equipped with multiple wireless devices. The communication terminals which are implemented with multiple interfaces are usually called multi-homed nodes. Meanwhile, a multi-homed node with multiple interfaces can also be regarded as multiple single-homed nodes. For example, when a person who is using smart phone and laptop to connect to the Internet concurrently, we may regard the person as a multi-homed node in the Internet. This paper proposes a new routing method, Multi-homed Mobile Cross-layer Control to handle multi-homed mobile nodes. Our suggestion can provide a distributed end-to-end routing method for handling the communications among multi-homed nodes at the fundamental network layer.

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment

PubMed Central

Wang, Liangmin

2018-01-01

Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node’s transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical. PMID:29538314

MEMS tracking mirror system for a bidirectional free-space optical link.

PubMed

Jeon, Sungho; Toshiyoshi, Hiroshi

2017-08-20

We report on a bidirectional free-space optical system that is capable of automatic connection and tracking of an optical link between two nodes. A piezoelectric micro-electro-mechanical systems (MEMS) optical scanner is used to steer a laser beam of two wavelengths superposed to visually present a communication zone, to search for the position of the remote node by means of the retro-reflector optics, and to transmit the data between the nodes. A feedback system is developed to control the MEMS scanner to dynamically establish the optical link within a 10-ms transition time and to keep track of the moving node.

IT product competition Network

NASA Astrophysics Data System (ADS)

Xu, Xiu-Lian; Zhou, Lei; Shi, Jian-Jun; Wang, Yong-Li; Feng, Ai-Xia; He, Da-Ren

2008-03-01

Along with the technical development, the IT product competition becomes increasingly fierce in recent years. The factories, which produce the same IT product, have to improve continuously their own product quality for taking a large piece of cake in the product sale market. We suggest using a complex network description for the IT product competition. In the network the factories are defined as nodes, and two nodes are connected by a link if they produce a common IT product. The edge represents the sale competition relationship. 2121 factories and 265 products have been investigated. Some statistical properties, such as the degree distribution, node strength distribution, assortativity, and node degree correlation have been empirically obtained.

Network analysis of translocated Takahe populations to identify disease surveillance targets.

PubMed

Grange, Zoë L; VAN Andel, Mary; French, Nigel P; Gartrell, Brett D

2014-04-01

Social network analysis is being increasingly used in epidemiology and disease modeling in humans, domestic animals, and wildlife. We investigated this tool in describing a translocation network (area that allows movement of animals between geographically isolated locations) used for the conservation of an endangered flightless rail, the Takahe (Porphyrio hochstetteri). We collated records of Takahe translocations within New Zealand and used social network principles to describe the connectivity of the translocation network. That is, networks were constructed and analyzed using adjacency matrices with values based on the tie weights between nodes. Five annual network matrices were created using the Takahe data set, each incremental year included records of previous years. Weights of movements between connected locations were assigned by the number of Takahe moved. We calculated the number of nodes (i(total)) and the number of ties (t(total)) between the nodes. To quantify the small-world character of the networks, we compared the real networks to random graphs of the equivalent size, weighting, and node strength. Descriptive analysis of cumulative annual Takahe movement networks involved determination of node-level characteristics, including centrality descriptors of relevance to disease modeling such as weighted measures of in degree (k(i)(in)), out degree (k(i)(out)), and betweenness (B(i)). Key players were assigned according to the highest node measure of k(i)(in), k(i)(out), and B(i) per network. Networks increased in size throughout the time frame considered. The network had some degree small-world characteristics. Nodes with the highest cumulative tie weights connecting them were the captive breeding center, the Murchison Mountains and 2 offshore islands. The key player fluctuated between the captive breeding center and the Murchison Mountains. The cumulative networks identified the captive breeding center every year as the hub of the network until the final network in 2011. Likewise, the wild Murchison Mountains population was consistently the sink of the network. Other nodes, such as the offshore islands and the wildlife hospital, varied in importance over time. Common network descriptors and measures of centrality identified key locations for targeting disease surveillance. The visual representation of movements of animals in a population that this technique provides can aid decision makers when they evaluate translocation proposals or attempt to control a disease outbreak. © 2014 Society for Conservation Biology.

Hollow-core fiber sensing technique for pipeline leak detection

NASA Astrophysics Data System (ADS)

Challener, W. A.; Kasten, Matthias A.; Karp, Jason; Choudhury, Niloy

2018-02-01

Recently there has been increased interest on the part of federal and state regulators to detect and quantify emissions of methane, an important greenhouse gas, from various parts of the oil and gas infrastructure including well pads and pipelines. Pressure and/or flow anomalies are typically used to detect leaks along natural gas pipelines, but are generally very insensitive and subject to false alarms. We have developed a system to detect and localize methane leaks along gas pipelines that is an order of magnitude more sensitive by combining tunable diode laser spectroscopy (TDLAS) with conventional sensor tube technology. This technique can potentially localize leaks along pipelines up to 100 km lengths with an accuracy of +/-50 m or less. A sensor tube buried along the pipeline with a gas-permeable membrane collects leaking gas during a soak period. The leak plume within the tube is then carried to the nearest sensor node along the tube in a purge cycle. The time-to-detection is used to determine leak location. Multiple sensor nodes are situated along the pipeline to minimize the time to detection, and each node is composed of a short segment of hollow core fiber (HCF) into which leaking gas is transported quickly through a small pressure differential. The HCF sensing node is spliced to standard telecom solid core fiber which transports the laser light for spectroscopy to a remote interrogator. The interrogator is multiplexed across the sensor nodes to minimize equipment cost and complexity.

A hybrid optic-fiber sensor network with the function of self-diagnosis and self-healing

NASA Astrophysics Data System (ADS)

Xu, Shibo; Liu, Tiegen; Ge, Chunfeng; Chen, Cheng; Zhang, Hongxia

2014-11-01

We develop a hybrid wavelength division multiplexing optical fiber network with distributed fiber-optic sensors and quasi-distributed FBG sensor arrays which detect vibrations, temperatures and strains at the same time. The network has the ability to locate the failure sites automatically designated as self-diagnosis and make protective switching to reestablish sensing service designated as self-healing by cooperative work of software and hardware. The processes above are accomplished by master-slave processors with the help of optical and wireless telemetry signals. All the sensing and optical telemetry signals transmit in the same fiber either working fiber or backup fiber. We take wavelength 1450nm as downstream signal and wavelength 1350nm as upstream signal to control the network in normal circumstances, both signals are sent by a light emitting node of the corresponding processor. There is also a continuous laser wavelength 1310nm sent by each node and received by next node on both working and backup fibers to monitor their healthy states, but it does not carry any message like telemetry signals do. When fibers of two sensor units are completely damaged, the master processor will lose the communication with the node between the damaged ones.However we install RF module in each node to solve the possible problem. Finally, the whole network state is transmitted to host computer by master processor. Operator could know and control the network by human-machine interface if needed.

The Cabled Component of NSF's Ocean Observatories Initiative: A Distributed, Multi-Sensor, Interactive Telepresence Within Ever-Shifting Marine Ecosystems

NASA Astrophysics Data System (ADS)

Delaney, J. R.; Kelley, D. S.; Proskurowski, G. K.; Kawka, O. E.; Fundis, A.; Mulvihill, M.; Harkins, G.; Harrington, M.; McGuire, C.; Manalang, D.; Light, R.; Stewart, A.; Brand, B.

2013-12-01

Since mid-year 2011, NSF's Ocean Observatories Initiative has made considerable progress in installing its cabled seafloor and water-column component off the Washington-Oregon Coast. The Primary Infrastructure is nearly operational and includes ~900 km of high-power (10 kV) and bandwidth (10 Gbs) submarine electro-optical cable and 7 seafloor power- and communications switching stations (nodes) in a two-cable network spanning tectonically active zones across the Juan de Fuca Plate, with access to the overlying ocean. The system is connected to a shore-landing in Pacific City, Oregon, with a dual-path terrestrial backhaul to Portland where connections to major continent-wide, high-speed networks link via the Internet to the undersea system. During summer 2013 the VISIONS'13 expedition, using the R/V Thompson and the remotely operated vehicle (ROV) ROPOS, placed a number of secondary infrastructure elements on the seafloor, ready to be connected to the Primary Nodes when the system is fully tested and accepted by the Consortium for Ocean Leadership. Secondary infrastructure installed using the ROV ROPOS includes over 23,000 meters of extension cables, which comprise twelve electro-optical and electrical cables that provide links from the Primary Nodes to experimental sites and instrument clusters. Smaller nodes (junction boxes) were also deployed, with three installed on the seafloor. All cables and junction boxes were fully tested, which included powering up and communicating through the nodes and sensors using the ROV ROPOS as a power-communication source, and live data transmission of the resultant engineering and science data to the ship located 3000-1500m above the seafloor. Locations include sites near the base of the continental slope and on Axial Seamount, the most magmatically active volcano on the Juan de Fuca Ridge. Real-time data streamed from instruments connected to extension cables at Axial Volcano via ROPOS revealed a significant local earthquake on the volcano, and a minor signal showing direct tidal measurements from 300 miles offshore. Sensors to be installed and connected in 2014 will provide seismic information, current velocities, inflation and deflation measurements of the volcanic caldera, high-definition video on demand, digital-still imagery, chemical data from methane seeps and vent sites using mass spectrometers, and an array of thermistors in a low-temperature vent field. Six instrumented full water-column moorings with two different types of profilers will be installed and connected to the cable in 2014.

Functional Connectivity Analysis of NIRS Data under Rubber Hand Illusion to Find a Biomarker of Sense of Ownership.

PubMed

Arizono, Naoki; Ohmura, Yuji; Yano, Shiro; Kondo, Toshiyuki

2016-01-01

The self-identification, which is called sense of ownership, has been researched through methodology of rubber hand illusion (RHI) because of its simple setup. Although studies with neuroimaging technique, such as fMRI, revealed that several brain areas are associated with the sense of ownership, near-infrared spectroscopy (NIRS) has not yet been utilized. Here we introduced an automated setup to induce RHI, measured the brain activity during the RHI with NIRS, and analyzed the functional connectivity so as to understand dynamical brain relationship regarding the sense of ownership. The connectivity was evaluated by multivariate Granger causality. In this experiment, the peaks of oxy-Hb on right frontal and right motor related areas during the illusion were significantly higher compared with those during the nonillusion. Furthermore, by analyzing the NIRS recordings, we found a reliable connectivity from the frontal to the motor related areas during the illusion. This finding suggests that frontal cortex and motor related areas communicate with each other when the sense of ownership is induced. The result suggests that the sense of ownership is related to neural mechanism underlying human motor control, and it would be determining whether motor learning (i.e., neural plasticity) will occur. Thus RHI with the functional connectivity analysis will become an appropriate biomarker for neurorehabilitation.

Ablation as targeted perturbation to rewire communication network of persistent atrial fibrillation

PubMed Central

Tao, Susumu; Way, Samuel F.; Garland, Joshua; Chrispin, Jonathan; Ciuffo, Luisa A.; Balouch, Muhammad A.; Nazarian, Saman; Spragg, David D.; Marine, Joseph E.; Berger, Ronald D.; Calkins, Hugh

2017-01-01

Persistent atrial fibrillation (AF) can be viewed as disintegrated patterns of information transmission by action potential across the communication network consisting of nodes linked by functional connectivity. To test the hypothesis that ablation of persistent AF is associated with improvement in both local and global connectivity within the communication networks, we analyzed multi-electrode basket catheter electrograms of 22 consecutive patients (63.5 ± 9.7 years, 78% male) during persistent AF before and after the focal impulse and rotor modulation-guided ablation. Eight patients (36%) developed recurrence within 6 months after ablation. We defined communication networks of AF by nodes (cardiac tissue adjacent to each electrode) and edges (mutual information between pairs of nodes). To evaluate patient-specific parameters of communication, thresholds of mutual information were applied to preserve 10% to 30% of the strongest edges. There was no significant difference in network parameters between both atria at baseline. Ablation effectively rewired the communication network of persistent AF to improve the overall connectivity. In addition, successful ablation improved local connectivity by increasing the average clustering coefficient, and also improved global connectivity by decreasing the characteristic path length. As a result, successful ablation improved the efficiency and robustness of the communication network by increasing the small-world index. These changes were not observed in patients with AF recurrence. Furthermore, a significant increase in the small-world index after ablation was associated with synchronization of the rhythm by acute AF termination. In conclusion, successful ablation rewires communication networks during persistent AF, making it more robust, efficient, and easier to synchronize. Quantitative analysis of communication networks provides not only a mechanistic insight that AF may be sustained by spatially localized sources and global connectivity, but also patient-specific metrics that could serve as a valid endpoint for therapeutic interventions. PMID:28678805

Intercluster Connection in Cognitive Wireless Mesh Networks Based on Intelligent Network Coding

NASA Astrophysics Data System (ADS)

Chen, Xianfu; Zhao, Zhifeng; Jiang, Tao; Grace, David; Zhang, Honggang

2009-12-01

Cognitive wireless mesh networks have great flexibility to improve spectrum resource utilization, within which secondary users (SUs) can opportunistically access the authorized frequency bands while being complying with the interference constraint as well as the QoS (Quality-of-Service) requirement of primary users (PUs). In this paper, we consider intercluster connection between the neighboring clusters under the framework of cognitive wireless mesh networks. Corresponding to the collocated clusters, data flow which includes the exchanging of control channel messages usually needs four time slots in traditional relaying schemes since all involved nodes operate in half-duplex mode, resulting in significant bandwidth efficiency loss. The situation is even worse at the gateway node connecting the two colocated clusters. A novel scheme based on network coding is proposed in this paper, which needs only two time slots to exchange the same amount of information mentioned above. Our simulation shows that the network coding-based intercluster connection has the advantage of higher bandwidth efficiency compared with the traditional strategy. Furthermore, how to choose an optimal relaying transmission power level at the gateway node in an environment of coexisting primary and secondary users is discussed. We present intelligent approaches based on reinforcement learning to solve the problem. Theoretical analysis and simulation results both show that the intelligent approaches can achieve optimal throughput for the intercluster relaying in the long run.

Exploring the Epileptic Brain Network Using Time-Variant Effective Connectivity and Graph Theory.

PubMed

Storti, Silvia Francesca; Galazzo, Ilaria Boscolo; Khan, Sehresh; Manganotti, Paolo; Menegaz, Gloria

2017-09-01

The application of time-varying measures of causality between source time series can be very informative to elucidate the direction of communication among the regions of an epileptic brain. The aim of the study was to identify the dynamic patterns of epileptic networks in focal epilepsy by applying multivariate adaptive directed transfer function (ADTF) analysis and graph theory to high-density electroencephalographic recordings. The cortical network was modeled after source reconstruction and topology modulations were detected during interictal spikes. First a distributed linear inverse solution, constrained to the individual grey matter, was applied to the averaged spikes and the mean source activity over 112 regions, as identified by the Harvard-Oxford Atlas, was calculated. Then, the ADTF, a dynamic measure of causality, was used to quantify the connectivity strength between pairs of regions acting as nodes in the graph, and the measure of node centrality was derived. The proposed analysis was effective in detecting the focal regions as well as in characterizing the dynamics of the spike propagation, providing evidence of the fact that the node centrality is a reliable feature for the identification of the epileptogenic zones. Validation was performed by multimodal analysis as well as from surgical outcomes. In conclusion, the time-variant connectivity analysis applied to the epileptic patients can distinguish the generator of the abnormal activity from the propagation spread and identify the connectivity pattern over time.