Scale-free models for the structure of business firm networks.

PubMed

Kitsak, Maksim; Riccaboni, Massimo; Havlin, Shlomo; Pammolli, Fabio; Stanley, H Eugene

2010-03-01

We study firm collaborations in the life sciences and the information and communication technology sectors. We propose an approach to characterize industrial leadership using k -shell decomposition, with top-ranking firms in terms of market value in higher k -shell layers. We find that the life sciences industry network consists of three distinct components: a "nucleus," which is a small well-connected subgraph, "tendrils," which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a "bulk body," which consists of the majority of nodes. Industrial leaders, i.e., the largest companies in terms of market value, are in the highest k -shells of both networks. The nucleus of the life sciences sector is very stable: once a firm enters the nucleus, it is likely to stay there for a long time. At the same time we do not observe the above three components in the information and communication technology sector. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils in scale-free networks decrease as the exponent of the power-law degree distribution lambda increases, and disappear for lambda>or=3 . We compare the k -shell structure of random scale-free model networks with two real-world business firm networks in the life sciences and in the information and communication technology sectors. We argue that the observed behavior of the k -shell structure in the two industries is consistent with the coexistence of both preferential and random agreements in the evolution of industrial networks.

The Practical Impact of Recent Computer Advances on the Analysis and Design of Large Scale Networks

DTIC Science & Technology

1974-12-01

Communications, ICC-74, June 17-19, Minneapolis, Minnesota, pp. 31C-1-21C-5. 28. Gitman , I., R, M. Van Slvke and H. Frank, "On Splitting Random Access Broadcast...1974. 29. Gitman , I., "On the Capacity of Slotted ALOHA Network and Some Design Problems," IEEE Transactions on Communications, Maren, 1975. 30

Project Connect Online: Randomized Trial of an Internet-Based Program to Chronicle the Cancer Experience and Facilitate Communication

PubMed Central

Stanton, Annette L.; Thompson, Elizabeth H.; Crespi, Catherine M.; Link, John S.; Waisman, James R.

2013-01-01

Purpose Evidence suggests that expressing emotions related to cancer and receiving interpersonal support can promote psychological and physical health in women diagnosed with breast cancer. However, adaptive expression of feelings and communication with one's social network can pose challenges for patients with cancer. We report on a randomized controlled trial of an intervention, Project Connect Online, for patients with breast cancer to create personal Web sites to chronicle their experience and communicate with their social network. Patients and Methods Women (N = 88) diagnosed with breast cancer (any stage, any interval since diagnosis) were randomly assigned to participate in a 3-hour workshop for hands-on creation of personal Web sites with a follow-up call to facilitate Web site use, or to a waiting-list control. Assessed before randomization and 6 months after the intervention, dependent variables included depressive symptoms, positive and negative mood, cancer-related intrusive thoughts, and perceived cancer-related benefits in life appreciation and strengthened relationships. Results Relative to control participants, women randomly assigned to Project Connect Online evidenced significant benefit 6 months later on depressive symptoms, positive mood, and life appreciation, but not negative mood, perceived strengthened relationships, or intrusive thoughts. Treatment status moderated the intervention effects, such that women currently undergoing medical treatment for cancer benefitted significantly more from the intervention on depressive symptoms and positive mood than did women not receiving treatment. Conclusion Findings suggest the promise of an intervention to facilitate the ability of women diagnosed with breast cancer to chronicle their experience and communicate with their social network via the Internet. PMID:23940228

Project connect online: randomized trial of an internet-based program to chronicle the cancer experience and facilitate communication.

PubMed

Stanton, Annette L; Thompson, Elizabeth H; Crespi, Catherine M; Link, John S; Waisman, James R

2013-09-20

Evidence suggests that expressing emotions related to cancer and receiving interpersonal support can promote psychological and physical health in women diagnosed with breast cancer. However, adaptive expression of feelings and communication with one's social network can pose challenges for patients with cancer. We report on a randomized controlled trial of an intervention, Project Connect Online, for patients with breast cancer to create personal Web sites to chronicle their experience and communicate with their social network. Women (N = 88) diagnosed with breast cancer (any stage, any interval since diagnosis) were randomly assigned to participate in a 3-hour workshop for hands-on creation of personal Web sites with a follow-up call to facilitate Web site use, or to a waiting-list control. Assessed before randomization and 6 months after the intervention, dependent variables included depressive symptoms, positive and negative mood, cancer-related intrusive thoughts, and perceived cancer-related benefits in life appreciation and strengthened relationships. Relative to control participants, women randomly assigned to Project Connect Online evidenced significant benefit 6 months later on depressive symptoms, positive mood, and life appreciation, but not negative mood, perceived strengthened relationships, or intrusive thoughts. Treatment status moderated the intervention effects, such that women currently undergoing medical treatment for cancer benefitted significantly more from the intervention on depressive symptoms and positive mood than did women not receiving treatment. Findings suggest the promise of an intervention to facilitate the ability of women diagnosed with breast cancer to chronicle their experience and communicate with their social network via the Internet.

Blackmail propagation on small-world networks

NASA Astrophysics Data System (ADS)

Shao, Zhi-Gang; Jian-Ping Sang; Zou, Xian-Wu; Tan, Zhi-Jie; Jin, Zhun-Zhi

2005-06-01

The dynamics of the blackmail propagation model based on small-world networks is investigated. It is found that for a given transmitting probability λ the dynamical behavior of blackmail propagation transits from linear growth type to logistical growth one with the network randomness p increases. The transition takes place at the critical network randomness pc=1/N, where N is the total number of nodes in the network. For a given network randomness p the dynamical behavior of blackmail propagation transits from exponential decrease type to logistical growth one with the transmitting probability λ increases. The transition occurs at the critical transmitting probability λc=1/, where is the average number of the nearest neighbors. The present work will be useful for understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Performance analysis of Integrated Communication and Control System networks

NASA Technical Reports Server (NTRS)

Halevi, Y.; Ray, A.

1990-01-01

This paper presents statistical analysis of delays in Integrated Communication and Control System (ICCS) networks that are based on asynchronous time-division multiplexing. The models are obtained in closed form for analyzing control systems with randomly varying delays. The results of this research are applicable to ICCS design for complex dynamical processes like advanced aircraft and spacecraft, autonomous manufacturing plants, and chemical and processing plants.

Scale-free models for the structure of business firm networks

NASA Astrophysics Data System (ADS)

Kitsak, Maksim; Riccaboni, Massimo; Havlin, Shlomo; Pammolli, Fabio; Stanley, H. Eugene

2010-03-01

We study firm collaborations in the life sciences and the information and communication technology sectors. We propose an approach to characterize industrial leadership using k -shell decomposition, with top-ranking firms in terms of market value in higher k -shell layers. We find that the life sciences industry network consists of three distinct components: a “nucleus,” which is a small well-connected subgraph, “tendrils,” which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a “bulk body,” which consists of the majority of nodes. Industrial leaders, i.e., the largest companies in terms of market value, are in the highest k -shells of both networks. The nucleus of the life sciences sector is very stable: once a firm enters the nucleus, it is likely to stay there for a long time. At the same time we do not observe the above three components in the information and communication technology sector. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils in scale-free networks decrease as the exponent of the power-law degree distribution λ increases, and disappear for λ≥3 . We compare the k -shell structure of random scale-free model networks with two real-world business firm networks in the life sciences and in the information and communication technology sectors. We argue that the observed behavior of the k -shell structure in the two industries is consistent with the coexistence of both preferential and random agreements in the evolution of industrial networks.

Distributed Clone Detection in Static Wireless Sensor Networks: Random Walk with Network Division

PubMed Central

Khan, Wazir Zada; Aalsalem, Mohammed Y.; Saad, N. M.

2015-01-01

Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads. PMID:25992913

A Comprehensive Peer Network Intervention to Improve Social Communication of Children with Autism Spectrum Disorders: A Randomized Trial in Kindergarten and First Grade

ERIC Educational Resources Information Center

Kamps, Debra; Thiemann-Bourque, Kathy; Heitzman-Powell, Linda; Schwartz, Ilene; Rosenberg, Nancy; Mason, Rose; Cox, Suzanne

2015-01-01

The purpose of this randomized control group study was to examine the effects of a peer network intervention that included peer mediation and direct instruction for Kindergarten and First-grade children with autism spectrum disorders. Trained school staff members provided direct instruction for 56 children in the intervention group, and 39…

VSAT communications networks - An overview

NASA Astrophysics Data System (ADS)

Chakraborty, D.

1988-05-01

The very-small-aperture-terminal (VSAT) fixed satellite communication network is a star network in which many dispersed micro terminals attempt to send data in a packet form through a random access/time-division multiple-access (RA/TDMA) satellite channel with transmission delay. The basic concept of the VSAT and its service potential are discussed. Two classes of traffic are addressed, namely, business-oriented low-rate-data traffic and bulk data traffic of corporate networks. Satellite access, throughput, and delay are considered. The size of the network population that can be served in an RA/TDMA environment is calculated. User protocols are examined. A typical VSAT business scenario is described.

Damage spreading in spatial and small-world random Boolean networks

NASA Astrophysics Data System (ADS)

Lu, Qiming; Teuscher, Christof

2014-02-01

The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean networks (RBNs) are commonly used as a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance of spatially local networks scales with a power law as the system size N increases, but with a different exponent for local and small-world networks. The scaling arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

Distributed Multihop Clustering Approach for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Israr, Nauman; Awan, Irfan

Prolonging the life time of Wireless Sensor Networks (WSNs) has been the focus of current research. One of the issues that needs to be addressed along with prolonging the network life time is to ensure uniform energy consumption across the network in WSNs especially in case of random network deployment. Cluster based routing algorithms are believed to be the best choice for WSNs because they work on the principle of divide and conquer and also improve the network life time considerably compared to flat based routing schemes. In this paper we propose a new routing strategy based on two layers clustering which exploits the redundancy property of the network in order to minimise duplicate data transmission and also make the intercluster and intracluster communication multihop. The proposed algorithm makes use of the nodes in a network whose area coverage is covered by the neighbouring nodes. These nodes are marked as temporary cluster heads and later use these temporary cluster heads randomly for multihop intercluster communication. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing across the network and is more energy efficient compared to the enhanced version of widely used Leach algorithm.

A Comprehensive Peer Network Intervention to Improve Social Communication of Children with Autism Spectrum Disorders: A Randomized Trial in Kindergarten and First Grade

PubMed Central

Kamps, Debra; Thiemann-Bourque, Kathy; Heitzman-Powell, Linda; Schwartz, Ilene; Rosenberg, Nancy; Mason, Rose; Cox, Suzanne

2015-01-01

The purpose of this randomized control group study was to examine the effects of a peer network intervention that included peer mediation and direct instruction for Kindergarten and First-grade children with Autism Spectrum Disorders (ASD). Trained school staff members provided direct instruction for 56 children in the intervention group, and 39 children participated in a comparison group. Results showed children in the intervention group displayed significantly more initiations to peers than did the comparison group during non-treatment social probes and generalization probes. Treatment session data showed significant growth for total communications over baseline levels. Children in treatment also showed more growth in language and adaptive communication. Finally, teachers’ ratings of prosocial skills revealed significantly greater improvements for the intervention group. PMID:25510450

Power-law behavior in complex organizational communication networks during crisis

NASA Astrophysics Data System (ADS)

Uddin, Shahadat; Murshed, Shahriar Tanvir Hasan; Hossain, Liaquat

2011-08-01

Communication networks can be described as patterns of contacts which are created due to the flow of messages and information shared among participating actors. Contemporary organizations are now commonly viewed as dynamic systems of adaptation and evolution containing several parts, which interact with one another both in internal and in external environment. Although there is limited consensus among researchers on the precise definition of organizational crisis, there is evidence of shared meaning: crisis produces individual crisis, crisis can be associated with positive or negative conditions, crises can be situations having been precipitated quickly or suddenly or situations that have developed over time and are predictable etc. In this research, we study the power-law behavior of an organizational email communication network during crisis from complexity perspective. Power law simply describes that, the probability that a randomly selected node has k links (i.e. degree k) follows P(k)∼k, where γ is the degree exponent. We used social network analysis tools and techniques to analyze the email communication dataset. We tested two propositions: (1) as organization goes through crisis, a few actors, who are prominent or more active, will become central, and (2) the daily communication network as well as the actors in the communication network exhibit power-law behavior. Our preliminary results support these two propositions. The outcome of this study may provide significant advancement in exploring organizational communication network behavior during crisis.

Asynchronous Communication Scheme For Hypercube Computer

NASA Technical Reports Server (NTRS)

Madan, Herb S.

1988-01-01

Scheme devised for asynchronous-message communication system for Mark III hypercube concurrent-processor network. Network consists of up to 1,024 processing elements connected electrically as though were at corners of 10-dimensional cube. Each node contains two Motorola 68020 processors along with Motorola 68881 floating-point processor utilizing up to 4 megabytes of shared dynamic random-access memory. Scheme intended to support applications requiring passage of both polled or solicited and unsolicited messages.

Distributed synchronization control of complex networks with communication constraints.

PubMed

Xu, Zhenhua; Zhang, Dan; Song, Hongbo

2016-11-01

This paper is concerned with the distributed synchronization control of complex networks with communication constraints. In this work, the controllers communicate with each other through the wireless network, acting as a controller network. Due to the constrained transmission power, techniques such as the packet size reduction and transmission rate reduction schemes are proposed which could help reduce communication load of the controller network. The packet dropout problem is also considered in the controller design since it is often encountered in networked control systems. We show that the closed-loop system can be modeled as a switched system with uncertainties and random variables. By resorting to the switched system approach and some stochastic system analysis method, a new sufficient condition is firstly proposed such that the exponential synchronization is guaranteed in the mean-square sense. The controller gains are determined by using the well-known cone complementarity linearization (CCL) algorithm. Finally, a simulation study is performed, which demonstrates the effectiveness of the proposed design algorithm. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Protocol for Communication Networking for Formation Flying

NASA Technical Reports Server (NTRS)

Jennings, Esther; Okino, Clayton; Gao, Jay; Clare, Loren

2009-01-01

An application-layer protocol and a network architecture have been proposed for data communications among multiple autonomous spacecraft that are required to fly in a precise formation in order to perform scientific observations. The protocol could also be applied to other autonomous vehicles operating in formation, including robotic aircraft, robotic land vehicles, and robotic underwater vehicles. A group of spacecraft or other vehicles to which the protocol applies could be characterized as a precision-formation- flying (PFF) network, and each vehicle could be characterized as a node in the PFF network. In order to support precise formation flying, it would be necessary to establish a corresponding communication network, through which the vehicles could exchange position and orientation data and formation-control commands. The communication network must enable communication during early phases of a mission, when little positional knowledge is available. Particularly during early mission phases, the distances among vehicles may be so large that communication could be achieved only by relaying across multiple links. The large distances and need for omnidirectional coverage would limit communication links to operation at low bandwidth during these mission phases. Once the vehicles were in formation and distances were shorter, the communication network would be required to provide high-bandwidth, low-jitter service to support tight formation-control loops. The proposed protocol and architecture, intended to satisfy the aforementioned and other requirements, are based on a standard layered-reference-model concept. The proposed application protocol would be used in conjunction with conventional network, data-link, and physical-layer protocols. The proposed protocol includes the ubiquitous Institute of Electrical and Electronics Engineers (IEEE) 802.11 medium access control (MAC) protocol to be used in the datalink layer. In addition to its widespread and proven use in diverse local-area networks, this protocol offers both (1) a random- access mode needed for the early PFF deployment phase and (2) a time-bounded-services mode needed during PFF-maintenance operations. Switching between these two modes could be controlled by upper-layer entities using standard link-management mechanisms. Because the early deployment phase of a PFF mission can be expected to involve multihop relaying to achieve network connectivity (see figure), the proposed protocol includes the open shortest path first (OSPF) network protocol that is commonly used in the Internet. Each spacecraft in a PFF network would be in one of seven distinct states as the mission evolved from initial deployment, through coarse formation, and into precise formation. Reconfiguration of the formation to perform different scientific observations would also cause state changes among the network nodes. The application protocol provides for recognition and tracking of the seven states for each node and for protocol changes under specified conditions to adapt the network and satisfy communication requirements associated with the current PFF mission phase. Except during early deployment, when peer-to-peer random access discovery methods would be used, the application protocol provides for operation in a centralized manner.

Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Rafsanjani, Marjan Kuchaki; Fatemidokht, Hamideh; Balas, Valentina Emilia

2016-01-01

Mobile ad hoc networks (MANETs) are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.

Google matrix analysis of directed networks

NASA Astrophysics Data System (ADS)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2015-10-01

In the past decade modern societies have developed enormous communication and social networks. Their classification and information retrieval processing has become a formidable task for the society. Because of the rapid growth of the World Wide Web, and social and communication networks, new mathematical methods have been invented to characterize the properties of these networks in a more detailed and precise way. Various search engines extensively use such methods. It is highly important to develop new tools to classify and rank a massive amount of network information in a way that is adapted to internal network structures and characteristics. This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency using various examples including the World Wide Web, Wikipedia, software architectures, world trade, social and citation networks, brain neural networks, DNA sequences, and Ulam networks. The analytical and numerical matrix methods used in this analysis originate from the fields of Markov chains, quantum chaos, and random matrix theory.

Assessment in Multisite Randomized Clinical Trials of Patients with Autistic Disorder: The Autism RUPP Network.

ERIC Educational Resources Information Center

Arnold, L. Eugene; Aman, Michael G.; Martin, Andres; Collier-Crespin, Angie; Vitiello, Benedetto; Tierney, Elaine; Asarnow, Robert; Bell-Bradshaw, Felicia; Freeman, Betty Jo; Gates-Ulanet, Patricia; Klin, Ami; McCracken, James T.; McDougle, Christopher J.; McGough, James J.; Posey, David J.; Scahill, Lawrence; Swiezy, Naomi B.; Ritz, Louise; Volkmar, Fred

2000-01-01

This paper explains how the Autism Research Units on Pediatric Psychopharmacology (RUPP Autism Network) resolved common assessment problems including communication problems compromising use of the patient as informant, broad subject heterogeneity, difficulties in assessing low-end IQs, scarcity of autism-adapted cognitive and neuropsychological…

Distributed Dynamic Host Configuration Protocol (D2HCP)

PubMed Central

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

Distributed Dynamic Host Configuration Protocol (D2HCP).

PubMed

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment.

Switch for serial or parallel communication networks

DOEpatents

Crosette, D.B.

1994-07-19

A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination. 9 figs.

Switch for serial or parallel communication networks

DOEpatents

Crosette, Dario B.

1994-01-01

A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination.

The Use of End-to-End Multicast Measurements for Characterizing Internal Network Behavior

DTIC Science & Technology

2002-08-01

dropping on the basis Random Early Detection ( RED ) [17] is another mechanism by which packet loss may become decorrelated. It remains to be seen whether...this mechanism will be widely deployed in communications networks. On the other hand, the use of RED to merely mark packets will not break correlations...Tail and Random Early Detection ( RED ) buffer discard methods, [17]. We compared the inferred loss and delay with actual probe loss and delay. We found

Cooperative Spatial Retreat for Resilient Drone Networks.

PubMed

Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon

2017-05-03

Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes.

Naming Game on Networks: Let Everyone be Both Speaker and Hearer

PubMed Central

Gao, Yuan; Chen, Guanrong; Chan, Rosa H. M.

2014-01-01

To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios. Moreover, NGG allows the transmission (communication) of multiple words (opinions) for multiple intra-group consensuses. The communications among indirectly-connected nodes are also enabled in NGG. We simulated and analyzed the consensus process in some typical network topologies, including random-graph networks, small-world networks and scale-free networks, to better understand how global convergence (consensus) could be reached on one common word. The results are interpreted on group negotiation of a peer-to-peer network, which shows that global consensus in the population can be reached more rapidly when more opinions are permitted within each group or when the negotiating groups in the population are larger in size. The novel features and properties introduced by our model have demonstrated its applicability in better investigating general consensus problems on peer-to-peer networks. PMID:25143140

Naming Game on Networks: Let Everyone be Both Speaker and Hearer

NASA Astrophysics Data System (ADS)

Gao, Yuan; Chen, Guanrong; Chan, Rosa H. M.

2014-08-01

To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios. Moreover, NGG allows the transmission (communication) of multiple words (opinions) for multiple intra-group consensuses. The communications among indirectly-connected nodes are also enabled in NGG. We simulated and analyzed the consensus process in some typical network topologies, including random-graph networks, small-world networks and scale-free networks, to better understand how global convergence (consensus) could be reached on one common word. The results are interpreted on group negotiation of a peer-to-peer network, which shows that global consensus in the population can be reached more rapidly when more opinions are permitted within each group or when the negotiating groups in the population are larger in size. The novel features and properties introduced by our model have demonstrated its applicability in better investigating general consensus problems on peer-to-peer networks.

PUFKEY: A High-Security and High-Throughput Hardware True Random Number Generator for Sensor Networks

PubMed Central

Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

2015-01-01

Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks. PMID:26501283

PUFKEY: a high-security and high-throughput hardware true random number generator for sensor networks.

PubMed

Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

2015-10-16

Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks.

Cooperative Spatial Retreat for Resilient Drone Networks †

PubMed Central

Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon

2017-01-01

Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes. PMID:28467390

Exploring Research Topics and Trends in Nursing-related Communication in Intensive Care Units Using Social Network Analysis.

PubMed

Son, Youn-Jung; Lee, Soo-Kyoung; Nam, SeJin; Shim, Jae Lan

2018-05-04

This study used social network analysis to identify the main research topics and trends in nursing-related communication in intensive care units. Keywords from January 1967 to June 2016 were extracted from PubMed using Medical Subject Headings terms. Social network analysis was performed using Gephi software. Research publications and newly emerging topics in nursing-related communication in intensive care units were classified into five chronological phases. After the weighting was adjusted, the top five keyword searches were "conflict," "length of stay," "nursing continuing education," "family," and "nurses." During the most recent phase, research topics included "critical care nursing," "patient handoff," and "quality improvement." The keywords of the top three groups among the 10 groups identified were related to "neonatal nursing and practice guideline," "infant or pediatric and terminal care," and "family, aged, and nurse-patient relations," respectively. This study can promote a systematic understanding of communication in intensive care units by identifying topic networks. Future studies are needed to conduct large prospective cohort studies and randomized controlled trials to verify the effects of patient-centered communication in intensive care units on patient outcomes, such as length of hospital stay and mortality.

Analysis of the “naming game” with learning errors in communications

NASA Astrophysics Data System (ADS)

Lou, Yang; Chen, Guanrong

2015-07-01

Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network. By pair-wise iterative interactions, the population reaches consensus asymptotically. We study naming game with communication errors during pair-wise conversations, with error rates in a uniform probability distribution. First, a model of naming game with learning errors in communications (NGLE) is proposed. Then, a strategy for agents to prevent learning errors is suggested. To that end, three typical topologies of communication networks, namely random-graph, small-world and scale-free networks, are employed to investigate the effects of various learning errors. Simulation results on these models show that 1) learning errors slightly affect the convergence speed but distinctively increase the requirement for memory of each agent during lexicon propagation; 2) the maximum number of different words held by the population increases linearly as the error rate increases; 3) without applying any strategy to eliminate learning errors, there is a threshold of the learning errors which impairs the convergence. The new findings may help to better understand the role of learning errors in naming game as well as in human language development from a network science perspective.

Nonlinear dynamic evolution and control in CCFN with mixed attachment mechanisms

NASA Astrophysics Data System (ADS)

Wang, Jianrong; Wang, Jianping; Han, Dun

2017-01-01

In recent years, wireless communication plays an important role in our lives. Cooperative communication, is used by a mobile station with single antenna to share with each other forming a virtual MIMO antenna system, will become a development with a diversity gain for wireless communication in tendency future. In this paper, a fitness model of evolution network based on complex networks with mixed attachment mechanisms is devised in order to study an actual network-CCFN (cooperative communication fitness network). Firstly, the evolution of CCFN is given by four cases with different probabilities, and the rate equations of nodes degree are presented to analyze the evolution of CCFN. Secondly, the degree distribution is analyzed by calculating the rate equation and numerical simulation with the examples of four fitness distributions such as power law, uniform fitness distribution, exponential fitness distribution and Rayleigh fitness distribution. Finally, the robustness of CCFN is studied by numerical simulation with four fitness distributions under random attack and intentional attack to analyze the effects of degree distribution, average path length and average degree. The results of this paper offers insights for building CCFN systems in order to program communication resources.

Analysis of the "naming game" with learning errors in communications.

PubMed

Lou, Yang; Chen, Guanrong

2015-07-16

Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network. By pair-wise iterative interactions, the population reaches consensus asymptotically. We study naming game with communication errors during pair-wise conversations, with error rates in a uniform probability distribution. First, a model of naming game with learning errors in communications (NGLE) is proposed. Then, a strategy for agents to prevent learning errors is suggested. To that end, three typical topologies of communication networks, namely random-graph, small-world and scale-free networks, are employed to investigate the effects of various learning errors. Simulation results on these models show that 1) learning errors slightly affect the convergence speed but distinctively increase the requirement for memory of each agent during lexicon propagation; 2) the maximum number of different words held by the population increases linearly as the error rate increases; 3) without applying any strategy to eliminate learning errors, there is a threshold of the learning errors which impairs the convergence. The new findings may help to better understand the role of learning errors in naming game as well as in human language development from a network science perspective.

Analysing Local Sparseness in the Macaque Brain Network

PubMed Central

Singh, Raghavendra; Nagar, Seema; Nanavati, Amit A.

2015-01-01

Understanding the network structure of long distance pathways in the brain is a necessary step towards developing an insight into the brain’s function, organization and evolution. Dense global subnetworks of these pathways have often been studied, primarily due to their functional implications. Instead we study sparse local subnetworks of the pathways to establish the role of a brain area in enabling shortest path communication between its non-adjacent topological neighbours. We propose a novel metric to measure the topological communication load on a vertex due to its immediate neighbourhood, and show that in terms of distribution of this local communication load, a network of Macaque long distance pathways is substantially different from other real world networks and random graph models. Macaque network contains the entire range of local subnetworks, from star-like networks to clique-like networks, while other networks tend to contain a relatively small range of subnetworks. Further, sparse local subnetworks in the Macaque network are not only found across topographical super-areas, e.g., lobes, but also within a super-area, arguing that there is conservation of even relatively short-distance pathways. To establish the communication role of a vertex we borrow the concept of brokerage from social science, and present the different types of brokerage roles that brain areas play, highlighting that not only the thalamus, but also cingulate gyrus and insula often act as “relays” for areas in the neocortex. These and other analysis of communication load and roles of the sparse subnetworks of the Macaque brain provide new insights into the organisation of its pathways. PMID:26437077

All-Direction Random Routing for Source-Location Privacy Protecting against Parasitic Sensor Networks.

PubMed

Wang, Na; Zeng, Jiwen

2017-03-17

Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes.

Cascade phenomenon against subsequent failures in complex networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Liu, Zhi-Quan; He, Xuan; Ma, Jian-Feng

2018-06-01

Cascade phenomenon may lead to catastrophic disasters which extremely imperil the network safety or security in various complex systems such as communication networks, power grids, social networks and so on. In some flow-based networks, the load of failed nodes can be redistributed locally to their neighboring nodes to maximally preserve the traffic oscillations or large-scale cascading failures. However, in such local flow redistribution model, a small set of key nodes attacked subsequently can result in network collapse. Then it is a critical problem to effectively find the set of key nodes in the network. To our best knowledge, this work is the first to study this problem comprehensively. We first introduce the extra capacity for every node to put up with flow fluctuations from neighbors, and two extra capacity distributions including degree based distribution and average distribution are employed. Four heuristic key nodes discovering methods including High-Degree-First (HDF), Low-Degree-First (LDF), Random and Greedy Algorithms (GA) are presented. Extensive simulations are realized in both scale-free networks and random networks. The results show that the greedy algorithm can efficiently find the set of key nodes in both scale-free and random networks. Our work studies network robustness against cascading failures from a very novel perspective, and methods and results are very useful for network robustness evaluations and protections.

Mission Command in the Age of Network-Enabled Operations: Social Network Analysis of Information Sharing and Situation Awareness

DTIC Science & Technology

2016-06-22

this assumption in a large-scale, 2-week military training exercise. We conducted a social network analysis of email communications among the multi...exponential random graph models challenge the aforementioned assumption, as increased email output was associated with lower individual situation... email links were more commonly formed among members of the command staff with both similar functions and levels of situation awareness, than between

Stochastic Control and Numerical Methods with Applications to Communications. Game Theoretic/Subsolution to Importance Sampling for Rare Event Simulation

DTIC Science & Technology

2008-11-01

support to the value of the approach. 9. Scheduling and Control of Mobile Communications Networks with Randomly Time Varying Channels by Stability ...biological systems . Many examples arise in communications and queueing, due to the finite speed of signal transmission, the nonnegligible time required...without delays, the system state takes values in a subset of some finite -dimensional Euclidean space, and the control is a functional of the current

Routine programs of health care systems as an opportunity toward communication skills training for family physicians: A randomized field trial

PubMed Central

Zamani, Ahmad Reza; Motamedi, Narges; Farajzadegan, Ziba

2015-01-01

Background: To have high-quality primary health care services, an adequate doctor–patient communication is necessary. Because of time restrictions and limited budget in health system, an effective, feasible, and continuous training approach is important. The aim of this study is to assess the appropriateness of a communication skills training program simultaneously with routine programs of health care system. Materials and Methods: It was a randomized field trial in two health network settings during 2013. Twenty-eight family physicians through simple random sampling and 140 patients through convenience sampling participated as intervention and control group. The physicians in the intervention group (n = 14) attended six educational sessions, simultaneous organization meeting, with case discussion and peer education method. In both the groups, physicians completed communication skills knowledge and attitude questionnaires, and patients completed patient satisfaction of medical interview questionnaire at baseline, immediately after intervention, and four months postintervention. Physicians and health network administrators (stakeholders), completed a set of program evaluation forms. Descriptive statistics and Chi-square test, t-test, and repeated measure analysis of variance were used to analyze the data. Results: Use of routine program as a strategy of training was rated by stakeholders highly on “feasibility” (80.5%), “acceptability” (93.5%), “educational content and method appropriateness” (80.75%), and “ability to integrating in the health system programs” (approximate 60%). Significant improvements were found in physicians’ knowledge (P < 0.001), attitude (P < 0.001), and patients’ satisfaction (P = 0.002) in intervention group. Conclusions: Communication skills training program, simultaneous organization meeting was successfully implemented and well received by stakeholders, without considering extra time and manpower. Therefore it can be a valuable opportunity toward communication skills training. PMID:27462613

Applying Neural Networks in Optical Communication Systems: Possible Pitfalls

NASA Astrophysics Data System (ADS)

Eriksson, Tobias A.; Bulow, Henning; Leven, Andreas

2017-12-01

We investigate the risk of overestimating the performance gain when applying neural network based receivers in systems with pseudo random bit sequences or with limited memory depths, resulting in repeated short patterns. We show that with such sequences, a large artificial gain can be obtained which comes from pattern prediction rather than predicting or compensating the studied channel/phenomena.

An Analytical Framework for Fast Estimation of Capacity and Performance in Communication Networks

DTIC Science & Technology

2012-01-25

standard random graph (due to Erdos- Renyi ) in the regime where the average degrees remain fixed (and above 1) and the number of nodes get large, is not...abs/1010.3305 (Oct 2010). [6] O. Narayan, I. Saniee, G. H. Tucci, “Lack of Spectral Gap and Hyperbolicity in Asymptotic Erdös- Renyi Random Graphs

Asynchronous State Estimation for Discrete-Time Switched Complex Networks With Communication Constraints.

PubMed

Zhang, Dan; Wang, Qing-Guo; Srinivasan, Dipti; Li, Hongyi; Yu, Li

2018-05-01

This paper is concerned with the asynchronous state estimation for a class of discrete-time switched complex networks with communication constraints. An asynchronous estimator is designed to overcome the difficulty that each node cannot access to the topology/coupling information. Also, the event-based communication, signal quantization, and the random packet dropout problems are studied due to the limited communication resource. With the help of switched system theory and by resorting to some stochastic system analysis method, a sufficient condition is proposed to guarantee the exponential stability of estimation error system in the mean-square sense and a prescribed performance level is also ensured. The characterization of the desired estimator gains is derived in terms of the solution to a convex optimization problem. Finally, the effectiveness of the proposed design approach is demonstrated by a simulation example.

All-Direction Random Routing for Source-Location Privacy Protecting against Parasitic Sensor Networks

PubMed Central

Wang, Na; Zeng, Jiwen

2017-01-01

Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes. PMID:28304367

Chaos synchronization in networks of semiconductor superlattices

NASA Astrophysics Data System (ADS)

Li, Wen; Aviad, Yaara; Reidler, Igor; Song, Helun; Huang, Yuyang; Biermann, Klaus; Rosenbluh, Michael; Zhang, Yaohui; Grahn, Holger T.; Kanter, Ido

2015-11-01

Chaos synchronization has been demonstrated as a useful building block for various tasks in secure communications, including a source of all-electronic ultrafast physical random number generators based on room temperature spontaneous chaotic oscillations in a DC-biased weakly coupled GaAs/Al0.45Ga0.55As semiconductor superlattice (SSL). Here, we experimentally demonstrate the emergence of several types of chaos synchronization, e.g. leader-laggard, face-to-face and zero-lag synchronization in network motifs of coupled SSLs consisting of unidirectional and mutual coupling as well as self-feedback coupling. Each type of synchronization clearly reflects the symmetry of the topology of its network motif. The emergence of a chaotic SSL without external feedback and synchronization among different structured SSLs open up the possibility for advanced secure multi-user communication methods based on large networks of coupled SSLs.

Toward a Dynamically Reconfigurable Computing and Communication System for Small Spacecraft

NASA Technical Reports Server (NTRS)

Kifle, Muli; Andro, Monty; Tran, Quang K.; Fujikawa, Gene; Chu, Pong P.

2003-01-01

Future science missions will require the use of multiple spacecraft with multiple sensor nodes autonomously responding and adapting to a dynamically changing space environment. The acquisition of random scientific events will require rapidly changing network topologies, distributed processing power, and a dynamic resource management strategy. Optimum utilization and configuration of spacecraft communications and navigation resources will be critical in meeting the demand of these stringent mission requirements. There are two important trends to follow with respect to NASA's (National Aeronautics and Space Administration) future scientific missions: the use of multiple satellite systems and the development of an integrated space communications network. Reconfigurable computing and communication systems may enable versatile adaptation of a spacecraft system's resources by dynamic allocation of the processor hardware to perform new operations or to maintain functionality due to malfunctions or hardware faults. Advancements in FPGA (Field Programmable Gate Array) technology make it possible to incorporate major communication and network functionalities in FPGA chips and provide the basis for a dynamically reconfigurable communication system. Advantages of higher computation speeds and accuracy are envisioned with tremendous hardware flexibility to ensure maximum survivability of future science mission spacecraft. This paper discusses the requirements, enabling technologies, and challenges associated with dynamically reconfigurable space communications systems.

Adaptive mechanism-based congestion control for networked systems

NASA Astrophysics Data System (ADS)

Liu, Zhi; Zhang, Yun; Chen, C. L. Philip

2013-03-01

In order to assure the communication quality in network systems with heavy traffic and limited bandwidth, a new ATRED (adaptive thresholds random early detection) congestion control algorithm is proposed for the congestion avoidance and resource management of network systems. Different to the traditional AQM (active queue management) algorithms, the control parameters of ATRED are not configured statically, but dynamically adjusted by the adaptive mechanism. By integrating with the adaptive strategy, ATRED alleviates the tuning difficulty of RED (random early detection) and shows a better control on the queue management, and achieve a more robust performance than RED under varying network conditions. Furthermore, a dynamic transmission control protocol-AQM control system using ATRED controller is introduced for the systematic analysis. It is proved that the stability of the network system can be guaranteed when the adaptive mechanism is finely designed. Simulation studies show the proposed ATRED algorithm achieves a good performance in varying network environments, which is superior to the RED and Gentle-RED algorithm, and providing more reliable service under varying network conditions.

Spreading of infection in a two species reaction-diffusion process in networks

NASA Astrophysics Data System (ADS)

Korosoglou, Paschalis; Kittas, Aristotelis; Argyrakis, Panos

2010-12-01

We study the dynamics of the infection of a two mobile species reaction from a single infected agent in a population of healthy agents. Historically, the main focus for infection propagation has been through spreading phenomena, where a random location of the system is initially infected and then propagates by successfully infecting its neighbor sites. Here both the infected and healthy agents are mobile, performing classical random walks. This may be a more realistic picture to such epidemiological models, such as the spread of a virus in communication networks of routers, where data travel in packets, the communication time of stations in ad hoc mobile networks, information spreading (such as rumor spreading) in social networks, etc. We monitor the density of healthy particles ρ(t) , which we find in all cases to be an exponential function in the long-time limit in two-dimensional and three-dimensional lattices and Erdős-Rényi (ER) and scale-free (SF) networks. We also investigate the scaling of the crossover time tc from short- to long-time exponential behavior, which we find to be a power law in lattices and ER networks. This crossover is shown to be absent in SF networks, where we reveal the role of the connectivity of the network in the infection process. We compare this behavior to ER networks and lattices and highlight the significance of various connectivity patterns, as well as the important differences of this process in the various underlying geometries, revealing a more complex behavior of ρ(t) .

The Relationship of Policymaking and Networking Characteristics among Leaders of Large Urban Health Departments.

PubMed

Leider, Jonathon P; Castrucci, Brian C; Harris, Jenine K; Hearne, Shelley

2015-08-06

The relationship between policy networks and policy development among local health departments (LHDs) is a growing area of interest to public health practitioners and researchers alike. In this study, we examine policy activity and ties between public health leadership across large urban health departments. This study uses data from a national profile of local health departments as well as responses from a survey sent to three staff members (local health official, chief of policy, chief science officer) in each of 16 urban health departments in the United States. Network questions related to frequency of contact with health department personnel in other cities. Using exponential random graph models, network density and centrality were examined, as were patterns of communication among those working on several policy areas using exponential random graph models. All 16 LHDs were active in communicating about chronic disease as well as about use of alcohol, tobacco, and other drugs (ATOD). Connectedness was highest among local health officials (density = .55), and slightly lower for chief science officers (d = .33) and chiefs of policy (d = .29). After accounting for organizational characteristics, policy homophily (i.e., when two network members match on a single characteristic) and tenure were the most significant predictors of formation of network ties. Networking across health departments has the potential for accelerating the adoption of public health policies. This study suggests similar policy interests and formation of connections among senior leadership can potentially drive greater connectedness among other staff.

The Relationship of Policymaking and Networking Characteristics among Leaders of Large Urban Health Departments

PubMed Central

Leider, Jonathon P.; Castrucci, Brian C.; Harris, Jenine K.; Hearne, Shelley

2015-01-01

Background: The relationship between policy networks and policy development among local health departments (LHDs) is a growing area of interest to public health practitioners and researchers alike. In this study, we examine policy activity and ties between public health leadership across large urban health departments. Methods: This study uses data from a national profile of local health departments as well as responses from a survey sent to three staff members (local health official, chief of policy, chief science officer) in each of 16 urban health departments in the United States. Network questions related to frequency of contact with health department personnel in other cities. Using exponential random graph models, network density and centrality were examined, as were patterns of communication among those working on several policy areas using exponential random graph models. Results: All 16 LHDs were active in communicating about chronic disease as well as about use of alcohol, tobacco, and other drugs (ATOD). Connectedness was highest among local health officials (density = .55), and slightly lower for chief science officers (d = .33) and chiefs of policy (d = .29). After accounting for organizational characteristics, policy homophily (i.e., when two network members match on a single characteristic) and tenure were the most significant predictors of formation of network ties. Conclusion: Networking across health departments has the potential for accelerating the adoption of public health policies. This study suggests similar policy interests and formation of connections among senior leadership can potentially drive greater connectedness among other staff. PMID:26258784

Uncoordinated MAC for Adaptive Multi Beam Directional Networks: Analysis and Evaluation

DTIC Science & Technology

2016-08-01

control (MAC) policies for emerging systems that are equipped with fully digital antenna arrays which are capable of adaptive multi-beam directional...Adaptive Beam- forming, Multibeam, Directional Networking, Random Access, Smart Antennas I. INTRODUCTION Fully digital beamforming antenna arrays that...are capable of adaptive multi-beam communications are quickly becoming a reality. These antenna arrays allow users to form multiple simultaneous

Telecommunications media for the delivery of educational programming

NASA Technical Reports Server (NTRS)

Ballard, R.; Eastwood, L. F., Jr.

1974-01-01

The technical characteristics of various telecommunications media are examined for incorporation into educational networks. FM radio, AM radio, and VHF and UHF television are considered along with computer-aided instruction. The application of iteration networks to library systems, and microform technology are discussed. The basic principles of the communications theory are outlined, and the operation of the PLATO 4 random access system is described.

Network-Friendly Gossiping

NASA Astrophysics Data System (ADS)

Serbu, Sabina; Rivière, Étienne; Felber, Pascal

The emergence of large-scale distributed applications based on many-to-many communication models, e.g., broadcast and decentralized group communication, has an important impact on the underlying layers, notably the Internet routing infrastructure. To make an effective use of network resources, protocols should both limit the stress (amount of messages) on each infrastructure entity like routers and links, and balance as much as possible the load in the network. Most protocols use application-level metrics such as delays to improve efficiency of content dissemination or routing, but the extend to which such application-centric optimizations help reduce and balance the load imposed to the infrastructure is unclear. In this paper, we elaborate on the design of such network-friendly protocols and associated metrics. More specifically, we investigate random-based gossip dissemination. We propose and evaluate different ways of making this representative protocol network-friendly while keeping its desirable properties (robustness and low delays). Simulations of the proposed methods using synthetic and real network topologies convey and compare their abilities to reduce and balance the load while keeping good performance.

Fermi-Dirac statistics and traffic in complex networks.

PubMed

de Moura, Alessandro P S

2005-06-01

We propose an idealized model for traffic in a network, in which many particles move randomly from node to node, following the network's links, and it is assumed that at most one particle can occupy any given node. This is intended to mimic the finite forwarding capacity of nodes in communication networks, thereby allowing the possibility of congestion and jamming phenomena. We show that the particles behave like free fermions, with appropriately defined energy-level structure and temperature. The statistical properties of this system are thus given by the corresponding Fermi-Dirac distribution. We use this to obtain analytical expressions for dynamical quantities of interest, such as the mean occupation of each node and the transport efficiency, for different network topologies and particle densities. We show that the subnetwork of free nodes always fragments into small isolated clusters for a sufficiently large number of particles, implying a communication breakdown at some density for all network topologies. These results are compared to direct simulations.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs.

PubMed

Bhuiyan, Hasanuzzaman; Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

2017-06-01

An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs☆

PubMed Central

Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

2017-01-01

An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors. PMID:28757680

Experimental plug and play quantum coin flipping.

PubMed

Pappa, Anna; Jouguet, Paul; Lawson, Thomas; Chailloux, André; Legré, Matthieu; Trinkler, Patrick; Kerenidis, Iordanis; Diamanti, Eleni

2014-04-24

Performing complex cryptographic tasks will be an essential element in future quantum communication networks. These tasks are based on a handful of fundamental primitives, such as coin flipping, where two distrustful parties wish to agree on a randomly generated bit. Although it is known that quantum versions of these primitives can offer information-theoretic security advantages with respect to classical protocols, a demonstration of such an advantage in a practical communication scenario has remained elusive. Here we experimentally implement a quantum coin flipping protocol that performs strictly better than classically possible over a distance suitable for communication over metropolitan area optical networks. The implementation is based on a practical plug and play system, developed by significantly enhancing a commercial quantum key distribution device. Moreover, we provide combined quantum coin flipping protocols that are almost perfectly secure against bounded adversaries. Our results offer a useful toolbox for future secure quantum communications.

Communication about childhood obesity on Twitter.

PubMed

Harris, Jenine K; Moreland-Russell, Sarah; Tabak, Rachel G; Ruhr, Lindsay R; Maier, Ryan C

2014-07-01

Little is known about the use of social media as a tool for health communication. We used a mixed-methods design to examine communication about childhood obesity on Twitter. NodeXL was used to collect tweets sent in June 2013 containing the hashtag #childhoodobesity. Tweets were coded for content; tweeters were classified by sector and health focus. Data were also collected on the network of follower connections among the tweeters. We used descriptive statistics and exponential random graph modeling to examine tweet content, characteristics of tweeters, and the composition and structure of the network of connections facilitating communication among tweeters. We collected 1110 tweets originating from 576 unique Twitter users. More individuals (65.6%) than organizations (32.9%) tweeted. More tweets focused on individual behavior than environment or policy. Few government and educational tweeters were in the network, but they were more likely than private individuals to be followed by others. There is an opportunity to better disseminate evidence-based information to a broad audience through Twitter by increasing the presence of credible sources in the #childhoodobesity conversation and focusing the content of tweets on scientific evidence.

The ALOHA SYSTEM

NASA Technical Reports Server (NTRS)

Abramson, N.

1972-01-01

The report provides a status report and description of THE ALOHA SYSTEM research project at the University of Hawaii. THE ALOHA SYSTEM involves the analysis and construction of advanced methods of random access communications in large computer-communication systems. The existing ALOHA SYSTEM computer-communication network uses two 24,000 baud channels in the UHF band. The system employs message switching techniques similar to those of the ARPANET, in conjunction with a novel form of random access radio channel multiplexing. By means of these techniques the system has the capacity to accommodate several hundred active users of alphanumeric consoles on the two channels available. Each of these users can transmit and receive at a peak data rate of 24,000 baud although the average data rate of the users must of course be considerably less.

Degree-constrained multicast routing for multimedia communications

NASA Astrophysics Data System (ADS)

Wang, Yanlin; Sun, Yugeng; Li, Guidan

2005-02-01

Multicast services have been increasingly used by many multimedia applications. As one of the key techniques to support multimedia applications, the rational and effective multicast routing algorithms are very important to networks performance. When switch nodes in networks have different multicast capability, multicast routing problem is modeled as the degree-constrained Steiner problem. We presented two heuristic algorithms, named BMSTA and BSPTA, for the degree-constrained case in multimedia communications. Both algorithms are used to generate degree-constrained multicast trees with bandwidth and end to end delay bound. Simulations over random networks were carried out to compare the performance of the two proposed algorithms. Experimental results show that the proposed algorithms have advantages in traffic load balancing, which can avoid link blocking and enhance networks performance efficiently. BMSTA has better ability in finding unsaturated links and (or) unsaturated nodes to generate multicast trees than BSPTA. The performance of BMSTA is affected by the variation of degree constraints.

An efficient group multicast routing for multimedia communication

NASA Astrophysics Data System (ADS)

Wang, Yanlin; Sun, Yugen; Yan, Xinfang

2004-04-01

Group multicasting is a kind of communication mechanism whereby each member of a group sends messages to all the other members of the same group. Group multicast routing algorithms capable of satisfying quality of service (QoS) requirements of multimedia applications are essential for high-speed networks. We present a heuristic algorithm for group multicast routing with end to end delay constraint. Source-specific routing trees for each member are generated in our algorithm, which satisfy member"s bandwidth and end to end delay requirements. Simulations over random network were carried out to compare proposed algorithm performance with Low and Song"s. The experimental results show that our proposed algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover, our algorithm achieves good performance in balancing traffic, which can avoid link blocking and enhance the network behavior efficiently.

Dynamics of Complex Systems Built as Coupled Physical, Communication and Decision Layers

PubMed Central

Kühnlenz, Florian; Nardelli, Pedro H. J.

2016-01-01

This paper proposes a simple model to capture the complexity of multilayer systems where their constituent layers affect, and are affected by, each other. The physical layer is a circuit composed by a power source and resistors in parallel. Every individual agent aims at maximizing its own delivered power by adding, removing or keeping the resistors it has; the delivered power is in turn a non-linear function that depends on the other agents’ behavior, its own internal state, its global state perception, the information received from its neighbors via the communication network and a randomized selfishness. We develop an agent-based simulation to analyze the effects of number of agents (system size), communication network topology, communication errors and the minimum power gain that triggers a behavioral change on the system dynamic. Our results show that a wave-like behavior at macro-level (caused by individual changes in the decision layer) can only emerge for a specific system size. The ratio between cooperators and defectors depends on the minimum gain assumed—lower minimal gains lead to less cooperation, and vice-versa. Different communication network topologies imply different levels of power utilization and fairness at the physical layer, and a certain level of error in the communication layer induces more cooperation. PMID:26730590

Random-access algorithms for multiuser computer communication networks. Doctoral thesis, 1 September 1986-31 August 1988

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

Papantoni-Kazakos, P.; Paterakis, M.

1988-07-01

For many communication applications with time constraints (e.g., transmission of packetized voice messages), a critical performance measure is the percentage of messages transmitted within a given amount of time after their generation at the transmitting station. This report presents a random-access algorithm (RAA) suitable for time-constrained applications. Performance analysis demonstrates that significant message-delay improvement is attained at the expense of minimal traffic loss. Also considered is the case of noisy channels. The noise effect appears at erroneously observed channel feedback. Error sensitivity analysis shows that the proposed random-access algorithm is insensitive to feedback channel errors. Window Random-Access Algorithms (RAAs) aremore » considered next. These algorithms constitute an important subclass of Multiple-Access Algorithms (MAAs); they are distributive, and they attain high throughput and low delays by controlling the number of simultaneously transmitting users.« less

A Peer-Educator Network HIV Prevention Intervention Among Injection Drug Users: Results of a Randomized Controlled Trial in St. Petersburg, Russia

PubMed Central

Latkin, Carl A.; Kukhareva, Polina V.; Malov, Sergey V.; Batluk, Julia V.; Shaboltas, Alla V.; Skochilov, Roman V.; Sokolov, Nicolay V.; Verevochkin, Sergei V.; Hudgens, Michael G.; Kozlov, Andrei P.

2014-01-01

We evaluated the efficacy of a peer-educator network intervention as a strategy to reduce HIV acquisition among injection drug users (IDUs) and their drug and/or sexual networks. A randomized controlled trial was conducted in St. Petersburg, Russia among IDU index participants and their risk network participants. Network units were randomized to the control or experimental intervention. Only the experimental index participants received training sessions to communicate risk reduction techniques to their network members. Analysis includes 76 index and 84 network participants who were HIV uninfected. The main outcome measure was HIV sero-conversion. The incidence rates in the control and experimental groups were 19.57 (95 % CI 10.74–35.65) and 7.76 (95 % CI 3.51–17.19) cases per 100 p/y, respectively. The IRR was 0.41 (95 % CI 0.15–1.08) without a statistically significant difference between the two groups (log rank test statistic X2 = 2.73, permutation p value = 0.16). Retention rate was 67 % with a third of the loss due to incarceration or death. The results show a promising trend that this strategy would be successful in reducing the acquisition of HIV among IDUs. PMID:23881187

Effects of traffic generation patterns on the robustness of complex networks

NASA Astrophysics Data System (ADS)

Wu, Jiajing; Zeng, Junwen; Chen, Zhenhao; Tse, Chi K.; Chen, Bokui

2018-02-01

Cascading failures in communication networks with heterogeneous node functions are studied in this paper. In such networks, the traffic dynamics are highly dependent on the traffic generation patterns which are in turn determined by the locations of the hosts. The data-packet traffic model is applied to Barabási-Albert scale-free networks to study the cascading failures in such networks and to explore the effects of traffic generation patterns on network robustness. It is found that placing the hosts at high-degree nodes in a network can make the network more robust against both intentional attacks and random failures. It is also shown that the traffic generation pattern plays an important role in network design.

Distributive routing and congestion control in wireless multihop ad hoc communication networks

NASA Astrophysics Data System (ADS)

Glauche, Ingmar; Krause, Wolfram; Sollacher, Rudolf; Greiner, Martin

2004-10-01

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example network connectivity, good data traffic performance and robustness are guaranteed. In this contribution the focus is on routing and congestion control. First, random data traffic along shortest path routes is studied by simulations as well as theoretical modeling. Measures of congestion like end-to-end time delay and relaxation times are given. A scaling law of the average time delay with respect to network size is revealed and found to depend on the underlying network topology. In the second step, a distributive routing and congestion control is proposed. Each node locally propagates its routing cost estimates and information about its congestion state to its neighbors, which then update their respective cost estimates. This allows for a flexible adaptation of end-to-end routes to the overall congestion state of the network. Compared to shortest-path routing, the critical network load is significantly increased.

SHER: a colored petri net based random mobility model for wireless communications.

PubMed

Khan, Naeem Akhtar; Ahmad, Farooq; Khan, Sher Afzal

2015-01-01

In wireless network research, simulation is the most imperative technique to investigate the network's behavior and validation. Wireless networks typically consist of mobile hosts; therefore, the degree of validation is influenced by the underlying mobility model, and synthetic models are implemented in simulators because real life traces are not widely available. In wireless communications, mobility is an integral part while the key role of a mobility model is to mimic the real life traveling patterns to study. The performance of routing protocols and mobility management strategies e.g. paging, registration and handoff is highly dependent to the selected mobility model. In this paper, we devise and evaluate the Show Home and Exclusive Regions (SHER), a novel two-dimensional (2-D) Colored Petri net (CPN) based formal random mobility model, which exhibits sociological behavior of a user. The model captures hotspots where a user frequently visits and spends time. Our solution eliminates six key issues of the random mobility models, i.e., sudden stops, memoryless movements, border effect, temporal dependency of velocity, pause time dependency, and speed decay in a single model. The proposed model is able to predict the future location of a mobile user and ultimately improves the performance of wireless communication networks. The model follows a uniform nodal distribution and is a mini simulator, which exhibits interesting mobility patterns. The model is also helpful to those who are not familiar with the formal modeling, and users can extract meaningful information with a single mouse-click. It is noteworthy that capturing dynamic mobility patterns through CPN is the most challenging and virulent activity of the presented research. Statistical and reachability analysis techniques are presented to elucidate and validate the performance of our proposed mobility model. The state space methods allow us to algorithmically derive the system behavior and rectify the errors of our proposed model.

Event-triggered synchronization for reaction-diffusion complex networks via random sampling

NASA Astrophysics Data System (ADS)

Dong, Tao; Wang, Aijuan; Zhu, Huiyun; Liao, Xiaofeng

2018-04-01

In this paper, the synchronization problem of the reaction-diffusion complex networks (RDCNs) with Dirichlet boundary conditions is considered, where the data is sampled randomly. An event-triggered controller based on the sampled data is proposed, which can reduce the number of controller and the communication load. Under this strategy, the synchronization problem of the diffusion complex network is equivalently converted to the stability of a of reaction-diffusion complex dynamical systems with time delay. By using the matrix inequality technique and Lyapunov method, the synchronization conditions of the RDCNs are derived, which are dependent on the diffusion term. Moreover, it is found the proposed control strategy can get rid of the Zeno behavior naturally. Finally, a numerical example is given to verify the obtained results.

Tactical Mobile Communications (Communications tactiques mobiles)

DTIC Science & Technology

1999-11-01

13]. randomly at the network nodes. Each multicast group Our studies do, in fact, support this conjecture. consists of the source node plus at least...Capability investigate the MMR concept in some more detail. The study was contracted to a group which Multi-role denotes the capability to support a...through the HW- and SW-resources of the frontends can be incorporated in a task-dedicated GPU. Functions can be grouped into four categories: MMR

Interference Drop Scheme: Enhancing QoS Provision in Multi-Hop Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Luo, Chang-Yi; Komuro, Nobuyoshi; Takahashi, Kiyoshi; Kasai, Hiroyuki; Ueda, Hiromi; Tsuboi, Toshinori

Ad hoc networking uses wireless technologies to construct networks with no physical infrastructure and so are expected to provide instant networking in areas such as disaster recovery sites and inter-vehicle communication. Unlike conventional wired networks services, services in ad hoc networks are easily disrupted by the frequent changes in traffic and topology. Therefore, solutions to assure the Quality of Services (QoS) in ad hoc networks are different from the conventional ones used in wired networks. In this paper, we propose a new queue management scheme, Interference Drop Scheme (IDS) for ad hoc networks. In the conventional queue management approaches such as FIFO (First-in First-out) and RED (Random Early Detection), a queue is usually managed by a queue length limit. FIFO discards packets according to the queue limit, and RED discards packets in an early and random fashion. IDS, on the other hand, manages the queue according to wireless interference time, which increases as the number of contentions in the MAC layer increases. When there are many MAC contentions, IDS discards TCP data packets. By observing the interference time and discarding TCP data packets, our simulation results show that IDS improves TCP performance and reduces QoS violations in UDP in ad hoc networks with chain, grid, and random topologies. Our simulation results also demonstrate that wireless interference time is a better metric than queue length limit for queue management in multi-hop ad hoc networks.

Neural network for control of rearrangeable Clos networks.

PubMed

Park, Y K; Cherkassky, V

1994-09-01

Rapid evolution in the field of communication networks requires high speed switching technologies. This involves a high degree of parallelism in switching control and routing performed at the hardware level. The multistage crossbar networks have always been attractive to switch designers. In this paper a neural network approach to controlling a three-stage Clos network in real time is proposed. This controller provides optimal routing of communication traffic requests on a call-by-call basis by rearranging existing connections, with a minimum length of rearrangement sequence so that a new blocked call request can be accommodated. The proposed neural network controller uses Paull's rearrangement algorithm, along with the special (least used) switch selection rule in order to minimize the length of rearrangement sequences. The functional behavior of our model is verified by simulations and it is shown that the convergence time required for finding an optimal solution is constant, regardless of the switching network size. The performance is evaluated for random traffic with various traffic loads. Simulation results show that applying the least used switch selection rule increases the efficiency in switch rearrangements, reducing the network convergence time. The implementation aspects are also discussed to show the feasibility of the proposed approach.

Wireless Sensor Network Quality of Service Improvement on Flooding Attack Condition

NASA Astrophysics Data System (ADS)

Hartono, R.; Widyawan; Wibowo, S. B.; Purnomo, A.; Hartatik

2018-03-01

There are two methods of building communication using wireless media. The first method is building a base infrastructure as an intermediary between users. Problems that arise on this type of network infrastructure is limited space to build any network physical infrastructure and also the cost factor. The second method is to build an ad hoc network between users who will communicate. On ad hoc network, each user must be willing to send data from source to destination for the occurrence of a communication. One of network protocol in Ad Hoc, Ad hoc on demand Distance Vector (AODV), has the smallest overhead value, easier to adapt to dynamic network and has small control message. One AODV protocol’s drawback is route finding process’ security for sending the data. In this research, AODV protocol is optimized by determining Expanding Ring Search (ERS) best value. Random topology is used with variation in the number of nodes: 25, 50, 75, 100, 125 and 150 with node’s speed of 10m/s in the area of 1000m x 1000m on flooding network condition. Parameters measured are Throughput, Packet Delivery Ratio, Average Delay and Normalized Routing Load. From the test results of AODV protocol optimization with best value of Expanding Ring Search (ERS), throughput increased by 5.67%, packet delivery ratio increased by 5.73%, and as for Normalized Routing Load decreased by 4.66%. ERS optimal value for each node’s condition depending on the number of nodes on the network.

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator.

PubMed

Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus

2017-01-01

Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation.

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator

PubMed Central

Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus

2017-01-01

Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation. PMID:28596730

Controllability of social networks and the strategic use of random information.

PubMed

Cremonini, Marco; Casamassima, Francesca

2017-01-01

This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and represents one of the few options for influencing the behavior of a social context that could be accepted as ethical, could be fully disclosed to members, and does not involve the use of force or of deception. Our research is based on a model of knowledge diffusion applied to a time-varying adaptive network and considers two well-known strategies for influencing social contexts: One is the selection of few influencers for manipulating their actions in order to drive the whole network to a certain behavior; the other, instead, drives the network behavior acting on the state of a large subset of ordinary, scarcely influencing users. The two approaches have been studied in terms of network and diffusion effects. The network effect is analyzed through the changes induced on network average degree and clustering coefficient, while the diffusion effect is based on two ad hoc metrics which are defined to measure the degree of knowledge diffusion and skill level, as well as the polarization of agent interests. The results, obtained through simulations on synthetic networks, show a rich dynamics and strong effects on the communication structure and on the distribution of knowledge and skills. These findings support our hypothesis that the strategic use of random information could represent a realistic approach to social network controllability, and that with both strategies, in principle, the control effect could be remarkable.

A scheme for synchronizing clocks connected by a packet communication network

NASA Astrophysics Data System (ADS)

dos Santos, R. V.; Monteiro, L. H. A.

2012-07-01

Consider a communication system in which a transmitter equipment sends fixed-size packets of data at a uniform rate to a receiver equipment. Consider also that these equipments are connected by a packet-switched network, which introduces a random delay to each packet. Here we propose an adaptive clock recovery scheme able of synchronizing the frequencies and the phases of these devices, within specified limits of precision. This scheme for achieving frequency and phase synchronization is based on measurements of the packet arrival times at the receiver, which are used to control the dynamics of a digital phase-locked loop. The scheme performance is evaluated via numerical simulations performed by using realistic parameter values.

Physical layer one-time-pad data encryption through synchronized semiconductor laser networks

NASA Astrophysics Data System (ADS)

Argyris, Apostolos; Pikasis, Evangelos; Syvridis, Dimitris

2016-02-01

Semiconductor lasers (SL) have been proven to be a key device in the generation of ultrafast true random bit streams. Their potential to emit chaotic signals under conditions with desirable statistics, establish them as a low cost solution to cover various needs, from large volume key generation to real-time encrypted communications. Usually, only undemanding post-processing is needed to convert the acquired analog timeseries to digital sequences that pass all established tests of randomness. A novel architecture that can generate and exploit these true random sequences is through a fiber network in which the nodes are semiconductor lasers that are coupled and synchronized to central hub laser. In this work we show experimentally that laser nodes in such a star network topology can synchronize with each other through complex broadband signals that are the seed to true random bit sequences (TRBS) generated at several Gb/s. The potential for each node to access real-time generated and synchronized with the rest of the nodes random bit streams, through the fiber optic network, allows to implement an one-time-pad encryption protocol that mixes the synchronized true random bit sequence with real data at Gb/s rates. Forward-error correction methods are used to reduce the errors in the TRBS and the final error rate at the data decoding level. An appropriate selection in the sampling methodology and properties, as well as in the physical properties of the chaotic seed signal through which network locks in synchronization, allows an error free performance.

Delineating interpersonal communication networks: a study of the diffusion of an intervention among female entertainment workers in Shanghai, China.

PubMed

Chen, Yiyun; Latkin, Carl; Celentano, David D; Yang, Xiushi; Li, Xiaoming; Xia, Guomei; Miao, Jia; Surkan, Pamela J

2012-10-01

Diffusion of innovation (DOI) is widely cited in the HIV behavior change literature; however there is a dearth of research on the application of DOI in interventions for sex workers. Following a randomized-controlled trial of HIV risk reduction among female entertainment workers (FEWs) in Shanghai, China, we used qualitative approaches to delineate potential interpersonal communication networks and contributing factors that promote diffusion of information in entertainment venues. Results showed that top-down communication networks from the venue owners to the FEWs were efficient for diffusion of information. Mammies/madams, who act as intermediaries between FEWs and clients form an essential part of FEWs' social networks but do not function as information disseminators due to a conflict of interest between safer sex and maximizing profits. Diffusion of information in large venues tended to rely more on aspects of the physical environment to create intimacy and on pressure from managers to stimulate communication. In small venues, communication and conversations occurred more spontaneously among FEWs. Information about safer sex appeared to be more easily disseminated when the message and the approach used to convey information could be tailored to people working at different levels in the venues. Results suggest that safer sex messages should be provided consistently following an intervention to further promote intervention diffusion, and health-related employer liability systems in entertainment venues should be established, in which employers are responsible for the health of their employees. Our study suggests that existing personal networks can be used to disseminate information in entertainment venues and one should be mindful about the context-specific interactions between FEWs and others in their social networks to better achieve diffusion of interventions.

Delineating Interpersonal Communication Networks: A Study of the Diffusion of an Intervention Among Female Entertainment Workers in Shanghai, China

PubMed Central

Latkin, Carl; Celentano, David D.; Yang, Xiushi; Li, Xiaoming; Xia, Guomei; Miao, Jia; Surkan, Pamela J.

2013-01-01

Diffusion of innovation (DOI) is widely cited in the HIV behavior change literature; however there is a dearth of research on the application of DOI in interventions for sex workers. Following a randomized-controlled trial of HIV risk reduction among female entertainment workers (FEWs) in Shanghai, China, we used qualitative approaches to delineate potential interpersonal communication networks and contributing factors that promote diffusion of information in entertainment venues. Results showed that top-down communication networks from the venue owners to the FEWs were efficient for diffusion of information. Mammies/madams, who act as intermediaries between FEWs and clients form an essential part of FEWs’ social networks but do not function as information disseminators due to a conflict of interest between safer sex and maximizing profits. Diffusion of information in large venues tended to rely more on aspects of the physical environment to create intimacy and on pressure from managers to stimulate communication. In small venues, communication and conversations occurred more spontaneously among FEWs. Information about safer sex appeared to be more easily disseminated when the message and the approach used to convey information could be tailored to people working at different levels in the venues. Results suggest that safer sex messages should be provided consistently following an intervention to further promote intervention diffusion, and health-related employer liability systems in entertainment venues should be established, in which employers are responsible for the health of their employees. Our study suggests that existing personal networks can be used to disseminate information in entertainment venues and one should be mindful about the context-specific interactions between FEWs and others in their social networks to better achieve diffusion of interventions. PMID:22638867

All about Eve: Secret Sharing using Quantum Effects

NASA Technical Reports Server (NTRS)

Jackson, Deborah J.

2005-01-01

This document discusses the nature of light (including classical light and photons), encryption, quantum key distribution (QKD), light polarization and beamsplitters and their application to information communication. A quantum of light represents the smallest possible subdivision of radiant energy (light) and is called a photon. The QKD key generation sequence is outlined including the receiver broadcasting the initial signal indicating reception availability, timing pulses from the sender to provide reference for gated detection of photons, the sender generating photons through random polarization while the receiver detects photons with random polarization and communicating via data link to mutually establish random keys. The QKD network vision includes inter-SATCOM, point-to-point Gnd Fiber and SATCOM-fiber nodes. QKD offers an unconditionally secure method of exchanging encryption keys. Ongoing research will focus on how to increase the key generation rate.

Critical phenomena in communication/computation networks with various topologies and suboptimal to optimal resource allocation

NASA Astrophysics Data System (ADS)

Cogoni, Marco; Busonera, Giovanni; Anedda, Paolo; Zanetti, Gianluigi

2015-01-01

We generalize previous studies on critical phenomena in communication networks [1,2] by adding computational capabilities to the nodes. In our model, a set of tasks with random origin, destination and computational structure is distributed on a computational network, modeled as a graph. By varying the temperature of a Metropolis Montecarlo, we explore the global latency for an optimal to suboptimal resource assignment at a given time instant. By computing the two-point correlation function for the local overload, we study the behavior of the correlation distance (both for links and nodes) while approaching the congested phase: a transition from peaked to spread g(r) is seen above a critical (Montecarlo) temperature Tc. The average latency trend of the system is predicted by averaging over several network traffic realizations while maintaining a spatially detailed information for each node: a sharp decrease of performance is found over Tc independently of the workload. The globally optimized computational resource allocation and network routing defines a baseline for a future comparison of the transition behavior with respect to existing routing strategies [3,4] for different network topologies.

Biometric Methods for Secure Communications in Body Sensor Networks: Resource-Efficient Key Management and Signal-Level Data Scrambling

NASA Astrophysics Data System (ADS)

Bui, Francis Minhthang; Hatzinakos, Dimitrios

2007-12-01

As electronic communications become more prevalent, mobile and universal, the threats of data compromises also accordingly loom larger. In the context of a body sensor network (BSN), which permits pervasive monitoring of potentially sensitive medical data, security and privacy concerns are particularly important. It is a challenge to implement traditional security infrastructures in these types of lightweight networks since they are by design limited in both computational and communication resources. A key enabling technology for secure communications in BSN's has emerged to be biometrics. In this work, we present two complementary approaches which exploit physiological signals to address security issues: (1) a resource-efficient key management system for generating and distributing cryptographic keys to constituent sensors in a BSN; (2) a novel data scrambling method, based on interpolation and random sampling, that is envisioned as a potential alternative to conventional symmetric encryption algorithms for certain types of data. The former targets the resource constraints in BSN's, while the latter addresses the fuzzy variability of biometric signals, which has largely precluded the direct application of conventional encryption. Using electrocardiogram (ECG) signals as biometrics, the resulting computer simulations demonstrate the feasibility and efficacy of these methods for delivering secure communications in BSN's.

Leader-Follower Formation Control of UUVs with Model Uncertainties, Current Disturbances, and Unstable Communication

PubMed Central

Yan, Zheping; Xu, Da; Chen, Tao; Zhang, Wei; Liu, Yibo

2018-01-01

Unmanned underwater vehicles (UUVs) have rapidly developed as mobile sensor networks recently in the investigation, survey, and exploration of the underwater environment. The goal of this paper is to develop a practical and efficient formation control method to improve work efficiency of multi-UUV sensor networks. Distributed leader-follower formation controllers are designed based on a state feedback and consensus algorithm. Considering that each vehicle is subject to model uncertainties and current disturbances, a second-order integral UUV model with a nonlinear function is established using the state feedback linearized method under current disturbances. For unstable communication among UUVs, communication failure and acoustic link noise interference are considered. Two-layer random switching communication topologies are proposed to solve the problem of communication failure. For acoustic link noise interference, accurate representation of valid communication information and noise stripping when designing controllers is necessary. Effective communication topology weights are designed to represent the validity of communication information interfered by noise. Utilizing state feedback and noise stripping, sufficient conditions for design formation controllers are proposed to ensure UUV formation achieves consensus under model uncertainties, current disturbances, and unstable communication. The stability of formation controllers is proven by the Lyapunov-Razumikhin theorem, and the validity is verified by simulation results. PMID:29473919

Local communities obstruct global consensus: Naming game on multi-local-world networks

NASA Astrophysics Data System (ADS)

Lou, Yang; Chen, Guanrong; Fan, Zhengping; Xiang, Luna

2018-02-01

Community structure is essential for social communications, where individuals belonging to the same community are much more actively interacting and communicating with each other than those in different communities within the human society. Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can generally reach global consensus asymptotically through iterative pair-wise conversations. The underlying network indicates the relationships among the individuals. In this paper, three typical topologies, namely random-graph, small-world and scale-free networks, are employed, which are embedded with the multi-local-world community structure, to study the naming game. Simulations show that (1) the convergence process to global consensus is getting slower as the community structure becomes more prominent, and eventually might fail; (2) if the inter-community connections are sufficiently dense, neither the number nor the size of the communities affects the convergence process; and (3) for different topologies with the same (or similar) average node-degree, local clustering of individuals obstruct or prohibit global consensus to take place. The results reveal the role of local communities in a global naming game in social network studies.

Does the number of cancer patients’ close social ties affect cancer-related information seeking through communication efficacy? Testing a mediation model

PubMed Central

Lewis, Nehama; Martinez, Lourdes S.

2014-01-01

This study addresses the question of whether having a broad social network of close friends equips cancer patients with increased efficacy to engage in communication about their cancer, which then leads to an increased likelihood of patients’ actively seeking cancer-related information. Guided by the theory of motivated information management (TMIM: Afifi & Weiner, 2006), the study also tests whether the effect of the number of close social ties on information seeking is mediated, in part, by communication efficacy. Results are based on data collected from a randomly drawn sample from the Pennsylvania Cancer Registry of 2,013 cancer patients who completed mail surveys in the Fall of 2006. Results are consistent with a cross-sectional mediation effect in which the number of close social ties in one’s social network is positively associated with communication efficacy (b = .17, p = .001), which, in turn, is positively associated with cancer-related information seeking (b = .13, p < .001). PMID:24673194

An Examination of the Utility of Non-Linear Dynamics Techniques for Analyzing Human Information Behaviors.

ERIC Educational Resources Information Center

Snyder, Herbert; Kurtze, Douglas

1992-01-01

Discusses the use of chaos, or nonlinear dynamics, for investigating computer-mediated communication. A comparison between real, human-generated data from a computer network and similarly constructed random-generated data is made, and mathematical procedures for determining chaos are described. (seven references) (LRW)

Correlated Sources in Distributed Networks--Data Transmission, Common Information Characterization and Inferencing

ERIC Educational Resources Information Center

Liu, Wei

2011-01-01

Correlation is often present among observations in a distributed system. This thesis deals with various design issues when correlated data are observed at distributed terminals, including: communicating correlated sources over interference channels, characterizing the common information among dependent random variables, and testing the presence of…

Practical Considerations in the Implementation of Collaborative Beamforming on Wireless Sensor Networks

PubMed Central

Felici-Castell, Santiago; Navarro, Enrique A.; Pérez-Solano, Juan J.; Segura-García, Jaume; García-Pineda, Miguel

2017-01-01

Wireless Sensor Networks (WSNs) are composed of spatially distributed autonomous sensor devices, named motes. These motes have their own power supply, processing unit, sensors and wireless communications However with many constraints, such as limited energy, bandwidth and computational capabilities. In these networks, at least one mote called a sink, acts as a gateway to connect with other networks. These sensor networks run monitoring applications and then the data gathered by these motes needs to be retrieved by the sink. When this sink is located in the far field, there have been many proposals in the literature based on Collaborative Beamforming (CB), also known as Distributed or Cooperative Beamforming, for these long range communications to reach the sink. In this paper, we conduct a thorough study of the related work and analyze the requirements to do CB. In order to implement these communications in real scenarios, we will consider if these requirements and the assumptions made are feasible from the point of view of commercial motes and their constraints. In addition, we will go a step further and will consider different alternatives, by relaxing these requirements, trying to find feasible assumptions to carry out these types of communications with commercial motes. This research considers the nonavailability of a central clock that synchronizes all motes in the WSN, and all motes have identical hardware. This is a feasibility study to do CB on WSN, using a simulated scenario with randomized delays obtained from experimental data from commercial motes. PMID:28134753

Practical Considerations in the Implementation of Collaborative Beamforming on Wireless Sensor Networks.

PubMed

Felici-Castell, Santiago; Navarro, Enrique A; Pérez-Solano, Juan J; Segura-García, Jaume; García-Pineda, Miguel

2017-01-26

Wireless Sensor Networks (WSNs) are composed of spatially distributed autonomous sensor devices, named motes. These motes have their own power supply, processing unit, sensors and wireless communications However with many constraints, such as limited energy, bandwidth and computational capabilities. In these networks, at least one mote called a sink, acts as a gateway to connect with other networks. These sensor networks run monitoring applications and then the data gathered by these motes needs to be retrieved by the sink. When this sink is located in the far field, there have been many proposals in the literature based on Collaborative Beamforming (CB), also known as Distributed or Cooperative Beamforming, for these long range communications to reach the sink. In this paper, we conduct a thorough study of the related work and analyze the requirements to do CB. In order to implement these communications in real scenarios, we will consider if these requirements and the assumptions made are feasible from the point of view of commercial motes and their constraints. In addition, we will go a step further and will consider different alternatives, by relaxing these requirements, trying to find feasible assumptions to carry out these types of communications with commercial motes. This research considers the nonavailability of a central clock that synchronizes all motes in the WSN, and all motes have identical hardware. This is a feasibility study to do CB on WSN, using a simulated scenario with randomized delays obtained from experimental data from commercial motes.

Simultaneous classical communication and quantum key distribution using continuous variables*

NASA Astrophysics Data System (ADS)

Qi, Bing

2016-10-01

Presently, classical optical communication systems employing strong laser pulses and quantum key distribution (QKD) systems working at single-photon levels are very different communication modalities. Dedicated devices are commonly required to implement QKD. In this paper, we propose a scheme which allows classical communication and QKD to be implemented simultaneously using the same communication infrastructure. More specially, we propose a coherent communication scheme where both the bits for classical communication and the Gaussian distributed random numbers for QKD are encoded on the same weak coherent pulse and decoded by the same coherent receiver. Simulation results based on practical system parameters show that both deterministic classical communication with a bit error rate of 10-9 and secure key distribution could be achieved over tens of kilometers of single-mode fibers. It is conceivable that in the future coherent optical communication network, QKD will be operated in the background of classical communication at a minimal cost.

Performance of a laser microsatellite network with an optical preamplifier.

PubMed

Arnon, Shlomi

2005-04-01

Laser satellite communication (LSC) uses free space as a propagation medium for various applications, such as intersatellite communication or satellite networking. An LSC system includes a laser transmitter and an optical receiver. For communication to occur, the line of sight of the transmitter and the receiver must be aligned. However, mechanical vibration and electronic noise in the control system reduce alignment between the transmitter laser beam and the receiver field of view (FOV), which results in pointing errors. The outcome of pointing errors is fading of the received signal, which leads to impaired link performance. An LSC system is considered in which the optical preamplifier is incorporated into the receiver, and a bit error probability (BEP) model is derived that takes into account the statistics of the pointing error as well as the optical amplifier and communication system parameters. The model and the numerical calculation results indicate that random pointing errors of sigma(chi)2G > 0.05 penalize communication performance dramatically for all combinations of optical amplifier gains and noise figures that were calculated.

Performance of multi-hop parallel free-space optical communication over gamma-gamma fading channel with pointing errors.

PubMed

Gao, Zhengguang; Liu, Hongzhan; Ma, Xiaoping; Lu, Wei

2016-11-10

Multi-hop parallel relaying is considered in a free-space optical (FSO) communication system deploying binary phase-shift keying (BPSK) modulation under the combined effects of a gamma-gamma (GG) distribution and misalignment fading. Based on the best path selection criterion, the cumulative distribution function (CDF) of this cooperative random variable is derived. Then the performance of this optical mesh network is analyzed in detail. A Monte Carlo simulation is also conducted to demonstrate the effectiveness of the results for the average bit error rate (ABER) and outage probability. The numerical result proves that it needs a smaller average transmitted optical power to achieve the same ABER and outage probability when using the multi-hop parallel network in FSO links. Furthermore, the system use of more number of hops and cooperative paths can improve the quality of the communication.

A fast key generation method based on dynamic biometrics to secure wireless body sensor networks for p-health.

PubMed

Zhang, G H; Poon, Carmen C Y; Zhang, Y T

2010-01-01

Body sensor networks (BSNs) have emerged as a new technology for healthcare applications, but the security of communication in BSNs remains a formidable challenge yet to be resolved. The paper discusses the typical attacks faced by BSNs and proposes a fast biometric based approach to generate keys for ensuing confidentiality and authentication in BSN communications. The approach was tested on 900 segments of electrocardiogram. Each segment was 4 seconds long and used to generate a 128-bit key. The results of the study found that entropy of 96% of the keys were above 0.95 and 99% of the hamming distances calculated from any two keys were above 50 bits. Based on the randomness and distinctiveness of these keys, it is concluded that the fast biometric based approach has great potential to be used to secure communication in BSNs for health applications.

Cyber-physical approach to the network-centric robotics control task

NASA Astrophysics Data System (ADS)

Muliukha, Vladimir; Ilyashenko, Alexander; Zaborovsky, Vladimir; Lukashin, Alexey

2016-10-01

Complex engineering tasks concerning control for groups of mobile robots are developed poorly. In our work for their formalization we use cyber-physical approach, which extends the range of engineering and physical methods for a design of complex technical objects by researching the informational aspects of communication and interaction between objects and with an external environment [1]. The paper analyzes network-centric methods for control of cyber-physical objects. Robots or cyber-physical objects interact with each other by transmitting information via computer networks using preemptive queueing system and randomized push-out mechanism [2],[3]. The main field of application for the results of our work is space robotics. The selection of cyber-physical systems as a special class of designed objects is due to the necessity of integrating various components responsible for computing, communications and control processes. Network-centric solutions allow using universal means for the organization of information exchange to integrate different technologies for the control system.

A Hybrid Key Management Scheme for WSNs Based on PPBR and a Tree-Based Path Key Establishment Method

PubMed Central

Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Chen, Wei

2016-01-01

With the development of wireless sensor networks (WSNs), in most application scenarios traditional WSNs with static sink nodes will be gradually replaced by Mobile Sinks (MSs), and the corresponding application requires a secure communication environment. Current key management researches pay less attention to the security of sensor networks with MS. This paper proposes a hybrid key management schemes based on a Polynomial Pool-based key pre-distribution and Basic Random key pre-distribution (PPBR) to be used in WSNs with MS. The scheme takes full advantages of these two kinds of methods to improve the cracking difficulty of the key system. The storage effectiveness and the network resilience can be significantly enhanced as well. The tree-based path key establishment method is introduced to effectively solve the problem of communication link connectivity. Simulation clearly shows that the proposed scheme performs better in terms of network resilience, connectivity and storage effectiveness compared to other widely used schemes. PMID:27070624

Current Trend Towards Using Soft Computing Approaches to Phase Synchronization in Communication Systems

NASA Technical Reports Server (NTRS)

Drake, Jeffrey T.; Prasad, Nadipuram R.

1999-01-01

This paper surveys recent advances in communications that utilize soft computing approaches to phase synchronization. Soft computing, as opposed to hard computing, is a collection of complementary methodologies that act in producing the most desirable control, decision, or estimation strategies. Recently, the communications area has explored the use of the principal constituents of soft computing, namely, fuzzy logic, neural networks, and genetic algorithms, for modeling, control, and most recently for the estimation of phase in phase-coherent communications. If the receiver in a digital communications system is phase-coherent, as is often the case, phase synchronization is required. Synchronization thus requires estimation and/or control at the receiver of an unknown or random phase offset.

Entanglement routers via a wireless quantum network based on arbitrary two qubit systems

NASA Astrophysics Data System (ADS)

Metwally, N.

2014-12-01

A wireless quantum network is generated between multi-hops, where each hop consists of two entangled nodes. These nodes share a finite number of entangled two-qubit systems randomly. Different types of wireless quantum bridges (WQBS) are generated between the non-connected nodes. The efficiency of these WQBS to be used as quantum channels between its terminals to perform quantum teleportation is investigated. We suggest a theoretical wireless quantum communication protocol to teleport unknown quantum signals from one node to another, where the more powerful WQBS are used as quantum channels. It is shown that, by increasing the efficiency of the sources that emit the initial partial entangled states, one can increase the efficiency of the wireless quantum communication protocol.

Long-Term Evolution of Email Networks: Statistical Regularities, Predictability and Stability of Social Behaviors.

PubMed

Godoy-Lorite, Antonia; Guimerà, Roger; Sales-Pardo, Marta

2016-01-01

In social networks, individuals constantly drop ties and replace them by new ones in a highly unpredictable fashion. This highly dynamical nature of social ties has important implications for processes such as the spread of information or of epidemics. Several studies have demonstrated the influence of a number of factors on the intricate microscopic process of tie replacement, but the macroscopic long-term effects of such changes remain largely unexplored. Here we investigate whether, despite the inherent randomness at the microscopic level, there are macroscopic statistical regularities in the long-term evolution of social networks. In particular, we analyze the email network of a large organization with over 1,000 individuals throughout four consecutive years. We find that, although the evolution of individual ties is highly unpredictable, the macro-evolution of social communication networks follows well-defined statistical patterns, characterized by exponentially decaying log-variations of the weight of social ties and of individuals' social strength. At the same time, we find that individuals have social signatures and communication strategies that are remarkably stable over the scale of several years.

A New Hybrid Scheme for Preventing Channel Interference and Collision in Mobile Networks

NASA Astrophysics Data System (ADS)

Kim, Kyungjun; Han, Kijun

This paper proposes a new hybrid scheme based on a given set of channels for preventing channel interference and collision in mobile networks. The proposed scheme is designed for improving system performance, focusing on enhancement of performance related to path breakage and channel interference. The objective of this scheme is to improve the performance of inter-node communication. Simulation results from this paper show that the new hybrid scheme can reduce a more control message overhead than a conventional random scheme.

H∞ control for uncertain linear system over networks with Bernoulli data dropout and actuator saturation.

PubMed

Yu, Jimin; Yang, Chenchen; Tang, Xiaoming; Wang, Ping

2018-03-01

This paper investigates the H ∞ control problems for uncertain linear system over networks with random communication data dropout and actuator saturation. The random data dropout process is modeled by a Bernoulli distributed white sequence with a known conditional probability distribution and the actuator saturation is confined in a convex hull by introducing a group of auxiliary matrices. By constructing a quadratic Lyapunov function, effective conditions for the state feedback-based H ∞ controller and the observer-based H ∞ controller are proposed in the form of non-convex matrix inequalities to take the random data dropout and actuator saturation into consideration simultaneously, and the problem of non-convex feasibility is solved by applying cone complementarity linearization (CCL) procedure. Finally, two simulation examples are given to demonstrate the effectiveness of the proposed new design techniques. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Fast state estimation subject to random data loss in discrete-time nonlinear stochastic systems

NASA Astrophysics Data System (ADS)

Mahdi Alavi, S. M.; Saif, Mehrdad

2013-12-01

This paper focuses on the design of the standard observer in discrete-time nonlinear stochastic systems subject to random data loss. By the assumption that the system response is incrementally bounded, two sufficient conditions are subsequently derived that guarantee exponential mean-square stability and fast convergence of the estimation error for the problem at hand. An efficient algorithm is also presented to obtain the observer gain. Finally, the proposed methodology is employed for monitoring the Continuous Stirred Tank Reactor (CSTR) via a wireless communication network. The effectiveness of the designed observer is extensively assessed by using an experimental tested-bed that has been fabricated for performance evaluation of the over wireless-network estimation techniques under realistic radio channel conditions.

Workforce Improvement Network 2000 Survey of Virginia Employers.

ERIC Educational Resources Information Center

Foucar-Szocki, Diane; Bolt, Les

A stratified random sample of Virginia's 4,000 employers with over 100 employees was surveyed about workplace-based foundational basic skills (oral and written communication, reading, math, thinking skills, teamwork, English proficiency, and basic computer literacy). A total of 446 surveys were sent with a usable response rate of 18 percent.…

An Evaluation of Six Brief Interventions that Target Drug-Related Problems in Correctional Populations

ERIC Educational Resources Information Center

Joe, George W.; Knight, Kevin; Simpson, D. Dwayne; Flynn, Patrick M.; Morey, Janis T.; Bartholomew, Norma G.; Tindall, Michele Staton; Burdon, William M.; Hall, Elizabeth A.; Martin, Steve S.; O'Connell, Daniel J.

2012-01-01

Finding brief effective treatments for criminal justice populations is a major public need. The CJ-DATS Targeted Intervention for Corrections (TIC), which consists of six brief interventions (communication, anger, motivation, criminal thinking, social networks, and HIV/sexual health), was tested in separate federally-funded randomized control…

An improved label propagation algorithm based on node importance and random walk for community detection

NASA Astrophysics Data System (ADS)

Ma, Tianren; Xia, Zhengyou

2017-05-01

Currently, with the rapid development of information technology, the electronic media for social communication is becoming more and more popular. Discovery of communities is a very effective way to understand the properties of complex networks. However, traditional community detection algorithms consider the structural characteristics of a social organization only, with more information about nodes and edges wasted. In the meanwhile, these algorithms do not consider each node on its merits. Label propagation algorithm (LPA) is a near linear time algorithm which aims to find the community in the network. It attracts many scholars owing to its high efficiency. In recent years, there are more improved algorithms that were put forward based on LPA. In this paper, an improved LPA based on random walk and node importance (NILPA) is proposed. Firstly, a list of node importance is obtained through calculation. The nodes in the network are sorted in descending order of importance. On the basis of random walk, a matrix is constructed to measure the similarity of nodes and it avoids the random choice in the LPA. Secondly, a new metric IAS (importance and similarity) is calculated by node importance and similarity matrix, which we can use to avoid the random selection in the original LPA and improve the algorithm stability. Finally, a test in real-world and synthetic networks is given. The result shows that this algorithm has better performance than existing methods in finding community structure.

Ambient awareness: From random noise to digital closeness in online social networks

PubMed Central

Levordashka, Ana; Utz, Sonja

2016-01-01

Ambient awareness refers to the awareness social media users develop of their online network in result of being constantly exposed to social information, such as microblogging updates. Although each individual bit of information can seem like random noise, their incessant reception can amass to a coherent representation of social others. Despite its growing popularity and important implications for social media research, ambient awareness on public social media has not been studied empirically. We provide evidence for the occurrence of ambient awareness and examine key questions related to its content and functions. A diverse sample of participants reported experiencing awareness, both as a general feeling towards their network as a whole, and as knowledge of individual members of the network, whom they had not met in real life. Our results indicate that ambient awareness can develop peripherally, from fragmented information and in the relative absence of extensive one-to-one communication. We report the effects of demographics, media use, and network variables and discuss the implications of ambient awareness for relational and informational processes online. PMID:27375343

Ambient awareness: From random noise to digital closeness in online social networks.

PubMed

Levordashka, Ana; Utz, Sonja

2016-07-01

Ambient awareness refers to the awareness social media users develop of their online network in result of being constantly exposed to social information, such as microblogging updates. Although each individual bit of information can seem like random noise, their incessant reception can amass to a coherent representation of social others. Despite its growing popularity and important implications for social media research, ambient awareness on public social media has not been studied empirically. We provide evidence for the occurrence of ambient awareness and examine key questions related to its content and functions. A diverse sample of participants reported experiencing awareness, both as a general feeling towards their network as a whole, and as knowledge of individual members of the network, whom they had not met in real life. Our results indicate that ambient awareness can develop peripherally, from fragmented information and in the relative absence of extensive one-to-one communication. We report the effects of demographics, media use, and network variables and discuss the implications of ambient awareness for relational and informational processes online.

The network impact of hijacking a quantum repeater

NASA Astrophysics Data System (ADS)

Satoh, Takahiko; Nagayama, Shota; Oka, Takafumi; Van Meter, Rodney

2018-07-01

In quantum networking, repeater hijacking menaces the security and utility of quantum applications. To deal with this problem, it is important to take a measure of the impact of quantum repeater hijacking. First, we quantify the work of each quantum repeater with regards to each quantum communication. Based on this, we show the costs for repeater hijacking detection using distributed quantum state tomography and the amount of work loss and rerouting penalties caused by hijacking. This quantitative evaluation covers both purification-entanglement swapping and quantum error correction repeater networks. Naive implementation of the checks necessary for correct network operation can be subverted by a single hijacker to bring down an entire network. Fortunately, the simple fix of randomly assigned testing can prevent such an attack.

Spatiotemporal Dynamics of a Network of Coupled Time-Delay Digital Tanlock Loops

NASA Astrophysics Data System (ADS)

Paul, Bishwajit; Banerjee, Tanmoy; Sarkar, B. C.

The time-delay digital tanlock loop (TDTLs) is an important class of phase-locked loop that is widely used in electronic communication systems. Although nonlinear dynamics of an isolated TDTL has been studied in the past but the collective behavior of TDTLs in a network is an important topic of research and deserves special attention as in practical communication systems separate entities are rarely isolated. In this paper, we carry out the detailed analysis and numerical simulations to explore the spatiotemporal dynamics of a network of a one-dimensional ring of coupled TDTLs with nearest neighbor coupling. The equation representing the network is derived and we carry out analytical calculations using the circulant matrix formalism to obtain the stability criteria. An extensive numerical simulation reveals that with the variation of gain parameter and coupling strength the network shows a variety of spatiotemporal dynamics such as frozen random pattern, pattern selection, spatiotemporal intermittency and fully developed spatiotemporal chaos. We map the distinct dynamical regions of the system in two-parameter space. Finally, we quantify the spatiotemporal dynamics by using quantitative measures like Lyapunov exponent and the average quadratic deviation of the full network.

SHER: A Colored Petri Net Based Random Mobility Model for Wireless Communications

PubMed Central

Khan, Naeem Akhtar; Ahmad, Farooq; Khan, Sher Afzal

2015-01-01

In wireless network research, simulation is the most imperative technique to investigate the network’s behavior and validation. Wireless networks typically consist of mobile hosts; therefore, the degree of validation is influenced by the underlying mobility model, and synthetic models are implemented in simulators because real life traces are not widely available. In wireless communications, mobility is an integral part while the key role of a mobility model is to mimic the real life traveling patterns to study. The performance of routing protocols and mobility management strategies e.g. paging, registration and handoff is highly dependent to the selected mobility model. In this paper, we devise and evaluate the Show Home and Exclusive Regions (SHER), a novel two-dimensional (2-D) Colored Petri net (CPN) based formal random mobility model, which exhibits sociological behavior of a user. The model captures hotspots where a user frequently visits and spends time. Our solution eliminates six key issues of the random mobility models, i.e., sudden stops, memoryless movements, border effect, temporal dependency of velocity, pause time dependency, and speed decay in a single model. The proposed model is able to predict the future location of a mobile user and ultimately improves the performance of wireless communication networks. The model follows a uniform nodal distribution and is a mini simulator, which exhibits interesting mobility patterns. The model is also helpful to those who are not familiar with the formal modeling, and users can extract meaningful information with a single mouse-click. It is noteworthy that capturing dynamic mobility patterns through CPN is the most challenging and virulent activity of the presented research. Statistical and reachability analysis techniques are presented to elucidate and validate the performance of our proposed mobility model. The state space methods allow us to algorithmically derive the system behavior and rectify the errors of our proposed model. PMID:26267860

Mandala Networks: ultra-small-world and highly sparse graphs

PubMed Central

Sampaio Filho, Cesar I. N.; Moreira, André A.; Andrade, Roberto F. S.; Herrmann, Hans J.; Andrade, José S.

2015-01-01

The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are robust against random failures. Furthermore, as the size of the network increases, its shortest path becomes asymptotically invariant and the density of links goes to zero, making it ultra-small world and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically. Finally, we show that some simple changes on the original network formulation can lead to an improved topology against malicious attacks. PMID:25765450

Design of robust reliable control for T-S fuzzy Markovian jumping delayed neutral type neural networks with probabilistic actuator faults and leakage delays: An event-triggered communication scheme.

PubMed

Syed Ali, M; Vadivel, R; Saravanakumar, R

2018-06-01

This study examines the problem of robust reliable control for Takagi-Sugeno (T-S) fuzzy Markovian jumping delayed neural networks with probabilistic actuator faults and leakage terms. An event-triggered communication scheme. First, the randomly occurring actuator faults and their failures rates are governed by two sets of unrelated random variables satisfying certain probabilistic failures of every actuator, new type of distribution based event triggered fault model is proposed, which utilize the effect of transmission delay. Second, Takagi-Sugeno (T-S) fuzzy model is adopted for the neural networks and the randomness of actuators failures is modeled in a Markov jump model framework. Third, to guarantee the considered closed-loop system is exponential mean square stable with a prescribed reliable control performance, a Markov jump event-triggered scheme is designed in this paper, which is the main purpose of our study. Fourth, by constructing appropriate Lyapunov-Krasovskii functional, employing Newton-Leibniz formulation and integral inequalities, several delay-dependent criteria for the solvability of the addressed problem are derived. The obtained stability criteria are stated in terms of linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. Finally, numerical examples are given to illustrate the effectiveness and reduced conservatism of the proposed results over the existing ones, among them one example was supported by real-life application of the benchmark problem. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Competition in collaborative clothing: a qualitative case study of influences on collaborative quality improvement in the ICU.

PubMed

Dainty, Katie N; Scales, Damon C; Sinuff, Tasnim; Zwarenstein, Merrick

2013-04-01

Multiorganisational quality improvement (QI) collaborative networks are promoted for improving quality within healthcare. Recently, several large-scale QI initiatives have been conducted in the intensive care unit (ICU) environment with successful quantitative results. However, the mechanisms through which such networks lead to QI success remain uncertain. We aim to understand ICU staff perspectives on collaborative QI based on involvement in a multiorganisational improvement network and hypothesise about theoretical constructs that might explain the effect of collaboration in such networks. Qualitative study using a modified grounded theory approach. Key informant interviews were conducted with staff from 12 community hospital ICUs that participated in a cluster randomized control trial (RCT) of a QI intervention using a collaborative approach between 2006 and 2008. Data analysis followed the standard procedure for grounded theory using constant comparative methodology. The collaborative network was perceived to promote increased intrateam cooperation over interorganisational cooperation, but friendly competition with other ICUs appeared to be a prominent driver of behaviour change. Bedsides, clinicians reported that belonging to a collaborative network provided recognition for the high-quality patient care that they already provided. However, the existing communication structure was perceived to be ineffective for staff engagement since it was based on a hierarchical approach to knowledge transfer and project awareness. QI collaborative networks may promote behaviour change by improving intrateam communication, fostering competition with other institutions, and increasing recognition for providing high-quality care. Other commonly held assumptions about their potential impact, for instance, increasing interorganisational legitimisation, communication and collaboration, may be less important.

Simultaneous classical communication and quantum key distribution using continuous variables

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

Qi, Bing

Currently, classical optical communication systems employing strong laser pulses and quantum key distribution (QKD) systems working at single-photon levels are very different communication modalities. Dedicated devices are commonly required to implement QKD. In this paper, we propose a scheme which allows classical communication and QKD to be implemented simultaneously using the same communication infrastructure. More specially, we propose a coherent communication scheme where both the bits for classical communication and the Gaussian distributed random numbers for QKD are encoded on the same weak coherent pulse and decoded by the same coherent receiver. Simulation results based on practical system parameters showmore » that both deterministic classical communication with a bit error rate of 10 –9 and secure key distribution could be achieved over tens of kilometers of single-mode fibers. It is conceivable that in the future coherent optical communication network, QKD will be operated in the background of classical communication at a minimal cost.« less

Simultaneous classical communication and quantum key distribution using continuous variables

DOE PAGES

Qi, Bing

2016-10-26

Currently, classical optical communication systems employing strong laser pulses and quantum key distribution (QKD) systems working at single-photon levels are very different communication modalities. Dedicated devices are commonly required to implement QKD. In this paper, we propose a scheme which allows classical communication and QKD to be implemented simultaneously using the same communication infrastructure. More specially, we propose a coherent communication scheme where both the bits for classical communication and the Gaussian distributed random numbers for QKD are encoded on the same weak coherent pulse and decoded by the same coherent receiver. Simulation results based on practical system parameters showmore » that both deterministic classical communication with a bit error rate of 10 –9 and secure key distribution could be achieved over tens of kilometers of single-mode fibers. It is conceivable that in the future coherent optical communication network, QKD will be operated in the background of classical communication at a minimal cost.« less

Quantum cryptography and applications in the optical fiber network

NASA Astrophysics Data System (ADS)

Luo, Yuhui

2005-09-01

Quantum cryptography, as part of quantum information and communications, can provide absolute security for information transmission because it is established on the fundamental laws of quantum theory, such as the principle of uncertainty, No-cloning theorem and quantum entanglement. In this thesis research, a novel scheme to implement quantum key distribution based on multiphoton entanglement with a new protocol is proposed. Its advantages are: a larger information capacity can be obtained with a longer transmission distance and the detection of multiple photons is easier than that of a single photon. The security and attacks pertaining to such a system are also studied. Next, a quantum key distribution over wavelength division multiplexed (WDM) optical fiber networks is realized. Quantum key distribution in networks is a long-standing problem for practical applications. Here we combine quantum cryptography and WDM to solve this problem because WDM technology is universally deployed in the current and next generation fiber networks. The ultimate target is to deploy quantum key distribution over commercial networks. The problems arising from the networks are also studied in this part. Then quantum key distribution in multi-access networks using wavelength routing technology is investigated in this research. For the first time, quantum cryptography for multiple individually targeted users has been successfully implemented in sharp contrast to that using the indiscriminating broadcasting structure. It overcomes the shortcoming that every user in the network can acquire the quantum key signals intended to be exchanged between only two users. Furthermore, a more efficient scheme of quantum key distribution is adopted, hence resulting in a higher key rate. Lastly, a quantum random number generator based on quantum optics has been experimentally demonstrated. This device is a key component for quantum key distribution as it can create truly random numbers, which is an essential requirement to perform quantum key distribution. This new generator is composed of a single optical fiber coupler with fiber pigtails, which can be easily used in optical fiber communications.

Modeling and dynamical topology properties of VANET based on complex networks theory

NASA Astrophysics Data System (ADS)

Zhang, Hong; Li, Jie

2015-01-01

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What's more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

Modeling and dynamical topology properties of VANET based on complex networks theory

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

Zhang, Hong; Li, Jie, E-mail: prof.li@foxmail.com

2015-01-15

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate andmore » control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.« less

Performance analysis of Aloha networks with power capture and near/far effect

NASA Astrophysics Data System (ADS)

McCartin, Joseph T.

1989-06-01

An analysis is presented for the throughput characteristics for several classes of Aloha packet networks. Specifically, the throughput for variable packet length Aloha utilizing multiple power levels to induce receiver capture is derived. The results are extended to an analysis of a selective-repeat ARQ Aloha network. Analytical results are presented which indicate a significant increase in throughput for a variable packet network implementing a random two power level capture scheme. Further research into the area of the near/far effect on Aloha networks is included. Improvements in throughput for mobile radio Aloha networks which are subject to the near/far effect are presented. Tactical Command, Control and Communications (C3) systems of the future will rely on Aloha ground mobile data networks. The incorporation of power capture and the near/far effect into future tactical networks will result in improved system analysis, design, and performance.

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

Gilson, M.; Kouvaris, N. E.; Deco, G.; Zamora-López, G.

2018-05-01

Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection.

An OFDM Receiver with Frequency Domain Diversity Combined Impulsive Noise Canceller for Underwater Network.

PubMed

Saotome, Rie; Hai, Tran Minh; Matsuda, Yasuto; Suzuki, Taisaku; Wada, Tomohisa

2015-01-01

In order to explore marine natural resources using remote robotic sensor or to enable rapid information exchange between ROV (remotely operated vehicles), AUV (autonomous underwater vehicle), divers, and ships, ultrasonic underwater communication systems are used. However, if the communication system is applied to rich living creature marine environment such as shallow sea, it suffers from generated Impulsive Noise so-called Shrimp Noise, which is randomly generated in time domain and seriously degrades communication performance in underwater acoustic network. With the purpose of supporting high performance underwater communication, a robust digital communication method for Impulsive Noise environments is necessary. In this paper, we propose OFDM ultrasonic communication system with diversity receiver. The main feature of the receiver is a newly proposed Frequency Domain Diversity Combined Impulsive Noise Canceller. The OFDM receiver utilizes 20-28 KHz ultrasonic channel and subcarrier spacing of 46.875 Hz (MODE3) and 93.750 Hz (MODE2) OFDM modulations. In addition, the paper shows Impulsive Noise distribution data measured at a fishing port in Okinawa and at a barge in Shizuoka prefectures and then proposed diversity OFDM transceivers architecture and experimental results are described. By the proposed Impulsive Noise Canceller, frame bit error rate has been decreased by 20-30%.

Interplay between Graph Topology and Correlations of Third Order in Spiking Neuronal Networks.

PubMed

Jovanović, Stojan; Rotter, Stefan

2016-06-01

The study of processes evolving on networks has recently become a very popular research field, not only because of the rich mathematical theory that underpins it, but also because of its many possible applications, a number of them in the field of biology. Indeed, molecular signaling pathways, gene regulation, predator-prey interactions and the communication between neurons in the brain can be seen as examples of networks with complex dynamics. The properties of such dynamics depend largely on the topology of the underlying network graph. In this work, we want to answer the following question: Knowing network connectivity, what can be said about the level of third-order correlations that will characterize the network dynamics? We consider a linear point process as a model for pulse-coded, or spiking activity in a neuronal network. Using recent results from theory of such processes, we study third-order correlations between spike trains in such a system and explain which features of the network graph (i.e. which topological motifs) are responsible for their emergence. Comparing two different models of network topology-random networks of Erdős-Rényi type and networks with highly interconnected hubs-we find that, in random networks, the average measure of third-order correlations does not depend on the local connectivity properties, but rather on global parameters, such as the connection probability. This, however, ceases to be the case in networks with a geometric out-degree distribution, where topological specificities have a strong impact on average correlations.

Collective iteration behavior for online social networks

NASA Astrophysics Data System (ADS)

Liu, Jian-Guo; Li, Ren-De; Guo, Qiang; Zhang, Yi-Cheng

2018-06-01

Understanding the patterns of collective behavior in online social network (OSNs) is critical to expanding the knowledge of human behavior and tie relationship. In this paper, we investigate a specific pattern called social signature in Facebook and Wiki users' online communication behaviors, capturing the distribution of frequency of interactions between different alters over time in the ego network. The empirical results show that there are robust social signatures of interactions no matter how friends change over time, which indicates that a stable commutation pattern exists in online communication. By comparing a random null model, we find the that commutation pattern is heterogeneous between ego and alters. Furthermore, in order to regenerate the pattern of the social signature, we present a preferential interaction model, which assumes that new users intend to look for the old users with strong ties while old users have tendency to interact with new friends. The experimental results show that the presented model can reproduce the heterogeneity of social signature by adjusting 2 parameters, the number of communicating targets m and the max number of interactions n, for Facebook users, m = n = 5, for Wiki users, m = 2 and n = 8. This work helps in deeply understanding the regularity of social signature.

Practical secure quantum communications

NASA Astrophysics Data System (ADS)

Diamanti, Eleni

2015-05-01

We review recent advances in the field of quantum cryptography, focusing in particular on practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping. The former allows two parties to share secret messages with information-theoretic security, even in the presence of a malicious eavesdropper in the communication channel, which is impossible with classical resources alone. The latter enables two distrustful parties to agree on a random bit, again with information-theoretic security, and with a cheating probability lower than the one that can be reached in a classical scenario. Our implementations rely on continuous-variable technology for quantum key distribution and on a plug and play discrete-variable system for coin flipping, and necessitate a rigorous security analysis adapted to the experimental schemes and their imperfections. In both cases, we demonstrate the protocols with provable security over record long distances in optical fibers and assess the performance of our systems as well as their limitations. The reported advances offer a powerful toolbox for practical applications of secure communications within future quantum networks.

A Graph Theory Practice on Transformed Image: A Random Image Steganography

PubMed Central

Thanikaiselvan, V.; Arulmozhivarman, P.; Subashanthini, S.; Amirtharajan, Rengarajan

2013-01-01

Modern day information age is enriched with the advanced network communication expertise but unfortunately at the same time encounters infinite security issues when dealing with secret and/or private information. The storage and transmission of the secret information become highly essential and have led to a deluge of research in this field. In this paper, an optimistic effort has been taken to combine graceful graph along with integer wavelet transform (IWT) to implement random image steganography for secure communication. The implementation part begins with the conversion of cover image into wavelet coefficients through IWT and is followed by embedding secret image in the randomly selected coefficients through graph theory. Finally stegoimage is obtained by applying inverse IWT. This method provides a maximum of 44 dB peak signal to noise ratio (PSNR) for 266646 bits. Thus, the proposed method gives high imperceptibility through high PSNR value and high embedding capacity in the cover image due to adaptive embedding scheme and high robustness against blind attack through graph theoretic random selection of coefficients. PMID:24453857

Improving Biometric-Based Authentication Schemes with Smart Card Revocation/Reissue for Wireless Sensor Networks.

PubMed

Moon, Jongho; Lee, Donghoon; Lee, Youngsook; Won, Dongho

2017-04-25

User authentication in wireless sensor networks is more difficult than in traditional networks owing to sensor network characteristics such as unreliable communication, limited resources, and unattended operation. For these reasons, various authentication schemes have been proposed to provide secure and efficient communication. In 2016, Park et al. proposed a secure biometric-based authentication scheme with smart card revocation/reissue for wireless sensor networks. However, we found that their scheme was still insecure against impersonation attack, and had a problem in the smart card revocation/reissue phase. In this paper, we show how an adversary can impersonate a legitimate user or sensor node, illegal smart card revocation/reissue and prove that Park et al.'s scheme fails to provide revocation/reissue. In addition, we propose an enhanced scheme that provides efficiency, as well as anonymity and security. Finally, we provide security and performance analysis between previous schemes and the proposed scheme, and provide formal analysis based on the random oracle model. The results prove that the proposed scheme can solve the weaknesses of impersonation attack and other security flaws in the security analysis section. Furthermore, performance analysis shows that the computational cost is lower than the previous scheme.

Improving Biometric-Based Authentication Schemes with Smart Card Revocation/Reissue for Wireless Sensor Networks

PubMed Central

Moon, Jongho; Lee, Donghoon; Lee, Youngsook; Won, Dongho

2017-01-01

User authentication in wireless sensor networks is more difficult than in traditional networks owing to sensor network characteristics such as unreliable communication, limited resources, and unattended operation. For these reasons, various authentication schemes have been proposed to provide secure and efficient communication. In 2016, Park et al. proposed a secure biometric-based authentication scheme with smart card revocation/reissue for wireless sensor networks. However, we found that their scheme was still insecure against impersonation attack, and had a problem in the smart card revocation/reissue phase. In this paper, we show how an adversary can impersonate a legitimate user or sensor node, illegal smart card revocation/reissue and prove that Park et al.’s scheme fails to provide revocation/reissue. In addition, we propose an enhanced scheme that provides efficiency, as well as anonymity and security. Finally, we provide security and performance analysis between previous schemes and the proposed scheme, and provide formal analysis based on the random oracle model. The results prove that the proposed scheme can solve the weaknesses of impersonation attack and other security flaws in the security analysis section. Furthermore, performance analysis shows that the computational cost is lower than the previous scheme. PMID:28441331

Information flow in a network of dispersed signalers-receivers

NASA Astrophysics Data System (ADS)

Halupka, Konrad

2017-11-01

I consider a stochastic model of multi-agent communication in regular network. The model describes how dispersed animals exchange information. Each agent can initiate and transfer the signal to its nearest neighbors, who may pass it farther. For an external observer of busy networks, signaling activity may appear random, even though information flow actually thrives. Only when signal initiation and transfer are at low levels do spatiotemporal autocorrelations emerge as clumping signaling activity in space and pink noise time series. Under such conditions, the costs of signaling are moderate, but the signaler can reach a large audience. I propose that real-world networks of dispersed signalers-receivers may self-organize into this state and the flow of information maintains their integrity.

Dynamic spectrum management: an impact on EW systems

NASA Astrophysics Data System (ADS)

Gajewski, P.; Łopatka, J.; Suchanski, M.

2017-04-01

Rapid evolution of wireless systems caused an enormous growth of data streams transmitted through the networks and, as a consequence, an accompanying demand concerning spectrum resources (SR). An avoidance of advisable disturbances is one of the main demands in military communications. To solve the interference problems, dynamic spectrum management (DSM) techniques can be used. Two main techniques are possible: centralized Coordinated Dynamic Spectrum Access (CDSA) and distributed Opportunistic Spectrum Access (OSA). CDSA enables the wireless networks planning automation, and systems dynamic reaction to random changes of Radio Environment (RE). For OSA, cognitive radio (CR) is the most promising technology that enables avoidance of interference with the other spectrum users due to CR's transmission parameters adaptation to the current radio situation, according to predefined Radio Policies rules. If DSM techniques are used, the inherent changes in EW systems are also needed. On one hand, new techniques of jamming should be elaborated, on the other hand, the rules and protocols of cooperation between communication network and EW systems should be developed.

Integrated Circuit Chip Improves Network Efficiency

NASA Technical Reports Server (NTRS)

2008-01-01

Prior to 1999 and the development of SpaceWire, a standard for high-speed links for computer networks managed by the European Space Agency (ESA), there was no high-speed communications protocol for flight electronics. Onboard computers, processing units, and other electronics had to be designed for individual projects and then redesigned for subsequent projects, which increased development periods, costs, and risks. After adopting the SpaceWire protocol in 2000, NASA implemented the standard on the Swift mission, a gamma ray burst-alert telescope launched in November 2004. Scientists and developers on the James Webb Space Telescope further developed the network version of SpaceWire. In essence, SpaceWire enables more science missions at a lower cost, because it provides a standard interface between flight electronics components; new systems need not be custom built to accommodate individual missions, so electronics can be reused. New protocols are helping to standardize higher layers of computer communication. Goddard Space Flight Center improved on the ESA-developed SpaceWire by enabling standard protocols, which included defining quality of service and supporting plug-and-play capabilities. Goddard upgraded SpaceWire to make the routers more efficient and reliable, with features including redundant cables, simultaneous discrete broadcast pulses, prevention of network blockage, and improved verification. Redundant cables simplify management because the user does not need to worry about which connection is available, and simultaneous broadcast signals allow multiple users to broadcast low-latency side-band signal pulses across the network using the same resources for data communication. Additional features have been added to the SpaceWire switch to prevent network blockage so that more robust networks can be designed. Goddard s verification environment for the link-and-switch implementation continuously randomizes and tests different parts, constantly anticipating situations, which helps improve communications reliability. It has been tested in many different implementations for compatibility.

A Lego Mindstorms NXT based test bench for multiagent exploratory systems and distributed network partitioning

NASA Astrophysics Data System (ADS)

Patil, Riya Raghuvir

Networks of communicating agents require distributed algorithms for a variety of tasks in the field of network analysis and control. For applications such as swarms of autonomous vehicles, ad hoc and wireless sensor networks, and such military and civilian applications as exploring and patrolling a robust autonomous system that uses a distributed algorithm for selfpartitioning can be significantly helpful. A single team of autonomous vehicles in a field may need to self-dissemble into multiple teams, conducive to completing multiple control tasks. Moreover, because communicating agents are subject to changes, namely, addition or failure of an agent or link, a distributed or decentralized algorithm is favorable over having a central agent. A framework to help with the study of self-partitioning of such multi agent systems that have most basic mobility model not only saves our time in conception but also gives us a cost effective prototype without negotiating the physical realization of the proposed idea. In this thesis I present my work on the implementation of a flexible and distributed stochastic partitioning algorithm on the LegoRTM Mindstorms' NXT on a graphical programming platform using National Instruments' LabVIEW(TM) forming a team of communicating agents via NXT-Bee radio module. We single out mobility, communication and self-partition as the core elements of the work. The goal is to randomly explore a precinct for reference sites. Agents who have discovered the reference sites announce their target acquisition to form a network formed based upon the distance of each agent with the other wherein the self-partitioning begins to find an optimal partition. Further, to illustrate the work, an experimental test-bench of five Lego NXT robots is presented.

Geographic Gossip: Efficient Averaging for Sensor Networks

NASA Astrophysics Data System (ADS)

Dimakis, Alexandros D. G.; Sarwate, Anand D.; Wainwright, Martin J.

Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of $n$ and $\\sqrt{n}$ respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy $\\epsilon$ using $O(\\frac{n^{1.5}}{\\sqrt{\\log n}} \\log \\epsilon^{-1})$ radio transmissions, which yields a $\\sqrt{\\frac{n}{\\log n}}$ factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields.

Army Communicator. Volume 34, Number 2

DTIC Science & Technology

2009-01-01

tunneled into the NIPRNet traffic. The encryption hides the contents of the SIPRNet data through a process that randomizes the bit patterns...and technologies such as desktop applications, Virtual Private Network, Blackberry support, and the training and troubleshoot- ing of complex computer...to your own Standing Operating Procedure and then contract for services off the backside to a local Strategic Entry Point or tunnel through

Channel Diversity in Random Wireless Networks

DTIC Science & Technology

2009-01-01

α, α)πR2 , (33) where K , LbwL 2π B (αL + 1/2, αL+ 1/2). (34) The maximum contention density is therefore proportional to ǫ1/L, as ǫ → 0. This...Digital Communications, 5th ed. Mc Graw Hill, 2008. [10] M. W. Subbarao and B . L. Hughes, “Optimal transmission ranges and code rates for frequency...

Network Randomization and Dynamic Defense for Critical Infrastructure Systems

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

Chavez, Adrian R.; Martin, Mitchell Tyler; Hamlet, Jason

2015-04-01

Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and developmentmore » to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.« less

Clustering and Beamforming for Efficient Communication in Wireless Sensor Networks

PubMed Central

Porcel-Rodríguez, Francisco; Valenzuela-Valdés, Juan; Padilla, Pablo; Luna-Valero, Francisco; Luque-Baena, Rafael; López-Gordo, Miguel Ángel

2016-01-01

Energy efficiency is a critical issue for wireless sensor networks (WSNs) as sensor nodes have limited power availability. In order to address this issue, this paper tries to maximize the power efficiency in WSNs by means of the evaluation of WSN node networks and their performance when both clustering and antenna beamforming techniques are applied. In this work, four different scenarios are defined, each one considering different numbers of sensors: 50, 20, 10, five, and two nodes per scenario, and each scenario is randomly generated thirty times in order to statistically validate the results. For each experiment, two different target directions for transmission are taken into consideration in the optimization process (φ = 0° and θ = 45°; φ = 45°, and θ = 45°). Each scenario is evaluated for two different types of antennas, an ideal isotropic antenna and a conventional dipole one. In this set of experiments two types of WSN are evaluated: in the first one, all of the sensors have the same amount of power for communications purposes; in the second one, each sensor has a different amount of power for its communications purposes. The analyzed cases in this document are focused on 2D surface and 3D space for the node location. To the authors’ knowledge, this is the first time that beamforming and clustering are simultaneously applied to increase the network lifetime in WSNs. PMID:27556463

Information and communications technology, culture, and medical universities; organizational culture and netiquette among academic staff.

PubMed

Yarmohammadian, Mohammad Hossein; Iravani, Hoorsana; Abzari, Mehdi

2012-01-01

Netiquette is appropriate behavioral etiquette when communicating through computer networks or virtual space. Identification of a dominant organizational culture and its relationship with a network culture offers applied guidelines to top managers of the university to expand communications and develop and learn organization through the use of the internet. The aim of this research was to examine the relationship between netiquette and organizational culture among faculty members of the Isfahan University of Medical Sciences (IUMS), Iran. To achieve this aim, the research method in this study was correlational research, which belonged to the category of descriptive survey research. The target population comprised of 594 faculty members of the IUMS, from which a sample of 150 was randomly selected, based on a simple stratified sampling method. For collecting the required data, two researcher-made questionnaires were formulated. Even as the first questionnaire tended to measure the selected sample members' organizational culture according to Rabbin's model (1999), the latter was designed in the Health Management and Economic Research Center (HMERC), to evaluate netiquette. The reliability of the questionnaires was computed by Choronbach's alpha coefficient formula and they happened to be 0.97 and 0.89, respectively. Ultimately, SPSS Version #15 was used for the statistical analysis of the data. The findings revealed that the organizational culture and netiquette were below average level among the sample members, signifying a considerable gap in the mean. In spite of that, there was no significant relationship between netiquette and the organizational culture of the faculty members. Emphasizing the importance of cultural preparation and a network user's training, this research suggests that the expansion of network culture rules among IUMS and organizational official communications, through the use of internet networks, in order to promote university netiquette and convenience in communication development, on the basis of special etiquette.

Information and communications technology, culture, and medical universities; organizational culture and netiquette among academic staff

PubMed Central

Yarmohammadian, Mohammad Hossein; Iravani, Hoorsana; Abzari, Mehdi

2012-01-01

Introduction: Netiquette is appropriate behavioral etiquette when communicating through computer networks or virtual space. Identification of a dominant organizational culture and its relationship with a network culture offers applied guidelines to top managers of the university to expand communications and develop and learn organization through the use of the internet. The aim of this research was to examine the relationship between netiquette and organizational culture among faculty members of the Isfahan University of Medical Sciences (IUMS), Iran. Materials and Methods: To achieve this aim, the research method in this study was correlational research, which belonged to the category of descriptive survey research. The target population comprised of 594 faculty members of the IUMS, from which a sample of 150 was randomly selected, based on a simple stratified sampling method. For collecting the required data, two researcher-made questionnaires were formulated. Even as the first questionnaire tended to measure the selected sample members’ organizational culture according to Rabbin's model (1999), the latter was designed in the Health Management and Economic Research Center (HMERC), to evaluate netiquette. The reliability of the questionnaires was computed by Choronbach's alpha coefficient formula and they happened to be 0.97 and 0.89, respectively. Ultimately, SPSS Version #15 was used for the statistical analysis of the data. Results: The findings revealed that the organizational culture and netiquette were below average level among the sample members, signifying a considerable gap in the mean. In spite of that, there was no significant relationship between netiquette and the organizational culture of the faculty members. Conclusion: Emphasizing the importance of cultural preparation and a network user's training, this research suggests that the expansion of network culture rules among IUMS and organizational official communications, through the use of internet networks, in order to promote university netiquette and convenience in communication development, on the basis of special etiquette. PMID:23555109

Localization Algorithm Based on a Spring Model (LASM) for Large Scale Wireless Sensor Networks.

PubMed

Chen, Wanming; Mei, Tao; Meng, Max Q-H; Liang, Huawei; Liu, Yumei; Li, Yangming; Li, Shuai

2008-03-15

A navigation method for a lunar rover based on large scale wireless sensornetworks is proposed. To obtain high navigation accuracy and large exploration area, highnode localization accuracy and large network scale are required. However, thecomputational and communication complexity and time consumption are greatly increasedwith the increase of the network scales. A localization algorithm based on a spring model(LASM) method is proposed to reduce the computational complexity, while maintainingthe localization accuracy in large scale sensor networks. The algorithm simulates thedynamics of physical spring system to estimate the positions of nodes. The sensor nodesare set as particles with masses and connected with neighbor nodes by virtual springs. Thevirtual springs will force the particles move to the original positions, the node positionscorrespondingly, from the randomly set positions. Therefore, a blind node position can bedetermined from the LASM algorithm by calculating the related forces with the neighbornodes. The computational and communication complexity are O(1) for each node, since thenumber of the neighbor nodes does not increase proportionally with the network scale size.Three patches are proposed to avoid local optimization, kick out bad nodes and deal withnode variation. Simulation results show that the computational and communicationcomplexity are almost constant despite of the increase of the network scale size. The time consumption has also been proven to remain almost constant since the calculation steps arealmost unrelated with the network scale size.

Patient-Centered Outcomes Research in Practice: The CAPriCORN Infrastructure.

PubMed

Solomonides, Anthony; Goel, Satyender; Hynes, Denise; Silverstein, Jonathan C; Hota, Bala; Trick, William; Angulo, Francisco; Price, Ron; Sadhu, Eugene; Zelisko, Susan; Fischer, James; Furner, Brian; Hamilton, Andrew; Phua, Jasmin; Brown, Wendy; Hohmann, Samuel F; Meltzer, David; Tarlov, Elizabeth; Weaver, Frances M; Zhang, Helen; Concannon, Thomas; Kho, Abel

2015-01-01

CAPriCORN, the Chicago Area Patient Centered Outcomes Research Network, is one of the eleven PCORI-funded Clinical Data Research Networks. A collaboration of six academic medical centers, a Chicago public hospital, two VA hospitals and a network of federally qualified health centers, CAPriCORN addresses the needs of a diverse community and overlapping populations. To capture complete medical records without compromising patient privacy and confidentiality, the network created policies and mechanisms for patient consultation, central IRB approval, de-identification, de-duplication, and integration of patient data by study cohort, randomization and sampling, re-identification for consent by providers and patients, and communication with patients to elicit patient-reported outcomes through validated instruments. The paper describes these policies and mechanisms and discusses two case studies to prove the feasibility and effectiveness of the network.

Role of Distance-Based Routing in Traffic Dynamics on Mobile Networks

NASA Astrophysics Data System (ADS)

Yang, Han-Xin; Wang, Wen-Xu

2013-06-01

Despite of intensive investigations on transportation dynamics taking place on complex networks with fixed structures, a deep understanding of networks consisting of mobile nodes is challenging yet, especially the lacking of insight into the effects of routing strategies on transmission efficiency. We introduce a distance-based routing strategy for networks of mobile agents toward enhancing the network throughput and the transmission efficiency. We study the transportation capacity and delivering time of data packets associated with mobility and communication ability. Interestingly, we find that the transportation capacity is optimized at moderate moving speed, which is quite different from random routing strategy. In addition, both continuous and discontinuous transitions from free flow to congestions are observed. Degree distributions are explored in order to explain the enhancement of network throughput and other observations. Our work is valuable toward understanding complex transportation dynamics and designing effective routing protocols.

Probabilistic Analysis of Hierarchical Cluster Protocols for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Kaj, Ingemar

Wireless sensor networks are designed to extract data from the deployment environment and combine sensing, data processing and wireless communication to provide useful information for the network users. Hundreds or thousands of small embedded units, which operate under low-energy supply and with limited access to central network control, rely on interconnecting protocols to coordinate data aggregation and transmission. Energy efficiency is crucial and it has been proposed that cluster based and distributed architectures such as LEACH are particularly suitable. We analyse the random cluster hierarchy in this protocol and provide a solution for low-energy and limited-loss optimization. Moreover, we extend these results to a multi-level version of LEACH, where clusters of nodes again self-organize to form clusters of clusters, and so on.

A network model of communication in an interprofessional team of healthcare professionals: A cross-sectional study of a burn unit.

PubMed

Shoham, David A; Harris, Jenine K; Mundt, Marlon; McGaghie, William

2016-09-01

Healthcare teams consist of individuals communicating with one another during patient care delivery. Coordination of multiple specialties is critical for patients with complex health conditions, and requires interprofessional and intraprofessional communication. We examined a communication network of 71 health professionals in four professional roles: physician, nurse, health management, and support personnel (dietitian, pharmacist, or social worker), or other health professionals (including physical, respiratory, and occupational therapists, and medical students) working in a burn unit. Data for this cross-sectional study were collected by surveying members of a healthcare team. Ties were defined by asking team members whom they discussed patient care matters with on the shift. We built an exponential random graph model to determine: (1) does professional role influence the likelihood of a tie; (2) are ties more likely between team members from different professions compared to between team members from the same profession; and (3) which professions are more likely to form interprofessional ties. Health management and support personnel ties were 94% interprofessional while ties among nurses were 60% interprofessional. Nurses and other health professionals were significantly less likely than physicians to form ties. Nurses were 1.64 times more likely to communicate with nurses than non-nurses (OR = 1.64, 95% CI: 1.01-2.66); there was no significant role homophily for physicians, other health professionals, or health management and support personnel. Understanding communication networks in healthcare teams is an early step in understanding how teams work together to provide care; future work should evaluate the types and quality of interactions between members of interprofessional healthcare teams.

The impact of patient and physician computer mediated communication skill training on reported communication and patient satisfaction.

PubMed

Roter, Debra L; Wexler, Randy; Naragon, Phyllis; Forrest, Brian; Dees, Jason; Almodovar, Astrid; Wood, Julie

2012-09-01

The objective was to evaluate parallel patient and physician computer-mediated communication skill training on participants' report of skill use and patient satisfaction. Separate patient and clinician web-tools comprised of over 500, 10-s video clips demonstrating patient-centered skills in various ways. Four clinician members of the American Academy of Family Physicians National Research Network participated by enrolling 194 patients into a randomized patient trial and 29 physicians into a non-randomized clinician trial of respective interventions. All participants completed baseline and follow-up self-report measures of visit communication and satisfaction. Intervention patients reported using more skills than controls in five of six skill areas, including identification of problems/concerns, information exchange, treatment adherence, shared decision-making and interpersonal rapport (all p<.05); post intervention, physicians reported using more skills in the same 5 areas (all p<.01). Intervention group patients reported higher levels of satisfaction than controls in five of six domains (all p<.05). Communication skill training delivered in a computer mediated format had a positive and parallel impact on both patient and clinician reported use of patient-centered communication and in patient satisfaction. Computer-mediated interventions are cost and time effective thereby increasing patient and clinician willingness to undertake training. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

The Study on the Communication Network of Wide Area Measurement System in Electricity Grid

NASA Astrophysics Data System (ADS)

Xiaorong, Cheng; Ying, Wang; Yangdan, Ni

Wide area measurement system(WAMS) is a fundamental part of security defense in Smart Grid, and the communication system of WAMS is an important part of Electric power communication network. For a large regional network is concerned, the real-time data which is transferred in the communication network of WAMS will affect the safe operation of the power grid directly. Therefore, WAMS raised higher requirements for real-time, reliability and security to its communication network. In this paper, the architecture of WASM communication network was studied according to the seven layers model of the open systems interconnection(OSI), and the network architecture was researched from all levels. We explored the media of WAMS communication network, the network communication protocol and network technology. Finally, the delay of the network were analyzed.

Multiple-Ring Digital Communication Network

NASA Technical Reports Server (NTRS)

Kirkham, Harold

1992-01-01

Optical-fiber digital communication network to support data-acquisition and control functions of electric-power-distribution networks. Optical-fiber links of communication network follow power-distribution routes. Since fiber crosses open power switches, communication network includes multiple interconnected loops with occasional spurs. At each intersection node is needed. Nodes of communication network include power-distribution substations and power-controlling units. In addition to serving data acquisition and control functions, each node acts as repeater, passing on messages to next node(s). Multiple-ring communication network operates on new AbNET protocol and features fiber-optic communication.

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.

Experimental integration of quantum key distribution and gigabit-capable passive optical network

NASA Astrophysics Data System (ADS)

Sun, Wei; Wang, Liu-Jun; Sun, Xiang-Xiang; Mao, Yingqiu; Yin, Hua-Lei; Wang, Bi-Xiao; Chen, Teng-Yun; Pan, Jian-Wei

2018-01-01

Quantum key distribution (QKD) ensures information-theoretic security for the distribution of random bits between two remote parties. To extend QKD applications to fiber-to-the-home optical communications, such as gigabit-capable passive optical networks (GPONs), an effective method is the use of wavelength-division multiplexing. However, the Raman scattering noise from intensive classical traffic and the huge loss introduced by the beam splitter in a GPON severely limits the performance of QKD. Here, we demonstrate the integration of QKD and a commercial GPON system with fiber lengths up to 14 km, in which the maximum splitting ratio of the beam splitter reaches 1:64. By placing the QKD transmitter on the optical line terminal side, we reduce the Raman noise collected at the QKD receiver. Using a bypass structure, the loss of the beam splitter is circumvented effectively. Our results pave the way to extending the applications of QKD to last-mile communications.

An Enhanced Privacy-Preserving Authentication Scheme for Vehicle Sensor Networks.

PubMed

Zhou, Yousheng; Zhao, Xiaofeng; Jiang, Yi; Shang, Fengjun; Deng, Shaojiang; Wang, Xiaojun

2017-12-08

Vehicle sensor networks (VSNs) are ushering in a promising future by enabling more intelligent transportation systems and providing a more efficient driving experience. However, because of their inherent openness, VSNs are subject to a large number of potential security threats. Although various authentication schemes have been proposed for addressing security problems, they are not suitable for VSN applications because of their high computation and communication costs. Chuang and Lee have developed a trust-extended authentication mechanism (TEAM) for vehicle-to-vehicle communication using a transitive trust relationship, which they claim can resist various attacks. However, it fails to counter internal attacks because of the utilization of a shared secret key. In this paper, to eliminate the vulnerability of TEAM, an enhanced privacy-preserving authentication scheme for VSNs is constructed. The security of our proposed scheme is proven under the random oracle model based on the assumption of the computational Diffie-Hellman problem.

An Enhanced Privacy-Preserving Authentication Scheme for Vehicle Sensor Networks

PubMed Central

Zhou, Yousheng; Zhao, Xiaofeng; Jiang, Yi; Shang, Fengjun; Deng, Shaojiang; Wang, Xiaojun

2017-01-01

Vehicle sensor networks (VSNs) are ushering in a promising future by enabling more intelligent transportation systems and providing a more efficient driving experience. However, because of their inherent openness, VSNs are subject to a large number of potential security threats. Although various authentication schemes have been proposed for addressing security problems, they are not suitable for VSN applications because of their high computation and communication costs. Chuang and Lee have developed a trust-extended authentication mechanism (TEAM) for vehicle-to-vehicle communication using a transitive trust relationship, which they claim can resist various attacks. However, it fails to counter internal attacks because of the utilization of a shared secret key. In this paper, to eliminate the vulnerability of TEAM, an enhanced privacy-preserving authentication scheme for VSNs is constructed. The security of our proposed scheme is proven under the random oracle model based on the assumption of the computational Diffie–Hellman problem. PMID:29292792

Patient-reported outcomes, patient-reported information: from randomized controlled trials to the social web and beyond.

PubMed

Baldwin, Mike; Spong, Andrew; Doward, Lynda; Gnanasakthy, Ari

2011-01-01

Internet communication is developing. Social networking sites enable patients to publish and receive communications very easily. Many stakeholders, including patients, are using these media to find new ways to make sense of diseases, to find and discuss treatments, and to give support to patients and their caregivers. We argue for a new definition of patient-reported information (PRI), which differs from the usual patient-reported outcomes (PRO). These new emergent data from the social web have important implications for decision making, at both an individual and a population level. We discuss new emergent technologies that will help aggregate this information and discuss how this will be assessed alongside the use of PROs in randomized controlled trials and how these new emergent data will be one facet of changing the relationship between the various stakeholders in achieving better co-created health.

GLOBECOM '89 - IEEE Global Telecommunications Conference and Exhibition, Dallas, TX, Nov. 27-30, 1989, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

The present conference discusses topics in multiwavelength network technology and its applications, advanced digital radio systems in their propagation environment, mobile radio communications, switching programmability, advancements in computer communications, integrated-network management and security, HDTV and image processing in communications, basic exchange communications radio advancements in digital switching, intelligent network evolution, speech coding for telecommunications, and multiple access communications. Also discussed are network designs for quality assurance, recent progress in coherent optical systems, digital radio applications, advanced communications technologies for mobile users, communication software for switching systems, AI and expert systems in network management, intelligent multiplexing nodes, video and image coding, network protocols and performance, system methods in quality and reliability, the design and simulation of lightwave systems, local radio networks, mobile satellite communications systems, fiber networks restoration, packet video networks, human interfaces for future networks, and lightwave networking.

Stability and performance of propulsion control systems with distributed control architectures and failures

NASA Astrophysics Data System (ADS)

Belapurkar, Rohit K.

Future aircraft engine control systems will be based on a distributed architecture, in which, the sensors and actuators will be connected to the Full Authority Digital Engine Control (FADEC) through an engine area network. Distributed engine control architecture will allow the implementation of advanced, active control techniques along with achieving weight reduction, improvement in performance and lower life cycle cost. The performance of a distributed engine control system is predominantly dependent on the performance of the communication network. Due to the serial data transmission policy, network-induced time delays and sampling jitter are introduced between the sensor/actuator nodes and the distributed FADEC. Communication network faults and transient node failures may result in data dropouts, which may not only degrade the control system performance but may even destabilize the engine control system. Three different architectures for a turbine engine control system based on a distributed framework are presented. A partially distributed control system for a turbo-shaft engine is designed based on ARINC 825 communication protocol. Stability conditions and control design methodology are developed for the proposed partially distributed turbo-shaft engine control system to guarantee the desired performance under the presence of network-induced time delay and random data loss due to transient sensor/actuator failures. A fault tolerant control design methodology is proposed to benefit from the availability of an additional system bandwidth and from the broadcast feature of the data network. It is shown that a reconfigurable fault tolerant control design can help to reduce the performance degradation in presence of node failures. A T-700 turbo-shaft engine model is used to validate the proposed control methodology based on both single input and multiple-input multiple-output control design techniques.

GLOBECOM '86 - Global Telecommunications Conference, Houston, TX, Dec. 1-4, 1986, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Papers are presented on local area networks; formal methods for communication protocols; computer simulation of communication systems; spread spectrum and coded communications; tropical radio propagation; VLSI for communications; strategies for increasing software productivity; multiple access communications; advanced communication satellite technologies; and spread spectrum systems. Topics discussed include Space Station communication and tracking development and design; transmission networks; modulation; data communications; computer network protocols and performance; and coding and synchronization. Consideration is given to free space optical communications systems; VSAT communication networks; network topology design; advances in adaptive filtering echo cancellation and adaptive equalization; advanced signal processing for satellite communications; the elements, design, and analysis of fiber-optic networks; and advances in digital microwave systems.

Crosstalk and the evolvability of intracellular communication.

PubMed

Rowland, Michael A; Greenbaum, Joseph M; Deeds, Eric J

2017-07-10

Metazoan signalling networks are complex, with extensive crosstalk between pathways. It is unclear what pressures drove the evolution of this architecture. We explore the hypothesis that crosstalk allows different cell types, each expressing a specific subset of signalling proteins, to activate different outputs when faced with the same inputs, responding differently to the same environment. We find that the pressure to generate diversity leads to the evolution of networks with extensive crosstalk. Using available data, we find that human tissues exhibit higher levels of diversity between cell types than networks with random expression patterns or networks with no crosstalk. We also find that crosstalk and differential expression can influence drug activity: no protein has the same impact on two tissues when inhibited. In addition to providing a possible explanation for the evolution of crosstalk, our work indicates that consideration of cellular context will likely be crucial for targeting signalling networks.

A Low Collision and High Throughput Data Collection Mechanism for Large-Scale Super Dense Wireless Sensor Networks.

PubMed

Lei, Chunyang; Bie, Hongxia; Fang, Gengfa; Gaura, Elena; Brusey, James; Zhang, Xuekun; Dutkiewicz, Eryk

2016-07-18

Super dense wireless sensor networks (WSNs) have become popular with the development of Internet of Things (IoT), Machine-to-Machine (M2M) communications and Vehicular-to-Vehicular (V2V) networks. While highly-dense wireless networks provide efficient and sustainable solutions to collect precise environmental information, a new channel access scheme is needed to solve the channel collision problem caused by the large number of competing nodes accessing the channel simultaneously. In this paper, we propose a space-time random access method based on a directional data transmission strategy, by which collisions in the wireless channel are significantly decreased and channel utility efficiency is greatly enhanced. Simulation results show that our proposed method can decrease the packet loss rate to less than 2 % in large scale WSNs and in comparison with other channel access schemes for WSNs, the average network throughput can be doubled.

Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

DOEpatents

Bhanot, Gyan V [Princeton, NJ; Chen, Dong [Croton-On-Hudson, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

2012-01-10

The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

DOEpatents

Bhanot, Gyan V [Princeton, NJ; Chen, Dong [Croton-On-Hudson, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

2008-01-01

The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

Research on key technology of space laser communication network

NASA Astrophysics Data System (ADS)

Chang, Chengwu; Huang, Huiming; Liu, Hongyang; Gao, Shenghua; Cheng, Liyu

2016-10-01

Since the 21st century, Spatial laser communication has made a breakthrough development. Europe, the United States, Japan and other space powers have carried out the test of spatial laser communication technology on-orbit, and put forward a series of plans. In 2011, China made the first technology demonstration of satellite-ground laser communication carried by HY-2 satellite. Nowadays, in order to improve the transmission rate of spatial network, the topic of spatial laser communication network is becoming a research hotspot at home and abroad. This thesis, from the basic problem of spatial laser communication network to solve, analyzes the main difference between spatial network and ground network, which draws forth the key technology of spatial laser communication backbone network, and systematically introduces our research on aggregation, addressing, architecture of spatial network. From the perspective of technology development status and trends, the thesis proposes the development route of spatial laser communication network in stages. So as to provide reference about the development of spatial laser communication network in China.

Impact of Beamforming on the Path Connectivity in Cognitive Radio Ad Hoc Networks

PubMed Central

Dung, Le The; Hieu, Tran Dinh; Choi, Seong-Gon; Kim, Byung-Seo; An, Beongku

2017-01-01

This paper investigates the impact of using directional antennas and beamforming schemes on the connectivity of cognitive radio ad hoc networks (CRAHNs). Specifically, considering that secondary users use two kinds of directional antennas, i.e., uniform linear array (ULA) and uniform circular array (UCA) antennas, and two different beamforming schemes, i.e., randomized beamforming and center-directed to communicate with each other, we study the connectivity of all combination pairs of directional antennas and beamforming schemes and compare their performances to those of omnidirectional antennas. The results obtained in this paper show that, compared with omnidirectional transmission, beamforming transmission only benefits the connectivity when the density of secondary user is moderate. Moreover, the combination of UCA and randomized beamforming scheme gives the highest path connectivity in all evaluating scenarios. Finally, the number of antenna elements and degree of path loss greatly affect path connectivity in CRAHNs. PMID:28346377

Online Distributed Learning Over Networks in RKH Spaces Using Random Fourier Features

NASA Astrophysics Data System (ADS)

Bouboulis, Pantelis; Chouvardas, Symeon; Theodoridis, Sergios

2018-04-01

We present a novel diffusion scheme for online kernel-based learning over networks. So far, a major drawback of any online learning algorithm, operating in a reproducing kernel Hilbert space (RKHS), is the need for updating a growing number of parameters as time iterations evolve. Besides complexity, this leads to an increased need of communication resources, in a distributed setting. In contrast, the proposed method approximates the solution as a fixed-size vector (of larger dimension than the input space) using Random Fourier Features. This paves the way to use standard linear combine-then-adapt techniques. To the best of our knowledge, this is the first time that a complete protocol for distributed online learning in RKHS is presented. Conditions for asymptotic convergence and boundness of the networkwise regret are also provided. The simulated tests illustrate the performance of the proposed scheme.

Expected antenna utilization and overload

NASA Technical Reports Server (NTRS)

Posner, Edward C.

1991-01-01

The trade-offs between the number of antennas at Deep Space Network (DSN) Deep-Space Communications Complex and the fraction of continuous coverage provided to a set of hypothetical spacecraft, assuming random placement of the space craft passes during the day. The trade-offs are fairly robust with respect to the randomness assumption. A sample result is that a three-antenna complex provides an average of 82.6 percent utilization of facilities and coverage of nine spacecraft that each have 8-hour passes, whereas perfect phasing of the passes would yield 100 percent utilization and coverage. One key point is that sometimes fewer than three spacecraft are visible, so an antenna is idle, while at other times, there aren't enough antennas, and some spacecraft do without service. This point of view may be useful in helping to size the network or to develop a normalization for a figure of merit of DSN coverage.

Wireless Augmented Reality Communication System

NASA Technical Reports Server (NTRS)

Agan, Martin (Inventor); Devereaux, Ann (Inventor); Jedrey, Thomas (Inventor)

2015-01-01

A portable unit is for video communication to select a user name in a user name network. A transceiver wirelessly accesses a communication network through a wireless connection to a general purpose node coupled to the communication network. A user interface can receive user input to log on to a user name network through the communication network. The user name network has a plurality of user names, at least one of the plurality of user names is associated with a remote portable unit, logged on to the user name network and available for video communication.

Wireless Augmented Reality Communication System

NASA Technical Reports Server (NTRS)

Jedrey, Thomas (Inventor); Agan, Martin (Inventor); Devereaux, Ann (Inventor)

2017-01-01

A portable unit is for video communication to select a user name in a user name network. A transceiver wirelessly accesses a communication network through a wireless connection to a general purpose node coupled to the communication network. A user interface can receive user input to log on to a user name network through the communication network. The user name network has a plurality of user names, at least one of the plurality of user names is associated with a remote portable unit, logged on to the user name network and available for video communication.

Coexistence: Threat to the Performance of Heterogeneous Network

NASA Astrophysics Data System (ADS)

Sharma, Neetu; Kaur, Amanpreet

2010-11-01

Wireless technology is gaining broad acceptance as users opt for the freedom that only wireless network can provide. Well-accepted wireless communication technologies generally operate in frequency bands that are shared among several users, often using different RF schemes. This is true in particular for WiFi, Bluetooth, and more recently ZigBee. These all three operate in the unlicensed 2.4 GHz band, also known as ISM band, which has been key to the development of a competitive and innovative market for wireless embedded devices. But, as with any resource held in common, it is crucial that those technologies coexist peacefully to allow each user of the band to fulfill its communication goals. This has led to an increase in wireless devices intended for use in IEEE 802.11 wireless local area networks (WLANs) and wireless personal area networks (WPANs), both of which support operation in the crowded 2.4-GHz industrial, scientific and medical (ISM) band. Despite efforts made by standardization bodies to ensure smooth coexistence it may occur that communication technologies transmitting for instance at very different power levels interfere with each other. In particular, it has been pointed out that ZigBee could potentially experience interference from WiFi traffic given that while both protocols can transmit on the same channel, WiFi transmissions usually occur at much higher power level. In this work, we considered a heterogeneous network and analyzed the impact of coexistence between IEEE 802.15.4 and IEEE 802.11b. To evaluate the performance of this network, measurement and simulation study are conducted and developed in the QualNet Network simulator, version 5.0.Model is analyzed for different placement models or topologies such as Random. Grid & Uniform. Performance is analyzed on the basis of characteristics such as throughput, average jitter and average end to end delay. Here, the impact of varying different antenna gain & shadowing model for this heterogeneous network is considered for the purpose of analysis.

Analysis of a large-scale weighted network of one-to-one human communication

NASA Astrophysics Data System (ADS)

Onnela, Jukka-Pekka; Saramäki, Jari; Hyvönen, Jörkki; Szabó, Gábor; Argollo de Menezes, M.; Kaski, Kimmo; Barabási, Albert-László; Kertész, János

2007-06-01

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

Towards a Quantum Memory assisted MDI-QKD node

NASA Astrophysics Data System (ADS)

Namazi, Mehdi; Vallone, Giuseppe; Jordaan, Bertus; Goham, Connor; Shahrokhshahi, Reihaneh; Villoresi, Paolo; Figueroa, Eden

2017-04-01

The creation of large quantum network that permits the communication of quantum states and the secure distribution of cryptographic keys requires multiple operational quantum memories. In this work we present our progress towards building a prototypical quantum network that performs the memory-assisted measurement device independent QKD protocol. Currently our network combines the quantum part of the BB84 protocol with room-temperature quantum memory operation, while still maintaining relevant quantum bit error rates for single-photon level operation. We will also discuss our efforts to use a network of two room temperature quantum memories, receiving, storing and transforming randomly polarized photons in order to realize Bell state measurements. The work was supported by the US-Navy Office of Naval Research, Grant Number N00141410801, the National Science Foundation, Grant Number PHY-1404398 and the Simons Foundation, Grant Number SBF241180.

Wireless Network Security Using Randomness

DTIC Science & Technology

2012-06-19

370/412 6/2007 Soliman .......................... 380/44 9/2004 Miyake et al ................. 7041201 6/2006 Mauro...8,204,224 B2 Jun .19,2012 (45) Date of Patent: UfHER PUBLICATIONS Shannon, C.E., "Communication Theory of Secrecy Systems," Bell System Technical...MA, Jun . 27, 2001, 14 pages. "Hamming code," Wikipedia page, available at http://en.wikipedia. org!wiki!Hamming_code, printed Sep. 21,2010,7 pages

From Foucault to Freire Through Facebook: Toward an Integrated Theory of mHealth.

PubMed

Bull, Sheana; Ezeanochie, Nnamdi

2016-08-01

To document the integration of social science theory in literature on mHealth (mobile health) and consider opportunities for integration of classic theory, health communication theory, and social networking to generate a relevant theory for mHealth program design. A secondary review of research syntheses and meta-analyses published between 2005 and 2014 related to mHealth, using the AMSTAR (A Measurement Tool to Assess Systematic Reviews) methodology for assessment of the quality of each review. High-quality articles from those reviews using a randomized controlled design and integrating social science theory in program design, implementation, or evaluation were reviewed. Results There were 1,749 articles among the 170 reviews with a high AMSTAR score (≥30). Only 13 were published from 2005 to 2014, used a randomized controlled design and made explicit mention of theory in any aspect of their mHealth program. All 13 included theoretical perspectives focused on psychological and/or psychosocial theories and constructs. Conclusions There is a very limited use of social science theory in mHealth despite demonstrated benefits in doing so. We propose an integrated theory of mHealth that incorporates classic theory, health communication theory, and social networking to guide development and evaluation of mHealth programs. © 2015 Society for Public Health Education.

Punctuated equilibrium dynamics in human communications

NASA Astrophysics Data System (ADS)

Peng, Dan; Han, Xiao-Pu; Wei, Zong-Wen; Wang, Bing-Hong

2015-10-01

A minimal model based on network incorporating individual interactions is proposed to study the non-Poisson statistical properties of human behavior: individuals in system interact with their neighbors, the probability of an individual acting correlates to its activity, and all the individuals involved in action will change their activities randomly. The model reproduces varieties of spatial-temporal patterns observed in empirical studies of human daily communications, providing insight into various human activities and embracing a range of realistic social interacting systems, particularly, intriguing bimodal phenomenon. This model bridges priority queueing theory and punctuated equilibrium dynamics, and our modeling and analysis is likely to shed light on non-Poisson phenomena in many complex systems.

Social networking technologies as an emerging tool for HIV prevention: a cluster randomized trial.

PubMed

Young, Sean D; Cumberland, William G; Lee, Sung-Jae; Jaganath, Devan; Szekeres, Greg; Coates, Thomas

2013-09-03

Social networking technologies are an emerging tool for HIV prevention. To determine whether social networking communities can increase HIV testing among African American and Latino men who have sex with men (MSM). Randomized, controlled trial with concealed allocation. (ClinicalTrials.gov: NCT01701206). Online. 112 MSM based in Los Angeles, more than 85% of whom were African American or Latino. Sixteen peer leaders were randomly assigned to deliver information about HIV or general health to participants via Facebook groups over 12 weeks. After participants accepted a request to join the group, participation was voluntary. Group participation and engagement were monitored. Participants could request a free, home-based HIV testing kit and completed questionnaires at baseline and 12-week follow-up. Participant acceptance of and engagement in the intervention and social network participation, rates of home-based HIV testing, and sexual risk behaviors. Almost 95% of intervention participants and 73% of control participants voluntarily communicated using the social platform. Twenty-five of 57 intervention participants (44%) requested home-based HIV testing kits compared with 11 of 55 control participants (20%) (difference, 24 percentage points [95% CI, 8 to 41 percentage points]). Nine of the 25 intervention participants (36%) who requested the test took it and mailed it back compared with 2 of the 11 control participants (18%) who requested the test. Retention at study follow-up was more than 93%. Only 2 Facebook communities were included for each group. Social networking communities are acceptable and effective tools to increase home-based HIV testing among at-risk populations. National Institute of Mental Health.

Alkali aluminosilicate melts and glasses: structuring at the middle range order of amorphous matter

NASA Astrophysics Data System (ADS)

Le Losq, C.; neuville, D. R.

2012-12-01

Rheological properties of silicate melts govern both magma ascension from the mantle to the surface of the earth and volcanological eruptions styles and behaviours. It is well known that several parameters impact strongly these properties, such as for instance the temperature, pressure, chemical composition and volatiles concentration, finally influencing eruptive behaviour of volcanoes. In this work, we will focus on the Na2O-K2O-Al2O3-SiO2 system, which is of a prime importance because it deals with a non-negligible part of natural melts, like for instance the Vesuvius (Italy) or Erebus (Antartica) magmas. In an oncoming paper in Chemical Geology (Le Losq and Neuville, 2012), we have communicated results of the study of mixing Na-K in tectosilicate melts containing a high concentration of silica (≥75mol%). In the present communication, we will enlarge this first point of view to tectosilicate melts presenting a lower silica concentration. We will first present our viscosity data, and then the Adam and Gibbs theory that allows theoretically modelling Na-K mixing in aluminosilicate melts by using the so-called "mixed alkali effect". On the basis of the rheological results, the Na-K mixing cannot be explained with the ideal "mixed alkali effect", which involves random exchange of Na-K cationic pairs. To go further and as rheological properties are directly linked with structural properties, we will present our first results obtained by Raman and NMR spectroscopy. These last ones provide important structural pieces of information on the polymerization state of glasses and melts, and also on the environment of tetrahedrally coordinated cations. Rheological and structural results all highlight that Na and K are not randomly distributed in aluminosilicate glasses and melts networks. Na melts present a network with some channels and a non-random distribution of Al and Si. K networks are different. They also present a non-random distribution of Al and Si, but in two sub-networks: one is rich in Si and fully polymerized, the other is richer in Al and K. The size of K+ ions combined to the charge-balancing needs of Al3+ ions determine this structuring of potassium melts. Mixing Na and K melts thus returns to mix two different networks: one composed of Na-Al-Si-O atoms and another of K-Al-Si-O atoms. This impact melts properties, inducing complicated and non-linear effects.

Disorder-induced localization of excitability in an array of coupled lasers

NASA Astrophysics Data System (ADS)

Lamperti, M.; Perego, A. M.

2017-10-01

We report on the localization of excitability induced by disorder in an array of coupled semiconductor lasers with a saturable absorber. Through numerical simulations we show that the exponential localization of excitable waves occurs if a certain critical amount of randomness is present in the coupling coefficients among the lasers. The results presented in this Rapid Communication demonstrate that disorder can induce localization in lattices of excitable nonlinear oscillators, and can be of interest in the study of photonics-based random networks, neuromorphic systems, and, by analogy, in biology, in particular, in the investigation of the collective dynamics of neuronal cell populations.

Mixed Effects Models for Resampled Network Statistics Improves Statistical Power to Find Differences in Multi-Subject Functional Connectivity

PubMed Central

Narayan, Manjari; Allen, Genevera I.

2016-01-01

Many complex brain disorders, such as autism spectrum disorders, exhibit a wide range of symptoms and disability. To understand how brain communication is impaired in such conditions, functional connectivity studies seek to understand individual differences in brain network structure in terms of covariates that measure symptom severity. In practice, however, functional connectivity is not observed but estimated from complex and noisy neural activity measurements. Imperfect subject network estimates can compromise subsequent efforts to detect covariate effects on network structure. We address this problem in the case of Gaussian graphical models of functional connectivity, by proposing novel two-level models that treat both subject level networks and population level covariate effects as unknown parameters. To account for imperfectly estimated subject level networks when fitting these models, we propose two related approaches—R2 based on resampling and random effects test statistics, and R3 that additionally employs random adaptive penalization. Simulation studies using realistic graph structures reveal that R2 and R3 have superior statistical power to detect covariate effects compared to existing approaches, particularly when the number of within subject observations is comparable to the size of subject networks. Using our novel models and methods to study parts of the ABIDE dataset, we find evidence of hypoconnectivity associated with symptom severity in autism spectrum disorders, in frontoparietal and limbic systems as well as in anterior and posterior cingulate cortices. PMID:27147940

Throughput Analysis on 3-Dimensional Underwater Acoustic Network with One-Hop Mobile Relay.

PubMed

Zhong, Xuefeng; Chen, Fangjiong; Fan, Jiasheng; Guan, Quansheng; Ji, Fei; Yu, Hua

2018-01-16

Underwater acoustic communication network (UACN) has been considered as an essential infrastructure for ocean exploitation. Performance analysis of UACN is important in underwater acoustic network deployment and management. In this paper, we analyze the network throughput of three-dimensional randomly deployed transmitter-receiver pairs. Due to the long delay of acoustic channels, complicated networking protocols with heavy signaling overhead may not be appropriate. In this paper, we consider only one-hop or two-hop transmission, to save the signaling cost. That is, we assume the transmitter sends the data packet to the receiver by one-hop direct transmission, or by two-hop transmission via mobile relays. We derive the closed-form formulation of packet delivery rate with respect to the transmission delay and the number of transmitter-receiver pairs. The correctness of the derivation results are verified by computer simulations. Our analysis indicates how to obtain a precise tradeoff between the delay constraint and the network capacity.

Throughput Analysis on 3-Dimensional Underwater Acoustic Network with One-Hop Mobile Relay

PubMed Central

Zhong, Xuefeng; Fan, Jiasheng; Guan, Quansheng; Ji, Fei; Yu, Hua

2018-01-01

Underwater acoustic communication network (UACN) has been considered as an essential infrastructure for ocean exploitation. Performance analysis of UACN is important in underwater acoustic network deployment and management. In this paper, we analyze the network throughput of three-dimensional randomly deployed transmitter–receiver pairs. Due to the long delay of acoustic channels, complicated networking protocols with heavy signaling overhead may not be appropriate. In this paper, we consider only one-hop or two-hop transmission, to save the signaling cost. That is, we assume the transmitter sends the data packet to the receiver by one-hop direct transmission, or by two-hop transmission via mobile relays. We derive the closed-form formulation of packet delivery rate with respect to the transmission delay and the number of transmitter–receiver pairs. The correctness of the derivation results are verified by computer simulations. Our analysis indicates how to obtain a precise tradeoff between the delay constraint and the network capacity. PMID:29337911

ICC '86; Proceedings of the International Conference on Communications, Toronto, Canada, June 22-25, 1986, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Papers are presented on ISDN, mobile radio systems and techniques for digital connectivity, centralized and distributed algorithms in computer networks, communications networks, quality assurance and impact on cost, adaptive filters in communications, the spread spectrum, signal processing, video communication techniques, and digital satellite services. Topics discussed include performance evaluation issues for integrated protocols, packet network operations, the computer network theory and multiple-access, microwave single sideband systems, switching architectures, fiber optic systems, wireless local communications, modulation, coding, and synchronization, remote switching, software quality, transmission, and expert systems in network operations. Consideration is given to wide area networks, image and speech processing, office communications application protocols, multimedia systems, customer-controlled network operations, digital radio systems, channel modeling and signal processing in digital communications, earth station/on-board modems, computer communications system performance evaluation, source encoding, compression, and quantization, and adaptive communications systems.

Home-based family intervention increases knowledge, communication and living donation rates: a randomized controlled trial.

PubMed

Ismail, S Y; Luchtenburg, A E; Timman, R; Zuidema, W C; Boonstra, C; Weimar, W; Busschbach, J J V; Massey, E K

2014-08-01

Our aim was to develop and test an educational program to support well-informed decision making among patients and their social network regarding living donor kidney transplantation (LDKT). One hundred sixty-three patients who were unable to find a living donor were randomized to standard care or standard care plus home-based education. In the education condition, patients and members of their social network participated in home-based educational meetings and discussed renal replacement therapy options. Patients and invitees completed pre-post self-report questionnaires measuring knowledge, risk perception, communication, self-efficacy and subjective norm. LDKT activities were observed for 6 months postintervention. Patients in the experimental group showed significantly more improvements in knowledge (p < 0.001) and communication (p = 0.012) compared with the control group. The invitees showed pre-post increases in knowledge (p < 0.001), attitude toward discussing renal replacement therapies (p = 0.020), attitude toward donating a kidney (p = 0.023) and willingness to donate a kidney (p = 0.039) and a decrease in risk perception (p = 0.003). Finally, there were significantly more inquiries (29/39 vs. 13/41, p < 0.001), evaluations (25/39 vs. 7/41, p < 0.001) and actual LDKTs (17/39 vs. 4/41, p = 0.003) in the experimental group compared with the control group. Home-based family education supports well-informed decision making and promotes access to LDKT. © Copyright 2014 The American Society of Transplantation and the American Society of Transplant Surgeons.

Research of the self-healing technologies in the optical communication network of distribution automation

NASA Astrophysics Data System (ADS)

Wang, Hao; Zhong, Guoxin

2018-03-01

Optical communication network is the mainstream technique of the communication networks for distribution automation, and self-healing technologies can improve the in reliability of the optical communication networks significantly. This paper discussed the technical characteristics and application scenarios of several network self-healing technologies in the access layer, the backbone layer and the core layer of the optical communication networks for distribution automation. On the base of the contrastive analysis, this paper gives an application suggestion of these self-healing technologies.

On the extensive unification of digital-to-analog converters and kernels

NASA Astrophysics Data System (ADS)

Liao, Yanchu

2012-09-01

System administrators agree that scalable communication is an interesting new topic in the field of steganography, and leading analysts concur. After years of unfortunate re-search into context-free grammar, we argue the intuitive unification of fiber-optic cables and context-free grammar. Our focus here is not on whether sensor networks and randomized algorithms can collaborate to accomplish this aim, but rather on introducing an analysis of DHTs [2] (Soupy Coil).

Collaborative emitter tracking using Rao-Blackwellized random exchange diffusion particle filtering

NASA Astrophysics Data System (ADS)

Bruno, Marcelo G. S.; Dias, Stiven S.

2014-12-01

We introduce in this paper the fully distributed, random exchange diffusion particle filter (ReDif-PF) to track a moving emitter using multiple received signal strength (RSS) sensors. We consider scenarios with both known and unknown sensor model parameters. In the unknown parameter case, a Rao-Blackwellized (RB) version of the random exchange diffusion particle filter, referred to as the RB ReDif-PF, is introduced. In a simulated scenario with a partially connected network, the proposed ReDif-PF outperformed a PF tracker that assimilates local neighboring measurements only and also outperformed a linearized random exchange distributed extended Kalman filter (ReDif-EKF). Furthermore, the novel ReDif-PF matched the tracking error performance of alternative suboptimal distributed PFs based respectively on iterative Markov chain move steps and selective average gossiping with an inter-node communication cost that is roughly two orders of magnitude lower than the corresponding cost for the Markov chain and selective gossip filters. Compared to a broadcast-based filter which exactly mimics the optimal centralized tracker or its equivalent (exact) consensus-based implementations, ReDif-PF showed a degradation in steady-state error performance. However, compared to the optimal consensus-based trackers, ReDif-PF is better suited for real-time applications since it does not require iterative inter-node communication between measurement arrivals.

From the physics of interacting polymers to optimizing routes on the London Underground

PubMed Central

Yeung, Chi Ho; Saad, David; Wong, K. Y. Michael

2013-01-01

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise. PMID:23898198

From the physics of interacting polymers to optimizing routes on the London Underground.

PubMed

Yeung, Chi Ho; Saad, David; Wong, K Y Michael

2013-08-20

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.

Anchor Node Localization for Wireless Sensor Networks Using Video and Compass Information Fusion

PubMed Central

Pescaru, Dan; Curiac, Daniel-Ioan

2014-01-01

Distributed sensing, computing and communication capabilities of wireless sensor networks require, in most situations, an efficient node localization procedure. In the case of random deployments in harsh or hostile environments, a general localization process within global coordinates is based on a set of anchor nodes able to determine their own position using GPS receivers. In this paper we propose another anchor node localization technique that can be used when GPS devices cannot accomplish their mission or are considered to be too expensive. This novel technique is based on the fusion of video and compass data acquired by the anchor nodes and is especially suitable for video- or multimedia-based wireless sensor networks. For these types of wireless networks the presence of video cameras is intrinsic, while the presence of digital compasses is also required for identifying the cameras' orientations. PMID:24594614

Self Healing Percolation

NASA Astrophysics Data System (ADS)

Scala, Antonio

2015-03-01

We introduce the concept of self-healing in the field of complex networks modelling; in particular, self-healing capabilities are implemented through distributed communication protocols that exploit redundant links to recover the connectivity of the system. Self-healing is a crucial in implementing the next generation of smart grids allowing to ensure a high quality of service to the users. We then map our self-healing procedure in a percolation problem and analyse the interplay between redundancies and topology in improving the resilience of networked infrastructures to multiple failures. We find exact results both for planar lattices and for random lattices, hinting the role of duality in the design of resilient networks. Finally, we introduce a cavity method approach to study the recovery of connectivity after damage in self-healing networks. CNR-PNR National Project ``Crisis-Lab,'' EU HOME/2013/CIPS/AG/4000005013 project CI2C and EU FET project MULTIPLEX nr.317532.

Modelling students' knowledge organisation: Genealogical conceptual networks

NASA Astrophysics Data System (ADS)

Koponen, Ismo T.; Nousiainen, Maija

2018-04-01

Learning scientific knowledge is largely based on understanding what are its key concepts and how they are related. The relational structure of concepts also affects how concepts are introduced in teaching scientific knowledge. We model here how students organise their knowledge when they represent their understanding of how physics concepts are related. The model is based on assumptions that students use simple basic linking-motifs in introducing new concepts and mostly relate them to concepts that were introduced a few steps earlier, i.e. following a genealogical ordering. The resulting genealogical networks have relatively high local clustering coefficients of nodes but otherwise resemble networks obtained with an identical degree distribution of nodes but with random linking between them (i.e. the configuration-model). However, a few key nodes having a special structural role emerge and these nodes have a higher than average communicability betweenness centralities. These features agree with the empirically found properties of students' concept networks.

Communication technology access, use, and preferences among primary care patients: from the Residency Research Network of Texas (RRNeT).

PubMed

Hill, Jason H; Burge, Sandra; Haring, Anna; Young, Richard A

2012-01-01

The digital revolution is changing the manner in which patients communicate with their health care providers, yet many patients still lack access to communication technology. We conducted this study to evaluate access to, use of, and preferences for using communication technology among a predominantly low-income patient population. We determined whether access, use, and preferences were associated with type of health insurance, sex, age, and ethnicity. In 2011, medical student researchers administered questionnaires to patients of randomly selected physicians within 9 primary care clinics in the Residency Research Network of Texas. Surveys addressed access to and use of cell phones and home computers and preferences for communicating with health care providers. In this sample of 533 patients (77% response rate), 448 (84%) owned a cell phone and 325 (62%) owned computers. Only 48% reported conducting Internet searches, sending and receiving E-mails, and looking up health information on the Internet. Older individuals, those in government sponsored insurance programs, and individuals from racial/ethnic minority groups had the lowest levels of technology adoption. In addition, more than 60% of patients preferred not to send and receive health information over the Internet, by instant messaging, or by text messaging. Many patients in this sample did not seek health information electronically nor did they want to communicate electronically with their physicians. This finding raises concerns about the vision of the patient-centered medical home to enhance the doctor-patient relationship through communication technology. Our patients represent some of the more vulnerable populations in the United States and, as such, deserve attention from health care policymakers who are promoting widespread use of communication technology.

On Searching Available Channels with Asynchronous MAC-Layer Spectrum Sensing

NASA Astrophysics Data System (ADS)

Jiang, Chunxiao; Ma, Xin; Chen, Canfeng; Ma, Jian; Ren, Yong

Dynamic spectrum access has become a focal issue recently, in which identifying the available spectrum plays a rather important role. Lots of work has been done concerning secondary user (SU) synchronously accessing primary user's (PU's) network. However, on one hand, SU may have no idea about PU's communication protocols; on the other, it is possible that communications among PU are not based on synchronous scheme at all. In order to address such problems, this paper advances a strategy for SU to search available spectrums with asynchronous MAC-layer sensing. With this method, SUs need not know the communication mechanisms in PU's network when dynamically accessing. We will focus on four aspects: 1) strategy for searching available channels; 2) vacating strategy when PUs come back; 3) estimation of channel parameters; 4) impact of SUs' interference on PU's data rate. The simulations show that our search strategy not only can achieve nearly 50% less interference probability than equal allocation of total search time, but also well adapts to time-varying channels. Moreover, access by our strategies can attain 150% more access time than random access. The moment matching estimator shows good performance in estimating and tracing time-varying channels.

Interpersonal Influence Among Public Health Leaders in the United States Department of Health and Human Services

PubMed Central

Harris, Jenine K.; Carothers, Bobbi J.; Wald, Lana M.; Shelton, Sarah C.; Leischow, Scott J.

2012-01-01

Background In public health, interpersonal influence has been identified as an important factor in the spread of health information, and in understanding and changing health behaviors. However, little is known about influence in public health leadership. Influence is important in leadership settings, where public health professionals contribute to national policy and practice agendas. Drawing on social theory and recent advances in statistical network modeling, we examined influence in a network of tobacco control leaders at the United States Department of Health and Human Services (DHHS). Design and Methods Fifty-four tobacco control leaders across all 11 agencies in the DHHS were identified; 49 (91%) responded to a web-based survey. Participants were asked about communication with other tobacco control leaders, who influenced their work, and general job characteristics. Exponential random graph modeling was used to develop a network model of influence accounting for characteristics of individuals, their relationships, and global network structures. Results Higher job ranks, more experience in tobacco control, and more time devoted to tobacco control each week increased the likelihood of influence nomination, as did more frequent communication between network members. Being in the same agency and working the same number of hours per week were positively associated with mutual influence nominations. Controlling for these characteristics, the network also exhibited patterns associated with influential clusters of network members. Conclusions Findings from this unique study provide a perspective on influence within a government agency that both helps to understand decision-making and also can serve to inform organizational efforts that allow for more effective structuring of leadership. PMID:25170448

Interpersonal influence among public health leaders in the United States department of health and human services.

PubMed

Harris, Jenine K; Carothers, Bobbi J; Wald, Lana M; Shelton, Sarah C; Leischow, Scott J

2012-02-17

In public health, interpersonal influence has been identified as an important factor in the spread of health information, and in understanding and changing health behaviors. However, little is known about influence in public health leadership. Influence is important in leadership settings, where public health professionals contribute to national policy and practice agendas. Drawing on social theory and recent advances in statistical network modeling, we examined influence in a network of tobacco control leaders at the United States Department of Health and Human Services (DHHS). Fifty-four tobacco control leaders across all 11 agencies in the DHHS were identified; 49 (91%) responded to a web-based survey. Participants were asked about communication with other tobacco control leaders, who influenced their work, and general job characteristics. Exponential random graph modeling was used to develop a network model of influence accounting for characteristics of individuals, their relationships, and global network structures. Higher job ranks, more experience in tobacco control, and more time devoted to tobacco control each week increased the likelihood of influence nomination, as did more frequent communication between network members. Being in the same agency and working the same number of hours per week were positively associated with mutual influence nominations. Controlling for these characteristics, the network also exhibited patterns associated with influential clusters of network members. Findings from this unique study provide a perspective on influence within a government agency that both helps to understand decision-making and also can serve to inform organizational efforts that allow for more effective structuring of leadership.

76 FR 23812 - Reliability and Continuity of Communications Networks, Including Broadband Technologies; Effects...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-04-28

... FEDERAL COMMUNICATIONS COMMISSION [PS Docket Nos. 11-60 and 10-92; ET Docket No. 06-119] Reliability and Continuity of Communications Networks, Including Broadband Technologies; Effects on Broadband Communications Networks of Damage or Failure of Network Equipment or Severe Overload; Independent Panel Reviewing...

Detecting and Preventing Sybil Attacks in Wireless Sensor Networks Using Message Authentication and Passing Method.

PubMed

Dhamodharan, Udaya Suriya Raj Kumar; Vayanaperumal, Rajamani

2015-01-01

Wireless sensor networks are highly indispensable for securing network protection. Highly critical attacks of various kinds have been documented in wireless sensor network till now by many researchers. The Sybil attack is a massive destructive attack against the sensor network where numerous genuine identities with forged identities are used for getting an illegal entry into a network. Discerning the Sybil attack, sinkhole, and wormhole attack while multicasting is a tremendous job in wireless sensor network. Basically a Sybil attack means a node which pretends its identity to other nodes. Communication to an illegal node results in data loss and becomes dangerous in the network. The existing method Random Password Comparison has only a scheme which just verifies the node identities by analyzing the neighbors. A survey was done on a Sybil attack with the objective of resolving this problem. The survey has proposed a combined CAM-PVM (compare and match-position verification method) with MAP (message authentication and passing) for detecting, eliminating, and eventually preventing the entry of Sybil nodes in the network. We propose a scheme of assuring security for wireless sensor network, to deal with attacks of these kinds in unicasting and multicasting.

Detecting and Preventing Sybil Attacks in Wireless Sensor Networks Using Message Authentication and Passing Method

PubMed Central

Dhamodharan, Udaya Suriya Raj Kumar; Vayanaperumal, Rajamani

2015-01-01

Wireless sensor networks are highly indispensable for securing network protection. Highly critical attacks of various kinds have been documented in wireless sensor network till now by many researchers. The Sybil attack is a massive destructive attack against the sensor network where numerous genuine identities with forged identities are used for getting an illegal entry into a network. Discerning the Sybil attack, sinkhole, and wormhole attack while multicasting is a tremendous job in wireless sensor network. Basically a Sybil attack means a node which pretends its identity to other nodes. Communication to an illegal node results in data loss and becomes dangerous in the network. The existing method Random Password Comparison has only a scheme which just verifies the node identities by analyzing the neighbors. A survey was done on a Sybil attack with the objective of resolving this problem. The survey has proposed a combined CAM-PVM (compare and match-position verification method) with MAP (message authentication and passing) for detecting, eliminating, and eventually preventing the entry of Sybil nodes in the network. We propose a scheme of assuring security for wireless sensor network, to deal with attacks of these kinds in unicasting and multicasting. PMID:26236773

A decentralized approach to reducing the social costs of cascading failures

NASA Astrophysics Data System (ADS)

Hines, Paul

Large cascading failures in electrical power networks come with enormous social costs. These can be direct financial costs, such as the loss of refrigerated foods in grocery stores, or more indirect social costs, such as the traffic congestion that results from the failure of traffic signals. While engineers and policy makers have made numerous technical and organizational changes to reduce the frequency and impact of large cascading failures, the existing data, as described in Chapter 2 of this work, indicate that the overall frequency and impact of large electrical blackouts in the United States are not decreasing. Motivated by the cascading failure problem, this thesis describes a new method for Distributed Model Predictive Control and a power systems application. The central goal of the method, when applied to power systems, is to reduce the social costs of cascading failures by making small, targeted reductions in load and generation and changes to generator voltage set points. Unlike some existing schemes that operate from centrally located control centers, the method is operated by software agents located at substations distributed throughout the power network. The resulting multi-agent control system is a new approach to decentralized control, combining Distributed Model Predictive Control and Reciprocal Altruism. Experimental results indicate that this scheme can in fact decrease the average size, and thus social costs, of cascading failures. Over 100 randomly generated disturbances to a model of the IEEE 300 bus test network, the method resulted in nearly an order of magnitude decrease in average event size (measured in cost) relative to cascading failure simulations without remedial control actions. Additionally, the communication requirements for the method are measured, and found to be within the bandwidth capabilities of current communications technology (on the order of 100kB/second). Experiments on several resistor networks with varying structures, including a random graph, a scale-free network and a power grid indicate that the effectiveness of decentralized control schemes, like the method proposed here, is a function of the structure of the network that is to be controlled.

Alternative Path Communication in Wide-Scale Cluster-Tree Wireless Sensor Networks Using Inactive Periods

PubMed Central

Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

2017-01-01

The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable technology to deploy wide-scale Wireless Sensor Networks (WSNs). These networks are usually designed to support convergecast traffic, where all communication paths go through the PAN (Personal Area Network) coordinator. Nevertheless, peer-to-peer communication relationships may be also required for different types of WSN applications. That is the typical case of sensor and actuator networks, where local control loops must be closed using a reduced number of communication hops. The use of communication schemes optimised just for the support of convergecast traffic may result in higher network congestion and in a potentially higher number of communication hops. Within this context, this paper proposes an Alternative-Route Definition (ARounD) communication scheme for WSNs. The underlying idea of ARounD is to setup alternative communication paths between specific source and destination nodes, avoiding congested cluster-tree paths. These alternative paths consider shorter inter-cluster paths, using a set of intermediate nodes to relay messages during their inactive periods in the cluster-tree network. Simulation results show that the ARounD communication scheme can significantly decrease the end-to-end communication delay, when compared to the use of standard cluster-tree communication schemes. Moreover, the ARounD communication scheme is able to reduce the network congestion around the PAN coordinator, enabling the reduction of the number of message drops due to queue overflows in the cluster-tree network. PMID:28481245

Alternative Path Communication in Wide-Scale Cluster-Tree Wireless Sensor Networks Using Inactive Periods.

PubMed

Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

2017-05-06

The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable technology to deploy wide-scale Wireless Sensor Networks (WSNs). These networks are usually designed to support convergecast traffic, where all communication paths go through the PAN (Personal Area Network) coordinator. Nevertheless, peer-to-peer communication relationships may be also required for different types of WSN applications. That is the typical case of sensor and actuator networks, where local control loops must be closed using a reduced number of communication hops. The use of communication schemes optimised just for the support of convergecast traffic may result in higher network congestion and in a potentially higher number of communication hops. Within this context, this paper proposes an Alternative-Route Definition (ARounD) communication scheme for WSNs. The underlying idea of ARounD is to setup alternative communication paths between specific source and destination nodes, avoiding congested cluster-tree paths. These alternative paths consider shorter inter-cluster paths, using a set of intermediate nodes to relay messages during their inactive periods in the cluster-tree network. Simulation results show that the ARounD communication scheme can significantly decrease the end-to-end communication delay, when compared to the use of standard cluster-tree communication schemes. Moreover, the ARounD communication scheme is able to reduce the network congestion around the PAN coordinator, enabling the reduction of the number of message drops due to queue overflows in the cluster-tree network.

Social networking technologies as emerging tools for HIV prevention: A Cluster Randomized Trial

PubMed Central

Young, Sean D.; Cumberland, William G.; Lee, Sung-Jae; Jaganath, Devan; Szekeres, Greg; Coates, Thomas

2013-01-01

Background Social networking technologies are an emerging tool for HIV prevention. Objective To determine whether social networking communities can increase HIV testing among African American and Latino men who have sex with men (MSM). Design Randomized; controlled trial with concealed allocation (ClinicalTrials.gov: NCT01701206). Setting Online. Patients 112 MSM based in Los Angeles, more than 85% of whom were African American or Latino. Intervention Sixteen peer leaders were randomly assigned to deliver information about HIV or general health to participants via Facebook groups over 12 weeks. After participants accepted a request to join the group, participation was voluntary. Group participation and engagement was monitored. Participants could request a free home-based HIV testing kit and completed questionnaires at baseline and 12-week follow-up. Measurements Participant acceptance of and engagement in the intervention and social network participation, rates of home-based HIV testing, and sexual risk behaviors. Results Almost 95% of intervention participants and 73% of control participants voluntarily communicated using the social platform. Twenty-five of the 57 intervention participants (44%) requested home-based HIV testing kits compared with 11 of 55 control participants (20%) (difference, 24 percentage points [95% CI, 8 to 41 percentage points]). Nine of the 25 intervention participants (36%) who requested the test took it and mailed it back compared with 2 of the 11 control participants (18%) who requested the test. Retention at study follow-up was more 93%. Limitations Only 2 Facebook communities were included for each group. Conclusions Social networking communities are acceptable and effective tools to increase home-based HIV testing among at-risk populations. Primary funding source National Institute of Mental Health ClinicalTrials.gov Identifier (NCT01701206) PMID:24026317

Butterfly Encryption Scheme for Resource-Constrained Wireless Networks †

PubMed Central

Sampangi, Raghav V.; Sampalli, Srinivas

2015-01-01

Resource-constrained wireless networks are emerging networks such as Radio Frequency Identification (RFID) and Wireless Body Area Networks (WBAN) that might have restrictions on the available resources and the computations that can be performed. These emerging technologies are increasing in popularity, particularly in defence, anti-counterfeiting, logistics and medical applications, and in consumer applications with growing popularity of the Internet of Things. With communication over wireless channels, it is essential to focus attention on securing data. In this paper, we present an encryption scheme called Butterfly encryption scheme. We first discuss a seed update mechanism for pseudorandom number generators (PRNG), and employ this technique to generate keys and authentication parameters for resource-constrained wireless networks. Our scheme is lightweight, as in it requires less resource when implemented and offers high security through increased unpredictability, owing to continuously changing parameters. Our work focuses on accomplishing high security through simplicity and reuse. We evaluate our encryption scheme using simulation, key similarity assessment, key sequence randomness assessment, protocol analysis and security analysis. PMID:26389899

Butterfly Encryption Scheme for Resource-Constrained Wireless Networks.

PubMed

Sampangi, Raghav V; Sampalli, Srinivas

2015-09-15

Resource-constrained wireless networks are emerging networks such as Radio Frequency Identification (RFID) and Wireless Body Area Networks (WBAN) that might have restrictions on the available resources and the computations that can be performed. These emerging technologies are increasing in popularity, particularly in defence, anti-counterfeiting, logistics and medical applications, and in consumer applications with growing popularity of the Internet of Things. With communication over wireless channels, it is essential to focus attention on securing data. In this paper, we present an encryption scheme called Butterfly encryption scheme. We first discuss a seed update mechanism for pseudorandom number generators (PRNG), and employ this technique to generate keys and authentication parameters for resource-constrained wireless networks. Our scheme is lightweight, as in it requires less resource when implemented and offers high security through increased unpredictability, owing to continuously changing parameters. Our work focuses on accomplishing high security through simplicity and reuse. We evaluate our encryption scheme using simulation, key similarity assessment, key sequence randomness assessment, protocol analysis and security analysis.

[Early prenatal interview: implementation of a sheet link "carried" by patient. The Aurore perinatal network experience].

PubMed

Dupont, C; Gonnaud, F; Touzet, S; Luciani, F; Perié, M-A; Molenat, F; Evrard, A; Fernandez, M-P; Roy, J; Rudigoz, R-C

2008-11-01

Early prenatal interview has needed the implementation of a new communication tool between follow-up pregnancy professionals: a link sheet filled and carried by patients. To assess the utilization of link sheet by trained professionals, the contribution of the interview and the patient acceptation of the link sheet. Descriptive survey from the database of link sheets returned by professionals to Aurore perinatal network and semi-guided interviews with 100 randomized patients. One thousand one hundred and nineteen link sheets were sent to Aurore perinatal network by 55 professionals out of 78 trained. For primipare, precocious prenatal interview contribution has concerned health care security (60%) and emotional security (56%). For multipare, this contribution has concerned mainly emotional security (80%). No interviewed patient has refused link sheet principle. Link sheet principle, like implemented by Aurore perinatal network, seems pertinent to professionals and patients but it constitutes only one of the elements of network elaboration of personalized care.

Apparatus and method for data communication in an energy distribution network

DOEpatents

Hussain, Mohsin; LaPorte, Brock; Uebel, Udo; Zia, Aftab

2014-07-08

A system for communicating information on an energy distribution network is disclosed. In one embodiment, the system includes a local supervisor on a communication network, wherein the local supervisor can collect data from one or more energy generation/monitoring devices. The system also includes a command center on the communication network, wherein the command center can generate one or more commands for controlling the one or more energy generation devices. The local supervisor can periodically transmit a data signal indicative of the data to the command center via a first channel of the communication network at a first interval. The local supervisor can also periodically transmit a request for a command to the command center via a second channel of the communication network at a second interval shorter than the first interval. This channel configuration provides effective data communication without a significant increase in the use of network resources.

Computer hardware fault administration

DOEpatents

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

2010-09-14

Computer hardware fault administration carried out in a parallel computer, where the parallel computer includes a plurality of compute nodes. The compute nodes are coupled for data communications by at least two independent data communications networks, where each data communications network includes data communications links connected to the compute nodes. Typical embodiments carry out hardware fault administration by identifying a location of a defective link in the first data communications network of the parallel computer and routing communications data around the defective link through the second data communications network of the parallel computer.

Open source system OpenVPN in a function of Virtual Private Network

NASA Astrophysics Data System (ADS)

Skendzic, A.; Kovacic, B.

2017-05-01

Using of Virtual Private Networks (VPN) can establish high security level in network communication. VPN technology enables high security networking using distributed or public network infrastructure. VPN uses different security and managing rules inside networks. It can be set up using different communication channels like Internet or separate ISP communication infrastructure. VPN private network makes security communication channel over public network between two endpoints (computers). OpenVPN is an open source software product under GNU General Public License (GPL) that can be used to establish VPN communication between two computers inside business local network over public communication infrastructure. It uses special security protocols and 256-bit Encryption and it is capable of traversing network address translators (NATs) and firewalls. It allows computers to authenticate each other using a pre-shared secret key, certificates or username and password. This work gives review of VPN technology with a special accent on OpenVPN. This paper will also give comparison and financial benefits of using open source VPN software in business environment.

75 FR 49870 - Effects on Broadband Communications Networks of Damage to or Failure of Network Equipment or...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-16

... FEDERAL COMMUNICATIONS COMMISSION 47 CFR Chapter I [PS Docket No. 10-92; DA 10-1357] Effects on Broadband Communications Networks of Damage to or Failure of Network Equipment or Severe Overload AGENCY: Federal Communications Commission ACTION: Proposed rule; extension of reply comment date. SUMMARY: This...

Smarter hospital communication: secure smartphone text messaging improves provider satisfaction and perception of efficacy, workflow.

PubMed

Przybylo, Jennifer A; Wang, Ange; Loftus, Pooja; Evans, Kambria H; Chu, Isabella; Shieh, Lisa

2014-09-01

Though current hospital paging systems are neither efficient (callbacks disrupt workflow), nor secure (pagers are not Health Insurance Portability and Accountability Act [HIPAA]-compliant), they are routinely used to communicate patient information. Smartphone-based text messaging is a potentially more convenient and efficient mobile alternative; however, commercial cellular networks are also not secure. To determine if augmenting one-way pagers with Medigram, a secure, HIPAA-compliant group messaging (HCGM) application for smartphones, could improve hospital team communication. Eight-week prospective, cluster-randomized, controlled trial Stanford Hospital Three inpatient medicine teams used the HCGM application in addition to paging, while two inpatient medicine teams used paging only for intra-team communication. Baseline and post-study surveys were collected from 22 control and 41 HCGM team members. When compared with paging, HCGM was rated significantly (P < 0.05) more effective in: (1) allowing users to communicate thoughts clearly (P = 0.010) and efficiently (P = 0.009) and (2) integrating into workflow during rounds (P = 0.018) and patient discharge (P = 0.012). Overall satisfaction with HCGM was significantly higher (P = 0.003). 85% of HCGM team respondents said they would recommend using an HCGM system on the wards. Smartphone-based, HIPAA-compliant group messaging applications improve provider perception of in-hospital communication, while providing the information security that paging and commercial cellular networks do not. © 2014 The Authors Journal of Hospital Medicine published by Wiley Periodicals, Inc. on behalf of Society of Hospital Medicine.

Reliable Communication Models in Interdependent Critical Infrastructure Networks

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

Lee, Sangkeun; Chinthavali, Supriya; Shankar, Mallikarjun

Modern critical infrastructure networks are becoming increasingly interdependent where the failures in one network may cascade to other dependent networks, causing severe widespread national-scale failures. A number of previous efforts have been made to analyze the resiliency and robustness of interdependent networks based on different models. However, communication network, which plays an important role in today's infrastructures to detect and handle failures, has attracted little attention in the interdependency studies, and no previous models have captured enough practical features in the critical infrastructure networks. In this paper, we study the interdependencies between communication network and other kinds of critical infrastructuremore » networks with an aim to identify vulnerable components and design resilient communication networks. We propose several interdependency models that systematically capture various features and dynamics of failures spreading in critical infrastructure networks. We also discuss several research challenges in building reliable communication solutions to handle failures in these models.« less

A Hybrid Satellite-Terrestrial Approach to Aeronautical Communication Networks

NASA Technical Reports Server (NTRS)

Kerczewski, Robert J.; Chomos, Gerald J.; Griner, James H.; Mainger, Steven W.; Martzaklis, Konstantinos S.; Kachmar, Brian A.

2000-01-01

Rapid growth in air travel has been projected to continue for the foreseeable future. To maintain a safe and efficient national and global aviation system, significant advances in communications systems supporting aviation are required. Satellites will increasingly play a critical role in the aeronautical communications network. At the same time, current ground-based communications links, primarily very high frequency (VHF), will continue to be employed due to cost advantages and legacy issues. Hence a hybrid satellite-terrestrial network, or group of networks, will emerge. The increased complexity of future aeronautical communications networks dictates that system-level modeling be employed to obtain an optimal system fulfilling a majority of user needs. The NASA Glenn Research Center is investigating the current and potential future state of aeronautical communications, and is developing a simulation and modeling program to research future communications architectures for national and global aeronautical needs. This paper describes the primary requirements, the current infrastructure, and emerging trends of aeronautical communications, including a growing role for satellite communications. The need for a hybrid communications system architecture approach including both satellite and ground-based communications links is explained. Future aeronautical communication network topologies and key issues in simulation and modeling of future aeronautical communications systems are described.

Overview of NASA communications infrastructure

NASA Technical Reports Server (NTRS)

Arnold, Ray J.; Fuechsel, Charles

1991-01-01

The infrastructure of NASA communications systems for effecting coordination across NASA offices and with the national and international research and technological communities is discussed. The offices and networks of the communication system include the Office of Space Science and Applications (OSSA), which manages all NASA missions, and the Office of Space Operations, which furnishes communication support through the NASCOM, the mission critical communications support network, and the Program Support Communications network. The NASA Science Internet was established by OSSA to centrally manage, develop, and operate an integrated computer network service dedicated to NASA's space science and application research. Planned for the future is the National Research and Education Network, which will provide communications infrastructure to enhance science resources at a national level.

GLOBECOM '85 - Global Telecommunications Conference, New Orleans, LA, December 2-5, 1985, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Various papers on global telecommunications are presented. The general topics addressed include: multiservice integration with optical fibers, multicompany owned telecommunication networks, softworks quality and reliability, advanced on-board processing, impact of new services and systems on operations and maintenance, analytical studies of protocols for data communication networks, topics in packet radio networking, CCITT No. 7 to support new services, document processing and communication, antenna technology and system aspects in satellite communications. Also considered are: communication systems modelling methodology, experimental integrated local area voice/data nets, spread spectrum communications, motion video at the DS-0 rate, optical and data communications, intelligent work stations, switch performance analysis, novel radio communication systems, wireless local networks, ISDN services, LAN communication protocols, user-system interface, radio propagation and performance, mobile satellite system, software for computer networks, VLSI for ISDN terminals, quality management, man-machine interfaces in switching, and local area network performance.

Communication devices for network-hopping communications and methods of network-hopping communications

DOEpatents

Buttles, John W [Idaho Falls, ID

2011-12-20

Wireless communication devices include a software-defined radio coupled to processing circuitry. The processing circuitry is configured to execute computer programming code. Storage media is coupled to the processing circuitry and includes computer programming code configured to cause the processing circuitry to configure and reconfigure the software-defined radio to operate on each of a plurality of communication networks according to a selected sequence. Methods for communicating with a wireless device and methods of wireless network-hopping are also disclosed.

Communication devices for network-hopping communications and methods of network-hopping communications

DOEpatents

Buttles, John W

2013-04-23

Wireless communication devices include a software-defined radio coupled to processing circuitry. The system controller is configured to execute computer programming code. Storage media is coupled to the system controller and includes computer programming code configured to cause the system controller to configure and reconfigure the software-defined radio to operate on each of a plurality of communication networks according to a selected sequence. Methods for communicating with a wireless device and methods of wireless network-hopping are also disclosed.

GLOBECOM '87 - Global Telecommunications Conference, Tokyo, Japan, Nov. 15-18, 1987, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

The present conference on global telecommunications discusses topics in the fields of Integrated Services Digital Network (ISDN) technology field trial planning and results to date, motion video coding, ISDN networking, future network communications security, flexible and intelligent voice/data networks, Asian and Pacific lightwave and radio systems, subscriber radio systems, the performance of distributed systems, signal processing theory, satellite communications modulation and coding, and terminals for the handicapped. Also discussed are knowledge-based technologies for communications systems, future satellite transmissions, high quality image services, novel digital signal processors, broadband network access interface, traffic engineering for ISDN design and planning, telecommunications software, coherent optical communications, multimedia terminal systems, advanced speed coding, portable and mobile radio communications, multi-Gbit/second lightwave transmission systems, enhanced capability digital terminals, communications network reliability, advanced antimultipath fading techniques, undersea lightwave transmission, image coding, modulation and synchronization, adaptive signal processing, integrated optical devices, VLSI technologies for ISDN, field performance of packet switching, CSMA protocols, optical transport system architectures for broadband ISDN, mobile satellite communications, indoor wireless communication, echo cancellation in communications, and distributed network algorithms.

Terminal-oriented computer-communication networks.

NASA Technical Reports Server (NTRS)

Schwartz, M.; Boorstyn, R. R.; Pickholtz, R. L.

1972-01-01

Four examples of currently operating computer-communication networks are described in this tutorial paper. They include the TYMNET network, the GE Information Services network, the NASDAQ over-the-counter stock-quotation system, and the Computer Sciences Infonet. These networks all use programmable concentrators for combining a multiplicity of terminals. Included in the discussion for each network is a description of the overall network structure, the handling and transmission of messages, communication requirements, routing and reliability consideration where applicable, operating data and design specifications where available, and unique design features in the area of computer communications.

Determining a bisection bandwidth for a multi-node data communications network

DOEpatents

Faraj, Ahmad A.

2010-01-26

Methods, systems, and products are disclosed for determining a bisection bandwidth for a multi-node data communications network that include: partitioning nodes in the network into a first sub-network and a second sub-network in dependence upon a topology of the network; sending, by each node in the first sub-network to a destination node in the second sub-network, a first message having a predetermined message size; receiving, by each node in the first sub-network from a source node in the second sub-network, a second message; measuring, by each node in the first sub-network, the elapsed communications time between the sending of the first message and the receiving of the second message; selecting the longest elapsed communications time; and calculating the bisection bandwidth for the network in dependence upon the number of the nodes in the first sub-network, the predetermined message size of the first test message, and the longest elapsed communications time.

Multi-language naming game

NASA Astrophysics Data System (ADS)

Zhou, Jianfeng; Lou, Yang; Chen, Guanrong; Tang, Wallace K. S.

2018-04-01

Naming game is a simulation-based experiment used to study the evolution of languages. The conventional naming game focuses on a single language. In this paper, a novel naming game model named multi-language naming game (MLNG) is proposed, where the agents are different-language speakers who cannot communicate with each other without a translator (interpreter) in between. The MLNG model is general, capable of managing k different languages with k ≥ 2. For illustration, the paper only discusses the MLNG with two different languages, and studies five representative network topologies, namely random-graph, WS small-world, NW small-world, scale-free, and random-triangle topologies. Simulation and analysis results both show that: 1) using the network features and based on the proportion of translators the probability of establishing a conversation between two or three agents can be theoretically estimated; 2) the relationship between the convergence speed and the proportion of translators has a power-law-like relation; 3) different agents require different memory sizes, thus a local memory allocation rule is recommended for saving memory resources. The new model and new findings should be useful for further studies of naming games and for better understanding of languages evolution from a dynamical network perspective.

Effect of variation in active route timeout and my route timeout on the performance of AODV-ETX protocol in mobile adhoc network

NASA Astrophysics Data System (ADS)

Purnomo, A.; Widyawan; Najib, W.; Hartono, R.; Hartatik

2018-03-01

Mobile adhoc network (MANET) consists of nodes that are independent. A node can communicate each other without the presence of network infrastructure. A node can act as a transmitter and receiver as well as a router. This research has been variation in active route timeout and my route timeout on the performance of AODV-ETX protocol in MANET. The AODV-ETX protocol is the AODV protocol that uses the ETX metric. Performance testing is done on the static node topology with 5 m x 5 m node grid model where the distance between nodes is 100 m and node topology that consists of 25 nodes moves randomly with a moving speed of 1.38 m/s in an area of 1500 m x 300 m. From the test result, on the static node, AODV protocol-ETX shows optimal performance at a value MRT and ART of 10 s and 15 s, but showed a stable performance in the value of MRT and ART ≥60 s, while in randomly moved node topology shows stable performance in the value of MRT and ART ≥80 s.

A network architecture for precision formation flying using the IEEE 802.11 MAC Protocol

NASA Technical Reports Server (NTRS)

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

2005-01-01

Precision Formation Flying missions involve the tracking and maintenance of spacecraft in a desired geometric formation. The strong coupling of spacecraft in formation flying control requires inter-spacecraft communication to exchange information. In this paper, we present a network architecture that supports PFF control, from the initial random deployment phase to the final formation. We show that a suitable MAC layer for the application protocol is IEEE's 802.11 MAC protocol. IEEE 802.11 MAC has two modes of operations: DCF and PCF. We show that DCF is suitable for the initial deployment phase while switching to PCF when the spacecraft are in formation improves jitter and throughput. We also consider the effect of routing on protocol performance and suggest when it is profitable to turn off route discovery to achieve better network performance.

Information spread of emergency events: path searching on social networks.

PubMed

Dai, Weihui; Hu, Hongzhi; Wu, Tunan; Dai, Yonghui

2014-01-01

Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

Exploiting Publication Contents and Collaboration Networks for Collaborator Recommendation

PubMed Central

Kong, Xiangjie; Jiang, Huizhen; Yang, Zhuo; Xu, Zhenzhen; Xia, Feng; Tolba, Amr

2016-01-01

Thanks to the proliferation of online social networks, it has become conventional for researchers to communicate and collaborate with each other. Meanwhile, one critical challenge arises, that is, how to find the most relevant and potential collaborators for each researcher? In this work, we propose a novel collaborator recommendation model called CCRec, which combines the information on researchers’ publications and collaboration network to generate better recommendation. In order to effectively identify the most potential collaborators for researchers, we adopt a topic clustering model to identify the academic domains, as well as a random walk model to compute researchers’ feature vectors. Using DBLP datasets, we conduct benchmarking experiments to examine the performance of CCRec. The experimental results show that CCRec outperforms other state-of-the-art methods in terms of precision, recall and F1 score. PMID:26849682

Early home-based group education to support informed decision-making among patients with end-stage renal disease: a multi-centre randomized controlled trial.

PubMed

Massey, Emma K; Gregoor, Peter J H Smak; Nette, Robert W; van den Dorpel, Marinus A; van Kooij, Anthony; Zietse, Robert; Zuidema, Willij C; Timman, Reinier; Busschbach, Jan J; Weimar, Willem

2016-05-01

The aim was to test the effectiveness of early home-based group education on knowledge and communication about renal replacement therapy (RRT). We conducted a randomized controlled trial using a cross-over design among 80 end-stage renal disease (ESRD) patients. Between T0 and T1 (weeks 1-4) Group 1 received the intervention and Group 2 received standard care. Between T1 and T2 (weeks 5-8) Group 1 received standard care and Group 2 received the intervention. The intervention was a group education session on RRT options held in the patient's home given by social workers. Patients invited members from their social network to attend. Self-report questionnaires were used at T0, T1 and T2 to measure patients' knowledge and communication, and concepts from the Theory of Planned Behaviour such as attitude. Comparable questionnaires were completed pre-post intervention by 229 attendees. Primary RRT was registered up to 2 years post-intervention. Multilevel linear modelling was used to analyse patient data and paired t-tests for attendee data. Statistically significant increases in the primary targets knowledge and communication were found among patients and attendees after receiving the intervention. The intervention also had a significant effect in increasing positive attitude toward living donation and haemodialysis. Of the 80 participants, 49 underwent RRT during follow-up. Of these, 34 underwent a living donor kidney transplant, of which 22 were pre-emptive. Early home-based group education supports informed decision-making regarding primary RRT for ESRD patients and their social networks and may remove barriers to pre-emptive transplantation. © The Author 2015. Published by Oxford University Press on behalf of ERA-EDTA. All rights reserved.

An improved anonymous authentication scheme for roaming in ubiquitous networks.

PubMed

Lee, Hakjun; Lee, Donghoon; Moon, Jongho; Jung, Jaewook; Kang, Dongwoo; Kim, Hyoungshick; Won, Dongho

2018-01-01

With the evolution of communication technology and the exponential increase of mobile devices, the ubiquitous networking allows people to use our data and computing resources anytime and everywhere. However, numerous security concerns and complicated requirements arise as these ubiquitous networks are deployed throughout people's lives. To meet the challenge, the user authentication schemes in ubiquitous networks should ensure the essential security properties for the preservation of the privacy with low computational cost. In 2017, Chaudhry et al. proposed a password-based authentication scheme for the roaming in ubiquitous networks to enhance the security. Unfortunately, we found that their scheme remains insecure in its protection of the user privacy. In this paper, we prove that Chaudhry et al.'s scheme is vulnerable to the stolen-mobile device and user impersonation attacks, and its drawbacks comprise the absence of the incorrect login-input detection, the incorrectness of the password change phase, and the absence of the revocation provision. Moreover, we suggest a possible way to fix the security flaw in Chaudhry et al's scheme by using the biometric-based authentication for which the bio-hash is applied in the implementation of a three-factor authentication. We prove the security of the proposed scheme with the random oracle model and formally verify its security properties using a tool named ProVerif, and analyze it in terms of the computational and communication cost. The analysis result shows that the proposed scheme is suitable for resource-constrained ubiquitous environments.

An improved anonymous authentication scheme for roaming in ubiquitous networks

PubMed Central

Lee, Hakjun; Lee, Donghoon; Moon, Jongho; Jung, Jaewook; Kang, Dongwoo; Kim, Hyoungshick

2018-01-01

With the evolution of communication technology and the exponential increase of mobile devices, the ubiquitous networking allows people to use our data and computing resources anytime and everywhere. However, numerous security concerns and complicated requirements arise as these ubiquitous networks are deployed throughout people’s lives. To meet the challenge, the user authentication schemes in ubiquitous networks should ensure the essential security properties for the preservation of the privacy with low computational cost. In 2017, Chaudhry et al. proposed a password-based authentication scheme for the roaming in ubiquitous networks to enhance the security. Unfortunately, we found that their scheme remains insecure in its protection of the user privacy. In this paper, we prove that Chaudhry et al.’s scheme is vulnerable to the stolen-mobile device and user impersonation attacks, and its drawbacks comprise the absence of the incorrect login-input detection, the incorrectness of the password change phase, and the absence of the revocation provision. Moreover, we suggest a possible way to fix the security flaw in Chaudhry et al’s scheme by using the biometric-based authentication for which the bio-hash is applied in the implementation of a three-factor authentication. We prove the security of the proposed scheme with the random oracle model and formally verify its security properties using a tool named ProVerif, and analyze it in terms of the computational and communication cost. The analysis result shows that the proposed scheme is suitable for resource-constrained ubiquitous environments. PMID:29505575

Enhanced Communication with the Assistance of Indefinite Causal Order

NASA Astrophysics Data System (ADS)

Ebler, Daniel; Salek, Sina; Chiribella, Giulio

2018-03-01

In quantum Shannon theory, the way information is encoded and decoded takes advantage of the laws of quantum mechanics, while the way communication channels are interlinked is assumed to be classical. In this Letter, we relax the assumption that quantum channels are combined classically, showing that a quantum communication network where quantum channels are combined in a superposition of different orders can achieve tasks that are impossible in conventional quantum Shannon theory. In particular, we show that two identical copies of a completely depolarizing channel become able to transmit information when they are combined in a quantum superposition of two alternative orders. This finding runs counter to the intuition that if two communication channels are identical, using them in different orders should not make any difference. The failure of such intuition stems from the fact that a single noisy channel can be a random mixture of elementary, noncommuting processes, whose order (or lack thereof) can affect the ability to transmit information.

Association between Family Communication and Health Literacy among Underserved Racial/Ethnic Women.

PubMed

Zambrana, Ruth E; Meghea, Cristian; Talley, Costellia; Hammad, Adnan; Lockett, Murlisa; Williams, Karen Patricia

2015-05-01

Health literacy and the family can be used to promote cancer screenings. We examined the associations of socio-demographic factors, family communication, and cancer literacy in a diverse population. Baseline data from the Kin Keeper(SM) Cancer Prevention randomized controlled trial were analyzed for Black (n=216), Latino (n=65), and Arab (n=235) women. Key variables were based on the Family Adaptability and Cohesion Scale IV, and the Cancer Literacy Assessment Tool. Among Blacks, cervical cancer literacy was positively associated with family communication. Cancer literacy was associated with higher educational level, employment, and family self-rated health status among Black and Arab women. Among Latinas, who were the least educated and had the lowest literacy scores, family communication was inversely related to breast cancer literacy. Family-centered networks may be a viable resource for the transmission of health cancer literacy information, inform health care decision-making, and contribute to decreasing breast and cervical cancer mortality.

Enhanced Communication with the Assistance of Indefinite Causal Order.

PubMed

Ebler, Daniel; Salek, Sina; Chiribella, Giulio

2018-03-23

In quantum Shannon theory, the way information is encoded and decoded takes advantage of the laws of quantum mechanics, while the way communication channels are interlinked is assumed to be classical. In this Letter, we relax the assumption that quantum channels are combined classically, showing that a quantum communication network where quantum channels are combined in a superposition of different orders can achieve tasks that are impossible in conventional quantum Shannon theory. In particular, we show that two identical copies of a completely depolarizing channel become able to transmit information when they are combined in a quantum superposition of two alternative orders. This finding runs counter to the intuition that if two communication channels are identical, using them in different orders should not make any difference. The failure of such intuition stems from the fact that a single noisy channel can be a random mixture of elementary, noncommuting processes, whose order (or lack thereof) can affect the ability to transmit information.

Research on social communication network evolution based on topology potential distribution

NASA Astrophysics Data System (ADS)

Zhao, Dongjie; Jiang, Jian; Li, Deyi; Zhang, Haisu; Chen, Guisheng

2011-12-01

Aiming at the problem of social communication network evolution, first, topology potential is introduced to measure the local influence among nodes in networks. Second, from the perspective of topology potential distribution the method of network evolution description based on topology potential distribution is presented, which takes the artificial intelligence with uncertainty as basic theory and local influence among nodes as essentiality. Then, a social communication network is constructed by enron email dataset, the method presented is used to analyze the characteristic of the social communication network evolution and some useful conclusions are got, implying that the method is effective, which shows that topology potential distribution can effectively describe the characteristic of sociology and detect the local changes in social communication network.

Rapid assessment of agents of biological terrorism: defining the differential diagnosis of inhalational anthrax using electronic communication in a practice-based research network.

PubMed

Temte, Jonathan L; Anderson, Anna Lisa

2004-01-01

Early detection of bioterrorism requires assessment of diagnoses assigned to cases of rare diseases with which clinicians have little experience. In this study, we evaluated the process of defining the differential diagnosis for inhalational anthrax using electronic communication within a practice-based research network (PBRN) and compared the results with those obtained from a nationwide random sample of family physicians with a mailed instrument. We distributed survey instruments by e-mail to 55 physician members of the Wisconsin Research Network (WReN), a regional PBRN. The instruments consisted of 3 case vignettes randomly drawn from a set describing 11 patients with inhalational anthrax, 2 with influenza A, and 1 with Legionella pneumonia. Physicians provided their most likely nonanthrax diagnosis, along with their responses to 4 yes-or-no management questions for each case. Physicians who had not responded at 1 week received a second e-mail with the survey instrument. The comparison group consisted of the nationwide sample of physicians who completed mailed survey instruments. Primary outcome measures were response rate, median response time, and frequencies of diagnostic categories assigned to cases of inhalational anthrax. The PBRN response rate compared favorably with that of the national sample (47.3% vs 37.0%; P = not significant). The median response time for the PBRN was significantly shorter than that for the national sample (2 vs 28 days; P < .001). No significant differences were found between the PBRN and the Midwest subset of the national sample in the frequencies of major diagnostic categories or in case management. Electronic means of creating differential diagnoses for rare infectious diseases of national significance is feasible within PBRNs. Information is much more rapidly acquired and is consistent with that obtained by conventional methods.

WindTalker: A P2P-Based Low-Latency Anonymous Communication Network

NASA Astrophysics Data System (ADS)

Zhang, Jia; Duan, Haixin; Liu, Wu; Wu, Jianping

Compared with traditional static anonymous communication networks, the P2P architecture can provide higher anonymity in communication. However, the P2P architecture also leads to more challenges, such as route, stability, trust and so on. In this paper, we present WindTalker, a P2P-based low-latency anonymous communication network. It is a pure decentralized mix network and can provide low-latency services which help users hide their real identity in communication. In order to ensure stability and reliability, WindTalker imports “seed nodes” to help a peer join in the P2P network and the peer nodes can use gossip-based protocol to exchange active information. Moreover, WindTalker uses layer encryption to ensure the information of relayed messages cannot be leaked. In addition, malicious nodes in the network are the major threat to anonymity of P2P anonymous communication, so WindTalker imports a trust mechanism which can help the P2P network exclude malicious nodes and optimize the strategy of peer discovery, tunnel construction, and relaying etc. in anonymous communications. We deploy peer nodes of WindTalker in our campus network to test reliability and analyze anonymity in theory. The network measurement and simulation analysis shows that WindTalker can provide low-latency and reliable anonymous communication services.

Vehicle lateral motion regulation under unreliable communication links based on robust H∞ output-feedback control schema

NASA Astrophysics Data System (ADS)

Li, Cong; Jing, Hui; Wang, Rongrong; Chen, Nan

2018-05-01

This paper presents a robust control schema for vehicle lateral motion regulation under unreliable communication links via controller area network (CAN). The communication links between the system plant and the controller are assumed to be imperfect and therefore the data packet dropouts occur frequently. The paper takes the form of parallel distributed compensation and treats the dropouts as random binary numbers that form Bernoulli distribution. Both of the tire cornering stiffness uncertainty and external disturbances are considered to enhance the robustness of the controller. In addition, a robust H∞ static output-feedback control approach is proposed to realize the lateral motion control with relative low cost sensors. The stochastic stability of the closed-loop system and conservation of the guaranteed H∞ performance are investigated. Simulation results based on CarSim platform using a high-fidelity and full-car model verify the effectiveness of the proposed control approach.

Distributed reservation control protocols for random access broadcasting channels

NASA Technical Reports Server (NTRS)

Greene, E. P.; Ephremides, A.

1981-01-01

Attention is given to a communication network consisting of an arbitrary number of nodes which can communicate with each other via a time-division multiple access (TDMA) broadcast channel. The reported investigation is concerned with the development of efficient distributed multiple access protocols for traffic consisting primarily of single packet messages in a datagram mode of operation. The motivation for the design of the protocols came from the consideration of efficient multiple access utilization of moderate to high bandwidth (4-40 Mbit/s capacity) communication satellite channels used for the transmission of short (1000-10,000 bits) fixed length packets. Under these circumstances, the ratio of roundtrip propagation time to packet transmission time is between 100 to 10,000. It is shown how a TDMA channel can be adaptively shared by datagram traffic and constant bandwidth users such as in digital voice applications. The distributed reservation control protocols described are a hybrid between contention and reservation protocols.

Expected number of quantum channels in quantum networks.

PubMed

Chen, Xi; Wang, He-Ming; Ji, Dan-Tong; Mu, Liang-Zhu; Fan, Heng

2015-07-15

Quantum communication between nodes in quantum networks plays an important role in quantum information processing. Here, we proposed the use of the expected number of quantum channels as a measure of the efficiency of quantum communication for quantum networks. This measure quantified the amount of quantum information that can be teleported between nodes in a quantum network, which differs from classical case in that the quantum channels will be consumed if teleportation is performed. We further demonstrated that the expected number of quantum channels represents local correlations depicted by effective circles. Significantly, capacity of quantum communication of quantum networks quantified by ENQC is independent of distance for the communicating nodes, if the effective circles of communication nodes are not overlapped. The expected number of quantum channels can be enhanced through transformations of the lattice configurations of quantum networks via entanglement swapping. Our results can shed lights on the study of quantum communication in quantum networks.

Expected number of quantum channels in quantum networks

PubMed Central

Chen, Xi; Wang, He-Ming; Ji, Dan-Tong; Mu, Liang-Zhu; Fan, Heng

2015-01-01

Quantum communication between nodes in quantum networks plays an important role in quantum information processing. Here, we proposed the use of the expected number of quantum channels as a measure of the efficiency of quantum communication for quantum networks. This measure quantified the amount of quantum information that can be teleported between nodes in a quantum network, which differs from classical case in that the quantum channels will be consumed if teleportation is performed. We further demonstrated that the expected number of quantum channels represents local correlations depicted by effective circles. Significantly, capacity of quantum communication of quantum networks quantified by ENQC is independent of distance for the communicating nodes, if the effective circles of communication nodes are not overlapped. The expected number of quantum channels can be enhanced through transformations of the lattice configurations of quantum networks via entanglement swapping. Our results can shed lights on the study of quantum communication in quantum networks. PMID:26173556

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.

Parallel processing data network of master and slave transputers controlled by a serial control network

DOEpatents

Crosetto, D.B.

1996-12-31

The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor to a plurality of slave processors to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor`s status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer, a digital signal processor, a parallel transfer controller, and two three-port memory devices. A communication switch within each node connects it to a fast parallel hardware channel through which all high density data arrives or leaves the node. 6 figs.

Parallel processing data network of master and slave transputers controlled by a serial control network

DOEpatents

Crosetto, Dario B.

1996-01-01

The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor (100) to a plurality of slave processors (200) to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor's status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer (104), a digital signal processor (114), a parallel transfer controller (106), and two three-port memory devices. A communication switch (108) within each node (100) connects it to a fast parallel hardware channel (70) through which all high density data arrives or leaves the node.

Approximation algorithms for the min-power symmetric connectivity problem

NASA Astrophysics Data System (ADS)

Plotnikov, Roman; Erzin, Adil; Mladenovic, Nenad

2016-10-01

We consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs in the wireless networks while minimizing the total transmission power consumptions. We propose several new heuristics based on the variable neighborhood search metaheuristic for the approximation solution of the problem. We have performed a numerical experiment where all proposed algorithms have been executed on the randomly generated test samples. For these instances, on average, our algorithms outperform the previously known heuristics.

Reference clock parameters for digital communications systems applications

NASA Technical Reports Server (NTRS)

Kartaschoff, P.

1981-01-01

The basic parameters relevant to the design of network timing systems describe the random and systematic time departures of the system elements, i.e., master (or reference) clocks, transmission links, and other clocks controlled over the links. The quantitative relations between these parameters were established and illustrated by means of numerical examples based on available measured data. The examples were limited to a simple PLL control system but the analysis can eventually be applied to more sophisticated systems at the cost of increased computational effort.

Communication, advice exchange and job satisfaction of nursing staff: a social network analyses of 35 long-term care units.

PubMed

van Beek, Adriana P A; Wagner, Cordula; Spreeuwenberg, Peter P M; Frijters, Dinnus H M; Ribbe, Miel W; Groenewegen, Peter P

2011-06-01

The behaviour of individuals is affected by the social networks in which they are embedded. Networks are also important for the diffusion of information and the influence of employees in organisations. Yet, at the moment little is known about the social networks of nursing staff in healthcare settings. This is the first study that investigates informal communication and advice networks of nursing staff in long-term care. We examine the structure of the networks, how they are related to the size of units and characteristics of nursing staff, and their relationship with job satisfaction. We collected social network data of 380 nursing staff of 35 units in group projects and psychogeriatric units in nursing homes and residential homes in the Netherlands. Communication and advice networks were analyzed in a social network application (UCINET), focusing on the number of contacts (density) between nursing staff on the units. We then studied the correlation between the density of networks, size of the units and characteristics of nursing staff. We used multilevel analyses to investigate the relationship between social networks and job satisfaction of nursing staff, taking characteristics of units and nursing staff into account. Both communication and advice networks were negatively related to the number of residents and the number of nursing staff of the units. Communication and advice networks were more dense when more staff worked part-time. Furthermore, density of communication networks was positively related to the age of nursing staff of the units. Multilevel analyses showed that job satisfaction differed significantly between individual staff members and units and was influenced by the number of nursing staff of the units. However, this relationship disappeared when density of communication networks was added to the model. Overall, communication and advice networks of nursing staff in long-term care are relatively dense. This fits with the high level of cooperation that is needed to provide good care to residents. Social networks are more dense in small units and are also shaped by characteristics of staff members. The results furthermore show that communication networks are important for staff's job satisfaction.

Communication, advice exchange and job satisfaction of nursing staff: a social network analyses of 35 long-term care units

PubMed Central

2011-01-01

Background The behaviour of individuals is affected by the social networks in which they are embedded. Networks are also important for the diffusion of information and the influence of employees in organisations. Yet, at the moment little is known about the social networks of nursing staff in healthcare settings. This is the first study that investigates informal communication and advice networks of nursing staff in long-term care. We examine the structure of the networks, how they are related to the size of units and characteristics of nursing staff, and their relationship with job satisfaction. Methods We collected social network data of 380 nursing staff of 35 units in group projects and psychogeriatric units in nursing homes and residential homes in the Netherlands. Communication and advice networks were analyzed in a social network application (UCINET), focusing on the number of contacts (density) between nursing staff on the units. We then studied the correlation between the density of networks, size of the units and characteristics of nursing staff. We used multilevel analyses to investigate the relationship between social networks and job satisfaction of nursing staff, taking characteristics of units and nursing staff into account. Results Both communication and advice networks were negatively related to the number of residents and the number of nursing staff of the units. Communication and advice networks were more dense when more staff worked part-time. Furthermore, density of communication networks was positively related to the age of nursing staff of the units. Multilevel analyses showed that job satisfaction differed significantly between individual staff members and units and was influenced by the number of nursing staff of the units. However, this relationship disappeared when density of communication networks was added to the model. Conclusions Overall, communication and advice networks of nursing staff in long-term care are relatively dense. This fits with the high level of cooperation that is needed to provide good care to residents. Social networks are more dense in small units and are also shaped by characteristics of staff members. The results furthermore show that communication networks are important for staff's job satisfaction. PMID:21631936

Packet communications in satellites with multiple-beam antennas and signal processing

NASA Technical Reports Server (NTRS)

Davies, R.; Chethik, F.; Penick, M.

1980-01-01

A communication satellite with a multiple-beam antenna and onboard signal processing is considered for use in a 'message-switched' data relay system. The signal processor may incorporate demodulation, routing, storage, and remodulation of the data. A system user model is established and key functional elements for the signal processing are identified. With the throughput and delay requirements as the controlled variables, the hardware complexity, operational discipline, occupied bandwidth, and overall user end-to-end cost are estimated for (1) random-access packet switching; and (2) reservation-access packet switching. Other aspects of this network (eg, the adaptability to channel switched traffic requirements) are examined. For the given requirements and constraints, the reservation system appears to be the most attractive protocol.

Jana: Confidential Communications on Social Networks

DTIC Science & Technology

2017-08-09

Report: Jana: Confidential Communications on Social Networks The views, opinions and/or findings contained in this report are those of the author(s) and...Confidential Communications on Social Networks Report Term: 0-Other Email: krish@ucr.edu Distribution Statement: 1-Approved for public release; distribution...is unlimited. Major Goals: The inability of users to communicate secretly on online social networking (OSN) platforms is a key obstacle to overcome

The Virtual Research and Extension Communication Network (VRECN): An Interactive Learning and Communication Network for Research and Extension Personnel. Concept Paper for the Food & Agriculture Organisation of the United Nations (FAO).

ERIC Educational Resources Information Center

Richardson, Don

A Virtual Research and Extension Communication Network (VRECN) is a set of networked electronic tools facilitating improvement in communication processes and information sharing among stakeholders involved in agricultural development. In developing countries, research and extension personnel within a ministry of agriculture, in consultation and…

Final Environmental Assessment for Wide Area Coverage Construct Land Mobile Network Communications Infrastructure Malmstrom Air Force Base, Montana

DTIC Science & Technology

2008-02-01

FINAL ENVIRONMENTAL ASSESSMENT February 2008 Malmstrom ® AFB WIDE AREA COVERAGE CONSTRUCT LAND MOBILE NETWORK COMMUNICATIONS INFRASTRUCTURE...Wide Area Coverage Construct Land Mobile Network Communications Infrastructure Malmstrom Air Force Base, Montana 5a. CONTRACT NUMBER 5b. GRANT...SIGNIFICANT IMPACT WIDE AREA COVERAGE CONSTRUCT LAND MOBILE NETWORK COMMUNICATIONS INFRASTRUCTURE MALMSTROM AIR FORCE BASE, MONTANA The

High-Performance Satellite/Terrestrial-Network Gateway

NASA Technical Reports Server (NTRS)

Beering, David R.

2005-01-01

A gateway has been developed to enable digital communication between (1) the high-rate receiving equipment at NASA's White Sands complex and (2) a standard terrestrial digital communication network at data rates up to 622 Mb/s. The design of this gateway can also be adapted for use in commercial Earth/satellite and digital communication networks, and in terrestrial digital communication networks that include wireless subnetworks. Gateway as used here signifies an electronic circuit that serves as an interface between two electronic communication networks so that a computer (or other terminal) on one network can communicate with a terminal on the other network. The connection between this gateway and the high-rate receiving equipment is made via a synchronous serial data interface at the emitter-coupled-logic (ECL) level. The connection between this gateway and a standard asynchronous transfer mode (ATM) terrestrial communication network is made via a standard user network interface with a synchronous optical network (SONET) connector. The gateway contains circuitry that performs the conversion between the ECL and SONET interfaces. The data rate of the SONET interface can be either 155.52 or 622.08 Mb/s. The gateway derives its clock signal from a satellite modem in the high-rate receiving equipment and, hence, is agile in the sense that it adapts to the data rate of the serial interface.

Robust Networking Architecture and Secure Communication Scheme for Heterogeneous Wireless Sensor Networks

ERIC Educational Resources Information Center

McNeal, McKenzie, III.

2012-01-01

Current networking architectures and communication protocols used for Wireless Sensor Networks (WSNs) have been designed to be energy efficient, low latency, and long network lifetime. One major issue that must be addressed is the security in data communication. Due to the limited capabilities of low cost and small sized sensor nodes, designing…

Scalable Hierarchical Network Management System for Displaying Network Information in Three Dimensions

NASA Technical Reports Server (NTRS)

George, Jude (Inventor); Schlecht, Leslie (Inventor); McCabe, James D. (Inventor); LeKashman, John Jr. (Inventor)

1998-01-01

A network management system has SNMP agents distributed at one or more sites, an input output module at each site, and a server module located at a selected site for communicating with input output modules, each of which is configured for both SNMP and HNMP communications. The server module is configured exclusively for HNMP communications, and it communicates with each input output module according to the HNMP. Non-iconified, informationally complete views are provided of network elements to aid in network management.

DNET: A communications facility for distributed heterogeneous computing

NASA Technical Reports Server (NTRS)

Tole, John; Nagappan, S.; Clayton, J.; Ruotolo, P.; Williamson, C.; Solow, H.

1989-01-01

This document describes DNET, a heterogeneous data communications networking facility. DNET allows programs operating on hosts on dissimilar networks to communicate with one another without concern for computer hardware, network protocol, or operating system differences. The overall DNET network is defined as the collection of host machines/networks on which the DNET software is operating. Each underlying network is considered a DNET 'domain'. Data communications service is provided between any two processes on any two hosts on any of the networks (domains) that may be reached via DNET. DNET provides protocol transparent, reliable, streaming data transmission between hosts (restricted, initially to DECnet and TCP/IP networks). DNET also provides variable length datagram service with optional return receipts.

Unified Approach to Modeling and Simulation of Space Communication Networks and Systems

NASA Technical Reports Server (NTRS)

Barritt, Brian; Bhasin, Kul; Eddy, Wesley; Matthews, Seth

2010-01-01

Network simulator software tools are often used to model the behaviors and interactions of applications, protocols, packets, and data links in terrestrial communication networks. Other software tools that model the physics, orbital dynamics, and RF characteristics of space systems have matured to allow for rapid, detailed analysis of space communication links. However, the absence of a unified toolset that integrates the two modeling approaches has encumbered the systems engineers tasked with the design, architecture, and analysis of complex space communication networks and systems. This paper presents the unified approach and describes the motivation, challenges, and our solution - the customization of the network simulator to integrate with astronautical analysis software tools for high-fidelity end-to-end simulation. Keywords space; communication; systems; networking; simulation; modeling; QualNet; STK; integration; space networks

Real-Time Communication Support for Underwater Acoustic Sensor Networks †.

PubMed

Santos, Rodrigo; Orozco, Javier; Micheletto, Matias; Ochoa, Sergio F; Meseguer, Roc; Millan, Pere; Molina, And Carlos

2017-07-14

Underwater sensor networks represent an important and promising field of research due to the large diversity of underwater ubiquitous applications that can be supported by these networks, e.g., systems that deliver tsunami and oil spill warnings, or monitor submarine ecosystems. Most of these monitoring and warning systems require real-time communication in wide area networks that have a low density of nodes. The underwater communication medium involved in these networks is very harsh and imposes strong restrictions to the communication process. In this scenario, the real-time transmission of information is done mainly using acoustic signals, since the network nodes are not physically close. The features of the communication scenario and the requirements of the communication process represent major challenges for designers of both, communication protocols and monitoring and warning systems. The lack of models to represent these networks is the main stumbling block for the proliferation of underwater ubiquitous systems. This paper presents a real-time communication model for underwater acoustic sensor networks (UW-ASN) that are designed to cover wide areas with a low density of nodes, using any-to-any communication. This model is analytic, considers two solution approaches for scheduling the real-time messages, and provides a time-constraint analysis for the network performance. Using this model, the designers of protocols and underwater ubiquitous systems can quickly prototype and evaluate their solutions in an evolving way, in order to determine the best solution to the problem being addressed. The suitability of the proposal is illustrated with a case study that shows the performance of a UW-ASN under several initial conditions. This is the first analytic model for representing real-time communication in this type of network, and therefore, it opens the door for the development of underwater ubiquitous systems for several application scenarios.

Real-Time Communication Support for Underwater Acoustic Sensor Networks †

PubMed Central

Santos, Rodrigo; Orozco, Javier; Micheletto, Matias

2017-01-01

Underwater sensor networks represent an important and promising field of research due to the large diversity of underwater ubiquitous applications that can be supported by these networks, e.g., systems that deliver tsunami and oil spill warnings, or monitor submarine ecosystems. Most of these monitoring and warning systems require real-time communication in wide area networks that have a low density of nodes. The underwater communication medium involved in these networks is very harsh and imposes strong restrictions to the communication process. In this scenario, the real-time transmission of information is done mainly using acoustic signals, since the network nodes are not physically close. The features of the communication scenario and the requirements of the communication process represent major challenges for designers of both, communication protocols and monitoring and warning systems. The lack of models to represent these networks is the main stumbling block for the proliferation of underwater ubiquitous systems. This paper presents a real-time communication model for underwater acoustic sensor networks (UW-ASN) that are designed to cover wide areas with a low density of nodes, using any-to-any communication. This model is analytic, considers two solution approaches for scheduling the real-time messages, and provides a time-constraint analysis for the network performance. Using this model, the designers of protocols and underwater ubiquitous systems can quickly prototype and evaluate their solutions in an evolving way, in order to determine the best solution to the problem being addressed. The suitability of the proposal is illustrated with a case study that shows the performance of a UW-ASN under several initial conditions. This is the first analytic model for representing real-time communication in this type of network, and therefore, it opens the door for the development of underwater ubiquitous systems for several application scenarios. PMID:28708093

Computer Networks as a New Data Base.

ERIC Educational Resources Information Center

Beals, Diane E.

1992-01-01

Discusses the use of communication on computer networks as a data source for psychological, social, and linguistic research. Differences between computer-mediated communication and face-to-face communication are described, the Beginning Teacher Computer Network is discussed, and examples of network conversations are appended. (28 references) (LRW)

Communication performance analysis and comparison of two patterns for data exchange between nodes in WorldFIP fieldbus network.

PubMed

Liang, Geng; Wang, Hong; Li, Wen; Li, Dazhong

2010-10-01

Data exchange patterns between nodes in WorldFIP fieldbus network are quite important and meaningful in improving the communication performance of WorldFIP network. Based on the basic communication ways supported in WorldFIP protocol, we propose two patterns for implementation of data exchange between peer nodes over WorldFIP network. Effects on communication performance of WorldFIP network in terms of some network parameters, such as number of bytes in user's data and turn-around time, in both the proposed patterns, are analyzed at length when different network speeds are applied. Such effects with the patterns of periodic message transmission using acknowledged and non-acknowledged messages, are also studied. Communication performance in both the proposed patterns are analyzed and compared. Practical applications of the research are presented. Through the study, it can be seen that different data exchange patterns make a great difference in improving communication efficiency with different network parameters, which is quite useful and helpful in the practical design of distributed systems based on WorldFIP network. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long

2012-03-01

A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

SDN-based path hopping communication against eavesdropping attack

NASA Astrophysics Data System (ADS)

Zhang, Chuanhao; Bu, Youjun; Zhao, Zheng

2016-10-01

Network eavesdropping is one of the most popular means used by cyber attackers, which has been a severe threat to network communication security. Adversaries could capture and analyze network communication data from network nodes or links, monitor network status and steal sensitive data such as username and password etc. Traditional network usually uses static network configuration, and existing defense methods, including firewall, IDS, IPS etc., cannot prevent eavesdropping, which has no distinguishing characteristic. Network eavesdropping become silent during most of the time of the attacking process, which is why it is difficult to discover and to defend. But A successful eavesdropping attack also has its' precondition, which is the target path should be relatively stable and has enough time of duration. So, In order to resolve this problem, it has to work on the network architecture. In this paper, a path hopping communication(PHC) mechanism based on Software Define Network (SDN) was proposed to solve this problem. In PHC, Ends in communication packets as well as the routing paths were changed dynamically. Therefore, the traffic would be distributed to multiple flows and transmitted along different paths. so that Network eavesdropping attack could be prevented effectively. It was concluded that PHC was able to increase the overhead of Network eavesdropping, as well as the difficulty of communication data recovery.

Communicative social capital and collective efficacy as determinants of access to health-enhancing resources in residential communities.

PubMed

Matsaganis, Matthew D; Wilkin, Holley A

2015-04-01

This article contributes to the burgeoning literature on the social determinants of health disparities. The authors investigate how communication resources and collective efficacy, independently and in combination, shape residents' access to health enhancing resources (including healthcare services, sources of healthier food options, and public recreation spaces) in their communities. Using random digit dial telephone survey data from 833 residents of South Los Angeles communities the authors show that communicative social capital-that is, an information and problem-solving resource that accrues to residents as they become more integrated into their local communication network of neighbors, community organizations, and local media-plays a significant role in access to health resources. This relationship is complicated by individuals' health insurance and health status, as communicative social capital magnifies the sense of absence of resources for those who are in worse health and lack insurance. Communicative social capital builds collective efficacy, which is positively related to access to health-enhancing resources, but it also mediates the negative relationship between communicative social capital and access to health resources. Residents with richer stores of communicative social capital and collective efficacy report better access to health resources. The authors conclude with a discussion of implications of these findings and suggestions for future research.

78 FR 55096 - Certain Point-to-Point Network Communication Devices and Products Containing Same; Institution of...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-09

... INTERNATIONAL TRADE COMMISSION [Investigation No. 337-TA-892] Certain Point-to-Point Network... sale within the United States after importation of certain point-to- point network communication... sale within the United States after importation of certain point-to- point network communication...

A Real-time Spectrum Handoff Algorithm for VoIP based Cognitive Radio Networks: Design and Performance Analysis

NASA Astrophysics Data System (ADS)

Chakraborty, Tamal; Saha Misra, Iti

2016-03-01

Secondary Users (SUs) in a Cognitive Radio Network (CRN) face unpredictable interruptions in transmission due to the random arrival of Primary Users (PUs), leading to spectrum handoff or dropping instances. An efficient spectrum handoff algorithm, thus, becomes one of the indispensable components in CRN, especially for real-time communication like Voice over IP (VoIP). In this regard, this paper investigates the effects of spectrum handoff on the Quality of Service (QoS) for VoIP traffic in CRN, and proposes a real-time spectrum handoff algorithm in two phases. The first phase (VAST-VoIP based Adaptive Sensing and Transmission) adaptively varies the channel sensing and transmission durations to perform intelligent dropping decisions. The second phase (ProReact-Proactive and Reactive Handoff) deploys efficient channel selection mechanisms during spectrum handoff for resuming communication. Extensive performance analysis in analytical and simulation models confirms a decrease in spectrum handoff delay for VoIP SUs by more than 40% and 60%, compared to existing proactive and reactive algorithms, respectively and ensures a minimum 10% reduction in call-dropping probability with respect to the previous works in this domain. The effective SU transmission duration is also maximized under the proposed algorithm, thereby making it suitable for successful VoIP communication.

Cooperative UAV-Based Communications Backbone for Sensor Networks

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

Roberts, R S

2001-10-07

The objective of this project is to investigate the use of unmanned air vehicles (UAVs) as mobile, adaptive communications backbones for ground-based sensor networks. In this type of network, the UAVs provide communication connectivity to sensors that cannot communicate with each other because of terrain, distance, or other geographical constraints. In these situations, UAVs provide a vertical communication path for the sensors, thereby mitigating geographic obstacles often imposed on networks. With the proper use of UAVs, connectivity to a widely disbursed sensor network in rugged terrain is readily achieved. Our investigation has focused on networks where multiple cooperating UAVs aremore » used to form a network backbone. The advantage of using multiple UAVs to form the network backbone is parallelization of sensor connectivity. Many widely spaced or isolated sensors can be connected to the network at once using this approach. In these networks, the UAVs logically partition the sensor network into sub-networks (subnets), with one UAV assigned per subnet. Partitioning the network into subnets allows the UAVs to service sensors in parallel thereby decreasing the sensor-to-network connectivity. A UAV services sensors in its subnet by flying a route (path) through the subnet, uplinking data collected by the sensors, and forwarding the data to a ground station. An additional advantage of using multiple UAVs in the network is that they provide redundancy in the communications backbone, so that the failure of a single UAV does not necessarily imply the loss of the network.« less

Spatial-Temporal Data Collection with Compressive Sensing in Mobile Sensor Networks

PubMed Central

Li, Jiayin; Guo, Wenzhong; Chen, Zhonghui; Xiong, Neal

2017-01-01

Compressive sensing (CS) provides an energy-efficient paradigm for data gathering in wireless sensor networks (WSNs). However, the existing work on spatial-temporal data gathering using compressive sensing only considers either multi-hop relaying based or multiple random walks based approaches. In this paper, we exploit the mobility pattern for spatial-temporal data collection and propose a novel mobile data gathering scheme by employing the Metropolis-Hastings algorithm with delayed acceptance, an improved random walk algorithm for a mobile collector to collect data from a sensing field. The proposed scheme exploits Kronecker compressive sensing (KCS) for spatial-temporal correlation of sensory data by allowing the mobile collector to gather temporal compressive measurements from a small subset of randomly selected nodes along a random routing path. More importantly, from the theoretical perspective we prove that the equivalent sensing matrix constructed from the proposed scheme for spatial-temporal compressible signal can satisfy the property of KCS models. The simulation results demonstrate that the proposed scheme can not only significantly reduce communication cost but also improve recovery accuracy for mobile data gathering compared to the other existing schemes. In particular, we also show that the proposed scheme is robust in unreliable wireless environment under various packet losses. All this indicates that the proposed scheme can be an efficient alternative for data gathering application in WSNs. PMID:29117152

Spatial-Temporal Data Collection with Compressive Sensing in Mobile Sensor Networks.

PubMed

Zheng, Haifeng; Li, Jiayin; Feng, Xinxin; Guo, Wenzhong; Chen, Zhonghui; Xiong, Neal

2017-11-08

Compressive sensing (CS) provides an energy-efficient paradigm for data gathering in wireless sensor networks (WSNs). However, the existing work on spatial-temporal data gathering using compressive sensing only considers either multi-hop relaying based or multiple random walks based approaches. In this paper, we exploit the mobility pattern for spatial-temporal data collection and propose a novel mobile data gathering scheme by employing the Metropolis-Hastings algorithm with delayed acceptance, an improved random walk algorithm for a mobile collector to collect data from a sensing field. The proposed scheme exploits Kronecker compressive sensing (KCS) for spatial-temporal correlation of sensory data by allowing the mobile collector to gather temporal compressive measurements from a small subset of randomly selected nodes along a random routing path. More importantly, from the theoretical perspective we prove that the equivalent sensing matrix constructed from the proposed scheme for spatial-temporal compressible signal can satisfy the property of KCS models. The simulation results demonstrate that the proposed scheme can not only significantly reduce communication cost but also improve recovery accuracy for mobile data gathering compared to the other existing schemes. In particular, we also show that the proposed scheme is robust in unreliable wireless environment under various packet losses. All this indicates that the proposed scheme can be an efficient alternative for data gathering application in WSNs .

Social capital calculations in economic systems: Experimental study

NASA Astrophysics Data System (ADS)

Chepurov, E. G.; Berg, D. B.; Zvereva, O. M.; Nazarova, Yu. Yu.; Chekmarev, I. V.

2017-11-01

The paper describes the social capital study for a system where actors are engaged in an economic activity. The focus is on the analysis of communications structural parameters (transactions) between the actors. Comparison between transaction network graph structure and the structure of a random Bernoulli graph of the same dimension and density allows revealing specific structural features of the economic system under study. Structural analysis is based on SNA-methodology (SNA - Social Network Analysis). It is shown that structural parameter values of the graph formed by agent relationship links may well characterize different aspects of the social capital structure. The research advocates that it is useful to distinguish the difference between each agent social capital and the whole system social capital.

Multipartite entanglement verification resistant against dishonest parties.

PubMed

Pappa, Anna; Chailloux, André; Wehner, Stephanie; Diamanti, Eleni; Kerenidis, Iordanis

2012-06-29

Future quantum information networks will consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and, hence, it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this Letter, we show how an agent of a quantum network can perform a distributed verification of a source creating multipartite Greenberger-Horne-Zeilinger (GHZ) states with minimal resources, which is, nevertheless, resistant against any number of dishonest parties. Moreover, we provide a tight tradeoff between the level of security and the distance between the state produced by the source and the ideal GHZ state. Last, by adding the resource of a trusted common random source, we can further provide security guarantees for all honest parties in the quantum network simultaneously.

Mass storage technology in networks

NASA Astrophysics Data System (ADS)

Ishii, Katsunori; Takeda, Toru; Itao, Kiyoshi; Kaneko, Reizo

1990-08-01

Trends and features of mass storage subsystems in network are surveyed and their key technologies spotlighted. Storage subsystems are becoming increasingly important in new network systems in which communications and data processing are systematically combined. These systems require a new class of high-performance mass-information storage in order to effectively utilize their processing power. The requirements of high transfer rates, high transactional rates and large storage capacities, coupled with high functionality, fault tolerance and flexibility in configuration, are major challenges in storage subsystems. Recent progress in optical disk technology has resulted in improved performance of on-line external memories to optical disk drives, which are competing with mid-range magnetic disks. Optical disks are more effective than magnetic disks in using low-traffic random-access file storing multimedia data that requires large capacity, such as in archive use and in information distribution use by ROM disks. Finally, it demonstrates image coded document file servers for local area network use that employ 130mm rewritable magneto-optical disk subsystems.

A Novel Deployment Scheme Based on Three-Dimensional Coverage Model for Wireless Sensor Networks

PubMed Central

Xiao, Fu; Yang, Yang; Wang, Ruchuan; Sun, Lijuan

2014-01-01

Coverage pattern and deployment strategy are directly related to the optimum allocation of limited resources for wireless sensor networks, such as energy of nodes, communication bandwidth, and computing power, and quality improvement is largely determined by these for wireless sensor networks. A three-dimensional coverage pattern and deployment scheme are proposed in this paper. Firstly, by analyzing the regular polyhedron models in three-dimensional scene, a coverage pattern based on cuboids is proposed, and then relationship between coverage and sensor nodes' radius is deduced; also the minimum number of sensor nodes to maintain network area's full coverage is calculated. At last, sensor nodes are deployed according to the coverage pattern after the monitor area is subdivided into finite 3D grid. Experimental results show that, compared with traditional random method, sensor nodes number is reduced effectively while coverage rate of monitor area is ensured using our coverage pattern and deterministic deployment scheme. PMID:25045747

Adaptive feedback synchronisation of complex dynamical network with discrete-time communications and delayed nodes

NASA Astrophysics Data System (ADS)

Wang, Tong; Ding, Yongsheng; Zhang, Lei; Hao, Kuangrong

2016-08-01

This paper considered the synchronisation of continuous complex dynamical networks with discrete-time communications and delayed nodes. The nodes in the dynamical networks act in the continuous manner, while the communications between nodes are discrete-time; that is, they communicate with others only at discrete time instants. The communication intervals in communication period can be uncertain and variable. By using a piecewise Lyapunov-Krasovskii function to govern the characteristics of the discrete communication instants, we investigate the adaptive feedback synchronisation and a criterion is derived to guarantee the existence of the desired controllers. The globally exponential synchronisation can be achieved by the controllers under the updating laws. Finally, two numerical examples including globally coupled network and nearest-neighbour coupled networks are presented to demonstrate the validity and effectiveness of the proposed control scheme.

User Needs and Advances in Space Wireless Sensing and Communications

NASA Technical Reports Server (NTRS)

Kegege, Obadiah

2017-01-01

Decades of space exploration and technology trends for future missions show the need for new approaches in space/planetary sensor networks, observatories, internetworking, and communications/data delivery to Earth. The User Needs to be discussed in this talk includes interviews with several scientists and reviews of mission concepts for the next generation of sensors, observatories, and planetary surface missions. These observatories, sensors are envisioned to operate in extreme environments, with advanced autonomy, whereby sometimes communication to Earth is intermittent and delayed. These sensor nodes require software defined networking capabilities in order to learn and adapt to the environment, collect science data, internetwork, and communicate. Also, some user cases require the level of intelligence to manage network functions (either as a host), mobility, security, and interface data to the physical radio/optical layer. For instance, on a planetary surface, autonomous sensor nodes would create their own ad-hoc network, with some nodes handling communication capabilities between the wireless sensor networks and orbiting relay satellites. A section of this talk will cover the advances in space communication and internetworking to support future space missions. NASA's Space Communications and Navigation (SCaN) program continues to evolve with the development of optical communication, a new vision of the integrated network architecture with more capabilities, and the adoption of CCSDS space internetworking protocols. Advances in wireless communications hardware and electronics have enabled software defined networking (DVB-S2, VCM, ACM, DTN, Ad hoc, etc.) protocols for improved wireless communication and network management. Developing technologies to fulfil these user needs for wireless communications and adoption of standardized communication/internetworking protocols will be a huge benefit to future planetary missions, space observatories, and manned missions to other planets.

Research on an uplink carrier sense multiple access algorithm of large indoor visible light communication networks based on an optical hard core point process.

PubMed

Nan, Zhufen; Chi, Xuefen

2016-12-20

The IEEE 802.15.7 protocol suggests that it could coordinate the channel access process based on the competitive method of carrier sensing. However, the directionality of light and randomness of diffuse reflection would give rise to a serious imperfect carrier sense (ICS) problem [e.g., hidden node (HN) problem and exposed node (EN) problem], which brings great challenges in realizing the optical carrier sense multiple access (CSMA) mechanism. In this paper, the carrier sense process implemented by diffuse reflection light is modeled as the choice of independent sets. We establish an ICS model with the presence of ENs and HNs for the multi-point to multi-point visible light communication (VLC) uplink communications system. Considering the severe optical ICS problem, an optical hard core point process (OHCPP) is developed, which characterizes the optical CSMA for the indoor VLC uplink communications system. Due to the limited coverage of the transmitted optical signal, in our OHCPP, the ENs within the transmitters' carrier sense region could be retained provided that they could not corrupt the ongoing communications. Moreover, because of the directionality of both light emitting diode (LED) transmitters and receivers, theoretical analysis of the HN problem becomes difficult. In this paper, we derive the closed-form expression for approximating the outage probability and transmission capacity of VLC networks with the presence of HNs and ENs. Simulation results validate the analysis and also show the existence of an optimal physical carrier-sensing threshold that maximizes the transmission capacity for a given emission angle of LED.

2D wireless sensor network deployment based on Centroidal Voronoi Tessellation

NASA Astrophysics Data System (ADS)

Iliodromitis, Athanasios; Pantazis, George; Vescoukis, Vasileios

2017-06-01

In recent years, Wireless Sensor Networks (WSNs) have rapidly evolved and now comprise a powerful tool in monitoring and observation of the natural environment, among other fields. The use of WSNs is critical in early warning systems, which are of high importance today. In fact, WSNs are adopted more and more in various applications, e.g. for fire or deformation detection. The optimum deployment of sensors is a multi-dimensional problem, which has two main components; network and positioning approach. Although lots of work has dealt with the issue, most of it emphasizes on mere network approach (communication, energy consumption) and not on the topography (positioning) of the sensors in achieving ideal geometry. In some cases, it is hard or even impossible to achieve perfect geometry in nodes' deployment. The ideal and desirable scenario of nodes arranged in square or hexagonal grid would raise extremely the cost of the network, especially in unfriendly or hostile environments. In such environments the positions of the sensors have to be chosen among a list of possible points, which in most cases are randomly distributed. This constraint has to be taken under consideration during the WSN planning. Full geographical coverage is in some applications of the same, if not of greater, importance than the network coverage. Cost is a crucial factor at network planning and given that resources are often limited, what matters, is to cover the whole area with the minimum number of sensors. This paper suggests a deployment method for nodes, in large scale and high density WSNs, based on Centroidal Voronoi Tessellation (CVT). It approximates the solution through the geometry of the random points and proposes a deployment plan, for the given characteristics of the study area, in order to achieve a deployment as near as possible to the ideal one.

Information Spread of Emergency Events: Path Searching on Social Networks

PubMed Central

Hu, Hongzhi; Wu, Tunan

2014-01-01

Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning. PMID:24600323

Reliable Adaptive Video Streaming Driven by Perceptual Semantics for Situational Awareness

PubMed Central

Pimentel-Niño, M. A.; Saxena, Paresh; Vazquez-Castro, M. A.

2015-01-01

A novel cross-layer optimized video adaptation driven by perceptual semantics is presented. The design target is streamed live video to enhance situational awareness in challenging communications conditions. Conventional solutions for recreational applications are inadequate and novel quality of experience (QoE) framework is proposed which allows fully controlled adaptation and enables perceptual semantic feedback. The framework relies on temporal/spatial abstraction for video applications serving beyond recreational purposes. An underlying cross-layer optimization technique takes into account feedback on network congestion (time) and erasures (space) to best distribute available (scarce) bandwidth. Systematic random linear network coding (SRNC) adds reliability while preserving perceptual semantics. Objective metrics of the perceptual features in QoE show homogeneous high performance when using the proposed scheme. Finally, the proposed scheme is in line with content-aware trends, by complying with information-centric-networking philosophy and architecture. PMID:26247057

Technology forecasting for space communication. [analysis of systems for application to Spacecraft Data and Tracking Network

NASA Technical Reports Server (NTRS)

1973-01-01

A study was conducted to determine techniques for application to space communication. The subjects considered are as follows: (1) optical communication systems, (2) laser communications for data acquisition networks, (3) spacecraft data rate requirements, (4) telemetry, command, and data handling, (5) spacecraft tracking and data network antenna and preamplifier cost tradeoff study, and (6) spacecraft communication terminal evaluation.

Semi-metric analysis of the functional brain network: Relationship with familial risk for psychotic disorder

PubMed Central

Peeters, Sanne; Simas, Tiago; Suckling, John; Gronenschild, Ed; Patel, Ameera; Habets, Petra; van Os, Jim; Marcelis, Machteld

2015-01-01

Background Dysconnectivity in schizophrenia can be understood in terms of dysfunctional integration of a distributed network of brain regions. Here we propose a new methodology to analyze complex networks based on semi-metric behavior, whereby higher levels of semi-metricity may represent a higher level of redundancy and dispersed communication. It was hypothesized that individuals with (increased risk for) psychotic disorder would have more semi-metric paths compared to controls and that this would be associated with symptoms. Methods Resting-state functional MRI scans were obtained from 73 patients with psychotic disorder, 83 unaffected siblings and 72 controls. Semi-metric percentages (SMP) at the whole brain, hemispheric and lobar level were the dependent variables in a multilevel random regression analysis to investigate group differences. SMP was further examined in relation to symptomatology (i.e., psychotic/cognitive symptoms). Results At the whole brain and hemispheric level, patients had a significantly higher SMP compared to siblings and controls, with no difference between the latter. In the combined sibling and control group, individuals with high schizotypy had intermediate SMP values in the left hemisphere with respect to patients and individuals with low schizotypy. Exploratory analyses in patients revealed higher SMP in 12 out of 42 lobar divisions compared to controls, of which some were associated with worse PANSS symptomatology (i.e., positive symptoms, excitement and emotional distress) and worse cognitive performance on attention and emotion processing tasks. In the combined group of patients and controls, working memory, attention and social cognition were associated with higher SMP. Discussion The results are suggestive of more dispersed network communication in patients with psychotic disorder, with some evidence for trait-based network alterations in high-schizotypy individuals. Dispersed communication may contribute to the clinical phenotype in psychotic disorder. In addition, higher SMP may contribute to neuro- and social cognition, independent of psychosis risk. PMID:26740914

A cross-domain communication resource scheduling method for grid-enabled communication networks

NASA Astrophysics Data System (ADS)

Zheng, Xiangquan; Wen, Xiang; Zhang, Yongding

2011-10-01

To support a wide range of different grid applications in environments where various heterogeneous communication networks coexist, it is important to enable advanced capabilities in on-demand and dynamical integration and efficient co-share with cross-domain heterogeneous communication resource, thus providing communication services which are impossible for single communication resource to afford. Based on plug-and-play co-share and soft integration with communication resource, Grid-enabled communication network is flexibly built up to provide on-demand communication services for gird applications with various requirements on quality of service. Based on the analysis of joint job and communication resource scheduling in grid-enabled communication networks (GECN), this paper presents a cross multi-domain communication resource cooperatively scheduling method and describes the main processes such as traffic requirement resolution for communication services, cross multi-domain negotiation on communication resource, on-demand communication resource scheduling, and so on. The presented method is to afford communication service capability to cross-domain traffic delivery in GECNs. Further research work towards validation and implement of the presented method is pointed out at last.

Synchronization of random bit generators based on coupled chaotic lasers and application to cryptography.

PubMed

Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang

2010-08-16

Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs.

1-RAAP: An Efficient 1-Round Anonymous Authentication Protocol for Wireless Body Area Networks

PubMed Central

Liu, Jingwei; Zhang, Lihuan; Sun, Rong

2016-01-01

Thanks to the rapid technological convergence of wireless communications, medical sensors and cloud computing, Wireless Body Area Networks (WBANs) have emerged as a novel networking paradigm enabling ubiquitous Internet services, allowing people to receive medical care, monitor health status in real-time, analyze sports data and even enjoy online entertainment remotely. However, because of the mobility and openness of wireless communications, WBANs are inevitably exposed to a large set of potential attacks, significantly undermining their utility and impeding their widespread deployment. To prevent attackers from threatening legitimate WBAN users or abusing WBAN services, an efficient and secure authentication protocol termed 1-Round Anonymous Authentication Protocol (1-RAAP) is proposed in this paper. In particular, 1-RAAP preserves anonymity, mutual authentication, non-repudiation and some other desirable security properties, while only requiring users to perform several low cost computational operations. More importantly, 1-RAAP is provably secure thanks to its design basis, which is resistant to the anonymous in the random oracle model. To validate the computational efficiency of 1-RAAP, a set of comprehensive comparative studies between 1-RAAP and other authentication protocols is conducted, and the results clearly show that 1-RAAP achieves the best performance in terms of computational overhead. PMID:27213384

1-RAAP: An Efficient 1-Round Anonymous Authentication Protocol for Wireless Body Area Networks.

PubMed

Liu, Jingwei; Zhang, Lihuan; Sun, Rong

2016-05-19

Thanks to the rapid technological convergence of wireless communications, medical sensors and cloud computing, Wireless Body Area Networks (WBANs) have emerged as a novel networking paradigm enabling ubiquitous Internet services, allowing people to receive medical care, monitor health status in real-time, analyze sports data and even enjoy online entertainment remotely. However, because of the mobility and openness of wireless communications, WBANs are inevitably exposed to a large set of potential attacks, significantly undermining their utility and impeding their widespread deployment. To prevent attackers from threatening legitimate WBAN users or abusing WBAN services, an efficient and secure authentication protocol termed 1-Round Anonymous Authentication Protocol (1-RAAP) is proposed in this paper. In particular, 1-RAAP preserves anonymity, mutual authentication, non-repudiation and some other desirable security properties, while only requiring users to perform several low cost computational operations. More importantly, 1-RAAP is provably secure thanks to its design basis, which is resistant to the anonymous in the random oracle model. To validate the computational efficiency of 1-RAAP, a set of comprehensive comparative studies between 1-RAAP and other authentication protocols is conducted, and the results clearly show that 1-RAAP achieves the best performance in terms of computational overhead.

A vision of network-centric military communications

NASA Astrophysics Data System (ADS)

Conklin, Ross, Jr.; Burbank, Jack; Nichols, Robert, Jr.

2005-05-01

This paper presents a vision for a future capability-based military communications system that considers user requirements. Historically, the military has developed and fielded many specialized communications systems. While these systems solved immediate communications problems, they were not designed to operate with other systems. As information has become more important to the execution of war, the "stove-pipe" nature of the communications systems deployed by the military is no longer acceptable. Realizing this, the military has begun the transformation of communications to a network-centric communications paradigm. However, the specialized communications systems were developed in response to the widely varying environments related to military communications. These environments, and the necessity for effective communications within these environments, do not disappear under the network-centric paradigm. In fact, network-centric communications allows for one message to cross many of these environments by transiting multiple networks. The military would also like one communications approach that is capable of working well in multiple environments. This paper presents preliminary work on the creation of a framework that allows for a reconfigurable device that is capable of adapting to the physical and network environments. The framework returns to the Open Systems Interconnect (OSI) architecture with the addition of a standardized intra-layer control interface for control information exchange, a standardized data interface and a proposed device architecture based on the software radio.

A new way to improve the robustness of complex communication networks by allocating redundancy links

NASA Astrophysics Data System (ADS)

Shi, Chunhui; Peng, Yunfeng; Zhuo, Yue; Tang, Jieying; Long, Keping

2012-03-01

We investigate the robustness of complex communication networks on allocating redundancy links. The protecting key nodes (PKN) strategy is proposed to improve the robustness of complex communication networks against intentional attack. Our numerical simulations show that allocating a few redundant links among key nodes using the PKN strategy will significantly increase the robustness of scale-free complex networks. We have also theoretically proved and demonstrated the effectiveness of the PKN strategy. We expect that our work will help achieve a better understanding of communication networks.

Do learning collaboratives strengthen communication? A comparison of organizational team communication networks over time.

PubMed

Bunger, Alicia C; Lengnick-Hall, Rebecca

Collaborative learning models were designed to support quality improvements, such as innovation implementation by promoting communication within organizational teams. Yet the effect of collaborative learning approaches on organizational team communication during implementation is untested. The aim of this study was to explore change in communication patterns within teams from children's mental health organizations during a year-long learning collaborative focused on implementing a new treatment. We adopt a social network perspective to examine intraorganizational communication within each team and assess change in (a) the frequency of communication among team members, (b) communication across organizational hierarchies, and (c) the overall structure of team communication networks. A pretest-posttest design compared communication among 135 participants from 21 organizational teams at the start and end of a learning collaborative. At both time points, participants were asked to list the members of their team and rate the frequency of communication with each along a 7-point Likert scale. Several individual, pair-wise, and team level communication network metrics were calculated and compared over time. At the individual level, participants reported communicating with more team members by the end of the learning collaborative. Cross-hierarchical communication did not change. At the team level, these changes manifested differently depending on team size. In large teams, communication frequency increased, and networks grew denser and slightly less centralized. In small teams, communication frequency declined, growing more sparse and centralized. Results suggest that team communication patterns change minimally but evolve differently depending on size. Learning collaboratives may be more helpful for enhancing communication among larger teams; thus, managers might consider selecting and sending larger staff teams to learning collaboratives. This study highlights key future research directions that can disentangle the relationship between learning collaboratives and team networks.

Advanced information society(5)

NASA Astrophysics Data System (ADS)

Tanizawa, Ippei

Based on the advancement of information network technology information communication forms informationalized society giving significant impact on business activities and life style in it. The information network has been backed up technologically by development of computer technology and has got great contribution by enhanced computer technology and communication equipments. Information is transferred by digital and analog methods. Technical development which has brought out multifunctioned modems of communication equipments in analog mode, and construction of advanced information communication network which has come out by joint work of computer and communication under digital technique, are described. The trend in institutional matter and standardization of electrical communication is also described showing some examples of value-added network (VAN).

Improving Latino disaster preparedness using social networks.

PubMed

Eisenman, David P; Glik, Deborah; Gonzalez, Lupe; Maranon, Richard; Zhou, Qiong; Tseng, Chi-Hong; Asch, Steven M

2009-12-01

Culturally targeted, informal social networking approaches to improving disaster preparedness have not been empirically tested. In partnership with community health promoters and the Los Angeles County Department of Public Health, this study tested a disaster preparedness program for Latino households. This study had a community-based, randomized, longitudinal cohort design with two groups and was conducted during February-October 2007. Assessments were made at baseline and 3 months. Analyses were carried out January-October 2008. Community-based study of 231 Latinos living in Los Angeles County. Participants were randomly assigned to attending platicas (small-group discussions led by a health promoter/promotora de salud) or receiving "media" (a culturally tailored mailer). A total of 187 (81.0%) completed the 3-month follow-up. A self-reported disaster preparedness checklist was used. Among participants who did not have emergency water pre-intervention, 93.3% of those in the platica arm had it at follow-up, compared to 66.7% in the media arm (p=0.003). Among participants who did not have food pre-intervention, 91.7% in the platica arm reported it at follow-up, compared to 60.6% in the media arm (p=0.013). Finally, among participants who did not have a family communication plan pre-intervention, 70.4% in the platica arm reported one at follow-up, compared to 42.3% in the media arm (p=0.002). Although both arms improved in stockpiling water and food and creating a communication plan, the platica arm showed greater improvement than the media group.

Hard-to-reach? Using health access status as a way to more effectively target segments of the Latino audience.

PubMed

Wilkin, Holley A; Ball-Rokeach, Sandra J

2011-04-01

Health issues disproportionately affect Latinos, but variations within this ethnic group may mean that some Latinos are harder to reach with health messages than others. This paper introduces a methodology grounded in communication infrastructure theory to better target 'hard-to-reach' audiences. A random digit dialing telephone survey of 739 Latinos living in two Los Angeles communities was conducted. The relationships between health access difficulties and connections to an integrated storytelling network as well as individual health communication source connections were explored. Findings suggest that Latinos who are connected to an integrated storytelling network report marginally greater ease finding healthcare, despite not being any more likely to have insurance or a regular place for healthcare. Latinos who have health access problems tended to rely more upon Spanish-language television for health information. In addition, those without healthcare access problems are more likely to indicate that they use health professionals, the Internet, mainstream TV and printed materials like health pamphlets for health information. The theoretical and methodological contributions of this work, its major findings, implications, limitations and policy guidelines are discussed.

MILCOM '85 - Military Communications Conference, Boston, MA, October 20-23, 1985, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

The present conference on the development status of communications systems in the context of electronic warfare gives attention to topics in spread spectrum code acquisition, digital speech technology, fiber-optics communications, free space optical communications, the networking of HF systems, and applications and evaluation methods for digital speech. Also treated are issues in local area network system design, coding techniques and applications, technology applications for HF systems, receiver technologies, software development status, channel simultion/prediction methods, C3 networking spread spectrum networks, the improvement of communication efficiency and reliability through technical control methods, mobile radio systems, and adaptive antenna arrays. Finally, communications system cost analyses, spread spectrum performance, voice and image coding, switched networks, and microwave GaAs ICs, are considered.

Do online social media cut through the constraints that limit the size of offline social networks?

PubMed Central

Dunbar, R. I. M.

2016-01-01

The social brain hypothesis has suggested that natural social network sizes may have a characteristic size in humans. This is determined in part by cognitive constraints and in part by the time costs of servicing relationships. Online social networking offers the potential to break through the glass ceiling imposed by at least the second of these, potentially enabling us to maintain much larger social networks. This is tested using two separate UK surveys, each randomly stratified by age, gender and regional population size. The data show that the size and range of online egocentric social networks, indexed as the number of Facebook friends, is similar to that of offline face-to-face networks. For one sample, respondents also specified the number of individuals in the inner layers of their network (formally identified as support clique and sympathy group), and these were also similar in size to those observed in offline networks. This suggests that, as originally proposed by the social brain hypothesis, there is a cognitive constraint on the size of social networks that even the communication advantages of online media are unable to overcome. In practical terms, it may reflect the fact that real (as opposed to casual) relationships require at least occasional face-to-face interaction to maintain them. PMID:26909163

Do online social media cut through the constraints that limit the size of offline social networks?

PubMed

Dunbar, R I M

2016-01-01

The social brain hypothesis has suggested that natural social network sizes may have a characteristic size in humans. This is determined in part by cognitive constraints and in part by the time costs of servicing relationships. Online social networking offers the potential to break through the glass ceiling imposed by at least the second of these, potentially enabling us to maintain much larger social networks. This is tested using two separate UK surveys, each randomly stratified by age, gender and regional population size. The data show that the size and range of online egocentric social networks, indexed as the number of Facebook friends, is similar to that of offline face-to-face networks. For one sample, respondents also specified the number of individuals in the inner layers of their network (formally identified as support clique and sympathy group), and these were also similar in size to those observed in offline networks. This suggests that, as originally proposed by the social brain hypothesis, there is a cognitive constraint on the size of social networks that even the communication advantages of online media are unable to overcome. In practical terms, it may reflect the fact that real (as opposed to casual) relationships require at least occasional face-to-face interaction to maintain them.

The impact of capacity growth in national telecommunications networks.

PubMed

Lord, Andrew; Soppera, Andrea; Jacquet, Arnaud

2016-03-06

This paper discusses both UK-based and global Internet data bandwidth growth, beginning with historical data for the BT network. We examine the time variations in consumer behaviour and how this is statistically aggregated into larger traffic loads on national core fibre communications networks. The random nature of consumer Internet behaviour, where very few consumers require maximum bandwidth simultaneously, provides the opportunity for a significant statistical gain. The paper looks at predictions for how this growth might continue over the next 10-20 years, giving estimates for the amount of bandwidth that networks should support in the future. The paper then explains how national networks are designed to accommodate these traffic levels, and the various network roles, including access, metro and core, are described. The physical layer network is put into the context of how the packet and service layers are designed and the applications and location of content are also included in an overall network overview. The specific role of content servers in alleviating core network traffic loads is highlighted. The status of the relevant transmission technologies in the access, metro and core is given, showing that these technologies, with adequate research, should be sufficient to provide bandwidth for consumers in the next 10-20 years. © 2016 The Author(s).

Advanced Communication and Networking Technologies for Mars Exploration

NASA Technical Reports Server (NTRS)

Bhasin, Kul; Hayden, Jeff; Agre, Jonathan R.; Clare, Loren P.; Yan, Tsun-Yee

2001-01-01

Next-generation Mars communications networks will provide communications and navigation services to a wide variety of Mars science vehicles including: spacecraft that are arriving at Mars, spacecraft that are entering and descending in the Mars atmosphere, scientific orbiter spacecraft, spacecraft that return Mars samples to Earth, landers, rovers, aerobots, airplanes, and sensing pods. In the current architecture plans, the communication services will be provided using capabilities deployed on the science vehicles as well as dedicated communication satellites that will together make up the Mars network. This network will evolve as additional vehicles arrive, depart or end their useful missions. Cost savings and increased reliability will result from the ability to share communication services between missions. This paper discusses the basic architecture that is needed to support the Mars Communications Network part of NASA's Space Science Enterprise (SSE) communications architecture. The network may use various networking technologies such as those employed in the terrestrial Internet, as well as special purpose deep-space protocols to move data and commands autonomously between vehicles, at disparate Mars vicinity sites (on the surface or in near-Mars space) and between Mars vehicles and earthbound users. The architecture of the spacecraft on-board local communications is being reconsidered in light of these new networking requirements. The trend towards increasingly autonomous operation of the spacecraft is aimed at reducing the dependence on resource scheduling provided by Earth-based operators and increasing system fault tolerance. However, these benefits will result in increased communication and software development requirements. As a result, the envisioned Mars communications infrastructure requires both hardware and protocol technology advancements. This paper will describe a number of the critical technology needs and some of the ongoing research activities.

Capacity on wireless quantum cellular communication system

NASA Astrophysics Data System (ADS)

Zhou, Xiang-Zhen; Yu, Xu-Tao; Zhang, Zai-Chen

2018-03-01

Quantum technology is making excellent prospects in future communication networks. Entanglement generation and purification are two major components in quantum networks. Combining these two techniques with classical cellular mobile communication, we proposed a novel wireless quantum cellular(WQC) communication system which is possible to realize commercial mobile quantum communication. In this paper, the architecture and network topology of WQC communication system are discussed, the mathematical model of WQC system is extracted and the serving capacity, indicating the ability to serve customers, is defined and calculated under certain circumstances.

Heterogeneous Spacecraft Networks

NASA Technical Reports Server (NTRS)

Nakamura, Yosuke (Inventor); Faber, Nicolas T. (Inventor); Frost, Chad R. (Inventor); Alena, Richard L. (Inventor)

2018-01-01

The present invention provides a heterogeneous spacecraft network including a network management architecture to facilitate communication between a plurality of operations centers and a plurality of data user communities. The network management architecture includes a plurality of network nodes in communication with the plurality of operations centers. The present invention also provides a method of communication for a heterogeneous spacecraft network. The method includes: transmitting data from a first space segment to a first ground segment; transmitting the data from the first ground segment to a network management architecture; transmitting data from a second space segment to a second ground segment, the second space and ground segments having incompatible communication systems with the first space and ground segments; transmitting the data from the second ground station to the network management architecture; and, transmitting data from the network management architecture to a plurality of data user communities.

Delay and Disruption Tolerant Networking MACHETE Model

NASA Technical Reports Server (NTRS)

Segui, John S.; Jennings, Esther H.; Gao, Jay L.

2011-01-01

To verify satisfaction of communication requirements imposed by unique missions, as early as 2000, the Communications Networking Group at the Jet Propulsion Laboratory (JPL) saw the need for an environment to support interplanetary communication protocol design, validation, and characterization. JPL's Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in Simulator of Space Communication Networks (NPO-41373) NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various commercial, non-commercial, and in-house custom tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. As NASA is expanding its Space Communications and Navigation (SCaN) capabilities to support planned and future missions, building infrastructure to maintain services and developing enabling technologies, an important and broader role is seen for MACHETE in design-phase evaluation of future SCaN architectures. To support evaluation of the developing Delay Tolerant Networking (DTN) field and its applicability for space networks, JPL developed MACHETE models for DTN Bundle Protocol (BP) and Licklider/Long-haul Transmission Protocol (LTP). DTN is an Internet Research Task Force (IRTF) architecture providing communication in and/or through highly stressed networking environments such as space exploration and battlefield networks. Stressed networking environments include those with intermittent (predictable and unknown) connectivity, large and/or variable delays, and high bit error rates. To provide its services over existing domain specific protocols, the DTN protocols reside at the application layer of the TCP/IP stack, forming a store-and-forward overlay network. The key capabilities of the Bundle Protocol include custody-based reliability, the ability to cope with intermittent connectivity, the ability to take advantage of scheduled and opportunistic connectivity, and late binding of names to addresses.

Algorithms for Data Sharing, Coordination, and Communication in Dynamic Network Settings

DTIC Science & Technology

2007-12-03

problems in dynamic networks, focusing on mobile networks with wireless communication. Problems studied include data management, time synchronization ...The discovery of a fundamental limitation in capabilities for time synchronization in large networks. (2) The identification and development of the...Problems studied include data management, time synchronization , communication problems (broadcast, geocast, and point-to-point routing), distributed

Computation and Communication Evaluation of an Authentication Mechanism for Time-Triggered Networked Control Systems

PubMed Central

Martins, Goncalo; Moondra, Arul; Dubey, Abhishek; Bhattacharjee, Anirban; Koutsoukos, Xenofon D.

2016-01-01

In modern networked control applications, confidentiality and integrity are important features to address in order to prevent against attacks. Moreover, network control systems are a fundamental part of the communication components of current cyber-physical systems (e.g., automotive communications). Many networked control systems employ Time-Triggered (TT) architectures that provide mechanisms enabling the exchange of precise and synchronous messages. TT systems have computation and communication constraints, and with the aim to enable secure communications in the network, it is important to evaluate the computational and communication overhead of implementing secure communication mechanisms. This paper presents a comprehensive analysis and evaluation of the effects of adding a Hash-based Message Authentication (HMAC) to TT networked control systems. The contributions of the paper include (1) the analysis and experimental validation of the communication overhead, as well as a scalability analysis that utilizes the experimental result for both wired and wireless platforms and (2) an experimental evaluation of the computational overhead of HMAC based on a kernel-level Linux implementation. An automotive application is used as an example, and the results show that it is feasible to implement a secure communication mechanism without interfering with the existing automotive controller execution times. The methods and results of the paper can be used for evaluating the performance impact of security mechanisms and, thus, for the design of secure wired and wireless TT networked control systems. PMID:27463718

Computation and Communication Evaluation of an Authentication Mechanism for Time-Triggered Networked Control Systems.

PubMed

Martins, Goncalo; Moondra, Arul; Dubey, Abhishek; Bhattacharjee, Anirban; Koutsoukos, Xenofon D

2016-07-25

In modern networked control applications, confidentiality and integrity are important features to address in order to prevent against attacks. Moreover, network control systems are a fundamental part of the communication components of current cyber-physical systems (e.g., automotive communications). Many networked control systems employ Time-Triggered (TT) architectures that provide mechanisms enabling the exchange of precise and synchronous messages. TT systems have computation and communication constraints, and with the aim to enable secure communications in the network, it is important to evaluate the computational and communication overhead of implementing secure communication mechanisms. This paper presents a comprehensive analysis and evaluation of the effects of adding a Hash-based Message Authentication (HMAC) to TT networked control systems. The contributions of the paper include (1) the analysis and experimental validation of the communication overhead, as well as a scalability analysis that utilizes the experimental result for both wired and wireless platforms and (2) an experimental evaluation of the computational overhead of HMAC based on a kernel-level Linux implementation. An automotive application is used as an example, and the results show that it is feasible to implement a secure communication mechanism without interfering with the existing automotive controller execution times. The methods and results of the paper can be used for evaluating the performance impact of security mechanisms and, thus, for the design of secure wired and wireless TT networked control systems.

The network and transmission of based on the principle of laser multipoint communication

NASA Astrophysics Data System (ADS)

Fu, Qiang; Liu, Xianzhu; Jiang, Huilin; Hu, Yuan; Jiang, Lun

2014-11-01

Space laser communication is the perfectly choose to the earth integrated information backbone network in the future. This paper introduces the structure of the earth integrated information network that is a large capacity integrated high-speed broadband information network, a variety of communications platforms were densely interconnected together, such as the land, sea, air and deep air users or aircraft, the technologies of the intelligent high-speed processing, switching and routing were adopt. According to the principle of maximum effective comprehensive utilization of information resources, get accurately information, fast processing and efficient transmission through inter-satellite, satellite earth, sky and ground station and other links. Namely it will be a space-based, air-based and ground-based integrated information network. It will be started from the trends of laser communication. The current situation of laser multi-point communications were expounded, the transmission scheme of the dynamic multi-point between wireless laser communication n network has been carefully studied, a variety of laser communication network transmission schemes the corresponding characteristics and scope described in detail , described the optical multiplexer machine that based on the multiport form of communication is applied to relay backbone link; the optical multiplexer-based on the form of the segmentation receiver field of view is applied to small angle link, the optical multiplexer-based form of three concentric spheres structure is applied to short distances, motorized occasions, and the multi-point stitching structure based on the rotation paraboloid is applied to inter-satellite communications in detail. The multi-point laser communication terminal apparatus consist of the transmitting and receiving antenna, a relay optical system, the spectroscopic system, communication system and communication receiver transmitter system. The communication forms of optical multiplexer more than four goals or more, the ratio of received power and volume weight will be Obvious advantages, and can track multiple moving targets in flexible.It would to provide reference for the construction of earth integrated information networks.

Molecular communication and networking: opportunities and challenges.

PubMed

Nakano, Tadashi; Moore, Michael J; Wei, Fang; Vasilakos, Athanasios V; Shuai, Jianwei

2012-06-01

The ability of engineered biological nanomachines to communicate with biological systems at the molecular level is anticipated to enable future applications such as monitoring the condition of a human body, regenerating biological tissues and organs, and interfacing artificial devices with neural systems. From the viewpoint of communication theory and engineering, molecular communication is proposed as a new paradigm for engineered biological nanomachines to communicate with the natural biological nanomachines which form a biological system. Distinct from the current telecommunication paradigm, molecular communication uses molecules as the carriers of information; sender biological nanomachines encode information on molecules and release the molecules in the environment, the molecules then propagate in the environment to receiver biological nanomachines, and the receiver biological nanomachines biochemically react with the molecules to decode information. Current molecular communication research is limited to small-scale networks of several biological nanomachines. Key challenges to bridge the gap between current research and practical applications include developing robust and scalable techniques to create a functional network from a large number of biological nanomachines. Developing networking mechanisms and communication protocols is anticipated to introduce new avenues into integrating engineered and natural biological nanomachines into a single networked system. In this paper, we present the state-of-the-art in the area of molecular communication by discussing its architecture, features, applications, design, engineering, and physical modeling. We then discuss challenges and opportunities in developing networking mechanisms and communication protocols to create a network from a large number of bio-nanomachines for future applications.

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

Garlapati, Shravan K; Kuruganti, Phani Teja; Buehrer, Richard M

The deployment of advanced metering infrastructure by the electric utilities poses unique communication challenges, particularly as the number of meters per aggregator increases. During a power outage, a smart meter tries to report it instantaneously to the electric utility. In a densely populated residential/industrial locality, it is possible that a large number of smart meters simultaneously try to get access to the communication network to report the power outage. If the number of smart meters is very high of the order of tens of thousands (metropolitan areas), the power outage data flooding can lead to Random Access CHannel (RACH) congestion.more » Several utilities are considering the use of cellular network for smart meter communications. In 3G/4G cellular networks, RACH congestion not only leads to collisions, retransmissions and increased RACH delays, but also has the potential to disrupt the dedicated traffic flow by increasing the interference levels (3G CDMA). In order to overcome this problem, in this paper we propose a Time Hierarchical Scheme (THS) that reduces the intensity of power outage data flooding and power outage reporting delay by 6/7th, and 17/18th when compared to their respective values without THS. Also, we propose an Optimum Transmission Rate Adaptive (OTRA) MAC to optimize the latency in power outage data collection. The analysis and simulation results presented in this paper show that both the OTRA and THS features of the proposed MAC results in a Power Outage Data Collection Latency (PODCL) that is 1/10th of the 4G LTE PODCL.« less

A Novel Dual Separate Paths (DSP) Algorithm Providing Fault-Tolerant Communication for Wireless Sensor Networks.

PubMed

Tien, Nguyen Xuan; Kim, Semog; Rhee, Jong Myung; Park, Sang Yoon

2017-07-25

Fault tolerance has long been a major concern for sensor communications in fault-tolerant cyber physical systems (CPSs). Network failure problems often occur in wireless sensor networks (WSNs) due to various factors such as the insufficient power of sensor nodes, the dislocation of sensor nodes, the unstable state of wireless links, and unpredictable environmental interference. Fault tolerance is thus one of the key requirements for data communications in WSN applications. This paper proposes a novel path redundancy-based algorithm, called dual separate paths (DSP), that provides fault-tolerant communication with the improvement of the network traffic performance for WSN applications, such as fault-tolerant CPSs. The proposed DSP algorithm establishes two separate paths between a source and a destination in a network based on the network topology information. These paths are node-disjoint paths and have optimal path distances. Unicast frames are delivered from the source to the destination in the network through the dual paths, providing fault-tolerant communication and reducing redundant unicast traffic for the network. The DSP algorithm can be applied to wired and wireless networks, such as WSNs, to provide seamless fault-tolerant communication for mission-critical and life-critical applications such as fault-tolerant CPSs. The analyzed and simulated results show that the DSP-based approach not only provides fault-tolerant communication, but also improves network traffic performance. For the case study in this paper, when the DSP algorithm was applied to high-availability seamless redundancy (HSR) networks, the proposed DSP-based approach reduced the network traffic by 80% to 88% compared with the standard HSR protocol, thus improving network traffic performance.

Graph Theoretic and Motif Analyses of the Hippocampal Neuron Type Potential Connectome.

PubMed

Rees, Christopher L; Wheeler, Diek W; Hamilton, David J; White, Charise M; Komendantov, Alexander O; Ascoli, Giorgio A

2016-01-01

We computed the potential connectivity map of all known neuron types in the rodent hippocampal formation by supplementing scantly available synaptic data with spatial distributions of axons and dendrites from the open-access knowledge base Hippocampome.org. The network that results from this endeavor, the broadest and most complete for a mammalian cortical region at the neuron-type level to date, contains more than 3200 connections among 122 neuron types across six subregions. Analyses of these data using graph theory metrics unveil the fundamental architectural principles of the hippocampal circuit. Globally, we identify a highly specialized topology minimizing communication cost; a modular structure underscoring the prominence of the trisynaptic loop; a core set of neuron types serving as information-processing hubs as well as a distinct group of particular antihub neurons; a nested, two-tier rich club managing much of the network traffic; and an innate resilience to random perturbations. At the local level, we uncover the basic building blocks, or connectivity patterns, that combine to produce complex global functionality, and we benchmark their utilization in the circuit relative to random networks. Taken together, these results provide a comprehensive connectivity profile of the hippocampus, yielding novel insights on its functional operations at the computationally crucial level of neuron types.

Gossip algorithms in quantum networks

NASA Astrophysics Data System (ADS)

Siomau, Michael

2017-01-01

Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up - in the best case exponentially - the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication.

Learning in the Machine: Random Backpropagation and the Deep Learning Channel.

PubMed

Baldi, Pierre; Sadowski, Peter; Lu, Zhiqin

2018-07-01

Random backpropagation (RBP) is a variant of the backpropagation algorithm for training neural networks, where the transpose of the forward matrices are replaced by fixed random matrices in the calculation of the weight updates. It is remarkable both because of its effectiveness, in spite of using random matrices to communicate error information, and because it completely removes the taxing requirement of maintaining symmetric weights in a physical neural system. To better understand random backpropagation, we first connect it to the notions of local learning and learning channels. Through this connection, we derive several alternatives to RBP, including skipped RBP (SRPB), adaptive RBP (ARBP), sparse RBP, and their combinations (e.g. ASRBP) and analyze their computational complexity. We then study their behavior through simulations using the MNIST and CIFAR-10 bechnmark datasets. These simulations show that most of these variants work robustly, almost as well as backpropagation, and that multiplication by the derivatives of the activation functions is important. As a follow-up, we study also the low-end of the number of bits required to communicate error information over the learning channel. We then provide partial intuitive explanations for some of the remarkable properties of RBP and its variations. Finally, we prove several mathematical results, including the convergence to fixed points of linear chains of arbitrary length, the convergence to fixed points of linear autoencoders with decorrelated data, the long-term existence of solutions for linear systems with a single hidden layer and convergence in special cases, and the convergence to fixed points of non-linear chains, when the derivative of the activation functions is included.

Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches.

PubMed

Enns, Eva A; Brandeau, Margaret L

2015-04-21

For many communicable diseases, knowledge of the underlying contact network through which the disease spreads is essential to determining appropriate control measures. When behavior change is the primary intervention for disease prevention, it is important to understand how to best modify network connectivity using the limited resources available to control disease spread. We describe and compare four algorithms for selecting a limited number of links to remove from a network: two "preventive" approaches (edge centrality, R0 minimization), where the decision of which links to remove is made prior to any disease outbreak and depends only on the network structure; and two "reactive" approaches (S-I edge centrality, optimal quarantining), where information about the initial disease states of the nodes is incorporated into the decision of which links to remove. We evaluate the performance of these algorithms in minimizing the total number of infections that occur over the course of an acute outbreak of disease. We consider different network structures, including both static and dynamic Erdös-Rényi random networks with varying levels of connectivity, a real-world network of residential hotels connected through injection drug use, and a network exhibiting community structure. We show that reactive approaches outperform preventive approaches in averting infections. Among reactive approaches, removing links in order of S-I edge centrality is favored when the link removal budget is small, while optimal quarantining performs best when the link removal budget is sufficiently large. The budget threshold above which optimal quarantining outperforms the S-I edge centrality algorithm is a function of both network structure (higher for unstructured Erdös-Rényi random networks compared to networks with community structure or the real-world network) and disease infectiousness (lower for highly infectious diseases). We conduct a value-of-information analysis of knowing which nodes are initially infected by comparing the performance improvement achieved by reactive over preventive strategies. We find that such information is most valuable for moderate budget levels, with increasing value as disease spread becomes more likely (due to either increased connectedness of the network or increased infectiousness of the disease). Copyright © 2015 Elsevier Ltd. All rights reserved.

Link removal for the control of stochastically evolving epidemics over networks: A comparison of approaches

PubMed Central

Brandeau, Margaret L.

2015-01-01

For many communicable diseases, knowledge of the underlying contact network through which the disease spreads is essential to determining appropriate control measures. When behavior change is the primary intervention for disease prevention, it is important to understand how to best modify network connectivity using the limited resources available to control disease spread. We describe and compare four algorithms for selecting a limited number of links to remove from a network: two “preventive” approaches (edge centrality, R0 minimization), where the decision of which links to remove is made prior to any disease outbreak and depends only on the network structure; and two “reactive” approaches (S-I edge centrality, optimal quarantining), where information about the initial disease states of the nodes is incorporated into the decision of which links to remove. We evaluate the performance of these algorithms in minimizing the total number of infections that occur over the course of an acute outbreak of disease. We consider different network structures, including both static and dynamic Erdős-Rényi random networks with varying levels of connectivity, a real-world network of residential hotels connected through injection drug use, and a network exhibiting community structure. We show that reactive approaches outperform preventive approaches in averting infections. Among reactive approaches, removing links in order of S-I edge centrality is favored when the link removal budget is small, while optimal quarantining performs best when the link removal budget is sufficiently large. The budget threshold above which optimal quarantining outperforms the S-I edge centrality algorithm is a function of both network structure (higher for unstructured Erdős-Rényi random networks compared to networks with community structure or the real-world network) and disease infectiousness (lower for highly infectious diseases). We conduct a value-of-information analysis of knowing which nodes are initially infected by comparing the performance improvement achieved by reactive over preventive strategies. We find that such information is most valuable for moderate budget levels, with increasing value as disease spread becomes more likely (due to either increased connectedness of the network or increased infectiousness of the disease). PMID:25698229

Complex networks in the Euclidean space of communicability distances

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2012-06-01

We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded routes in networks where simultaneous submission of packages is taking place. We define an index Q based on communicability and shortest path distances, which allows reinterpreting the “small-world” phenomenon as the region of minimum Q in the Watts-Strogatz model. It also allows the classification and analysis of networks with different efficiency of spatial uses. Consequently, the communicability distance displays unique features for the analysis of complex networks in different scenarios.

Mapping Ad Hoc Communications Network of a Large Number Fixed-Wing UAV Swarm

DTIC Science & Technology

2017-03-01

partitioned sub-swarms. The work covered in this thesis is to build a model of the NPS swarm’s communication network in ns-3 simulation software and use...partitioned sub- swarms. The work covered in this thesis is to build a model of the NPS swarm’s communication network in ns-3 simulation software and...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS MAPPING AD HOC COMMUNICATIONS NETWORK OF A LARGE NUMBER FIXED-WING UAV SWARM by Alexis

Stochastic Stability of Sampled Data Systems with a Jump Linear Controller

NASA Technical Reports Server (NTRS)

Gonzalez, Oscar R.; Herencia-Zapana, Heber; Gray, W. Steven

2004-01-01

In this paper an equivalence between the stochastic stability of a sampled-data system and its associated discrete-time representation is established. The sampled-data system consists of a deterministic, linear, time-invariant, continuous-time plant and a stochastic, linear, time-invariant, discrete-time, jump linear controller. The jump linear controller models computer systems and communication networks that are subject to stochastic upsets or disruptions. This sampled-data model has been used in the analysis and design of fault-tolerant systems and computer-control systems with random communication delays without taking into account the inter-sample response. This paper shows that the known equivalence between the stability of a deterministic sampled-data system and the associated discrete-time representation holds even in a stochastic framework.

Leveraging the NPS Femto Satellite for Alternative Satellite Communication Networks

DTIC Science & Technology

2017-09-01

the next-generation NPSFS. 14. SUBJECT TERMS space , Femto satellite, NPSFS, network, communication , Arduino, RockBlock, Iridium Modem 15. NUMBER...provides a proof of concept for using Naval Postgraduate School Femto Satellites (NPSFS) as an alternative communication space -based network. The...We need several physical and procedural elements to conduct communication through space and using the electromagnetic spectrum. 1. Power Any

High-Capacity Ground Communications to Support Future Space Missions: A Forecast of Ground Communications Challenges in the 2010-2020 Period

NASA Technical Reports Server (NTRS)

Markley, Richard W.

2003-01-01

The purpose of this presentation is to identify major challenges involved in space ground communications networks to support space flight missions over the next 20 years. The presentation focus is on the Deep Space Network and its customers, but the forecast is applicable to all space ground communications networks.

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

BioNet Digital Communications Framework

NASA Technical Reports Server (NTRS)

Gifford, Kevin; Kuzminsky, Sebastian; Williams, Shea

2010-01-01

BioNet v2 is a peer-to-peer middleware that enables digital communication devices to talk to each other. It provides a software development framework, standardized application, network-transparent device integration services, a flexible messaging model, and network communications for distributed applications. BioNet is an implementation of the Constellation Program Command, Control, Communications and Information (C3I) Interoperability specification, given in CxP 70022-01. The system architecture provides the necessary infrastructure for the integration of heterogeneous wired and wireless sensing and control devices into a unified data system with a standardized application interface, providing plug-and-play operation for hardware and software systems. BioNet v2 features a naming schema for mobility and coarse-grained localization information, data normalization within a network-transparent device driver framework, enabling of network communications to non-IP devices, and fine-grained application control of data subscription band width usage. BioNet directly integrates Disruption Tolerant Networking (DTN) as a communications technology, enabling networked communications with assets that are only intermittently connected including orbiting relay satellites and planetary rover vehicles.

Percolation of localized attack on isolated and interdependent random networks

NASA Astrophysics Data System (ADS)

Shao, Shuai; Huang, Xuqing; Stanley, H. Eugene; Havlin, Shlomo

2014-03-01

Percolation properties of isolated and interdependent random networks have been investigated extensively. The focus of these studies has been on random attacks where each node in network is attacked with the same probability or targeted attack where each node is attacked with a probability being a function of its centrality, such as degree. Here we discuss a new type of realistic attacks which we call a localized attack where a group of neighboring nodes in the networks are attacked. We attack a randomly chosen node, its neighbors, and its neighbor of neighbors and so on, until removing a fraction (1 - p) of the network. This type of attack reflects damages due to localized disasters, such as earthquakes, floods and war zones in real-world networks. We study, both analytically and by simulations the impact of localized attack on percolation properties of random networks with arbitrary degree distributions and discuss in detail random regular (RR) networks, Erdős-Rényi (ER) networks and scale-free (SF) networks. We extend and generalize our theoretical and simulation results of single isolated networks to networks formed of interdependent networks.

Spacecraft Will Communicate "on the Fly"

NASA Technical Reports Server (NTRS)

Laufenberg, Lawrence

2003-01-01

As NASA probes deeper into space, the distance between sensor and scientist increases, as does the time delay. NASA needs to close that gap, while integrating more spacecraft types and missions-from near-Earth orbit to deep space. To speed and integrate communications from space missions to scientists on Earth and back again. NASA needs a comprehensive, high-performance communications network. To this end, the CICT Programs Space Communications (SC) Project is providing technologies for building the Space Internet which will consist of large backbone network, mid-size access networks linked to the backbones, and smaller, ad-hoc network linked to the access network. A key component will be mobile, wireless networks for spacecraft flying in different configurations.

In-House Communication Support System Based on the Information Propagation Model Utilizes Social Network

NASA Astrophysics Data System (ADS)

Takeuchi, Susumu; Teranishi, Yuuichi; Harumoto, Kaname; Shimojo, Shinji

Almost all companies are now utilizing computer networks to support speedier and more effective in-house information-sharing and communication. However, existing systems are designed to support communications only within the same department. Therefore, in our research, we propose an in-house communication support system which is based on the “Information Propagation Model (IPM).” The IPM is proposed to realize word-of-mouth communication in a social network, and to support information-sharing on the network. By applying the system in a real company, we found that information could be exchanged between different and unrelated departments, and such exchanges of information could help to build new relationships between the users who are apart on the social network.

Sparsely-synchronized brain rhythm in a small-world neural network

NASA Astrophysics Data System (ADS)

Kim, Sang-Yoon; Lim, Woochang

2013-07-01

Sparsely-synchronized cortical rhythms, associated with diverse cognitive functions, have been observed in electric recordings of brain activity. At the population level, cortical rhythms exhibit small-amplitude fast oscillations while at the cellular level, individual neurons show stochastic firings sparsely at a much lower rate than the population rate. We study the effect of network architecture on sparse synchronization in an inhibitory population of subthreshold Morris-Lecar neurons (which cannot fire spontaneously without noise). Previously, sparse synchronization was found to occur for cases of both global coupling ( i.e., regular all-to-all coupling) and random coupling. However, a real neural network is known to be non-regular and non-random. Here, we consider sparse Watts-Strogatz small-world networks which interpolate between a regular lattice and a random graph via rewiring. We start from a regular lattice with only short-range connections and then investigate the emergence of sparse synchronization by increasing the rewiring probability p for the short-range connections. For p = 0, the average synaptic path length between pairs of neurons becomes long; hence, only an unsynchronized population state exists because the global efficiency of information transfer is low. However, as p is increased, long-range connections begin to appear, and global effective communication between distant neurons may be available via shorter synaptic paths. Consequently, as p passes a threshold p th (}~ 0.044), sparsely-synchronized population rhythms emerge. However, with increasing p, longer axon wirings become expensive because of their material and energy costs. At an optimal value p* DE (}~ 0.24) of the rewiring probability, the ratio of the synchrony degree to the wiring cost is found to become maximal. In this way, an optimal sparse synchronization is found to occur at a minimal wiring cost in an economic small-world network through trade-off between synchrony and wiring cost.

On Applications of Disruption Tolerant Networking to Optical Networking in Space

NASA Technical Reports Server (NTRS)

Hylton, Alan Guy; Raible, Daniel E.; Juergens, Jeffrey; Iannicca, Dennis

2012-01-01

The integration of optical communication links into space networks via Disruption Tolerant Networking (DTN) is a largely unexplored area of research. Building on successful foundational work accomplished at JPL, we discuss a multi-hop multi-path network featuring optical links. The experimental test bed is constructed at the NASA Glenn Research Center featuring multiple Ethernet-to-fiber converters coupled with free space optical (FSO) communication channels. The test bed architecture models communication paths from deployed Mars assets to the deep space network (DSN) and finally to the mission operations center (MOC). Reliable versus unreliable communication methods are investigated and discussed; including reliable transport protocols, custody transfer, and fragmentation. Potential commercial applications may include an optical communications infrastructure deployment to support developing nations and remote areas, which are unburdened with supporting an existing heritage means of telecommunications. Narrow laser beam widths and control of polarization states offer inherent physical layer security benefits with optical communications over RF solutions. This paper explores whether or not DTN is appropriate for space-based optical networks, optimal payload sizes, reliability, and a discussion on security.

Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and Navigation Support

DTIC Science & Technology

2014-09-30

underwater acoustic communication technologies for autonomous distributed underwater networks , through innovative signal processing, coding, and...4. TITLE AND SUBTITLE Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and...coding: 3) OFDM modulated dynamic coded cooperation in underwater acoustic channels; 3 Localization, Networking , and Testbed: 4) On-demand

Quantifying randomness in real networks

NASA Astrophysics Data System (ADS)

Orsini, Chiara; Dankulov, Marija M.; Colomer-de-Simón, Pol; Jamakovic, Almerima; Mahadevan, Priya; Vahdat, Amin; Bassler, Kevin E.; Toroczkai, Zoltán; Boguñá, Marián; Caldarelli, Guido; Fortunato, Santo; Krioukov, Dmitri

2015-10-01

Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks--the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain--and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

PubMed Central

Zhang, Lin; Yin, Na; Fu, Xiong; Lin, Qiaomin; Wang, Ruchuan

2017-01-01

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. PMID:28282894

Constraints of nonresponding flows based on cross layers in the networks

NASA Astrophysics Data System (ADS)

Zhou, Zhi-Chao; Xiao, Yang; Wang, Dong

2016-02-01

In the active queue management (AQM) scheme, core routers cannot manage and constrain user datagram protocol (UDP) data flows by the sliding window control mechanism in the transport layer due to the nonresponsive nature of such traffic flows. However, the UDP traffics occupy a large part of the network service nowadays which brings a great challenge to the stability of the more and more complex networks. To solve the uncontrollable problem, this paper proposes a cross layers random early detection (CLRED) scheme, which can control the nonresponding UDP-like flows rate effectively when congestion occurs in the access point (AP). The CLRED makes use of the MAC frame acknowledgement (ACK) transmitting congestion information to the sources nodes and utilizes the back-off windows of the MAC layer throttling data rate. Consequently, the UDP-like flows data rate can be restrained timely by the sources nodes in order to alleviate congestion in the complex networks. The proposed CLRED can constrain the nonresponsive flows availably and make the communication expedite, so that the network can sustain stable. The simulation results of network simulator-2 (NS2) verify the proposed CLRED scheme.

Neural Network Based Intrusion Detection System for Critical Infrastructures

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

Todd Vollmer; Ondrej Linda; Milos Manic

2009-07-01

Resiliency and security in control systems such as SCADA and Nuclear plant’s in today’s world of hackers and malware are a relevant concern. Computer systems used within critical infrastructures to control physical functions are not immune to the threat of cyber attacks and may be potentially vulnerable. Tailoring an intrusion detection system to the specifics of critical infrastructures can significantly improve the security of such systems. The IDS-NNM – Intrusion Detection System using Neural Network based Modeling, is presented in this paper. The main contributions of this work are: 1) the use and analyses of real network data (data recordedmore » from an existing critical infrastructure); 2) the development of a specific window based feature extraction technique; 3) the construction of training dataset using randomly generated intrusion vectors; 4) the use of a combination of two neural network learning algorithms – the Error-Back Propagation and Levenberg-Marquardt, for normal behavior modeling. The presented algorithm was evaluated on previously unseen network data. The IDS-NNM algorithm proved to be capable of capturing all intrusion attempts presented in the network communication while not generating any false alerts.« less

Synchronization in Random Pulse Oscillator Networks

NASA Astrophysics Data System (ADS)

Brown, Kevin; Hermundstad, Ann

Motivated by synchronization phenomena in neural systems, we study synchronization of random networks of coupled pulse oscillators. We begin by considering binomial random networks whose nodes have intrinsic linear dynamics. We quantify order in the network spiking dynamics using a new measure: the normalized Lev-Zimpel complexity (LZC) of the nodes' spike trains. Starting from a globally-synchronized state, we see two broad classes of behaviors. In one (''temporally random''), the LZC is high and nodes spike independently with no coherent pattern. In another (''temporally regular''), the network does not globally synchronize but instead forms coherent, repeating population firing patterns with low LZC. No topological feature of the network reliably predicts whether an individual network will show temporally random or regular behavior; however, we find evidence that degree heterogeneity in binomial networks has a strong effect on the resulting state. To confirm these findings, we generate random networks with independently-adjustable degree mean and variance. We find that the likelihood of temporally-random behavior increases as degree variance increases. Our results indicate the subtle and complex relationship between network structure and dynamics.

GLOBECOM '88 - IEEE Global Telecommunications Conference and Exhibition, Hollywood, FL, Nov. 28-Dec. 1, 1988, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Various papers on communications for the information age are presented. Among the general topics considered are: telematic services and terminals, satellite communications, telecommunications mangaement network, control of integrated broadband networks, advances in digital radio systems, the intelligent network, broadband networks and services deployment, future switch architectures, performance analysis of computer networks, advances in spread spectrum, optical high-speed LANs, and broadband switching and networks. Also addressed are: multiple access protocols, video coding techniques, modulation and coding, photonic switching, SONET terminals and applications, standards for video coding, digital switching, progress in MANs, mobile and portable radio, software design for improved maintainability, multipath propagation and advanced countermeasure, data communication, network control and management, fiber in the loop, network algorithm and protocols, and advances in computer communications.

Using Social Network Analysis to Investigate Positive EOL Communication.

PubMed

Xu, Jiayun; Yang, Rumei; Wilson, Andrew; Reblin, Maija; Clayton, Margaret F; Ellington, Lee

2018-04-30

End of life (EOL) communication is a complex process involving the whole family and multiple care providers. Applications of analysis techniques that account for communication beyond the patient and patient/provider, will improve clinical understanding of EOL communication. To introduce the use of social network analysis to EOL communication data, and to provide an example of applying social network analysis to home hospice interactions. We provide a description of social network analysis using social network analysis to model communication patterns during home hospice nursing visits. We describe three social network attributes (i.e. magnitude, directionality, and reciprocity) in the expression of positive emotion among hospice nurses, family caregivers, and hospice cancer patients. Differences in communication structure by primary family caregiver gender and across time were also examined. Magnitude (frequency) in the expression of positive emotion occurred most often between nurses and caregivers or nurses and patients. Female caregivers directed more positive emotion to nurses, and nurses directed more positive emotion to other family caregivers when the primary family caregiver was male. Reciprocity (mutuality) in positive emotion declined towards day of death, but increased on day of actual patient death. There was variation in reciprocity by the type of positive emotion expressed. Our example demonstrates that social network analysis can be used to better understand the process of EOL communication. Social network analysis can be expanded to other areas of EOL research, such as EOL decision-making and health care teamwork. Copyright © 2018. Published by Elsevier Inc.

Space Link Extension (SLE) Emulation for High-Throughput Network Communication

NASA Technical Reports Server (NTRS)

Murawski, Robert W.; Tchorowski, Nicole; Golden, Bert

2014-01-01

As the data rate requirements for space communications increases, significant stress is placed not only on the wireless satellite communication links, but also on the ground networks which forward data from end-users to remote ground stations. These wide area network (WAN) connections add delay and jitter to the end-to-end satellite communication link, effects which can have significant impacts on the wireless communication link. It is imperative that any ground communication protocol can react to these effects such that the ground network does not become a bottleneck in the communication path to the satellite. In this paper, we present our SCENIC Emulation Lab testbed which was developed to test the CCSDS SLE protocol implementations proposed for use on future NASA communication networks. Our results show that in the presence of realistic levels of network delay, high-throughput SLE communication links can experience significant data rate throttling. Based on our observations, we present some insight into why this data throttling happens, and trace the probable issue back to non-optimal blocking communication which is sup-ported by the CCSDS SLE API recommended practices. These issues were presented as well to the SLE implementation developers which, based on our reports, developed a new release for SLE which we show fixes the SLE blocking issue and greatly improves the protocol throughput. In this paper, we also discuss future developments for our end-to-end emulation lab and how these improvements can be used to develop and test future space communication technologies.

Applying artificial neural networks to predict communication risks in the emergency department.

PubMed

Bagnasco, Annamaria; Siri, Anna; Aleo, Giuseppe; Rocco, Gennaro; Sasso, Loredana

2015-10-01

To describe the utility of artificial neural networks in predicting communication risks. In health care, effective communication reduces the risk of error. Therefore, it is important to identify the predictive factors of effective communication. Non-technical skills are needed to achieve effective communication. This study explores how artificial neural networks can be applied to predict the risk of communication failures in emergency departments. A multicentre observational study. Data were collected between March-May 2011 by observing the communication interactions of 840 nurses with their patients during their routine activities in emergency departments. The tools used for our observation were a questionnaire to collect personal and descriptive data, level of training and experience and Guilbert's observation grid, applying the Situation-Background-Assessment-Recommendation technique to communication in emergency departments. A total of 840 observations were made on the nurses working in the emergency departments. Based on Guilbert's observation grid, the output variables is likely to influence the risk of communication failure were 'terminology'; 'listening'; 'attention' and 'clarity', whereas nurses' personal characteristics were used as input variables in the artificial neural network model. A model based on the multilayer perceptron topology was developed and trained. The receiver operator characteristic analysis confirmed that the artificial neural network model correctly predicted the performance of more than 80% of the communication failures. The application of the artificial neural network model could offer a valid tool to forecast and prevent harmful communication errors in the emergency department. © 2015 John Wiley & Sons Ltd.

Mesh Network Architecture for Enabling Inter-Spacecraft Communication

NASA Technical Reports Server (NTRS)

Becker, Christopher; Merrill, Garrick

2017-01-01

To enable communication between spacecraft operating in a formation or small constellation, a mesh network architecture was developed and tested using a time division multiple access (TDMA) communication scheme. The network is designed to allow for the exchange of telemetry and other data between spacecraft to enable collaboration between small spacecraft. The system uses a peer-to-peer topology with no central router, so that it does not have a single point of failure. The mesh network is dynamically configurable to allow for addition and subtraction of new spacecraft into the communication network. Flight testing was performed using an unmanned aerial system (UAS) formation acting as a spacecraft analogue and providing a stressing environment to prove mesh network performance. The mesh network was primarily devised to provide low latency, high frequency communication but is flexible and can also be configured to provide higher bandwidth for applications desiring high data throughput. The network includes a relay functionality that extends the maximum range between spacecraft in the network by relaying data from node to node. The mesh network control is implemented completely in software making it hardware agnostic, thereby allowing it to function with a wide variety of existing radios and computing platforms..

Minimizing communication cost among distributed controllers in software defined networks

NASA Astrophysics Data System (ADS)

Arlimatti, Shivaleela; Elbreiki, Walid; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

2016-08-01

Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers.

Research Priorities in Networking and Communications.

ERIC Educational Resources Information Center

National Science Foundation, Washington, DC.

A workshop focused on major research issues in networking and communications. This report defines the context for research priorities and initiatives and deals with issues in networking and communications. Fifteen major research priorities and four research specific initiatives were identified by participants as areas that should be pursued over…

Communication Dynamics of Blog Networks

NASA Astrophysics Data System (ADS)

Goldberg, Mark; Kelley, Stephen; Magdon-Ismail, Malik; Mertsalov, Konstantin; Wallace, William (Al)

We study the communication dynamics of Blog networks, focusing on the Russian section of LiveJournal as a case study. Communication (blogger-to-blogger links) in such online communication networks is very dynamic: over 60% of the links in the network are new from one week to the next, though the set of bloggers remains approximately constant. Two fundamental questions are: (i) what models adequately describe such dynamic communication behavior; and (ii) how does one detect the phase transitions, i.e. the changes that go beyond the standard high-level dynamics? We approach these questions through the notion of stable statistics. We give strong experimental evidence to the fact that, despite the extreme amount of communication dynamics, several aggregate statistics are remarkably stable. We use stable statistics to test our models of communication dynamics postulating that any good model should produce values for these statistics which are both stable and close to the observed ones. Stable statistics can also be used to identify phase transitions, since any change in a normally stable statistic indicates a substantial change in the nature of the communication dynamics. We describe models of the communication dynamics in large social networks based on the principle of locality of communication: a node's communication energy is spent mostly within its own "social area," the locality of the node.

Time concurrency/phase-time synchronization in digital communications networks

NASA Technical Reports Server (NTRS)

Kihara, Masami; Imaoka, Atsushi

1990-01-01

Digital communications networks have the intrinsic capability of time synchronization which makes it possible for networks to supply time signals to some applications and services. A practical estimation method for the time concurrency on terrestrial networks is presented. By using this method, time concurrency capability of the Nippon Telegraph and Telephone Corporation (NTT) digital communications network is estimated to be better than 300 ns rms at an advanced level, and 20 ns rms at final level.

Sexual health promotion in Chennai, India: key role of communication among social networks.

PubMed

Sivaram, Sudha; Johnson, Sethulakshmi; Bentley, Margaret E; Go, Vivian F; Latkin, Carl; Srikrishnan, A K; Celentano, David D; Solomon, Suniti

2005-12-01

Communication about sex and sexual health is an important facilitator in gaining accurate knowledge about prevention of sexually transmitted diseases (STDs) and promotion of sexual health. Understanding how and with whom communication about sex occurs and the nature of the information exchanged is valuable in designing sexual risk prevention interventions. In this study of low-income communities residents in Chennai, India, our aim was to understand the composition of personal communication networks, the nature of information related to sex and sexual health that is exchanged in these networks and the value of communication among members of these networks. We conducted in-depth open-ended interviews using a structured interview guide with 43 individuals. We also conducted 12 focus group discussions. Individuals were selected using snowball sampling. Our results indicate that information about sex and sexual health is exchanged within and between four groups: married women, married men, unmarried men and unmarried women. Communication leads to an expansion of sexual networks among unmarried men and treatment seeking behaviour for STDs in all groups. Unmarried men offer immense potential for intervention given the range of topics related to sex and sexual health that are discussed and the risky sexual behaviours practiced. Spousal communication about sexual behaviour or sexual health is minimal and shifting norms for prevention would be difficult. Interventions identifying communication networks and influencing the natural communication patterns in these networks may be a viable HIV prevention strategy in the study area.

In-Space Internet-Based Communications for Space Science Platforms Using Commercial Satellite Networks

NASA Technical Reports Server (NTRS)

Kerczewski, Robert J.; Bhasin, Kul B.; Fabian, Theodore P.; Griner, James H.; Kachmar, Brian A.; Richard, Alan M.

1999-01-01

The continuing technological advances in satellite communications and global networking have resulted in commercial systems that now can potentially provide capabilities for communications with space-based science platforms. This reduces the need for expensive government owned communications infrastructures to support space science missions while simultaneously making available better service to the end users. An interactive, high data rate Internet type connection through commercial space communications networks would enable authorized researchers anywhere to control space-based experiments in near real time and obtain experimental results immediately. A space based communications network architecture consisting of satellite constellations connecting orbiting space science platforms to ground users can be developed to provide this service. The unresolved technical issues presented by this scenario are the subject of research at NASA's Glenn Research Center in Cleveland, Ohio. Assessment of network architectures, identification of required new or improved technologies, and investigation of data communications protocols are being performed through testbed and satellite experiments and laboratory simulations.

Hyper-Spectral Communications, Networking and ATM as Foundation for Safe and Efficient Future Flight: Transcending Aviation Operational Limitations with Diverse and Secure Multi-Band, Multi-Mode, and mmWave Wireless Links: Project Overview, Aviation Communications and New Signaling

NASA Technical Reports Server (NTRS)

Matolak, David W.

2017-01-01

NASA's Aeronautics Research Mission Directorate (ARMD) has recently solicited proposals and awarded funds for research and development to achieve and exceed the goals envisioned in the ARMD Strategic Implementation Plan (SIP). The Hyper-Spectral Communications and Networking for Air Traffic Management (ATM) (HSCNA) project is the only University Leadership Initiative (ULI) program to address communications and networking (and to a degree, navigation and surveillance). This paper will provide an overview of the HSCNA project, and specifically describe two of the project's technical challenges: comprehensive aviation communications and networking assessment, and proposed multi-band and multimode communications and networking. The primary goals will be described, as will be research and development aimed to achieve and exceed these goals. Some example initial results are also provided.

Robust and Cost-Efficient Communication Based on SNMP in Mobile Networks

NASA Astrophysics Data System (ADS)

Ryu, Sang-Hoon; Baik, Doo-Kwon

A main challenge in the design of this mobile network is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. Multimedia streaming services are receiving considerable interest in the mobile network business. An entire mobile network may change its point of attachment to the Internet. The mobile network is operated by a basic specification to support network mobility called Network Mobility (NEMO) Basic Support. However, NEMO basic Support mechanism has some problem in continuous communication. In this paper, we propose robust and cost-efficient algorithm. And we simulate proposed method and conclude some remarks.

75 FR 34459 - Converged Communications and Health Care Devices Impact on Regulation; Public Meeting; Request...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-17

... established commercial communications networks such as Internet connectivity to communicate with care... stimulate muscle movement. Examples of devices and applications that use commercial communications networks...] Converged Communications and Health Care Devices Impact on Regulation; Public Meeting; Request for Comments...

SBIR Technology Applications to Space Communications and Navigation (SCaN)

NASA Technical Reports Server (NTRS)

Liebrecht, Phil; Eblen, Pat; Rush, John; Tzinis, Irene

2010-01-01

This slide presentation reviews the mission of the Space Communications and Navigation (SCaN) Office with particular emphasis on opportunities for technology development with SBIR companies. The SCaN office manages NASA's space communications and navigation networks: the Near Earth Network (NEN), the Space Network (SN), and the Deep Space Network (DSN). The SCaN networks nodes are shown on a world wide map and the networks are described. Two types of technologies are described: Pull technology, and Push technologies. A listing of technology themes is presented, with a discussion on Software defined Radios, Optical Communications Technology, and Lunar Lasercom Space Terminal (LLST). Other technologies that are being investigated are some Game Changing Technologies (GCT) i.e., technologies that offer the potential for improving comm. or nav. performance to the point that radical new mission objectives are possible, such as Superconducting Quantum Interference Filters, Silicon Nanowire Optical Detectors, and Auto-Configuring Cognitive Communications

A biometric method to secure telemedicine systems.

PubMed

Zhang, G H; Poon, Carmen C Y; Li, Ye; Zhang, Y T

2009-01-01

Security and privacy are among the most crucial issues for data transmission in telemedicine systems. This paper proposes a solution for securing wireless data transmission in telemedicine systems, i.e. within a body sensor network (BSN), between the BSN and server as well as between the server and professionals who have assess to the server. A unique feature of this solution is the generation of random keys by physiological data (i.e. a biometric approach) for securing communication at all 3 levels. In the performance analysis, inter-pulse interval of photoplethysmogram is used as an example to generate these biometric keys to protect wireless data transmission. The results of statistical analysis and computational complexity suggest that this type of key is random enough to make telemedicine systems resistant to attacks.

Network Coding in Relay-based Device-to-Device Communications

PubMed Central

Huang, Jun; Gharavi, Hamid; Yan, Huifang; Xing, Cong-cong

2018-01-01

Device-to-Device (D2D) communications has been realized as an effective means to improve network throughput, reduce transmission latency, and extend cellular coverage in 5G systems. Network coding is a well-established technique known for its capability to reduce the number of retransmissions. In this article, we review state-of-the-art network coding in relay-based D2D communications, in terms of application scenarios and network coding techniques. We then apply two representative network coding techniques to dual-hop D2D communications and present an efficient relay node selecting mechanism as a case study. We also outline potential future research directions, according to the current research challenges. Our intention is to provide researchers and practitioners with a comprehensive overview of the current research status in this area and hope that this article may motivate more researchers to participate in developing network coding techniques for different relay-based D2D communications scenarios. PMID:29503504

47 CFR 11.20 - State Relay Network.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 1 2011-10-01 2011-10-01 false State Relay Network. 11.20 Section 11.20... Network. This network is composed of State Relay (SR) sources, leased common carrier communications facilities or any other available communication facilities. The network distributes State EAS messages...

47 CFR 11.20 - State Relay Network.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 1 2010-10-01 2010-10-01 false State Relay Network. 11.20 Section 11.20... Network. This network is composed of State Relay (SR) sources, leased common carrier communications facilities or any other available communication facilities. The network distributes State EAS messages...

Intercultural Communication in Online Social Networking Discourse

ERIC Educational Resources Information Center

Chen, Hsin-I

2017-01-01

This article presents a case study that examines how an online social networking community is constituted through intercultural discourse on the part of one learner sojourning in the US. Using Byram's model of intercultural communicative competence, this study examines the learner's naturalistic communication in a social networking site (SNS). The…

The Effectiveness of Using Social Communications Networks in Mathematics Teachers' Professional Development

ERIC Educational Resources Information Center

Hussein, Hisham Barakat

2013-01-01

The study aims to determine the effectiveness of using social communications networks in mathematics teachers' professional development. The main research questions was: what is the effectiveness of using social communications networks in mathematics teachers' professional development. The sub questions were: (1) what are the standards of…

Future communications satellite applications

NASA Technical Reports Server (NTRS)

Bagwell, James W.

1992-01-01

The point of view of the research is made through the use of viewgraphs. It is suggested that future communications satellite applications will be made through switched point to point narrowband communications. Some characteristics of which are as follows: small/low cost terminals; single hop communications; voice compatible; full mesh networking; ISDN compatible; and possible limited use of full motion video. Some target applications are as follows: voice/data networks between plants and offices in a corporation; data base networking for commercial and science users; and cellular radio internodal voice/data networking.

Research on TCP/IP network communication based on Node.js

NASA Astrophysics Data System (ADS)

Huang, Jing; Cai, Lixiong

2018-04-01

In the face of big data, long connection and high synchronization, TCP/IP network communication will cause performance bottlenecks due to its blocking multi-threading service model. This paper presents a method of TCP/IP network communication protocol based on Node.js. On the basis of analyzing the characteristics of Node.js architecture and asynchronous non-blocking I/O model, the principle of its efficiency is discussed, and then compare and analyze the network communication model of TCP/IP protocol to expound the reasons why TCP/IP protocol stack is widely used in network communication. Finally, according to the large data and high concurrency in the large-scale grape growing environment monitoring process, a TCP server design based on Node.js is completed. The results show that the example runs stably and efficiently.

Research of the key technology in satellite communication networks

NASA Astrophysics Data System (ADS)

Zeng, Yuan

2018-02-01

According to the prediction, in the next 10 years the wireless data traffic will be increased by 500-1000 times. Not only the wireless data traffic will be increased exponentially, and the demand for diversified traffic will be increased. Higher requirements for future mobile wireless communication system had brought huge market space for satellite communication system. At the same time, the space information networks had been greatly developed with the depth of human exploration of space activities, the development of space application, the expansion of military and civilian application. The core of spatial information networks is the satellite communication. The dissertation presented the communication system architecture, the communication protocol, the routing strategy, switch scheduling algorithm and the handoff strategy based on the satellite communication system. We built the simulation platform of the LEO satellites networks and simulated the key technology using OPNET.

AIDS communications through social networks: catalyst for behaviour changes in Uganda.

PubMed

Low-Beer, Daniel; Stoneburner, Rand L

2004-05-01

To investigate distinctive communications through social networks which may be associated with population behaviour changes and HIV prevalence declines in Uganda compared to other countries. We undertook a comparative analysis of demographic and HIV behavioural data collected in Demographic and Health Surveys (DHS III) in Uganda, Kenya, Tanzania, Malawi, Zambia and Zimbabwe as well as Knowledge, Attitudes and Behaviours (KABP) surveys in Uganda in 1989 and 1995. AIDS behaviours, social communications and channels for communication about AIDS and people with AIDS were analysed by age, sex and country. Modelling was developed to investigate at what stage of the epidemic a majority of people will know someone with AIDS, given differing communication patterns through social networks. Finally AIDS reporting and Voluntary Counselling and Testing (VCT) trends were analysed to assess if the impact of social communications worked through clinical services and interventions or more directly at the population level in community contexts. Uganda showed unique patterns of communications through social networks including a shift from mass and institutional to personal channels for communicating about AIDS, 1989-1995. This was associated with higher levels of knowing someone with AIDS through social networks and, in turn, positive risk ratios for behaviour change including reducing casual sex and condom use. Youth had distinctively high levels of knowing someone with AIDS in Uganda, suggesting widespread community communication across age groups. Patterns of disclosure, AIDS diagnosis and reporting were influential on social communications about AIDS. Over 90%, 45% or under 20% of people know someone with AIDS at peak HIV incidence and high AIDS mortality, depending on whether communications through social networks are extensive or restricted. There are distinctive patterns for communicating through social networks about AIDS and people with AIDS in Uganda. They appear to work directly at population level rather than in response to clinical interventions and testing and may be important in the uptake of the latter services. This communication response provides an important basis for HIV prevention if it is to be scaled to the population level. Vertical prevention (and even treatment) interventions need to engage more closely with local, horizontal communication and behavioural responses to AIDS. Communication programmes have to take root at the level of social networks working though local networks of meetings, chiefs, churches and health personnel as well as the media. Mobilising basic social communications may be a necessary resource (as much as services and finance) to scale HIV prevention and treatment to the population level.

The deep space network, volume 18. [Deep Space Instrumentation Facility, Ground Communication Facility, and Network Control System

NASA Technical Reports Server (NTRS)

1973-01-01

The objectives, functions, and organization of the Deep Space Network are summarized. The Deep Space Instrumentation Facility, the Ground Communications Facility, and the Network Control System are described.

Comparison of neuronal spike exchange methods on a Blue Gene/P supercomputer.

PubMed

Hines, Michael; Kumar, Sameer; Schürmann, Felix

2011-01-01

For neural network simulations on parallel machines, interprocessor spike communication can be a significant portion of the total simulation time. The performance of several spike exchange methods using a Blue Gene/P (BG/P) supercomputer has been tested with 8-128 K cores using randomly connected networks of up to 32 M cells with 1 k connections per cell and 4 M cells with 10 k connections per cell, i.e., on the order of 4·10(10) connections (K is 1024, M is 1024(2), and k is 1000). The spike exchange methods used are the standard Message Passing Interface (MPI) collective, MPI_Allgather, and several variants of the non-blocking Multisend method either implemented via non-blocking MPI_Isend, or exploiting the possibility of very low overhead direct memory access (DMA) communication available on the BG/P. In all cases, the worst performing method was that using MPI_Isend due to the high overhead of initiating a spike communication. The two best performing methods-the persistent Multisend method using the Record-Replay feature of the Deep Computing Messaging Framework DCMF_Multicast; and a two-phase multisend in which a DCMF_Multicast is used to first send to a subset of phase one destination cores, which then pass it on to their subset of phase two destination cores-had similar performance with very low overhead for the initiation of spike communication. Departure from ideal scaling for the Multisend methods is almost completely due to load imbalance caused by the large variation in number of cells that fire on each processor in the interval between synchronization. Spike exchange time itself is negligible since transmission overlaps with computation and is handled by a DMA controller. We conclude that ideal performance scaling will be ultimately limited by imbalance between incoming processor spikes between synchronization intervals. Thus, counterintuitively, maximization of load balance requires that the distribution of cells on processors should not reflect neural net architecture but be randomly distributed so that sets of cells which are burst firing together should be on different processors with their targets on as large a set of processors as possible.

Brief Report: Randomized Test of the Efficacy of Picture Exchange Communication System on Highly Generalized Picture Exchanges in Children with ASD

ERIC Educational Resources Information Center

Yoder, Paul J.; Lieberman, Rebecca G.

2010-01-01

A randomized control trial comparing two social-communication interventions in young children with autism examined far-transfer of the use of picture exchange to communicate. Thirty-six children were randomly assigned to one of two treatment conditions, one of which was the Picture Exchange Communication System (PECS). All children had access to…

Communication complexity and information complexity

NASA Astrophysics Data System (ADS)

Pankratov, Denis

Information complexity enables the use of information-theoretic tools in communication complexity theory. Prior to the results presented in this thesis, information complexity was mainly used for proving lower bounds and direct-sum theorems in the setting of communication complexity. We present three results that demonstrate new connections between information complexity and communication complexity. In the first contribution we thoroughly study the information complexity of the smallest nontrivial two-party function: the AND function. While computing the communication complexity of AND is trivial, computing its exact information complexity presents a major technical challenge. In overcoming this challenge, we reveal that information complexity gives rise to rich geometrical structures. Our analysis of information complexity relies on new analytic techniques and new characterizations of communication protocols. We also uncover a connection of information complexity to the theory of elliptic partial differential equations. Once we compute the exact information complexity of AND, we can compute exact communication complexity of several related functions on n-bit inputs with some additional technical work. Previous combinatorial and algebraic techniques could only prove bounds of the form theta( n). Interestingly, this level of precision is typical in the area of information theory, so our result demonstrates that this meta-property of precise bounds carries over to information complexity and in certain cases even to communication complexity. Our result does not only strengthen the lower bound on communication complexity of disjointness by making it more exact, but it also shows that information complexity provides the exact upper bound on communication complexity. In fact, this result is more general and applies to a whole class of communication problems. In the second contribution, we use self-reduction methods to prove strong lower bounds on the information complexity of two of the most studied functions in the communication complexity literature: Gap Hamming Distance (GHD) and Inner Product mod 2 (IP). In our first result we affirm the conjecture that the information complexity of GHD is linear even under the uniform distribution. This strengthens the O(n) bound shown by Kerenidis et al. (2012) and answers an open problem by Chakrabarti et al. (2012). We also prove that the information complexity of IP is arbitrarily close to the trivial upper bound n as the permitted error tends to zero, again strengthening the O(n) lower bound proved by Braverman and Weinstein (2011). More importantly, our proofs demonstrate that self-reducibility makes the connection between information complexity and communication complexity lower bounds a two-way connection. Whereas numerous results in the past used information complexity techniques to derive new communication complexity lower bounds, we explore a generic way, in which communication complexity lower bounds imply information complexity lower bounds in a black-box manner. In the third contribution we consider the roles that private and public randomness play in the definition of information complexity. In communication complexity, private randomness can be trivially simulated by public randomness. Moreover, the communication cost of simulating public randomness with private randomness is well understood due to Newman's theorem (1991). In information complexity, the roles of public and private randomness are reversed: public randomness can be trivially simulated by private randomness. However, the information cost of simulating private randomness with public randomness is not understood. We show that protocols that use only public randomness admit a rather strong compression. In particular, efficient simulation of private randomness by public randomness would imply a version of a direct sum theorem in the setting of communication complexity. This establishes a yet another connection between the two areas. (Abstract shortened by UMI.).

Direct and full-scale experimental verifications towards ground-satellite quantum key distribution

NASA Astrophysics Data System (ADS)

Wang, Jian-Yu; Yang, Bin; Liao, Sheng-Kai; Zhang, Liang; Shen, Qi; Hu, Xiao-Fang; Wu, Jin-Cai; Yang, Shi-Ji; Jiang, Hao; Tang, Yan-Lin; Zhong, Bo; Liang, Hao; Liu, Wei-Yue; Hu, Yi-Hua; Huang, Yong-Mei; Qi, Bo; Ren, Ji-Gang; Pan, Ge-Sheng; Yin, Juan; Jia, Jian-Jun; Chen, Yu-Ao; Chen, Kai; Peng, Cheng-Zhi; Pan, Jian-Wei

2013-05-01

Quantum key distribution (QKD) provides the only intrinsically unconditional secure method for communication based on the principle of quantum mechanics. Compared with fibre-based demonstrations, free-space links could provide the most appealing solution for communication over much larger distances. Despite significant efforts, all realizations to date rely on stationary sites. Experimental verifications are therefore extremely crucial for applications to a typical low Earth orbit satellite. To achieve direct and full-scale verifications of our set-up, we have carried out three independent experiments with a decoy-state QKD system, and overcome all conditions. The system is operated on a moving platform (using a turntable), on a floating platform (using a hot-air balloon), and with a high-loss channel to demonstrate performances under conditions of rapid motion, attitude change, vibration, random movement of satellites, and a high-loss regime. The experiments address wide ranges of all leading parameters relevant to low Earth orbit satellites. Our results pave the way towards ground-satellite QKD and a global quantum communication network.

Cross over of recurrence networks to random graphs and random geometric graphs

NASA Astrophysics Data System (ADS)

Jacob, Rinku; Harikrishnan, K. P.; Misra, R.; Ambika, G.

2017-02-01

Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability density variations of the representative attractor from which it is constructed. Here we numerically investigate the properties of recurrence networks from standard low-dimensional chaotic attractors using some basic network measures and show how the recurrence networks are different from random and scale-free networks. In particular, we show that all recurrence networks can cross over to random geometric graphs by adding sufficient amount of noise to the time series and into the classical random graphs by increasing the range of interaction to the system size. We also highlight the effectiveness of a combined plot of characteristic path length and clustering coefficient in capturing the small changes in the network characteristics.

Task five report: Laser communications for data acquisition networks. [characteristics of lasers and laser systems for optical communication applications

NASA Technical Reports Server (NTRS)

1973-01-01

Laser communication technology and laser communication performance are reviewed. The subjects discussed are: (1) characteristics of laser communication systems, (2) laser technology problems, (3) means of overcoming laser technology problems, and (4) potential schedule for including laser communications into data acquisition networks. Various types of laser communication systems are described and their capabilities are defined.

Testing the structure of earthquake networks from multivariate time series of successive main shocks in Greece

NASA Astrophysics Data System (ADS)

Chorozoglou, D.; Kugiumtzis, D.; Papadimitriou, E.

2018-06-01

The seismic hazard assessment in the area of Greece is attempted by studying the earthquake network structure, such as small-world and random. In this network, a node represents a seismic zone in the study area and a connection between two nodes is given by the correlation of the seismic activity of two zones. To investigate the network structure, and particularly the small-world property, the earthquake correlation network is compared with randomized ones. Simulations on multivariate time series of different length and number of variables show that for the construction of randomized networks the method randomizing the time series performs better than methods randomizing directly the original network connections. Based on the appropriate randomization method, the network approach is applied to time series of earthquakes that occurred between main shocks in the territory of Greece spanning the period 1999-2015. The characterization of networks on sliding time windows revealed that small-world structure emerges in the last time interval, shortly before the main shock.

Challenges of Integrating NASA's Space Communications Networks

NASA Technical Reports Server (NTRS)

Reinert, Jessica; Barnes, Patrick

2013-01-01

The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a significant obstacle for integration. Over the past few decades of use, user missions and network personnel alike have grown accustomed to the processes by which services are provided by the NASA communications and navigation networks. The culture established by each network has created several challenges that need to be overcome in order to effectively integrate the networks. As with any change, there has been resistance, an apprehension to explore automation of existing processes, and a working environment that attempts to indirectly influence change without mandating compliance. Overcoming technical and cultural challenges is essential to successfully integrating the networks and although the challenges are numerous, the integration of the networks promises a more efficient space communications network for NASA and its customers, as well as potential long-term cost savings to the agency. This paper, Challenges of Integrating NASA Legacy Communications Networks, will provide a brief overview of the current NASA space communications networks as well as the an overview of the process implemented while performing the SCaN Trade Studies and an introduction to the requirements driving integration of the SCaN Networks. This paper will describe in detail the challenges experienced, both technical and cultural, while working with NASA space communications network-specific personnel. The paper will also cover lessons learned during the performance of architecture trade studies and provide recommendations for ways to improve the process.

Challenges of Integrating NASAs Space Communication Networks

NASA Technical Reports Server (NTRS)

Reinert, Jessica M.; Barnes, Patrick

2013-01-01

The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a significant obstacle for integration. Over the past few decades of use, user missions and network personnel alike have grown accustomed to the processes by which services are provided by the NASA communications and navigation networks. The culture established by each network has created several challenges that need to be overcome in order to effectively integrate the networks. As with any change, there has been resistance, an apprehension to explore automation of existing processes, and a working environment that attempts to indirectly influence change without mandating compliance. Overcoming technical and cultural challenges is essential to successfully integrating the networks and although the challenges are numerous, the integration of the networks promises a more efficient space communications network for NASA and its customers, as well as potential long-term cost savings to the agency. This paper, Challenges of Integrating NASA Legacy Communications Networks, will provide a brief overview of the current NASA space communications networks as well as the an overview of the process implemented while performing the SCaN Trade Studies and an introduction to the requirements driving integration of the SCaN Networks. This paper will describe in detail the challenges experienced, both technical and cultural, while working with NASA space communications network-specific personnel. The paper will also cover lessons learned during the performance of architecture trade studies and provide recommendations for ways to improve the process.

A performance study of unmanned aerial vehicle-based sensor networks under cyber attack

NASA Astrophysics Data System (ADS)

Puchaty, Ethan M.

In UAV-based sensor networks, an emerging area of interest is the performance of these networks under cyber attack. This study seeks to evaluate the performance trade-offs from a System-of-Systems (SoS) perspective between various UAV communications architecture options in the context two missions: tracking ballistic missiles and tracking insurgents. An agent-based discrete event simulation is used to model a sensor communication network consisting of UAVs, military communications satellites, ground relay stations, and a mission control center. Network susceptibility to cyber attack is modeled with probabilistic failures and induced data variability, with performance metrics focusing on information availability, latency, and trustworthiness. Results demonstrated that using UAVs as routers increased network availability with a minimal latency penalty and communications satellite networks were best for long distance operations. Redundancy in the number of links between communication nodes helped mitigate cyber-caused link failures and add robustness in cases of induced data variability by an adversary. However, when failures were not independent, redundancy and UAV routing were detrimental in some cases to network performance. Sensitivity studies indicated that long cyber-caused downtimes and increasing failure dependencies resulted in build-ups of failures and caused significant degradations in network performance.

The Network Classroom.

ERIC Educational Resources Information Center

Maule, R. William

1993-01-01

Discussion of the role of new computer communications technologies in education focuses on modern networking systems, including fiber distributed data interface and Integrated Services Digital Network; strategies for implementing networked-based communication; and public online information resources for the classroom, including Bitnet, Internet,…

GATEWAY - COMMUNICATIONS GATEWAY SOFTWARE FOR NETEX, DECNET, AND TCP/IP

NASA Technical Reports Server (NTRS)

Keith, B.

1994-01-01

The Communications Gateway Software, GATEWAY, provides process-to-process communication between remote applications programs in different protocol domains. Communicating peer processes may be resident on any paired combination of NETEX, DECnet, or TCP/IP hosts. The gateway provides the necessary mapping from one protocol to another and will facilitate practical intermachine communications in a cost effective manner by eliminating the need to standardize on a single protocol or the need to implement multiple protocols in the host computers. The purpose of the gateway is to support data transfers between application programs on different host computers using different protocols. The gateway computer must be physically connected to both host computers and must contain the system software needed to use the communication protocols of both host computers. The communication process between application partners can be divided into three phases: session establishment, data transfer, and session termination. The communication protocols supported by GATEWAY (DECnet, NETEX, and TCP/IP) have addressing mechanisms that allow an application to identify itself and distinguish among other applications on the network. The exact form of the address varies depending on whether an application is passively offering (awaiting the receipt of a network connection from another network application) or actively connecting to another network. When the gateway is started, GATEWAY reads a file of address pairs. One of the address pairs is used by GATEWAY for passively offering on one network while the other address in the pair is used for actively connecting on the other network establishing the session. Now the two application partners can send and receive data in a manner appropriate to their home networks. GATEWAY accommodates full duplex transmissions. Thus, if the application partners are sophisticated enough, they can send and receive simultaneously. GATEWAY also keeps track of the number of bytes contained in each ransferred data packet. If GATEWAY detects an error during the data transfer, the sessions on both networks are terminated and the passive offer on the appropriate network is reissued. After performing the desired data transfer, one of the remote applications will send a network disconnect to the gateway to close its communication link. Upon detecting this network disconnect, GATEWAY replies with its own disconnect to ensure that the network connection has been fully terminated. Then, GATEWAY terminates its session with the other application by closing the communication link. GATEWAY has been implemented on a DEC VAX under VMS 4.7. It is written in ADA and has a central memory requirement of approximately 406K bytes. The communications protocols supported by GATEWAY are Network Systems Corporation's Network Executive (NETEX), Excelan's TCP/IP, and DECnet. GATEWAY was developed in 1988.

Randomized controlled trial of supplemental augmentative and alternative communication versus voice rest alone after phonomicrosurgery.

PubMed

Rousseau, Bernard; Gutmann, Michelle L; Mau, Theodore; Francis, David O; Johnson, Jeffrey P; Novaleski, Carolyn K; Vinson, Kimberly N; Garrett, C Gaelyn

2015-03-01

This randomized trial investigated voice rest and supplemental text-to-speech communication versus voice rest alone on visual analog scale measures of communication effectiveness and magnitude of voice use. Randomized clinical trial. Multicenter outpatient voice clinics. Thirty-seven patients undergoing phonomicrosurgery. Patients undergoing phonomicrosurgery were randomized to voice rest and supplemental text-to-speech communication or voice rest alone. The primary outcome measure was the impact of voice rest on ability to communicate effectively over a 7-day period. Pre- and postoperative magnitude of voice use was also measured as an observational outcome. Patients randomized to voice rest and supplemental text-to-speech communication reported higher median communication effectiveness on each postoperative day compared to those randomized to voice rest alone, with significantly higher median communication effectiveness on postoperative days 3 (P=.03) and 5 (P=.01). Magnitude of voice use did not differ on any preoperative (P>.05) or postoperative day (P>.05), nor did patients significantly decrease voice use as the surgery date approached (P>.05). However, there was a significant reduction in median voice use pre- to postoperatively across patients (P<.001) with median voice use ranging from 0 to 3 throughout the postoperative week. Supplemental text-to-speech communication increased patient-perceived communication effectiveness on postoperative days 3 and 5 over voice rest alone. With the prevalence of smartphones and the widespread use of text messaging, supplemental text-to-speech communication may provide an accessible and cost-effective communication option for patients on vocal restrictions. © American Academy of Otolaryngology—Head and Neck Surgery Foundation 2015.

A random spatial network model based on elementary postulates

USGS Publications Warehouse

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

Molecular inspired models for prediction and control of directional FSO/RF wireless networks

NASA Astrophysics Data System (ADS)

Llorca, Jaime; Milner, Stuart D.; Davis, Christopher C.

2010-08-01

Directional wireless networks using FSO and RF transmissions provide wireless backbone support for mobile communications in dynamic environments. The heterogeneous and dynamic nature of such networks challenges their robustness and requires self-organization mechanisms to assure end-to-end broadband connectivity. We developed a framework based on the definition of a potential energy function to characterize robustness in communication networks and the study of first and second order variations of the potential energy to provide prediction and control strategies for network performance optimization. In this paper, we present non-convex molecular potentials such as the Morse Potential, used to describe the potential energy of bonds within molecules, for the characterization of communication links in the presence of physical constraints such as the power available at the network nodes. The inclusion of the Morse Potential translates into adaptive control strategies where forces on network nodes drive the release, retention or reconfiguration of communication links for network performance optimization. Simulation results show the effectiveness of our self-organized control mechanism, where the physical topology reorganizes to maximize the number of source to destination communicating pairs. Molecular Normal Mode Analysis (NMA) techniques for assessing network performance degradation in dynamic networks are also presented. Preliminary results show correlation between peaks in the eigenvalues of the Hessian of the network potential and network degradation.

Communication Network Design: West Ottawa School District.

ERIC Educational Resources Information Center

Couch, David deS.

This report describes the technical details and rationale behind the decisions in the design and development of the communications network installed as part of a 1991-1993 district-wide construction project in the West Ottawa Public Schools (Michigan). The project called for development of a communications network to carry voice, data, and video…

Optical processing for future computer networks

NASA Technical Reports Server (NTRS)

Husain, A.; Haugen, P. R.; Hutcheson, L. D.; Warrior, J.; Murray, N.; Beatty, M.

1986-01-01

In the development of future data management systems, such as the NASA Space Station, a major problem represents the design and implementation of a high performance communication network which is self-correcting and repairing, flexible, and evolvable. To obtain the goal of designing such a network, it will be essential to incorporate distributed adaptive network control techniques. The present paper provides an outline of the functional and communication network requirements for the Space Station data management system. Attention is given to the mathematical representation of the operations being carried out to provide the required functionality at each layer of communication protocol on the model. The possible implementation of specific communication functions in optics is also considered.

Mechanical Cell-Cell Communication in Fibrous Networks: The Importance of Network Geometry.

PubMed

Humphries, D L; Grogan, J A; Gaffney, E A

2017-03-01

Cells contracting in extracellular matrix (ECM) can transmit stress over long distances, communicating their position and orientation to cells many tens of micrometres away. Such phenomena are not observed when cells are seeded on substrates with linear elastic properties, such as polyacrylamide (PA) gel. The ability for fibrous substrates to support far reaching stress and strain fields has implications for many physiological processes, while the mechanical properties of ECM are central to several pathological processes, including tumour invasion and fibrosis. Theoretical models have investigated the properties of ECM in a variety of network geometries. However, the effects of network architecture on mechanical cell-cell communication have received little attention. This work investigates the effects of geometry on network mechanics, and thus the ability for cells to communicate mechanically through different networks. Cell-derived displacement fields are quantified for various network geometries while controlling for network topology, cross-link density and micromechanical properties. We find that the heterogeneity of response, fibre alignment, and substrate displacement fields are sensitive to network choice. Further, we show that certain geometries support mechanical communication over longer distances than others. As such, we predict that the choice of network geometry is important in fundamental modelling of cell-cell interactions in fibrous substrates, as well as in experimental settings, where mechanical signalling at the cellular scale plays an important role. This work thus informs the construction of theoretical models for substrate mechanics and experimental explorations of mechanical cell-cell communication.

Hybrid Communication Architectures for Distributed Smart Grid Applications

DOE PAGES

Zhang, Jianhua; Hasandka, Adarsh; Wei, Jin; ...

2018-04-09

Wired and wireless communications both play an important role in the blend of communications technologies necessary to enable future smart grid communications. Hybrid networks exploit independent mediums to extend network coverage and improve performance. However, whereas individual technologies have been applied in simulation networks, as far as we know there is only limited attention that has been paid to the development of a suite of hybrid communication simulation models for the communications system design. Hybrid simulation models are needed to capture the mixed communication technologies and IP address mechanisms in one simulation. To close this gap, we have developed amore » suite of hybrid communication system simulation models to validate the critical system design criteria for a distributed solar Photovoltaic (PV) communications system, including a single trip latency of 300 ms, throughput of 9.6 Kbps, and packet loss rate of 1%. In conclusion, the results show that three low-power wireless personal area network (LoWPAN)-based hybrid architectures can satisfy three performance metrics that are critical for distributed energy resource communications.« less

Hybrid Communication Architectures for Distributed Smart Grid Applications

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

Zhang, Jianhua; Hasandka, Adarsh; Wei, Jin

Wired and wireless communications both play an important role in the blend of communications technologies necessary to enable future smart grid communications. Hybrid networks exploit independent mediums to extend network coverage and improve performance. However, whereas individual technologies have been applied in simulation networks, as far as we know there is only limited attention that has been paid to the development of a suite of hybrid communication simulation models for the communications system design. Hybrid simulation models are needed to capture the mixed communication technologies and IP address mechanisms in one simulation. To close this gap, we have developed amore » suite of hybrid communication system simulation models to validate the critical system design criteria for a distributed solar Photovoltaic (PV) communications system, including a single trip latency of 300 ms, throughput of 9.6 Kbps, and packet loss rate of 1%. In conclusion, the results show that three low-power wireless personal area network (LoWPAN)-based hybrid architectures can satisfy three performance metrics that are critical for distributed energy resource communications.« less

Interconnect Performance Evaluation of SGI Altix 3700 BX2, Cray X1, Cray Opteron Cluster, and Dell PowerEdge

NASA Technical Reports Server (NTRS)

Fatoohi, Rod; Saini, Subbash; Ciotti, Robert

2006-01-01

We study the performance of inter-process communication on four high-speed multiprocessor systems using a set of communication benchmarks. The goal is to identify certain limiting factors and bottlenecks with the interconnect of these systems as well as to compare these interconnects. We measured network bandwidth using different number of communicating processors and communication patterns, such as point-to-point communication, collective communication, and dense communication patterns. The four platforms are: a 512-processor SGI Altix 3700 BX2 shared-memory machine with 3.2 GB/s links; a 64-processor (single-streaming) Cray XI shared-memory machine with 32 1.6 GB/s links; a 128-processor Cray Opteron cluster using a Myrinet network; and a 1280-node Dell PowerEdge cluster with an InfiniBand network. Our, results show the impact of the network bandwidth and topology on the overall performance of each interconnect.

Flexible network wireless transceiver and flexible network telemetry transceiver

DOEpatents

Brown, Kenneth D.

2008-08-05

A transceiver for facilitating two-way wireless communication between a baseband application and other nodes in a wireless network, wherein the transceiver provides baseband communication networking and necessary configuration and control functions along with transmitter, receiver, and antenna functions to enable the wireless communication. More specifically, the transceiver provides a long-range wireless duplex communication node or channel between the baseband application, which is associated with a mobile or fixed space, air, water, or ground vehicle or other platform, and other nodes in the wireless network or grid. The transceiver broadly comprises a communication processor; a flexible telemetry transceiver including a receiver and a transmitter; a power conversion and regulation mechanism; a diplexer; and a phased array antenna system, wherein these various components and certain subcomponents thereof may be separately enclosed and distributable relative to the other components and subcomponents.

Design of Hybrid Mobile Communication Networks for Planetary Exploration

NASA Technical Reports Server (NTRS)

Alena, Richard L.; Ossenfort, John; Lee, Charles; Walker, Edward; Stone, Thom

2004-01-01

The Mobile Exploration System Project (MEX) at NASA Ames Research Center has been conducting studies into hybrid communication networks for future planetary missions. These networks consist of space-based communication assets connected to ground-based Internets and planetary surface-based mobile wireless networks. These hybrid mobile networks have been deployed in rugged field locations in the American desert and the Canadian arctic for support of science and simulation activities on at least six occasions. This work has been conducted over the past five years resulting in evolving architectural complexity, improved component characteristics and better analysis and test methods. A rich set of data and techniques have resulted from the development and field testing of the communication network during field expeditions such as the Haughton Mars Project and NASA Mobile Agents Project.

Engaging rural women in healthy lifestyle programs: insights from a randomized controlled trial.

PubMed

Kozica, Samantha L; Harrison, Cheryce L; Teede, Helena J; Ng, Sze; Moran, Lisa J; Lombard, Catherine B

2015-09-16

The obesity epidemic is well established, particularly in rural settings. Programs promoting healthy lifestyles for rural women are urgently needed; however, participant engagement is challenging. In the context of a large randomized controlled trial targeting the prevention of weight gain in rural women, we explored successful recruitment strategies and aimed to understand participants' barriers, enablers and reasons for program participation. We recruited women (aged 18-55 years) from the general rural Australian population. A mixed-methods approach was applied to explore factors that influenced program participation, including quantitative questionnaires for all participants (n = 649) and qualitative semi-structured interviews conducted for a subgroup of participants (n = 45). Data were collected at three time points: baseline, 6 and 12 months post program commencement. We recruited 649 rural women through a community communication and partnering strategy, a program marketing campaign and mobilization of social networks. Program participants were diverse across education and income levels and were representative of the wider Australian regional population. Factors that influenced program engagement were divided into personal (perceived program benefits and program accessibility) and social (peer persuasion and support). Identified enablers included convenience of the program location, perceived program utility, such as weight management and optimization of lifestyle choices, as well as attending the program with peer support. Barriers to engagement, which are likely exacerbated in rural communities included lack of anonymity, self-consciousness and segregated social networks in rural settings. Participants reported that eliciting local support and maximizing publicity is fundamental to improving future program engagement. Multiple program promotion strategies including communication, marketing and partnering, as well as mobilization of social networks and peer persuasion, enabled engagement of rural women into a healthy lifestyle program. These recruitment strategies are consistent with successful strategies utilized previously to recruit urban-dwelling women into lifestyle programs. Future engagement efforts in rural settings could be enhanced by hosting multiple sessions within existing socio-cultural networks and assuring participants that they will not need to share their personal health information with others in their community. Australia & New Zealand Clinical Trial Registry. Trial number ACTRN12612000115831. Date of registration 24 January 2012.

Fiber-Optic Network Architectures for Onboard Avionics Applications Investigated

NASA Technical Reports Server (NTRS)

Nguyen, Hung D.; Ngo, Duc H.

2003-01-01

This project is part of a study within the Advanced Air Transportation Technologies program undertaken at the NASA Glenn Research Center. The main focus of the program is the improvement of air transportation, with particular emphasis on air transportation safety. Current and future advances in digital data communications between an aircraft and the outside world will require high-bandwidth onboard communication networks. Radiofrequency (RF) systems, with their interconnection network based on coaxial cables and waveguides, increase the complexity of communication systems onboard modern civil and military aircraft with respect to weight, power consumption, and safety. In addition, safety and reliability concerns from electromagnetic interference between the RF components embedded in these communication systems exist. A simple, reliable, and lightweight network that is free from the effects of electromagnetic interference and capable of supporting the broadband communications needs of future onboard digital avionics systems cannot be easily implemented using existing coaxial cable-based systems. Fiber-optical communication systems can meet all these challenges of modern avionics applications in an efficient, cost-effective manner. The objective of this project is to present a number of optical network architectures for onboard RF signal distribution. Because of the emergence of a number of digital avionics devices requiring high-bandwidth connectivity, fiber-optic RF networks onboard modern aircraft will play a vital role in ensuring a low-noise, highly reliable RF communication system. Two approaches are being used for network architectures for aircraft onboard fiber-optic distribution systems: a hybrid RF-optical network and an all-optical wavelength division multiplexing (WDM) network.

Supercomputers ready for use as discovery machines for neuroscience.

PubMed

Helias, Moritz; Kunkel, Susanne; Masumoto, Gen; Igarashi, Jun; Eppler, Jochen Martin; Ishii, Shin; Fukai, Tomoki; Morrison, Abigail; Diesmann, Markus

2012-01-01

NEST is a widely used tool to simulate biological spiking neural networks. Here we explain the improvements, guided by a mathematical model of memory consumption, that enable us to exploit for the first time the computational power of the K supercomputer for neuroscience. Multi-threaded components for wiring and simulation combine 8 cores per MPI process to achieve excellent scaling. K is capable of simulating networks corresponding to a brain area with 10(8) neurons and 10(12) synapses in the worst case scenario of random connectivity; for larger networks of the brain its hierarchical organization can be exploited to constrain the number of communicating computer nodes. We discuss the limits of the software technology, comparing maximum filling scaling plots for K and the JUGENE BG/P system. The usability of these machines for network simulations has become comparable to running simulations on a single PC. Turn-around times in the range of minutes even for the largest systems enable a quasi interactive working style and render simulations on this scale a practical tool for computational neuroscience.

Supercomputers Ready for Use as Discovery Machines for Neuroscience

PubMed Central

Helias, Moritz; Kunkel, Susanne; Masumoto, Gen; Igarashi, Jun; Eppler, Jochen Martin; Ishii, Shin; Fukai, Tomoki; Morrison, Abigail; Diesmann, Markus

2012-01-01

NEST is a widely used tool to simulate biological spiking neural networks. Here we explain the improvements, guided by a mathematical model of memory consumption, that enable us to exploit for the first time the computational power of the K supercomputer for neuroscience. Multi-threaded components for wiring and simulation combine 8 cores per MPI process to achieve excellent scaling. K is capable of simulating networks corresponding to a brain area with 108 neurons and 1012 synapses in the worst case scenario of random connectivity; for larger networks of the brain its hierarchical organization can be exploited to constrain the number of communicating computer nodes. We discuss the limits of the software technology, comparing maximum filling scaling plots for K and the JUGENE BG/P system. The usability of these machines for network simulations has become comparable to running simulations on a single PC. Turn-around times in the range of minutes even for the largest systems enable a quasi interactive working style and render simulations on this scale a practical tool for computational neuroscience. PMID:23129998

Randomizing Genome-Scale Metabolic Networks

PubMed Central

Samal, Areejit; Martin, Olivier C.

2011-01-01

Networks coming from protein-protein interactions, transcriptional regulation, signaling, or metabolism may appear to have “unusual” properties. To quantify this, it is appropriate to randomize the network and test the hypothesis that the network is not statistically different from expected in a motivated ensemble. However, when dealing with metabolic networks, the randomization of the network using edge exchange generates fictitious reactions that are biochemically meaningless. Here we provide several natural ensembles of randomized metabolic networks. A first constraint is to use valid biochemical reactions. Further constraints correspond to imposing appropriate functional constraints. We explain how to perform these randomizations with the help of Markov Chain Monte Carlo (MCMC) and show that they allow one to approach the properties of biological metabolic networks. The implication of the present work is that the observed global structural properties of real metabolic networks are likely to be the consequence of simple biochemical and functional constraints. PMID:21779409

7.3 Communications and Navigation

NASA Technical Reports Server (NTRS)

Manning, Rob

2005-01-01

This presentation gives an overview of the networks NASA currently uses to support space communications and navigation, and the requirements for supporting future deep space missions, including manned lunar and Mars missions. The presentation addresses the Space Network, Deep Space Network, and Ground Network, why new support systems are needed, and the potential for catastrophic failure of aging antennas. Space communications and navigation are considered during Aerocapture, Entry, Descent and Landing (AEDL) only in order to precisely position, track and interact with the spacecraft at its destination (moon, Mars and Earth return) arrival. The presentation recommends a combined optical/radio frequency strategy for deep space communications.

System architecture for an advanced Canadian communications satellite demonstration mission

NASA Astrophysics Data System (ADS)

Takats, P.; Irani, S.

1992-03-01

An advanced communications satellite system that provides single hop interconnectivity and interworking for both a personal communications network and an advanced private business network in the Ka and Ku bands respectively, is presented. An overall network perspective is discussed that studies the interface of such an advanced satellite communication system to the terrestrial network in the context of the Open Systems Interconnection model. It is shown that this proposed satellite system can dynamically establish links and efficiently allocate the satellite resource amongst the user terminal population for a mix of data and voice traffic.

Trend on High-speed Power Line Communication Technology

NASA Astrophysics Data System (ADS)

Ogawa, Osamu

High-speed power line communication (PLC) is useful technology to easily build the communication networks, because construction of new infrastructure is not necessary. In Europe and America, PLC has been used for broadband networks since the beginning of 21th century. In Japan, high-speed PLC was deregulated only indoor usage in 2006. Afterward it has been widely used for home area network, LAN in hotels and school buildings and so on. And recently, PLC is greatly concerned as communication technology for smart grid network. In this paper, the author surveys the high-speed PLC technology and its current status.

Flow motifs reveal limitations of the static framework to represent human interactions

NASA Astrophysics Data System (ADS)

Rocha, Luis E. C.; Blondel, Vincent D.

2013-04-01

Networks are commonly used to define underlying interaction structures where infections, information, or other quantities may spread. Although the standard approach has been to aggregate all links into a static structure, some studies have shown that the time order in which the links are established may alter the dynamics of spreading. In this paper, we study the impact of the time ordering in the limits of flow on various empirical temporal networks. By using a random walk dynamics, we estimate the flow on links and convert the original undirected network (temporal and static) into a directed flow network. We then introduce the concept of flow motifs and quantify the divergence in the representativity of motifs when using the temporal and static frameworks. We find that the regularity of contacts and persistence of vertices (common in email communication and face-to-face interactions) result on little differences in the limits of flow for both frameworks. On the other hand, in the case of communication within a dating site and of a sexual network, the flow between vertices changes significantly in the temporal framework such that the static approximation poorly represents the structure of contacts. We have also observed that cliques with 3 and 4 vertices containing only low-flow links are more represented than the same cliques with all high-flow links. The representativity of these low-flow cliques is higher in the temporal framework. Our results suggest that the flow between vertices connected in cliques depend on the topological context in which they are placed and in the time sequence in which the links are established. The structure of the clique alone does not completely characterize the potential of flow between the vertices.

The impact of socio-technical communication styles on the diversity and innovation potential of global science collaboratories

DOE PAGES

Ozmen, Ozgur; Yilmaz, Levent; Smith, Jeffrey

2016-02-09

Emerging cyber-infrastructure tools are enabling scientists to transparently co-develop, share, and communicate about real-time diverse forms of knowledge artifacts. In these environments, communication preferences of scientists are posited as an important factor affecting innovation capacity and robustness of social and knowledge network structures. Scientific knowledge creation in such communities is called global participatory science (GPS). Recently, using agent-based modeling and collective action theory as a basis, a complex adaptive social communication network model (CollectiveInnoSim) is implemented. This work leverages CollectiveInnoSim implementing communication preferences of scientists. Social network metrics and knowledge production patterns are used as proxy metrics to infer innovationmore » potential of emergent knowledge and collaboration networks. The objective is to present the underlying communication dynamics of GPS in a form of computational model and delineate the impacts of various communication preferences of scientists on innovation potential of the collaboration network. Ultimately, the insight gained can help policy-makers to design GPS environments and promote innovation.« less

The impact of socio-technical communication styles on the diversity and innovation potential of global science collaboratories

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

Ozmen, Ozgur; Yilmaz, Levent; Smith, Jeffrey

Emerging cyber-infrastructure tools are enabling scientists to transparently co-develop, share, and communicate about real-time diverse forms of knowledge artifacts. In these environments, communication preferences of scientists are posited as an important factor affecting innovation capacity and robustness of social and knowledge network structures. Scientific knowledge creation in such communities is called global participatory science (GPS). Recently, using agent-based modeling and collective action theory as a basis, a complex adaptive social communication network model (CollectiveInnoSim) is implemented. This work leverages CollectiveInnoSim implementing communication preferences of scientists. Social network metrics and knowledge production patterns are used as proxy metrics to infer innovationmore » potential of emergent knowledge and collaboration networks. The objective is to present the underlying communication dynamics of GPS in a form of computational model and delineate the impacts of various communication preferences of scientists on innovation potential of the collaboration network. Ultimately, the insight gained can help policy-makers to design GPS environments and promote innovation.« less

Mission Command in the Age of Network-Enabled Operations: Social Network Analysis of Information Sharing and Situation Awareness.

PubMed

Buchler, Norbou; Fitzhugh, Sean M; Marusich, Laura R; Ungvarsky, Diane M; Lebiere, Christian; Gonzalez, Cleotilde

2016-01-01

A common assumption in organizations is that information sharing improves situation awareness and ultimately organizational effectiveness. The sheer volume and rapid pace of information and communications received and readily accessible through computer networks, however, can overwhelm individuals, resulting in data overload from a combination of diverse data sources, multiple data formats, and large data volumes. The current conceptual framework of network enabled operations (NEO) posits that robust networking and information sharing act as a positive feedback loop resulting in greater situation awareness and mission effectiveness in military operations (Alberts and Garstka, 2004). We test this assumption in a large-scale, 2-week military training exercise. We conducted a social network analysis of email communications among the multi-echelon Mission Command staff (one Division and two sub-ordinate Brigades) and assessed the situational awareness of every individual. Results from our exponential random graph models challenge the aforementioned assumption, as increased email output was associated with lower individual situation awareness. It emerged that higher situation awareness was associated with a lower probability of out-ties, so that broadly sending many messages decreased the likelihood of attaining situation awareness. This challenges the hypothesis that increased information sharing improves situation awareness, at least for those doing the bulk of the sharing. In addition, we observed two trends that reflect a compartmentalizing of networked information sharing as email links were more commonly formed among members of the command staff with both similar functions and levels of situation awareness, than between two individuals with dissimilar functions and levels of situation awareness; both those findings can be interpreted to reflect effects of homophily. Our results have major implications that challenge the current conceptual framework of NEO. In addition, the information sharing network was largely imbalanced and dominated by a few key individuals so that most individuals in the network have very few email connections, but a small number of individuals have very many connections. These results highlight several major growing pains for networked organizations and military organizations in particular.

Mission Command in the Age of Network-Enabled Operations: Social Network Analysis of Information Sharing and Situation Awareness

PubMed Central

Buchler, Norbou; Fitzhugh, Sean M.; Marusich, Laura R.; Ungvarsky, Diane M.; Lebiere, Christian; Gonzalez, Cleotilde

2016-01-01

A common assumption in organizations is that information sharing improves situation awareness and ultimately organizational effectiveness. The sheer volume and rapid pace of information and communications received and readily accessible through computer networks, however, can overwhelm individuals, resulting in data overload from a combination of diverse data sources, multiple data formats, and large data volumes. The current conceptual framework of network enabled operations (NEO) posits that robust networking and information sharing act as a positive feedback loop resulting in greater situation awareness and mission effectiveness in military operations (Alberts and Garstka, 2004). We test this assumption in a large-scale, 2-week military training exercise. We conducted a social network analysis of email communications among the multi-echelon Mission Command staff (one Division and two sub-ordinate Brigades) and assessed the situational awareness of every individual. Results from our exponential random graph models challenge the aforementioned assumption, as increased email output was associated with lower individual situation awareness. It emerged that higher situation awareness was associated with a lower probability of out-ties, so that broadly sending many messages decreased the likelihood of attaining situation awareness. This challenges the hypothesis that increased information sharing improves situation awareness, at least for those doing the bulk of the sharing. In addition, we observed two trends that reflect a compartmentalizing of networked information sharing as email links were more commonly formed among members of the command staff with both similar functions and levels of situation awareness, than between two individuals with dissimilar functions and levels of situation awareness; both those findings can be interpreted to reflect effects of homophily. Our results have major implications that challenge the current conceptual framework of NEO. In addition, the information sharing network was largely imbalanced and dominated by a few key individuals so that most individuals in the network have very few email connections, but a small number of individuals have very many connections. These results highlight several major growing pains for networked organizations and military organizations in particular. PMID:27445905

Ad Hoc Access Gateway Selection Algorithm

NASA Astrophysics Data System (ADS)

Jie, Liu

With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

Communication networks of men facing a diagnosis of prostate cancer.

PubMed

Brown, Dot; Oetzel, John; Henderson, Alison

2016-11-01

This study seeks to identify the factors that shape the communication networks of men who face a potential diagnosis of prostate cancer, and how these factors relate to their disclosure about their changing health status. Men facing a potential diagnosis of prostate cancer are in a challenging situation; the support benefits of disclosing their changing health status to others in their communication networks is set against a backdrop of the potential stigma and uncertainty of the diagnosis. All men on a prostate biopsy waiting list were eligible for inclusion in an exploratory and interpretive study. Semi-structured interviews with 40 men explored their network structures and disclosure of health information. Thematic analysis highlighted the factors which contributed to their network structures and their disclosure about their health status. Four network factors shaped men's perspectives about disclosing their health status: (1) tie strength, comprising both strong and weak ties; (2) knowledgeable others, with a focus on medical professionals in the family; (3) homophily, which included other individuals with a similar medical condition; and (4) geographical proximity, with a preference for face-to-face communication. Communication networks influence men's disclosure of their health status and in particular weak ties with medical knowledge have an important role. Men who use the potential for support in their networks may experience improved psychosocial outcomes. Using these four network factors-tie strength, knowledgeable others, homophily or geographical proximity-to forecast men's willingness to disclose helps identify men who lack potential support and so are at risk of poor psychosocial health. Those with few strong ties or knowledgeable others in their networks may be in the at-risk cohort. The support provided in communication networks complements formal medical care from nurses and other health professionals, and encouraging patients to use their communication networks improves the psychosocial health of the men themselves, their partners and their families. © 2016 John Wiley & Sons Ltd.

The Deep Space Network. [tracking and communication functions and facilities

NASA Technical Reports Server (NTRS)

1974-01-01

The objectives, functions, and organization of the Deep Space Network are summarized. The Deep Space Instrumentation Facility, the Ground Communications Facility, and the Network Control System are described.

Compliance and Functional Testing of IEEE 1451.1 for NCAP-to-NCAP Communications in a Sensor Network

NASA Technical Reports Server (NTRS)

Figueroa, Jorge; Gurkan, Deniz; Yuan, X.; Benhaddou, D.; Liu, H.; Singla, A.; Franzl, R.; Ma, H.; Bhatt, S.; Morris, J.;

Statistically validated mobile communication networks: the evolution of motifs in European and Chinese data

NASA Astrophysics Data System (ADS)

Li, Ming-Xia; Palchykov, Vasyl; Jiang, Zhi-Qiang; Kaski, Kimmo; Kertész, János; Miccichè, Salvatore; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N.

2014-08-01

Big data open up unprecedented opportunities for investigating complex systems, including society. In particular, communication data serve as major sources for computational social sciences, but they have to be cleaned and filtered as they may contain spurious information due to recording errors as well as interactions, like commercial and marketing activities, not directly related to the social network. The network constructed from communication data can only be considered as a proxy for the network of social relationships. Here we apply a systematic method, based on multiple-hypothesis testing, to statistically validate the links and then construct the corresponding Bonferroni network, generalized to the directed case. We study two large datasets of mobile phone records, one from Europe and the other from China. For both datasets we compare the raw data networks with the corresponding Bonferroni networks and point out significant differences in the structures and in the basic network measures. We show evidence that the Bonferroni network provides a better proxy for the network of social interactions than the original one. Using the filtered networks, we investigated the statistics and temporal evolution of small directed 3-motifs and concluded that closed communication triads have a formation time scale, which is quite fast and typically intraday. We also find that open communication triads preferentially evolve into other open triads with a higher fraction of reciprocated calls. These stylized facts were observed for both datasets.

Digital Networked Information Society and Public Health: Problems and Promises of Networked Health Communication of Lay Publics.

PubMed

Kim, Jeong-Nam

2018-01-01

This special issue of Health Communication compiles 10 articles to laud the promise and yet confront the problems in the digital networked information society related to public health. We present this anthology of symphony and cacophony of lay individuals' communicative actions in a digital networked information society. The collection of problems and promise of the new digital world may be a cornerstone joining two worlds-pre- and postdigital network society-and we hope this special issue will help better shape our future states of public health.

Development of a space-systems network testbed

NASA Technical Reports Server (NTRS)

Lala, Jaynarayan; Alger, Linda; Adams, Stuart; Burkhardt, Laura; Nagle, Gail; Murray, Nicholas

1988-01-01

This paper describes a communications network testbed which has been designed to allow the development of architectures and algorithms that meet the functional requirements of future NASA communication systems. The central hardware components of the Network Testbed are programmable circuit switching communication nodes which can be adapted by software or firmware changes to customize the testbed to particular architectures and algorithms. Fault detection, isolation, and reconfiguration has been implemented in the Network with a hybrid approach which utilizes features of both centralized and distributed techniques to provide efficient handling of faults within the Network.

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.

Computational Characterization of Type I collagen-based Extra-cellular Matrix

NASA Astrophysics Data System (ADS)

Liang, Long; Jones, Christopher Allen Rucksack; Lin, Daniel; Jiao, Yang; Sun, Bo

2015-03-01

A model of extracellular matrix (ECM) of collagen fibers has been built, in which cells could communicate with distant partners via fiber-mediated long-range-transmitted stress states. The ECM is modeled as a spring-like fiber network derived from skeletonized confocal microscopy data. Different local and global perturbations have been performed on the network, each followed by an optimized global Monte-Carlo (MC) energy minimization leading to the deformed network in response to the perturbations. In the optimization, a highly efficient local energy update procedure is employed and force-directed MC moves are used, which results in a convergence to the energy minimum state 20 times faster than the commonly used random displacement trial moves in MC. Further analysis and visualization of the distribution and correlation of the resulting force network reveal that local perturbations can give rise to global impacts: the force chains formed with a linear extent much further than the characteristic length scale associated with the perturbation sites and average fiber length. This behavior provides a strong evidence for our hypothesis of fiber-mediated long-range force transmission in ECM networks and the resulting long-range cell-cell mechanical signaling. ASU Seed Grant.

Simultaneous and coordinated rotational switching of all molecular rotors in a network

DOE PAGES

Zhang, Y.; Kersell, H.; Stefak, R.; ...

2016-05-09

A range of artificial molecular systems have been created that can exhibit controlled linear and rotational motion. In the development of such systems, a key step is the addition of communication between molecules in a network. Here, we show that a two-dimensional array of dipolar molecular rotors can undergo simultaneous rotational switching by applying an electric field from the tip of a scanning tunnelling microscope. Several hundred rotors made from porphyrin-based double-decker complexes can be simultaneously rotated when in a hexagonal rotor network on a Cu(111) surface by applying biases above ±1 V at 80 K. The phenomenon is observedmore » only in a hexagonal rotor network due to the degeneracy of the ground state dipole rotational energy barrier of the system. Defects are essential to increase electric torque on the rotor network and to stabilize the switched rotor domains. At low biases and low initial rotator angles, slight reorientations of individual rotors can occur resulting in the rotator arms pointing in different directions. In conclusion, analysis reveals that the rotator arm directions here are not random, but are coordinated to minimize energy via cross talk among the rotors through dipolar interactions.« less

Teaching Students How to Integrate and Assess Social Networking Tools in Marketing Communications

ERIC Educational Resources Information Center

Schlee, Regina Pefanis; Harich, Katrin R.

2013-01-01

This research is based on two studies that focus on teaching students how to integrate and assess social networking tools in marketing communications. Study 1 examines how students in marketing classes utilize social networking tools and explores their attitudes regarding the use of such tools for marketing communications. Study 2 focuses on an…

Multireceiver Acoustic Communications in Time-Varying Environments

DTIC Science & Technology

2014-06-01

Canberra, ACT, 2012, pp. 1–7. [7] W. Chen and F. Yanjun, “Physical layer design consideration for underwater acoustic sensor networks ,”3rd IEEE Int...analysis of underwater acoustic MIMO communications,”OCEANS, Sydney, NSW, 2010, pp. 1–8. [9] Wines lab (2013). Wireless networks and embedded... NETWORKS ......................................................................3 B. CHALLENGES OF UNDERWATER ACOUSTIC COMMUNICATIONS

The Deep Space Network: A Radio Communications Instrument for Deep Space Exploration

NASA Technical Reports Server (NTRS)

Renzetti, N. A.; Stelzried, C. T.; Noreen, G. K.; Slobin, S. D.; Petty, S. M.; Trowbridge, D. L.; Donnelly, H.; Kinman, P. W.; Armstrong, J. W.; Burow, N. A.

1983-01-01

The primary purpose of the Deep Space Network (DSN) is to serve as a communications instrument for deep space exploration, providing communications between the spacecraft and the ground facilities. The uplink communications channel provides instructions or commands to the spacecraft. The downlink communications channel provides command verification and spacecraft engineering and science instrument payload data.

Source Localization in Wireless Sensor Networks with Randomly Distributed Elements under Multipath Propagation Conditions

DTIC Science & Technology

2009-03-01

IN WIRELESS SENSOR NETWORKS WITH RANDOMLY DISTRIBUTED ELEMENTS UNDER MULTIPATH PROPAGATION CONDITIONS by Georgios Tsivgoulis March 2009...COVERED Engineer’s Thesis 4. TITLE Source Localization in Wireless Sensor Networks with Randomly Distributed Elements under Multipath Propagation...the non-line-of-sight information. 15. NUMBER OF PAGES 111 14. SUBJECT TERMS Wireless Sensor Network , Direction of Arrival, DOA, Random

Enhanced Communication Network Solution for Positive Train Control Implementation

NASA Technical Reports Server (NTRS)

Fatehi, M. T.; Simon, J.; Chang, W.; Chow, E. T.; Burleigh, S. C.

2011-01-01

The commuter and freight railroad industry is required to implement Positive Train Control (PTC) by 2015 (2012 for Metrolink), a challenging network communications problem. This paper will discuss present technologies developed by the National Aeronautics and Space Administration (NASA) to overcome comparable communication challenges encountered in deep space mission operations. PTC will be based on a new cellular wireless packet Internet Protocol (IP) network. However, ensuring reliability in such a network is difficult due to the "dead zones" and transient disruptions we commonly experience when we lose calls in commercial cellular networks. These disruptions make it difficult to meet PTC s stringent reliability (99.999%) and safety requirements, deployment deadlines, and budget. This paper proposes innovative solutions based on space-proven technologies that would help meet these challenges: (1) Delay Tolerant Networking (DTN) technology, designed for use in resource-constrained, embedded systems and currently in use on the International Space Station, enables reliable communication over networks in which timely data acknowledgments might not be possible due to transient link outages. (2) Policy-Based Management (PBM) provides dynamic management capabilities, allowing vital data to be exchanged selectively (with priority) by utilizing alternative communication resources. The resulting network may help railroads implement PTC faster, cheaper, and more reliably.

Quantum network with trusted and untrusted relays

NASA Astrophysics Data System (ADS)

Ma, Xiongfeng; Annabestani, Razieh; Fung, Chi-Hang Fred; Lo, Hoi-Kwong; Lütkenhaus, Norbert; PitkäNen, David; Razavi, Mohsen

2012-02-01

Quantum key distribution offers two distant users to establish a random secure key by exploiting properties of quantum mechanics, whose security has proven in theory. In practice, many lab and field demonstrations have been performed in the last 20 years. Nowadays, quantum network with quantum key distribution systems are tested around the world, such as in China, Europe, Japan and US. In this talk, I will give a brief introduction of recent development for quantum network. For the untrusted relay part, I will introduce the measurement-device-independent quantum key distribution scheme and a quantum relay with linear optics. The security of such scheme is proven without assumptions on the detection devices, where most of quantum hacking strategies are launched. This scheme can be realized with current technology. For the trusted relay part, I will introduce so-called delayed privacy amplification, with which no error correction and privacy amplification is necessarily to be performed between users and the relay. In this way, classical communications and computational power requirement on the relay site will be reduced.

Provably Secure Heterogeneous Access Control Scheme for Wireless Body Area Network.

PubMed

Omala, Anyembe Andrew; Mbandu, Angolo Shem; Mutiria, Kamenyi Domenic; Jin, Chunhua; Li, Fagen

2018-04-28

Wireless body area network (WBAN) provides a medium through which physiological information could be harvested and transmitted to application provider (AP) in real time. Integrating WBAN in a heterogeneous Internet of Things (IoT) ecosystem would enable an AP to monitor patients from anywhere and at anytime. However, the IoT roadmap of interconnected 'Things' is still faced with many challenges. One of the challenges in healthcare is security and privacy of streamed medical data from heterogeneously networked devices. In this paper, we first propose a heterogeneous signcryption scheme where a sender is in a certificateless cryptographic (CLC) environment while a receiver is in identity-based cryptographic (IBC) environment. We then use this scheme to design a heterogeneous access control protocol. Formal security proof for indistinguishability against adaptive chosen ciphertext attack and unforgeability against adaptive chosen message attack in random oracle model is presented. In comparison with some of the existing access control schemes, our scheme has lower computation and communication cost.

Multistage switching hardware and software implementations for student experiment purpose

NASA Astrophysics Data System (ADS)

Sani, A.; Suherman

2018-02-01

Current communication and internet networks are underpinned by the switching technologies that interconnect one network to the others. Students’ understanding on networks rely on how they conver the theories. However, understanding theories without touching the reality may exert spots in the overall knowledge. This paper reports the progress of the multistage switching design and implementation for student laboratory activities. The hardware and software designs are based on three stages clos switching architecture with modular 2x2 switches, controlled by an arduino microcontroller. The designed modules can also be extended for batcher and bayan switch, and working on circuit and packet switching systems. The circuit analysis and simulation show that the blocking probability for each switch combinations can be obtained by generating random or patterned traffics. The mathematic model and simulation analysis shows 16.4% blocking probability differences as the traffic generation is uniform. The circuits design components and interfacing solution have been identified to allow next step implementation.

Randomized Controlled Trial of Supplemental Augmentative and Alternative Communication versus Voice Rest Alone after Phonomicrosurgery

PubMed Central

Rousseau, Bernard; Gutmann, Michelle L.; Mau, I-fan Theodore; Francis, David O.; Johnson, Jeffrey P.; Novaleski, Carolyn K.; Vinson, Kimberly N.; Garrett, C. Gaelyn

2015-01-01

Objective This randomized trial investigated voice rest and supplemental text-to-speech communication versus voice rest alone on visual analog scale measures of communication effectiveness and magnitude of voice use. Study Design Randomized clinical trial. Setting Multicenter outpatient voice clinics. Subjects Thirty-seven patients undergoing phonomicrosurgery. Methods Patients undergoing phonomicrosurgery were randomized to voice rest and supplemental text-to-speech communication or voice rest alone. The primary outcome measure was the impact of voice rest on ability to communicate effectively over a seven-day period. Pre- and post-operative magnitude of voice use was also measured as an observational outcome. Results Patients randomized to voice rest and supplemental text-to-speech communication reported higher median communication effectiveness on each post-operative day compared to those randomized to voice rest alone, with significantly higher median communication effectiveness on post-operative day 3 (p = 0.03) and 5 (p = 0.01). Magnitude of voice use did not differ on any pre-operative (p > 0.05) or post-operative day (p > 0.05), nor did patients significantly decrease voice use as the surgery date approached (p > 0.05). However, there was a significant reduction in median voice use pre- to post-operatively across patients (p < 0.001) with median voice use ranging from 0–3 throughout the post-operative week. Conclusion Supplemental text-to-speech communication increased patient perceived communication effectiveness on post-operative days 3 and 5 over voice rest alone. With the prevalence of smartphones and the widespread use of text messaging, supplemental text-to-speech communication may provide an accessible and cost-effective communication option for patients on vocal restrictions. PMID:25605690

Bridges in complex networks

NASA Astrophysics Data System (ADS)

Wu, Ang-Kun; Tian, Liang; Liu, Yang-Yu

2018-01-01

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real networks typically have more bridges than their completely randomized counterparts, but they have a fraction of bridges that is very similar to their degree-preserving randomizations. We define an edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have a very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction and the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions.

Percolation and epidemics in random clustered networks

NASA Astrophysics Data System (ADS)

Miller, Joel C.

2009-08-01

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree nodes. We introduce a class of random clustered networks and a class of random unclustered networks with the same preferential mixing. Percolation in the clustered networks reduces the component sizes and increases the epidemic threshold compared to the unclustered networks.

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

Kuruganti, Phani Teja

The smart grid is a combined process of revitalizing the traditional power grid applications and introducing new applications to improve the efficiency of power generation, transmission and distribution. This can be achieved by leveraging advanced communication and networking technologies. Therefore the selection of the appropriate communication technology for different smart grid applications has been debated a lot in the recent past. After comparing different possible technologies, a recent research study has arrived at a conclusion that the 3G cellular technology is the right choice for distribution side smart grid applications like smart metering, advanced distribution automation and demand response managementmore » system. In this paper, we argue that the current 3G/4G cellular technologies are not an appropriate choice for smart grid distribution applications and propose a Hybrid Spread Spectrum (HSS) based Advanced Metering Infrastructure (AMI) as one of the alternatives to 3G/4G technologies. We present a preliminary PHY and MAC layer design of a HSS based AMI network and evaluate their performance using matlab and NS2 simulations. Also, we propose a time hierarchical scheme that can significantly reduce the volume of random access traffic generated during blackouts and the delay in power outage reporting.« less

NASA/DOD Aerospace Knowledge Diffusion Research Project. Report 35: The use of computer networks in aerospace engineering

NASA Technical Reports Server (NTRS)

Bishop, Ann P.; Pinelli, Thomas E.

1995-01-01

This research used survey research to explore and describe the use of computer networks by aerospace engineers. The study population included 2000 randomly selected U.S. aerospace engineers and scientists who subscribed to Aerospace Engineering. A total of 950 usable questionnaires were received by the cutoff date of July 1994. Study results contribute to existing knowledge about both computer network use and the nature of engineering work and communication. We found that 74 percent of mail survey respondents personally used computer networks. Electronic mail, file transfer, and remote login were the most widely used applications. Networks were used less often than face-to-face interactions in performing work tasks, but about equally with reading and telephone conversations, and more often than mail or fax. Network use was associated with a range of technical, organizational, and personal factors: lack of compatibility across systems, cost, inadequate access and training, and unwillingness to embrace new technologies and modes of work appear to discourage network use. The greatest positive impacts from networking appear to be increases in the amount of accurate and timely information available, better exchange of ideas across organizational boundaries, and enhanced work flexibility, efficiency, and quality. Involvement with classified or proprietary data and type of organizational structure did not distinguish network users from nonusers. The findings can be used by people involved in the design and implementation of networks in engineering communities to inform the development of more effective networking systems, services, and policies.

Privacy Issues of a National Research and Education Network.

ERIC Educational Resources Information Center

Katz, James E.; Graveman, Richard F.

1991-01-01

Discussion of the right to privacy of communications focuses on privacy expectations within a National Research and Education Network (NREN). Highlights include privacy needs in scientific and education communications; academic and research networks; network security and privacy concerns; protection strategies; and consequences of privacy…

Protocol for communications in potentially noisy environments

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

Boyd, Gerlad M.; Farrow, Jeffrey

2016-02-09

A communications protocol that is designed for transmission of data in networks that are subjected to harsh conditions is described herein. A network includes a plurality of devices, where the devices comprise respective nodes. The nodes are in communication with one another by way of a central network hub. The protocol causes the nodes to transmit data over a network bus at different data rates depending upon whether the nodes are operating normally or an arbitration procedure has been invoked.

Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

DOEpatents

Archer, Charles J [Rochester, MN; Hardwick, Camesha R [Fayetteville, NC; McCarthy, Patrick J [Rochester, MN; Wallenfelt, Brian P [Eden Prairie, MN

2009-06-23

Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

The Geospatial Characteristics of a Social Movement Communication Network

PubMed Central

Conover, Michael D.; Davis, Clayton; Ferrara, Emilio; McKelvey, Karissa; Menczer, Filippo; Flammini, Alessandro

2013-01-01

Social movements rely in large measure on networked communication technologies to organize and disseminate information relating to the movements’ objectives. In this work we seek to understand how the goals and needs of a protest movement are reflected in the geographic patterns of its communication network, and how these patterns differ from those of stable political communication. To this end, we examine an online communication network reconstructed from over 600,000 tweets from a thirty-six week period covering the birth and maturation of the American anticapitalist movement, Occupy Wall Street. We find that, compared to a network of stable domestic political communication, the Occupy Wall Street network exhibits higher levels of locality and a hub and spoke structure, in which the majority of non-local attention is allocated to high-profile locations such as New York, California, and Washington D.C. Moreover, we observe that information flows across state boundaries are more likely to contain framing language and references to the media, while communication among individuals in the same state is more likely to reference protest action and specific places and times. Tying these results to social movement theory, we propose that these features reflect the movement’s efforts to mobilize resources at the local level and to develop narrative frames that reinforce collective purpose at the national level. PMID:23483885

The geospatial characteristics of a social movement communication network.

PubMed

Conover, Michael D; Davis, Clayton; Ferrara, Emilio; McKelvey, Karissa; Menczer, Filippo; Flammini, Alessandro

2013-01-01

Social movements rely in large measure on networked communication technologies to organize and disseminate information relating to the movements' objectives. In this work we seek to understand how the goals and needs of a protest movement are reflected in the geographic patterns of its communication network, and how these patterns differ from those of stable political communication. To this end, we examine an online communication network reconstructed from over 600,000 tweets from a thirty-six week period covering the birth and maturation of the American anticapitalist movement, Occupy Wall Street. We find that, compared to a network of stable domestic political communication, the Occupy Wall Street network exhibits higher levels of locality and a hub and spoke structure, in which the majority of non-local attention is allocated to high-profile locations such as New York, California, and Washington D.C. Moreover, we observe that information flows across state boundaries are more likely to contain framing language and references to the media, while communication among individuals in the same state is more likely to reference protest action and specific places and times. Tying these results to social movement theory, we propose that these features reflect the movement's efforts to mobilize resources at the local level and to develop narrative frames that reinforce collective purpose at the national level.

Random walks and diffusion on networks

NASA Astrophysics Data System (ADS)

Masuda, Naoki; Porter, Mason A.; Lambiotte, Renaud

2017-11-01

Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including diffusion, interactions, and opinions among humans and animals; and can be used to extract information about important entities or dense groups of entities in a network. Random walks have been studied for many decades on both regular lattices and (especially in the last couple of decades) on networks with a variety of structures. In the present article, we survey the theory and applications of random walks on networks, restricting ourselves to simple cases of single and non-adaptive random walkers. We distinguish three main types of random walks: discrete-time random walks, node-centric continuous-time random walks, and edge-centric continuous-time random walks. We first briefly survey random walks on a line, and then we consider random walks on various types of networks. We extensively discuss applications of random walks, including ranking of nodes (e.g., PageRank), community detection, respondent-driven sampling, and opinion models such as voter models.

Optical interconnection network for parallel access to multi-rank memory in future computing systems.

PubMed

Wang, Kang; Gu, Huaxi; Yang, Yintang; Wang, Kun

2015-08-10

With the number of cores increasing, there is an emerging need for a high-bandwidth low-latency interconnection network, serving core-to-memory communication. In this paper, aiming at the goal of simultaneous access to multi-rank memory, we propose an optical interconnection network for core-to-memory communication. In the proposed network, the wavelength usage is delicately arranged so that cores can communicate with different ranks at the same time and broadcast for flow control can be achieved. A distributed memory controller architecture that works in a pipeline mode is also designed for efficient optical communication and transaction address processes. The scaling method and wavelength assignment for the proposed network are investigated. Compared with traditional electronic bus-based core-to-memory communication, the simulation results based on the PARSEC benchmark show that the bandwidth enhancement and latency reduction are apparent.

A synthetic mammalian network to compute population borders based on engineered reciprocal cell-cell communication.

PubMed

Kolar, Katja; Wischhusen, Hanna M; Müller, Konrad; Karlsson, Maria; Weber, Wilfried; Zurbriggen, Matias D

2015-12-30

Multicellular organisms depend on the exchange of information between specialized cells. This communication is often difficult to decipher in its native context, but synthetic biology provides tools to engineer well-defined systems that allow the convenient study and manipulation of intercellular communication networks. Here, we present the first mammalian synthetic network for reciprocal cell-cell communication to compute the border between a sender/receiver and a processing cell population. The two populations communicate via L-tryptophan and interleukin-4 to highlight the population border by the production of a fluorescent protein. The sharpness of that visualized edge can be adjusted by modulating key parameters of the network. We anticipate that this network will on the one hand be a useful tool to gain deeper insights into the mechanisms of tissue formation in nature and will on the other hand contribute to our ability to engineer artificial tissues.

Communication, opponents, and clan performance in online games: a social network approach.

PubMed

Lee, Hong Joo; Choi, Jaewon; Kim, Jong Woo; Park, Sung Joo; Gloor, Peter

2013-12-01

Online gamers form clans voluntarily to play together and to discuss their real and virtual lives. Although these clans have diverse goals, they seek to increase their rank in the game community by winning more battles. Communications among clan members and battles with other clans may influence the performance of a clan. In this study, we compared the effects of communication structure inside a clan, and battle networks among clans, with the performance of the clans. We collected battle histories, posts, and comments on clan pages from a Korean online game, and measured social network indices for communication and battle networks. Communication structures in terms of density and group degree centralization index had no significant association with clan performance. However, the centrality of clans in the battle network was positively related to the performance of the clan. If a clan had many battle opponents, the performance of the clan improved.

Communication, Opponents, and Clan Performance in Online Games: A Social Network Approach

PubMed Central

Lee, Hong Joo; Choi, Jaewon; Park, Sung Joo; Gloor, Peter

2013-01-01

Abstract Online gamers form clans voluntarily to play together and to discuss their real and virtual lives. Although these clans have diverse goals, they seek to increase their rank in the game community by winning more battles. Communications among clan members and battles with other clans may influence the performance of a clan. In this study, we compared the effects of communication structure inside a clan, and battle networks among clans, with the performance of the clans. We collected battle histories, posts, and comments on clan pages from a Korean online game, and measured social network indices for communication and battle networks. Communication structures in terms of density and group degree centralization index had no significant association with clan performance. However, the centrality of clans in the battle network was positively related to the performance of the clan. If a clan had many battle opponents, the performance of the clan improved. PMID:23745617

A wireless medical monitoring over a heterogeneous sensor network.

PubMed

Yuce, Mehmet R; Ng, Peng Choong; Lee, Chin K; Khan, Jamil Y; Liu, Wentai

2007-01-01

This paper presents a heterogeneous sensor network system that has the capability to monitor physiological parameters from multiple patient bodies by means of different communication standards. The system uses the recently opened medical band called MICS (Medical Implant Communication Service) between the sensor nodes and a remote central control unit (CCU) that behaves as a base station. The CCU communicates with another network standard (the internet or a mobile network) for a long distance data transfer. The proposed system offers mobility to patients and flexibility to medical staff to obtain patient's physiological data on demand basis via Internet. A prototype sensor network including hardware, firmware and software designs has been implemented and tested by incorporating temperature and pulse rate sensors on nodes. The developed system has been optimized for power consumption by having the nodes sleep when there is no communication via a bidirectional communication.

Risk management communication system between a local government and residents using several network systems and terminal devices

NASA Astrophysics Data System (ADS)

Ohyama, Takashi; Enomoto, Hiroyuki; Takei, Yuichiro; Maeda, Yuji

2009-05-01

Most of Japan's local governments utilize municipal disaster-management radio communications systems to communicate information on disasters or terrorism to residents. The national government is progressing in efforts toward digitalization by local governments of these systems, but only a small number (approx. 10%) have introduced such equipment due to its requiring large amounts of investment. On the other hand, many local governments are moving forward in installation of optical fiber networks for the purpose of eliminating the "digital divide." We herein propose a communication system as an alternative or supplement to municipal disaster-management radio communications systems, which utilizes municipal optical fiber networks, the internet and similar networks and terminals. The system utilizes the multiple existing networks and is capable of instantly distributing to all residents, and controlling, risk management information. We describe the system overview and the field trials conducted with a local government using this system.

Synchrophasor Sensor Networks for Grid Communication and Protection.

PubMed

Gharavi, Hamid; Hu, Bin

2017-07-01

This paper focuses primarily on leveraging synchronized current/voltage amplitudes and phase angle measurements to foster new categories of applications, such as improving the effectiveness of grid protection and minimizing outage duration for distributed grid systems. The motivation for such an application arises from the fact that with the support of communication, synchronized measurements from multiple sites in a grid network can greatly enhance the accuracy and timeliness of identifying the source of instabilities. The paper first provides an overview of synchrophasor networks and then presents techniques for power quality assessment, including fault detection and protection. To achieve this we present a new synchrophasor data partitioning scheme that is based on the formation of a joint space and time observation vector. Since communication is an integral part of synchrophasor networks, the newly adopted wireless standard for machine-to-machine (M2M) communication, known as IEEE 802.11ah, has been investigated. The paper also presents a novel implementation of a hardware in the loop testbed for real-time performance evaluation. The purpose is to illustrate the use of both hardware and software tools to verify the performance of synchrophasor networks under more realistic environments. The testbed is a combination of grid network modeling, and an Emulab-based communication network. The combined grid and communication network is then used to assess power quality for fault detection and location using the IEEE 39-bus and 390-bus systems.

Synchrophasor Sensor Networks for Grid Communication and Protection

PubMed Central

Gharavi, Hamid

2017-01-01

This paper focuses primarily on leveraging synchronized current/voltage amplitudes and phase angle measurements to foster new categories of applications, such as improving the effectiveness of grid protection and minimizing outage duration for distributed grid systems. The motivation for such an application arises from the fact that with the support of communication, synchronized measurements from multiple sites in a grid network can greatly enhance the accuracy and timeliness of identifying the source of instabilities. The paper first provides an overview of synchrophasor networks and then presents techniques for power quality assessment, including fault detection and protection. To achieve this we present a new synchrophasor data partitioning scheme that is based on the formation of a joint space and time observation vector. Since communication is an integral part of synchrophasor networks, the newly adopted wireless standard for machine-to-machine (M2M) communication, known as IEEE 802.11ah, has been investigated. The paper also presents a novel implementation of a hardware in the loop testbed for real-time performance evaluation. The purpose is to illustrate the use of both hardware and software tools to verify the performance of synchrophasor networks under more realistic environments. The testbed is a combination of grid network modeling, and an Emulab-based communication network. The combined grid and communication network is then used to assess power quality for fault detection and location using the IEEE 39-bus and 390-bus systems. PMID:28890553

Technology Developments Integrating a Space Network Communications Testbed

NASA Technical Reports Server (NTRS)

Kwong, Winston; Jennings, Esther; Clare, Loren; Leang, Dee

2006-01-01

As future manned and robotic space explorations missions involve more complex systems, it is essential to verify, validate, and optimize such systems through simulation and emulation in a low cost testbed environment. The goal of such a testbed is to perform detailed testing of advanced space and ground communications networks, technologies, and client applications that are essential for future space exploration missions. We describe the development of new technologies enhancing our Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE) that enable its integration in a distributed space communications testbed. MACHETE combines orbital modeling, link analysis, and protocol and service modeling to quantify system performance based on comprehensive considerations of different aspects of space missions. It can simulate entire networks and can interface with external (testbed) systems. The key technology developments enabling the integration of MACHETE into a distributed testbed are the Monitor and Control module and the QualNet IP Network Emulator module. Specifically, the Monitor and Control module establishes a standard interface mechanism to centralize the management of each testbed component. The QualNet IP Network Emulator module allows externally generated network traffic to be passed through MACHETE to experience simulated network behaviors such as propagation delay, data loss, orbital effects and other communications characteristics, including entire network behaviors. We report a successful integration of MACHETE with a space communication testbed modeling a lunar exploration scenario. This document is the viewgraph slides of the presentation.

Future Plans for NASA's Deep Space Network

NASA Technical Reports Server (NTRS)

Deutsch, Leslie J.; Preston, Robert A.; Geldzahler, Barry J.

2008-01-01

This slide presentation reviews the importance of NASA's Deep Space Network (DSN) to space exploration, and future planned improvements to the communication capabilities that the network allows, in terms of precision, and communication power.

Recruiting Filipino Immigrants in a Randomized Controlled Trial Promoting Enrollment in an Evidence-Based Parenting Intervention.

PubMed

Javier, Joyce R; Reyes, Angela; Coffey, Dean M; Schrager, Sheree M; Samson, Allan; Palinkas, Lawrence; Kipke, Michele D; Miranda, Jeanne

2018-05-17

Filipinos, the second largest Asian subgroup in the U.S., experience significant youth behavioral health disparities but remain under-represented in health research. We describe lessons learned from using the Matching Model of Recruitment to recruit 215 Filipinos to participate in a large, randomized controlled trial of a culturally tailored video aimed at increasing enrollment in the Incredible Years® Parent Program. We recruited participants from schools, churches, clinics, community events, and other community-based locations. Facilitators of participation included: partnership with local community groups, conducting research in familiar settings, building on existing social networks, and matching perspectives of community members and researchers. Findings suggest recruitment success occurs when there is a match between goals of Filipino parents, grandparents and the research community. Understanding the perspectives of ethnic minority communities and effectively communicating goals of research studies are critical to successful recruitment of hard-to-reach immigrant populations in randomized controlled trials.

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

Experiments of 10 Gbit/sec quantum stream cipher applicable to optical Ethernet and optical satellite link

NASA Astrophysics Data System (ADS)

Hirota, Osamu; Ohhata, Kenichi; Honda, Makoto; Akutsu, Shigeto; Doi, Yoshifumi; Harasawa, Katsuyoshi; Yamashita, Kiichi

2009-08-01

The security issue for the next generation optical network which realizes Cloud Computing System Service with data center" is urgent problem. In such a network, the encryption by physical layer which provide super security and small delay should be employed. It must provide, however, very high speed encryption because the basic link is operated at 2.5 Gbit/sec or 10 Gbit/sec. The quantum stream cipher by Yuen-2000 protocol (Y-00) is a completely new type random cipher so called Gauss-Yuen random cipher, which can break the Shannon limit for the symmetric key cipher. We develop such a cipher which has good balance of the security, speed and cost performance. In SPIE conference on quantum communication and quantum imaging V, we reported a demonstration of 2.5 Gbit/sec system for the commercial link and proposed how to improve it to 10 Gbit/sec. This paper reports a demonstration of the Y-00 cipher system which works at 10 Gbit/sec. A transmission test in a laboratory is tried to get the basic data on what parameters are important to operate in the real commercial networks. In addition, we give some theoretical results on the security. It is clarified that the necessary condition to break the Shannon limit requires indeed the quantum phenomenon, and that the full information theoretically secure system is available in the satellite link application.

Do recruitment patterns of young men who have sex with men (YMSM) recruited through respondent-driven sampling (RDS) violate assumptions?

PubMed Central

Phillips, Gregory; Kuhns, Lisa M.; Garofalo, Rob; Mustanski, Brian

2014-01-01

Background In order to generate unbiased estimates for data collected using respondent-driven sampling (RDS), a number of assumptions need to be met: individuals recruit randomly from their social network and people can accurately report their eligible network size. However, research has shown that these assumptions are often violated. Methods This study used baseline data from Crew 450, a longitudinal study of young men who have sex with men in Chicago who were recruited via a modified form of RDS, and its network substudy, in which a subset of 175 participants reported details on the composition and characteristics of their social network at either one or two years post-baseline. Results Nearly two-thirds of participants reported giving coupons to at least one alter (64.0%), and 56.3% believed their alter(s) used the coupons. Frequency of communication, closeness, and type of relationship played a major role in determining coupon distribution. Participants whose alters used coupons were significantly less likely to describe the strength of their relationship as “not at all close” (OR = 0.08; 95% CI: 0.02, 0.36) compared to “very close” and to communicate weekly (OR = 0.20; 95% CI: 0.08, 0.49) or 1–6 times in the last 6 months (OR = 0.18; 95% CI: 0.06, 0.59). Conclusion Contrary to RDS assumptions, we found that relationship characteristics played a significant role when individuals decided to whom they would give coupons. PMID:25086159

Statistical properties of Chinese phonemic networks

NASA Astrophysics Data System (ADS)

Yu, Shuiyuan; Liu, Haitao; Xu, Chunshan

2011-04-01

The study of properties of speech sound systems is of great significance in understanding the human cognitive mechanism and the working principles of speech sound systems. Some properties of speech sound systems, such as the listener-oriented feature and the talker-oriented feature, have been unveiled with the statistical study of phonemes in human languages and the research of the interrelations between human articulatory gestures and the corresponding acoustic parameters. With all the phonemes of speech sound systems treated as a coherent whole, our research, which focuses on the dynamic properties of speech sound systems in operation, investigates some statistical parameters of Chinese phoneme networks based on real text and dictionaries. The findings are as follows: phonemic networks have high connectivity degrees and short average distances; the degrees obey normal distribution and the weighted degrees obey power law distribution; vowels enjoy higher priority than consonants in the actual operation of speech sound systems; the phonemic networks have high robustness against targeted attacks and random errors. In addition, for investigating the structural properties of a speech sound system, a statistical study of dictionaries is conducted, which shows the higher frequency of shorter words and syllables and the tendency that the longer a word is, the shorter the syllables composing it are. From these structural properties and dynamic properties one can derive the following conclusion: the static structure of a speech sound system tends to promote communication efficiency and save articulation effort while the dynamic operation of this system gives preference to reliable transmission and easy recognition. In short, a speech sound system is an effective, efficient and reliable communication system optimized in many aspects.

Using Facebook as a Virtual Classroom in a Public University in Mexico City

ERIC Educational Resources Information Center

Batista, Miguel Angel Herrera

2013-01-01

Since Information and Communication Technologies have been developed, many changes have taken place in society. Social Networks certainly have changed communication habits, especially among young people. Nowadays, Social Networks are used as a communication system every day. In most countries, university students use this communication and…

Environmental Uncertainty and Communication Network Complexity: A Cross-System, Cross-Cultural Test.

ERIC Educational Resources Information Center

Danowski, James

An infographic model is proposed to account for the operation of systems within their information environments. Infographics is a communication paradigm used to indicate the clustering of information processing variables in communication systems. Four propositions concerning environmental uncertainty and internal communication network complexity,…

Motif structure and cooperation in real-world complex networks

NASA Astrophysics Data System (ADS)

Salehi, Mostafa; Rabiee, Hamid R.; Jalili, Mahdi

2010-12-01

Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.

Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

PubMed

Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

2016-01-01

A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data.

Localization with a mobile beacon in underwater acoustic sensor networks.

PubMed

Lee, Sangho; Kim, Kiseon

2012-01-01

Localization is one of the most important issues associated with underwater acoustic sensor networks, especially when sensor nodes are randomly deployed. Given that it is difficult to deploy beacon nodes at predetermined locations, localization schemes with a mobile beacon on the sea surface or along the planned path are inherently convenient, accurate, and energy-efficient. In this paper, we propose a new range-free Localization with a Mobile Beacon (LoMoB). The mobile beacon periodically broadcasts a beacon message containing its location. Sensor nodes are individually localized by passively receiving the beacon messages without inter-node communications. For location estimation, a set of potential locations are obtained as candidates for a node's location and then the node's location is determined through the weighted mean of all the potential locations with the weights computed based on residuals.

Localization with a Mobile Beacon in Underwater Acoustic Sensor Networks

PubMed Central

Lee, Sangho; Kim, Kiseon

2012-01-01

Localization is one of the most important issues associated with underwater acoustic sensor networks, especially when sensor nodes are randomly deployed. Given that it is difficult to deploy beacon nodes at predetermined locations, localization schemes with a mobile beacon on the sea surface or along the planned path are inherently convenient, accurate, and energy-efficient. In this paper, we propose a new range-free Localization with a Mobile Beacon (LoMoB). The mobile beacon periodically broadcasts a beacon message containing its location. Sensor nodes are individually localized by passively receiving the beacon messages without inter-node communications. For location estimation, a set of potential locations are obtained as candidates for a node's location and then the node's location is determined through the weighted mean of all the potential locations with the weights computed based on residuals. PMID:22778597

Applications of Coding in Network Communications

ERIC Educational Resources Information Center

Chang, Christopher SungWook

2012-01-01

This thesis uses the tool of network coding to investigate fast peer-to-peer file distribution, anonymous communication, robust network construction under uncertainty, and prioritized transmission. In a peer-to-peer file distribution system, we use a linear optimization approach to show that the network coding framework significantly simplifies…

Electronic Communication in Engineering Work.

ERIC Educational Resources Information Center

Bishop, Ann P.

1992-01-01

Discusses the role of electronic networks in engineering work; reviews selected literature on engineering work, knowledge, and communication; describes current uses of electronic networks; and presents results from a study of the use of networks by engineers in the aerospace industry, including their perceptions of networks. (67 references) (LRW)

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.

Disturbed temporal dynamics of brain synchronization in vision loss.

PubMed

Bola, Michał; Gall, Carolin; Sabel, Bernhard A

2015-06-01

Damage along the visual pathway prevents bottom-up visual input from reaching further processing stages and consequently leads to loss of vision. But perception is not a simple bottom-up process - rather it emerges from activity of widespread cortical networks which coordinate visual processing in space and time. Here we set out to study how vision loss affects activity of brain visual networks and how networks' activity is related to perception. Specifically, we focused on studying temporal patterns of brain activity. To this end, resting-state eyes-closed EEG was recorded from partially blind patients suffering from chronic retina and/or optic-nerve damage (n = 19) and healthy controls (n = 13). Amplitude (power) of oscillatory activity and phase locking value (PLV) were used as measures of local and distant synchronization, respectively. Synchronization time series were created for the low- (7-9 Hz) and high-alpha band (11-13 Hz) and analyzed with three measures of temporal patterns: (i) length of synchronized-/desynchronized-periods, (ii) Higuchi Fractal Dimension (HFD), and (iii) Detrended Fluctuation Analysis (DFA). We revealed that patients exhibit less complex, more random and noise-like temporal dynamics of high-alpha band activity. More random temporal patterns were associated with worse performance in static (r = -.54, p = .017) and kinetic perimetry (r = .47, p = .041). We conclude that disturbed temporal patterns of neural synchronization in vision loss patients indicate disrupted communication within brain visual networks caused by prolonged deafferentation. We propose that because the state of brain networks is essential for normal perception, impaired brain synchronization in patients with vision loss might aggravate the functional consequences of reduced visual input. Copyright © 2015 Elsevier Ltd. All rights reserved.

A Randomized Comparison of the Effect of Two Prelinguistic Communication Interventions on the Acquisition of Spoken Communication in Preschoolers with ASD

ERIC Educational Resources Information Center

Yoder, Paul; Stone, Wendy L.

2006-01-01

Purpose: This randomized group experiment compared the efficacy of 2 communication interventions (Responsive Education and Prelinguistic Milieu Teaching [RPMT] and the Picture Exchange Communication System [PECS]) on spoken communication in 36 preschoolers with autism spectrum disorders (ASD). Method: Each treatment was delivered to children for a…

Hybrid architecture for building secure sensor networks

NASA Astrophysics Data System (ADS)

Owens, Ken R., Jr.; Watkins, Steve E.

2012-04-01

Sensor networks have various communication and security architectural concerns. Three approaches are defined to address these concerns for sensor networks. The first area is the utilization of new computing architectures that leverage embedded virtualization software on the sensor. Deploying a small, embedded virtualization operating system on the sensor nodes that is designed to communicate to low-cost cloud computing infrastructure in the network is the foundation to delivering low-cost, secure sensor networks. The second area focuses on securing the sensor. Sensor security components include developing an identification scheme, and leveraging authentication algorithms and protocols that address security assurance within the physical, communication network, and application layers. This function will primarily be accomplished through encrypting the communication channel and integrating sensor network firewall and intrusion detection/prevention components to the sensor network architecture. Hence, sensor networks will be able to maintain high levels of security. The third area addresses the real-time and high priority nature of the data that sensor networks collect. This function requires that a quality-of-service (QoS) definition and algorithm be developed for delivering the right data at the right time. A hybrid architecture is proposed that combines software and hardware features to handle network traffic with diverse QoS requirements.

Wireless Communications in Smart Grid

NASA Astrophysics Data System (ADS)

Bojkovic, Zoran; Bakmaz, Bojan

Communication networks play a crucial role in smart grid, as the intelligence of this complex system is built based on information exchange across the power grid. Wireless communications and networking are among the most economical ways to build the essential part of the scalable communication infrastructure for smart grid. In particular, wireless networks will be deployed widely in the smart grid for automatic meter reading, remote system and customer site monitoring, as well as equipment fault diagnosing. With an increasing interest from both the academic and industrial communities, this chapter systematically investigates recent advances in wireless communication technology for the smart grid.

Considerations in the design of a communication network for an autonomously managed power system

NASA Technical Reports Server (NTRS)

Mckee, J. W.; Whitehead, Norma; Lollar, Louis

1989-01-01

The considerations involved in designing a communication network for an autonomously managed power system intended for use in space vehicles are examined. An overview of the design and implementation of a communication network implemented in a breadboard power system is presented. An assumption that the monitoring and control devices are distributed but physically close leads to the selection of a multidrop cable communication system. The assumption of a high-quality communication cable in which few messages are lost resulted in a simple recovery procedure consisting of a time out and retransmit process.

The Implementation, Promotion and Evaluation of the International Health Communication Hotline as a Tool for Interdisciplinary Networking and Disciplinary Advocacy.

ERIC Educational Resources Information Center

Assante, Leonard E.; Schrader, Stuart M.

The International Health Communication Hotline (InHealth) represents an attempt to firmly establish, develop and promote a new Communication Studies subdiscipline in the academic and health care arenas via computer networking. If successful, the project will demonstrate the power of computer networking as an agent of change. Health communication…

Hyperswitch Communication Network Computer

NASA Technical Reports Server (NTRS)

Peterson, John C.; Chow, Edward T.; Priel, Moshe; Upchurch, Edwin T.

1993-01-01

Hyperswitch Communications Network (HCN) computer is prototype multiple-processor computer being developed. Incorporates improved version of hyperswitch communication network described in "Hyperswitch Network For Hypercube Computer" (NPO-16905). Designed to support high-level software and expansion of itself. HCN computer is message-passing, multiple-instruction/multiple-data computer offering significant advantages over older single-processor and bus-based multiple-processor computers, with respect to price/performance ratio, reliability, availability, and manufacturing. Design of HCN operating-system software provides flexible computing environment accommodating both parallel and distributed processing. Also achieves balance among following competing factors; performance in processing and communications, ease of use, and tolerance of (and recovery from) faults.

DAWN: Dynamic Ad-hoc Wireless Network

DTIC Science & Technology

2016-06-19

DAWN: Dynamic Ad-hoc Wireless Network The DAWN (Dynamic Ad-hoc Wireless Networks) project is developing a general theory of complex and dynamic... wireless communication networks. To accomplish this, DAWN adopts a very different approach than those followed in the past and summarized above. DAWN... wireless communication networks. The members of DAWN investigated difference aspects of wireless mobile ad hoc networks (MANET). The views, opinions and/or

Architecting the Communication and Navigation Networks for NASA's Space Exploration Systems

NASA Technical Reports Server (NTRS)

Bhassin, Kul B.; Putt, Chuck; Hayden, Jeffrey; Tseng, Shirley; Biswas, Abi; Kennedy, Brian; Jennings, Esther H.; Miller, Ron A.; Hudiburg, John; Miller, Dave;

A Formal Approach to the Selection by Minimum Error and Pattern Method for Sensor Data Loss Reduction in Unstable Wireless Sensor Network Communications

PubMed Central

Kim, Changhwa; Shin, DongHyun

2017-01-01

There are wireless networks in which typically communications are unsafe. Most terrestrial wireless sensor networks belong to this category of networks. Another example of an unsafe communication network is an underwater acoustic sensor network (UWASN). In UWASNs in particular, communication failures occur frequently and the failure durations can range from seconds up to a few hours, days, or even weeks. These communication failures can cause data losses significant enough to seriously damage human life or property, depending on their application areas. In this paper, we propose a framework to reduce sensor data loss during communication failures and we present a formal approach to the Selection by Minimum Error and Pattern (SMEP) method that plays the most important role for the reduction in sensor data loss under the proposed framework. The SMEP method is compared with other methods to validate its effectiveness through experiments using real-field sensor data sets. Moreover, based on our experimental results and performance comparisons, the SMEP method has been validated to be better than others in terms of the average sensor data value error rate caused by sensor data loss. PMID:28498312

A Formal Approach to the Selection by Minimum Error and Pattern Method for Sensor Data Loss Reduction in Unstable Wireless Sensor Network Communications.

PubMed

Kim, Changhwa; Shin, DongHyun

2017-05-12

There are wireless networks in which typically communications are unsafe. Most terrestrial wireless sensor networks belong to this category of networks. Another example of an unsafe communication network is an underwater acoustic sensor network (UWASN). In UWASNs in particular, communication failures occur frequently and the failure durations can range from seconds up to a few hours, days, or even weeks. These communication failures can cause data losses significant enough to seriously damage human life or property, depending on their application areas. In this paper, we propose a framework to reduce sensor data loss during communication failures and we present a formal approach to the Selection by Minimum Error and Pattern (SMEP) method that plays the most important role for the reduction in sensor data loss under the proposed framework. The SMEP method is compared with other methods to validate its effectiveness through experiments using real-field sensor data sets. Moreover, based on our experimental results and performance comparisons, the SMEP method has been validated to be better than others in terms of the average sensor data value error rate caused by sensor data loss.

Autonomous Information Unit for Fine-Grain Data Access Control and Information Protection in a Net-Centric System

NASA Technical Reports Server (NTRS)

Chow, Edward T.; Woo, Simon S.; James, Mark; Paloulian, George K.

2012-01-01

As communication and networking technologies advance, networks will become highly complex and heterogeneous, interconnecting different network domains. There is a need to provide user authentication and data protection in order to further facilitate critical mission operations, especially in the tactical and mission-critical net-centric networking environment. The Autonomous Information Unit (AIU) technology was designed to provide the fine-grain data access and user control in a net-centric system-testing environment to meet these objectives. The AIU is a fundamental capability designed to enable fine-grain data access and user control in the cross-domain networking environments, where an AIU is composed of the mission data, metadata, and policy. An AIU provides a mechanism to establish trust among deployed AIUs based on recombining shared secrets, authentication and verify users with a username, X.509 certificate, enclave information, and classification level. AIU achieves data protection through (1) splitting data into multiple information pieces using the Shamir's secret sharing algorithm, (2) encrypting each individual information piece using military-grade AES-256 encryption, and (3) randomizing the position of the encrypted data based on the unbiased and memory efficient in-place Fisher-Yates shuffle method. Therefore, it becomes virtually impossible for attackers to compromise data since attackers need to obtain all distributed information as well as the encryption key and the random seeds to properly arrange the data. In addition, since policy can be associated with data in the AIU, different user access and data control strategies can be included. The AIU technology can greatly enhance information assurance and security management in the bandwidth-limited and ad hoc net-centric environments. In addition, AIU technology can be applicable to general complex network domains and applications where distributed user authentication and data protection are necessary. AIU achieves fine-grain data access and user control, reducing the security risk significantly, simplifying the complexity of various security operations, and providing the high information assurance across different network domains.

Stress Testing of Data-Communication Networks

NASA Technical Reports Server (NTRS)

Leucht, Kurt; Bedette, Guy

2006-01-01

NetStress is a computer program that stress-tests a data-communication network and components thereof. NetStress comprises two components running, respectively, in a transmitting system and a receiving system connected to a network under test

A radio-aware routing algorithm for reliable directed diffusion in lossy wireless sensor networks.

PubMed

Kim, Yong-Pyo; Jung, Euihyun; Park, Yong-Jin

2009-01-01

In Wireless Sensor Networks (WSNs), transmission errors occur frequently due to node failure, battery discharge, contention or interference by objects. Although Directed Diffusion has been considered as a prominent data-centric routing algorithm, it has some weaknesses due to unexpected network errors. In order to address these problems, we proposed a radio-aware routing algorithm to improve the reliability of Directed Diffusion in lossy WSNs. The proposed algorithm is aware of the network status based on the radio information from MAC and PHY layers using a cross-layer design. The cross-layer design can be used to get detailed information about current status of wireless network such as a link quality or transmission errors of communication links. The radio information indicating variant network conditions and link quality was used to determine an alternative route that provides reliable data transmission under lossy WSNs. According to the simulation result, the radio-aware reliable routing algorithm showed better performance in both grid and random topologies with various error rates. The proposed solution suggested the possibility of providing a reliable transmission method for QoS requests in lossy WSNs based on the radio-awareness. The energy and mobility issues will be addressed in the future work.

Responses to olfactory signals reflect network structure of flower-visitor interactions.

PubMed

Junker, Robert R; Höcherl, Nicole; Blüthgen, Nico

2010-07-01

1. Network analyses provide insights into the diversity and complexity of ecological interactions and have motivated conclusions about community stability and co-evolution. However, biological traits and mechanisms such as chemical signals regulating the interactions between individual species--the microstructure of a network--are poorly understood. 2. We linked the responses of receivers (flower visitors) towards signals (flower scent) to the structure of a highly diverse natural flower-insect network. For each interaction, we define link temperature--a newly developed metric--as the deviation of the observed interaction strength from neutrality, assuming that animals randomly interact with flowers. 3. Link temperature was positively correlated to the specific visitors' responses to floral scents, experimentally examined in a mobile olfactometer. Thus, communication between plants and consumers via phytochemical signals reflects a significant part of the microstructure in a complex network. Negative as well as positive responses towards floral scents contributed to these results, where individual experience was important apart from innate behaviour. 4. Our results indicate that: (1) biological mechanisms have a profound impact on the microstructure of complex networks that underlies the outcome of aggregate statistics, and (2) floral scents act as a filter, promoting the visitation of some flower visitors, but also inhibiting the visitation of others.

Identifying highly connected counties compensates for resource limitations when evaluating national spread of an invasive pathogen.

PubMed

Sutrave, Sweta; Scoglio, Caterina; Isard, Scott A; Hutchinson, J M Shawn; Garrett, Karen A

2012-01-01

Surveying invasive species can be highly resource intensive, yet near-real-time evaluations of invasion progress are important resources for management planning. In the case of the soybean rust invasion of the United States, a linked monitoring, prediction, and communication network saved U.S. soybean growers approximately $200 M/yr. Modeling of future movement of the pathogen (Phakopsora pachyrhizi) was based on data about current disease locations from an extensive network of sentinel plots. We developed a dynamic network model for U.S. soybean rust epidemics, with counties as nodes and link weights a function of host hectarage and wind speed and direction. We used the network model to compare four strategies for selecting an optimal subset of sentinel plots, listed here in order of increasing performance: random selection, zonal selection (based on more heavily weighting regions nearer the south, where the pathogen overwinters), frequency-based selection (based on how frequently the county had been infected in the past), and frequency-based selection weighted by the node strength of the sentinel plot in the network model. When dynamic network properties such as node strength are characterized for invasive species, this information can be used to reduce the resources necessary to survey and predict invasion progress.

Spatial Light Modulators as Optical Crossbar Switches

NASA Technical Reports Server (NTRS)

Juday, Richard

2003-01-01

A proposed method of implementing cross connections in an optical communication network is based on the use of a spatial light modulator (SLM) to form controlled diffraction patterns that connect inputs (light sources) and outputs (light sinks). Sources would typically include optical fibers and/or light-emitting diodes; sinks would typically include optical fibers and/or photodetectors. The sources and/or sinks could be distributed in two dimensions; that is, on planes. Alternatively or in addition, sources and/or sinks could be distributed in three dimensions -- for example, on curved surfaces or in more complex (including random) three-dimensional patterns.

The Space Mobile Network

NASA Technical Reports Server (NTRS)

Israel, David

2017-01-01

The definition and development of the next generation space communications and navigation architecture is underway. The primary goals are to remove communications and navigations constraints from missions and to enable increased autonomy. The Space Mobile Network (SMN) is an architectural concept that includes new technology and operations that will provide flight systems with an similar user experience to terrestrial wireless mobile networks. This talk will describe the SMN and its proposed new features, such as Disruption Tolerant Networking (DTN), optical communications, and User Initiated Services (UIS).

Crossbar Switches For Optical Data-Communication Networks

NASA Technical Reports Server (NTRS)

Monacos, Steve P.

1994-01-01

Optoelectronic and electro-optical crossbar switches called "permutation engines" (PE's) developed to route packets of data through fiber-optic communication networks. Basic network concept described in "High-Speed Optical Wide-Area Data-Communication Network" (NPO-18983). Nonblocking operation achieved by decentralized switching and control scheme. Each packet routed up or down in each column of this 5-input/5-output permutation engine. Routing algorithm ensures each packet arrives at its designated output port without blocking any other packet that does not contend for same output port.

Scalable Optical-Fiber Communication Networks

NASA Technical Reports Server (NTRS)

Chow, Edward T.; Peterson, John C.

1993-01-01

Scalable arbitrary fiber extension network (SAFEnet) is conceptual fiber-optic communication network passing digital signals among variety of computers and input/output devices at rates from 200 Mb/s to more than 100 Gb/s. Intended for use with very-high-speed computers and other data-processing and communication systems in which message-passing delays must be kept short. Inherent flexibility makes it possible to match performance of network to computers by optimizing configuration of interconnections. In addition, interconnections made redundant to provide tolerance to faults.

Spectrum of walk matrix for Koch network and its application

NASA Astrophysics Data System (ADS)

Xie, Pinchen; Lin, Yuan; Zhang, Zhongzhi

2015-06-01

Various structural and dynamical properties of a network are encoded in the eigenvalues of walk matrix describing random walks on the network. In this paper, we study the spectra of walk matrix of the Koch network, which displays the prominent scale-free and small-world features. Utilizing the particular architecture of the network, we obtain all the eigenvalues and their corresponding multiplicities. Based on the link between the eigenvalues of walk matrix and random target access time defined as the expected time for a walker going from an arbitrary node to another one selected randomly according to the steady-state distribution, we then derive an explicit solution to the random target access time for random walks on the Koch network. Finally, we corroborate our computation for the eigenvalues by enumerating spanning trees in the Koch network, using the connection governing eigenvalues and spanning trees, where a spanning tree of a network is a subgraph of the network, that is, a tree containing all the nodes.

Airport Surface Network Architecture Definition

NASA Technical Reports Server (NTRS)

Nguyen, Thanh C.; Eddy, Wesley M.; Bretmersky, Steven C.; Lawas-Grodek, Fran; Ellis, Brenda L.

2006-01-01

Currently, airport surface communications are fragmented across multiple types of systems. These communication systems for airport operations at most airports today are based dedicated and separate architectures that cannot support system-wide interoperability and information sharing. The requirements placed upon the Communications, Navigation, and Surveillance (CNS) systems in airports are rapidly growing and integration is urgently needed if the future vision of the National Airspace System (NAS) and the Next Generation Air Transportation System (NGATS) 2025 concept are to be realized. To address this and other problems such as airport surface congestion, the Space Based Technologies Project s Surface ICNS Network Architecture team at NASA Glenn Research Center has assessed airport surface communications requirements, analyzed existing and future surface applications, and defined a set of architecture functions that will help design a scalable, reliable and flexible surface network architecture to meet the current and future needs of airport operations. This paper describes the systems approach or methodology to networking that was employed to assess airport surface communications requirements, analyze applications, and to define the surface network architecture functions as the building blocks or components of the network. The systems approach used for defining these functions is relatively new to networking. It is viewing the surface network, along with its environment (everything that the surface network interacts with or impacts), as a system. Associated with this system are sets of services that are offered by the network to the rest of the system. Therefore, the surface network is considered as part of the larger system (such as the NAS), with interactions and dependencies between the surface network and its users, applications, and devices. The surface network architecture includes components such as addressing/routing, network management, network performance and security.

System data communication structures for active-control transport aircraft, volume 1

NASA Technical Reports Server (NTRS)

Hopkins, A. L.; Martin, J. H.; Brock, L. D.; Jansson, D. G.; Serben, S.; Smith, T. B.; Hanley, L. D.

1981-01-01

Candidate data communication techniques are identified, including dedicated links, local buses, broadcast buses, multiplex buses, and mesh networks. The design methodology for mesh networks is then discussed, including network topology and node architecture. Several concepts of power distribution are reviewed, including current limiting and mesh networks for power. The technology issues of packaging, transmission media, and lightning are addressed, and, finally, the analysis tools developed to aid in the communication design process are described. There are special tools to analyze the reliability and connectivity of networks and more general reliability analysis tools for all types of systems.

Applications of Time-Reversal Processing for Planetary Surface Communications

NASA Technical Reports Server (NTRS)

Barton, Richard J.

2007-01-01

Due to the power constraints imposed on wireless sensor and communication networks deployed on a planetary surface during exploration, energy efficient transfer of data becomes a critical issue. In situations where groups of nodes within a network are located in relatively close proximity, cooperative communication techniques can be utilized to improve the range, data rate, power efficiency, and lifetime of the network. In particular, if the point-to-point communication channels on the network are well modeled as frequency non-selective, distributed or cooperative beamforming can employed. For frequency-selective channels, beamforming itself is not generally appropriate, but a natural generalization of it, time-reversal communication (TRC), can still be effective. Time-reversal processing has been proposed and studied previously for other applications, including acoustical imaging, electromagnetic imaging, underwater acoustic communication, and wireless communication channels. In this paper, we study both the theoretical advantages and the experimental performance of cooperative TRC for wireless communication on planetary surfaces. We give a brief introduction to TRC and present several scenarios where TRC could be profitably employed during planetary exploration. We also present simulation results illustrating the performance of cooperative TRC employed in a complex multipath environment and discuss the optimality of cooperative TRC for data aggregation in wireless sensor networks

Quantized Synchronization of Chaotic Neural Networks With Scheduled Output Feedback Control.

PubMed

Wan, Ying; Cao, Jinde; Wen, Guanghui

In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control gain matrix, allowable length of sampling intervals, and upper bound of network-induced delays are derived to ensure the quantized synchronization of master-slave chaotic neural networks. Lastly, Chua's circuit system and 4-D Hopfield neural network are simulated to validate the effectiveness of the main results.In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control gain matrix, allowable length of sampling intervals, and upper bound of network-induced delays are derived to ensure the quantized synchronization of master-slave chaotic neural networks. Lastly, Chua's circuit system and 4-D Hopfield neural network are simulated to validate the effectiveness of the main results.

The Device Centric Communication System for 5G Networks

NASA Astrophysics Data System (ADS)

Biswash, S. K.; Jayakody, D. N. K.

2017-01-01

The Fifth Generation Communication (5G) networks have several functional features such as: Massive Multiple Input and Multiple Output (MIMO), Device centric data and voice support, Smarter-device communications, etc. The objective for 5G networks is to gain the 1000x more throughput, 10x spectral efficiency, 100 x more energy efficiency than existing technologies. The 5G system will provide the balance between the Quality of Experience (QoE) and the Quality of Service (QoS), without compromising the user benefit. The data rate has been the key metric for wireless QoS; QoE deals with the delay and throughput. In order to realize a balance between the QoS and QoE, we propose a cellular Device centric communication methodology for the overlapping network coverage area in the 5G communication system. The multiple beacon signals mobile tower refers to an overlapping network area, and a user must be forwarded to the next location area. To resolve this issue, we suggest the user centric methodology (without Base Station interface) to handover the device in the next area, until the users finalize the communication. The proposed method will reduce the signalling cost and overheads for the communication.

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Collective relaxation dynamics of small-world networks.

PubMed

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Diffusion Dynamics of Energy Saving Practices in Large Heterogeneous Online Networks

PubMed Central

Mohammadi, Neda; Wang, Qi; Taylor, John E.

2016-01-01

Online social networks are today’s fastest growing communications channel and a popular source of information for many, so understanding their contribution to building awareness and shaping public perceptions of climate change is of utmost importance. Today’s online social networks are composed of complex combinations of entities and communication channels and it is not clear which communicators are the most influential, what the patterns of communication flow are, or even whether the widely accepted two-step flow of communication model applies in this new arena. This study examines the diffusion of energy saving practices in a large online social network across organizations, opinion leaders, and the public by tracking 108,771 communications on energy saving practices among 1,084 communicators, then analyzing the flow of information and influence over a 28 day period. Our findings suggest that diffusion networks of messages advocating energy saving practices are predominantly led by the activities of dedicated organizations but their attempts do not result in substantial public awareness, as most of these communications are effectively trapped in organizational loops in which messages are simply shared between organizations. Despite their comparably significant influential values, opinion leaders played a weak role in diffusing energy saving practices to a wider audience. Thus, the two-step flow of communication model does not appear to describe the sharing of energy conservation practices in large online heterogeneous networks. These results shed new light on the underlying mechanisms driving the diffusion of important societal issues such as energy efficiency, particularly in the context of large online social media outlets. PMID:27736912

Diffusion Dynamics of Energy Saving Practices in Large Heterogeneous Online Networks.

PubMed

Mohammadi, Neda; Wang, Qi; Taylor, John E

2016-01-01

Online social networks are today's fastest growing communications channel and a popular source of information for many, so understanding their contribution to building awareness and shaping public perceptions of climate change is of utmost importance. Today's online social networks are composed of complex combinations of entities and communication channels and it is not clear which communicators are the most influential, what the patterns of communication flow are, or even whether the widely accepted two-step flow of communication model applies in this new arena. This study examines the diffusion of energy saving practices in a large online social network across organizations, opinion leaders, and the public by tracking 108,771 communications on energy saving practices among 1,084 communicators, then analyzing the flow of information and influence over a 28 day period. Our findings suggest that diffusion networks of messages advocating energy saving practices are predominantly led by the activities of dedicated organizations but their attempts do not result in substantial public awareness, as most of these communications are effectively trapped in organizational loops in which messages are simply shared between organizations. Despite their comparably significant influential values, opinion leaders played a weak role in diffusing energy saving practices to a wider audience. Thus, the two-step flow of communication model does not appear to describe the sharing of energy conservation practices in large online heterogeneous networks. These results shed new light on the underlying mechanisms driving the diffusion of important societal issues such as energy efficiency, particularly in the context of large online social media outlets.

Simulating Autonomous Telecommunication Networks for Space Exploration

NASA Technical Reports Server (NTRS)

Segui, John S.; Jennings, Esther H.

2008-01-01

Currently, most interplanetary telecommunication systems require human intervention for command and control. However, considering the range from near Earth to deep space missions, combined with the increase in the number of nodes and advancements in processing capabilities, the benefits from communication autonomy will be immense. Likewise, greater mission science autonomy brings the need for unscheduled, unpredictable communication and network routing. While the terrestrial Internet protocols are highly developed their suitability for space exploration has been questioned. JPL has developed the Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE) tool to help characterize network designs and protocols. The results will allow future mission planners to better understand the trade offs of communication protocols. This paper discusses various issues with interplanetary network and simulation results of interplanetary networking protocols.

Monitoring of physiological parameters from multiple patients using wireless sensor network.

PubMed

Yuce, Mehmet R; Ng, Peng Choong; Khan, Jamil Y

2008-10-01

This paper presents a wireless sensor network system that has the capability to monitor physiological parameters from multiple patient bodies. The system uses the Medical Implant Communication Service band between the sensor nodes and a remote central control unit (CCU) that behaves as a base station. The CCU communicates with another network standard (the internet or a mobile network) for a long distance data transfer. The proposed system offers mobility to patients and flexibility to medical staff to obtain patient's physiological data on demand basis via Internet. A prototype sensor network including hardware, firmware and software designs has been implemented and tested. The developed system has been optimized for power consumption by having the nodes sleep when there is no communication via a bidirectional communication.

Emergency Communications Network for Disasters Management in Venezuela

NASA Astrophysics Data System (ADS)

Burguillos, C.; Deng, H.

2018-04-01

The integration and use of different space technology applications for disasters management, play an important role at the time of prevents the causes and mitigates the effects of the natural disasters. Nevertheless, the space technology counts with the appropriate technological resources to provide the accurate and timely information required to support in the decision making in case of disasters. Considering the aforementioned aspects, in this research is presented the design and implementation of an Emergency Communications Network for Disasters Management in Venezuela. Network based on the design of a topology that integrates the satellites platforms in orbit operation under administration of Venezuelan state, such as: the communications satellite VENESAT-1 and the remote sensing satellites VRSS-1 and VRSS-2; as well as their ground stations with the aim to implement an emergency communications network to be activated in case of disasters which affect the public and private communications infrastructures in Venezuela. In this regard, to design the network several technical and operational specifications were formulated, between them: Emergency Strategies to Maneuver the VRSS-1 and VRSS-2 satellites for optimal images capture and processing, characterization of the VENESAT-1 transponders and radiofrequencies for emergency communications services, technologies solutions formulation and communications links design for disaster management. As result, the emergency network designed allows to put in practice diverse communications technologies solutions and different scheme or media for images exchange between the areas affected for disasters and the entities involved in the disasters management tasks, providing useful data for emergency response and infrastructures recovery.

Planning and Scheduling for Environmental Sensor Networks

NASA Astrophysics Data System (ADS)

Frank, J. D.

2005-12-01

Environmental Sensor Networks are a new way of monitoring the environment. They comprise autonomous sensor nodes in the environment that record real-time data, which is retrieved, analyzed, integrated with other data sets (e.g. satellite images, GIS, process models) and ultimately lead to scientific discoveries. Sensor networks must operate within time and resource constraints. Sensors have limited onboard memory, energy, computational power, communications windows and communications bandwidth. The value of data will depend on when, where and how it was collected, how detailed the data is, how long it takes to integrate the data, and how important the data was to the original scientific question. Planning and scheduling of sensor networks is necessary for effective, safe operations in the face of these constraints. For example, power bus limitations may preclude sensors from simultaneously collecting data and communicating without damaging the sensor; planners and schedulers can ensure these operations are ordered so that they do not happen simultaneously. Planning and scheduling can also ensure best use of the sensor network to maximize the value of collected science data. For example, if data is best recorded using a particular camera angle but it is costly in time and energy to achieve this, planners and schedulers can search for times when time and energy are available to achieve the optimal camera angle. Planning and scheduling can handle uncertainty in the problem specification; planners can be re-run when new information is made available, or can generate plans that include contingencies. For example, if bad weather may prevent the collection of data, a contingent plan can check lighting conditions and turn off data collection to save resources if lighting is not ideal. Both mobile and immobile sensors can benefit from planning and scheduling. For example, data collection on otherwise passive sensors can be halted to preserve limited power and memory resources and to reduce the costs of communication. Planning and scheduling is generally a heavy consumer of time, memory and energy resources. This means careful thought must be given to how much planning and scheduling should be done on the sensors themselves, and how much to do elsewhere. The difficulty of planning and scheduling is exacerbated when reasoning about uncertainty. More time, memory and energy is needed to solve such problems, leading either to more expensive sensors, or suboptimal plans. For example, scientifically interesting events may happen at random times, making it difficult to ensure that sufficient resources are availanble. Since uncertainty is usually lowest in proximity to the sensors themselves, this argues for planning and scheduling onboard the sensors. However, cost minimization dictates sensors be kept as simple as possible, reducing the amount of planning and scheduling they can do themselves. Furthermore, coordinating each sensor's independent plans can be difficult. In the full presentation, we will critically review the planning and scheduling systems used by previously fielded sensor networks. We do so primarily from the perspective of the computational sciences, with a focus on taming computational complexity when operating sensor networks. The case studies are derived from sensor networks based on UAVs, satellites, and planetary rovers. Planning and scheduling considerations include multi-sensor coordination, optimizing science value, onboard power management, onboard memory, planning movement actions to acquire data, and managing communications.These case studies offer lessons for future designs of environmental sensor networks.

Fuzz Testing of Industrial Network Protocols in Programmable Logic Controllers

DTIC Science & Technology

2017-12-01

PLCs) are vital components in these cyber-physical systems. The industrial network protocols used to communicate between nodes in a control network...AB/RA) MicroLogix 1100 PLC through its implementation of EtherNet/IP, Common Industrial Protocol (CIP), and Programmable Controller Communication ...Commands (PCCC) communication protocols. This research also examines whether cross-generational vulnerabilities exist in the more advanced AB/RA

Research in Network Management Techniques for Tactical Data Communications Networks.

DTIC Science & Technology

1982-09-01

COMPUTER COMMUNICATIONS US A.RMY (CECOM) V September 1980 to August 1982 Principal Investigatoi Robert Boorstyn Aaron Kershenbaum DTIC Basil Niaglaris Philip...COMMUNICATIONS US ARMY (CECOM) September 1980 to August 1982 Principal Investigators: Robert Boorstyn Aaron Kershenbaum Basil Maglaris Philip Sarachik...TABLE OF CONTENTS Summary of Report Personnel Activities Research Reports / , A. Packet Radio Networks A.1 Throughput Analysis of Multihop Packet

"I'll See You on IM, Text, or Call You": A Social Network Approach of Adolescents' Use of Communication Media

ERIC Educational Resources Information Center

Van Cleemput, Katrien

2010-01-01

This study explores some possibilities of social network analysis for studying adolescents' communication patterns. A full network analysis was conducted on third-grade high school students (15 year olds, 137 students) in Belgium. The results pointed out that face-to-face communication was still the most prominent way for information to flow…

Optimal Scheduling for Underwater Communications in Multiple-User Scenarios

DTIC Science & Technology

2015-09-30

term goals of this project is to analyze and propose energy-efficient communication techniques for underwater acoustic sensor networks . These...investigate the possibility that these underwater acoustic networks disrupt the behavior of surrounding species of marine mammals. As a consequence of... underwater VHF acoustics , high data rate/short range acoustic communications and networking , and acoustic sensing in the VHF regime. WORK COMPLETED We

Description of a method to support public health information management: organizational network analysis

PubMed Central

Merrill, Jacqueline; Bakken, Suzanne; Rockoff, Maxine; Gebbie, Kristine; Carley, Kathleen

2007-01-01

In this case study we describe a method that has potential to provide systematic support for public health information management. Public health agencies depend on specialized information that travels throughout an organization via communication networks among employees. Interactions that occur within these networks are poorly understood and are generally unmanaged. We applied organizational network analysis, a method for studying communication networks, to assess the method’s utility to support decision making for public health managers, and to determine what links existed between information use and agency processes. Data on communication links among a health department’s staff was obtained via survey with a 93% response rate, and analyzed using Organizational Risk Analyzer (ORA) software. The findings described the structure of information flow in the department’s communication networks. The analysis succeeded in providing insights into organizational processes which informed public health managers’ strategies to address problems and to take advantage of network strengths. PMID:17098480

Hiding Critical Targets in Smart Grid Networks

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

Bao, Wei; Li, Qinghua

With the integration of advanced communication technologies, the power grid is expected to greatly enhance efficiency and reliability of future power systems. However, since most electrical devices in power grid substations are connected via communication networks, cyber security of these communication networks becomes a critical issue. Real-World incidents such as Stuxnet have shown the feasibility of compromising a device in the power grid network to further launch more sophisticated attacks. To deal with security attacks of this spirit, this paper aims to hide critical targets from compromised internal nodes and hence protect them from further attacks launched by those compromisedmore » nodes. In particular, we consider substation networks and propose to add carefully-controlled dummy traffic to a substation network to make critical target nodes indistinguishable from other nodes in network traffic patterns. This paper describes the design and evaluation of such a scheme. Evaluations show that the scheme can effectively protect critical nodes with acceptable communication cost.« less

An Architectural Concept for Intrusion Tolerance in Air Traffic Networks

NASA Technical Reports Server (NTRS)

Maddalon, Jeffrey M.; Miner, Paul S.

2003-01-01

The goal of an intrusion tolerant network is to continue to provide predictable and reliable communication in the presence of a limited num ber of compromised network components. The behavior of a compromised network component ranges from a node that no longer responds to a nod e that is under the control of a malicious entity that is actively tr ying to cause other nodes to fail. Most current data communication ne tworks do not include support for tolerating unconstrained misbehavio r of components in the network. However, the fault tolerance communit y has developed protocols that provide both predictable and reliable communication in the presence of the worst possible behavior of a limited number of nodes in the system. One may view a malicious entity in a communication network as a node that has failed and is behaving in an arbitrary manner. NASA/Langley Research Center has developed one such fault-tolerant computing platform called SPIDER (Scalable Proces sor-Independent Design for Electromagnetic Resilience). The protocols and interconnection mechanisms of SPIDER may be adapted to large-sca le, distributed communication networks such as would be required for future Air Traffic Management systems. The predictability and reliabi lity guarantees provided by the SPIDER protocols have been formally v erified. This analysis can be readily adapted to similar network stru ctures.

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.

Stochastic Characterization of Communication Network Latency for Wide Area Grid Control Applications.

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

Ameme, Dan Selorm Kwami; Guttromson, Ross

This report characterizes communications network latency under various network topologies and qualities of service (QoS). The characterizations are probabilistic in nature, allowing deeper analysis of stability for Internet Protocol (IP) based feedback control systems used in grid applications. The work involves the use of Raspberry Pi computers as a proxy for a controlled resource, and an ns-3 network simulator on a Linux server to create an experimental platform (testbed) that can be used to model wide-area grid control network communications in smart grid. Modbus protocol is used for information transport, and Routing Information Protocol is used for dynamic route selectionmore » within the simulated network.« less

Stability and dynamical properties of material flow systems on random networks

NASA Astrophysics Data System (ADS)

Anand, K.; Galla, T.

2009-04-01

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.