delay tolerant network: Topics by Science.gov

Sample records for delay tolerant network

An energy-efficient MAC protocol using dynamic queue management for delay-tolerant mobile sensor networks.

PubMed

Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

2011-01-01

Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.
An Energy-Efficient MAC Protocol Using Dynamic Queue Management for Delay-Tolerant Mobile Sensor Networks

PubMed Central

Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

2011-01-01

Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay. PMID:22319385
Defining Tolerance: Impacts of Delay and Disruption when Managing Challenged Networks

NASA Technical Reports Server (NTRS)

Birrane, Edward J. III; Burleigh, Scott C.; Cerf, Vint

2011-01-01

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

NASA Technical Reports Server (NTRS)

Torgerson, Jordan; Hooke, Adrian; Burleigh, Scott; Fall, Kevin

2004-01-01

As its name partly indicates, the Delay-Tolerant Networking (DTN) Bundle Protocol is a protocol for delay-tolerant transmission of data via communication networks. This protocol was conceived as a result of studies of how to adapt Internet protocols so that Internet-like services could be provided across interplanetary distances in support of deep-space exploration. The protocol, and software to implement the protocol, is being developed in collaboration among experts at NASA's Jet Propulsion Laboratory and other institutions. No current Internet protocols can accommodate long transmission delay times or intermittent link connectivity. The DTN Bundle Protocol represents a departure from the standard Internet assumption that a continuous path is available from a host computer to a client computer: It provides for routing of data through networks that may be disjointed and may be characterized by long transmission delays. In addition to networks that include deepspace communication links, examples of such networks include terrestrial ones within which branches are temporarily disconnected. The protocol is based partly on the definition of a message-based overlay above the transport layers of the networks on which it is hosted.
Endpoint Naming for Space Delay/Disruption Tolerant Networking

NASA Technical Reports Server (NTRS)

Clare, Loren; Burleigh, Scott; Scott, Keith

2010-01-01

Delay/Disruption Tolerant Networking (DTN) provides solutions to space communication challenges such as disconnections when orbiters lose line-of-sight with landers, long propagation delays over interplanetary links, and other operational constraints. DTN is critical to enabling the future space internetworking envisioned by NASA. Interoperability with international partners is essential and standardization is progressing through both the CCSDS and the IETF.
Large File Transfers from Space Using Multiple Ground Terminals and Delay-Tolerant Networking

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Paulsen, Phillip; Stewart, Dave; Eddy, Wesley; McKim, James; Taylor, John; Lynch, Scott; Heberle, Jay; Northam, James; Jackson, Chris;

2010-01-01

We use Delay-Tolerant Networking (DTN) to break control loops between space-ground communication links and ground-ground communication links to increase overall file delivery efficiency, as well as to enable large files to be proactively fragmented and received across multiple ground stations. DTN proactive fragmentation and reactive fragmentation were demonstrated from the UK-DMC satellite using two independent ground stations. The files were reassembled at a bundle agent, located at Glenn Research Center in Cleveland Ohio. The first space-based demonstration of this occurred on September 30 and October 1, 2009. This paper details those experiments. Communication, delay-tolerant networking, DTN, satellite, Internet, protocols, bundle, IP, TCP.

Load balancing strategy and its lookup-table enhancement in deterministic space delay/disruption tolerant networks

NASA Astrophysics Data System (ADS)

Huang, Jinhui; Liu, Wenxiang; Su, Yingxue; Wang, Feixue

2018-02-01

Space networks, in which connectivity is deterministic and intermittent, can be modeled by delay/disruption tolerant networks. In space delay/disruption tolerant networks, a packet is usually transmitted from the source node to the destination node indirectly via a series of relay nodes. If anyone of the nodes in the path becomes congested, the packet will be dropped due to buffer overflow. One of the main reasons behind congestion is the unbalanced network traffic distribution. We propose a load balancing strategy which takes the congestion status of both the local node and relay nodes into account. The congestion status, together with the end-to-end delay, is used in the routing selection. A lookup-table enhancement is also proposed. The off-line computation and the on-line adjustment are combined together to make a more precise estimate of the end-to-end delay while at the same time reducing the onboard computation. Simulation results show that the proposed strategy helps to distribute network traffic more evenly and therefore reduces the packet drop ratio. In addition, the average delay is also decreased in most cases. The lookup-table enhancement provides a compromise between the need for better communication performance and the desire for less onboard computation.
Minimum expected delay-based routing protocol (MEDR) for Delay Tolerant Mobile Sensor Networks.

PubMed

Feng, Yong; Liu, Ming; Wang, Xiaomin; Gong, Haigang

2010-01-01

It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.
Distributed Interplanetary Delay/Disruption Tolerant Network (DTN) Monitor and Control System

NASA Technical Reports Server (NTRS)

Wang, Shin-Ywan

2012-01-01

The main purpose of Distributed interplanetary Delay Tolerant Network Monitor and Control System as a DTN system network management implementation in JPL is defined to provide methods and tools that can monitor the DTN operation status, detect and resolve DTN operation failures in some automated style while either space network or some heterogeneous network is infused with DTN capability. In this paper, "DTN Monitor and Control system in Deep Space Network (DSN)" exemplifies a case how DTN Monitor and Control system can be adapted into a space network as it is DTN enabled.
Space Flight Middleware: Remote AMS over DTN for Delay-Tolerant Messaging

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2011-01-01

This paper describes a technique for implementing scalable, reliable, multi-source multipoint data distribution in space flight communications -- Delay-Tolerant Reliable Multicast (DTRM) -- that is fully supported by the "Remote AMS" (RAMS) protocol of the Asynchronous Message Service (AMS) proposed for standardization within the Consultative Committee for Space Data Systems (CCSDS). The DTRM architecture enables applications to easily "publish" messages that will be reliably and efficiently delivered to an arbitrary number of "subscribing" applications residing anywhere in the space network, whether in the same subnet or in a subnet on a remote planet or vehicle separated by many light minutes of interplanetary space. The architecture comprises multiple levels of protocol, each included for a specific purpose and allocated specific responsibilities: "application AMS" traffic performs end-system data introduction and delivery subject to access control; underlying "remote AMS" directs this application traffic to populations of recipients at remote locations in a multicast distribution tree, enabling the architecture to scale up to large networks; further underlying Delay-Tolerant Networking (DTN) Bundle Protocol (BP) advances RAMS protocol data units through the distribution tree using delay-tolerant storeand- forward methods; and further underlying reliable "convergence-layer" protocols ensure successful data transfer over each segment of the end-to-end route. The result is scalable, reliable, delay-tolerant multi-source multicast that is largely self-configuring.
A hop count based heuristic routing protocol for mobile delay tolerant networks.

PubMed

You, Lei; Li, Jianbo; Wei, Changjiang; Dai, Chenqu; Xu, Jixing; Hu, Lejuan

2014-01-01

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.
A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

PubMed Central

Wei, Changjiang; Dai, Chenqu; Xu, Jixing; Hu, Lejuan

2014-01-01

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs. PMID:25110736
Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2008-01-01

Computational self-sufficiency - the making of communication decisions on the basis of locally available information that is already in place, rather than on the basis of information residing at other entities - is a fundamental principle of Delay-Tolerant Networking. Contact Graph Routing is an attempt to apply this principle to the problem of dynamic routing in an interplanetary DTN. Testing continues, but preliminary results are promising.
Autonomous Congestion Control in Delay-Tolerant Networks

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.; Jennings, Esther H.

2005-01-01

Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics).
A Realistic Framework for Delay-Tolerant Network Routing in Open Terrains with Continuous Churn

NASA Astrophysics Data System (ADS)

Mahendran, Veeramani; Anirudh, Sivaraman K.; Murthy, C. Siva Ram

The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary.
Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

NASA Technical Reports Server (NTRS)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.
GDTN: Genome-Based Delay Tolerant Network Formation in Heterogeneous 5G Using Inter-UA Collaboration.

PubMed

You, Ilsun; Sharma, Vishal; Atiquzzaman, Mohammed; Choo, Kim-Kwang Raymond

2016-01-01

With a more Internet-savvy and sophisticated user base, there are more demands for interactive applications and services. However, it is a challenge for existing radio access networks (e.g. 3G and 4G) to cope with the increasingly demanding requirements such as higher data rates and wider coverage area. One potential solution is the inter-collaborative deployment of multiple radio devices in a 5G setting designed to meet exacting user demands, and facilitate the high data rate requirements in the underlying networks. These heterogeneous 5G networks can readily resolve the data rate and coverage challenges. Networks established using the hybridization of existing networks have diverse military and civilian applications. However, there are inherent limitations in such networks such as irregular breakdown, node failures, and halts during speed transmissions. In recent years, there have been attempts to integrate heterogeneous 5G networks with existing ad hoc networks to provide a robust solution for delay-tolerant transmissions in the form of packet switched networks. However, continuous connectivity is still required in these networks, in order to efficiently regulate the flow to allow the formation of a robust network. Therefore, in this paper, we present a novel network formation consisting of nodes from different network maneuvered by Unmanned Aircraft (UA). The proposed model utilizes the features of a biological aspect of genomes and forms a delay tolerant network with existing network models. This allows us to provide continuous and robust connectivity. We then demonstrate that the proposed network model has an efficient data delivery, lower overheads and lesser delays with high convergence rate in comparison to existing approaches, based on evaluations in both real-time testbed and simulation environment.
GDTN: Genome-Based Delay Tolerant Network Formation in Heterogeneous 5G Using Inter-UA Collaboration

PubMed Central

2016-01-01

With a more Internet-savvy and sophisticated user base, there are more demands for interactive applications and services. However, it is a challenge for existing radio access networks (e.g. 3G and 4G) to cope with the increasingly demanding requirements such as higher data rates and wider coverage area. One potential solution is the inter-collaborative deployment of multiple radio devices in a 5G setting designed to meet exacting user demands, and facilitate the high data rate requirements in the underlying networks. These heterogeneous 5G networks can readily resolve the data rate and coverage challenges. Networks established using the hybridization of existing networks have diverse military and civilian applications. However, there are inherent limitations in such networks such as irregular breakdown, node failures, and halts during speed transmissions. In recent years, there have been attempts to integrate heterogeneous 5G networks with existing ad hoc networks to provide a robust solution for delay-tolerant transmissions in the form of packet switched networks. However, continuous connectivity is still required in these networks, in order to efficiently regulate the flow to allow the formation of a robust network. Therefore, in this paper, we present a novel network formation consisting of nodes from different network maneuvered by Unmanned Aircraft (UA). The proposed model utilizes the features of a biological aspect of genomes and forms a delay tolerant network with existing network models. This allows us to provide continuous and robust connectivity. We then demonstrate that the proposed network model has an efficient data delivery, lower overheads and lesser delays with high convergence rate in comparison to existing approaches, based on evaluations in both real-time testbed and simulation environment. PMID:27973618
Autonomous Congestion Control in Delay-Tolerant Networks

NASA Technical Reports Server (NTRS)

Burleigh, Scott; Jennings, Esther; Schoolcraft, Joshua

2006-01-01

Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics). Preliminary experimental results show that this congestion control mechanism can protect routers from resource depletion without loss of data.
Delay/Disruption Tolerant Networking for the International Space Station (ISS)

NASA Technical Reports Server (NTRS)

Schlesinger, Adam; Willman, Brett M.; Pitts, Lee; Davidson, Suzanne R.; Pohlchuck, William A.

2017-01-01

Disruption Tolerant Networking (DTN) is an emerging data networking technology designed to abstract the hardware communication layer from the spacecraft/payload computing resources. DTN is specifically designed to operate in environments where link delays and disruptions are common (e.g., space-based networks). The National Aeronautics and Space Administration (NASA) has demonstrated DTN on several missions, such as the Deep Impact Networking (DINET) experiment, the Earth Observing Mission 1 (EO-1) and the Lunar Laser Communication Demonstration (LLCD). To further the maturation of DTN, NASA is implementing DTN protocols on the International Space Station (ISS). This paper explains the architecture of the ISS DTN network, the operational support for the system, the results from integrated ground testing, and the future work for DTN expansion.

A Machine Learning Concept for DTN Routing

NASA Technical Reports Server (NTRS)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

This paper discusses the concept and architecture of a machine learning based router for delay tolerant space networks. The techniques of reinforcement learning and Bayesian learning are used to supplement the routing decisions of the popular Contact Graph Routing algorithm. An introduction to the concepts of Contact Graph Routing, Q-routing and Naive Bayes classification are given. The development of an architecture for a cross-layer feedback framework for DTN (Delay-Tolerant Networking) protocols is discussed. Finally, initial simulation setup and results are given.
A time reference distribution concept for a time division communication network

NASA Technical Reports Server (NTRS)

Stover, H. A.

1973-01-01

Starting with an assumed ideal network having perfect clocks at every node and known fixed transmission delays between nodes, the effects of adding tolerances to both transmission delays and nodal clocks is described. The advantages of controlling tolerances on time rather than frequency are discussed. Then a concept is presented for maintaining these tolerances on time throughout the network. This concept, called time reference distribution, is a systematic technique for distributing time reference to all nodes of the network. It is reliable, survivable and possesses many other desirable characteristics. Some of its features such as an excellent self monitoring capability will be pointed out. Some preliminary estimates of the accuracy that might be expected are developed and there is a brief discussion of the impact upon communication system costs. Time reference distribution is a concept that appears very attractive. It has not had experimental evaluation and has not yet been endorsed for use in any communication network.
Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2008-01-01

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.
Delay/Disruption Tolerant Networks (DTN): Testing and Demonstration for Lunar Surface Applications

NASA Technical Reports Server (NTRS)

2009-01-01

This slide presentation reviews the testing of the Delay/Disruption Tolerant Network (DTN) designed for use with Lunar Surface applications. This is being done through the DTN experimental Network (DEN), that permit access and testing by other NASA centers, DTN team members and protocol developers. The objective of this work is to demonstrate DTN for high return applications in lunar scenarios, provide DEN connectivity with analogs of Constellation elements, emulators, and other resources from DTN Team Members, serve as a wireless communications staging ground for remote analog excursions and enable testing of detailed communication scenarios and evaluation of network performance. Three scenarios for DTN on the Lunar surface are reviewed: Motion imagery, Voice and sensor telemetry, and Navigation telemetry.
Delay/Disruption Tolerant Networks for Human Space Flight Video Project

NASA Technical Reports Server (NTRS)

Fink, Patrick W.; Ngo, Phong; Schlesinger, Adam

2010-01-01

The movie describes collaboration between NASA and Vint Cerf on the development of Disruption Tolerant Networks (DTN) for use in space exploration. Current evaluation efforts at Johnson Space Center are focused on the use of DTNs in space communications. Tests include the ability of rovers to store data for later display, tracking local and remote habitat inventory using radio-frequency identification tags, and merging networks.
A New Local Bipolar Autoassociative Memory Based on External Inputs of Discrete Recurrent Neural Networks With Time Delay.

PubMed

Zhou, Caigen; Zeng, Xiaoqin; Luo, Chaomin; Zhang, Huaguang

In this paper, local bipolar auto-associative memories are presented based on discrete recurrent neural networks with a class of gain type activation function. The weight parameters of neural networks are acquired by a set of inequalities without the learning procedure. The global exponential stability criteria are established to ensure the accuracy of the restored patterns by considering time delays and external inputs. The proposed methodology is capable of effectively overcoming spurious memory patterns and achieving memory capacity. The effectiveness, robustness, and fault-tolerant capability are validated by simulated experiments.In this paper, local bipolar auto-associative memories are presented based on discrete recurrent neural networks with a class of gain type activation function. The weight parameters of neural networks are acquired by a set of inequalities without the learning procedure. The global exponential stability criteria are established to ensure the accuracy of the restored patterns by considering time delays and external inputs. The proposed methodology is capable of effectively overcoming spurious memory patterns and achieving memory capacity. The effectiveness, robustness, and fault-tolerant capability are validated by simulated experiments.
Experience with Delay-Tolerant Networking from Orbit

NASA Technical Reports Server (NTRS)

Ivancic, W.; Eddy, W. M.; Stewart, D.; Wood, L.; Northam, J.; Jackson, C.

2010-01-01

We describe the first use from space of the Bundle Protocol for Delay-Tolerant Networking (DTN) and lessons learned from experiments made and experience gained with this protocol. The Disaster Monitoring Constellation (DMC), constructed by Surrey Satellite Technology Ltd (SSTL), is a multiple-satellite Earth-imaging low-Earth-orbit sensor network in which recorded image swaths are stored onboard each satellite and later downloaded from the satellite payloads to a ground station. Store-and-forward of images with capture and later download gives each satellite the characteristics of a node in a disruption-tolerant network. Originally developed for the Interplanetary Internet, DTNs are now under investigation in an Internet Research Task Force (IRTF) DTN research group (RG), which has developed a bundle architecture and protocol. The DMC is technically advanced in its adoption of the Internet Protocol (IP) for its imaging payloads and for satellite command and control, based around reuse of commercial networking and link protocols. These satellites use of IP has enabled earlier experiments with the Cisco router in Low Earth Orbit (CLEO) onboard the constellation s UK-DMC satellite. Earth images are downloaded from the satellites using a custom IP-based high-speed transfer protocol developed by SSTL, Saratoga, which tolerates unusual link environments. Saratoga has been documented in the Internet Engineering Task Force (IETF) for wider adoption. We experiment with the use of DTNRG bundle concepts onboard the UK-DMC satellite, by examining how Saratoga can be used as a DTN convergence layer to carry the DTNRG Bundle Protocol, so that sensor images can be delivered to ground stations and beyond as bundles. Our practical experience with the first successful use of the DTNRG Bundle Protocol in a space environment gives us insights into the design of the Bundle Protocol and enables us to identify issues that must be addressed before wider deployment of the Bundle Protocol. Published in 2010 by John Wiley & Sons, Ltd. KEY WORDS: Internet; UK-DMC; satellite; Delay-Tolerant Networking (DTN); Bundle Protocol
Delay-tolerant mobile network protocol for rice field monitoring using wireless sensor networks

NASA Astrophysics Data System (ADS)

Guitton, Alexandre; Andres, Frédéric; Cardoso, Jarbas Lopes; Kawtrakul, Asanee; Barbin, Silvio E.

2015-10-01

The monitoring of rice fields can improve productivity by helping farmers throughout the rice cultivation cycle, on various issues: when to harvest, when to treat the crops against disease, when to increase the water level, how to share observations and decisions made in a collaborative way, etc. In this paper, we propose an architecture to monitor a rice field by a wireless sensor network. Our architecture is based on static sensor nodes forming a disconnected network, and mobile nodes communicating with the sensor nodes in a delay-tolerant manner. The data collected by the static sensor nodes are transmitted to mobile nodes, which in turn transmit them to a gateway, connected to a database, for further analysis. We focus on the related architecture, as well as on the energy-efficient protocols intended to perform the data collection.
On Integrated Social and QoS Trust-Based Routing in Delay Tolerant Networks

DTIC Science & Technology

2011-05-15

according to our protocol. This leads to Tik(t + At) < Tmin because /?j + f32 = 1 and T, fc (t) < Tmin is given (in the if part). Therefore, it is...Disruption-Tolerant Networking," IEEE INFOCOM 2006. Barcelona . Spain. April 2006, pp. 1-11. [3] J.H. Cho, A. Swami and I.R. Chen, "Modeling and
An agenda-based routing protocol in delay tolerant mobile sensor networks.

PubMed

Wang, Xiao-Min; Zhu, Jin-Qi; Liu, Ming; Gong, Hai-Gang

2010-01-01

Routing in delay tolerant mobile sensor networks (DTMSNs) is challenging due to the networks' intermittent connectivity. Most existing routing protocols for DTMSNs use simplistic random mobility models for algorithm design and performance evaluation. In the real world, however, due to the unique characteristics of human mobility, currently existing random mobility models may not work well in environments where mobile sensor units are carried (such as DTMSNs). Taking a person's social activities into consideration, in this paper, we seek to improve DTMSN routing in terms of social structure and propose an agenda based routing protocol (ARP). In ARP, humans are classified based on their agendas and data transmission is made according to sensor nodes' transmission rankings. The effectiveness of ARP is demonstrated through comprehensive simulation studies.
Bundle Security Protocol for ION

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.; Birrane, Edward J.; Krupiarz, Christopher

2011-01-01

This software implements bundle authentication, conforming to the Delay-Tolerant Networking (DTN) Internet Draft on Bundle Security Protocol (BSP), for the Interplanetary Overlay Network (ION) implementation of DTN. This is the only implementation of BSP that is integrated with ION.
CNES-NASA Disruption-Tolerant Networking (DTN) Interoperability

NASA Technical Reports Server (NTRS)

Mortensen, Dale; Eddy, Wesley M.; Reinhart, Richard C.; Lassere, Francois

2014-01-01

Future missions requiring robust internetworking services may use Delay-Disruption-Tolerant Networking (DTN) technology. CNES, NASA, and other international space agencies are committed to using CCSDS standards in their space and ground mission communications systems. The experiment described in this presentation will evaluate operations concepts, system performance, and advance technology readiness for the use of DTN protocols in conjunction with CCSDS ground systems, CCSDS data links, and CCSDS file transfer applications
An improved PRoPHET routing protocol in delay tolerant network.

PubMed

Han, Seung Deok; Chung, Yun Won

2015-01-01

In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity) protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.
Telemetry in bundles: delay-tolerant networking for delay-challenged applications

NASA Technical Reports Server (NTRS)

Burleigh, S.

2003-01-01

This paper presents an overview of DTN concepts, including bundles and the Bundling overlay protocol. One possible scenario for the application of DTN to a telemetry return problem is described, and there is a brief discussion of the current state of DTN technology development.
Dynamical jumping real-time fault-tolerant routing protocol for wireless sensor networks.

PubMed

Wu, Guowei; Lin, Chi; Xia, Feng; Yao, Lin; Zhang, He; Liu, Bing

2010-01-01

In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining transmission time of the data packets and the state of the forwarding candidate node set to dynamically choose the next hop. Once node failure, network congestion or void region occurs, the transmission mode will switch to jumping transmission mode, which can reduce the transmission time delay, guaranteeing the data packets to be sent to the destination node within the specified time limit. By using feedback mechanism, each node dynamically adjusts the jumping probabilities to increase the ratio of successful transmission. Simulation results show that DMRF can not only efficiently reduce the effects of failure nodes, congestion and void region, but also yield higher ratio of successful transmission, smaller transmission delay and reduced number of control packets.
Benefits of Delay Tolerant Networking for Earth Science Missions

NASA Technical Reports Server (NTRS)

Davis, Faith; Marquart, Jane; Menke, Greg

2012-01-01

To date there has been much discussion about the value of Delay Tolerant Networking (DTN) for space missions. Claims of various benefits, based on paper analysis, are good; however a benefits statement with empirical evidence to support is even better. This paper presents potential and actual advantages of using DTN for Earth science missions based on results from multiple demonstrations, conducted by the Communications, Standards, and Technology Laboratory (CSTL) at NASA Goddard Space Flight Center (GSFC). Demonstrations included two flight demonstrations using the Earth Observing Mission 1 (EO-1) and the Near Earth Network (NEN), a ground based demonstration over satellite links to the Internet Router in Space (IRIS) payload on Intelsat-14, and others using the NASA Tracking Data Relay Satellite System (TDRSS). Real and potential findings include increased flexibility and efficiency in science campaigns, reduced latency in a collaborative science scenario, and improved scientist-instrument communication and control.
Autonomous Adaptive Acoustic Relay Positioning

DTIC Science & Technology

2013-09-01

underwater acoustic sensor networks . In Proc. 1st ACM International Work- shop on Underwater Networks , pages 7–16, 2006. [4] A Alvarez, A...routing in underwater delay/disruption tolerant sensor networks . In Wireless on Demand Network Systems and Services, 2008. WONS 2008. Fifth Annual...the development of multi-vehicle applications in the ocean, and the main mode of wireless data transmission underwater is acoustic .
Pattern reverberation in networks of excitable systems with connection delays

NASA Astrophysics Data System (ADS)

Lücken, Leonhard; Rosin, David P.; Worlitzer, Vasco M.; Yanchuk, Serhiy

2017-01-01

We consider the recurrent pulse-coupled networks of excitable elements with delayed connections, which are inspired by the biological neural networks. If the delays are tuned appropriately, the network can either stay in the steady resting state, or alternatively, exhibit a desired spiking pattern. It is shown that such a network can be used as a pattern-recognition system. More specifically, the application of the correct pattern as an external input to the network leads to a self-sustained reverberation of the encoded pattern. In terms of the coupling structure, the tolerance and the refractory time of the individual systems, we determine the conditions for the uniqueness of the sustained activity, i.e., for the functionality of the network as an unambiguous pattern detector. We point out the relation of the considered systems with cyclic polychronous groups and show how the assumed delay configurations may arise in a self-organized manner when a spike-time dependent plasticity of the connection delays is assumed. As excitable elements, we employ the simplistic coincidence detector models as well as the Hodgkin-Huxley neuron models. Moreover, the system is implemented experimentally on a Field-Programmable Gate Array.
Building a Solar System Internet

NASA Technical Reports Server (NTRS)

Clark, Gilbert J.

2018-01-01

This presentation is expected to be given during the scheduled Communications Technology and Development discussion in the University Student Design Challenge (2). It is an introduction to various challenges inherent to the construction of networks in space. The presentation also includes both an overview of networking in general, as well as approaches taken to the construction of delay- and disruption- tolerant networks.
Contact Graph Routing Enhancements Developed in ION for DTN

NASA Technical Reports Server (NTRS)

Segui, John S.; Burleigh, Scott

2013-01-01

The Interplanetary Overlay Network (ION) software suite is an open-source, flight-ready implementation of networking protocols including the Delay/Disruption Tolerant Networking (DTN) Bundle Protocol (BP), the CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol (CFDP), and many others including the Contact Graph Routing (CGR) DTN routing system. While DTN offers the capability to tolerate disruption and long signal propagation delays in transmission, without an appropriate routing protocol, no data can be delivered. CGR was built for space exploration networks with scheduled communication opportunities (typically based on trajectories and orbits), represented as a contact graph. Since CGR uses knowledge of future connectivity, the contact graph can grow rather large, and so efficient processing is desired. These enhancements allow CGR to scale to predicted NASA space network complexities and beyond. This software improves upon CGR by adopting an earliest-arrival-time cost metric and using the Dijkstra path selection algorithm. Moving to Dijkstra path selection also enables construction of an earliest- arrival-time tree for multicast routing. The enhancements have been rolled into ION 3.0 available on sourceforge.net.

A Performance Evaluation of NACK-Oriented Protocols as the Foundation of Reliable Delay- Tolerant Networking Convergence Layers

NASA Technical Reports Server (NTRS)

Iannicca, Dennis; Hylton, Alan; Ishac, Joseph

2012-01-01

Delay-Tolerant Networking (DTN) is an active area of research in the space communications community. DTN uses a standard layered approach with the Bundle Protocol operating on top of transport layer protocols known as convergence layers that actually transmit the data between nodes. Several different common transport layer protocols have been implemented as convergence layers in DTN implementations including User Datagram Protocol (UDP), Transmission Control Protocol (TCP), and Licklider Transmission Protocol (LTP). The purpose of this paper is to evaluate several stand-alone implementations of negative-acknowledgment based transport layer protocols to determine how they perform in a variety of different link conditions. The transport protocols chosen for this evaluation include Consultative Committee for Space Data Systems (CCSDS) File Delivery Protocol (CFDP), Licklider Transmission Protocol (LTP), NACK-Oriented Reliable Multicast (NORM), and Saratoga. The test parameters that the protocols were subjected to are characteristic of common communications links ranging from terrestrial to cis-lunar and apply different levels of delay, line rate, and error.
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.
Switched-beam radiometer front-end network analysis

NASA Technical Reports Server (NTRS)

Trew, R. J.; Bilbro, G. L.

1994-01-01

The noise figure performance of various delay-line networks fabricated from microstrip lines with varying number of elements was investigated using a computer simulation. The effects of resistive losses in both the transmission lines and power combiners were considered. In general, it is found that an optimum number of elements exists, depending upon the resistive losses present in the network. Small resistive losses are found to have a significant degrading effect upon the noise figure performance of the array. Extreme stability in switching characteristics is necessary to minimize the nondeterministic noise of the array. For example, it is found that a 6 percent tolerance on the delay-line lengths will produce a 0.2 db uncertainty in the noise figure which translates into a 13.67 K temperature uncertainty generated by the network. If the tolerance can be held to 2 percent, the uncertainty in noise figure and noise temperature will be 0.025 db and 1.67 K, respectively. Three phase shift networks fabricated using a commercially available PIN diode switch were investigated. Loaded-line phase shifters are found to have desirable RF and noise characteristics and are attractive components for use in phased-array networks.
An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks

PubMed Central

Abba, Sani; Lee, Jeong-A

2015-01-01

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network. PMID:26295236
An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks.

PubMed

Abba, Sani; Lee, Jeong-A

2015-08-18

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network.
Security-Enhanced Autonomous Network Management

NASA Technical Reports Server (NTRS)

Zeng, Hui

2015-01-01

Ensuring reliable communication in next-generation space networks requires a novel network management system to support greater levels of autonomy and greater awareness of the environment and assets. Intelligent Automation, Inc., has developed a security-enhanced autonomous network management (SEANM) approach for space networks through cross-layer negotiation and network monitoring, analysis, and adaptation. The underlying technology is bundle-based delay/disruption-tolerant networking (DTN). The SEANM scheme allows a system to adaptively reconfigure its network elements based on awareness of network conditions, policies, and mission requirements. Although SEANM is generically applicable to any radio network, for validation purposes it has been prototyped and evaluated on two specific networks: a commercial off-the-shelf hardware test-bed using Institute of Electrical Engineers (IEEE) 802.11 Wi-Fi devices and a military hardware test-bed using AN/PRC-154 Rifleman Radio platforms. Testing has demonstrated that SEANM provides autonomous network management resulting in reliable communications in delay/disruptive-prone environments.
Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing.

PubMed

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-26

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λ b / λ u bits/s/Hz, where λ b and λ u are the densities of base stations and mobile users, respectively.
Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing

PubMed Central

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-01

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λb/λu bits/s/Hz, where λb and λu are the densities of base stations and mobile users, respectively. PMID:28134769
Initial Characterization of Optical Communications with Disruption-Tolerant Network Protocols

NASA Technical Reports Server (NTRS)

Schoolcraft, Joshua; Wilson, Keith

2011-01-01

Disruption-tolerant networks (DTNs) are groups of network assets connected with a suite of communication protocol technologies designed to mitigate the effects of link delay and disruption. Application of DTN protocols to diverse groups of network resources in multiple sub-networks results in an overlay network-of-networks with autonomous data routing capability. In space environments where delay or disruption is expected, performance of this type of architecture (such as an interplanetary internet) can increase with the inclusion of new communications mediums and techniques. Space-based optical communication links are therefore an excellent building block of space DTN architectures. When compared to traditional radio frequency (RF) communications, optical systems can provide extremely power-efficient and high bandwidth links bridging sub-networks. Because optical links are more susceptible to link disruption and experience the same light-speed delays as RF, optical-enabled DTN architectures can lessen potential drawbacks and maintain the benefits of autonomous optical communications over deep space distances. These environment-driven expectations - link delay and interruption, along with asymmetric data rates - are the purpose of the proof-of-concept experiment outlined herein. In recognizing the potential of these two technologies, we report an initial experiment and characterization of the performance of a DTN-enabled space optical link. The experiment design employs a point-to-point free-space optical link configured to have asymmetric bandwidth. This link connects two networked systems running a DTN protocol implementation designed and written at JPL for use on spacecraft, and further configured for higher bandwidth performance. Comparing baseline data transmission metrics with and without periodic optical link interruptions, the experiment confirmed the DTN protocols' ability to handle real-world unexpected link outages while maintaining capability of reliably delivering data at relatively high rates. Finally, performance characterizations from this data suggest performance optimizations to configuration and protocols for future optical-specific DTN space link scenarios.
A Pub/Sub Message Distribution Architecture for Disruption Tolerant Networks

NASA Astrophysics Data System (ADS)

Carrilho, Sergio; Esaki, Hiroshi

Access to information is taken for granted in urban areas covered by a robust communication infrastructure. Nevertheless most of the areas in the world, are not covered by such infrastructures. We propose a DTN publish and subscribe system called Hikari, which uses nodes' mobility in order to distribute messages without using a robust infrastructure. The area of Disruption/Delay Tolerant Networks (DTN) focuses on providing connectivity to locations separated by networks with disruptions and delays. The Hikari system does not use node identifiers for message forwarding thus eliminating the complexity of routing associated with many forwarding schemes in DTN. Hikari uses nodes paths' information, advertised by special nodes in the system or predicted by the system itself, for optimizing the message dissemination process. We have used the Paris subway system, due to it's complexity, to validate Hikari and to analyze it's performance. We have shown that Hikari achieves a superior deliver rate while keeping redundant messages in the system low, which is ideal when using devices with limited resources for message dissemination.
Generating a fault-tolerant global clock using high-speed control signals for the MetaNet architecture

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

Ofek, Y.

1994-05-01

This work describes a new technique, based on exchanging control signals between neighboring nodes, for constructing a stable and fault-tolerant global clock in a distributed system with an arbitrary topology. It is shown that it is possible to construct a global clock reference with time step that is much smaller than the propagation delay over the network's links. The synchronization algorithm ensures that the global clock tick' has a stable periodicity, and therefore, it is possible to tolerate failures of links and clocks that operate faster and/or slower than nominally specified, as well as hard failures. The approach taken inmore » this work is to generate a global clock from the ensemble of the local transmission clocks and not to directly synchronize these high-speed clocks. The steady-state algorithm, which generates the global clock, is executed in hardware by the network interface of each node. At the network interface, it is possible to measure accurately the propagation delay between neighboring nodes with a small error or uncertainty and thereby to achieve global synchronization that is proportional to these error measurements. It is shown that the local clock drift (or rate uncertainty) has only a secondary effect on the maximum global clock rate. The synchronization algorithm can tolerate any physical failure. 18 refs.« less
A Communications Network for Cislunar Operations

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2012-01-01

Reliable and efficient communications will be critical to the success of commercial flight operations in cislunar space. The Internet is not well-suited to meeting this requirement. But the Delay-Tolerant Networking (DTN) architecture is. The DTN protocols are well-documented and implementations are mature. We think DTN will be ready to support low-cost, low-risk cislunar networking by the time the vehicles are in place.
Hopf bifurcation of an (n + 1) -neuron bidirectional associative memory neural network model with delays.

PubMed

Xiao, Min; Zheng, Wei Xing; Cao, Jinde

2013-01-01

Recent studies on Hopf bifurcations of neural networks with delays are confined to simplified neural network models consisting of only two, three, four, five, or six neurons. It is well known that neural networks are complex and large-scale nonlinear dynamical systems, so the dynamics of the delayed neural networks are very rich and complicated. Although discussing the dynamics of networks with a few neurons may help us to understand large-scale networks, there are inevitably some complicated problems that may be overlooked if simplified networks are carried over to large-scale networks. In this paper, a general delayed bidirectional associative memory neural network model with n + 1 neurons is considered. By analyzing the associated characteristic equation, the local stability of the trivial steady state is examined, and then the existence of the Hopf bifurcation at the trivial steady state is established. By applying the normal form theory and the center manifold reduction, explicit formulae are derived to determine the direction and stability of the bifurcating periodic solution. Furthermore, the paper highlights situations where the Hopf bifurcations are particularly critical, in the sense that the amplitude and the period of oscillations are very sensitive to errors due to tolerances in the implementation of neuron interconnections. It is shown that the sensitivity is crucially dependent on the delay and also significantly influenced by the feature of the number of neurons. Numerical simulations are carried out to illustrate the main results.
Multicast Delayed Authentication For Streaming Synchrophasor Data in the Smart Grid

PubMed Central

Câmara, Sérgio; Anand, Dhananjay; Pillitteri, Victoria; Carmo, Luiz

2017-01-01

Multicast authentication of synchrophasor data is challenging due to the design requirements of Smart Grid monitoring systems such as low security overhead, tolerance of lossy networks, time-criticality and high data rates. In this work, we propose inf -TESLA, Infinite Timed Efficient Stream Loss-tolerant Authentication, a multicast delayed authentication protocol for communication links used to stream synchrophasor data for wide area control of electric power networks. Our approach is based on the authentication protocol TESLA but is augmented to accommodate high frequency transmissions of unbounded length. inf TESLA protocol utilizes the Dual Offset Key Chains mechanism to reduce authentication delay and computational cost associated with key chain commitment. We provide a description of the mechanism using two different modes for disclosing keys and demonstrate its security against a man-in-the-middle attack attempt. We compare our approach against the TESLA protocol in a 2-day simulation scenario, showing a reduction of 15.82% and 47.29% in computational cost, sender and receiver respectively, and a cumulative reduction in the communication overhead. PMID:28736582
Multicast Delayed Authentication For Streaming Synchrophasor Data in the Smart Grid.

PubMed

Câmara, Sérgio; Anand, Dhananjay; Pillitteri, Victoria; Carmo, Luiz

2016-01-01

Multicast authentication of synchrophasor data is challenging due to the design requirements of Smart Grid monitoring systems such as low security overhead, tolerance of lossy networks, time-criticality and high data rates. In this work, we propose inf -TESLA, Infinite Timed Efficient Stream Loss-tolerant Authentication, a multicast delayed authentication protocol for communication links used to stream synchrophasor data for wide area control of electric power networks. Our approach is based on the authentication protocol TESLA but is augmented to accommodate high frequency transmissions of unbounded length. inf TESLA protocol utilizes the Dual Offset Key Chains mechanism to reduce authentication delay and computational cost associated with key chain commitment. We provide a description of the mechanism using two different modes for disclosing keys and demonstrate its security against a man-in-the-middle attack attempt. We compare our approach against the TESLA protocol in a 2-day simulation scenario, showing a reduction of 15.82% and 47.29% in computational cost, sender and receiver respectively, and a cumulative reduction in the communication overhead.
Optimizing Airborne Networking Performance with Cross-Layer Design Approach

DTIC Science & Technology

2009-06-01

Schiavone , L.J.; “Airborne Networking –Approaches and Challenges,” Military Communications Conference IEEE, Oct 31 – Nov 3, 2004, Vol. 1, pp. 404...www.ccny.cuny.edu/cint/ [5] John Seguí and Esther Jennings,’’ Delay Tolerant Networking – Bundle Protocol Simulation’’ [6] DTNRG website...throughput route selection in multi-rate ad hoc wireless networks,” Technical report, Johns Hopkins CS Dept, March 2003. v 2. [15] R. Draves, J
Delay/Disruption Tolerance Networking (DTN) Implementation and Utilization Options on the International Space Station

NASA Technical Reports Server (NTRS)

Holbrook, Mark; Pitts, Robert Lee; Gifford, Kevin K.; Jenkins, Andrew; Kuzminsky, Sebastian

2010-01-01

The International Space Station (ISS) is in an operational configuration and nearing final assembly. With its maturity and diverse payloads onboard, the opportunity exists to extend the orbital lab into a facility to exercise and demonstrate Delay/Disruption Tolerant Networking (DTN). DTN is an end-to-end network service providing communications through environments characterized by intermittent connectivity, variable delays, high bit error rates, asymmetric links and simplex links. The DTN protocols, also known as bundle protocols, provide a store-and-forward capability to accommodate end-to-end network services. Key capabilities of the bundling protocols include: the Ability to cope with intermittent connectivity, the Ability to take advantage of scheduled and opportunistic connectivity (in addition to always up connectivity), Custody Transfer, and end-to-end security. Colorado University at Boulder and the Huntsville Operational Support Center (HOSC) have been developing a DTN capability utilizing the Commercial Generic Bioprocessing Apparatus (CGBA) payload resources onboard the ISS, at the Boulder Payload Operations Center (POC) and at the HOSC. The DTN capability is in parallel with and is designed to augment current capabilities. The architecture consists of DTN endpoint nodes on the ISS and at the Boulder POC, and a DTN node at the HOSC. The DTN network is composed of two implementations; the Interplanetary Overlay Network (ION) and the open source DTN2 implementation. This paper presents the architecture, implementation, and lessons learned. By being able to handle the types of environments described above, the DTN technology will be instrumental in extending networks into deep space to support future missions to other planets and other solar system points of interest. Thus, this paper also discusses how this technology will be applicable to these types of deep space exploration missions.
BPTAP: A New Approach to IP over DTN

NASA Technical Reports Server (NTRS)

Tsao, Philip; Nguyen, Sam

2012-01-01

Traditional Internet protocols have been widely deployed for a variety of applications. However such protocols generally perform poorly in situations in which, round trip delays are very large (interplanetary distances) or . persistent connectivity is not always available (widely dispersed MANET). Delay/Disruption Tolerant Network (DTN) technology was invented to address these issues: (1) . Relay nodes "take custody" of blocks of network traffic on a hop-by -hop basis and retransmit them in cases of expected or unexpected link outage (2) Bundle lifetime may be configured for long round trip light times. BPTAP is novel by encapsulating Ethernet frames in BP
Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

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

Meng, Ziyang; Yang, Tao; Li, Guoqi

We study synchronization of coupled linear systems over networks with weak connectivity and time-varying delays. We focus on the case that the internal dynamics are time-varying but non-expansive. Both uniformly connected and infinitely connected communication topologies are considered. A new concept of P-synchronization is introduced and we first show that global asymptotic P-synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of the infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns out that the existence of a uniform time interval for the communicationmore » topology is not necessary and P-synchronization can be achieved when the time varying delays are arbitrarily bounded. Simulations are given to validate the theoretical results.« less
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.

Depth optimal sorting networks resistant to k passive faults

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

Piotrow, M.

In this paper, we study the problem of constructing a sorting network that is tolerant to faults and whose running time (i.e. depth) is as small as possible. We consider the scenario of worst-case comparator faults and follow the model of passive comparator failure proposed by Yao and Yao, in which a faulty comparator outputs directly its inputs without comparison. Our main result is the first construction of an N-input, k-fault-tolerant sorting network that is of an asymptotically optimal depth {theta}(log N+k). That improves over the recent result of Leighton and Ma, whose network is of depth O(log N +more » k log log N/log k). Actually, we present a fault-tolerant correction network that can be added after any N-input sorting network to correct its output in the presence of at most k faulty comparators. Since the depth of the network is O(log N + k) and the constants hidden behind the {open_quotes}O{close_quotes} notation are not big, the construction can be of practical use. Developing the techniques necessary to show the main result, we construct a fault-tolerant network for the insertion problem. As a by-product, we get an N-input, O(log N)-depth INSERT-network that is tolerant to random faults, thereby answering a question posed by Ma in his PhD thesis. The results are based on a new notion of constant delay comparator networks, that is, networks in which each register is used (compared) only in a period of time of a constant length. Copies of such networks can be put one after another with only a constant increase in depth per copy.« less
Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

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

Meng, Ziyang; Yang, Tao; Li, Guoqi

Here, we study synchronization of coupled linear systems over networks with weak connectivity and nonuniform time-varying delays. We focus on the case where the internal dynamics are time-varying but non-expansive (stable dynamics with a quadratic Lyapunov function). Both uniformly jointly connected and infinitely jointly connected communication topologies are considered. A new concept of quadratic synchronization is introduced. We first show that global asymptotic quadratic synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns outmore » that the existence of a uniform time interval for the jointly connected communication topology is not necessary and quadratic synchronization can be achieved when the time-varying nonuniform delays are arbitrarily bounded. Finally, simulation results are provided to validate the theoretical results.« less
Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

DOE PAGES

Meng, Ziyang; Yang, Tao; Li, Guoqi; ...

2017-09-18

Here, we study synchronization of coupled linear systems over networks with weak connectivity and nonuniform time-varying delays. We focus on the case where the internal dynamics are time-varying but non-expansive (stable dynamics with a quadratic Lyapunov function). Both uniformly jointly connected and infinitely jointly connected communication topologies are considered. A new concept of quadratic synchronization is introduced. We first show that global asymptotic quadratic synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns outmore » that the existence of a uniform time interval for the jointly connected communication topology is not necessary and quadratic synchronization can be achieved when the time-varying nonuniform delays are arbitrarily bounded. Finally, simulation results are provided to validate the theoretical results.« less
Soft-error tolerance and energy consumption evaluation of embedded computer with magnetic random access memory in practical systems using computer simulations

NASA Astrophysics Data System (ADS)

Nebashi, Ryusuke; Sakimura, Noboru; Sugibayashi, Tadahiko

2017-08-01

We evaluated the soft-error tolerance and energy consumption of an embedded computer with magnetic random access memory (MRAM) using two computer simulators. One is a central processing unit (CPU) simulator of a typical embedded computer system. We simulated the radiation-induced single-event-upset (SEU) probability in a spin-transfer-torque MRAM cell and also the failure rate of a typical embedded computer due to its main memory SEU error. The other is a delay tolerant network (DTN) system simulator. It simulates the power dissipation of wireless sensor network nodes of the system using a revised CPU simulator and a network simulator. We demonstrated that the SEU effect on the embedded computer with 1 Gbit MRAM-based working memory is less than 1 failure in time (FIT). We also demonstrated that the energy consumption of the DTN sensor node with MRAM-based working memory can be reduced to 1/11. These results indicate that MRAM-based working memory enhances the disaster tolerance of embedded computers.
A community-based event delivery protocol in publish/subscribe systems for delay tolerant sensor networks.

PubMed

Liu, Nianbo; Liu, Ming; Zhu, Jinqi; Gong, Haigang

2009-01-01

The basic operation of a Delay Tolerant Sensor Network (DTSN) is to finish pervasive data gathering in networks with intermittent connectivity, while the publish/subscribe (Pub/Sub for short) paradigm is used to deliver events from a source to interested clients in an asynchronous way. Recently, extension of Pub/Sub systems in DTSNs has become a promising research topic. However, due to the unique frequent partitioning characteristic of DTSNs, extension of a Pub/Sub system in a DTSN is a considerably difficult and challenging problem, and there are no good solutions to this problem in published works. To ad apt Pub/Sub systems to DTSNs, we propose CED, a community-based event delivery protocol. In our design, event delivery is based on several unchanged communities, which are formed by sensor nodes in the network according to their connectivity. CED consists of two components: event delivery and queue management. In event delivery, events in a community are delivered to mobile subscribers once a subscriber comes into the community, for improving the data delivery ratio. The queue management employs both the event successful delivery time and the event survival time to decide whether an event should be delivered or dropped for minimizing the transmission overhead. The effectiveness of CED is demonstrated through comprehensive simulation studies.
Delay/Disruption Tolerant Network-Based Message Forwarding for a River Pollution Monitoring Wireless Sensor Network Application.

PubMed

Velásquez-Villada, Carlos; Donoso, Yezid

2016-03-25

Communications from remote areas that may be of interest is still a problem. Many innovative projects applied to remote sites face communications difficulties. The GOLDFISH project was an EU-funded project for river pollution monitoring in developing countries. It had several sensor clusters, with floating WiFi antennas, deployed along a downstream river's course. Sensor clusters sent messages to a Gateway installed on the riverbank. This gateway sent the messages, through a backhaul technology, to an Internet server where data was aggregated over a map. The communication challenge in this scenario was produced by the antennas' movement and network backhaul availability. Since the antennas were floating on the river, communications could be disrupted at any time. Also, 2G/3G availability near the river was not constant. For non-real-time applications, we propose a Delay/Disruption Tolerant Network (DTN)-based solution where all nodes have persistent storage capabilities and DTN protocols to be able to wait minutes or hours to transmit. A mechanical backhaul will periodically visit the river bank where the gateway is installed and it will automatically collect sensor data to be carried to an Internet-covered spot. The proposed forwarding protocol delivers around 98% of the messages for this scenario, performing better than other well-known DTN routing protocols.
Distrubtion Tolerant Network Technology Flight Validation Report: DINET

NASA Technical Reports Server (NTRS)

Jones, Ross M.

2009-01-01

In October and November of 2008, the Jet Propulsion Laboratory installed and tested essential elements of Delay/Disruption Tolerant Networking (DTN) technology on the Deep Impact spacecraft. This experiment, called Deep Impact Network Experiment (DINET), was performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. During DINET some 300 images were transmitted from the JPL nodes to the spacecraft. Then, they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. All transmitted bundles were successfully received, without corruption. The DINET experiment demonstrated DTN readiness for operational use in space missions.
Distribution Tolerant Network Technology Flight Validation Report: DINET

NASA Technical Reports Server (NTRS)

Jones, Ross M.

2009-01-01

In October and November of 2008, the Jet Propulsion Laboratory installed and tested essential elements of Delay/Disruption Tolerant Networking (DTN) technology on the Deep Impact spacecraft. This experiment, called Deep Impact Network Experiment (DINET), was performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. During DINET some 300 images were transmitted from the JPL nodes to the spacecraft. Then, they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. All transmitted bundles were successfully received, without corruption. The DINET experiment demonstrated DTN readiness for operational use in space missions.
Modeling and analyzing cascading dynamics of the Internet based on local congestion information

NASA Astrophysics Data System (ADS)

Zhu, Qian; Nie, Jianlong; Zhu, Zhiliang; Yu, Hai; Xue, Yang

2018-06-01

Cascading failure has already become one of the vital issues in network science. By considering realistic network operational settings, we propose the congestion function to represent the congested extent of node and construct a local congestion-aware routing strategy with a tunable parameter. We investigate the cascading failures on the Internet triggered by deliberate attacks. Simulation results show that the tunable parameter has an optimal value that makes the network achieve a maximum level of robustness. The robustness of the network has a positive correlation with tolerance parameter, but it has a negative correlation with the packets generation rate. In addition, there exists a threshold of the attacking proportion of nodes that makes the network achieve the lowest robustness. Moreover, by introducing the concept of time delay for information transmission on the Internet, we found that an increase of the time delay will decrease the robustness of the network rapidly. The findings of the paper will be useful for enhancing the robustness of the Internet in the future.
On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

PubMed

Amanowicz, Marek; Krygier, Jaroslaw

2018-05-26

In this paper, the applicability of the network coding technique in 6LoWPAN-based sensor multihop networks is examined. The 6LoWPAN is one of the standards proposed for the Internet of Things architecture. Thus, we can expect the significant growth of traffic in such networks, which can lead to overload and decrease in the sensor network lifetime. The authors propose the inter-session network coding mechanism that can be implemented in resource-limited sensor motes. The solution reduces the overall traffic in the network, and in consequence, the energy consumption is decreased. Used procedures take into account deep header compressions of the native 6LoWPAN packets and the hop-by-hop changes of the header structure. Applied simplifications reduce signaling traffic that is typically occurring in network coding deployments, keeping the solution usefulness for the wireless sensor networks with limited resources. The authors validate the proposed procedures in terms of end-to-end packet delay, packet loss ratio, traffic in the air, total energy consumption, and network lifetime. The solution has been tested in a real wireless sensor network. The results confirm the efficiency of the proposed technique, mostly in delay-tolerant sensor networks.
Use of the Delay-Tolerant Networking Bundle Protocol from Space

NASA Technical Reports Server (NTRS)

Wood, Lloyd; Ivancic, William D.; Eddy, Wesley M.; Stewart, Dave; Northam, James; Jackson, Chris; daSilvaCuriel, Alex

2009-01-01

The Disaster Monitoring Constellation (DMC), constructed by Survey Satellite Technology Ltd (SSTL), is a multisatellite Earth-imaging low-Earth-orbit sensor network where captured image swaths are stored onboard each satellite and later downloaded from the satellite payloads to a ground station. Store-and-forward of images with capture and later download gives each satellite the characteristics of a node in a Delay/Disruption Tolerant Network (DTN). Originally developed for the Interplanetary Internet, DTNs are now under investigation in an Internet Research Task Force (IRTF) DTN research group (RG), which has developed a bundle architecture and protocol. The DMC is currently unique in its adoption of the Internet Protocol (IP) for its imaging payloads and for satellite command and control, based around reuse of commercial networking and link protocols. These satellites use of IP has enabled earlier experiments with the Cisco router in Low Earth Orbit (CLEO) onboard the constellation's UK-DMC satellite. Earth images are downloaded from the satellites using a custom IPbased high-speed transfer protocol developed by SSTL, Saratoga, which tolerates unusual link environments. Saratoga has been documented in the Internet Engineering Task Force (IETF) for wider adoption. We experiment with use of DTNRG bundle concepts onboard the UKDMC satellite, by examining how Saratoga can be used as a DTN convergence layer to carry the DTNRG Bundle Protocol, so that sensor images can be delivered to ground stations and beyond as bundles. This is the first successful use of the DTNRG Bundle Protocol in a space environment. We use our practical experience to examine the strengths and weaknesses of the Bundle Protocol for DTN use, paying attention to fragmentation, custody transfer, and reliability issues.
Using a Multiobjective Approach to Balance Mission and Network Goals within a Delay Tolerant Network Topology

DTIC Science & Technology

2009-03-01

incorporating autonomous actions, but none appear to incorporate a cognitive aspect used to balance multiple objectives as is the focus of this work. There...routing algorithm) and/or mission type decision (orbit path change). In this component, the pseudo- cognitive aspect is implemented within the...orbit change behavior doesn’t know which orbit to choose. This is where the cognitive aspect takes over. Since the orbit change behavior doesn’t
Delay/Disruption Tolerant Network-Based Message Forwarding for a River Pollution Monitoring Wireless Sensor Network Application

PubMed Central

Velásquez-Villada, Carlos; Donoso, Yezid

2016-01-01

Communications from remote areas that may be of interest is still a problem. Many innovative projects applied to remote sites face communications difficulties. The GOLDFISH project was an EU-funded project for river pollution monitoring in developing countries. It had several sensor clusters, with floating WiFi antennas, deployed along a downstream river’s course. Sensor clusters sent messages to a Gateway installed on the riverbank. This gateway sent the messages, through a backhaul technology, to an Internet server where data was aggregated over a map. The communication challenge in this scenario was produced by the antennas’ movement and network backhaul availability. Since the antennas were floating on the river, communications could be disrupted at any time. Also, 2G/3G availability near the river was not constant. For non-real-time applications, we propose a Delay/Disruption Tolerant Network (DTN)-based solution where all nodes have persistent storage capabilities and DTN protocols to be able to wait minutes or hours to transmit. A mechanical backhaul will periodically visit the river bank where the gateway is installed and it will automatically collect sensor data to be carried to an Internet-covered spot. The proposed forwarding protocol delivers around 98% of the messages for this scenario, performing better than other well-known DTN routing protocols. PMID:27023554
Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

PubMed

Ayub, Qaisar; Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

2018-01-01

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.
Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments

PubMed Central

Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

2018-01-01

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio. PMID:29438438
Information spreading in Delay Tolerant Networks based on nodes' behaviors

NASA Astrophysics Data System (ADS)

Wu, Yahui; Deng, Su; Huang, Hongbin

2014-07-01

Information spreading in DTNs (Delay Tolerant Networks) adopts a store-carry-forward method, and nodes receive the message from others directly. However, it is hard to judge whether the information is safe in this communication mode. In this case, a node may observe other nodes' behaviors. At present, there is no theoretical model to describe the varying rule of the nodes' trusting level. In addition, due to the uncertainty of the connectivity in DTN, a node is hard to get the global state of the network. Therefore, a rational model about the node's trusting level should be a function of the node's own observing result. For example, if a node finds k nodes carrying a message, it may trust the information with probability p(k). This paper does not explore the real distribution of p(k), but instead presents a unifying theoretical framework to evaluate the performance of the information spreading in above case. This framework is an extension of the traditional SI (susceptible-infected) model, and is useful when p(k) conforms to any distribution. Simulations based on both synthetic and real motion traces show the accuracy of the framework. Finally, we explore the impact of the nodes' behaviors based on certain special distributions through numerical results.
A Multi-Center Space Data System Prototype Based on CCSDS Standards

NASA Technical Reports Server (NTRS)

Rich, Thomas M.

2016-01-01

Deep space missions beyond earth orbit will require new methods of data communications in order to compensate for increasing RF propagation delay. The Consultative Committee for Space Data Systems (CCSDS) standard protocols Spacecraft Monitor & Control (SM&C), Asynchronous Message Service (AMS), and Delay/Disruption Tolerant Networking (DTN) provide such a method. The maturity level of this protocol set is, however, insufficient for mission inclusion at this time. This prototype is intended to provide experience which will raise the Technical Readiness Level (TRL) of these protocols..
Commercial Technology at the Tactical Edge

DTIC Science & Technology

2013-06-01

Typical environmental examples are survivability in the face of hostile action, lack of fixed infrastructure , high mobility and ruggedness...Disconnected, Intermittent, and Limited (DIL) Communications Delay Tolerance Mobile Ad Hoc Networks (MANETs) Loss of infrastructure Security Cyber...for Apple’s IOS.25 In particular, various vendors have built application infrastructures around the various mobile phone operating systems (OSs) such
Modeling and Simulation Reliable Spacecraft On-Board Computing

NASA Technical Reports Server (NTRS)

Park, Nohpill

1999-01-01

The proposed project will investigate modeling and simulation-driven testing and fault tolerance schemes for Spacecraft On-Board Computing, thereby achieving reliable spacecraft telecommunication. A spacecraft communication system has inherent capabilities of providing multipoint and broadcast transmission, connectivity between any two distant nodes within a wide-area coverage, quick network configuration /reconfiguration, rapid allocation of space segment capacity, and distance-insensitive cost. To realize the capabilities above mentioned, both the size and cost of the ground-station terminals have to be reduced by using reliable, high-throughput, fast and cost-effective on-board computing system which has been known to be a critical contributor to the overall performance of space mission deployment. Controlled vulnerability of mission data (measured in sensitivity), improved performance (measured in throughput and delay) and fault tolerance (measured in reliability) are some of the most important features of these systems. The system should be thoroughly tested and diagnosed before employing a fault tolerance into the system. Testing and fault tolerance strategies should be driven by accurate performance models (i.e. throughput, delay, reliability and sensitivity) to find an optimal solution in terms of reliability and cost. The modeling and simulation tools will be integrated with a system architecture module, a testing module and a module for fault tolerance all of which interacting through a centered graphical user interface.
Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks.

PubMed

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-03-18

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

PubMed Central

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-01-01

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio. PMID:29562628
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.
JAXA-NASA Interoperability Demonstration for Application of DTN Under Simulated Rain Attenuation

NASA Technical Reports Server (NTRS)

Suzuki, Kiyoshisa; Inagawa, Shinichi; Lippincott, Jeff; Cecil, Andrew J.

2014-01-01

As is well known, K-band or higher band communications in space link segment often experience intermittent disruptions caused by heavy rainfall. In view of keeping data integrity and establishing autonomous operations under such situation, it is important to consider introducing a tolerance mechanism such as Delay/Disruption Tolerant Networking (DTN). The Consultative Committee for Space Data Systems (CCSDS) is studying DTN as part of the standardization activities for space data systems. As a contribution to CCSDS and a feasibility study for future utilization of DTN, Japan Aerospace Exploration Agency (JAXA) and National Aeronautics and Space Administration (NASA) conducted an interoperability demonstration for confirming its tolerance mechanism and capability of automatic operation using Data Relay Test Satellite (DRTS) space link and its ground terminals. Both parties used the Interplanetary Overlay Network (ION) open source software, including the Bundle Protocol, the Licklider Transmission Protocol, and Contact Graph Routing. This paper introduces the contents of the interoperability demonstration and its results.
Delay Tolerant Networking - Bundle Protocol Simulation

NASA Technical Reports Server (NTRS)

SeGui, John; Jenning, Esther

2006-01-01

In this paper, we report on the addition of MACHETE models needed to support DTN, namely: the Bundle Protocol (BP) model. To illustrate the useof MACHETE with the additional DTN model, we provide an example simulation to benchmark its performance. We demonstrate the use of the DTN protocol and discuss statistics gathered concerning the total time needed to simulate numerous bundle transmissions.
Delay Tolerant Networking on NASA's Space Communication and Navigation Testbed

NASA Technical Reports Server (NTRS)

Johnson, Sandra; Eddy, Wesley

2016-01-01

This presentation covers the status of the implementation of an open source software that implements the specifications developed by the CCSDS Working Group. Interplanetary Overlay Network (ION) is open source software and it implements specifications that have been developed by two international working groups through IETF and CCSDS. ION was implemented on the SCaN Testbed, a testbed located on an external pallet on ISS, by the GRC team. The presentation will cover the architecture of the system, high level implementation details, and issues porting ION to VxWorks.
HOSC DTN Gateway Test Report

NASA Technical Reports Server (NTRS)

Pitts, Robert Lee

2012-01-01

Goals of this activity: Test the Huntsville Operations Support Center (HOSC) Delay/Disruption Tolerant Networking (DTN) Gateway for operational use Current activity includes: (1) Test the Implementation of a new DTN2 gateway at the HOSC (2) Confirm integration of DTN nodes into the S-band uplink and Ku-band downlink of the ISS for limited use (3) Implement Aggregate Custody Signal to ISS platforms (4) Verify operational support for Colorado University (CU) onboard components (5) Verify ability to support Multi-Purpose End-To- End Robotic Operation Network (METERON) OpsCon-2
LOPP: A Location Privacy Protected Anonymous Routing Protocol for Disruption Tolerant Network

NASA Astrophysics Data System (ADS)

Lu, Xiaofeng; Hui, Pan; Towsley, Don; Pu, Juhua; Xiong, Zhang

In this paper, we propose an anonymous routing protocol, LOPP, to protect the originator's location privacy in Delay/Disruption Tolerant Network (DTN). The goals of our study are to minimize the originator's probability of being localized (Pl) and maximize the destination's probability of receiving the message (Pr). The idea of LOPP is to divide a sensitive message into k segments and send each of them to n different neighbors. Although message fragmentation could reduce the destination's probability to receive a complete message, LOPP can decrease the originator's Pl. We validate LOPP on a real-world human mobility dataset. The simulation results show that LOPP can decrease the originator's Pl by over 54% with only 5.7% decrease in destination's Pr. We address the physical localization issue of DTN, which was not studied in the literature.
HyspIRI Low Latency Concept and Benchmarks

NASA Technical Reports Server (NTRS)

Mandl, Dan

2010-01-01

Topics include HyspIRI low latency data ops concept, HyspIRI data flow, ongoing efforts, experiment with Web Coverage Processing Service (WCPS) approach to injecting new algorithms into SensorWeb, low fidelity HyspIRI IPM testbed, compute cloud testbed, open cloud testbed environment, Global Lambda Integrated Facility (GLIF) and OCC collaboration with Starlight, delay tolerant network (DTN) protocol benchmarking, and EO-1 configuration for preliminary DTN prototype.
Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

NASA Technical Reports Server (NTRS)

Segui, John S.; Jennings, Esther H.; Clare, Loren P.

2013-01-01

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.
Integrated RF/Optical Interplanetary Networking Preliminary Explorations and Empirical Results

NASA Technical Reports Server (NTRS)

Raible, Daniel E.; Hylton, Alan G.

2012-01-01

Over the last decade interplanetary telecommunication capabilities have been significantly expanded--specifically in support of the Mars exploration rover and lander missions. NASA is continuing to drive advances in new, high payoff optical communications technologies to enhance the network to Gbps performance from Mars, and the transition from technology demonstration to operational system is examined through a hybrid RF/optical approach. Such a system combines the best features of RF and optical communications considering availability and performance to realize a dual band trunk line operating within characteristic constraints. Disconnection due to planetary obscuration and solar conjunction, link delays, timing, ground terminal mission congestion and scheduling policy along with space and atmospheric weather disruptions all imply the need for network protocol solutions to ultimately manage the physical layer in a transparent manner to the end user. Delay Tolerant Networking (DTN) is an approach under evaluation which addresses these challenges. A multi-hop multi-path hybrid RF and optical test bed has been constructed to emulate the integrated deep space network and to support protocol and hardware refinement. Initial experimental results characterize several of these challenges and evaluate the effectiveness of DTN as a solution to mitigate them.
Scalable Lunar Surface Networks and Adaptive Orbit Access

NASA Technical Reports Server (NTRS)

Wang, Xudong

2015-01-01

Teranovi Technologies, Inc., has developed innovative network architecture, protocols, and algorithms for both lunar surface and orbit access networks. A key component of the overall architecture is a medium access control (MAC) protocol that includes a novel mechanism of overlaying time division multiple access (TDMA) and carrier sense multiple access with collision avoidance (CSMA/CA), ensuring scalable throughput and quality of service. The new MAC protocol is compatible with legacy Institute of Electrical and Electronics Engineers (IEEE) 802.11 networks. Advanced features include efficiency power management, adaptive channel width adjustment, and error control capability. A hybrid routing protocol combines the advantages of ad hoc on-demand distance vector (AODV) routing and disruption/delay-tolerant network (DTN) routing. Performance is significantly better than AODV or DTN and will be particularly effective for wireless networks with intermittent links, such as lunar and planetary surface networks and orbit access networks.
Photonic ultrawideband impulse radio generation and modulation over a fiber link using a phase modulator and a delay interferometer.

PubMed

Shao, Jing; Sun, Junqiang

2012-08-15

We propose and experimentally demonstrate a simple and flexible photonic scheme for generation and modulation of ultrawideband (UWB) using a phase modulator and a fiber delay interferometer (DI)-based multichannel frequency discrimination. By introducing a Gaussian signal to the phase modulator, the UWB polarity-switchable doublet pulses can be achieved by combining the pair of UWB monocycle pulses with inverted polarities at the DI outputs under proper time delay. Furthermore, the pulse shape modulation, pulse position modulation, and on-off keying can be performed by coding the electrical data patterns and adjusting the time delay between the two monocycle pulses. Only a laser source introduced in the architecture guarantees the excellent dispersion tolerance over 75 km optical fiber link for UWB pulse sequence, which has potential application in future high-speed UWB impulse radio over optical fiber access networks.
COGNITIVE FUNCTIONING AND TOLERANCE FOR DELAY OF GRATIFICATION.

ERIC Educational Resources Information Center

ZIMILES, HERBERT

TWO EXPERIMENTS WERE CONDUCTED TO STUDY THE RELATIONSHIP BETWEEN A CHILD'S TOLERANCE FOR DELAY OF GRATIFICATION AND HIS ABILITY TO CONSERVE NUMBER AND PICTURES. OTHER MEASURES OF COGNITION ALSO WERE USED. TOLERANCE FOR DELAY OF GRATIFICATION WAS MEASURED BY THE CHILD'S DECISION TO RECEIVE A PACK OF CANDY AND A TOY ON THE DAY OF TESTING OR TO…
Enabling Communication and Navigation Technologies for Future Near Earth Science Missions

NASA Technical Reports Server (NTRS)

Israel, David J.; Heckler, Gregory; Menrad, Robert; Hudiburg, John; Boroson, Don; Robinson, Bryan; Cornwell, Donald

2016-01-01

In 2015, the Earth Regimes Network Evolution Study (ERNESt) proposed an architectural concept and technologies that evolve to enable space science and exploration missions out to the 2040 timeframe. The architectural concept evolves the current instantiations of the Near Earth Network and Space Network with new technologies to provide a global communication and navigation network that provides communication and navigation services to a wide range of space users in the near Earth domain. The technologies included High Rate Optical Communications, Optical Multiple Access (OMA), Delay Tolerant Networking (DTN), User Initiated Services (UIS), and advanced Position, Navigation, and Timing technology. This paper describes the key technologies and their current technology readiness levels. Examples of science missions that could be enabled by the technologies and the projected operational benefits of the architecture concept to missions are also described.
Dynamic Resource Allocation and Access Class Barring Scheme for Delay-Sensitive Devices in Machine to Machine (M2M) Communications.

PubMed

Li, Ning; Cao, Chao; Wang, Cong

2017-06-15

Supporting simultaneous access of machine-type devices is a critical challenge in machine-to-machine (M2M) communications. In this paper, we propose an optimal scheme to dynamically adjust the Access Class Barring (ACB) factor and the number of random access channel (RACH) resources for clustered machine-to-machine (M2M) communications, in which Delay-Sensitive (DS) devices coexist with Delay-Tolerant (DT) ones. In M2M communications, since delay-sensitive devices share random access resources with delay-tolerant devices, reducing the resources consumed by delay-sensitive devices means that there will be more resources available to delay-tolerant ones. Our goal is to optimize the random access scheme, which can not only satisfy the requirements of delay-sensitive devices, but also take the communication quality of delay-tolerant ones into consideration. We discuss this problem from the perspective of delay-sensitive services by adjusting the resource allocation and ACB scheme for these devices dynamically. Simulation results show that our proposed scheme realizes good performance in satisfying the delay-sensitive services as well as increasing the utilization rate of the random access resources allocated to them.
A Study of an Optical Lunar Surface Communications Network with High Bandwidth Direct to Earth Link

NASA Technical Reports Server (NTRS)

Wilson, K.; Biswas, A.; Schoolcraft, J.

2011-01-01

Analyzed optical DTE (direct to earth) and lunar relay satellite link analyses, greater than 200 Mbps downlink to 1-m Earth receiver and greater than 1 Mbps uplink achieved with mobile 5-cm lunar transceiver, greater than 1Gbps downlink and greater than 10 Mpbs uplink achieved with 10-cm stationary lunar transceiver, MITLL (MIT Lincoln Laboratory) 2013 LLCD (Lunar Laser Communications Demonstration) plans to demonstrate 622 Mbps downlink with 20 Mbps uplink between lunar orbiter and ground station; Identified top five technology challenges to deploying lunar optical network, Performed preliminary experiments on two of challenges: (i) lunar dust removal and (ii)DTN over optical carrier, Exploring opportunities to evaluate DTN (delay-tolerant networking) over optical link in a multi-node network e.g. Desert RATS.
Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing

DTIC Science & Technology

2012-09-28

population of misbehaving nodes or evolving hostility or social relations such that an application (e.g., secure routing) built on top of trust...optimization in DTNs in response to dynamically changing conditions such as increasing population of misbehaving nodes. The design part addresses the...The rest of the paper is organized as follows. In Section 2, we survey existing trust management protocols and approaches to deal with misbehaved
Disruption Tolerant Networking Flight Validation Experiment on NASA's EPOXI Mission

NASA Technical Reports Server (NTRS)

Wyatt, Jay; Burleigh, Scott; Jones, Ross; Torgerson, Leigh; Wissler, Steve

2009-01-01

In October and November of 2008, the Jet Propulsion Laboratory installed and tested essential elements of Delay/Disruption Tolerant Networking (DTN) technology on the Deep Impact spacecraft. This experiment, called Deep Impact Network Experiment (DINET), was performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. During DINET some 300 images were transmitted from the JPL nodes to the spacecraft. Then they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. All transmitted bundles were successfully received, without corruption. The DINET experiment demonstrated DTN readiness for operational use in space missions. This activity was part of a larger NASA space DTN development program to mature DTN to flight readiness for a wide variety of mission types by the end of 2011. This paper describes the DTN protocols, the flight demo implementation, validation metrics which were created for the experiment, and validation results.
Transcriptomic changes reveal gene networks responding to the overexpression of a blueberry DWARF AND DELAYED FLOWERING 1 gene in transgenic blueberry plants.

PubMed

Song, Guo-Qing; Gao, Xuan

2017-06-19

Constitutive expression of the CBF/DREB1 for increasing freezing tolerance in woody plants is often associated with other phenotypic changes including dwarf plant and delayed flowering. These phenotypic changes have been observed when Arabidopsis DWARF AND DELAYED FLOWERING 1 (DDF1) was overexpressed in A. thaliana plants. To date, the DDF1 orthologues have not been studied in woody plants. The aim of this study is to investigate transcriptomic responses to the overexpression of blueberry (Vaccinium corymbosum) DDF1 (herein, VcDDF1-OX). The VcDDF1-OX resulted in enhanced freezing tolerance in tetraploid blueberry plants and did not result in significant changes in plant size, chilling requirement, and flowering time. Comparative transcriptome analysis of transgenic 'Legacy-VcDDF1-OX' plants containing an overexpressed VcDDF1 with non-transgenic highbush blueberry 'Legacy' plants revealed the VcDDF1-OX derived differentially expressed (DE) genes and transcripts in the pathways of cold-response, plant flowering, DELLA proteins, and plant phytohormones. The increase in freezing tolerance was associated to the expression of cold-regulated genes (CORs) and the ethylene pathway genes. The unchanged plant size, dormancy and flowering were due to the minimal effect of the VcDDF1-OX on the expression of DELLA proteins, flowering pathway genes, and the other phytohormone genes related to plant growth and development. The DE genes in auxin and cytokinin pathways suggest that the VcDDF1-OX has also altered plant tolerance to drought and high salinity. A DDF1 orthologue in blueberry functioned differently from the DDF1 reported in Arabidopsis. The overexpression of VcDDF1 or its orthologues is a new approach to increase freezing tolerance of deciduous woody plant species with no obvious effect on plant size and plant flowering time.
Tolerance and immunity in mice infected with herpes simplex virus: simultaneous induction of protective immunity and tolerance to delayed-type hypersensitivity.

PubMed

Nash, A A; Gell, P G; Wildy, P

1981-05-01

Unresponsiveness to delayed type hypersensitivity was induced in mice following an intravenous injection of herpes simplex virus. The principal tolerogens used were thymidine kinase-deficient virus mutants which grow poorly in vivo; u.v.-inactivated and to a lesser extent formalin-inactivated virus were also tolerogenic. The tolerance induced was specific for the virus type. Despite the tolerance to delayed hypersensitivity, anti-viral immunity is present as determined by the rapid inactivation of infectious virus. The mechanism of tolerance to herpes virus and the importance of these observations for the pathogenesis of viral disease is discussed.

Tolerance and immunity in mice infected with herpes simplex virus: simultaneous induction of protective immunity and tolerance to delayed-type hypersensitivity.

PubMed Central

Nash, A A; Gell, P G; Wildy, P

1981-01-01

Unresponsiveness to delayed type hypersensitivity was induced in mice following an intravenous injection of herpes simplex virus. The principal tolerogens used were thymidine kinase-deficient virus mutants which grow poorly in vivo; u.v.-inactivated and to a lesser extent formalin-inactivated virus were also tolerogenic. The tolerance induced was specific for the virus type. Despite the tolerance to delayed hypersensitivity, anti-viral immunity is present as determined by the rapid inactivation of infectious virus. The mechanism of tolerance to herpes virus and the importance of these observations for the pathogenesis of viral disease is discussed. PMID:7251047
Climate network analysis of regional precipitation extremes: The true story told by event synchronization

NASA Astrophysics Data System (ADS)

Odenweller, Adrian; Donner, Reik V.

2017-04-01

Over the last decade, complex network methods have been frequently used for characterizing spatio-temporal patterns of climate variability from a complex systems perspective, yielding new insights into time-dependent teleconnectivity patterns and couplings between different components of the Earth climate. Among the foremost results reported, network analyses of the synchronicity of extreme events as captured by the so-called event synchronization have been proposed to be powerful tools for disentangling the spatio-temporal organization of particularly extreme rainfall events and anticipating the timing of monsoon onsets or extreme floodings. Rooted in the analysis of spike train synchrony analysis in the neurosciences, event synchronization has the great advantage of automatically classifying pairs of events arising at two distinct spatial locations as temporally close (and, thus, possibly statistically - or even dynamically - interrelated) or not without the necessity of selecting an additional parameter in terms of a maximally tolerable delay between these events. This consideration is conceptually justified in case of the original application to spike trains in electroencephalogram (EEG) recordings, where the inter-spike intervals show relatively narrow distributions at high temporal sampling rates. However, in case of climate studies, precipitation extremes defined by daily precipitation sums exceeding a certain empirical percentile of their local distribution exhibit a distinctively different type of distribution of waiting times between subsequent events. This raises conceptual concerns if event synchronization is still appropriate for detecting interlinkages between spatially distributed precipitation extremes. In order to study this problem in more detail, we employ event synchronization together with an alternative similarity measure for event sequences, event coincidence rates, which requires a manual setting of the tolerable maximum delay between two events to be considered potentially related. Both measures are then used to generate climate networks from parts of the satellite-based TRMM precipitation data set at daily resolution covering the Indian and East Asian monsoon domains, respectively, thereby reanalysing previously published results. The obtained spatial patterns of degree densities and local clustering coefficients exhibit marked differences between both similarity measures. Specifically, we demonstrate that there exists a strong relationship between the fraction of extremes occurring at subsequent days and the degree density in the event synchronization based networks, suggesting that the spatial patterns obtained using this approach are strongly affected by the presence of serial dependencies between events. Given that a manual selection of the maximally tolerable delay between two events can be guided by a priori climatological knowledge and even used for systematic testing of different hypotheses on climatic processes underlying the emergence of spatio-temporal patterns of extreme precipitation, our results provide evidence that event coincidence rates are a more appropriate statistical characteristic for similarity assessment and network construction for climate extremes, while results based on event synchronization need to be interpreted with great caution.
Tolerance and immunity in mice infected with herpes simplex virus: studies on the mechanism of tolerance to delayed-type hypersensitivity.

PubMed

Nash, A A; Phelan, J; Gell, P G; Wildy, P

1981-06-01

Tolerance to delayed-type hypersensitivity is produced in mice following an intravenous injection of herpes simplex virus. This form of tolerance is produced early on, following simultaneous injections of virus subcutaneously and intravenously, and is long lasting (greater than 100 days). The early tolerance mechanism is resistant to high doses of cyclophosphamide and is not transferable by serum or spleen cells taken after 7 days. However, spleen cells taken at 14 days onwards inhibit the induction of delayed hypersensitivity when transferred to normal syngeneic recipients. These cells are T lymphocytes and are specific for the herpes type used in the induction.
Tolerance and immunity in mice infected with herpes simplex virus: studies on the mechanism of tolerance to delayed-type hypersensitivity.

PubMed Central

Nash, A A; Phelan, J; Gell, P G; Wildy, P

1981-01-01

Tolerance to delayed-type hypersensitivity is produced in mice following an intravenous injection of herpes simplex virus. This form of tolerance is produced early on, following simultaneous injections of virus subcutaneously and intravenously, and is long lasting (greater than 100 days). The early tolerance mechanism is resistant to high doses of cyclophosphamide and is not transferable by serum or spleen cells taken after 7 days. However, spleen cells taken at 14 days onwards inhibit the induction of delayed hypersensitivity when transferred to normal syngeneic recipients. These cells are T lymphocytes and are specific for the herpes type used in the induction. PMID:6265348
Stochastic Averaging for Constrained Optimization With Application to Online Resource Allocation

NASA Astrophysics Data System (ADS)

Chen, Tianyi; Mokhtari, Aryan; Wang, Xin; Ribeiro, Alejandro; Giannakis, Georgios B.

2017-06-01

Existing approaches to resource allocation for nowadays stochastic networks are challenged to meet fast convergence and tolerable delay requirements. The present paper leverages online learning advances to facilitate stochastic resource allocation tasks. By recognizing the central role of Lagrange multipliers, the underlying constrained optimization problem is formulated as a machine learning task involving both training and operational modes, with the goal of learning the sought multipliers in a fast and efficient manner. To this end, an order-optimal offline learning approach is developed first for batch training, and it is then generalized to the online setting with a procedure termed learn-and-adapt. The novel resource allocation protocol permeates benefits of stochastic approximation and statistical learning to obtain low-complexity online updates with learning errors close to the statistical accuracy limits, while still preserving adaptation performance, which in the stochastic network optimization context guarantees queue stability. Analysis and simulated tests demonstrate that the proposed data-driven approach improves the delay and convergence performance of existing resource allocation schemes.
Applying Web-Based Tools for Research, Engineering, and Operations

NASA Technical Reports Server (NTRS)

Ivancic, William D.

2011-01-01

Personnel in the NASA Glenn Research Center Network and Architectures branch have performed a variety of research related to space-based sensor webs, network centric operations, security and delay tolerant networking (DTN). Quality documentation and communications, real-time monitoring and information dissemination are critical in order to perform quality research while maintaining low cost and utilizing multiple remote systems. This has been accomplished using a variety of Internet technologies often operating simultaneously. This paper describes important features of various technologies and provides a number of real-world examples of how combining Internet technologies can enable a virtual team to act efficiently as one unit to perform advanced research in operational systems. Finally, real and potential abuses of power and manipulation of information and information access is addressed.
Trust Management for Encounter-Based Routing in Delay Tolerant Networks

DTIC Science & Technology

2010-05-15

8217 4 O-i 0.5 E 1.6 a 90% M 300 i / fc -vfc 0.8:0.2 « 2 1 IDS 6OO5 Oil (0, 2] mis D WS p/DS 0.5% Eo [12,24] hrs I/;.• [160,320 480] min. Below we...34 IEEE Infocom, Barcelona , Spain, Apr. 2006, pp. 1-11. [3] J.H. Cho, A. Swami and I.R. Chen, "Modeling and Analysis of Trust Management for Cognitive
The Deep Impact Network Experiment Operations Center

NASA Technical Reports Server (NTRS)

Torgerson, J. Leigh; Clare, Loren; Wang, Shin-Ywan

2009-01-01

Delay/Disruption Tolerant Networking (DTN) promises solutions in solving space communications challenges arising from disconnections as orbiters lose line-of-sight with landers, long propagation delays over interplanetary links, and other phenomena. DTN has been identified as the basis for the future NASA space communications network backbone, and international standardization is progressing through both the Consultative Committee for Space Data Systems (CCSDS) and the Internet Engineering Task Force (IETF). JPL has developed an implementation of the DTN architecture, called the Interplanetary Overlay Network (ION). ION is specifically implemented for space use, including design for use in a real-time operating system environment and high processing efficiency. In order to raise the Technology Readiness Level of ION, the first deep space flight demonstration of DTN is underway, using the Deep Impact (DI) spacecraft. Called the Deep Impact Network (DINET), operations are planned for Fall 2008. An essential component of the DINET project is the Experiment Operations Center (EOC), which will generate and receive the test communications traffic as well as "out-of-DTN band" command and control of the DTN experiment, store DTN flight test information in a database, provide display systems for monitoring DTN operations status and statistics (e.g., bundle throughput), and support query and analyses of the data collected. This paper describes the DINET EOC and its value in the DTN flight experiment and potential for further DTN testing.
CFDP for Interplanetary Overlay Network

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2011-01-01

The CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol for Interplanetary Overlay Network (CFDP-ION) is an implementation of CFDP that uses IO' s DTN (delay tolerant networking) implementation as its UT (unit-data transfer) layer. Because the DTN protocols effect automatic, reliable transmission via multiple relays, CFDP-ION need only satisfy the requirements for Class 1 ("unacknowledged") CFDP. This keeps the implementation small, but without loss of capability. This innovation minimizes processing resources by using zero-copy objects for file data transmission. It runs without modification in VxWorks, Linux, Solaris, and OS/X. As such, this innovation can be used without modification in both flight and ground systems. Integration with DTN enables the CFDP implementation itself to be very simple; therefore, very small. Use of ION infrastructure minimizes consumption of storage and processing resources while maximizing safety.
Coexistence of ZigBee-Based WBAN and WiFi for Health Telemonitoring Systems.

PubMed

Kim, Yena; Lee, SeungSeob; Lee, SuKyoung

2016-01-01

The development of telemonitoring via wireless body area networks (WBANs) is an evolving direction in personalized medicine and home-based mobile health. A WBAN consists of small, intelligent medical sensors which collect physiological parameters such as electrocardiogram, electroencephalography, and blood pressure. The recorded physiological signals are sent to a coordinator via wireless technologies, and are then transmitted to a healthcare monitoring center. One of the most widely used wireless technologies in WBANs is ZigBee because it is targeted at applications that require a low data rate and long battery life. However, ZigBee-based WBANs face severe interference problems in the presence of WiFi networks. This problem is caused by the fact that most ZigBee channels overlap with WiFi channels, severely affecting the ability of healthcare monitoring systems to guarantee reliable delivery of physiological signals. To solve this problem, we have developed an algorithm that controls the load in WiFi networks to guarantee the delay requirement for physiological signals, especially for emergency messages, in environments with coexistence of ZigBee-based WBAN and WiFi. Since WiFi applications generate traffic with different delay requirements, we focus only on WiFi traffic that does not have stringent timing requirements. In this paper, therefore, we propose an adaptive load control algorithm for ZigBee-based WBAN/WiFi coexistence environments, with the aim of guaranteeing that the delay experienced by ZigBee sensors does not exceed a maximally tolerable period of time. Simulation results show that our proposed algorithm guarantees the delay performance of ZigBee-based WBANs by mitigating the effects of WiFi interference in various scenarios.
Adaptive multi-resolution Modularity for detecting communities in networks

NASA Astrophysics Data System (ADS)

Chen, Shi; Wang, Zhi-Zhong; Bao, Mei-Hua; Tang, Liang; Zhou, Ji; Xiang, Ju; Li, Jian-Ming; Yi, Chen-He

2018-02-01

Community structure is a common topological property of complex networks, which attracted much attention from various fields. Optimizing quality functions for community structures is a kind of popular strategy for community detection, such as Modularity optimization. Here, we introduce a general definition of Modularity, by which several classical (multi-resolution) Modularity can be derived, and then propose a kind of adaptive (multi-resolution) Modularity that can combine the advantages of different Modularity. By applying the Modularity to various synthetic and real-world networks, we study the behaviors of the methods, showing the validity and advantages of the multi-resolution Modularity in community detection. The adaptive Modularity, as a kind of multi-resolution method, can naturally solve the first-type limit of Modularity and detect communities at different scales; it can quicken the disconnecting of communities and delay the breakup of communities in heterogeneous networks; and thus it is expected to generate the stable community structures in networks more effectively and have stronger tolerance against the second-type limit of Modularity.
DMP: Detouring Using Multiple Paths against Jamming Attack for Ubiquitous Networking System

PubMed Central

Kim, Mihui; Chae, Kijoon

2010-01-01

To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute. PMID:22319316
DMP: detouring using multiple paths against jamming attack for ubiquitous networking system.

PubMed

Kim, Mihui; Chae, Kijoon

2010-01-01

To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute.
Tolerance to cocaine's effects on schedule-controlled behavior: role of delay between pause-ending responses and reinforcement.

PubMed

Macaskill, Anne C; Branch, Marc N

2012-01-01

The schedule of reinforcement under which behavior is maintained is an important contributor to whether tolerance to the behavioral effects of cocaine develops. Schedule parameter value (for example, fixed-ratio size) has been shown to affect the development of tolerance under some schedule types but not others, but the specific procedural variables causing this effect remain to be identified. To date, schedule-parameter-related tolerance has developed when a longer pause after reinforcement does not lead to a shorter delay between the response that ends the pause and reinforcement. The current study investigated the importance of this variable in pigeons using a multiple chained Fixed-Ratio 1, Fixed-Time x schedule, in which the first key peck in a trial produced a stimulus change and initiated a delay at the end of which food was presented regardless of whether or not additional pecks were made during the delay. Dose-response curves were assessed before, during and after chronic (daily) administration of cocaine. Tolerance to the pause-increasing effects of cocaine occurred to a similar degree regardless of the scheduled time between the end of the pause and reinforcement. Therefore, the relationship between pause length and delay to reinforcement does not provide an explanation for schedule-parameter-related tolerance. Copyright © 2011 Elsevier Inc. All rights reserved.
Security Analysis of DTN Architecture and Bundle Protocol Specification for Space-Based Networks

NASA Technical Reports Server (NTRS)

Ivancic, William D.

2009-01-01

A Delay-Tolerant Network (DTN) Architecture (Request for Comment, RFC-4838) and Bundle Protocol Specification, RFC-5050, have been proposed for space and terrestrial networks. Additional security specifications have been provided via the Bundle Security Specification (currently a work in progress as an Internet Research Task Force internet-draft) and, for link-layer protocols applicable to Space networks, the Licklider Transport Protocol Security Extensions. This document provides a security analysis of the current DTN RFCs and proposed security related internet drafts with a focus on space-based communication networks, which is a rather restricted subset of DTN networks. Note, the original focus and motivation of DTN work was for the Interplanetary Internet . This document does not address general store-and-forward network overlays, just the current work being done by the Internet Research Task Force (IRTF) and the Consultative Committee for Space Data Systems (CCSDS) Space Internetworking Services Area (SIS) - DTN working group under the DTN and Bundle umbrellas. However, much of the analysis is relevant to general store-and-forward overlays.
Integrated Social and QoS Trust-Based Routing in Mobile Ad Hoc Delay Tolerant Networks

DTIC Science & Technology

2010-11-15

d-connectivity, honesty, or unselfishness) with: encounter*,. , A ^// m = / (3) {•p ounter,x r. , . .-, ( Ti x m (t), ifm =j ^indirect. X, T...take into account node »’ s belief in node m in the calculation ofT(jreet’ x(t + At). This models the decay of trust as trust is derived from a distant...directly based on node /’ s past experiences with node m up to time t + At, including the current encounter. Taking the fact that /? a + /?2 = 1, we obtain
DTN Implementation and Utilization Options on the International Space Station

NASA Technical Reports Server (NTRS)

Nichols, Kelvin; Holbrook, Mark; Pitts, Lee; Gifford, Kevin; Jenkins, Andrew; Kuzminsky, Sebastian

2010-01-01

This slide presentation reviews the implementation and future uses of Delay/Disruption Tolerant Networking (DTN) for space communication, using the International Space Station as the primary example. The presentation includes: (1) A brief introduction of the current communications architecture of the ISS (2) How current payload operations are handled in the non-DTN environment (3) Making the case to implement DTN into the current payload science operations model (4) Phase I DTN Operations: early implementation with BioServe's CGBA Payload (5) Phase II DTN Operations: Developing the HOSC DTN Gateway
Facilitating tolerance of delayed reinforcement during functional communication training.

PubMed

Fisher, W W; Thompson, R H; Hagopian, L P; Bowman, L G; Krug, A

2000-01-01

Few clinical investigations have addressed the problem of delayed reinforcement. In this investigation, three individuals whose destructive behavior was maintained by positive reinforcement were treated using functional communication training (FCT) with extinction (EXT). Next, procedures used in the basic literature on delayed reinforcement and self-control (reinforcer delay fading, punishment of impulsive responding, and provision of an alternative activity during reinforcer delay) were used to teach participants to tolerate delayed reinforcement. With the first case, reinforcer delay fading alone was effective at maintaining low rates of destructive behavior while introducing delayed reinforcement. In the second case, the addition of a punishment component reduced destructive behavior to near-zero levels and facilitated reinforcer delay fading. With the third case, reinforcer delay fading was associated with increases in masturbation and head rolling, but prompting and praising the individual for completing work during the delay interval reduced all problem behaviors and facilitated reinforcer delay fading.
Local Tacrolimus (FK506) Delivery for Prevention of Acute Rejection in the Nonhuman Primate Delayed Mixed Chimerism Vascularized Composite Allograft Tolerance Induction Protocol

DTIC Science & Technology

2016-10-01

Chimerism Vascularized Composite Allograft Tolerance Induction Protocol PRINCIPAL INVESTIGATORS: Dr. Curtis L. Cetrulo CONTRACTING ORGANIZATION...Tacrolimus (FK506) Delivery for Prevention of Acute Rejection in the Nonhuman Primate Delayed Mixed Chimerism Vascularized Composite Allograft Tolerance...tacrolimus, FK506, vascularized composite allografts , immune rejection, preclinical, transplant, nonhuman primate model, degradable polymer, tyrosine
The Deep Impact Network Experiment Operations Center Monitor and Control System

NASA Technical Reports Server (NTRS)

Wang, Shin-Ywan (Cindy); Torgerson, J. Leigh; Schoolcraft, Joshua; Brenman, Yan

2009-01-01

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

A performance study of live VM migration technologies: VMotion vs XenMotion

NASA Astrophysics Data System (ADS)

Feng, Xiujie; Tang, Jianxiong; Luo, Xuan; Jin, Yaohui

2011-12-01

Due to the growing demand of flexible resource management for cloud computing services, researches on live virtual machine migration have attained more and more attention. Live migration of virtual machine across different hosts has been a powerful tool to facilitate system maintenance, load balancing, fault tolerance and so on. In this paper, we use a measurement-based approach to compare the performance of two major live migration technologies under certain network conditions, i.e., VMotion and XenMotion. The results show that VMotion generates much less data transferred than XenMotion when migrating identical VMs. However, in network with moderate packet loss and delay, which are typical in a VPN (virtual private network) scenario used to connect the data centers, XenMotion outperforms VMotion in total migration time. We hope that this study can be helpful in choosing suitable virtualization environments for data center administrators and optimizing existing live migration mechanisms.
Chaotic simulated annealing by a neural network with a variable delay: design and application.

PubMed

Chen, Shyan-Shiou

2011-10-01

In this paper, we have three goals: the first is to delineate the advantages of a variably delayed system, the second is to find a more intuitive Lyapunov function for a delayed neural network, and the third is to design a delayed neural network for a quadratic cost function. For delayed neural networks, most researchers construct a Lyapunov function based on the linear matrix inequality (LMI) approach. However, that approach is not intuitive. We provide a alternative candidate Lyapunov function for a delayed neural network. On the other hand, if we are first given a quadratic cost function, we can construct a delayed neural network by suitably dividing the second-order term into two parts: a self-feedback connection weight and a delayed connection weight. To demonstrate the advantage of a variably delayed neural network, we propose a transiently chaotic neural network with variable delay and show numerically that the model should possess a better searching ability than Chen-Aihara's model, Wang's model, and Zhao's model. We discuss both the chaotic and the convergent phases. During the chaotic phase, we simply present bifurcation diagrams for a single neuron with a constant delay and with a variable delay. We show that the variably delayed model possesses the stochastic property and chaotic wandering. During the convergent phase, we not only provide a novel Lyapunov function for neural networks with a delay (the Lyapunov function is independent of the LMI approach) but also establish a correlation between the Lyapunov function for a delayed neural network and an objective function for the traveling salesman problem. © 2011 IEEE
The ecological rationality of delay tolerance: insights from capuchin monkeys.

PubMed

Addessi, Elsa; Paglieri, Fabio; Focaroli, Valentina

2011-04-01

Both human and non-human animals often face decisions between options available at different times, and the capacity of delaying gratification has usually been considered one of the features distinguishing humans from other animals. However, this characteristic can widely vary across individuals, species, and types of task and it is still unclear whether it is accounted for by phylogenetic relatedness, feeding ecology, social structure, or metabolic rate. To disentangle these hypotheses, we evaluated temporal preferences in capuchin monkeys, South-American primates that, despite splitting off from human lineage approximately 35 million years ago, show striking behavioural analogies with the great apes. Then, we compared capuchins' performance with that of the other primate species tested so far with the same procedure. Overall, capuchins showed a delay tolerance significantly higher than closely related species, such as marmosets and tamarins, and comparable to that shown by great apes. Capuchins' tool use abilities might explain their comparatively high preference for delayed options in inter-temporal choices. Moreover, as in humans, capuchin females showed a greater delay tolerance than males, possibly because of their less opportunistic foraging style. Thus, our results shed light on the evolutionary origins of self-control supporting explanations of delay tolerance in terms of feeding ecology. Copyright © 2010 Elsevier B.V. All rights reserved.
Qualitative analysis of Cohen-Grossberg neural networks with multiple delays

NASA Astrophysics Data System (ADS)

Ye, Hui; Michel, Anthony N.; Wang, Kaining

1995-03-01

It is well known that a class of artificial neural networks with symmetric interconnections and without transmission delays, known as Cohen-Grossberg neural networks, possesses global stability (i.e., all trajectories tend to some equilibrium). We demonstrate in the present paper that many of the qualitative properties of Cohen-Grossberg networks will not be affected by the introduction of sufficiently small delays. Specifically, we establish some bound conditions for the time delays under which a given Cohen-Grossberg network with multiple delays is globally stable and possesses the same asymptotically stable equilibria as the corresponding network without delays. An effective method of determining the asymptotic stability of an equilibrium of a Cohen-Grossberg network with multiple delays is also presented. The present results are motivated by some of the authors earlier work [Phys. Rev. E 50, 4206 (1994)] and by some of the work of Marcus and Westervelt [Phys. Rev. A 39, 347 (1989)]. These works address qualitative analyses of Hopfield neural networks with one time delay. The present work generalizes these results to Cohen-Grossberg neural networks with multiple time delays. Hopfield neural networks constitute special cases of Cohen-Grossberg neural networks.
Synchronization in networks with heterogeneous coupling delays

NASA Astrophysics Data System (ADS)

Otto, Andreas; Radons, Günter; Bachrathy, Dániel; Orosz, Gábor

2018-01-01

Synchronization in networks of identical oscillators with heterogeneous coupling delays is studied. A decomposition of the network dynamics is obtained by block diagonalizing a newly introduced adjacency lag operator which contains the topology of the network as well as the corresponding coupling delays. This generalizes the master stability function approach, which was developed for homogenous delays. As a result the network dynamics can be analyzed by delay differential equations with distributed delay, where different delay distributions emerge for different network modes. Frequency domain methods are used for the stability analysis of synchronized equilibria and synchronized periodic orbits. As an example, the synchronization behavior in a system of delay-coupled Hodgkin-Huxley neurons is investigated. It is shown that the parameter regions where synchronized periodic spiking is unstable expand when increasing the delay heterogeneity.
Providing the full DDF link protection for bus-connected SIEPON based system architecture

NASA Astrophysics Data System (ADS)

Hwang, I.-Shyan; Pakpahan, Andrew Fernando; Liem, Andrew Tanny; Nikoukar, AliAkbar

2016-09-01

Currently a massive amount of traffic per second is delivered through EPON systems, one of the prominent access network technologies for delivering the next generation network. Therefore, it is vital to keep the EPON optical distribution network (ODN) working by providing the necessity protection mechanism in the deployed devices; otherwise, when failures occur it will cause a great loss for both network operators and business customers. In this paper, we propose a bus-connected architecture to protect and recover distribution drop fiber (DDF) link faults or transceiver failures at ONU(s) in SIEPON system. The proposed architecture provides a cost-effective architecture, which delivers the high fault-tolerance in handling multiple DDF faults, while also providing flexibility in choosing the backup ONU assignments. Simulation results show that the proposed architecture provides the reliability and maintains quality of service (QoS) performance in terms of mean packet delay, system throughput, packet loss and EF jitter when DDF link failures occur.
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.
At the Intersection of Networks and Highly Interactive Online Games

NASA Astrophysics Data System (ADS)

Armitage, Grenville

The game industry continues to evolves its techniques for extracting the most realistic 'immersion' experience for players given the vagaries on best-effort Internet service. A key challenge for service providers is understanding the characteristics of traffic imposed on networks by games, and their service quality requirements. Interactive online games are particularly susceptible to the side effects of other non-interactive (or delay- and loss-tolerant) traffic sharing next- generation access links. This creates challenges out toward the edges, where high-speed home LANs squeeze through broadband consumer access links to reach the Internet. In this chapter we identify a range of research work exploring many issues associated with the intersection of highly interactive games and the Internet, and hopefully stimulate some further thinking along these lines.
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.
Criteria for Evaluating Alternative Network and Link Layer Protocols for the NASA Constellation Program Communication Architecture

NASA Technical Reports Server (NTRS)

Benbenek, Daniel; Soloff, Jason; Lieb, Erica

2010-01-01

Selecting a communications and network architecture for future manned space flight requires an evaluation of the varying goals and objectives of the program, development of communications and network architecture evaluation criteria, and assessment of critical architecture trades. This paper uses Cx Program proposed exploration activities as a guideline; lunar sortie, outpost, Mars, and flexible path options are described. A set of proposed communications network architecture criteria are proposed and described. They include: interoperability, security, reliability, and ease of automating topology changes. Finally a key set of architecture options are traded including (1) multiplexing data at a common network layer vs. at the data link layer, (2) implementing multiple network layers vs. a single network layer, and (3) the use of a particular network layer protocol, primarily IPv6 vs. Delay Tolerant Networking (DTN). In summary, the protocol options are evaluated against the proposed exploration activities and their relative performance with respect to the criteria are assessed. An architectural approach which includes (a) the capability of multiplexing at both the network layer and the data link layer and (b) a single network layer for operations at each program phase, as these solutions are best suited to respond to the widest array of program needs and meet each of the evaluation criteria.
Impact of leakage delay on bifurcation in high-order fractional BAM neural networks.

PubMed

Huang, Chengdai; Cao, Jinde

2018-02-01

The effects of leakage delay on the dynamics of neural networks with integer-order have lately been received considerable attention. It has been confirmed that fractional neural networks more appropriately uncover the dynamical properties of neural networks, but the results of fractional neural networks with leakage delay are relatively few. This paper primarily concentrates on the issue of bifurcation for high-order fractional bidirectional associative memory(BAM) neural networks involving leakage delay. The first attempt is made to tackle the stability and bifurcation of high-order fractional BAM neural networks with time delay in leakage terms in this paper. The conditions for the appearance of bifurcation for the proposed systems with leakage delay are firstly established by adopting time delay as a bifurcation parameter. Then, the bifurcation criteria of such system without leakage delay are successfully acquired. Comparative analysis wondrously detects that the stability performance of the proposed high-order fractional neural networks is critically weakened by leakage delay, they cannot be overlooked. Numerical examples are ultimately exhibited to attest the efficiency of the theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.
In-Space Networking On NASA's SCaN Testbed

NASA Technical Reports Server (NTRS)

Brooks, David; Eddy, Wesley M.; Clark, Gilbert J., III; Johnson, Sandra K.

2016-01-01

The NASA Space Communications and Navigation (SCaN) Testbed, an external payload onboard the International Space Station, is equipped with three software defined radios (SDRs) and a programmable flight computer. The purpose of the Testbed is to conduct inspace research in the areas of communication, navigation, and networking in support of NASA missions and communication infrastructure. Multiple reprogrammable elements in the end to end system, along with several communication paths and a semi-operational environment, provides a unique opportunity to explore networking concepts and protocols envisioned for the future Solar System Internet (SSI). This paper will provide a general description of the system's design and the networking protocols implemented and characterized on the testbed, including Encapsulation, IP over CCSDS, and Delay-Tolerant Networking (DTN). Due to the research nature of the implementation, flexibility and robustness are considered in the design to enable expansion for future adaptive and cognitive techniques. Following a detailed design discussion, lessons learned and suggestions for future missions and communication infrastructure elements will be provided. Plans for the evolving research on SCaN Testbed as it moves towards a more adaptive, autonomous system will be discussed.
Enabling Communication and Navigation Technologies for Future Near Earth Science Missions

NASA Technical Reports Server (NTRS)

Israel, David J.; Heckler, Greg; Menrad, Robert J.; Hudiburg, John J.; Boroson, Don M.; Robinson, Bryan S.; Cornwell, Donald M.

2016-01-01

In 2015, the Earth Regimes Network Evolution Study (ERNESt) Team proposed a fundamentally new architectural concept, with enabling technologies, that defines an evolutionary pathway out to the 2040 timeframe in which an increasing user community comprised of more diverse space science and exploration missions can be supported. The architectural concept evolves the current instantiations of the Near Earth Network and Space Network through implementation of select technologies resulting in a global communication and navigation network that provides communication and navigation services to a wide range of space users in the Near Earth regime, defined as an Earth-centered sphere with radius of 2M Km. The enabling technologies include: High Rate Optical Communications, Optical Multiple Access (OMA), Delay Tolerant Networking (DTN), User Initiated Services (UIS), and advanced Position, Navigation, and Timing technology (PNT). This paper describes this new architecture, the key technologies that enable it and their current technology readiness levels. Examples of science missions that could be enabled by the technologies and the projected operational benefits of the architecture concept to missions are also described.
Political opinion formation: Initial opinion distribution and individual heterogeneity of tolerance

NASA Astrophysics Data System (ADS)

Jin, Cheng; Li, Yifu; Jin, Xiaogang

2017-02-01

Opinion dynamics on networks have received serious attention for its profound prospects in social behaviours and self-organized systems. However, political opinion formation, as one typical and significant case, remains lacking in discussion. Previous agent-based simulations propose various models that are based on different mechanisms like the coevolution between network topology and status transition. Nonetheless, even under the same network topology and with the same simple mechanism, forming opinions can still be uncertain. In this work, we propose two features, the initial distribution of opinions and the individual heterogeneity of tolerances on opinion changing, in political opinion formation. These two features are imbedded in the network construction phase of a classical model. By comparing multi simple-party systems, along with a detailed analysis on the two-party system, we capture the critical phenomenon of fragmentation, polarization and consensus both in the persistent stable stage and in-process. We further introduce the average ratio of nearest neighbours to characterize the stage of opinion formation. The results show that the initial distribution of opinions leads to different evolution results on similar random networks. In addition, the existence of stubborn nodes plays a special role: only nodes that are extremely stubborn can cause the change of final opinion distribution while in other cases they only delay the time to reach stability. If stubborn nodes are small in number, their effects are confined within a small range. This theoretical work goes deeper on an existing model, it is an early exploration on qualitative and quantitative simulation of party competition.
A regulatory network-based approach dissects late maturation processes related to the acquisition of desiccation tolerance and longevity of Medicago truncatula seeds.

PubMed

Verdier, Jerome; Lalanne, David; Pelletier, Sandra; Torres-Jerez, Ivone; Righetti, Karima; Bandyopadhyay, Kaustav; Leprince, Olivier; Chatelain, Emilie; Vu, Benoit Ly; Gouzy, Jerome; Gamas, Pascal; Udvardi, Michael K; Buitink, Julia

2013-10-01

In seeds, desiccation tolerance (DT) and the ability to survive the dry state for prolonged periods of time (longevity) are two essential traits for seed quality that are consecutively acquired during maturation. Using transcriptomic and metabolomic profiling together with a conditional-dependent network of global transcription interactions, we dissected the maturation events from the end of seed filling to final maturation drying during the last 3 weeks of seed development in Medicago truncatula. The network revealed distinct coexpression modules related to the acquisition of DT, longevity, and pod abscission. The acquisition of DT and dormancy module was associated with abiotic stress response genes, including late embryogenesis abundant (LEA) genes. The longevity module was enriched in genes involved in RNA processing and translation. Concomitantly, LEA polypeptides accumulated, displaying an 18-d delayed accumulation compared with transcripts. During maturation, gulose and stachyose levels increased and correlated with longevity. A seed-specific network identified known and putative transcriptional regulators of DT, including ABSCISIC ACID-INSENSITIVE3 (MtABI3), MtABI4, MtABI5, and APETALA2/ ETHYLENE RESPONSE ELEMENT BINDING PROTEIN (AtAP2/EREBP) transcription factor as major hubs. These transcriptional activators were highly connected to LEA genes. Longevity genes were highly connected to two MtAP2/EREBP and two basic leucine zipper transcription factors. A heat shock factor was found at the transition of DT and longevity modules, connecting to both gene sets. Gain- and loss-of-function approaches of MtABI3 confirmed 80% of its predicted targets, thereby experimentally validating the network. This study captures the coordinated regulation of seed maturation and identifies distinct regulatory networks underlying the preparation for the dry and quiescent states.
A Regulatory Network-Based Approach Dissects Late Maturation Processes Related to the Acquisition of Desiccation Tolerance and Longevity of Medicago truncatula Seeds1[C][W][OPEN

PubMed Central

Verdier, Jerome; Lalanne, David; Pelletier, Sandra; Torres-Jerez, Ivone; Righetti, Karima; Bandyopadhyay, Kaustav; Leprince, Olivier; Chatelain, Emilie; Vu, Benoit Ly; Gouzy, Jerome; Gamas, Pascal; Udvardi, Michael K.; Buitink, Julia

2013-01-01

In seeds, desiccation tolerance (DT) and the ability to survive the dry state for prolonged periods of time (longevity) are two essential traits for seed quality that are consecutively acquired during maturation. Using transcriptomic and metabolomic profiling together with a conditional-dependent network of global transcription interactions, we dissected the maturation events from the end of seed filling to final maturation drying during the last 3 weeks of seed development in Medicago truncatula. The network revealed distinct coexpression modules related to the acquisition of DT, longevity, and pod abscission. The acquisition of DT and dormancy module was associated with abiotic stress response genes, including late embryogenesis abundant (LEA) genes. The longevity module was enriched in genes involved in RNA processing and translation. Concomitantly, LEA polypeptides accumulated, displaying an 18-d delayed accumulation compared with transcripts. During maturation, gulose and stachyose levels increased and correlated with longevity. A seed-specific network identified known and putative transcriptional regulators of DT, including ABSCISIC ACID-INSENSITIVE3 (MtABI3), MtABI4, MtABI5, and APETALA2/ ETHYLENE RESPONSE ELEMENT BINDING PROTEIN (AtAP2/EREBP) transcription factor as major hubs. These transcriptional activators were highly connected to LEA genes. Longevity genes were highly connected to two MtAP2/EREBP and two basic leucine zipper transcription factors. A heat shock factor was found at the transition of DT and longevity modules, connecting to both gene sets. Gain- and loss-of-function approaches of MtABI3 confirmed 80% of its predicted targets, thereby experimentally validating the network. This study captures the coordinated regulation of seed maturation and identifies distinct regulatory networks underlying the preparation for the dry and quiescent states. PMID:23929721
Performance of various branch-point tolerant phase reconstructors with finite time delays and measurement noise

NASA Astrophysics Data System (ADS)

Zetterlind, Virgil E., III; Magee, Eric P.

2002-06-01

This study extends branch point tolerant phase reconstructor research to examine the effect of finite time delays and measurement error on system performance. Branch point tolerant phase reconstruction is particularly applicable to atmospheric laser weapon and communication systems, which operate in extended turbulence. We examine the relative performance of a least squares reconstructor, least squares plus hidden phase reconstructor, and a Goldstein branch point reconstructor for various correction time-delays and measurement noise scenarios. Performance is evaluated using a wave-optics simulation that models a 100km atmospheric propagation of a point source beacon to a transmit/receive aperture. Phase-only corrections are then calculated using the various reconstructor algorithms and applied to an outgoing uniform field. Point Strehl is used as the performance metric. Results indicate that while time delays and measurement noise reduce the performance of branch point tolerant reconstructors, these reconstructors can still outperform least squares implementations in many cases. We also show that branch point detection becomes the limiting factor in measurement noise corrupted scenarios.
A Parameter Communication Optimization Strategy for Distributed Machine Learning in Sensors.

PubMed

Zhang, Jilin; Tu, Hangdi; Ren, Yongjian; Wan, Jian; Zhou, Li; Li, Mingwei; Wang, Jue; Yu, Lifeng; Zhao, Chang; Zhang, Lei

2017-09-21

In order to utilize the distributed characteristic of sensors, distributed machine learning has become the mainstream approach, but the different computing capability of sensors and network delays greatly influence the accuracy and the convergence rate of the machine learning model. Our paper describes a reasonable parameter communication optimization strategy to balance the training overhead and the communication overhead. We extend the fault tolerance of iterative-convergent machine learning algorithms and propose the Dynamic Finite Fault Tolerance (DFFT). Based on the DFFT, we implement a parameter communication optimization strategy for distributed machine learning, named Dynamic Synchronous Parallel Strategy (DSP), which uses the performance monitoring model to dynamically adjust the parameter synchronization strategy between worker nodes and the Parameter Server (PS). This strategy makes full use of the computing power of each sensor, ensures the accuracy of the machine learning model, and avoids the situation that the model training is disturbed by any tasks unrelated to the sensors.
Insensitivity of synchronization to network structure in chaotic pendulum systems with time-delay coupling.

PubMed

Yao, Chenggui; Zhan, Meng; Shuai, Jianwei; Ma, Jun; Kurths, Jürgen

2017-12-01

It has been generally believed that both time delay and network structure could play a crucial role in determining collective dynamical behaviors in complex systems. In this work, we study the influence of coupling strength, time delay, and network topology on synchronization behavior in delay-coupled networks of chaotic pendulums. Interestingly, we find that the threshold value of the coupling strength for complete synchronization in such networks strongly depends on the time delay in the coupling, but appears to be insensitive to the network structure. This lack of sensitivity was numerically tested in several typical regular networks, such as different locally and globally coupled ones as well as in several complex networks, such as small-world and scale-free networks. Furthermore, we find that the emergence of a synchronous periodic state induced by time delay is of key importance for the complete synchronization.
Simulation Modeling and Performance Evaluation of Space Networks

NASA Technical Reports Server (NTRS)

Jennings, Esther H.; Segui, John

2006-01-01

In space exploration missions, the coordinated use of spacecraft as communication relays increases the efficiency of the endeavors. To conduct trade-off studies of the performance and resource usage of different communication protocols and network designs, JPL designed a comprehensive extendable tool, the Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE). The design and development of MACHETE began in 2000 and is constantly evolving. Currently, MACHETE contains Consultative Committee for Space Data Systems (CCSDS) protocol standards such as Proximity-1, Advanced Orbiting Systems (AOS), Packet Telemetry/Telecommand, Space Communications Protocol Specification (SCPS), and the CCSDS File Delivery Protocol (CFDP). MACHETE uses the Aerospace Corporation s Satellite Orbital Analysis Program (SOAP) to generate the orbital geometry information and contact opportunities. Matlab scripts provide the link characteristics. At the core of MACHETE is a discrete event simulator, QualNet. Delay Tolerant Networking (DTN) is an end-to-end architecture providing communication in and/or through highly stressed networking environments. Stressed networking environments include those with intermittent connectivity, large and/or variable delays, and high bit error rates. To provide its services, the DTN protocols reside at the application layer of the constituent internets, forming a store-and-forward overlay network. The key capabilities of the bundling protocols include custody-based reliability, ability to cope with intermittent connectivity, ability to take advantage of scheduled and opportunistic connectivity, and late binding of names to addresses. In this presentation, we report on the addition of MACHETE models needed to support DTN, namely: the Bundle Protocol (BP) model. To illustrate the use of MACHETE with the additional DTN model, we provide an example simulation to benchmark its performance. We demonstrate the use of the DTN protocol and discuss statistics gathered concerning the total time needed to simulate numerous bundle transmissions

Anti-synchronization control of BAM memristive neural networks with multiple proportional delays and stochastic perturbations

NASA Astrophysics Data System (ADS)

Wang, Weiping; Yuan, Manman; Luo, Xiong; Liu, Linlin; Zhang, Yao

2018-01-01

Proportional delay is a class of unbounded time-varying delay. A class of bidirectional associative memory (BAM) memristive neural networks with multiple proportional delays is concerned in this paper. First, we propose the model of BAM memristive neural networks with multiple proportional delays and stochastic perturbations. Furthermore, by choosing suitable nonlinear variable transformations, the BAM memristive neural networks with multiple proportional delays can be transformed into the BAM memristive neural networks with constant delays. Based on the drive-response system concept, differential inclusions theory and Lyapunov stability theory, some anti-synchronization criteria are obtained. Finally, the effectiveness of proposed criteria are demonstrated through numerical examples.
Firing patterns transition and desynchronization induced by time delay in neural networks

NASA Astrophysics Data System (ADS)

Huang, Shoufang; Zhang, Jiqian; Wang, Maosheng; Hu, Chin-Kun

2018-06-01

We used the Hindmarsh-Rose (HR) model (Hindmarsh and Rose, 1984) to study the effect of time delay on the transition of firing behaviors and desynchronization in neural networks. As time delay is increased, neural networks exhibit diversity of firing behaviors, including regular spiking or bursting and firing patterns transitions (FPTs). Meanwhile, the desynchronization of firing and unstable bursting with decreasing amplitude in neural system, are also increasingly enhanced with the increase of time delay. Furthermore, we also studied the effect of coupling strength and network randomness on these phenomena. Our results imply that time delays can induce transition and desynchronization of firing behaviors in neural networks. These findings provide new insight into the role of time delay in the firing activities of neural networks, and can help to better understand the firing phenomena in complex systems of neural networks. A possible mechanism in brain that can cause the increase of time delay is discussed.
A Multi-Technology Communication Platform for Urban Mobile Sensing.

PubMed

Almeida, Rodrigo; Oliveira, Rui; Luís, Miguel; Senna, Carlos; Sargento, Susana

2018-04-12

A common concern in smart cities is the focus on sensing procedures to provide city-wide information to city managers and citizens. To meet the growing demands of smart cities, the network must provide the ability to handle a large number of mobile sensors/devices, with high heterogeneity and unpredictable mobility, by collecting and delivering the sensed information for future treatment. This work proposes a multi-wireless technology communication platform for opportunistic data gathering and data exchange with respect to smart cities. Through the implementation of a proprietary long-range (LoRa) network and an urban sensor network, our platform addresses the heterogeneity of Internet of Things (IoT) devices while conferring communications in an opportunistic manner, increasing the interoperability of our platform. It implements and evaluates a medium access communication (MAC) protocol for LoRa networks with multiple gateways. It also implements mobile Opportunistic VEhicular (mOVE), a delay-tolerant network (DTN)-based architecture to address the mobility dimension. The platform provides vehicle-to-everything (V2X) communication with support for highly reliable and actionable information flows. Moreover, taking into account the high mobility pattern that a smart city scenario presents, we propose and evaluate two forwarding strategies for the opportunistic sensor network.
Discrete-time BAM neural networks with variable delays

NASA Astrophysics Data System (ADS)

Liu, Xin-Ge; Tang, Mei-Lan; Martin, Ralph; Liu, Xin-Bi

2007-07-01

This Letter deals with the global exponential stability of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Using a Lyapunov functional, and linear matrix inequality techniques (LMI), we derive a new delay-dependent exponential stability criterion for BAM neural networks with variable delays. As this criterion has no extra constraints on the variable delay functions, it can be applied to quite general BAM neural networks with a broad range of time delay functions. It is also easy to use in practice. An example is provided to illustrate the theoretical development.
Robust outer synchronization between two nonlinear complex networks with parametric disturbances and mixed time-varying delays

NASA Astrophysics Data System (ADS)

Zhang, Chuan; Wang, Xingyuan; Luo, Chao; Li, Junqiu; Wang, Chunpeng

2018-03-01

In this paper, we focus on the robust outer synchronization problem between two nonlinear complex networks with parametric disturbances and mixed time-varying delays. Firstly, a general complex network model is proposed. Besides the nonlinear couplings, the network model in this paper can possess parametric disturbances, internal time-varying delay, discrete time-varying delay and distributed time-varying delay. Then, according to the robust control strategy, linear matrix inequality and Lyapunov stability theory, several outer synchronization protocols are strictly derived. Simple linear matrix controllers are designed to driver the response network synchronize to the drive network. Additionally, our results can be applied on the complex networks without parametric disturbances. Finally, by utilizing the delayed Lorenz chaotic system as the dynamics of all nodes, simulation examples are given to demonstrate the effectiveness of our theoretical results.
Error and attack tolerance of complex networks

NASA Astrophysics Data System (ADS)

Albert, Réka; Jeong, Hawoong; Barabási, Albert-László

2000-07-01

Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network. Complex communication networks display a surprising degree of robustness: although key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these and other complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. Here we demonstrate that error tolerance is not shared by all redundant systems: it is displayed only by a class of inhomogeneously wired networks, called scale-free networks, which include the World-Wide Web, the Internet, social networks and cells. We find that such networks display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates. However, error tolerance comes at a high price in that these networks are extremely vulnerable to attacks (that is, to the selection and removal of a few nodes that play a vital role in maintaining the network's connectivity). Such error tolerance and attack vulnerability are generic properties of communication networks.
Simulation analysis of the effect of initial delay on flight delay diffusion

NASA Astrophysics Data System (ADS)

Que, Zufu; Yao, Hongguang; Yue, Wei

2018-01-01

The initial delay of the flight is an important factor affecting the spread of flight delays, so clarifying their relationship conduces to control flight delays in the aeronautical network. Through establishing a model of the chain aviation network and making simulation analysis of the effects of initial delay on the delay longitudinal diffusion, it’s found that the number of delayed airports in the air network, the total delay time and the average delay time of the delayed airport are generally positively correlated with the initial delay. This indicates that the occurrence of the initial delay should be avoided or reduced as much as possible to improve the punctuality of the flight.
Global cluster synchronization in nonlinearly coupled community networks with heterogeneous coupling delays.

PubMed

Tseng, Jui-Pin

2017-02-01

This investigation establishes the global cluster synchronization of complex networks with a community structure based on an iterative approach. The units comprising the network are described by differential equations, and can be non-autonomous and involve time delays. In addition, units in the different communities can be governed by different equations. The coupling configuration of the network is rather general. The coupling terms can be non-diffusive, nonlinear, asymmetric, and with heterogeneous coupling delays. Based on this approach, both delay-dependent and delay-independent criteria for global cluster synchronization are derived. We implement the present approach for a nonlinearly coupled neural network with heterogeneous coupling delays. Two numerical examples are given to show that neural networks can behave in a variety of new collective ways under the synchronization criteria. These examples also demonstrate that neural networks remain synchronized in spite of coupling delays between neurons across different communities; however, they may lose synchrony if the coupling delays between the neurons within the same community are too large, such that the synchronization criteria are violated. Copyright © 2016 Elsevier Ltd. All rights reserved.
Sonic hedgehog signaling in spinal cord contributes to morphine-induced hyperalgesia and tolerance through upregulating brain-derived neurotrophic factor expression

PubMed Central

Song, Zhi-Jing; Miao, Shuai; Zhao, Ye; Wang, Xiu-Li; Liu, Yue-Peng

2018-01-01

Purpose Preventing opioid-induced hyperalgesia and tolerance continues to be a major clinical challenge, and the underlying mechanisms of hyperalgesia and tolerance remain elusive. Here, we investigated the role of sonic hedgehog (Shh) signaling in opioid-induced hyperalgesia and tolerance. Methods Shh signaling expression, behavioral changes, and neurochemical alterations induced by morphine were analyzed in male adult CD-1 mice with repeated administration of morphine. To investigate the contribution of Shh to morphine-induced hyperalgesia (MIH) and tolerance, Shh signaling inhibitor cyclopamine and Shh small interfering RNA (siRNA) were used. To explore the mechanisms of Shh signaling in MIH and tolerance, brain-derived neurotrophic factor (BDNF) inhibitor K252 and anti-BDNF antibody were used. Results Repeated administration of morphine produced obvious hyperalgesia and tolerance. The behavioral changes were correlated with the upregulation and activation of morphine treatment-induced Shh signaling. Pharmacologic and genetic inhibition of Shh signaling significantly delayed the generation of MIH and tolerance and associated neurochemical changes. Chronic morphine administration also induced upregulation of BDNF. Inhibiting BDNF effectively delayed the generation of MIH and tolerance. The upregulation of BDNF induced by morphine was significantly suppressed by inhibiting Shh signaling. In naïve mice, exogenous activation of Shh signaling caused a rapid increase of BDNF expression, as well as thermal hyperalgesia. Inhibiting BDNF significantly suppressed smoothened agonist-induced hyperalgesia. Conclusion These findings suggest that Shh signaling may be a critical mediator for MIH and tolerance by regulating BDNF expression. Inhibiting Shh signaling, especially during the early phase, may effectively delay or suppress MIH and tolerance. PMID:29662325
Optimizing the MAC Protocol in Localization Systems Based on IEEE 802.15.4 Networks

PubMed Central

Claver, Jose M.; Ezpeleta, Santiago

2017-01-01

Radio frequency signals are commonly used in the development of indoor localization systems. The infrastructure of these systems includes some beacons placed at known positions that exchange radio packets with users to be located. When the system is implemented using wireless sensor networks, the wireless transceivers integrated in the network motes are usually based on the IEEE 802.15.4 standard. But, the CSMA-CA, which is the basis for the medium access protocols in this category of communication systems, is not suitable when several users want to exchange bursts of radio packets with the same beacon to acquire the radio signal strength indicator (RSSI) values needed in the location process. Therefore, new protocols are necessary to avoid the packet collisions that appear when multiple users try to communicate with the same beacons. On the other hand, the RSSI sampling process should be carried out very quickly because some systems cannot tolerate a large delay in the location process. This is even more important when the RSSI sampling process includes measures with different signal power levels or frequency channels. The principal objective of this work is to speed up the RSSI sampling process in indoor localization systems. To achieve this objective, the main contribution is the proposal of a new MAC protocol that eliminates the medium access contention periods and decreases the number of packet collisions to accelerate the RSSI collection process. Moreover, the protocol increases the overall network throughput taking advantage of the frequency channel diversity. The presented results show the suitability of this protocol for reducing the RSSI gathering delay and increasing the network throughput in simulated and real environments. PMID:28684666
Optimizing the MAC Protocol in Localization Systems Based on IEEE 802.15.4 Networks.

PubMed

Pérez-Solano, Juan J; Claver, Jose M; Ezpeleta, Santiago

2017-07-06

Radio frequency signals are commonly used in the development of indoor localization systems. The infrastructure of these systems includes some beacons placed at known positions that exchange radio packets with users to be located. When the system is implemented using wireless sensor networks, the wireless transceivers integrated in the network motes are usually based on the IEEE 802.15.4 standard. But, the CSMA-CA, which is the basis for the medium access protocols in this category of communication systems, is not suitable when several users want to exchange bursts of radio packets with the same beacon to acquire the radio signal strength indicator (RSSI) values needed in the location process. Therefore, new protocols are necessary to avoid the packet collisions that appear when multiple users try to communicate with the same beacons. On the other hand, the RSSI sampling process should be carried out very quickly because some systems cannot tolerate a large delay in the location process. This is even more important when the RSSI sampling process includes measures with different signal power levels or frequency channels. The principal objective of this work is to speed up the RSSI sampling process in indoor localization systems. To achieve this objective, the main contribution is the proposal of a new MAC protocol that eliminates the medium access contention periods and decreases the number of packet collisions to accelerate the RSSI collection process. Moreover, the protocol increases the overall network throughput taking advantage of the frequency channel diversity. The presented results show the suitability of this protocol for reducing the RSSI gathering delay and increasing the network throughput in simulated and real environments.
Trust-Threshold Based Routing in Mobile Ad Hoc Delay Tolerant Networks

DTIC Science & Technology

2011-02-15

A £) I e- A "flt x rj(t), ifm *jand\\Ri\\=0 (4) if m * j and\\R{\\ > 0 The indirect trust evaluation toward nodej is given in Equation 4 above...Pfn. Pfp 1% U 300 5 (5 min) (In [l,4] m / s a 90% toh 0.8:0.2 E„ [12. 24] hrs ’ A ’* m [160.480| mm TlDS iOOs 5.1 Optimal Trust Thresholds for...Evaluation t-r, encounter.X(t . A ,\\ ;r„, _ i Tim (t+At), tfm-j e-^’xrj(t), ifm +l W The direct trust evaluation of nodey is given in
Effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks.

PubMed

Sun, Xiaojuan; Perc, Matjaž; Kurths, Jürgen

2017-05-01

In this paper, we study effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks. Our focus is on the impact of two parameters, namely the time delay τ and the probability of partial time delay p delay , whereby the latter determines the probability with which a connection between two neurons is delayed. Our research reveals that partial time delays significantly affect phase synchronization in this system. In particular, partial time delays can either enhance or decrease phase synchronization and induce synchronization transitions with changes in the mean firing rate of neurons, as well as induce switching between synchronized neurons with period-1 firing to synchronized neurons with period-2 firing. Moreover, in comparison to a neuronal network where all connections are delayed, we show that small partial time delay probabilities have especially different influences on phase synchronization of neuronal networks.
Impact of Partial Time Delay on Temporal Dynamics of Watts-Strogatz Small-World Neuronal Networks

NASA Astrophysics Data System (ADS)

Yan, Hao; Sun, Xiaojuan

2017-06-01

In this paper, we mainly discuss effects of partial time delay on temporal dynamics of Watts-Strogatz (WS) small-world neuronal networks by controlling two parameters. One is the time delay τ and the other is the probability of partial time delay pdelay. Temporal dynamics of WS small-world neuronal networks are discussed with the aid of temporal coherence and mean firing rate. With the obtained simulation results, it is revealed that for small time delay τ, the probability pdelay could weaken temporal coherence and increase mean firing rate of neuronal networks, which indicates that it could improve neuronal firings of the neuronal networks while destroying firing regularity. For large time delay τ, temporal coherence and mean firing rate do not have great changes with respect to pdelay. Time delay τ always has great influence on both temporal coherence and mean firing rate no matter what is the value of pdelay. Moreover, with the analysis of spike trains and histograms of interspike intervals of neurons inside neuronal networks, it is found that the effects of partial time delays on temporal coherence and mean firing rate could be the result of locking between the period of neuronal firing activities and the value of time delay τ. In brief, partial time delay could have great influence on temporal dynamics of the neuronal networks.
Bifurcation behaviors of synchronized regions in logistic map networks with coupling delay

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

Tang, Longkun, E-mail: tomlk@hqu.edu.cn, E-mail: xqwu@whu.edu.cn; Wu, Xiaoqun, E-mail: tomlk@hqu.edu.cn, E-mail: xqwu@whu.edu.cn; Lu, Jun-an, E-mail: jalu@whu.edu.cn

2015-03-15

Network synchronized regions play an extremely important role in network synchronization according to the master stability function framework. This paper focuses on network synchronous state stability via studying the effects of nodal dynamics, coupling delay, and coupling way on synchronized regions in Logistic map networks. Theoretical and numerical investigations show that (1) network synchronization is closely associated with its nodal dynamics. Particularly, the synchronized region bifurcation points through which the synchronized region switches from one type to another are in good agreement with those of the uncoupled node system, and chaotic nodal dynamics can greatly impede network synchronization. (2) Themore » coupling delay generally impairs the synchronizability of Logistic map networks, which is also dominated by the parity of delay for some nodal parameters. (3) A simple nonlinear coupling facilitates network synchronization more than the linear one does. The results found in this paper will help to intensify our understanding for the synchronous state stability in discrete-time networks with coupling delay.« less
Effects of time delays on stability and Hopf bifurcation in a fractional ring-structured network with arbitrary neurons

NASA Astrophysics Data System (ADS)

Huang, Chengdai; Cao, Jinde; Xiao, Min; Alsaedi, Ahmed; Hayat, Tasawar

2018-04-01

This paper is comprehensively concerned with the dynamics of a class of high-dimension fractional ring-structured neural networks with multiple time delays. Based on the associated characteristic equation, the sum of time delays is regarded as the bifurcation parameter, and some explicit conditions for describing delay-dependent stability and emergence of Hopf bifurcation of such networks are derived. It reveals that the stability and bifurcation heavily relies on the sum of time delays for the proposed networks, and the stability performance of such networks can be markedly improved by selecting carefully the sum of time delays. Moreover, it is further displayed that both the order and the number of neurons can extremely influence the stability and bifurcation of such networks. The obtained criteria enormously generalize and improve the existing work. Finally, numerical examples are presented to verify the efficiency of the theoretical results.
Synchronization of Switched Neural Networks With Communication Delays via the Event-Triggered Control.

PubMed

Wen, Shiping; Zeng, Zhigang; Chen, Michael Z Q; Huang, Tingwen

2017-10-01

This paper addresses the issue of synchronization of switched delayed neural networks with communication delays via event-triggered control. For synchronizing coupled switched neural networks, we propose a novel event-triggered control law which could greatly reduce the number of control updates for synchronization tasks of coupled switched neural networks involving embedded microprocessors with limited on-board resources. The control signals are driven by properly defined events, which depend on the measurement errors and current-sampled states. By using a delay system method, a novel model of synchronization error system with delays is proposed with the communication delays and event-triggered control in the unified framework for coupled switched neural networks. The criteria are derived for the event-triggered synchronization analysis and control synthesis of switched neural networks via the Lyapunov-Krasovskii functional method and free weighting matrix approach. A numerical example is elaborated on to illustrate the effectiveness of the derived results.
Modeling delay in genetic networks: From delay birth-death processes to delay stochastic differential equations

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

Gupta, Chinmaya; López, José Manuel; Azencott, Robert

Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemicalmore » Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.« less
Economic networks: Heterogeneity-induced vulnerability and loss of synchronization

NASA Astrophysics Data System (ADS)

Colon, Célian; Ghil, Michael

2017-12-01

Interconnected systems are prone to propagation of disturbances, which can undermine their resilience to external perturbations. Propagation dynamics can clearly be affected by potential time delays in the underlying processes. We investigate how such delays influence the resilience of production networks facing disruption of supply. Interdependencies between economic agents are modeled using systems of Boolean delay equations (BDEs); doing so allows us to introduce heterogeneity in production delays and in inventories. Complex network topologies are considered that reproduce realistic economic features, including a network of networks. Perturbations that would otherwise vanish can, because of delay heterogeneity, amplify and lead to permanent disruptions. This phenomenon is enabled by the interactions between short cyclic structures. Difference in delays between two interacting, and otherwise resilient, structures can in turn lead to loss of synchronization in damage propagation and thus prevent recovery. Finally, this study also shows that BDEs on complex networks can lead to metastable relaxation oscillations, which are damped out in one part of a network while moving on to another part.
Effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks

NASA Astrophysics Data System (ADS)

Sun, Xiaojuan; Perc, Matjaž; Kurths, Jürgen

2017-05-01

In this paper, we study effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks. Our focus is on the impact of two parameters, namely the time delay τ and the probability of partial time delay pdelay, whereby the latter determines the probability with which a connection between two neurons is delayed. Our research reveals that partial time delays significantly affect phase synchronization in this system. In particular, partial time delays can either enhance or decrease phase synchronization and induce synchronization transitions with changes in the mean firing rate of neurons, as well as induce switching between synchronized neurons with period-1 firing to synchronized neurons with period-2 firing. Moreover, in comparison to a neuronal network where all connections are delayed, we show that small partial time delay probabilities have especially different influences on phase synchronization of neuronal networks.

On Delay and Security in Network Coding

ERIC Educational Resources Information Center

Dikaliotis, Theodoros K.

2013-01-01

In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are routing with hop-by-hop retransmissions, where every node in the network simply stores and…
Stability analysis of fractional-order Hopfield neural networks with time delays.

PubMed

Wang, Hu; Yu, Yongguang; Wen, Guoguang

2014-07-01

This paper investigates the stability for fractional-order Hopfield neural networks with time delays. Firstly, the fractional-order Hopfield neural networks with hub structure and time delays are studied. Some sufficient conditions for stability of the systems are obtained. Next, two fractional-order Hopfield neural networks with different ring structures and time delays are developed. By studying the developed neural networks, the corresponding sufficient conditions for stability of the systems are also derived. It is shown that the stability conditions are independent of time delays. Finally, numerical simulations are given to illustrate the effectiveness of the theoretical results obtained in this paper. Copyright © 2014 Elsevier Ltd. All rights reserved.
Virtualized MME Design for IoT Support in 5G Systems.

PubMed

Andres-Maldonado, Pilar; Ameigeiras, Pablo; Prados-Garzon, Jonathan; Ramos-Munoz, Juan Jose; Lopez-Soler, Juan Manuel

2016-08-22

Cellular systems are recently being considered an option to provide support to the Internet of Things (IoT). To enable this support, the 3rd Generation Partnership Project (3GPP) has introduced new procedures specifically targeted for cellular IoT. With one of these procedures, the transmissions of small and infrequent data packets from/to the devices are encapsulated in signaling messages and sent through the control plane. However, these transmissions from/to a massive number of devices may imply a major increase of the processing load on the control plane entities of the network and in particular on the Mobility Management Entity (MME). In this paper, we propose two designs of an MME based on Network Function Virtualization (NFV) that aim at facilitating the IoT support. The first proposed design partially separates the processing resources dedicated to each traffic class. The second design includes traffic shaping to control the traffic of each class. We consider three classes: Mobile Broadband (MBB), low latency Machine to Machine communications (lM2M) and delay-tolerant M2M communications. Our proposals enable reducing the processing resources and, therefore, the cost. Additionally, results show that the proposed designs lessen the impact between classes, so they ease the compliance of the delay requirements of MBB and lM2M communications.
Modeling of synchronization behavior of bursting neurons at nonlinearly coupled dynamical networks.

PubMed

Çakir, Yüksel

2016-01-01

Synchronization behaviors of bursting neurons coupled through electrical and dynamic chemical synapses are investigated. The Izhikevich model is used with random and small world network of bursting neurons. Various currents which consist of diffusive electrical and time-delayed dynamic chemical synapses are used in the simulations to investigate the influences of synaptic currents and couplings on synchronization behavior of bursting neurons. The effects of parameters, such as time delay, inhibitory synaptic strengths, and decay time on synchronization behavior are investigated. It is observed that in random networks with no delay, bursting synchrony is established with the electrical synapse alone, single spiking synchrony is observed with hybrid coupling. In small world network with no delay, periodic bursting behavior with multiple spikes is observed when only chemical and only electrical synapse exist. Single-spike and multiple-spike bursting are established with hybrid couplings. A decrease in the synchronization measure is observed with zero time delay, as the decay time is increased in random network. For synaptic delays which are above active phase period, synchronization measure increases with an increase in synaptic strength and time delay in small world network. However, in random network, it increases with only an increase in synaptic strength.
A Multi-Technology Communication Platform for Urban Mobile Sensing

PubMed Central

Almeida, Rodrigo; Oliveira, Rui

2018-01-01

A common concern in smart cities is the focus on sensing procedures to provide city-wide information to city managers and citizens. To meet the growing demands of smart cities, the network must provide the ability to handle a large number of mobile sensors/devices, with high heterogeneity and unpredictable mobility, by collecting and delivering the sensed information for future treatment. This work proposes a multi-wireless technology communication platform for opportunistic data gathering and data exchange with respect to smart cities. Through the implementation of a proprietary long-range (LoRa) network and an urban sensor network, our platform addresses the heterogeneity of Internet of Things (IoT) devices while conferring communications in an opportunistic manner, increasing the interoperability of our platform. It implements and evaluates a medium access communication (MAC) protocol for LoRa networks with multiple gateways. It also implements mobile Opportunistic VEhicular (mOVE), a delay-tolerant network (DTN)-based architecture to address the mobility dimension. The platform provides vehicle-to-everything (V2X) communication with support for highly reliable and actionable information flows. Moreover, taking into account the high mobility pattern that a smart city scenario presents, we propose and evaluate two forwarding strategies for the opportunistic sensor network. PMID:29649175
A Parameter Communication Optimization Strategy for Distributed Machine Learning in Sensors

PubMed Central

Zhang, Jilin; Tu, Hangdi; Ren, Yongjian; Wan, Jian; Zhou, Li; Li, Mingwei; Wang, Jue; Yu, Lifeng; Zhao, Chang; Zhang, Lei

2017-01-01

In order to utilize the distributed characteristic of sensors, distributed machine learning has become the mainstream approach, but the different computing capability of sensors and network delays greatly influence the accuracy and the convergence rate of the machine learning model. Our paper describes a reasonable parameter communication optimization strategy to balance the training overhead and the communication overhead. We extend the fault tolerance of iterative-convergent machine learning algorithms and propose the Dynamic Finite Fault Tolerance (DFFT). Based on the DFFT, we implement a parameter communication optimization strategy for distributed machine learning, named Dynamic Synchronous Parallel Strategy (DSP), which uses the performance monitoring model to dynamically adjust the parameter synchronization strategy between worker nodes and the Parameter Server (PS). This strategy makes full use of the computing power of each sensor, ensures the accuracy of the machine learning model, and avoids the situation that the model training is disturbed by any tasks unrelated to the sensors. PMID:28934163
Transparent Ada rendezvous in a fault tolerant distributed system

NASA Technical Reports Server (NTRS)

Racine, Roger

1986-01-01

There are many problems associated with distributing an Ada program over a loosely coupled communication network. Some of these problems involve the various aspects of the distributed rendezvous. The problems addressed involve supporting the delay statement in a selective call and supporting the else clause in a selective call. Most of these difficulties are compounded by the need for an efficient communication system. The difficulties are compounded even more by considering the possibility of hardware faults occurring while the program is running. With a hardware fault tolerant computer system, it is possible to design a distribution scheme and communication software which is efficient and allows Ada semantics to be preserved. An Ada design for the communications software of one such system will be presented, including a description of the services provided in the seven layers of an International Standards Organization (ISO) Open System Interconnect (OSI) model communications system. The system capabilities (hardware and software) that allow this communication system will also be described.
Data analysis of a dense GPS network operated during the ESCOMPTE campaign: first results

NASA Astrophysics Data System (ADS)

Walpersdorf, A.; Bock, O.; Doerflinger, E.; Masson, F.; van Baelen, J.; Somieski, A.; Bürki, B.

The experiment GPS/H 2O involving 17 GPS receivers has been operated for two weeks in June 2001 in a dense network around Marseille. This project was integrated into the ESCOMPTE campaign. This paper will focus on the GPS analysis in preparation of the tomographic inversion of GPS slant delays. As first results, GPS tropospheric parameters zenith delays and horizontal gradients have been extracted. For a first visualization of the humidity field overlying the network, zenith delays have been transformed into precipitable water. Successive humidity fields are presented for a period of sudden drop in humidity, indicating some spatial resolution in the small network. The time series of horizontal gradients evaluated at individual sites are compared to correlated zenith delay variations over the whole network (horizontal gradient of zenith delays), showing that in the small size network horizontal atmospheric structure is reflected by both types of parameters. To compare these two quantities, scaling of zenith delays due to different station altitudes was necessary. In this way, a GPS internal validation of the individual gradients by comparison with the horizontal gradient of zenith delays has been established. Differential features along transects across the network indicate a good spatial resolution of tropospheric phenomena, encouraging for the further tomographic exploitation of the data. Moreover, individual and zenith delay gradients weight differently atmospheric horizontal gradients occurring at different heights. This different sensitivity has been used for a first identification of a vertical atmospheric structure from GPS tropospheric delays, by observing an inclined frontal zone crossing the network.
Global exponential stability of inertial memristor-based neural networks with time-varying delays and impulses.

PubMed

Zhang, Wei; Huang, Tingwen; He, Xing; Li, Chuandong

2017-11-01

In this study, we investigate the global exponential stability of inertial memristor-based neural networks with impulses and time-varying delays. We construct inertial memristor-based neural networks based on the characteristics of the inertial neural networks and memristor. Impulses with and without delays are considered when modeling the inertial neural networks simultaneously, which are of great practical significance in the current study. Some sufficient conditions are derived under the framework of the Lyapunov stability method, as well as an extended Halanay differential inequality and a new delay impulsive differential inequality, which depend on impulses with and without delays, in order to guarantee the global exponential stability of the inertial memristor-based neural networks. Finally, two numerical examples are provided to illustrate the efficiency of the proposed methods. Copyright © 2017 Elsevier Ltd. All rights reserved.
Introduction

NASA Astrophysics Data System (ADS)

de Laat, Cees; Develder, Chris; Jukan, Admela; Mambretti, Joe

This topic is devoted to communication issues in scalable compute and storage systems, such as parallel computers, networks of workstations, and clusters. All aspects of communication in modern systems were solicited, including advances in the design, implementation, and evaluation of interconnection networks, network interfaces, system and storage area networks, on-chip interconnects, communication protocols, routing and communication algorithms, and communication aspects of parallel and distributed algorithms. In total 15 papers were submitted to this topic of which we selected the 7 strongest papers. We grouped the papers in two sessions of 3 papers each and one paper was selected for the best paper session. We noted a number of papers dealing with changing topologies, stability and forwarding convergence in source routing based cluster interconnect network architectures. We grouped these for the first session. The authors of the paper titled: “Implementing a Change Assimilation Mechanism for Source Routing Interconnects” propose a mechanism that can obtain the new topology, and compute and distribute a new set of fabric paths to the source routed network end points to minimize the impact on the forwarding service. The article entitled “Dependability Analysis of a Fault-tolerant Network Reconfiguration Strateg” reports on a case study analyzing the effects of network size, mean time to node failure, mean time to node repair, mean time to network repair and coverage of the failure when using a 2D mesh network with a fault-tolerant mechanism (similar to the one used in the BlueGene/L system), that is able to remove rows and/or columns in the presence of failures. The last paper in this session: “RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration” presents a new dynamic reconfiguration method, that ensures deadlock-freedom during the reconfiguration without causing performance degradation such as increased latency or decreased throughput. The second session groups 3 papers presenting methods, protocols and architectures that enhance capacities in the Networks. The paper titled: “NIC-assisted Cache-Efficient Receive Stack for Message Passing over Ethernet” presents the addition of multiqueue support in the Open-MX receive stack so that all incoming packets for the same process are treated on the same core. It then introduces the idea of binding the target end process near its dedicated receive queue. In general this multiqueue receive stack performs better than the original single queue stack, especially on large communication patterns where multiple processes are involved and manual binding is difficult. The authors of: “A Multipath Fault-Tolerant Routing Method for High-Speed Interconnection Networks” focus on the problem of fault tolerance for high-speed interconnection networks by designing a fault tolerant routing method. The goal was to solve a certain number of link and node failures, considering its impact, and occurrence probability. Their experiments show that their method allows applications to successfully finalize their execution in the presence of several faults, with an average performance value of 97% with respect to the fault-free scenarios. The paper: “Hardware implementation study of the Self-Clocked Fair Queuing Credit Aware (SCFQ-CA) and Deficit Round Robin Credit Aware (DRR-CA) scheduling algorithms” proposes specific implementations of the two schedulers taking into account the characteristics of current high-performance networks. A comparison is presented on the complexity of these two algorithms in terms of silicon area and computation delay. Finally we selected one paper for the special paper session: “A Case Study of Communication Optimizations on 3D Mesh Interconnects”. In this paper the authors present topology aware mapping as a technique to optimize communication on 3-dimensional mesh interconnects and hence improve performance. Results are presented for OpenAtom on up to 16,384 processors of Blue Gene/L, 8,192 processors of Blue Gene/P and 2,048 processors of Cray XT3.
Delay-aware adaptive sleep mechanism for green wireless-optical broadband access networks

NASA Astrophysics Data System (ADS)

Wang, Ruyan; Liang, Alei; Wu, Dapeng; Wu, Dalei

2017-07-01

Wireless-Optical Broadband Access Network (WOBAN) is capacity-high, reliable, flexible, and ubiquitous, as it takes full advantage of the merits from both optical communication and wireless communication technologies. Similar to other access networks, the high energy consumption poses a great challenge for building up WOBANs. To shot this problem, we can make some load-light Optical Network Units (ONUs) sleep to reduce the energy consumption. Such operation, however, causes the increased packet delay. Jointly considering the energy consumption and transmission delay, we propose a delay-aware adaptive sleep mechanism. Specifically, we develop a new analytical method to evaluate the transmission delay and queuing delay over the optical part, instead of adopting M/M/1 queuing model. Meanwhile, we also analyze the access delay and queuing delay of the wireless part. Based on such developed delay models, we mathematically derive ONU's optimal sleep time. In addition, we provide numerous simulation results to show the effectiveness of the proposed mechanism.
Synchronization in a chaotic neural network with time delay depending on the spatial distance between neurons

NASA Astrophysics Data System (ADS)

Tang, Guoning; Xu, Kesheng; Jiang, Luoluo

2011-10-01

The synchronization is investigated in a two-dimensional Hindmarsh-Rose neuronal network by introducing a global coupling scheme with time delay, where the length of time delay is proportional to the spatial distance between neurons. We find that the time delay always disturbs synchronization of the neuronal network. When both the coupling strength and length of time delay per unit distance (i.e., enlargement factor) are large enough, the time delay induces the abnormal membrane potential oscillations in neurons. Specifically, the abnormal membrane potential oscillations for the symmetrically placed neurons form an antiphase, so that the large coupling strength and enlargement factor lead to the desynchronization of the neuronal network. The complete and intermittently complete synchronization of the neuronal network are observed for the right choice of parameters. The physical mechanism underlying these phenomena is analyzed.
Delay Analysis and Optimization of Bandwidth Request under Unicast Polling in IEEE 802.16e over Gilbert-Elliot Error Channel

NASA Astrophysics Data System (ADS)

Hwang, Eunju; Kim, Kyung Jae; Roijers, Frank; Choi, Bong Dae

In the centralized polling mode in IEEE 802.16e, a base station (BS) polls mobile stations (MSs) for bandwidth reservation in one of three polling modes; unicast, multicast, or broadcast pollings. In unicast polling, the BS polls each individual MS to allow to transmit a bandwidth request packet. This paper presents an analytical model for the unicast polling of bandwidth request in IEEE 802.16e networks over Gilbert-Elliot error channel. We derive the probability distribution for the delay of bandwidth requests due to wireless transmission errors and find the loss probability of request packets due to finite retransmission attempts. By using the delay distribution and the loss probability, we optimize the number of polling slots within a frame and the maximum retransmission number while satisfying QoS on the total loss probability which combines two losses: packet loss due to the excess of maximum retransmission and delay outage loss due to the maximum tolerable delay bound. In addition, we obtain the utilization of polling slots, which is defined as the ratio of the number of polling slots used for the MS's successful transmission to the total number of polling slots used by the MS over a long run time. Analysis results are shown to well match with simulation results. Numerical results give examples of the optimal number of polling slots within a frame and the optimal maximum retransmission number depending on delay bounds, the number of MSs, and the channel conditions.
Exponential Synchronization of Networked Chaotic Delayed Neural Network by a Hybrid Event Trigger Scheme.

PubMed

Fei, Zhongyang; Guan, Chaoxu; Gao, Huijun; Zhongyang Fei; Chaoxu Guan; Huijun Gao; Fei, Zhongyang; Guan, Chaoxu; Gao, Huijun

2018-06-01

This paper is concerned with the exponential synchronization for master-slave chaotic delayed neural network with event trigger control scheme. The model is established on a network control framework, where both external disturbance and network-induced delay are taken into consideration. The desired aim is to synchronize the master and slave systems with limited communication capacity and network bandwidth. In order to save the network resource, we adopt a hybrid event trigger approach, which not only reduces the data package sending out, but also gets rid of the Zeno phenomenon. By using an appropriate Lyapunov functional, a sufficient criterion for the stability is proposed for the error system with extended ( , , )-dissipativity performance index. Moreover, hybrid event trigger scheme and controller are codesigned for network-based delayed neural network to guarantee the exponential synchronization between the master and slave systems. The effectiveness and potential of the proposed results are demonstrated through a numerical example.
Experiments with arbitrary networks in time-multiplexed delay systems

NASA Astrophysics Data System (ADS)

Hart, Joseph D.; Schmadel, Don C.; Murphy, Thomas E.; Roy, Rajarshi

2017-12-01

We report a new experimental approach using an optoelectronic feedback loop to investigate the dynamics of oscillators coupled on large complex networks with arbitrary topology. Our implementation is based on a single optoelectronic feedback loop with time delays. We use the space-time interpretation of systems with time delay to create large networks of coupled maps. Others have performed similar experiments using high-pass filters to implement the coupling; this restricts the network topology to the coupling of only a few nearest neighbors. In our experiment, the time delays and coupling are implemented on a field-programmable gate array, allowing the creation of networks with arbitrary coupling topology. This system has many advantages: the network nodes are truly identical, the network is easily reconfigurable, and the network dynamics occur at high speeds. We use this system to study cluster synchronization and chimera states in both small and large networks of different topologies.
Delay decomposition at a single server queue with constant service time and multiple inputs. [Waiting time on computer network

NASA Technical Reports Server (NTRS)

Ziegler, C.; Schilling, D. L.

1977-01-01

Two networks consisting of single server queues, each with a constant service time, are considered. The external inputs to each network are assumed to follow some general probability distribution. Several interesting equivalencies that exist between the two networks considered are derived. This leads to the introduction of an important concept in delay decomposition. It is shown that the waiting time experienced by a customer can be decomposed into two basic components called self delay and interference delay.
A novel unbalanced multiple description coder for robust video transmission over ad hoc wireless networks

NASA Astrophysics Data System (ADS)

Huang, Feng; Sun, Lifeng; Zhong, Yuzhuo

2006-01-01

Robust transmission of live video over ad hoc wireless networks presents new challenges: high bandwidth requirements are coupled with delay constraints; even a single packet loss causes error propagation until a complete video frame is coded in the intra-mode; ad hoc wireless networks suffer from bursty packet losses that drastically degrade the viewing experience. Accordingly, we propose a novel UMD coder capable of quickly recovering from losses and ensuring continuous playout. It uses 'peg' frames to prevent error propagation in the High-Resolution (HR) description and improve the robustness of key frames. The Low-Resolution (LR) coder works independent of the HR one, but they can also help each other recover from losses. Like many UMD coders, our UMD coder is drift-free, disruption-tolerant and able to make good use of the asymmetric available bandwidths of multiple paths. The simulation results under different conditions show that the proposed UMD coder has the highest decoded quality and lowest probability of pause when compared with concurrent UMDC techniques. The coder also has a comparable decoded quality, lower startup delay and lower probability of pause than a state-of-the-art FEC-based scheme. To provide robustness for video multicast applications, we propose non-end-to-end UMDC-based video distribution over a multi-tree multicast network. The multiplicity of parents decorrelates losses and the non-end-to-end feature increases the throughput of UMDC video data. We deploy an application-level service of LR description reconstruction in some intermediate nodes of the LR multicast tree. The principle behind this is to reconstruct the disrupted LR frames by the correctly received HR frames. As a result, the viewing experience at the downstream nodes benefits from the protection reconstruction at the upstream nodes.
Modular networks with delayed coupling: Synchronization and frequency control

NASA Astrophysics Data System (ADS)

Maslennikov, Oleg V.; Nekorkin, Vladimir I.

2014-07-01

We study the collective dynamics of modular networks consisting of map-based neurons which generate irregular spike sequences. Three types of intramodule topology are considered: a random Erdös-Rényi network, a small-world Watts-Strogatz network, and a scale-free Barabási-Albert network. The interaction between the neurons of different modules is organized by relatively sparse connections with time delay. For all the types of the network topology considered, we found that with increasing delay two regimes of module synchronization alternate with each other: inphase and antiphase. At the same time, the average rate of collective oscillations decreases within each of the time-delay intervals corresponding to a particular synchronization regime. A dual role of the time delay is thus established: controlling a synchronization mode and degree and controlling an average network frequency. Furthermore, we investigate the influence on the modular synchronization by other parameters: the strength of intermodule coupling and the individual firing rate.
Optimal exponential synchronization of general chaotic delayed neural networks: an LMI approach.

PubMed

Liu, Meiqin

2009-09-01

This paper investigates the optimal exponential synchronization problem of general chaotic neural networks with or without time delays by virtue of Lyapunov-Krasovskii stability theory and the linear matrix inequality (LMI) technique. This general model, which is the interconnection of a linear delayed dynamic system and a bounded static nonlinear operator, covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks (CNNs), bidirectional associative memory (BAM) networks, and recurrent multilayer perceptrons (RMLPs) with or without delays. Using the drive-response concept, time-delay feedback controllers are designed to synchronize two identical chaotic neural networks as quickly as possible. The control design equations are shown to be a generalized eigenvalue problem (GEVP) which can be easily solved by various convex optimization algorithms to determine the optimal control law and the optimal exponential synchronization rate. Detailed comparisons with existing results are made and numerical simulations are carried out to demonstrate the effectiveness of the established synchronization laws.
Devising Mobile Sensing and Actuation Infrastructure with Drones.

PubMed

Bae, Mungyu; Yoo, Seungho; Jung, Jongtack; Park, Seongjoon; Kim, Kangho; Kim, Joon Yeop Lee; Kim, Hwangnam

2018-02-19

Vast applications and services have been enabled as the number of mobile or sensing devices with communication capabilities has grown. However, managing the devices, integrating networks or combining services across different networks has become a new problem since each network is not directly connected via back-end core networks or servers. The issue is and has been discussed especially in wireless sensor and actuator networks (WSAN). In such systems, sensors and actuators are tightly coupled, so when an independent WSAN needs to collaborate with other networks, it is difficult to adequately combine them into an integrated infrastructure. In this paper, we propose drone-as-a-gateway (DaaG), which uses drones as mobile gateways to interconnect isolated networks or combine independent services. Our system contains features that focus on the service being provided in the order of importance, different from an adaptive simple mobile sink system or delay-tolerant system. Our simulation results have shown that the proposed system is able to activate actuators in the order of importance of the service, which uses separate sensors' data, and it consumes almost the same time in comparison with other path-planning algorithms. Moreover, we have implemented DaaG and presented results in a field test to show that it can enable large-scale on-demand deployment of sensing and actuation infrastructure or the Internet of Things (IoT).

Devising Mobile Sensing and Actuation Infrastructure with Drones

PubMed Central

Jung, Jongtack; Park, Seongjoon; Kim, Kangho; Lee, Joon Yeop

2018-01-01

Vast applications and services have been enabled as the number of mobile or sensing devices with communication capabilities has grown. However, managing the devices, integrating networks or combining services across different networks has become a new problem since each network is not directly connected via back-end core networks or servers. The issue is and has been discussed especially in wireless sensor and actuator networks (WSAN). In such systems, sensors and actuators are tightly coupled, so when an independent WSAN needs to collaborate with other networks, it is difficult to adequately combine them into an integrated infrastructure. In this paper, we propose drone-as-a-gateway (DaaG), which uses drones as mobile gateways to interconnect isolated networks or combine independent services. Our system contains features that focus on the service being provided in the order of importance, different from an adaptive simple mobile sink system or delay-tolerant system. Our simulation results have shown that the proposed system is able to activate actuators in the order of importance of the service, which uses separate sensors’ data, and it consumes almost the same time in comparison with other path-planning algorithms. Moreover, we have implemented DaaG and presented results in a field test to show that it can enable large-scale on-demand deployment of sensing and actuation infrastructure or the Internet of Things (IoT). PMID:29463064
OceanRoute: Vessel Mobility Data Processing and Analyzing Model Based on MapReduce

NASA Astrophysics Data System (ADS)

Liu, Chao; Liu, Yingjian; Guo, Zhongwen; Jing, Wei

2018-06-01

The network coverage is a big problem in ocean communication, and there is no low-cost solution in the short term. Based on the knowledge of Mobile Delay Tolerant Network (MDTN), the mobility of vessels can create the chances of end-to-end communication. The mobility pattern of vessel is one of the key metrics on ocean MDTN network. Because of the high cost, few experiments have focused on research of vessel mobility pattern for the moment. In this paper, we study the traces of more than 4000 fishing and freight vessels. Firstly, to solve the data noise and sparsity problem, we design two algorithms to filter the noise and complement the missing data based on the vessel's turning feature. Secondly, after studying the traces of vessels, we observe that the vessel's traces are confined by invisible boundary. Thirdly, through defining the distance between traces, we design MR-Similarity algorithm to find the mobility pattern of vessels. Finally, we realize our algorithm on cluster and evaluate the performance and accuracy. Our results can provide the guidelines on design of data routing protocols on ocean MDTN.
Hybrid function projective synchronization in complex dynamical networks

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

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.
Asymptotic stability of delay-difference system of hopfield neural networks via matrix inequalities and application.

PubMed

Ratchagit, Kreangkri

2007-10-01

In this paper, we derive a sufficient condition for asymptotic stability of the zero solution of delay-difference system of Hopfield neural networks in terms of certain matrix inequalities by using a discrete version of the Lyapunov second method. The result is applied to obtain new asymptotic stability condition for some class of delay-difference system such as delay-difference system of Hopfield neural networks with multiple delays in terms of certain matrix inequalities. Our results can be well suited for computational purposes.
Synchronization in oscillator networks with delayed coupling: a stability criterion.

PubMed

Earl, Matthew G; Strogatz, Steven H

2003-03-01

We derive a stability criterion for the synchronous state in networks of identical phase oscillators with delayed coupling. The criterion applies to any network (whether regular or random, low dimensional or high dimensional, directed or undirected) in which each oscillator receives delayed signals from k others, where k is uniform for all oscillators.
How time delay and network design shape response patterns in biochemical negative feedback systems.

PubMed

Börsch, Anastasiya; Schaber, Jörg

2016-08-24

Negative feedback in combination with time delay can bring about both sustained oscillations and adaptive behaviour in cellular networks. Here, we study which design features of systems with delayed negative feedback shape characteristic response patterns with special emphasis on the role of time delay. To this end, we analyse generic two-dimensional delay differential equations describing the dynamics of biochemical signal-response networks. We investigate the influence of several design features on the stability of the model equilibrium, i.e., presence of auto-inhibition and/or mass conservation and the kind and/or strength of the delayed negative feedback. We show that auto-inhibition and mass conservation have a stabilizing effect, whereas increasing abruptness and decreasing feedback threshold have a de-stabilizing effect on the model equilibrium. Moreover, applying our theoretical analysis to the mammalian p53 system we show that an auto-inhibitory feedback can decouple period and amplitude of an oscillatory response, whereas the delayed feedback can not. Our theoretical framework provides insight into how time delay and design features of biochemical networks act together to elicit specific characteristic response patterns. Such insight is useful for constructing synthetic networks and controlling their behaviour in response to external stimulation.
Ergodic properties of spiking neuronal networks with delayed interactions

NASA Astrophysics Data System (ADS)

Palmigiano, Agostina; Wolf, Fred

The dynamical stability of neuronal networks, and the possibility of chaotic dynamics in the brain pose profound questions to the mechanisms underlying perception. Here we advance on the tractability of large neuronal networks of exactly solvable neuronal models with delayed pulse-coupled interactions. Pulse coupled delayed systems with an infinite dimensional phase space can be studied in equivalent systems of fixed and finite degrees of freedom by introducing a delayer variable for each neuron. A Jacobian of the equivalent system can be analytically obtained, and numerically evaluated. We find that depending on the action potential onset rapidness and the level of heterogeneities, the asynchronous irregular regime characteristic of balanced state networks loses stability with increasing delays to either a slow synchronous irregular or a fast synchronous irregular state. In networks of neurons with slow action potential onset, the transition to collective oscillations leads to an increase of the exponential rate of divergence of nearby trajectories and of the entropy production rate of the chaotic dynamics. The attractor dimension, instead of increasing linearly with increasing delay as reported in many other studies, decreases until eventually the network reaches full synchrony
Hybrid routing technique for a fault-tolerant, integrated information network

NASA Technical Reports Server (NTRS)

Meredith, B. D.

1986-01-01

The evolutionary growth of the space station and the diverse activities onboard are expected to require a hierarchy of integrated, local area networks capable of supporting data, voice, and video communications. In addition, fault-tolerant network operation is necessary to protect communications between critical systems attached to the net and to relieve the valuable human resources onboard the space station of time-critical data system repair tasks. A key issue for the design of the fault-tolerant, integrated network is the development of a robust routing algorithm which dynamically selects the optimum communication paths through the net. A routing technique is described that adapts to topological changes in the network to support fault-tolerant operation and system evolvability.
Channel noise-induced temporal coherence transitions and synchronization transitions in adaptive neuronal networks with time delay

NASA Astrophysics Data System (ADS)

Gong, Yubing; Xie, Huijuan

2017-09-01

Using spike-timing-dependent plasticity (STDP), we study the effect of channel noise on temporal coherence and synchronization of adaptive scale-free Hodgkin-Huxley neuronal networks with time delay. It is found that the spiking regularity and spatial synchronization of the neurons intermittently increase and decrease as channel noise intensity is varied, exhibiting transitions of temporal coherence and synchronization. Moreover, this phenomenon depends on time delay, STDP, and network average degree. As time delay increases, the phenomenon is weakened, however, there are optimal STDP and network average degree by which the phenomenon becomes strongest. These results show that channel noise can intermittently enhance the temporal coherence and synchronization of the delayed adaptive neuronal networks. These findings provide a new insight into channel noise for the information processing and transmission in neural systems.
Finite time synchronization of memristor-based Cohen-Grossberg neural networks with mixed delays.

PubMed

Chen, Chuan; Li, Lixiang; Peng, Haipeng; Yang, Yixian

2017-01-01

Finite time synchronization, which means synchronization can be achieved in a settling time, is desirable in some practical applications. However, most of the published results on finite time synchronization don't include delays or only include discrete delays. In view of the fact that distributed delays inevitably exist in neural networks, this paper aims to investigate the finite time synchronization of memristor-based Cohen-Grossberg neural networks (MCGNNs) with both discrete delay and distributed delay (mixed delays). By means of a simple feedback controller and novel finite time synchronization analysis methods, several new criteria are derived to ensure the finite time synchronization of MCGNNs with mixed delays. The obtained criteria are very concise and easy to verify. Numerical simulations are presented to demonstrate the effectiveness of our theoretical results.
Opinion formation on multiplex scale-free networks

NASA Astrophysics Data System (ADS)

Nguyen, Vu Xuan; Xiao, Gaoxi; Xu, Xin-Jian; Li, Guoqi; Wang, Zhen

2018-01-01

Most individuals, if not all, live in various social networks. The formation of opinion systems is an outcome of social interactions and information propagation occurring in such networks. We study the opinion formation with a new rule of pairwise interactions in the novel version of the well-known Deffuant model on multiplex networks composed of two layers, each of which is a scale-free network. It is found that in a duplex network composed of two identical layers, the presence of the multiplexity helps either diminish or enhance opinion diversity depending on the relative magnitudes of tolerance ranges characterizing the degree of openness/tolerance on both layers: there is a steady separation between different regions of tolerance range values on two network layers where multiplexity plays two different roles, respectively. Additionally, the two critical tolerance ranges follow a one-sum rule; that is, each of the layers reaches a complete consensus only if the sum of the tolerance ranges on the two layers is greater than a constant approximately equaling 1, the double of the critical bound on a corresponding isolated network. A further investigation of the coupling between constituent layers quantified by a link overlap parameter reveals that as the layers are loosely coupled, the two opinion systems co-evolve independently, but when the inter-layer coupling is sufficiently strong, a monotonic behavior is observed: an increase in the tolerance range of a layer causes a decline in the opinion diversity on the other layer regardless of the magnitudes of tolerance ranges associated with the layers in question.
Analysis of a Data Communication Network’s Performance under Varying Retransmission Disciplines

DTIC Science & Technology

1990-09-01

The routing table is updated using delay information transmitted via congestion/routing up- date packets ( CRUP ) or through delay measurement...previous delay, plus or minus a threshold value, a CRUP is generated and flooded over the network. Upon receipt of a CRUP the ROUTING function up- dates...DDN topology is very large, accounting for the time delay for the full network to be updated, whereas adjacent PSN’s receive CRUP packets virtually
LMI designmethod for networked-based PID control

NASA Astrophysics Data System (ADS)

Souza, Fernando de Oliveira; Mozelli, Leonardo Amaral; de Oliveira, Maurício Carvalho; Palhares, Reinaldo Martinez

2016-10-01

In this paper, we propose a methodology for the design of networked PID controllers for second-order delayed processes using linear matrix inequalities. The proposed procedure takes into account time-varying delay on the plant, time-varying delays induced by the network and packed dropouts. The design is carried on entirely using a continuous-time model of the closed-loop system where time-varying delays are used to represent sampling and holding occurring in a discrete-time digital PID controller.
Global exponential stability of BAM neural networks with time-varying delays and diffusion terms

NASA Astrophysics Data System (ADS)

Wan, Li; Zhou, Qinghua

2007-11-01

The stability property of bidirectional associate memory (BAM) neural networks with time-varying delays and diffusion terms are considered. By using the method of variation parameter and inequality technique, the delay-independent sufficient conditions to guarantee the uniqueness and global exponential stability of the equilibrium solution of such networks are established.
Finite-Time Stabilization and Adaptive Control of Memristor-Based Delayed Neural Networks.

PubMed

Wang, Leimin; Shen, Yi; Zhang, Guodong

Finite-time stability problem has been a hot topic in control and system engineering. This paper deals with the finite-time stabilization issue of memristor-based delayed neural networks (MDNNs) via two control approaches. First, in order to realize the stabilization of MDNNs in finite time, a delayed state feedback controller is proposed. Then, a novel adaptive strategy is applied to the delayed controller, and finite-time stabilization of MDNNs can also be achieved by using the adaptive control law. Some easily verified algebraic criteria are derived to ensure the stabilization of MDNNs in finite time, and the estimation of the settling time functional is given. Moreover, several finite-time stability results as our special cases for both memristor-based neural networks (MNNs) without delays and neural networks are given. Finally, three examples are provided for the illustration of the theoretical results.Finite-time stability problem has been a hot topic in control and system engineering. This paper deals with the finite-time stabilization issue of memristor-based delayed neural networks (MDNNs) via two control approaches. First, in order to realize the stabilization of MDNNs in finite time, a delayed state feedback controller is proposed. Then, a novel adaptive strategy is applied to the delayed controller, and finite-time stabilization of MDNNs can also be achieved by using the adaptive control law. Some easily verified algebraic criteria are derived to ensure the stabilization of MDNNs in finite time, and the estimation of the settling time functional is given. Moreover, several finite-time stability results as our special cases for both memristor-based neural networks (MNNs) without delays and neural networks are given. Finally, three examples are provided for the illustration of the theoretical results.
A uniform energy consumption algorithm for wireless sensor and actuator networks based on dynamic polling point selection.

PubMed

Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

2013-12-19

Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation.
Distributed Position-Based Consensus of Second-Order Multiagent Systems With Continuous/Intermittent Communication.

PubMed

Song, Qiang; Liu, Fang; Wen, Guanghui; Cao, Jinde; Yang, Xinsong

2017-04-24

This paper considers the position-based consensus in a network of agents with double-integrator dynamics and directed topology. Two types of distributed observer algorithms are proposed to solve the consensus problem by utilizing continuous and intermittent position measurements, respectively, where each observer does not interact with any other observers. For the case of continuous communication between network agents, some convergence conditions are derived for reaching consensus in the network with a single constant delay or multiple time-varying delays on the basis of the eigenvalue analysis and the descriptor method. When the network agents can only obtain intermittent position data from local neighbors at discrete time instants, the consensus in the network without time delay or with nonuniform delays is investigated by using the Wirtinger's inequality and the delayed-input approach. Numerical examples are given to illustrate the theoretical analysis.
An FPGA Implementation of a Polychronous Spiking Neural Network with Delay Adaptation.

PubMed

Wang, Runchun; Cohen, Gregory; Stiefel, Klaus M; Hamilton, Tara Julia; Tapson, Jonathan; van Schaik, André

2013-01-01

We present an FPGA implementation of a re-configurable, polychronous spiking neural network with a large capacity for spatial-temporal patterns. The proposed neural network generates delay paths de novo, so that only connections that actually appear in the training patterns will be created. This allows the proposed network to use all the axons (variables) to store information. Spike Timing Dependent Delay Plasticity is used to fine-tune and add dynamics to the network. We use a time multiplexing approach allowing us to achieve 4096 (4k) neurons and up to 1.15 million programmable delay axons on a Virtex 6 FPGA. Test results show that the proposed neural network is capable of successfully recalling more than 95% of all spikes for 96% of the stored patterns. The tests also show that the neural network is robust to noise from random input spikes.
Channel Noise-Enhanced Synchronization Transitions Induced by Time Delay in Adaptive Neuronal Networks with Spike-Timing-Dependent Plasticity

NASA Astrophysics Data System (ADS)

Xie, Huijuan; Gong, Yubing; Wang, Baoying

In this paper, we numerically study the effect of channel noise on synchronization transitions induced by time delay in adaptive scale-free Hodgkin-Huxley neuronal networks with spike-timing-dependent plasticity (STDP). It is found that synchronization transitions by time delay vary as channel noise intensity is changed and become most pronounced when channel noise intensity is optimal. This phenomenon depends on STDP and network average degree, and it can be either enhanced or suppressed as network average degree increases depending on channel noise intensity. These results show that there are optimal channel noise and network average degree that can enhance the synchronization transitions by time delay in the adaptive neuronal networks. These findings could be helpful for better understanding of the regulation effect of channel noise on synchronization of neuronal networks. They could find potential implications for information transmission in neural systems.
Delay decomposition at a single server queue with constant service time and multiple inputs

NASA Technical Reports Server (NTRS)

Ziegler, C.; Schilling, D. L.

1978-01-01

Two network consisting of single server queues, each with a constant service time, are considered. The external inputs to each network are assumed to follow some general probability distribution. Several interesting equivalencies that exist between the two networks considered are derived. This leads to the introduction of an important concept in delay decomposition. It is shown that the waiting time experienced by a customer can be decomposed into two basic components called self-delay and interference delay.

Fault tolerance of artificial neural networks with applications in critical systems

NASA Technical Reports Server (NTRS)

Protzel, Peter W.; Palumbo, Daniel L.; Arras, Michael K.

1992-01-01

This paper investigates the fault tolerance characteristics of time continuous recurrent artificial neural networks (ANN) that can be used to solve optimization problems. The principle of operations and performance of these networks are first illustrated by using well-known model problems like the traveling salesman problem and the assignment problem. The ANNs are then subjected to 13 simultaneous 'stuck at 1' or 'stuck at 0' faults for network sizes of up to 900 'neurons'. The effects of these faults is demonstrated and the cause for the observed fault tolerance is discussed. An application is presented in which a network performs a critical task for a real-time distributed processing system by generating new task allocations during the reconfiguration of the system. The performance degradation of the ANN under the presence of faults is investigated by large-scale simulations, and the potential benefits of delegating a critical task to a fault tolerant network are discussed.
Error monitoring issues for common channel signaling

NASA Astrophysics Data System (ADS)

Hou, Victor T.; Kant, Krishna; Ramaswami, V.; Wang, Jonathan L.

1994-04-01

Motivated by field data which showed a large number of link changeovers and incidences of link oscillations between in-service and out-of-service states in common channel signaling (CCS) networks, a number of analyses of the link error monitoring procedures in the SS7 protocol were performed by the authors. This paper summarizes the results obtained thus far and include the following: (1) results of an exact analysis of the performance of the error monitoring procedures under both random and bursty errors; (2) a demonstration that there exists a range of error rates within which the error monitoring procedures of SS7 may induce frequent changeovers and changebacks; (3) an analysis of the performance ofthe SS7 level-2 transmission protocol to determine the tolerable error rates within which the delay requirements can be met; (4) a demonstration that the tolerable error rate depends strongly on various link and traffic characteristics, thereby implying that a single set of error monitor parameters will not work well in all situations; (5) some recommendations on a customizable/adaptable scheme of error monitoring with a discussion on their implementability. These issues may be particularly relevant in the presence of anticipated increases in SS7 traffic due to widespread deployment of Advanced Intelligent Network (AIN) and Personal Communications Service (PCS) as well as for developing procedures for high-speed SS7 links currently under consideration by standards bodies.
Systemic delay propagation in the US airport network

PubMed Central

Fleurquin, Pablo; Ramasco, José J.; Eguiluz, Victor M.

2013-01-01

Technologically driven transport systems are characterized by a networked structure connecting operation centers and by a dynamics ruled by pre-established schedules. Schedules impose serious constraints on the timing of the operations, condition the allocation of resources and define a baseline to assess system performance. Here we study the performance of an air transportation system in terms of delays. Technical, operational or meteorological issues affecting some flights give rise to primary delays. When operations continue, such delays can propagate, magnify and eventually involve a significant part of the network. We define metrics able to quantify the level of network congestion and introduce a model that reproduces the delay propagation patterns observed in the U.S. performance data. Our results indicate that there is a non-negligible risk of systemic instability even under normal operating conditions. We also identify passenger and crew connectivity as the most relevant internal factor contributing to delay spreading. PMID:23362459
Dissipativity and stability analysis of fractional-order complex-valued neural networks with time delay.

PubMed

Velmurugan, G; Rakkiyappan, R; Vembarasan, V; Cao, Jinde; Alsaedi, Ahmed

2017-02-01

As we know, the notion of dissipativity is an important dynamical property of neural networks. Thus, the analysis of dissipativity of neural networks with time delay is becoming more and more important in the research field. In this paper, the authors establish a class of fractional-order complex-valued neural networks (FCVNNs) with time delay, and intensively study the problem of dissipativity, as well as global asymptotic stability of the considered FCVNNs with time delay. Based on the fractional Halanay inequality and suitable Lyapunov functions, some new sufficient conditions are obtained that guarantee the dissipativity of FCVNNs with time delay. Moreover, some sufficient conditions are derived in order to ensure the global asymptotic stability of the addressed FCVNNs with time delay. Finally, two numerical simulations are posed to ensure that the attention of our main results are valuable. Copyright © 2016 Elsevier Ltd. All rights reserved.
Source Localization Using Wireless Sensor Networks

DTIC Science & Technology

2006-06-01

performance of the hybrid SI/ML estimation method. A wireless sensor network is simulated in NS-2 to study the network throughput, delay and jitter...indicate that the wireless sensor network has low delay and can support fast information exchange needed in counter-sniper applications.
A new delay-independent condition for global robust stability of neural networks with time delays.

PubMed

Samli, Ruya

2015-06-01

This paper studies the problem of robust stability of dynamical neural networks with discrete time delays under the assumptions that the network parameters of the neural system are uncertain and norm-bounded, and the activation functions are slope-bounded. By employing the results of Lyapunov stability theory and matrix theory, new sufficient conditions for the existence, uniqueness and global asymptotic stability of the equilibrium point for delayed neural networks are presented. The results reported in this paper can be easily tested by checking some special properties of symmetric matrices associated with the parameter uncertainties of neural networks. We also present a numerical example to show the effectiveness of the proposed theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.
Survey on Monitoring and Quality Controlling of the Mobile Biosignal Delivery.

PubMed

Pawar, Pravin A; Edla, Damodar R; Edoh, Thierry; Shinde, Vijay; van Beijnum, Bert-Jan

2017-10-31

A Mobile Patient Monitoring System (MPMS) acquires patient's biosignals and transmits them using wireless network connection to the decision-making module or healthcare professional for the assessment of patient's condition. A variety of wireless network technologies such as wireless personal area networks (e.g., Bluetooth), mobile ad-hoc networks (MANET), and infrastructure-based networks (e.g., WLAN and cellular networks) are in practice for biosignals delivery. The wireless network quality-of-service (QoS) requirements of biosignals delivery are mainly specified in terms of required bandwidth, acceptable delay, and tolerable error rate. An important research challenge in the MPMS is how to satisfy QoS requirements of biosignals delivery in the environment characterized by patient mobility, deployment of multiple wireless network technologies, and variable QoS characteristics of the wireless networks. QoS requirements are mainly application specific, while available QoS is largely dependent on QoS provided by wireless network in use. QoS provisioning refers to providing support for improving QoS experience of networked applications. In resource poor conditions, application adaptation may also be required to make maximum use of available wireless network QoS. This survey paper presents a survey of recent developments in the area of QoS provisioning for MPMS. In particular, our contributions are as follows: (1) overview of wireless networks and network QoS requirements of biosignals delivery; (2) survey of wireless networks' QoS performance evaluation for the transmission of biosignals; and (3) survey of QoS provisioning mechanisms for biosignals delivery in MPMS. We also propose integrating end-to-end QoS monitoring and QoS provisioning strategies in a mobile patient monitoring system infrastructure to support optimal delivery of biosignals to the healthcare professionals.
Convergence analysis of stochastic hybrid bidirectional associative memory neural networks with delays

NASA Astrophysics Data System (ADS)

Wan, Li; Zhou, Qinghua

2007-10-01

The stability property of stochastic hybrid bidirectional associate memory (BAM) neural networks with discrete delays is considered. Without assuming the symmetry of synaptic connection weights and the monotonicity and differentiability of activation functions, the delay-independent sufficient conditions to guarantee the exponential stability of the equilibrium solution for such networks are given by using the nonnegative semimartingale convergence theorem.
Reliability and synchronization in a delay-coupled neuronal network with synaptic plasticity

NASA Astrophysics Data System (ADS)

Pérez, Toni; Uchida, Atsushi

2011-06-01

We investigate the characteristics of reliability and synchronization of a neuronal network of delay-coupled integrate and fire neurons. Reliability and synchronization appear in separated regions of the phase space of the parameters considered. The effect of including synaptic plasticity and different delay values between the connections are also considered. We found that plasticity strongly changes the characteristics of reliability and synchronization in the parameter space of the coupling strength and the drive amplitude for the neuronal network. We also found that delay does not affect the reliability of the network but has a determinant influence on the synchronization of the neurons.
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.
Altering impulsive decision making with an acceptance-based procedure.

PubMed

Morrison, Kate L; Madden, Gregory J; Odum, Amy L; Friedel, Jonathan E; Twohig, Michael P

2014-09-01

Delay discounting is one facet of impulsive decision making and involves subjectively devaluing a delayed outcome. Steeply discounting delayed rewards is correlated with substance abuse and other problematic behaviors. To the extent that steep delay discounting underlies these clinical disorders, it would be advantageous to find psychosocial avenues for reducing delay discounting. Acceptance-based interventions may prove useful as they may help to decrease the distress that arises while waiting for a delayed outcome. The current study was conducted to determine if a 60-90 minute acceptance-based training would change delay discounting rates among 30 undergraduate university students in comparison to a waitlist control. Measures given at pre- and posttraining included a hypothetical monetary delay discounting task, the Acceptance and Action Questionnaire-II (AAQ-II), and the Distress Tolerance Scale. Those assigned to the treatment group decreased their discounting of delayed money, but not distress intolerance or psychological inflexibility when compared to the waitlist control group. After the waiting period, the control group received the intervention. Combining all participants' pre- to posttreatment data, the acceptance-based treatment significantly decreased discounting of monetary rewards and increased distress tolerance. The difference in AAQ-II approached significance. Acceptance-based treatments may be a worthwhile option for decreasing delay discounting rates and, consequently, affecting the choices that underlie addiction and other problematic behaviors. Copyright © 2014. Published by Elsevier Ltd.
Virtualized MME Design for IoT Support in 5G Systems

PubMed Central

Andres-Maldonado, Pilar; Ameigeiras, Pablo; Prados-Garzon, Jonathan; Ramos-Munoz, Juan Jose; Lopez-Soler, Juan Manuel

2016-01-01

Cellular systems are recently being considered an option to provide support to the Internet of Things (IoT). To enable this support, the 3rd Generation Partnership Project (3GPP) has introduced new procedures specifically targeted for cellular IoT. With one of these procedures, the transmissions of small and infrequent data packets from/to the devices are encapsulated in signaling messages and sent through the control plane. However, these transmissions from/to a massive number of devices may imply a major increase of the processing load on the control plane entities of the network and in particular on the Mobility Management Entity (MME). In this paper, we propose two designs of an MME based on Network Function Virtualization (NFV) that aim at facilitating the IoT support. The first proposed design partially separates the processing resources dedicated to each traffic class. The second design includes traffic shaping to control the traffic of each class. We consider three classes: Mobile Broadband (MBB), low latency Machine to Machine communications (lM2M) and delay-tolerant M2M communications. Our proposals enable reducing the processing resources and, therefore, the cost. Additionally, results show that the proposed designs lessen the impact between classes, so they ease the compliance of the delay requirements of MBB and lM2M communications. PMID:27556468
Stochastic resonance enhancement of small-world neural networks by hybrid synapses and time delay

NASA Astrophysics Data System (ADS)

Yu, Haitao; Guo, Xinmeng; Wang, Jiang

2017-01-01

The synergistic effect of hybrid electrical-chemical synapses and information transmission delay on the stochastic response behavior in small-world neuronal networks is investigated. Numerical results show that, the stochastic response behavior can be regulated by moderate noise intensity to track the rhythm of subthreshold pacemaker, indicating the occurrence of stochastic resonance (SR) in the considered neural system. Inheriting the characteristics of two types of synapses-electrical and chemical ones, neural networks with hybrid electrical-chemical synapses are of great improvement in neuron communication. Particularly, chemical synapses are conducive to increase the network detectability by lowering the resonance noise intensity, while the information is better transmitted through the networks via electrical coupling. Moreover, time delay is able to enhance or destroy the periodic stochastic response behavior intermittently. In the time-delayed small-world neuronal networks, the introduction of electrical synapses can significantly improve the signal detection capability by widening the range of optimal noise intensity for the subthreshold signal, and the efficiency of SR is largely amplified in the case of pure chemical couplings. In addition, the stochastic response behavior is also profoundly influenced by the network topology. Increasing the rewiring probability in pure chemically coupled networks can always enhance the effect of SR, which is slightly influenced by information transmission delay. On the other hand, the capacity of information communication is robust to the network topology within the time-delayed neuronal systems including electrical couplings.
A novel shock and heat tolerant gyrosensor utilizing a one-port surface acoustic wave reflective delay line

NASA Astrophysics Data System (ADS)

Oh, Haekwan; Fu, Chen; Yang, Sang Sik; Wang, Wen; Lee, Keekeun

2012-04-01

A surface acoustic wave (SAW)-based gyroscope with an 80 MHz central frequency was fabricated on a 128° YX LiNbO3 piezoelectric substrate. The fabricated gyroscope is composed of a SAW resonator, metallic dots and a SAW reflective delay line. The SAW resonator, which is activated by a voltage-controlled oscillator, generates a stable standing wave with a large amplitude at an 80 MHz resonant frequency, and the metallic dots induce a Coriolis force and generate a secondary SAW in the direction orthogonal to the propagating standing wave. The SAW reflective delay line is employed to measure the Coriolis effect by analyzing the deviations in the resonant frequency of the SAW reflective delay line. A combined finite element method/boundary element method was utilized to extract the optimal device parameters prior to fabrication. The device was fabricated according to the modeling results and then measured on a rate table. When the device was subjected to an angular rotation, a secondary SAW from the vibrating metallic dots was generated owing to the Coriolis force, resulting in a perturbation of the propagating SAW in the SAW reflective delay line. Depending on the angular velocity, the reflection peak of SAW reflective delay line was changed linearly, and this change was measured by the network analyzer. The measured results matched the modeling results well. The obtained sensitivity was approximately 1.23 deg/(deg/s) in an angular rate range of 0-2000 deg s-1. Good thermal and shock stabilities were observed during the evaluation process proving the shock and heat robustness of the fabricated SAW gyroscope.
Event-based simulation of networks with pulse delayed coupling

NASA Astrophysics Data System (ADS)

Klinshov, Vladimir; Nekorkin, Vladimir

2017-10-01

Pulse-mediated interactions are common in networks of different nature. Here we develop a general framework for simulation of networks with pulse delayed coupling. We introduce the discrete map governing the dynamics of such networks and describe the computation algorithm for its numerical simulation.
Adaptive Information Dissemination Control to Provide Diffdelay for the Internet of Things.

PubMed

Liu, Xiao; Liu, Anfeng; Huang, Changqin

2017-01-12

Applications running on the Internet of Things, such as the Wireless Sensor and Actuator Networks (WSANs) platform, generally have different quality of service (QoS) requirements. For urgent events, it is crucial that information be reported to the actuator quickly, and the communication cost is the second factor. However, for interesting events, communication costs, network lifetime and time all become important factors. In most situations, these different requirements cannot be satisfied simultaneously. In this paper, an adaptive communication control based on a differentiated delay (ACCDS) scheme is proposed to resolve this conflict. In an ACCDS, source nodes of events adaptively send various searching actuators routings (SARs) based on the degree of sensitivity to delay while maintaining the network lifetime. For a delay-sensitive event, the source node sends a large number of SARs to actuators to identify and inform the actuators in an extremely short time; thus, action can be taken quickly but at higher communication costs. For delay-insensitive events, the source node sends fewer SARs to reduce communication costs and improve network lifetime. Therefore, an ACCDS can meet the QoS requirements of different events using a differentiated delay framework. Theoretical analysis simulation results indicate that an ACCDS provides delay and communication costs and differentiated services; an ACCDS scheme can reduce the network delay by 11.111%-53.684% for a delay-sensitive event and reduce the communication costs by 5%-22.308% for interesting events, and reduce the network lifetime by about 28.713%.
Adaptive Information Dissemination Control to Provide Diffdelay for the Internet of Things

PubMed Central

Liu, Xiao; Liu, Anfeng; Huang, Changqin

2017-01-01

Applications running on the Internet of Things, such as the Wireless Sensor and Actuator Networks (WSANs) platform, generally have different quality of service (QoS) requirements. For urgent events, it is crucial that information be reported to the actuator quickly, and the communication cost is the second factor. However, for interesting events, communication costs, network lifetime and time all become important factors. In most situations, these different requirements cannot be satisfied simultaneously. In this paper, an adaptive communication control based on a differentiated delay (ACCDS) scheme is proposed to resolve this conflict. In an ACCDS, source nodes of events adaptively send various searching actuators routings (SARs) based on the degree of sensitivity to delay while maintaining the network lifetime. For a delay-sensitive event, the source node sends a large number of SARs to actuators to identify and inform the actuators in an extremely short time; thus, action can be taken quickly but at higher communication costs. For delay-insensitive events, the source node sends fewer SARs to reduce communication costs and improve network lifetime. Therefore, an ACCDS can meet the QoS requirements of different events using a differentiated delay framework. Theoretical analysis simulation results indicate that an ACCDS provides delay and communication costs and differentiated services; an ACCDS scheme can reduce the network delay by 11.111%–53.684% for a delay-sensitive event and reduce the communication costs by 5%–22.308% for interesting events, and reduce the network lifetime by about 28.713%. PMID:28085097
Capacity of Heterogeneous Mobile Wireless Networks with D-Delay Transmission Strategy.

PubMed

Wu, Feng; Zhu, Jiang; Xi, Zhipeng; Gao, Kai

2016-03-25

This paper investigates the capacity problem of heterogeneous wireless networks in mobility scenarios. A heterogeneous network model which consists of n normal nodes and m helping nodes is proposed. Moreover, we propose a D-delay transmission strategy to ensure that every packet can be delivered to its destination nodes with limited delay. Different from most existing network schemes, our network model has a novel two-tier architecture. The existence of helping nodes greatly improves the network capacity. Four types of mobile networks are studied in this paper: i.i.d. fast mobility model and slow mobility model in two-dimensional space, i.i.d. fast mobility model and slow mobility model in three-dimensional space. Using the virtual channel model, we present an intuitive analysis of the capacity of two-dimensional mobile networks and three-dimensional mobile networks, respectively. Given a delay constraint D, we derive the asymptotic expressions for the capacity of the four types of mobile networks. Furthermore, the impact of D and m to the capacity of the whole network is analyzed. Our findings provide great guidance for the future design of the next generation of networks.
Fault-Tolerant Algorithms for Connectivity Restoration in Wireless Sensor Networks.

PubMed

Zeng, Yali; Xu, Li; Chen, Zhide

2015-12-22

As wireless sensor network (WSN) is often deployed in a hostile environment, nodes in the networks are prone to large-scale failures, resulting in the network not working normally. In this case, an effective restoration scheme is needed to restore the faulty network timely. Most of existing restoration schemes consider more about the number of deployed nodes or fault tolerance alone, but fail to take into account the fact that network coverage and topology quality are also important to a network. To address this issue, we present two algorithms named Full 2-Connectivity Restoration Algorithm (F2CRA) and Partial 3-Connectivity Restoration Algorithm (P3CRA), which restore a faulty WSN in different aspects. F2CRA constructs the fan-shaped topology structure to reduce the number of deployed nodes, while P3CRA constructs the dual-ring topology structure to improve the fault tolerance of the network. F2CRA is suitable when the restoration cost is given the priority, and P3CRA is suitable when the network quality is considered first. Compared with other algorithms, these two algorithms ensure that the network has stronger fault-tolerant function, larger coverage area and better balanced load after the restoration.
HyspIRI Intelligent Payload Module(IPM) and Benchmarking Algorithms for Upload

NASA Technical Reports Server (NTRS)

Mandl, Daniel

2010-01-01

Features: Hardware: a) Xilinx Virtex-5 (GSFC Space Cube 2); b) 2 x 400MHz PPC; c) 100MHz Bus; d) 2 x 512MB SDRAM; e) Dual Gigabit Ethernet. Support Linux kernel 2.6.31 (gcc version 4.2.2). Support software running in stand alone mode for better performance. Can stream raw data up to 800 Mbps. Ready for operations. Software Application Examples: Band-stripping Algiotrhmsl:cloud, sulfur, flood, thermal, SWIL, NDVI, NDWI, SIWI, oil spills, algae blooms, etc. Corrections: geometric, radiometric, atmospheric. Core Flight System/dynamic software bus. CCSDS File Delivery Protocol. Delay Tolerant Network. CASPER /onboard planning. Fault monitoring/recovery software. S/C command and telemetry software. Data compression. Sensor Web for Autonomous Mission Operations.

Application distribution model and related security attacks in VANET

NASA Astrophysics Data System (ADS)

Nikaein, Navid; Kanti Datta, Soumya; Marecar, Irshad; Bonnet, Christian

2013-03-01

In this paper, we present a model for application distribution and related security attacks in dense vehicular ad hoc networks (VANET) and sparse VANET which forms a delay tolerant network (DTN). We study the vulnerabilities of VANET to evaluate the attack scenarios and introduce a new attacker`s model as an extension to the work done in [6]. Then a VANET model has been proposed that supports the application distribution through proxy app stores on top of mobile platforms installed in vehicles. The steps of application distribution have been studied in detail. We have identified key attacks (e.g. malware, spamming and phishing, software attack and threat to location privacy) for dense VANET and two attack scenarios for sparse VANET. It has been shown that attacks can be launched by distributing malicious applications and injecting malicious codes to On Board Unit (OBU) by exploiting OBU software security holes. Consequences of such security attacks have been described. Finally, countermeasures including the concepts of sandbox have also been presented in depth.
Differentiation of Speech Delay and Global Developmental Delay in Children Using DTI Tractography-Based Connectome.

PubMed

Jeong, J-W; Sundaram, S; Behen, M E; Chugani, H T

2016-06-01

Pure speech delay is a common developmental disorder which, according to some estimates, affects 5%-8% of the population. Speech delay may not only be an isolated condition but also can be part of a broader condition such as global developmental delay. The present study investigated whether diffusion tensor imaging tractography-based connectome can differentiate global developmental delay from speech delay in young children. Twelve children with pure speech delay (39.1 ± 20.9 months of age, 9 boys), 14 children with global developmental delay (39.3 ± 18.2 months of age, 12 boys), and 10 children with typical development (38.5 ± 20.5 months of age, 7 boys) underwent 3T DTI. For each subject, whole-brain connectome analysis was performed by using 116 cortical ROIs. The following network metrics were measured at individual regions: strength (number of the shortest paths), efficiency (measures of global and local integration), cluster coefficient (a measure of local aggregation), and betweeness (a measure of centrality). Compared with typical development, global and local efficiency were significantly reduced in both global developmental delay and speech delay (P < .0001). The nodal strength of the cognitive network is reduced in global developmental delay, whereas the nodal strength of the language network is reduced in speech delay. This finding resulted in a high accuracy of >83% ± 4% to discriminate global developmental delay from speech delay. The network abnormalities identified in the present study may underlie the neurocognitive and behavioral consequences commonly identified in children with global developmental delay and speech delay. Further validation studies in larger samples are required. © 2016 by American Journal of Neuroradiology.
Discrete-time bidirectional associative memory neural networks with variable delays

NASA Astrophysics Data System (ADS)

Liang, variable delays [rapid communication] J.; Cao, J.; Ho, D. W. C.

2005-02-01

Based on the linear matrix inequality (LMI), some sufficient conditions are presented in this Letter for the existence, uniqueness and global exponential stability of the equilibrium point of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Some of the stability criteria obtained in this Letter are delay-dependent, and some of them are delay-independent, they are less conservative than the ones reported so far in the literature. Furthermore, the results provide one more set of easily verified criteria for determining the exponential stability of discrete-time BAM neural networks.
Emergence of amplitude death scenario in a network of oscillators under repulsive delay interaction

NASA Astrophysics Data System (ADS)

Bera, Bidesh K.; Hens, Chittaranjan; Ghosh, Dibakar

2016-07-01

We report the existence of amplitude death in a network of identical oscillators under repulsive mean coupling. Amplitude death appears in a globally coupled network of identical oscillators with instantaneous repulsive mean coupling only when the number of oscillators is more than two. We further investigate that, amplitude death may emerge even in two coupled oscillators as well as network of oscillators if we introduce delay time in the repulsive mean coupling. We have analytically derived the region of amplitude death island and find out how strength of delay controls the death regime in two coupled or a large network of coupled oscillators. We have verified our results on network of delayed Mackey-Glass systems where parameters are set in hyperchaotic regime. We have also tested our coupling approach in two paradigmatic limit cycle oscillators: Stuart-Landau and Van der Pol oscillators.
Passivity analysis of memristor-based impulsive inertial neural networks with time-varying delays.

PubMed

Wan, Peng; Jian, Jigui

2018-03-01

This paper focuses on delay-dependent passivity analysis for a class of memristive impulsive inertial neural networks with time-varying delays. By choosing proper variable transformation, the memristive inertial neural networks can be rewritten as first-order differential equations. The memristive model presented here is regarded as a switching system rather than employing the theory of differential inclusion and set-value map. Based on matrix inequality and Lyapunov-Krasovskii functional method, several delay-dependent passivity conditions are obtained to ascertain the passivity of the addressed networks. In addition, the results obtained here contain those on the passivity for the addressed networks without impulse effects as special cases and can also be generalized to other neural networks with more complex pulse interference. Finally, one numerical example is presented to show the validity of the obtained results. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.
Spatiotemporal topology and temporal sequence identification with an adaptive time-delay neural network

NASA Astrophysics Data System (ADS)

Lin, Daw-Tung; Ligomenides, Panos A.; Dayhoff, Judith E.

1993-08-01

Inspired from the time delays that occur in neurobiological signal transmission, we describe an adaptive time delay neural network (ATNN) which is a powerful dynamic learning technique for spatiotemporal pattern transformation and temporal sequence identification. The dynamic properties of this network are formulated through the adaptation of time-delays and synapse weights, which are adjusted on-line based on gradient descent rules according to the evolution of observed inputs and outputs. We have applied the ATNN to examples that possess spatiotemporal complexity, with temporal sequences that are completed by the network. The ATNN is able to be applied to pattern completion. Simulation results show that the ATNN learns the topology of a circular and figure eight trajectories within 500 on-line training iterations, and reproduces the trajectory dynamically with very high accuracy. The ATNN was also trained to model the Fourier series expansion of the sum of different odd harmonics. The resulting network provides more flexibility and efficiency than the TDNN and allows the network to seek optimal values for time-delays as well as optimal synapse weights.
A Uniform Energy Consumption Algorithm for Wireless Sensor and Actuator Networks Based on Dynamic Polling Point Selection

PubMed Central

Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

2014-01-01

Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation. PMID:24451455
Passivity of memristive BAM neural networks with leakage and additive time-varying delays

NASA Astrophysics Data System (ADS)

Wang, Weiping; Wang, Meiqi; Luo, Xiong; Li, Lixiang; Zhao, Wenbing; Liu, Linlin; Ping, Yuan

2018-02-01

This paper investigates the passivity of memristive bidirectional associate memory neural networks (MBAMNNs) with leakage and additive time-varying delays. Based on some useful inequalities and appropriate Lyapunov-Krasovskii functionals (LKFs), several delay-dependent conditions for passivity performance are obtained in linear matrix inequalities (LMIs). Moreover, the leakage delays as well as additive delays are considered separately. Finally, numerical simulations are provided to demonstrate the feasibility of the theoretical results.
Stability analysis and synchronization in discrete-time complex networks with delayed coupling

NASA Astrophysics Data System (ADS)

Cheng, Ranran; Peng, Mingshu; Yu, Weibin; Sun, Bo; Yu, Jinchen

2013-12-01

A new network of coupled maps is proposed in which the connections between units involve no delays but the intra-neural communication does, whereas in the work of Atay et al. [Phys. Rev. Lett. 92, 144101 (2004)], the focus is on information processing delayed by the inter-neural communication. We show that the synchronization of the network depends on not only the intrinsic dynamical features and inter-connection topology (characterized by the spectrum of the graph Laplacian) but also the delays and the coupling strength. There are two main findings: (i) the more neighbours, the easier to be synchronized; (ii) odd delays are easier to be synchronized than even ones. In addition, compared with those discussed by Atay et al. [Phys. Rev. Lett. 92, 144101 (2004)], our model has a better synchronizability for regular networks and small-world variants.
Proposal of DCS-OFDM-PON upstream transmission with intensity modulator and collective self-coherent detection

NASA Astrophysics Data System (ADS)

Zhang, Jing; Yang, Heming; Zhao, Difu; Qiu, Kun

2016-07-01

We introduce digital coherent superposition (DCS) into optical access network and propose a DCS-OFDM-PON upstream transmission scheme using intensity modulator and collective self-coherent detection. The generated OFDM signal is real based on Hermitian symmetry, which can be used to estimate the common phase error (CPE) by complex conjugate subcarrier pairs without any pilots. In simulation, we transmit an aggregated 40 Gb/s optical OFDM signal from two ONUs. The transmission performance with DCS is slightly better after 25 km transmission without relative transmission time delay. The fiber distance for different ONUs to RN are not same in general and there is relative transmission time delay between ONUs, which causes inter-carrier-interference (ICI) power increasing and degrades the transmission performance. The DCS can mitigate the ICI power and the DCS-OFDM-PON upstream transmission outperforms the conventional OFDM-PON. The CPE estimation is by using two pairs of complex conjugate subcarriers without redundancy. The power variation can be 9 dB in DCS-OFDM-PON, which is enough to tolerate several kilometers fiber length difference between the ONUs.
SFTP: A Secure and Fault-Tolerant Paradigm against Blackhole Attack in MANET

NASA Astrophysics Data System (ADS)

KumarRout, Jitendra; Kumar Bhoi, Sourav; Kumar Panda, Sanjaya

2013-02-01

Security issues in MANET are a challenging task nowadays. MANETs are vulnerable to passive attacks and active attacks because of a limited number of resources and lack of centralized authority. Blackhole attack is an attack in network layer which degrade the network performance by dropping the packets. In this paper, we have proposed a Secure Fault-Tolerant Paradigm (SFTP) which checks the Blackhole attack in the network. The three phases used in SFTP algorithm are designing of coverage area to find the area of coverage, Network Connection algorithm to design a fault-tolerant model and Route Discovery algorithm to discover the route and data delivery from source to destination. SFTP gives better network performance by making the network fault free.
Synchronization properties of network motifs: Influence of coupling delay and symmetry

NASA Astrophysics Data System (ADS)

D'Huys, O.; Vicente, R.; Erneux, T.; Danckaert, J.; Fischer, I.

2008-09-01

We investigate the effect of coupling delays on the synchronization properties of several network motifs. In particular, we analyze the synchronization patterns of unidirectionally coupled rings, bidirectionally coupled rings, and open chains of Kuramoto oscillators. Our approach includes an analytical and semianalytical study of the existence and stability of different in-phase and out-of-phase periodic solutions, complemented by numerical simulations. The delay is found to act differently on networks possessing different symmetries. While for the unidirectionally coupled ring the coupling delay is mainly observed to induce multistability, its effect on bidirectionally coupled rings is to enhance the most symmetric solution. We also study the influence of feedback and conclude that it also promotes the in-phase solution of the coupled oscillators. We finally discuss the relation between our theoretical results on delay-coupled Kuramoto oscillators and the synchronization properties of networks consisting of real-world delay-coupled oscillators, such as semiconductor laser arrays and neuronal circuits.
Impact of geographic distance on appraisal delay for active TB treatment seeking in Uganda: a network analysis of the Kawempe Community Health Cohort Study.

PubMed

Fluegge, Kyle; Malone, LaShaunda L; Nsereko, Mary; Okware, Brenda; Wejse, Christian; Kisingo, Hussein; Mupere, Ezekiel; Boom, W Henry; Stein, Catherine M

2018-06-26

Appraisal delay is the time a patient takes to consider a symptom as not only noticeable, but a sign of illness. The study's objective was to determine the association between appraisal delay in seeking tuberculosis (TB) treatment and geographic distance measured by network travel (driving and pedestrian) time (in minutes) and distance (Euclidean and self-reported) (in kilometers) and to identify other risk factors from selected covariates and how they modify the core association between delay and distance. This was part of a longitudinal cohort study known as the Kawempe Community Health Study based in Kampala, Uganda. The study enrolled households from April 2002 to July 2012. Multivariable interval regression with multiplicative heteroscedasticity was used to assess the impact of time and distance on delay. The delay interval outcome was defined using a comprehensive set of 28 possible self-reported symptoms. The main independent variables were network travel time (in minutes) and Euclidean distance (in kilometers). Other covariates were organized according to the Andersen utilization conceptual framework. A total of 838 patients with both distance and delay data were included in the network analysis. Bivariate analyses did not reveal a significant association of any distance metric with the delay outcome. However, adjusting for patient characteristics and cavitary disease status, the multivariable model indicated that each minute of driving time to the clinic significantly (p = 0.02) and positively predicted 0.25 days' delay. At the median distance value of 47 min, this represented an additional delay of about 12 (95% CI: [3, 21]) days to the mean of 40 days (95% CI: [25, 56]). Increasing Euclidean distance significantly predicted (p = 0.02) reduced variance in the delay outcome, thereby increasing precision of the mean delay estimate. At the median Euclidean distance of 2.8 km, the variance in the delay was reduced by more than 25%. Of the four geographic distance measures, network travel driving time was a better and more robust predictor of mean delay in this setting. Including network travel driving time with other risk factors may be important in identifying populations especially vulnerable to delay.
Impossibility of asymptotic synchronization for pulse-coupled oscillators with delayed excitatory coupling.

PubMed

Wu, Wei; Chen, Tianping

2009-12-01

Fireflies, as one of the most spectacular examples of synchronization in nature, have been investigated widely. In 1990, Mirollo and Strogatz proposed a pulse-coupled oscillator model to explain the synchronization of South East Asian fireflies (Pteroptyx malaccae). However, transmission delays were not considered in their model. In fact, when transmission delays are introduced, the dynamic behaviors of pulse-coupled networks change a lot. In this paper, pulse-coupled oscillator networks with delayed excitatory coupling are studied. A concept of synchronization, named weak asymptotic synchronization, which is weaker than asymptotic synchronization, is proposed. We prove that for pulse-coupled oscillator networks with delayed excitatory coupling, weak asymptotic synchronization cannot occur.
Associations between depression, distress tolerance, delay discounting, and alcohol-related problems in European American and African American college students.

PubMed

Dennhardt, Ashley A; Murphy, James G

2011-12-01

Although levels of heavy drinking and alcohol-related problems are high in college students, there is significant variability in the number and type of problems experienced, even among students who drink heavily. African American students drink less and experience fewer alcohol-related problems than European American students, but are still at risk, and little research has investigated the potentially unique patterns and predictors of problems among these students. Depression, distress tolerance, and delay discounting have been implicated in adult substance abuse and may be important predictors of alcohol problem severity among college students. We examined the relationship between these variables and alcohol-related problems among African American and European American students (N = 206; 53% female; 68% European American; 28% African American) who reported recent heavy drinking. In regression models that controlled for drinking level, depression, distress tolerance, and delay discounting were associated with alcohol problems among African American students, but only depression was associated with alcohol problems among European American students. These results suggest that negative affect is a key risk factor for alcohol problems among college student drinkers. For African American students, the inability to tolerate negative emotions and to organize their behavior around future outcomes may also be especially relevant risk factors.
Observer design for compensation of network-induced delays in integrated communication and control systems

NASA Technical Reports Server (NTRS)

Luck, R.; Ray, A.

1988-01-01

A method for compensating the effects of network-induced delays in integrated communication and control systems (ICCS) is proposed, and a finite-dimensional time-invariant ICCS model is developed. The problem of analyzing systems with time-varying and stochastic delays is circumvented by the application of a deterministic observer. For the case of controller-to-actuator delays, the observed design must rely on an extended model which represents the delays as additional states.
Complex Dynamics of Delay-Coupled Neural Networks

NASA Astrophysics Data System (ADS)

Mao, Xiaochen

2016-09-01

This paper reveals the complicated dynamics of a delay-coupled system that consists of a pair of sub-networks and multiple bidirectional couplings. Time delays are introduced into the internal connections and network-couplings, respectively. The stability and instability of the coupled network are discussed. The sufficient conditions for the existence of oscillations are given. Case studies of numerical simulations are given to validate the analytical results. Interesting and complicated neuronal activities are observed numerically, such as rest states, periodic oscillations, multiple switches of rest states and oscillations, and the coexistence of different types of oscillations.
Adaptive logical stochastic resonance in time-delayed synthetic genetic networks

NASA Astrophysics Data System (ADS)

Zhang, Lei; Zheng, Wenbin; Song, Aiguo

2018-04-01

In the paper, the concept of logical stochastic resonance is applied to implement logic operation and latch operation in time-delayed synthetic genetic networks derived from a bacteriophage λ. Clear logic operation and latch operation can be obtained when the network is tuned by modulated periodic force and time-delay. In contrast with the previous synthetic genetic networks based on logical stochastic resonance, the proposed system has two advantages. On one hand, adding modulated periodic force to the background noise can increase the length of the optimal noise plateau of obtaining desired logic response and make the system adapt to varying noise intensity. On the other hand, tuning time-delay can extend the optimal noise plateau to larger range. The result provides possible help for designing new genetic regulatory networks paradigm based on logical stochastic resonance.
Time signal distribution in communication networks based on synchronous digital hierarchy

NASA Technical Reports Server (NTRS)

Imaoka, Atsushi; Kihara, Masami

1993-01-01

A new method that uses round-trip paths to accurately measure transmission delay for time synchronization is proposed. The performance of the method in Synchronous Digital Hierarchy networks is discussed. The feature of this method is that it separately measures the initial round trip path delay and the variations in round-trip path delay. The delay generated in SDH equipment is determined by measuring the initial round-trip path delay. In an experiment with actual SDH equipment, the error of initial delay measurement was suppressed to 30ns.
Network Topologies and Dynamics Leading to Endotoxin Tolerance and Priming in Innate Immune Cells

NASA Astrophysics Data System (ADS)

Fu, Yan; Glaros, Trevor; Zhu, Meng; Wang, Ping; Wu, Zhanghan; Tyson, John; Li, Liwu; Xing, Jianhua

2012-01-01

The innate immune system, acting as the first line of host defense, senses and adapts to foreign challenges through complex intracellular and intercellular signaling networks. Endotoxin tolerance and priming elicited by macrophages are classic examples of the complex adaptation of innate immune cells. Upon repetitive exposures to different doses of bacterial endotoxin (lipopolysaccharide) or other stimulants, macrophages show either suppressed or augmented inflammatory responses compared to a single exposure to the stimulant. Endotoxin tolerance and priming are critically involved in both immune homeostasis and the pathogenesis of diverse inflammatory diseases. However, the underlying molecular mechanisms are not well understood. By means of a computational search through the parameter space of a coarse-grained three-node network with a two-stage Metropolis sampling approach, we enumerated all the network topologies that can generate priming or tolerance. We discovered three major mechanisms for priming (pathway synergy, suppressor deactivation, activator induction) and one for tolerance (inhibitor persistence). These results not only explain existing experimental observations, but also reveal intriguing test scenarios for future experimental studies to clarify mechanisms of endotoxin priming and tolerance.

Combined in vivo and in vitro approach for the characterization of penicillin-specific polyclonal lymphocyte reactivity: tolerance tests with safe penicillins instead of challenge with culprit drugs.

PubMed

Sachs, B; Al Masaoudi, T; Merk, H F; Erdmann, S

2004-10-01

Amino-penicillins are a major cause of delayed-type reactions to penicillins. The aim of this study was to establish a diagnostic approach for the characterization of the individual penicillin-specific polyclonal lymphocyte reactivity in order to detect side chain-specific sensitization to amino-penicillins. Patients can then be advised to undergo a tolerance test with safe penicillins instead of provocation with culprit penicillins for confirmation of penicillin allergy. We investigated penicillin-specific polyclonal lymphocyte reactivity in nine patients with delayed-type reactions to amino-penicillins by a combined in vivo (patch, prick and intracutaneous tests with delayed readings) and in vitro (lymphocyte transformation test, LTT) approach. A combination of LTT and skin tests improved the sensitivity for the characterization of penicillin-specific polyclonal lymphocyte reactivity and allowed the detection of three different patterns of lymphocyte reactivity. Four patients showed a side chain-specific sensitization to amino-penicillins in vivo and in vitro and were advised to undergo tolerance tests with safe penicillins. Two patients agreed and were exposed to parenteral benzyl-penicillin and oral phenoxymethyl-penicillin which they tolerated without complications. These data suggest that a combined in vivo and in vitro approach is helpful for the detection of side chain-specific sensitization to amino-penicillins. Patients with such sensitization are very likely to tolerate safe penicillins, thereby expanding their therapeutic options when antibiotic treatment is required.
In-Space Networking on NASA's SCAN Testbed

NASA Technical Reports Server (NTRS)

Brooks, David E.; Eddy, Wesley M.; Clark, Gilbert J.; Johnson, Sandra K.

2016-01-01

The NASA Space Communications and Navigation (SCaN) Testbed, an external payload onboard the International Space Station, is equipped with three software defined radios and a flight computer for supporting in-space communication research. New technologies being studied using the SCaN Testbed include advanced networking, coding, and modulation protocols designed to support the transition of NASAs mission systems from primarily point to point data links and preplanned routes towards adaptive, autonomous internetworked operations needed to meet future mission objectives. Networking protocols implemented on the SCaN Testbed include the Advanced Orbiting Systems (AOS) link-layer protocol, Consultative Committee for Space Data Systems (CCSDS) Encapsulation Packets, Internet Protocol (IP), Space Link Extension (SLE), CCSDS File Delivery Protocol (CFDP), and Delay-Tolerant Networking (DTN) protocols including the Bundle Protocol (BP) and Licklider Transmission Protocol (LTP). The SCaN Testbed end-to-end system provides three S-band data links and one Ka-band data link to exchange space and ground data through NASAs Tracking Data Relay Satellite System or a direct-to-ground link to ground stations. The multiple data links and nodes provide several upgradable elements on both the space and ground systems. This paper will provide a general description of the testbeds system design and capabilities, discuss in detail the design and lessons learned in the implementation of the network protocols, and describe future plans for continuing research to meet the communication needs for evolving global space systems.
Delay selection by spike-timing-dependent plasticity in recurrent networks of spiking neurons receiving oscillatory inputs.

PubMed

Kerr, Robert R; Burkitt, Anthony N; Thomas, Doreen A; Gilson, Matthieu; Grayden, David B

2013-01-01

Learning rules, such as spike-timing-dependent plasticity (STDP), change the structure of networks of neurons based on the firing activity. A network level understanding of these mechanisms can help infer how the brain learns patterns and processes information. Previous studies have shown that STDP selectively potentiates feed-forward connections that have specific axonal delays, and that this underlies behavioral functions such as sound localization in the auditory brainstem of the barn owl. In this study, we investigate how STDP leads to the selective potentiation of recurrent connections with different axonal and dendritic delays during oscillatory activity. We develop analytical models of learning with additive STDP in recurrent networks driven by oscillatory inputs, and support the results using simulations with leaky integrate-and-fire neurons. Our results show selective potentiation of connections with specific axonal delays, which depended on the input frequency. In addition, we demonstrate how this can lead to a network becoming selective in the amplitude of its oscillatory response to this frequency. We extend this model of axonal delay selection within a single recurrent network in two ways. First, we show the selective potentiation of connections with a range of both axonal and dendritic delays. Second, we show axonal delay selection between multiple groups receiving out-of-phase, oscillatory inputs. We discuss the application of these models to the formation and activation of neuronal ensembles or cell assemblies in the cortex, and also to missing fundamental pitch perception in the auditory brainstem.
Delay Selection by Spike-Timing-Dependent Plasticity in Recurrent Networks of Spiking Neurons Receiving Oscillatory Inputs

PubMed Central

Kerr, Robert R.; Burkitt, Anthony N.; Thomas, Doreen A.; Gilson, Matthieu; Grayden, David B.

2013-01-01

Learning rules, such as spike-timing-dependent plasticity (STDP), change the structure of networks of neurons based on the firing activity. A network level understanding of these mechanisms can help infer how the brain learns patterns and processes information. Previous studies have shown that STDP selectively potentiates feed-forward connections that have specific axonal delays, and that this underlies behavioral functions such as sound localization in the auditory brainstem of the barn owl. In this study, we investigate how STDP leads to the selective potentiation of recurrent connections with different axonal and dendritic delays during oscillatory activity. We develop analytical models of learning with additive STDP in recurrent networks driven by oscillatory inputs, and support the results using simulations with leaky integrate-and-fire neurons. Our results show selective potentiation of connections with specific axonal delays, which depended on the input frequency. In addition, we demonstrate how this can lead to a network becoming selective in the amplitude of its oscillatory response to this frequency. We extend this model of axonal delay selection within a single recurrent network in two ways. First, we show the selective potentiation of connections with a range of both axonal and dendritic delays. Second, we show axonal delay selection between multiple groups receiving out-of-phase, oscillatory inputs. We discuss the application of these models to the formation and activation of neuronal ensembles or cell assemblies in the cortex, and also to missing fundamental pitch perception in the auditory brainstem. PMID:23408878
New exponential synchronization criteria for time-varying delayed neural networks with discontinuous activations.

PubMed

Cai, Zuowei; Huang, Lihong; Zhang, Lingling

2015-05-01

This paper investigates the problem of exponential synchronization of time-varying delayed neural networks with discontinuous neuron activations. Under the extended Filippov differential inclusion framework, by designing discontinuous state-feedback controller and using some analytic techniques, new testable algebraic criteria are obtained to realize two different kinds of global exponential synchronization of the drive-response system. Moreover, we give the estimated rate of exponential synchronization which depends on the delays and system parameters. The obtained results extend some previous works on synchronization of delayed neural networks not only with continuous activations but also with discontinuous activations. Finally, numerical examples are provided to show the correctness of our analysis via computer simulations. Our method and theoretical results have a leading significance in the design of synchronized neural network circuits involving discontinuous factors and time-varying delays. Copyright © 2015 Elsevier Ltd. All rights reserved.
Back-propagation learning of infinite-dimensional dynamical systems.

PubMed

Tokuda, Isao; Tokunaga, Ryuji; Aihara, Kazuyuki

2003-10-01

This paper presents numerical studies of applying back-propagation learning to a delayed recurrent neural network (DRNN). The DRNN is a continuous-time recurrent neural network having time delayed feedbacks and the back-propagation learning is to teach spatio-temporal dynamics to the DRNN. Since the time-delays make the dynamics of the DRNN infinite-dimensional, the learning algorithm and the learning capability of the DRNN are different from those of the ordinary recurrent neural network (ORNN) having no time-delays. First, two types of learning algorithms are developed for a class of DRNNs. Then, using chaotic signals generated from the Mackey-Glass equation and the Rössler equations, learning capability of the DRNN is examined. Comparing the learning algorithms, learning capability, and robustness against noise of the DRNN with those of the ORNN and time delay neural network, advantages as well as disadvantages of the DRNN are investigated.
Convergence behavior of delayed discrete cellular neural network without periodic coefficients.

PubMed

Wang, Jinling; Jiang, Haijun; Hu, Cheng; Ma, Tianlong

2014-05-01

In this paper, we study convergence behaviors of delayed discrete cellular neural networks without periodic coefficients. Some sufficient conditions are derived to ensure all solutions of delayed discrete cellular neural network without periodic coefficients converge to a periodic function, by applying mathematical analysis techniques and the properties of inequalities. Finally, some examples showing the effectiveness of the provided criterion are given. Copyright © 2014 Elsevier Ltd. All rights reserved.
Robust stability for stochastic bidirectional associative memory neural networks with time delays

NASA Astrophysics Data System (ADS)

Shu, H. S.; Lv, Z. W.; Wei, G. L.

2008-02-01

In this paper, the asymptotic stability is considered for a class of uncertain stochastic bidirectional associative memory neural networks with time delays and parameter uncertainties. The delays are time-invariant and the uncertainties are norm-bounded that enter into all network parameters. The aim of this paper is to establish easily verifiable conditions under which the delayed neural network is robustly asymptotically stable in the mean square for all admissible parameter uncertainties. By employing a Lyapunov-Krasovskii functional and conducting the stochastic analysis, a linear matrix inequality matrix inequality (LMI) approach is developed to derive the stability criteria. The proposed criteria can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed criteria.
Incorporating time-delays in S-System model for reverse engineering genetic networks.

PubMed

Chowdhury, Ahsan Raja; Chetty, Madhu; Vinh, Nguyen Xuan

2013-06-18

In any gene regulatory network (GRN), the complex interactions occurring amongst transcription factors and target genes can be either instantaneous or time-delayed. However, many existing modeling approaches currently applied for inferring GRNs are unable to represent both these interactions simultaneously. As a result, all these approaches cannot detect important interactions of the other type. S-System model, a differential equation based approach which has been increasingly applied for modeling GRNs, also suffers from this limitation. In fact, all S-System based existing modeling approaches have been designed to capture only instantaneous interactions, and are unable to infer time-delayed interactions. In this paper, we propose a novel Time-Delayed S-System (TDSS) model which uses a set of delay differential equations to represent the system dynamics. The ability to incorporate time-delay parameters in the proposed S-System model enables simultaneous modeling of both instantaneous and time-delayed interactions. Furthermore, the delay parameters are not limited to just positive integer values (corresponding to time stamps in the data), but can also take fractional values. Moreover, we also propose a new criterion for model evaluation exploiting the sparse and scale-free nature of GRNs to effectively narrow down the search space, which not only reduces the computation time significantly but also improves model accuracy. The evaluation criterion systematically adapts the max-min in-degrees and also systematically balances the effect of network accuracy and complexity during optimization. The four well-known performance measures applied to the experimental studies on synthetic networks with various time-delayed regulations clearly demonstrate that the proposed method can capture both instantaneous and delayed interactions correctly with high precision. The experiments carried out on two well-known real-life networks, namely IRMA and SOS DNA repair network in Escherichia coli show a significant improvement compared with other state-of-the-art approaches for GRN modeling.
The Interplanetary Overlay Networking Protocol Accelerator

NASA Technical Reports Server (NTRS)

Pang, Jackson; Torgerson, Jordan L.; Clare, Loren P.

2008-01-01

A document describes the Interplanetary Overlay Networking Protocol Accelerator (IONAC) an electronic apparatus, now under development, for relaying data at high rates in spacecraft and interplanetary radio-communication systems utilizing a delay-tolerant networking protocol. The protocol includes provisions for transmission and reception of data in bundles (essentially, messages), transfer of custody of a bundle to a recipient relay station at each step of a relay, and return receipts. Because of limitations on energy resources available for such relays, data rates attainable in a conventional software implementation of the protocol are lower than those needed, at any given reasonable energy-consumption rate. Therefore, a main goal in developing the IONAC is to reduce the energy consumption by an order of magnitude and the data-throughput capability by two orders of magnitude. The IONAC prototype is a field-programmable gate array that serves as a reconfigurable hybrid (hardware/ firmware) system for implementation of the protocol. The prototype can decode 108,000 bundles per second and encode 100,000 bundles per second. It includes a bundle-cache static randomaccess memory that enables maintenance of a throughput of 2.7Gb/s, and an Ethernet convergence layer that supports a duplex throughput of 1Gb/s.
Comparative Analysis of Disruption Tolerant Network Routing Simulations in the One and NS-3

DTIC Science & Technology

2017-12-01

real systems with less work compared to ns-2. In order to meet the design goals of ns-3, the entire code structure changed to a modular design . As a...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS COMPARATIVE ANALYSIS OF DISRUPTION TOLERANT NETWORK ROUTING SIMULATIONS IN THE ONE AND NS-3...Thesis 03-23-2016 to 12-15-2017 4. TITLE AND SUBTITLE COMPARATIVE ANALYSIS OF DISRUPTION TOLERANT NETWORK ROUTING SIMULATIONS IN THE ONE AND NS-3 5
Network coding based joint signaling and dynamic bandwidth allocation scheme for inter optical network unit communication in passive optical networks

NASA Astrophysics Data System (ADS)

Wei, Pei; Gu, Rentao; Ji, Yuefeng

2014-06-01

As an innovative and promising technology, network coding has been introduced to passive optical networks (PON) in recent years to support inter optical network unit (ONU) communication, yet the signaling process and dynamic bandwidth allocation (DBA) in PON with network coding (NC-PON) still need further study. Thus, we propose a joint signaling and DBA scheme for efficiently supporting differentiated services of inter ONU communication in NC-PON. In the proposed joint scheme, the signaling process lays the foundation to fulfill network coding in PON, and it can not only avoid the potential threat to downstream security in previous schemes but also be suitable for the proposed hybrid dynamic bandwidth allocation (HDBA) scheme. In HDBA, a DBA cycle is divided into two sub-cycles for applying different coding, scheduling and bandwidth allocation strategies to differentiated classes of services. Besides, as network traffic load varies, the entire upstream transmission window for all REPORT messages slides accordingly, leaving the transmission time of one or two sub-cycles to overlap with the bandwidth allocation calculation time at the optical line terminal (the OLT), so that the upstream idle time can be efficiently eliminated. Performance evaluation results validate that compared with the existing two DBA algorithms deployed in NC-PON, HDBA demonstrates the best quality of service (QoS) support in terms of delay for all classes of services, especially guarantees the end-to-end delay bound of high class services. Specifically, HDBA can eliminate queuing delay and scheduling delay of high class services, reduce those of lower class services by at least 20%, and reduce the average end-to-end delay of all services over 50%. Moreover, HDBA also achieves the maximum delay fairness between coded and uncoded lower class services, and medium delay fairness for high class services.
Fault tolerant high-performance PACS network design and implementation

NASA Astrophysics Data System (ADS)

Chimiak, William J.; Boehme, Johannes M.

1998-07-01

The Wake Forest University School of Medicine and the Wake Forest University/Baptist Medical Center (WFUBMC) are implementing a second generation PACS. The first generation PACS provided helpful information about the functional and temporal requirements of the system. It highlighted the importance of image retrieval speed, system availability, RIS/HIS integration, the ability to rapidly view images on any PACS workstation, network bandwidth, equipment redundancy, and the ability for the system to evolve using standards-based components. This paper deals with the network design and implementation of the PACS. The physical layout of the hospital areas served by the PACS, the choice of network equipment and installation issues encountered are addressed. Efforts to optimize fault tolerance are discussed. The PACS network is a gigabit, mixed-media network based on LAN emulation over ATM (LANE) with a rapid migration from LANE to Multiple Protocols Over ATM (MPOA) planned. Two fault-tolerant backbone ATM switches serve to distribute network accesses with two load-balancing 622 megabit per second (Mbps) OC-12 interconnections. The switch was sized to be upgradable to provide a 2.54 Gbps OC-48 interconnection with an OC-12 interconnection as a load-balancing backup. Modalities connect with legacy network interface cards to a switched-ethernet device. This device has two 155 Mbps OC-3 load-balancing uplinks to each of the backbone ATM switches of the PACS. This provides a fault-tolerant logical connection to the modality servers which pass verified DICOM images to the PACS servers and proper PACS diagnostic workstations. Where fiber pulls were prohibitively expensive, edge ATM switches were installed with an OC-12 uplink to a backbone ATM switches. The PACS and data base servers are fault-tolerant, hot-swappable Sun Enterprise Servers with an OC-12 connection to a backbone ATM switch and a fast-ethernet connection to a back-up network. The workstations come with 10/100 BASET autosense cards. A redundant switched-ethernet network will be installed to provide yet another degree of network fault-tolerance. The switched-ethernet devices are connected to each of the backbone ATM switches with two-load-balancing OC-3 connections to provide fault-tolerant connectivity in the event of a primary network failure.
Compensation of distributed delays in integrated communication and control systems

NASA Technical Reports Server (NTRS)

Ray, Asok; Luck, Rogelio

1991-01-01

The concept, analysis, implementation, and verification of a method for compensating delays that are distributed between the sensors, controller, and actuators within a control loop are discussed. With the objective of mitigating the detrimental effects of these network induced delays, a predictor-controller algorithm was formulated and analyzed. Robustness of the delay compensation algorithm was investigated relative to parametric uncertainties in plant modeling. The delay compensator was experimentally verified on an IEEE 802.4 network testbed for velocity control of a DC servomotor.
Space Link Extension Protocol Emulation for High-Throughput, High-Latency Network Connections

NASA Technical Reports Server (NTRS)

Tchorowski, Nicole; Murawski, Robert

2014-01-01

New space missions require higher data rates and new protocols to meet these requirements. These high data rate space communication links push the limitations of not only the space communication links, but of the ground communication networks and protocols which forward user data to remote ground stations (GS) for transmission. The Consultative Committee for Space Data Systems, (CCSDS) Space Link Extension (SLE) standard protocol is one protocol that has been proposed for use by the NASA Space Network (SN) Ground Segment Sustainment (SGSS) program. New protocol implementations must be carefully tested to ensure that they provide the required functionality, especially because of the remote nature of spacecraft. The SLE protocol standard has been tested in the NASA Glenn Research Center's SCENIC Emulation Lab in order to observe its operation under realistic network delay conditions. More specifically, the delay between then NASA Integrated Services Network (NISN) and spacecraft has been emulated. The round trip time (RTT) delay for the continental NISN network has been shown to be up to 120ms; as such the SLE protocol was tested with network delays ranging from 0ms to 200ms. Both a base network condition and an SLE connection were tested with these RTT delays, and the reaction of both network tests to the delay conditions were recorded. Throughput for both of these links was set at 1.2Gbps. The results will show that, in the presence of realistic network delay, the SLE link throughput is significantly reduced while the base network throughput however remained at the 1.2Gbps specification. The decrease in SLE throughput has been attributed to the implementation's use of blocking calls. The decrease in throughput is not acceptable for high data rate links, as the link requires constant data a flow in order for spacecraft and ground radios to stay synchronized, unless significant data is queued a the ground station. In cases where queuing the data is not an option, such as during real time transmissions, the SLE implementation cannot support high data rate communication.
Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

PubMed

Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

2016-08-01

This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.
77 FR 52246 - Clothianidin; Pesticide Tolerances

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-29

... concern. Clinical signs of neurotoxicity were exhibited in both rats (decreased arousal, motor activity..., delayed sexual maturation and an increase in stillbirths) was observed in the absence of maternal effects... weight gains and FQPA SF = 1X........ day. delayed sexual maturation, decreased absolute thymus weights...
Dipeptidyl-peptidase IV (DPP-IV) inhibitor delays tolerance to anxiolytic effect of ethanol and withdrawal-induced anxiety in rats.

PubMed

Sharma, Ajaykumar N; Pise, Ashish; Sharma, Jay N; Shukla, Praveen

2015-06-01

Dipeptidyl-peptidase IV (DPP-IV) is an enzyme responsible for the metabolism of endogenous gut-derived hormone, glucagon-like peptide-1 (GLP-1). DPP-IV is known for its role in energy homeostasis and pharmacological blockade of this enzyme is a recently approved clinical strategy for the management of type II diabetes. Accumulating evidences suggest that enzyme DPP-IV can affect spectrum of central nervous system (CNS) functions. However, little is known about the role of this enzyme in ethanol-mediated neurobehavioral complications. The objective of the present study was to examine the impact of DPP-IV inhibitor, sitagliptin on the development of tolerance to anxiolytic effect of ethanol and anxiety associated with ethanol withdrawal in rats. A dose-response study revealed that sitaglitpin (20 mg/kg, p.o.) per se exhibit anxiolytic effect in the elevated plus maze (EPM) test in rats. Tolerance to anxiolytic effect of ethanol (2 g/kg, i.p.; 8 % w/v) was observed from 7(th) day of ethanol-diet (6 % v/v) consumption. In contrast, tolerance to anxiolytic effect of ethanol was delayed in rats that were treated daily with sitagliptin (20 mg/kg, p.o.) as tolerance was observed from 13(th)day since commencement of ethanol-diet consumption. Discontinuation of rats from ethanol-diet after 15-days of ethanol consumption resulted in withdrawal anxiety between 8 h and 12 h post-abstinence. However, rats on 15-day ethanol-diet with concomitant sitagliptin (20 mg/kg, p.o.) treatment exhibited delay in appearance (24 h post-withdrawal) of withdrawal anxiety. In summary, DPP-IV inhibitors may prove as an attractive research strategy against ethanol tolerance and dependence.
A Q-Learning-Based Delay-Aware Routing Algorithm to Extend the Lifetime of Underwater Sensor Networks.

PubMed

Jin, Zhigang; Ma, Yingying; Su, Yishan; Li, Shuo; Fu, Xiaomei

2017-07-19

Underwater sensor networks (UWSNs) have become a hot research topic because of their various aquatic applications. As the underwater sensor nodes are powered by built-in batteries which are difficult to replace, extending the network lifetime is a most urgent need. Due to the low and variable transmission speed of sound, the design of reliable routing algorithms for UWSNs is challenging. In this paper, we propose a Q-learning based delay-aware routing (QDAR) algorithm to extend the lifetime of underwater sensor networks. In QDAR, a data collection phase is designed to adapt to the dynamic environment. With the application of the Q-learning technique, QDAR can determine a global optimal next hop rather than a greedy one. We define an action-utility function in which residual energy and propagation delay are both considered for adequate routing decisions. Thus, the QDAR algorithm can extend the network lifetime by uniformly distributing the residual energy and provide lower end-to-end delay. The simulation results show that our protocol can yield nearly the same network lifetime, and can reduce the end-to-end delay by 20-25% compared with a classic lifetime-extended routing protocol (QELAR).
A Q-Learning-Based Delay-Aware Routing Algorithm to Extend the Lifetime of Underwater Sensor Networks

PubMed Central

Ma, Yingying; Su, Yishan; Li, Shuo; Fu, Xiaomei

2017-01-01

Underwater sensor networks (UWSNs) have become a hot research topic because of their various aquatic applications. As the underwater sensor nodes are powered by built-in batteries which are difficult to replace, extending the network lifetime is a most urgent need. Due to the low and variable transmission speed of sound, the design of reliable routing algorithms for UWSNs is challenging. In this paper, we propose a Q-learning based delay-aware routing (QDAR) algorithm to extend the lifetime of underwater sensor networks. In QDAR, a data collection phase is designed to adapt to the dynamic environment. With the application of the Q-learning technique, QDAR can determine a global optimal next hop rather than a greedy one. We define an action-utility function in which residual energy and propagation delay are both considered for adequate routing decisions. Thus, the QDAR algorithm can extend the network lifetime by uniformly distributing the residual energy and provide lower end-to-end delay. The simulation results show that our protocol can yield nearly the same network lifetime, and can reduce the end-to-end delay by 20–25% compared with a classic lifetime-extended routing protocol (QELAR). PMID:28753951

New Passivity Criteria for Fuzzy Bam Neural Networks with Markovian Jumping Parameters and Time-Varying Delays

NASA Astrophysics Data System (ADS)

Vadivel, P.; Sakthivel, R.; Mathiyalagan, K.; Thangaraj, P.

2013-02-01

This paper addresses the problem of passivity analysis issue for a class of fuzzy bidirectional associative memory (BAM) neural networks with Markovian jumping parameters and time varying delays. A set of sufficient conditions for the passiveness of the considered fuzzy BAM neural network model is derived in terms of linear matrix inequalities by using the delay fractioning technique together with the Lyapunov function approach. In addition, the uncertainties are inevitable in neural networks because of the existence of modeling errors and external disturbance. Further, this result is extended to study the robust passivity criteria for uncertain fuzzy BAM neural networks with time varying delays and uncertainties. These criteria are expressed in the form of linear matrix inequalities (LMIs), which can be efficiently solved via standard numerical software. Two numerical examples are provided to demonstrate the effectiveness of the obtained results.
Research on low-latency MAC protocols for wireless sensor networks

NASA Astrophysics Data System (ADS)

He, Chenguang; Sha, Xuejun; Lee, Chankil

2007-11-01

Energy-efficient should not be the only design goal in MAC protocols for wireless sensor networks, which involve the use of battery-operated computing and sensing devices. Low-latency operation becomes the same important as energy-efficient in the case that the traffic load is very heavy or the real-time constrain is used in applications like tracking or locating. This paper introduces some causes of traditional time delays which are inherent in a multi-hops network using existing WSN MAC protocols, illuminates the importance of low-latency MAC design for wireless sensor networks, and presents three MACs as examples of low-latency protocols designed specially for sleep delay, wait delay and wakeup delay in wireless sensor networks, respectively. The paper also discusses design trade-offs with emphasis on low-latency and points out their advantages and disadvantages, together with some design considerations and suggestions for MAC protocols for future applications and researches.
Periodicity and global exponential stability of generalized Cohen-Grossberg neural networks with discontinuous activations and mixed delays.

PubMed

Wang, Dongshu; Huang, Lihong

2014-03-01

In this paper, we investigate the periodic dynamical behaviors for a class of general Cohen-Grossberg neural networks with discontinuous right-hand sides, time-varying and distributed delays. By means of retarded differential inclusions theory and the fixed point theorem of multi-valued maps, the existence of periodic solutions for the neural networks is obtained. After that, we derive some sufficient conditions for the global exponential stability and convergence of the neural networks, in terms of nonsmooth analysis theory with generalized Lyapunov approach. Without assuming the boundedness (or the growth condition) and monotonicity of the discontinuous neuron activation functions, our results will also be valid. Moreover, our results extend previous works not only on discrete time-varying and distributed delayed neural networks with continuous or even Lipschitz continuous activations, but also on discrete time-varying and distributed delayed neural networks with discontinuous activations. We give some numerical examples to show the applicability and effectiveness of our main results. Copyright © 2013 Elsevier Ltd. All rights reserved.
Global asymptotic stability of hybrid bidirectional associative memory neural networks with time delays

NASA Astrophysics Data System (ADS)

Arik, Sabri

2006-02-01

This Letter presents a sufficient condition for the existence, uniqueness and global asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with distributed time delays. The results impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all bounded continuous non-monotonic neuron activation functions. The results are also compared with the previous results derived in the literature.
Linear matrix inequality approach to exponential synchronization of a class of chaotic neural networks with time-varying delays

NASA Astrophysics Data System (ADS)

Wu, Wei; Cui, Bao-Tong

2007-07-01

In this paper, a synchronization scheme for a class of chaotic neural networks with time-varying delays is presented. This class of chaotic neural networks covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks, and bidirectional associative memory networks. The obtained criteria are expressed in terms of linear matrix inequalities, thus they can be efficiently verified. A comparison between our results and the previous results shows that our results are less restrictive.
Oscillatory dynamics of an intravenous glucose tolerance test model with delay interval

NASA Astrophysics Data System (ADS)

Shi, Xiangyun; Kuang, Yang; Makroglou, Athena; Mokshagundam, Sriprakash; Li, Jiaxu

2017-11-01

Type 2 diabetes mellitus (T2DM) has become prevalent pandemic disease in view of the modern life style. Both diabetic population and health expenses grow rapidly according to American Diabetes Association. Detecting the potential onset of T2DM is an essential focal point in the research of diabetes mellitus. The intravenous glucose tolerance test (IVGTT) is an effective protocol to determine the insulin sensitivity, glucose effectiveness, and pancreatic β-cell functionality, through the analysis and parameter estimation of a proper differential equation model. Delay differential equations have been used to study the complex physiological phenomena including the glucose and insulin regulations. In this paper, we propose a novel approach to model the time delay in IVGTT modeling. This novel approach uses two parameters to simulate not only both discrete time delay and distributed time delay in the past interval, but also the time delay distributed in a past sub-interval. Normally, larger time delay, either a discrete or a distributed delay, will destabilize the system. However, we find that time delay over a sub-interval might not. We present analytically some basic model properties, which are desirable biologically and mathematically. We show that this relatively simple model provides good fit to fluctuating patient data sets and reveals some intriguing dynamics. Moreover, our numerical simulation results indicate that our model may remove the defect in well known Minimal Model, which often overestimates the glucose effectiveness index.
A network of networks model to study phase synchronization using structural connection matrix of human brain

NASA Astrophysics Data System (ADS)

Ferrari, F. A. S.; Viana, R. L.; Reis, A. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.

2018-04-01

The cerebral cortex plays a key role in complex cortical functions. It can be divided into areas according to their function (motor, sensory and association areas). In this paper, the cerebral cortex is described as a network of networks (cortex network), we consider that each cortical area is composed of a network with small-world property (cortical network). The neurons are assumed to have bursting properties with the dynamics described by the Rulkov model. We study the phase synchronization of the cortex network and the cortical networks. In our simulations, we verify that synchronization in cortex network is not homogeneous. Besides, we focus on the suppression of neural phase synchronization. Synchronization can be related to undesired and pathological abnormal rhythms in the brain. For this reason, we consider the delayed feedback control to suppress the synchronization. We show that delayed feedback control is efficient to suppress synchronous behavior in our network model when an appropriate signal intensity and time delay are defined.
Projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random networks.

PubMed

Feng, Cun-Fang; Xu, Xin-Jian; Wang, Sheng-Jun; Wang, Ying-Hai

2008-06-01

We study projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random networks. We relax some limitations of previous work, where projective-anticipating and projective-lag synchronization can be achieved only on two coupled chaotic systems. In this paper, we realize projective-anticipating and projective-lag synchronization on complex dynamical networks composed of a large number of interconnected components. At the same time, although previous work studied projective synchronization on complex dynamical networks, the dynamics of the nodes are coupled partially linear chaotic systems. In this paper, the dynamics of the nodes of the complex networks are time-delayed chaotic systems without the limitation of the partial linearity. Based on the Lyapunov stability theory, we suggest a generic method to achieve the projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random dynamical networks, and we find both its existence and sufficient stability conditions. The validity of the proposed method is demonstrated and verified by examining specific examples using Ikeda and Mackey-Glass systems on Erdos-Renyi networks.
Fast Recall for Complex-Valued Hopfield Neural Networks with Projection Rules.

PubMed

Kobayashi, Masaki

2017-01-01

Many models of neural networks have been extended to complex-valued neural networks. A complex-valued Hopfield neural network (CHNN) is a complex-valued version of a Hopfield neural network. Complex-valued neurons can represent multistates, and CHNNs are available for the storage of multilevel data, such as gray-scale images. The CHNNs are often trapped into the local minima, and their noise tolerance is low. Lee improved the noise tolerance of the CHNNs by detecting and exiting the local minima. In the present work, we propose a new recall algorithm that eliminates the local minima. We show that our proposed recall algorithm not only accelerated the recall but also improved the noise tolerance through computer simulations.
Control of epidemics on complex networks: Effectiveness of delayed isolation

NASA Astrophysics Data System (ADS)

Pereira, Tiago; Young, Lai-Sang

2015-08-01

We study isolation as a means to control epidemic outbreaks in complex networks, focusing on the consequences of delays in isolating infected nodes. Our analysis uncovers a tipping point: if infected nodes are isolated before a critical day dc, the disease is effectively controlled, whereas for longer delays the number of infected nodes climbs steeply. We show that dc can be estimated explicitly in terms of network properties and disease parameters, connecting lowered values of dc explicitly to heterogeneity in degree distribution. Our results reveal also that initial delays in the implementation of isolation protocols can have catastrophic consequences in heterogeneous networks. As our study is carried out in a general framework, it has the potential to offer insight and suggest proactive strategies for containing outbreaks of a range of serious infectious diseases.
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.
Insensitive dependence of delay-induced oscillation death on complex networks

NASA Astrophysics Data System (ADS)

Zou, Wei; Zheng, Xing; Zhan, Meng

2011-06-01

Oscillation death (also called amplitude death), a phenomenon of coupling induced stabilization of an unstable equilibrium, is studied for an arbitrary symmetric complex network with delay-coupled oscillators, and the critical conditions for its linear stability are explicitly obtained. All cases including one oscillator, a pair of oscillators, regular oscillator networks, and complex oscillator networks with delay feedback coupling, can be treated in a unified form. For an arbitrary symmetric network, we find that the corresponding smallest eigenvalue of the Laplacian λN (0 >λN ≥ -1) completely determines the death island, and as λN is located within the insensitive parameter region for nearly all complex networks, the death island keeps nearly the largest and does not sensitively depend on the complex network structures. This insensitivity effect has been tested for many typical complex networks including Watts-Strogatz (WS) and Newman-Watts (NW) small world networks, general scale-free (SF) networks, Erdos-Renyi (ER) random networks, geographical networks, and networks with community structures and is expected to be helpful for our understanding of dynamics on complex networks.
Global stabilization analysis of inertial memristive recurrent neural networks with discrete and distributed delays.

PubMed

Wang, Leimin; Zeng, Zhigang; Ge, Ming-Feng; Hu, Junhao

2018-05-02

This paper deals with the stabilization problem of memristive recurrent neural networks with inertial items, discrete delays, bounded and unbounded distributed delays. First, for inertial memristive recurrent neural networks (IMRNNs) with second-order derivatives of states, an appropriate variable substitution method is invoked to transfer IMRNNs into a first-order differential form. Then, based on nonsmooth analysis theory, several algebraic criteria are established for the global stabilizability of IMRNNs under proposed feedback control, where the cases with both bounded and unbounded distributed delays are successfully addressed. Finally, the theoretical results are illustrated via the numerical simulations. Copyright © 2018 Elsevier Ltd. All rights reserved.
Chimera states in complex networks: interplay of fractal topology and delay

NASA Astrophysics Data System (ADS)

Sawicki, Jakub; Omelchenko, Iryna; Zakharova, Anna; Schöll, Eckehard

2017-06-01

Chimera states are an example of intriguing partial synchronization patterns emerging in networks of identical oscillators. They consist of spatially coexisting domains of coherent (synchronized) and incoherent (desynchronized) dynamics. We analyze chimera states in networks of Van der Pol oscillators with hierarchical connectivities, and elaborate the role of time delay introduced in the coupling term. In the parameter plane of coupling strength and delay time we find tongue-like regions of existence of chimera states alternating with regions of existence of coherent travelling waves. We demonstrate that by varying the time delay one can deliberately stabilize desired spatio-temporal patterns in the system.
Deep roots delay flowering and relax the impact of floral traits and associated pollinators in steppe plants

PubMed Central

Berrached, Rachda; Kadik, Leila; Ait Mouheb, Hocine; Prinzing, Andreas

2017-01-01

Strong seasonality in abiotic harshness and pollinator availability shape the reproductive success of plants. Plant species can avoid or can tolerate harsh abiotic conditions and can attract different pollinators, but it remains unknown (i) which of these capacities is most important for flowering phenology, (ii) whether tolerance/avoidance of abiotic harshness reinforces or relaxes the phenological differentiation of species attracting different pollinators. We assembled possibly the first functional trait database for a North African steppe covering 104 species. We inferred avoidance of harshness (drought) from dormancy, i.e. annual life-span and seed size. We inferred tolerance or resistance to harshness from small specific leaf area, small stature, deep roots and high dry matter content. We inferred the type of pollinators attracted from floral colour, shape and depth. We found that avoidance traits did not affect flowering phenology, and among tolerance traits only deep roots had an effect by delaying flowering. Flower colour (red or purple), and occasionally flower depth, delayed flowering. Dish, gullet and flag shape accelerated flowering. Interactive effects however were at least as important, inversing the mentioned relationship between floral characters and flowering phenology. Specifically, among drought-tolerant deep-rooted species, flowering phenologies converged among floral types attracting different pollinators, without becoming less variable overall. Direct and interactive effects of root depth and floral traits explained at least 45% of the variance in flowering phenology. Also, conclusions on interactive effects were highly consistent with and without including information on family identity or outliers. Overall, roots and floral syndromes strongly control flowering phenology, while many other traits do not. Surprisingly, floral syndromes and the related pollinators appear to constrain phenology mainly in shallow-rooted, abiotically little tolerant species. Lack of abiotic tolerance might hence constrain accessible resources and thereby impose a stronger synchronization with biotic partners such as pollinators. PMID:28301580
Integration of transcriptomic and metabolic data reveals hub transcription factors involved in drought stress response in sunflower (Helianthus annuus L.).

PubMed

Moschen, Sebastián; Di Rienzo, Julio A; Higgins, Janet; Tohge, Takayuki; Watanabe, Mutsumi; González, Sergio; Rivarola, Máximo; García-García, Francisco; Dopazo, Joaquin; Hopp, H Esteban; Hoefgen, Rainer; Fernie, Alisdair R; Paniego, Norma; Fernández, Paula; Heinz, Ruth A

2017-07-01

By integration of transcriptional and metabolic profiles we identified pathways and hubs transcription factors regulated during drought conditions in sunflower, useful for applications in molecular and/or biotechnological breeding. Drought is one of the most important environmental stresses that effects crop productivity in many agricultural regions. Sunflower is tolerant to drought conditions but the mechanisms involved in this tolerance remain unclear at the molecular level. The aim of this study was to characterize and integrate transcriptional and metabolic pathways related to drought stress in sunflower plants, by using a system biology approach. Our results showed a delay in plant senescence with an increase in the expression level of photosynthesis related genes as well as higher levels of sugars, osmoprotectant amino acids and ionic nutrients under drought conditions. In addition, we identified transcription factors that were upregulated during drought conditions and that may act as hubs in the transcriptional network. Many of these transcription factors belong to families implicated in the drought response in model species. The integration of transcriptomic and metabolomic data in this study, together with physiological measurements, has improved our understanding of the biological responses during droughts and contributes to elucidate the molecular mechanisms involved under this environmental condition. These findings will provide useful biotechnological tools to improve stress tolerance while maintaining crop yield under restricted water availability.
Global robust stability of bidirectional associative memory neural networks with multiple time delays.

PubMed

Senan, Sibel; Arik, Sabri

2007-10-01

This correspondence presents a sufficient condition for the existence, uniqueness, and global robust asymptotic stability of the equilibrium point for bidirectional associative memory neural networks with discrete time delays. The results impose constraint conditions on the network parameters of the neural system independently of the delay parameter, and they are applicable to all bounded continuous nonmonotonic neuron activation functions. Some numerical examples are given to compare our results with the previous robust stability results derived in the literature.
Inhibition delay increases neural network capacity through Stirling transform.

PubMed

Nogaret, Alain; King, Alastair

2018-03-01

Inhibitory neural networks are found to encode high volumes of information through delayed inhibition. We show that inhibition delay increases storage capacity through a Stirling transform of the minimum capacity which stabilizes locally coherent oscillations. We obtain both the exact and asymptotic formulas for the total number of dynamic attractors. Our results predict a (ln2)^{-N}-fold increase in capacity for an N-neuron network and demonstrate high-density associative memories which host a maximum number of oscillations in analog neural devices.
Inhibition delay increases neural network capacity through Stirling transform

NASA Astrophysics Data System (ADS)

Nogaret, Alain; King, Alastair

2018-03-01

Inhibitory neural networks are found to encode high volumes of information through delayed inhibition. We show that inhibition delay increases storage capacity through a Stirling transform of the minimum capacity which stabilizes locally coherent oscillations. We obtain both the exact and asymptotic formulas for the total number of dynamic attractors. Our results predict a (ln2) -N-fold increase in capacity for an N -neuron network and demonstrate high-density associative memories which host a maximum number of oscillations in analog neural devices.
Time delay and long-range connection induced synchronization transitions in Newman-Watts small-world neuronal networks.

PubMed

Qian, Yu

2014-01-01

The synchronization transitions in Newman-Watts small-world neuronal networks (SWNNs) induced by time delay τ and long-range connection (LRC) probability P have been investigated by synchronization parameter and space-time plots. Four distinct parameter regions, that is, asynchronous region, transition region, synchronous region, and oscillatory region have been discovered at certain LRC probability P = 1.0 as time delay is increased. Interestingly, desynchronization is observed in oscillatory region. More importantly, we consider the spatiotemporal patterns obtained in delayed Newman-Watts SWNNs are the competition results between long-range drivings (LRDs) and neighboring interactions. In addition, for moderate time delay, the synchronization of neuronal network can be enhanced remarkably by increasing LRC probability. Furthermore, lag synchronization has been found between weak synchronization and complete synchronization as LRC probability P is a little less than 1.0. Finally, the two necessary conditions, moderate time delay and large numbers of LRCs, are exposed explicitly for synchronization in delayed Newman-Watts SWNNs.

Time Delay and Long-Range Connection Induced Synchronization Transitions in Newman-Watts Small-World Neuronal Networks

PubMed Central

Qian, Yu

2014-01-01

The synchronization transitions in Newman-Watts small-world neuronal networks (SWNNs) induced by time delay and long-range connection (LRC) probability have been investigated by synchronization parameter and space-time plots. Four distinct parameter regions, that is, asynchronous region, transition region, synchronous region, and oscillatory region have been discovered at certain LRC probability as time delay is increased. Interestingly, desynchronization is observed in oscillatory region. More importantly, we consider the spatiotemporal patterns obtained in delayed Newman-Watts SWNNs are the competition results between long-range drivings (LRDs) and neighboring interactions. In addition, for moderate time delay, the synchronization of neuronal network can be enhanced remarkably by increasing LRC probability. Furthermore, lag synchronization has been found between weak synchronization and complete synchronization as LRC probability is a little less than 1.0. Finally, the two necessary conditions, moderate time delay and large numbers of LRCs, are exposed explicitly for synchronization in delayed Newman-Watts SWNNs. PMID:24810595
Dimensionality of brain networks linked to life-long individual differences in self-control.

PubMed

Berman, Marc G; Yourganov, Grigori; Askren, Mary K; Ayduk, Ozlem; Casey, B J; Gotlib, Ian H; Kross, Ethan; McIntosh, Anthony R; Strother, Stephen; Wilson, Nicole L; Zayas, Vivian; Mischel, Walter; Shoda, Yuichi; Jonides, John

2013-01-01

The ability to delay gratification in childhood has been linked to positive outcomes in adolescence and adulthood. Here we examine a subsample of participants from a seminal longitudinal study of self-control throughout a subject's life span. Self-control, first studied in children at age 4 years, is now re-examined 40 years later, on a task that required control over the contents of working memory. We examine whether patterns of brain activation on this task can reliably distinguish participants with consistently low and high self-control abilities (low versus high delayers). We find that low delayers recruit significantly higher-dimensional neural networks when performing the task compared with high delayers. High delayers are also more homogeneous as a group in their neural patterns compared with low delayers. From these brain patterns, we can predict with 71% accuracy, whether a participant is a high or low delayer. The present results suggest that dimensionality of neural networks is a biological predictor of self-control abilities.
Stability analysis for discrete-time stochastic memristive neural networks with both leakage and probabilistic delays.

PubMed

Liu, Hongjian; Wang, Zidong; Shen, Bo; Huang, Tingwen; Alsaadi, Fuad E

2018-06-01

This paper is concerned with the globally exponential stability problem for a class of discrete-time stochastic memristive neural networks (DSMNNs) with both leakage delays as well as probabilistic time-varying delays. For the probabilistic delays, a sequence of Bernoulli distributed random variables is utilized to determine within which intervals the time-varying delays fall at certain time instant. The sector-bounded activation function is considered in the addressed DSMNN. By taking into account the state-dependent characteristics of the network parameters and choosing an appropriate Lyapunov-Krasovskii functional, some sufficient conditions are established under which the underlying DSMNN is globally exponentially stable in the mean square. The derived conditions are made dependent on both the leakage and the probabilistic delays, and are therefore less conservative than the traditional delay-independent criteria. A simulation example is given to show the effectiveness of the proposed stability criterion. Copyright © 2018 Elsevier Ltd. All rights reserved.
Toward heterogeneity in feedforward network with synaptic delays based on FitzHugh-Nagumo model

NASA Astrophysics Data System (ADS)

Qin, Ying-Mei; Men, Cong; Zhao, Jia; Han, Chun-Xiao; Che, Yan-Qiu

2018-01-01

We focus on the role of heterogeneity on the propagation of firing patterns in feedforward network (FFN). Effects of heterogeneities both in parameters of neuronal excitability and synaptic delays are investigated systematically. Neuronal heterogeneity is found to modulate firing rates and spiking regularity by changing the excitability of the network. Synaptic delays are strongly related with desynchronized and synchronized firing patterns of the FFN, which indicate that synaptic delays may play a significant role in bridging rate coding and temporal coding. Furthermore, quasi-coherence resonance (quasi-CR) phenomenon is observed in the parameter domain of connection probability and delay-heterogeneity. All these phenomena above enable a detailed characterization of neuronal heterogeneity in FFN, which may play an indispensable role in reproducing the important properties of in vivo experiments.
Bactericidal activity of OPC-67683 against drug-tolerant Mycobacterium tuberculosis.

PubMed

Saliu, Oluwabunmi Y; Crismale, Catina; Schwander, Stephan K; Wallis, Robert S

2007-11-01

There is an urgent need for drugs that hasten sterilization in tuberculosis; however, we presently lack indicators of this activity to guide early drug development. We previously described a novel in vitro assay to study mycobacterial phenotypic drug tolerance, in which sterilizing activity could be assessed. OPC-67,683 is a novel imidazooxazole that accelerates sterilization in the mouse tuberculosis model. The present study was conducted to determine the activity of OPC-67,683 in the in vitro tolerance model using drug-tolerant clinical Mycobacterium tuberculosis strains. Tolerance was assessed in Bactec radiometric culture as: (i) delayed decline in growth index during 14 days of drug exposure; (ii) shorter time to positivity of subcultures following drug exposure. Four isolates were selected from among 16 surveyed, based on delayed killing by isoniazid and OPC-67,683. Unlike isoniazid and rifampicin, whose rates of killing were concentration-independent, OPC-67,683 showed concentration-dependent effects that, at the highest dose levels tested (1.0 microg/mL), were superior to isoniazid and equal to rifampicin. The sterilizing activity of OPC-67683 against drug-tolerant M. tuberculosis in the Bactec model is consistent with its activity in mice. Further studies are warranted to examine the effects of OPC-67683 on mycobacterial persistence in tuberculous patients and to determine the biological basis of tolerance in the model.
Simultaneous learning of instantaneous and time-delayed genetic interactions using novel information theoretic scoring technique

PubMed Central

2012-01-01

Background Understanding gene interactions is a fundamental question in systems biology. Currently, modeling of gene regulations using the Bayesian Network (BN) formalism assumes that genes interact either instantaneously or with a certain amount of time delay. However in reality, biological regulations, both instantaneous and time-delayed, occur simultaneously. A framework that can detect and model both these two types of interactions simultaneously would represent gene regulatory networks more accurately. Results In this paper, we introduce a framework based on the Bayesian Network (BN) formalism that can represent both instantaneous and time-delayed interactions between genes simultaneously. A novel scoring metric having firm mathematical underpinnings is also proposed that, unlike other recent methods, can score both interactions concurrently and takes into account the reality that multiple regulators can regulate a gene jointly, rather than in an isolated pair-wise manner. Further, a gene regulatory network (GRN) inference method employing an evolutionary search that makes use of the framework and the scoring metric is also presented. Conclusion By taking into consideration the biological fact that both instantaneous and time-delayed regulations can occur among genes, our approach models gene interactions with greater accuracy. The proposed framework is efficient and can be used to infer gene networks having multiple orders of instantaneous and time-delayed regulations simultaneously. Experiments are carried out using three different synthetic networks (with three different mechanisms for generating synthetic data) as well as real life networks of Saccharomyces cerevisiae, E. coli and cyanobacteria gene expression data. The results show the effectiveness of our approach. PMID:22691450
76 FR 25240 - Clothianidin; Pesticide Tolerances

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-04

... neurotoxicity were exhibited in both rats (decreased arousal, motor activity and locomotor activity) and mice... (decreased body weight gains and absolute thymus weights in pups, delayed sexual maturation and an increase.../day FQPA SF = 1x day.. based on decreased body weight gains and delayed sexual maturation, decreased...
Robust stability of bidirectional associative memory neural networks with time delays

NASA Astrophysics Data System (ADS)

Park, Ju H.

2006-01-01

Based on the Lyapunov Krasovskii functionals combined with linear matrix inequality approach, a novel stability criterion is proposed for asymptotic stability of bidirectional associative memory neural networks with time delays. A novel delay-dependent stability criterion is given in terms of linear matrix inequalities, which can be solved easily by various optimization algorithms.
Decomposition of Rotor Hopfield Neural Networks Using Complex Numbers.

PubMed

Kobayashi, Masaki

2018-04-01

A complex-valued Hopfield neural network (CHNN) is a multistate model of a Hopfield neural network. It has the disadvantage of low noise tolerance. Meanwhile, a symmetric CHNN (SCHNN) is a modification of a CHNN that improves noise tolerance. Furthermore, a rotor Hopfield neural network (RHNN) is an extension of a CHNN. It has twice the storage capacity of CHNNs and SCHNNs, and much better noise tolerance than CHNNs, although it requires twice many connection parameters. In this brief, we investigate the relations between CHNN, SCHNN, and RHNN; an RHNN is uniquely decomposed into a CHNN and SCHNN. In addition, the Hebbian learning rule for RHNNs is decomposed into those for CHNNs and SCHNNs.
Synchronization of Reaction-Diffusion Neural Networks With Dirichlet Boundary Conditions and Infinite Delays.

PubMed

Sheng, Yin; Zhang, Hao; Zeng, Zhigang

2017-10-01

This paper is concerned with synchronization for a class of reaction-diffusion neural networks with Dirichlet boundary conditions and infinite discrete time-varying delays. By utilizing theories of partial differential equations, Green's formula, inequality techniques, and the concept of comparison, algebraic criteria are presented to guarantee master-slave synchronization of the underlying reaction-diffusion neural networks via a designed controller. Additionally, sufficient conditions on exponential synchronization of reaction-diffusion neural networks with finite time-varying delays are established. The proposed criteria herein enhance and generalize some published ones. Three numerical examples are presented to substantiate the validity and merits of the obtained theoretical results.
Exponential Stability of Almost Periodic Solutions for Memristor-Based Neural Networks with Distributed Leakage Delays.

PubMed

Xu, Changjin; Li, Peiluan; Pang, Yicheng

2016-12-01

In this letter, we deal with a class of memristor-based neural networks with distributed leakage delays. By applying a new Lyapunov function method, we obtain some sufficient conditions that ensure the existence, uniqueness, and global exponential stability of almost periodic solutions of neural networks. We apply the results of this solution to prove the existence and stability of periodic solutions for this delayed neural network with periodic coefficients. We then provide an example to illustrate the effectiveness of the theoretical results. Our results are completely new and complement the previous studies Chen, Zeng, and Jiang ( 2014 ) and Jiang, Zeng, and Chen ( 2015 ).
Generalized Projective Synchronization between Two Complex Networks with Time-Varying Coupling Delay

NASA Astrophysics Data System (ADS)

Sun, Mei; Zeng, Chang-Yan; Tian, Li-Xin

2009-01-01

Generalized projective synchronization (GPS) between two complex networks with time-varying coupling delay is investigated. Based on the Lyapunov stability theory, a nonlinear controller and adaptive updated laws are designed. Feasibility of the proposed scheme is proven in theory. Moreover, two numerical examples are presented, using the energy resource system and Lü's system [Physica A 382 (2007) 672] as the nodes of the networks. GPS between two energy resource complex networks with time-varying coupling delay is achieved. This study can widen the application range of the generalized synchronization methods and will be instructive for the demand-supply of energy resource in some regions of China.
On Extended Dissipativity of Discrete-Time Neural Networks With Time Delay.

PubMed

Feng, Zhiguang; Zheng, Wei Xing

2015-12-01

In this brief, the problem of extended dissipativity analysis for discrete-time neural networks with time-varying delay is investigated. The definition of extended dissipativity of discrete-time neural networks is proposed, which unifies several performance measures, such as the H∞ performance, passivity, l2 - l∞ performance, and dissipativity. By introducing a triple-summable term in Lyapunov function, the reciprocally convex approach is utilized to bound the forward difference of the triple-summable term and then the extended dissipativity criterion for discrete-time neural networks with time-varying delay is established. The derived condition guarantees not only the extended dissipativity but also the stability of the neural networks. Two numerical examples are given to demonstrate the reduced conservatism and effectiveness of the obtained results.
Wave-variable framework for networked robotic systems with time delays and packet losses

NASA Astrophysics Data System (ADS)

Puah, Seng-Ming; Liu, Yen-Chen

2017-05-01

This paper investigates the problem of networked control system for nonlinear robotic manipulators under time delays and packet loss by using passivity technique. With the utilisation of wave variables and a passive remote controller, the networked robotic system is demonstrated to be stable with guaranteed position regulation. For the input/output signals of robotic systems, a discretisation block is exploited to convert continuous-time signals to discrete-time signals, and vice versa. Subsequently, we propose a packet management, called wave-variable modulation, to cope with the proposed networked robotic system under time delays and packet losses. Numerical examples and experimental results are presented to demonstrate the performance of the proposed wave-variable-based networked robotic systems.
Development of a decentralized multi-axis synchronous control approach for real-time networks.

PubMed

Xu, Xiong; Gu, Guo-Ying; Xiong, Zhenhua; Sheng, Xinjun; Zhu, Xiangyang

2017-05-01

The message scheduling and the network-induced delays of real-time networks, together with the different inertias and disturbances in different axes, make the synchronous control of the real-time network-based systems quite challenging. To address this challenge, a decentralized multi-axis synchronous control approach is developed in this paper. Due to the limitations of message scheduling and network bandwidth, error of the position synchronization is firstly defined in the proposed control approach as a subset of preceding-axis pairs. Then, a motion message estimator is designed to reduce the effect of network delays. It is proven that position and synchronization errors asymptotically converge to zero in the proposed controller with the delay compensation. Finally, simulation and experimental results show that the developed control approach can achieve the good position synchronization performance for the multi-axis motion over the real-time network. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Reviving oscillations in coupled nonlinear oscillators.

PubMed

Zou, Wei; Senthilkumar, D V; Zhan, Meng; Kurths, Jürgen

2013-07-05

By introducing a processing delay in the coupling, we find that it can effectively annihilate the quenching of oscillation, amplitude death (AD), in a network of coupled oscillators by switching the stability of AD. It revives the oscillation in the AD regime to retain sustained rhythmic functioning of the networks, which is in sharp contrast to the propagation delay with the tendency to induce AD. This processing delay-induced phenomenon occurs both with and without the propagation delay. Further this effect is rather general from two coupled to networks of oscillators in all known scenarios that can exhibit AD, and it has a wide range of applications where sustained oscillations should be retained for proper functioning of the systems.
Impact of delays on the synchronization transitions of modular neuronal networks with hybrid synapses

NASA Astrophysics Data System (ADS)

Liu, Chen; Wang, Jiang; Yu, Haitao; Deng, Bin; Wei, Xile; Tsang, Kaiming; Chan, Wailok

2013-09-01

The combined effects of the information transmission delay and the ratio of the electrical and chemical synapses on the synchronization transitions in the hybrid modular neuronal network are investigated in this paper. Numerical results show that the synchronization of neuron activities can be either promoted or destroyed as the information transmission delay increases, irrespective of the probability of electrical synapses in the hybrid-synaptic network. Interestingly, when the number of the electrical synapses exceeds a certain level, further increasing its proportion can obviously enhance the spatiotemporal synchronization transitions. Moreover, the coupling strength has a significant effect on the synchronization transition. The dominated type of the synapse always has a more profound effect on the emergency of the synchronous behaviors. Furthermore, the results of the modular neuronal network structures demonstrate that excessive partitioning of the modular network may result in the dramatic detriment of neuronal synchronization. Considering that information transmission delays are inevitable in intra- and inter-neuronal networks communication, the obtained results may have important implications for the exploration of the synchronization mechanism underlying several neural system diseases such as Parkinson's Disease.
Providing Alternative Reinforcers to Facilitate Tolerance to Delayed Reinforcement Following Functional Communication Training

ERIC Educational Resources Information Center

Austin, Jillian E.; Tiger, Jeffrey H.

2015-01-01

The earliest stages of functional communication training (FCT) involve providing immediate and continuous reinforcement for a communicative response (FCR) that is functionally equivalent to the targeted problem behavior. However, maintaining immediate reinforcement is not practical, and the introduction of delays is associated with increased…
Robust Routing Protocol For Digital Messages

NASA Technical Reports Server (NTRS)

Marvit, Maclen

1994-01-01

Refinement of ditigal-message-routing protocol increases fault tolerance of polled networks. AbNET-3 is latest of generic AbNET protocols for transmission of messages among computing nodes. AbNET concept described in "Multiple-Ring Digital Communication Network" (NPO-18133). Specifically aimed at increasing fault tolerance of network in broadcast mode, in which one node broadcasts message to and receives responses from all other nodes. Communication in network of computers maintained even when links fail.
Neural network topology in ADHD; evidence for maturational delay and default-mode network alterations.

PubMed

Janssen, T W P; Hillebrand, A; Gouw, A; Geladé, K; Van Mourik, R; Maras, A; Oosterlaan, J

2017-11-01

Attention-deficit/hyperactivity disorder (ADHD) has been associated with widespread brain abnormalities in white and grey matter, affecting not only local, but global functional networks as well. In this study, we explored these functional networks using source-reconstructed electroencephalography in ADHD and typically developing (TD) children. We expected evidence for maturational delay, with underlying abnormalities in the default mode network. Electroencephalograms were recorded in ADHD (n=42) and TD (n=43) during rest, and functional connectivity (phase lag index) and graph (minimum spanning tree) parameters were derived. Dependent variables were global and local network metrics in theta, alpha and beta bands. We found evidence for a more centralized functional network in ADHD compared to TD children, with decreased diameter in the alpha band (η p 2 =0.06) and increased leaf fraction (η p 2 =0.11 and 0.08) in the alpha and beta bands, with underlying abnormalities in hub regions of the brain, including default mode network. The finding of a more centralized network is in line with maturational delay models of ADHD and should be replicated in longitudinal designs. This study contributes to the literature by combining high temporal and spatial resolution to construct EEG network topology, and associates maturational-delay and default-mode interference hypotheses of ADHD. Copyright © 2017 International Federation of Clinical Neurophysiology. Published by Elsevier B.V. All rights reserved.

Hierarchical Type Stability Criteria for Delayed Neural Networks via Canonical Bessel-Legendre Inequalities.

PubMed

Zhang, Xian-Ming; Han, Qing-Long; Zeng, Zhigang

2018-05-01

This paper is concerned with global asymptotic stability of delayed neural networks. Notice that a Bessel-Legendre inequality plays a key role in deriving less conservative stability criteria for delayed neural networks. However, this inequality is in the form of Legendre polynomials and the integral interval is fixed on . As a result, the application scope of the Bessel-Legendre inequality is limited. This paper aims to develop the Bessel-Legendre inequality method so that less conservative stability criteria are expected. First, by introducing a canonical orthogonal polynomial sequel, a canonical Bessel-Legendre inequality and its affine version are established, which are not explicitly in the form of Legendre polynomials. Moreover, the integral interval is shifted to a general one . Second, by introducing a proper augmented Lyapunov-Krasovskii functional, which is tailored for the canonical Bessel-Legendre inequality, some sufficient conditions on global asymptotic stability are formulated for neural networks with constant delays and neural networks with time-varying delays, respectively. These conditions are proven to have a hierarchical feature: the higher level of hierarchy, the less conservatism of the stability criterion. Finally, three numerical examples are given to illustrate the efficiency of the proposed stability criteria.
Delay-induced Turing-like waves for one-species reaction-diffusion model on a network

NASA Astrophysics Data System (ADS)

Petit, Julien; Carletti, Timoteo; Asllani, Malbor; Fanelli, Duccio

2015-09-01

A one-species time-delay reaction-diffusion system defined on a complex network is studied. Traveling waves are predicted to occur following a symmetry-breaking instability of a homogeneous stationary stable solution, subject to an external nonhomogeneous perturbation. These are generalized Turing-like waves that materialize in a single-species populations dynamics model, as the unexpected byproduct of the imposed delay in the diffusion part. Sufficient conditions for the onset of the instability are mathematically provided by performing a linear stability analysis adapted to time-delayed differential equations. The method here developed exploits the properties of the Lambert W-function. The prediction of the theory are confirmed by direct numerical simulation carried out for a modified version of the classical Fisher model, defined on a Watts-Strogatz network and with the inclusion of the delay.
Robust output feedback H∞ control for networked control systems based on the occurrence probabilities of time delays

NASA Astrophysics Data System (ADS)

Guo, Chenyu; Zhang, Weidong; Bao, Jie

2012-02-01

This article is concerned with the problem of robust H ∞ output feedback control for a kind of networked control systems with time-varying network-induced delays. Instead of using boundaries of time delays to represent all time delays, the occurrence probability of each time delay is considered in H∞ stability analysis and stabilisation. The problem addressed is the design of an output feedback controller such that, for all admissible uncertainties, the resulting closed-loop system is stochastically stable for the zero disturbance input and also simultaneously achieves a prescribed H∞ performance level. It is shown that less conservativeness is obtained. A set of linear matrix inequalities is given to solve the corresponding controller design problem. An example is provided to show the effectiveness and applicability of the proposed method.
Global Hopf bifurcation analysis on a BAM neural network with delays

NASA Astrophysics Data System (ADS)

Sun, Chengjun; Han, Maoan; Pang, Xiaoming

2007-01-01

A delayed differential equation that models a bidirectional associative memory (BAM) neural network with four neurons is considered. By using a global Hopf bifurcation theorem for FDE and a Bendixon's criterion for high-dimensional ODE, a group of sufficient conditions for the system to have multiple periodic solutions are obtained when the sum of delays is sufficiently large.
CCS-DTN: clustering and network coding-based efficient routing in social DTNs.

PubMed

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2014-12-25

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs.
Considerations for an Earth Relay Satellite with RF and Optical Trunklines

NASA Technical Reports Server (NTRS)

Israel, David J.

2016-01-01

Support for user platforms through the use of optical links to geosynchronous relay spacecraft are expected to be part of the future space communications architecture. The European Data Relay Satellite System (EDRS) has its first node, EDRS-A, in orbit. The EDRS architecture includes space-to-space optical links with a Ka-Band feeder link or trunkline. NASA's Laser Communications Relay Demonstration (LCRD) mission, originally baselined to support a space-to-space optical link relayed with an optical trunkline, has added an Radio Frequency (RF) trunkline. The use of an RF trunkline avoids the outages suffered by an optical trunkline due to clouds, but an RF trunkline will be bandwidth limited. A space relay architecture with both RF and optical trunklines could relay critical realtime data, while also providing a high data volume capacity. This paper considers the relay user scenarios that could be supported, and the implications to the space relay system and operations. System trades such as the amount of onboard processing and storage required, the use of link layer switching vs. network layer routing, and the use of Delay/Disruption Tolerant Networking (DTN) are discussed.
CCS-DTN: Clustering and Network Coding-Based Efficient Routing in Social DTNs

PubMed Central

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2015-01-01

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs. PMID:25609047
Digital Motion Imagery, Interoperability Challenges for Space Operations

NASA Technical Reports Server (NTRS)

Grubbs, Rodney

2012-01-01

With advances in available bandwidth from spacecraft and between terrestrial control centers, digital motion imagery and video is becoming more practical as a data gathering tool for science and engineering, as well as for sharing missions with the public. The digital motion imagery and video industry has done a good job of creating standards for compression, distribution, and physical interfaces. Compressed data streams can easily be transmitted or distributed over radio frequency, internet protocol, and other data networks. All of these standards, however, can make sharing video between spacecraft and terrestrial control centers a frustrating and complicated task when different standards and protocols are used by different agencies. This paper will explore the challenges presented by the abundance of motion imagery and video standards, interfaces and protocols with suggestions for common formats that could simplify interoperability between spacecraft and ground support systems. Real-world examples from the International Space Station will be examined. The paper will also discuss recent trends in the development of new video compression algorithms, as well likely expanded use of Delay (or Disruption) Tolerant Networking nodes.
Finite-time hybrid projective synchronization of the drive-response complex networks with distributed-delay via adaptive intermittent control

NASA Astrophysics Data System (ADS)

Cheng, Lin; Yang, Yongqing; Li, Li; Sui, Xin

2018-06-01

This paper studies the finite-time hybrid projective synchronization of the drive-response complex networks. In the model, general transmission delays and distributed delays are also considered. By designing the adaptive intermittent controllers, the response network can achieve hybrid projective synchronization with the drive system in finite time. Based on finite-time stability theory and several differential inequalities, some simple finite-time hybrid projective synchronization criteria are derived. Two numerical examples are given to illustrate the effectiveness of the proposed method.
Delay-Dependent Stability Criterion for Bidirectional Associative Memory Neural Networks with Interval Time-Varying Delays

NASA Astrophysics Data System (ADS)

Park, Ju H.; Kwon, O. M.

In the letter, the global asymptotic stability of bidirectional associative memory (BAM) neural networks with delays is investigated. The delay is assumed to be time-varying and belongs to a given interval. A novel stability criterion for the stability is presented based on the Lyapunov method. The criterion is represented in terms of linear matrix inequality (LMI), which can be solved easily by various optimization algorithms. Two numerical examples are illustrated to show the effectiveness of our new result.
Message Efficient Checkpointing and Rollback Recovery in Heterogeneous Mobile Networks

NASA Astrophysics Data System (ADS)

Jaggi, Parmeet Kaur; Singh, Awadhesh Kumar

2016-06-01

Heterogeneous networks provide an appealing way of expanding the computing capability of mobile networks by combining infrastructure-less mobile ad-hoc networks with the infrastructure-based cellular mobile networks. The nodes in such a network range from low-power nodes to macro base stations and thus, vary greatly in their capabilities such as computation power and battery power. The nodes are susceptible to different types of transient and permanent failures and therefore, the algorithms designed for such networks need to be fault-tolerant. The article presents a checkpointing algorithm for the rollback recovery of mobile hosts in a heterogeneous mobile network. Checkpointing is a well established approach to provide fault tolerance in static and cellular mobile distributed systems. However, the use of checkpointing for fault tolerance in a heterogeneous environment remains to be explored. The proposed protocol is based on the results of zigzag paths and zigzag cycles by Netzer-Xu. Considering the heterogeneity prevalent in the network, an uncoordinated checkpointing technique is employed. Yet, useless checkpoints are avoided without causing a high message overhead.
Delay-induced cluster patterns in coupled Cayley tree networks

NASA Astrophysics Data System (ADS)

Singh, A.; Jalan, S.

2013-07-01

We study effects of delay in diffusively coupled logistic maps on the Cayley tree networks. We find that smaller coupling values exhibit sensitiveness to value of delay, and lead to different cluster patterns of self-organized and driven types. Whereas larger coupling strengths exhibit robustness against change in delay values, and lead to stable driven clusters comprising nodes from last generation of the Cayley tree. Furthermore, introduction of delay exhibits suppression as well as enhancement of synchronization depending upon coupling strength values. To the end we discuss the importance of results to understand conflicts and cooperations observed in family business.
Tolerance of an Antarctic Bacterium to Multiple Environmental Stressors.

PubMed

Sengupta, Dipanwita; Sangu, Kavya; Shivaji, Sisinthy; Chattopadhyay, Madhab K

2015-10-01

A population of cold-tolerant Antarctic bacteria was screened for their ability to tolerate other environmental stress factors. Besides low temperature, they were predominantly found to be tolerant to alkali. Attempt was also made to postulate a genetic basis of their multistress-tolerance. Transposon mutagenesis of an isolate Pseudomonas syringae Lz4W was performed, and mutants with delayed growth at low temperature were further screened for sensitivity to some other stress factors. A number of multistress-sensitive mutants were isolated. The mutated gene in one of the mutants sensitive to low temperature, acid and alkali was found to encode citrate synthase. Possible role of citrate synthase in conferring multistress-tolerance was postulated.
An Effective Delay Reduction Approach through a Portion of Nodes with a Larger Duty Cycle for Industrial WSNs

PubMed Central

Wu, Minrui; Wu, Yanhui; Liu, Chuyao; Cai, Zhiping; Ma, Ming

2018-01-01

For Industrial Wireless Sensor Networks (IWSNs), sending data with timely style to the stink (or control center, CC) that is monitored by sensor nodes is a challenging issue. However, in order to save energy, wireless sensor networks based on a duty cycle are widely used in the industrial field, which can bring great delay to data transmission. We observe that if the duty cycle of a small number of nodes in the network is set to 1, the sleep delay caused by the duty cycle can be effectively reduced. Thus, in this paper, a novel Portion of Nodes with Larger Duty Cycle (PNLDC) scheme is proposed to reduce delay and optimize energy efficiency for IWSNs. In the PNLDC scheme, a portion of nodes are selected to set their duty cycle to 1, and the proportion of nodes with the duty cycle of 1 is determined according to the energy abundance of the area in which the node is located. The more the residual energy in the region, the greater the proportion of the selected nodes. Because there are a certain proportion of nodes with the duty cycle of 1 in the network, the PNLDC scheme can effectively reduce delay in IWSNs. The performance analysis and experimental results show that the proposed scheme significantly reduces the delay for forwarding data by 8.9~26.4% and delay for detection by 2.1~24.6% without reducing the network lifetime when compared with the fixed duty cycle method. Meanwhile, compared with the dynamic duty cycle strategy, the proposed scheme has certain advantages in terms of energy utilization and delay reduction. PMID:29757236
An Effective Delay Reduction Approach through a Portion of Nodes with a Larger Duty Cycle for Industrial WSNs.

PubMed

Wu, Minrui; Wu, Yanhui; Liu, Chuyao; Cai, Zhiping; Xiong, Neal N; Liu, Anfeng; Ma, Ming

2018-05-12

For Industrial Wireless Sensor Networks (IWSNs), sending data with timely style to the stink (or control center, CC) that is monitored by sensor nodes is a challenging issue. However, in order to save energy, wireless sensor networks based on a duty cycle are widely used in the industrial field, which can bring great delay to data transmission. We observe that if the duty cycle of a small number of nodes in the network is set to 1, the sleep delay caused by the duty cycle can be effectively reduced. Thus, in this paper, a novel Portion of Nodes with Larger Duty Cycle (PNLDC) scheme is proposed to reduce delay and optimize energy efficiency for IWSNs. In the PNLDC scheme, a portion of nodes are selected to set their duty cycle to 1, and the proportion of nodes with the duty cycle of 1 is determined according to the energy abundance of the area in which the node is located. The more the residual energy in the region, the greater the proportion of the selected nodes. Because there are a certain proportion of nodes with the duty cycle of 1 in the network, the PNLDC scheme can effectively reduce delay in IWSNs. The performance analysis and experimental results show that the proposed scheme significantly reduces the delay for forwarding data by 8.9~26.4% and delay for detection by 2.1~24.6% without reducing the network lifetime when compared with the fixed duty cycle method. Meanwhile, compared with the dynamic duty cycle strategy, the proposed scheme has certain advantages in terms of energy utilization and delay reduction.
NASA Tech Briefs, January 2004

NASA Technical Reports Server (NTRS)

2004-01-01

Topics covered include: Multisensor Instrument for Real-Time Biological Monitoring; Sensor for Monitoring Nanodevice-Fabrication Plasmas; Backed Bending Actuator; Compact Optoelectronic Compass; Micro Sun Sensor for Spacecraft; Passive IFF: Autonomous Nonintrusive Rapid Identification of Friendly Assets; Finned-Ladder Slow-Wave Circuit for a TWT; Directional Radio-Frequency Identification Tag Reader; Integrated Solar-Energy-Harvesting and -Storage Device; Event-Driven Random-Access-Windowing CCD Imaging System; Stroboscope Controller for Imaging Helicopter Rotors; Software for Checking State-charts; Program Predicts Broadband Noise from a Turbofan Engine; Protocol for a Delay-Tolerant Data-Communication Network; Software Implements a Space-Mission File-Transfer Protocol; Making Carbon-Nanotube Arrays Using Block Copolymers: Part 2; Modular Rake of Pitot Probes; Preloading To Accelerate Slow-Crack-Growth Testing; Miniature Blimps for Surveillance and Collection of Samples; Hybrid Automotive Engine Using Ethanol-Burning Miller Cycle; Fabricating Blazed Diffraction Gratings by X-Ray Lithography; Freeze-Tolerant Condensers; The StarLight Space Interferometer; Champagne Heat Pump; Controllable Sonar Lenses and Prisms Based on ERFs; Measuring Gravitation Using Polarization Spectroscopy; Serial-Turbo-Trellis-Coded Modulation with Rate-1 Inner Code; Enhanced Software for Scheduling Space-Shuttle Processing; Bayesian-Augmented Identification of Stars in a Narrow View; Spacecraft Orbits for Earth/Mars-Lander Radio Relay; and Self-Inflatable/Self-Rigidizable Reflectarray Antenna.
DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D.; Lohmann, Johannes

Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delaysmore » between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.« less
Modeling of workflow-engaged networks on radiology transfers across a metro network.

PubMed

Camorlinga, Sergio; Schofield, Bruce

2006-04-01

Radiology metro networks bear the challenging proposition of interconnecting several hospitals in a region to provide a comprehensive diagnostic imaging service. Consequences of a poorly designed and implemented metro network could cause delays or no access at all when health care providers try to retrieve medical cases across the network. This could translate into limited diagnostic services to patients, resulting in negative impacts to the patients' medical treatment. A workflow-engaged network (WEN) is a new network paradigm. A WEN appreciates radiology workflows and priorities in using the network. A WEN greatly improves the network performance by guaranteeing that critical image transfers experience minimal delay. It adjusts network settings to ensure the application's requirements are met. This means that high-priority image transfers will have guaranteed and known delay times, whereas lower-priority traffic will have increased delays. This paper introduces a modeling to understand the benefits that WEN brings to a radiology metro network. The modeling uses actual data patterns and flows found in a hospital metro region. The workflows considered are based on the Integrating the Healthcare Enterprise profiles. This modeling has been applied to metropolitan workflows of a health region. The modeling helps identify the kind of metro network that supports data patterns and flows in a metro area. The results of the modeling show that a 155-Mb/s metropolitan area network (MAN) with WEN operates virtually equal to a normal 622-Mb/s MAN without WEN, with potential cost savings for leased line services measured in the millions of dollars per year.
Analysis of adaptive algorithms for an integrated communication network

NASA Technical Reports Server (NTRS)

Reed, Daniel A.; Barr, Matthew; Chong-Kwon, Kim

1985-01-01

Techniques were examined that trade communication bandwidth for decreased transmission delays. When the network is lightly used, these schemes attempt to use additional network resources to decrease communication delays. As the network utilization rises, the schemes degrade gracefully, still providing service but with minimal use of the network. Because the schemes use a combination of circuit and packet switching, they should respond to variations in the types and amounts of network traffic. Also, a combination of circuit and packet switching to support the widely varying traffic demands imposed on an integrated network was investigated. The packet switched component is best suited to bursty traffic where some delays in delivery are acceptable. The circuit switched component is reserved for traffic that must meet real time constraints. Selected packet routing algorithms that might be used in an integrated network were simulated. An integrated traffic places widely varying workload demands on a network. Adaptive algorithms were identified, ones that respond to both the transient and evolutionary changes that arise in integrated networks. A new algorithm was developed, hybrid weighted routing, that adapts to workload changes.
Social choice for one: On the rationality of intertemporal decisions.

PubMed

Paglieri, Fabio

2016-06-01

When faced with an intertemporal choice between a smaller short-term reward and a larger long-term prize, is opting for the latter always indicative of delay tolerance? And is delay tolerance always to be regarded as a manifestation of self-control, and thus as a rational solution to intertemporal dilemmas? I argue in favor of a negative answer to both questions, based on evidence collected in the delay discounting literature. This highlights the need for a nuanced understanding of rationality in intertemporal choice, to capture also situations in which waiting is not the optimal strategy. This paper suggests that such an understanding is fostered by adopting social choice theory as a promising framework to model intertemporal decision making. Some preliminary results of this approach are discussed, and its potential is compared with a much more studied formal model for intertemporal choice, i.e. game theory. Copyright © 2016 Elsevier B.V. All rights reserved.

Symmetry, Hopf bifurcation, and the emergence of cluster solutions in time delayed neural networks.

PubMed

Wang, Zhen; Campbell, Sue Ann

2017-11-01

We consider the networks of N identical oscillators with time delayed, global circulant coupling, modeled by a system of delay differential equations with Z N symmetry. We first study the existence of Hopf bifurcations induced by the coupling time delay and then use symmetric Hopf bifurcation theory to determine how these bifurcations lead to different patterns of symmetric cluster oscillations. We apply our results to a case study: a network of FitzHugh-Nagumo neurons with diffusive coupling. For this model, we derive the asymptotic stability, global asymptotic stability, absolute instability, and stability switches of the equilibrium point in the plane of coupling time delay (τ) and excitability parameter (a). We investigate the patterns of cluster oscillations induced by the time delay and determine the direction and stability of the bifurcating periodic orbits by employing the multiple timescales method and normal form theory. We find that in the region where stability switching occurs, the dynamics of the system can be switched from the equilibrium point to any symmetric cluster oscillation, and back to equilibrium point as the time delay is increased.
Collective motion patterns of swarms with delay coupling: Theory and experiment.

PubMed

Szwaykowska, Klementyna; Schwartz, Ira B; Mier-Y-Teran Romero, Luis; Heckman, Christoffer R; Mox, Dan; Hsieh, M Ani

2016-03-01

The formation of coherent patterns in swarms of interacting self-propelled autonomous agents is a subject of great interest in a wide range of application areas, ranging from engineering and physics to biology. In this paper, we model and experimentally realize a mixed-reality large-scale swarm of delay-coupled agents. The coupling term is modeled as a delayed communication relay of position. Our analyses, assuming agents communicating over an Erdös-Renyi network, demonstrate the existence of stable coherent patterns that can be achieved only with delay coupling and that are robust to decreasing network connectivity and heterogeneity in agent dynamics. We also show how the bifurcation structure for emergence of different patterns changes with heterogeneity in agent acceleration capabilities and limited connectivity in the network as a function of coupling strength and delay. Our results are verified through simulation as well as preliminary experimental results of delay-induced pattern formation in a mixed-reality swarm.
Synchronization of generalized reaction-diffusion neural networks with time-varying delays based on general integral inequalities and sampled-data control approach.

PubMed

Dharani, S; Rakkiyappan, R; Cao, Jinde; Alsaedi, Ahmed

2017-08-01

This paper explores the problem of synchronization of a class of generalized reaction-diffusion neural networks with mixed time-varying delays. The mixed time-varying delays under consideration comprise of both discrete and distributed delays. Due to the development and merits of digital controllers, sampled-data control is a natural choice to establish synchronization in continuous-time systems. Using a newly introduced integral inequality, less conservative synchronization criteria that assure the global asymptotic synchronization of the considered generalized reaction-diffusion neural network and mixed delays are established in terms of linear matrix inequalities (LMIs). The obtained easy-to-test LMI-based synchronization criteria depends on the delay bounds in addition to the reaction-diffusion terms, which is more practicable. Upon solving these LMIs by using Matlab LMI control toolbox, a desired sampled-data controller gain can be acuqired without any difficulty. Finally, numerical examples are exploited to express the validity of the derived LMI-based synchronization criteria.
Collective motion patterns of swarms with delay coupling: Theory and experiment

NASA Astrophysics Data System (ADS)

Szwaykowska, Klementyna; Schwartz, Ira B.; Mier-y-Teran Romero, Luis; Heckman, Christoffer R.; Mox, Dan; Hsieh, M. Ani

2016-03-01

The formation of coherent patterns in swarms of interacting self-propelled autonomous agents is a subject of great interest in a wide range of application areas, ranging from engineering and physics to biology. In this paper, we model and experimentally realize a mixed-reality large-scale swarm of delay-coupled agents. The coupling term is modeled as a delayed communication relay of position. Our analyses, assuming agents communicating over an Erdös-Renyi network, demonstrate the existence of stable coherent patterns that can be achieved only with delay coupling and that are robust to decreasing network connectivity and heterogeneity in agent dynamics. We also show how the bifurcation structure for emergence of different patterns changes with heterogeneity in agent acceleration capabilities and limited connectivity in the network as a function of coupling strength and delay. Our results are verified through simulation as well as preliminary experimental results of delay-induced pattern formation in a mixed-reality swarm.
Impulsive synchronization of stochastic reaction-diffusion neural networks with mixed time delays.

PubMed

Sheng, Yin; Zeng, Zhigang

2018-07-01

This paper discusses impulsive synchronization of stochastic reaction-diffusion neural networks with Dirichlet boundary conditions and hybrid time delays. By virtue of inequality techniques, theories of stochastic analysis, linear matrix inequalities, and the contradiction method, sufficient criteria are proposed to ensure exponential synchronization of the addressed stochastic reaction-diffusion neural networks with mixed time delays via a designed impulsive controller. Compared with some recent studies, the neural network models herein are more general, some restrictions are relaxed, and the obtained conditions enhance and generalize some published ones. Finally, two numerical simulations are performed to substantiate the validity and merits of the developed theoretical analysis. Copyright © 2018 Elsevier Ltd. All rights reserved.
Global exponential stability for switched memristive neural networks with time-varying delays.

PubMed

Xin, Youming; Li, Yuxia; Cheng, Zunshui; Huang, Xia

2016-08-01

This paper considers the problem of exponential stability for switched memristive neural networks (MNNs) with time-varying delays. Different from most of the existing papers, we model a memristor as a continuous system, and view switched MNNs as switched neural networks with uncertain time-varying parameters. Based on average dwell time technique, mode-dependent average dwell time technique and multiple Lyapunov-Krasovskii functional approach, two conditions are derived to design the switching signal and guarantee the exponential stability of the considered neural networks, which are delay-dependent and formulated by linear matrix inequalities (LMIs). Finally, the effectiveness of the theoretical results is demonstrated by two numerical examples. Copyright © 2016 Elsevier Ltd. All rights reserved.
Dhurrin content relates to sorghum [sorghum bicolor (L.) Moench] seedling growth in marginal soils

USDA-ARS?s Scientific Manuscript database

Dhurrin content in leaves of mature sorghum plant is a quantitative measure of the level of pre-and postflowering drought tolerance (Burke et al., 2013). Postflowering drought tolerance in sorghum is linked to the staygreen (delayed senescence) trait (Howarth, 2000; Rosenow et al., 1977) which has ...
Dhurrin content relates to sorghum (Sorghum bicolor (L) Moench) seedling growth in marginal soils.

USDA-ARS?s Scientific Manuscript database

Dhurrin content in leaves of mature sorghum plant is a quantitative measure of the level of pre-and postflowering drought tolerance (Burke et al., 2013). Postflowering drought tolerance in sorghum is linked to the staygreen (delayed senescence) trait (Howarth, 2000; Rosenow et al., 1977) which has b...
Measuring Information-Transfer Delays

PubMed Central

Wibral, Michael; Pampu, Nicolae; Priesemann, Viola; Siebenhühner, Felix; Seiwert, Hannes; Lindner, Michael; Lizier, Joseph T.; Vicente, Raul

2013-01-01

In complex networks such as gene networks, traffic systems or brain circuits it is important to understand how long it takes for the different parts of the network to effectively influence one another. In the brain, for example, axonal delays between brain areas can amount to several tens of milliseconds, adding an intrinsic component to any timing-based processing of information. Inferring neural interaction delays is thus needed to interpret the information transfer revealed by any analysis of directed interactions across brain structures. However, a robust estimation of interaction delays from neural activity faces several challenges if modeling assumptions on interaction mechanisms are wrong or cannot be made. Here, we propose a robust estimator for neuronal interaction delays rooted in an information-theoretic framework, which allows a model-free exploration of interactions. In particular, we extend transfer entropy to account for delayed source-target interactions, while crucially retaining the conditioning on the embedded target state at the immediately previous time step. We prove that this particular extension is indeed guaranteed to identify interaction delays between two coupled systems and is the only relevant option in keeping with Wiener’s principle of causality. We demonstrate the performance of our approach in detecting interaction delays on finite data by numerical simulations of stochastic and deterministic processes, as well as on local field potential recordings. We also show the ability of the extended transfer entropy to detect the presence of multiple delays, as well as feedback loops. While evaluated on neuroscience data, we expect the estimator to be useful in other fields dealing with network dynamics. PMID:23468850
Neural node network and model, and method of teaching same

DOEpatents

Parlos, A.G.; Atiya, A.F.; Fernandez, B.; Tsai, W.K.; Chong, K.T.

1995-12-26

The present invention is a fully connected feed forward network that includes at least one hidden layer. The hidden layer includes nodes in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device occurring in the feedback path (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit from all the other nodes within the same layer. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing. 21 figs.
Organization of Anti-Phase Synchronization Pattern in Neural Networks: What are the Key Factors?

PubMed Central

Li, Dong; Zhou, Changsong

2011-01-01

Anti-phase oscillation has been widely observed in cortical neural network. Elucidating the mechanism underlying the organization of anti-phase pattern is of significance for better understanding more complicated pattern formations in brain networks. In dynamical systems theory, the organization of anti-phase oscillation pattern has usually been considered to relate to time delay in coupling. This is consistent to conduction delays in real neural networks in the brain due to finite propagation velocity of action potentials. However, other structural factors in cortical neural network, such as modular organization (connection density) and the coupling types (excitatory or inhibitory), could also play an important role. In this work, we investigate the anti-phase oscillation pattern organized on a two-module network of either neuronal cell model or neural mass model, and analyze the impact of the conduction delay times, the connection densities, and coupling types. Our results show that delay times and coupling types can play key roles in this organization. The connection densities may have an influence on the stability if an anti-phase pattern exists due to the other factors. Furthermore, we show that anti-phase synchronization of slow oscillations can be achieved with small delay times if there is interaction between slow and fast oscillations. These results are significant for further understanding more realistic spatiotemporal dynamics of cortico-cortical communications. PMID:22232576
Neural node network and model, and method of teaching same

DOEpatents

Parlos, Alexander G.; Atiya, Amir F.; Fernandez, Benito; Tsai, Wei K.; Chong, Kil T.

1995-01-01

The present invention is a fully connected feed forward network that includes at least one hidden layer 16. The hidden layer 16 includes nodes 20 in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device 24 occurring in the feedback path 22 (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit 36 from all the other nodes within the same layer 16. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing.
Finite-time stability of neutral-type neural networks with random time-varying delays

NASA Astrophysics Data System (ADS)

Ali, M. Syed; Saravanan, S.; Zhu, Quanxin

2017-11-01

This paper is devoted to the finite-time stability analysis of neutral-type neural networks with random time-varying delays. The randomly time-varying delays are characterised by Bernoulli stochastic variable. This result can be extended to analysis and design for neutral-type neural networks with random time-varying delays. On the basis of this paper, we constructed suitable Lyapunov-Krasovskii functional together and established a set of sufficient linear matrix inequalities approach to guarantee the finite-time stability of the system concerned. By employing the Jensen's inequality, free-weighting matrix method and Wirtinger's double integral inequality, the proposed conditions are derived and two numerical examples are addressed for the effectiveness of the developed techniques.
Synchronization of fractional-order complex-valued neural networks with time delay.

PubMed

Bao, Haibo; Park, Ju H; Cao, Jinde

2016-09-01

This paper deals with the problem of synchronization of fractional-order complex-valued neural networks with time delays. By means of linear delay feedback control and a fractional-order inequality, sufficient conditions are obtained to guarantee the synchronization of the drive-response systems. Numerical simulations are provided to show the effectiveness of the obtained results. Copyright © 2016 Elsevier Ltd. All rights reserved.
Effects of ionizing radiation on embryos of the tardigrade Milnesium cf. tardigradum at different stages of development.

PubMed

Beltrán-Pardo, Eliana; Jönsson, K Ingemar; Wojcik, Andrzej; Haghdoost, Siamak; Harms-Ringdahl, Mats; Bermúdez-Cruz, Rosa M; Bernal Villegas, Jaime E

2013-01-01

Tardigrades represent one of the most desiccation and radiation tolerant animals on Earth, and several studies have documented their tolerance in the adult stage. Studies on tolerance during embryological stages are rare, but differential effects of desiccation and freezing on different developmental stages have been reported, as well as dose-dependent effect of gamma irradiation on tardigrade embryos. Here, we report a study evaluating the tolerance of eggs from the eutardigrade Milnesium cf. tardigradum to three doses of gamma radiation (50, 200 and 500 Gy) at the early, middle, and late stage of development. We found that embryos of the middle and late developmental stages were tolerant to all doses, while eggs in the early developmental stage were tolerant only to a dose of 50 Gy, and showed a declining survival with higher dose. We also observed a delay in development of irradiated eggs, suggesting that periods of DNA repair might have taken place after irradiation induced damage. The delay was independent of dose for eggs irradiated in the middle and late stage, possibly indicating a fixed developmental schedule for repair after induced damage. These results show that the tolerance to radiation in tardigrade eggs changes in the course of their development. The mechanisms behind this pattern are unknown, but may relate to changes in mitotic activities over the embryogenesis and/or to activation of response mechanisms to damaged DNA in the course of development.
Effects of Ionizing Radiation on Embryos of the Tardigrade Milnesium cf. tardigradum at Different Stages of Development

PubMed Central

Beltrán-Pardo, Eliana; Jönsson, K. Ingemar; Wojcik, Andrzej; Haghdoost, Siamak; Harms-Ringdahl, Mats; Bermúdez-Cruz, Rosa M.; Bernal Villegas, Jaime E.

2013-01-01

Tardigrades represent one of the most desiccation and radiation tolerant animals on Earth, and several studies have documented their tolerance in the adult stage. Studies on tolerance during embryological stages are rare, but differential effects of desiccation and freezing on different developmental stages have been reported, as well as dose-dependent effect of gamma irradiation on tardigrade embryos. Here, we report a study evaluating the tolerance of eggs from the eutardigrade Milnesium cf. tardigradum to three doses of gamma radiation (50, 200 and 500 Gy) at the early, middle, and late stage of development. We found that embryos of the middle and late developmental stages were tolerant to all doses, while eggs in the early developmental stage were tolerant only to a dose of 50 Gy, and showed a declining survival with higher dose. We also observed a delay in development of irradiated eggs, suggesting that periods of DNA repair might have taken place after irradiation induced damage. The delay was independent of dose for eggs irradiated in the middle and late stage, possibly indicating a fixed developmental schedule for repair after induced damage. These results show that the tolerance to radiation in tardigrade eggs changes in the course of their development. The mechanisms behind this pattern are unknown, but may relate to changes in mitotic activities over the embryogenesis and/or to activation of response mechanisms to damaged DNA in the course of development. PMID:24039737
Bio-Inspired Computation: Clock-Free, Grid-Free, Scale-Free and Symbol Free

DTIC Science & Technology

2015-06-11

for Prediction Tasks in Spiking Neural Networks ." Artificial Neural Networks and Machine Learning–ICANN 2014. Springer, 2014. pp 635-642. Gibson, T...Henderson, JA and Wiles, J. "Predicting temporal sequences using an event-based spiking neural network incorporating learnable delays." IEEE...Adelaide (2014 Jan). Gibson, T and Wiles, J "Predicting temporal sequences using an event-based spiking neural network incorporating learnable delays" at
Traffic Management in ATM Networks Over Satellite Links

NASA Technical Reports Server (NTRS)

Goyal, Rohit; Jain, Raj; Goyal, Mukul; Fahmy, Sonia; Vandalore, Bobby; vonDeak, Thomas

1999-01-01

This report presents a survey of the traffic management Issues in the design and implementation of satellite Asynchronous Transfer Mode (ATM) networks. The report focuses on the efficient transport of Transmission Control Protocol (TCP) traffic over satellite ATM. First, a reference satellite ATM network architecture is presented along with an overview of the service categories available in ATM networks. A delay model for satellite networks and the major components of delay and delay variation are described. A survey of design options for TCP over Unspecified Bit Rate (UBR), Guaranteed Frame Rate (GFR) and Available Bit Rate (ABR) services in ATM is presented. The main focus is on traffic management issues. Several recommendations on the design options for efficiently carrying data services over satellite ATM networks are presented. Most of the results are based on experiments performed on Geosynchronous (GEO) latencies. Some results for Low Earth Orbits (LEO) and Medium Earth Orbit (MEO) latencies are also provided.
Remote Asynchronous Message Service Gateway

NASA Technical Reports Server (NTRS)

Wang, Shin-Ywan; Burleigh, Scott C.

2011-01-01

The Remote Asynchronous Message Service (RAMS) gateway is a special-purpose AMS application node that enables exchange of AMS messages between nodes residing in different AMS "continua," notionally in different geographical locations. JPL s implementation of RAMS gateway functionality is integrated with the ION (Interplanetary Overlay Network) implementation of the DTN (Delay-Tolerant Networking) bundle protocol, and with JPL s implementation of AMS itself. RAMS protocol data units are encapsulated in ION bundles and are forwarded to the neighboring RAMS gateways identified in the source gateway s AMS management information base. Each RAMS gateway has interfaces in two communication environments: the AMS message space it serves, and the RAMS network - the grid or tree of mutually aware RAMS gateways - that enables AMS messages produced in one message space to be forwarded to other message spaces of the same venture. Each gateway opens persistent, private RAMS network communication channels to the RAMS gateways of other message spaces for the same venture, in other continua. The interconnected RAMS gateways use these communication channels to forward message petition assertions and cancellations among themselves. Each RAMS gateway subscribes locally to all subjects that are of interest in any of the linked message spaces. On receiving its copy of a message on any of these subjects, the RAMS gateway node uses the RAMS network to forward the message to every other RAMS gateway whose message space contains at least one node that has subscribed to messages on that subject. On receiving a message via the RAMS network from some other RAMS gateway, the RAMS gateway node forwards the message to all subscribers in its own message space.
The Ecological Rationality of Delay Tolerance: Insights from Capuchin Monkeys

ERIC Educational Resources Information Center

Addessi, Elsa; Paglieri, Fabio; Focaroli, Valentina

2011-01-01

Both human and non-human animals often face decisions between options available at different times, and the capacity of delaying gratification has usually been considered one of the features distinguishing humans from other animals. However, this characteristic can widely vary across individuals, species, and types of task and it is still unclear…

In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2006-01-01

As humans venture farther from Earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.
Administration of pioglitazone alone or with alogliptin delays diabetes onset in UCD-T2DM rats

PubMed Central

Cummings, Bethany P; Bettaieb, Ahmed; Graham, James L; Stanhope, Kimber; Haj, Fawaz G; Havel, Peter J

2015-01-01

There is a need to identify strategies for type 2 diabetes prevention. Therefore, we investigated the efficacy of pioglitazone and alogliptin alone and in combination to prevent type 2 diabetes onset in UCD-T2DM rats, a model of polygenic obese type 2 diabetes. At 2 months of age, rats were divided into four groups: control, alogliptin (20 mg/kg per day), pioglitazone (2.5 mg/kg per day), and alogliptin+pioglitazone. Non-fasting blood glucose was measured weekly to determine diabetes onset. Pioglitazone alone and in combination with alogliptin lead to a 5-month delay in diabetes onset despite promoting increased food intake and body weight (BW). Alogliptin alone did not delay diabetes onset or affect food intake or BW relative to controls. Fasting plasma glucose, insulin, and lipid concentrations were lower and adiponectin concentrations were threefold higher in groups treated with pioglitazone. All treatment groups demonstrated improvements in glucose tolerance and insulin secretion during an oral glucose tolerance test with an additive improvement observed with alogliptin+pioglitazone. Islet histology revealed an improvement of islet morphology in all treatment groups compared with control. Pioglitazone treatment also resulted in increased expression of markers of mitochondrial biogenesis in brown adipose tissue and white adipose tissue, with mild elevations observed in animals treated with alogliptin alone. Pioglitazone markedly delays the onset of type 2 diabetes in UCD-T2DM rats through improvements of glucose tolerance, insulin sensitivity, islet function, and markers of adipose mitochondrial biogenesis; however, addition of alogliptin at a dose of 20 mg/kg per day to pioglitazone treatment does not enhance the prevention/delay of diabetes onset. PMID:24627447
Uncovering disease mechanisms through network biology in the era of Next Generation Sequencing

NASA Astrophysics Data System (ADS)

Piñero, Janet; Berenstein, Ariel; Gonzalez-Perez, Abel; Chernomoretz, Ariel; Furlong, Laura I.

2016-04-01

Characterizing the behavior of disease genes in the context of biological networks has the potential to shed light on disease mechanisms, and to reveal both new candidate disease genes and therapeutic targets. Previous studies addressing the network properties of disease genes have produced contradictory results. Here we have explored the causes of these discrepancies and assessed the relationship between the network roles of disease genes and their tolerance to deleterious germline variants in human populations leveraging on: the abundance of interactome resources, a comprehensive catalog of disease genes and exome variation data. We found that the most salient network features of disease genes are driven by cancer genes and that genes related to different types of diseases play network roles whose centrality is inversely correlated to their tolerance to likely deleterious germline mutations. This proved to be a multiscale signature, including global, mesoscopic and local network centrality features. Cancer driver genes, the most sensitive to deleterious variants, occupy the most central positions, followed by dominant disease genes and then by recessive disease genes, which are tolerant to variants and isolated within their network modules.
Uncovering disease mechanisms through network biology in the era of Next Generation Sequencing

PubMed Central

Piñero, Janet; Berenstein, Ariel; Gonzalez-Perez, Abel; Chernomoretz, Ariel; Furlong, Laura I.

2016-01-01

Characterizing the behavior of disease genes in the context of biological networks has the potential to shed light on disease mechanisms, and to reveal both new candidate disease genes and therapeutic targets. Previous studies addressing the network properties of disease genes have produced contradictory results. Here we have explored the causes of these discrepancies and assessed the relationship between the network roles of disease genes and their tolerance to deleterious germline variants in human populations leveraging on: the abundance of interactome resources, a comprehensive catalog of disease genes and exome variation data. We found that the most salient network features of disease genes are driven by cancer genes and that genes related to different types of diseases play network roles whose centrality is inversely correlated to their tolerance to likely deleterious germline mutations. This proved to be a multiscale signature, including global, mesoscopic and local network centrality features. Cancer driver genes, the most sensitive to deleterious variants, occupy the most central positions, followed by dominant disease genes and then by recessive disease genes, which are tolerant to variants and isolated within their network modules. PMID:27080396
A Low Power Consumption Algorithm for Efficient Energy Consumption in ZigBee Motes

PubMed Central

Muñoz, Pablo; R-Moreno, María D.; F. Barrero, David

2017-01-01

Wireless Sensor Networks (WSNs) are becoming increasingly popular since they can gather information from different locations without wires. This advantage is exploited in applications such as robotic systems, telecare, domotic or smart cities, among others. To gain independence from the electricity grid, WSNs devices are equipped with batteries, therefore their operational time is determined by the time that the batteries can power on the device. As a consequence, engineers must consider low energy consumption as a critical objective to design WSNs. Several approaches can be taken to make efficient use of energy in WSNs, for instance low-duty-cycling sensor networks (LDC-WSN). Based on the LDC-WSNs, we present LOKA, a LOw power Konsumption Algorithm to minimize WSNs energy consumption using different power modes in a sensor mote. The contribution of the work is a novel algorithm called LOKA that implements two duty-cycling mechanisms using the end-device of the ZigBee protocol (of the Application Support Sublayer) and an external microcontroller (Cortex M0+) in order to minimize the energy consumption of a delay tolerant networking. Experiments show that using LOKA, the energy required by the sensor device is reduced to half with respect to the same sensor device without using LOKA. PMID:28937660
A Low Power Consumption Algorithm for Efficient Energy Consumption in ZigBee Motes.

PubMed

Vaquerizo-Hdez, Daniel; Muñoz, Pablo; R-Moreno, María D; F Barrero, David

2017-09-22

Wireless Sensor Networks (WSNs) are becoming increasingly popular since they can gather information from different locations without wires. This advantage is exploited in applications such as robotic systems, telecare, domotic or smart cities, among others. To gain independence from the electricity grid, WSNs devices are equipped with batteries, therefore their operational time is determined by the time that the batteries can power on the device. As a consequence, engineers must consider low energy consumption as a critical objective to design WSNs. Several approaches can be taken to make efficient use of energy in WSNs, for instance low-duty-cycling sensor networks (LDC-WSN). Based on the LDC-WSNs, we present LOKA, a LOw power Konsumption Algorithm to minimize WSNs energy consumption using different power modes in a sensor mote. The contribution of the work is a novel algorithm called LOKA that implements two duty-cycling mechanisms using the end-device of the ZigBee protocol (of the Application Support Sublayer) and an external microcontroller (Cortex M0+) in order to minimize the energy consumption of a delay tolerant networking. Experiments show that using LOKA, the energy required by the sensor device is reduced to half with respect to the same sensor device without using LOKA.
Rad-Tolerant, Thermally Stable, High-Speed Fiber-Optic Network for Harsh Environments

NASA Technical Reports Server (NTRS)

Leftwich, Matt; Hull, Tony; Leary, Michael; Leftwich, Marcus

2013-01-01

Future NASA destinations will be challenging to get to, have extreme environmental conditions, and may present difficulty in retrieving a spacecraft or its data. Space Photonics is developing a radiation-tolerant (rad-tolerant), high-speed, multi-channel fiber-optic transceiver, associated reconfigurable intelligent node communications architecture, and supporting hardware for intravehicular and ground-based optical networking applications. Data rates approaching 3.2 Gbps per channel will be achieved.
Change in desiccation tolerance of maize embryos during development and germination at different water potential PEG-6000 in relation to oxidative process.

PubMed

Huang, Hui; Song, Songquan

2013-07-01

Desiccation tolerance is one of the most important traits determining seed survival during storage and under stress conditions. However, the mechanism of seed desiccation tolerance is still unclear in detail. In the present study, we used a combined model system, desiccation-tolerant and -sensitive maize embryos with identical genetic background, to investigate the changes in desiccation tolerance, malonyldialdehyde (MDA) level, hydrogen peroxide (H₂O₂) content and antioxidant enzyme activity during seed development and germination in 0, -0.6 and -1.2 MPa polyethylene glycol (PEG)-6000 solutions. Our results indicated that maize embryos gradually acquired and lost desiccation tolerance during development and germination, respectively. The acquirement and loss of desiccation tolerance of embryos during development and germination were related to the ability of antioxidant enzymes including superoxide dismutase (SOD, EC 1.15.1.1), ascorbate peroxidase (APX, EC 1.11.1.11), catalase (CAT, EC 1.11.1.6), glutathione reductase (GR, EC 1.6.4.2) and dehydroascorbate reductase (DHAR, EC 1.8.5.1) to scavenge reactive oxygen species (ROS) and to control MDA content. Compared with treatment in water, PEG-6000 treatment could markedly delay the loss of desiccation tolerance of germinating embryos by delaying water uptake and time course of germination, increasing GR activity and decreasing MDA content. Our data showed the combination of antioxidant enzyme activity and MDA content is a good parameter for assessing the desiccation tolerance of maize embryos. In addition, H₂O₂ accumulated in mature embryos and PEG-treated embryos after drying, which was at least partially related to a longer embryo/seedling length in rehydration and the physiological mechanisms of priming. Copyright © 2013. Published by Elsevier Masson SAS.
Radiocontrast media-associated exanthema: identification of cross-reactivity and tolerability by allergologic testing.

PubMed

Seitz, Cornelia S; Pfeuffer, Petra; Raith, Petra; Bröcker, Eva-B; Trautmann, Axel

2009-10-01

All iodinated radiocontrast media (RCM) may cause hypersensitivity reactions, either immediate-type within 5-10 min of RCM injection or delayed-type, which become apparent more than 1h after RCM exposure. Delayed-type hypersensitivity to RCM may pose a problem for future radiologic investigations because due to possible immunological cross-reactivity all iodinated RCM are usually avoided. The aim of this study was not only to identify the causal RCM for the exanthema but also to demonstrate that patients may receive alternative iodinated RCM despite a history of RCM-induced allergic exanthema. We evaluated 32 patients with a history of exanthema after RCM application using standardized patch, prick and intradermal skin testing. In case of positive skin tests intravenous challenges with skin-test-negative RCM were performed to identify non-ionic monomer RCM which are tolerated. In 6 out of 32 patients skin tests strongly suggested a delayed-type non-IgE-mediated allergic hypersensitivity to the RCM iomeprol (3x), iopromide (2x), and iopamidol. In 4 patients alternative non-ionic monomer RCM (2x iosarcol, iopromide, and iomeprol) were identified by controlled challenge tests. The evaluation of patients with RCM-associated exanthema should always include appropriate skin tests ensuring that patients with a delayed-type allergic RCM-induced exanthema are not missed. Moreover, allergologic testing may identify alternative RCM of the group of non-ionic monomers, which are tolerated in future radiologic investigations.
The effect of visual-motion time-delays on pilot performance in a simulated pursuit tracking task

NASA Technical Reports Server (NTRS)

Miller, G. K., Jr.; Riley, D. R.

1977-01-01

An experimental study was made to determine the effect on pilot performance of time delays in the visual and motion feedback loops of a simulated pursuit tracking task. Three major interrelated factors were identified: task difficulty either in the form of airplane handling qualities or target frequency, the amount and type of motion cues, and time delay itself. In general, the greater the task difficulty, the smaller the time delay that could exist without degrading pilot performance. Conversely, the greater the motion fidelity, the greater the time delay that could be tolerated. The effect of motion was, however, pilot dependent.
Global asymptotic stability analysis of bidirectional associative memory neural networks with time delays.

PubMed

Arik, Sabri

2005-05-01

This paper presents a sufficient condition for the existence, uniqueness and global asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with distributed time delays. The results impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all continuous nonmonotonic neuron activation functions. It is shown that in some special cases of the results, the stability criteria can be easily checked. Some examples are also given to compare the results with the previous results derived in the literature.
Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

NASA Astrophysics Data System (ADS)

Bick, Christian; Sebek, Michael; Kiss, István Z.

2017-10-01

We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.
Aperiodic linear networked control considering variable channel delays: application to robots coordination.

PubMed

Santos, Carlos; Espinosa, Felipe; Santiso, Enrique; Mazo, Manuel

2015-05-27

One of the main challenges in wireless cyber-physical systems is to reduce the load of the communication channel while preserving the control performance. In this way, communication resources are liberated for other applications sharing the channel bandwidth. The main contribution of this work is the design of a remote control solution based on an aperiodic and adaptive triggering mechanism considering the current network delay of multiple robotics units. Working with the actual network delay instead of the maximum one leads to abandoning this conservative assumption, since the triggering condition is fixed depending on the current state of the network. This way, the controller manages the usage of the wireless channel in order to reduce the channel delay and to improve the availability of the communication resources. The communication standard under study is the widespread IEEE 802.11g, whose channel delay is clearly uncertain. First, the adaptive self-triggered control is validated through the TrueTime simulation tool configured for the mentioned WiFi standard. Implementation results applying the aperiodic linear control laws on four P3-DX robots are also included. Both of them demonstrate the advantage of this solution in terms of network accessing and control performance with respect to periodic and non-adaptive self-triggered alternatives.
Delayed clearance of triglyceride‐rich lipoproteins in young, healthy obese subjects†

PubMed Central

Goll, R.; Lekahl, S.; Moen, O. S.; Florholmen, J.

2015-01-01

Summary Obesity is associated with the metabolic syndrome. The aims were, first, to study the postprandial triglyceride clearance in young, healthy obese subjects and, second, to investigate if fasting triglycerides can predict delayed postprandial triglyceride clearance. Eighteen apparently healthy, obese subjects with no clinical signs of metabolic disturbances participated. Controls were age‐ and sex‐matched, healthy, normal weight subjects. Subclinical markers of metabolic disturbances were assessed by measuring postprandial triglycerides in serum and in chylomicrons by oral fat tolerance test. Postprandial triglyceride clearance for 8 h was assessed indirectly as removal of the lipid from serum during the oral fat tolerance test. Insulin resistance was measured by the homeostasis model assessment of insulin resistance (HOMA‐IR). Twelve (66%) of the apparently healthy obese individuals had insulin resistance measured by HOMA‐IR. There was a delayed clearance of serum triglycerides and chylomicron triglycerides at 6 h when compared with the control group, while, at 8 h, the differences were only detected for the chylomicron triglyceride clearance. Triglyceride response was significantly greater in the obese subjects. Fasting triglycerides in upper normal level predicted a delayed postprandial triglyceride clearance and insulin resistance. In young, apparently healthy obese subjects early metabolic disturbances including insulin resistance and delayed postprandial triglyceride clearance can be detected. Fasting serum triglyceride in upper normal level predicted delayed postprandial triglyceride clearance and insulin resistance. PMID:26469529
Spike-timing-dependent plasticity enhanced synchronization transitions induced by autapses in adaptive Newman-Watts neuronal networks.

PubMed

Gong, Yubing; Wang, Baoying; Xie, Huijuan

2016-12-01

In this paper, we numerically study the effect of spike-timing-dependent plasticity (STDP) on synchronization transitions induced by autaptic activity in adaptive Newman-Watts Hodgkin-Huxley neuron networks. It is found that synchronization transitions induced by autaptic delay vary with the adjusting rate A p of STDP and become strongest at a certain A p value, and the A p value increases when network randomness or network size increases. It is also found that the synchronization transitions induced by autaptic delay become strongest at a certain network randomness and network size, and the values increase and related synchronization transitions are enhanced when A p increases. These results show that there is optimal STDP that can enhance the synchronization transitions induced by autaptic delay in the adaptive neuronal networks. These findings provide a new insight into the roles of STDP and autapses for the information transmission in neural systems. Copyright Â© 2016 Elsevier Ireland Ltd. All rights reserved.
Dynamics of delay-coupled FitzHugh-Nagumo neural rings.

PubMed

Mao, Xiaochen; Sun, Jianqiao; Li, Shaofan

2018-01-01

This paper studies the dynamical behaviors of a pair of FitzHugh-Nagumo neural networks with bidirectional delayed couplings. It presents a detailed analysis of delay-independent and delay-dependent stabilities and the existence of bifurcated oscillations. Illustrative examples are performed to validate the analytical results and to discover interesting phenomena. It is shown that the network exhibits a variety of complicated activities, such as multiple stability switches, the coexistence of periodic and quasi-periodic oscillations, the coexistence of periodic and chaotic orbits, and the coexisting chaotic attractors.
Dynamics of delay-coupled FitzHugh-Nagumo neural rings

NASA Astrophysics Data System (ADS)

Mao, Xiaochen; Sun, Jianqiao; Li, Shaofan

2018-01-01

This paper studies the dynamical behaviors of a pair of FitzHugh-Nagumo neural networks with bidirectional delayed couplings. It presents a detailed analysis of delay-independent and delay-dependent stabilities and the existence of bifurcated oscillations. Illustrative examples are performed to validate the analytical results and to discover interesting phenomena. It is shown that the network exhibits a variety of complicated activities, such as multiple stability switches, the coexistence of periodic and quasi-periodic oscillations, the coexistence of periodic and chaotic orbits, and the coexisting chaotic attractors.
Group consensus control for networked multi-agent systems with communication delays.

PubMed

An, Bao-Ran; Liu, Guo-Ping; Tan, Chong

2018-05-01

This paper investigates group consensus problems in networked multi-agent systems (NMAS) with communication delays. Based on the sed state prediction scheme, the group consensus control protocol is designed to compensate the communication delay actively. In light of algebraic graph theories and matrix theories, necessary and(or) sufficient conditions of group consensus with respect to a given admissible control set are obtained for the NMAS with communication delays under mild assumptions. Finally, simulations are performed to demonstrate the effectiveness of the theoretical results. Copyright © 2018 ISA. All rights reserved.
Delay-slope-dependent stability results of recurrent neural networks.

PubMed

Li, Tao; Zheng, Wei Xing; Lin, Chong

2011-12-01

By using the fact that the neuron activation functions are sector bounded and nondecreasing, this brief presents a new method, named the delay-slope-dependent method, for stability analysis of a class of recurrent neural networks with time-varying delays. This method includes more information on the slope of neuron activation functions and fewer matrix variables in the constructed Lyapunov-Krasovskii functional. Then some improved delay-dependent stability criteria with less computational burden and conservatism are obtained. Numerical examples are given to illustrate the effectiveness and the benefits of the proposed method.
Finite-time robust stabilization of uncertain delayed neural networks with discontinuous activations via delayed feedback control.

PubMed

Wang, Leimin; Shen, Yi; Sheng, Yin

2016-04-01

This paper is concerned with the finite-time robust stabilization of delayed neural networks (DNNs) in the presence of discontinuous activations and parameter uncertainties. By using the nonsmooth analysis and control theory, a delayed controller is designed to realize the finite-time robust stabilization of DNNs with discontinuous activations and parameter uncertainties, and the upper bound of the settling time functional for stabilization is estimated. Finally, two examples are provided to demonstrate the effectiveness of the theoretical results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Exponentially convergent state estimation for delayed switched recurrent neural networks.

PubMed

Ahn, Choon Ki

2011-11-01

This paper deals with the delay-dependent exponentially convergent state estimation problem for delayed switched neural networks. A set of delay-dependent criteria is derived under which the resulting estimation error system is exponentially stable. It is shown that the gain matrix of the proposed state estimator is characterised in terms of the solution to a set of linear matrix inequalities (LMIs), which can be checked readily by using some standard numerical packages. An illustrative example is given to demonstrate the effectiveness of the proposed state estimator.
Different-Level Simultaneous Minimization Scheme for Fault Tolerance of Redundant Manipulator Aided with Discrete-Time Recurrent Neural Network

PubMed Central

Jin, Long; Liao, Bolin; Liu, Mei; Xiao, Lin; Guo, Dongsheng; Yan, Xiaogang

2017-01-01

By incorporating the physical constraints in joint space, a different-level simultaneous minimization scheme, which takes both the robot kinematics and robot dynamics into account, is presented and investigated for fault-tolerant motion planning of redundant manipulator in this paper. The scheme is reformulated as a quadratic program (QP) with equality and bound constraints, which is then solved by a discrete-time recurrent neural network. Simulative verifications based on a six-link planar redundant robot manipulator substantiate the efficacy and accuracy of the presented acceleration fault-tolerant scheme, the resultant QP and the corresponding discrete-time recurrent neural network. PMID:28955217
Delay and cost performance analysis of the diffie-hellman key exchange protocol in opportunistic mobile networks

NASA Astrophysics Data System (ADS)

Soelistijanto, B.; Muliadi, V.

2018-03-01

Diffie-Hellman (DH) provides an efficient key exchange system by reducing the number of cryptographic keys distributed in the network. In this method, a node broadcasts a single public key to all nodes in the network, and in turn each peer uses this key to establish a shared secret key which then can be utilized to encrypt and decrypt traffic between the peer and the given node. In this paper, we evaluate the key transfer delay and cost performance of DH in opportunistic mobile networks, a specific scenario of MANETs where complete end-to-end paths rarely exist between sources and destinations; consequently, the end-to-end delays in these networks are much greater than typical MANETs. Simulation results, driven by a random node movement model and real human mobility traces, showed that DH outperforms a typical key distribution scheme based on the RSA algorithm in terms of key transfer delay, measured by average key convergence time; however, DH performs as well as the benchmark in terms of key transfer cost, evaluated by total key (copies) forwards.
BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks

PubMed Central

Li, Peng; Huang, Chuanhe; Liu, Qin

2014-01-01

In vehicular ad hoc networks, roadside units (RSUs) placement has been proposed to improve the the overall network performance in many ITS applications. This paper addresses the budget constrained and delay-bounded placement problem (BCDP) for roadside units in vehicular ad hoc networks. There are two types of RSUs: cable connected RSU (c-RSU) and wireless RSU (w-RSU). c-RSUs are interconnected through wired lines, and they form the backbone of VANETs, while w-RSUs connect to other RSUs through wireless communication and serve as an economical extension of the coverage of c-RSUs. The delay-bounded coverage range and deployment cost of these two cases are totally different. We are given a budget constraint and a delay bound, the problem is how to find the optimal candidate sites with the maximal delay-bounded coverage to place RSUs such that a message from any c-RSU in the region can be disseminated to the more vehicles within the given budget constraint and delay bound. We first prove that the BCDP problem is NP-hard. Then we propose several algorithms to solve the BCDP problem. Simulation results show the heuristic algorithms can significantly improve the coverage range and reduce the total deployment cost, compared with other heuristic methods. PMID:25436656
Master-slave exponential synchronization of delayed complex-valued memristor-based neural networks via impulsive control.

PubMed

Li, Xiaofan; Fang, Jian-An; Li, Huiyuan

2017-09-01

This paper investigates master-slave exponential synchronization for a class of complex-valued memristor-based neural networks with time-varying delays via discontinuous impulsive control. Firstly, the master and slave complex-valued memristor-based neural networks with time-varying delays are translated to two real-valued memristor-based neural networks. Secondly, an impulsive control law is constructed and utilized to guarantee master-slave exponential synchronization of the neural networks. Thirdly, the master-slave synchronization problems are transformed into the stability problems of the master-slave error system. By employing linear matrix inequality (LMI) technique and constructing an appropriate Lyapunov-Krasovskii functional, some sufficient synchronization criteria are derived. Finally, a numerical simulation is provided to illustrate the effectiveness of the obtained theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.
Network complexity and synchronous behavior--an experimental approach.

PubMed

Neefs, P J; Steur, E; Nijmeijer, H

2010-06-01

We discuss synchronization in networks of Hindmarsh-Rose neurons that are interconnected via gap junctions, also known as electrical synapses. We present theoretical results for interactions without time-delay. These results are supported by experiments with a setup consisting of sixteen electronic equivalents of the Hindmarsh-Rose neuron. We show experimental results of networks where time-delay on the interaction is taken into account. We discuss in particular the influence of the network topology on the synchronization.
An iteration algorithm for optimal network flows

NASA Astrophysics Data System (ADS)

Woong, C. J.

1983-09-01

A packet switching network has the desirable feature of rapidly handling short (bursty) messages of the type often found in computer communication systems. In evaluating packet switching networks, the average time delay per packet is one of the most important measures of performance. The problem of message routing to minimize time delay is analyzed here using two approaches, called "successive saturation' and "max-slack', for various traffic requirement matrices and networks with fixed topology and link capacities.
Effect of the heterogeneous neuron and information transmission delay on stochastic resonance of neuronal networks

NASA Astrophysics Data System (ADS)

Wang, Qingyun; Zhang, Honghui; Chen, Guanrong

2012-12-01

We study the effect of heterogeneous neuron and information transmission delay on stochastic resonance of scale-free neuronal networks. For this purpose, we introduce the heterogeneity to the specified neuron with the highest degree. It is shown that in the absence of delay, an intermediate noise level can optimally assist spike firings of collective neurons so as to achieve stochastic resonance on scale-free neuronal networks for small and intermediate αh, which plays a heterogeneous role. Maxima of stochastic resonance measure are enhanced as αh increases, which implies that the heterogeneity can improve stochastic resonance. However, as αh is beyond a certain large value, no obvious stochastic resonance can be observed. If the information transmission delay is introduced to neuronal networks, stochastic resonance is dramatically affected. In particular, the tuned information transmission delay can induce multiple stochastic resonance, which can be manifested as well-expressed maximum in the measure for stochastic resonance, appearing every multiple of one half of the subthreshold stimulus period. Furthermore, we can observe that stochastic resonance at odd multiple of one half of the subthreshold stimulus period is subharmonic, as opposed to the case of even multiple of one half of the subthreshold stimulus period. More interestingly, multiple stochastic resonance can also be improved by the suitable heterogeneous neuron. Presented results can provide good insights into the understanding of the heterogeneous neuron and information transmission delay on realistic neuronal networks.
Robust stability bounds for multi-delay networked control systems

NASA Astrophysics Data System (ADS)

Seitz, Timothy; Yedavalli, Rama K.; Behbahani, Alireza

2018-04-01

In this paper, the robust stability of a perturbed linear continuous-time system is examined when controlled using a sampled-data networked control system (NCS) framework. Three new robust stability bounds on the time-invariant perturbations to the original continuous-time plant matrix are presented guaranteeing stability for the corresponding discrete closed-loop augmented delay-free system (ADFS) with multiple time-varying sensor and actuator delays. The bounds are differentiated from previous work by accounting for the sampled-data nature of the NCS and for separate communication delays for each sensor and actuator, not a single delay. Therefore, this paper expands the knowledge base in multiple inputs multiple outputs (MIMO) sampled-data time delay systems. Bounds are presented for unstructured, semi-structured, and structured perturbations.
Fault Tolerance in ZigBee Wireless Sensor Networks

NASA Technical Reports Server (NTRS)

Alena, Richard; Gilstrap, Ray; Baldwin, Jarren; Stone, Thom; Wilson, Pete

2011-01-01

Wireless sensor networks (WSN) based on the IEEE 802.15.4 Personal Area Network standard are finding increasing use in the home automation and emerging smart energy markets. The network and application layers, based on the ZigBee 2007 PRO Standard, provide a convenient framework for component-based software that supports customer solutions from multiple vendors. This technology is supported by System-on-a-Chip solutions, resulting in extremely small and low-power nodes. The Wireless Connections in Space Project addresses the aerospace flight domain for both flight-critical and non-critical avionics. WSNs provide the inherent fault tolerance required for aerospace applications utilizing such technology. The team from Ames Research Center has developed techniques for assessing the fault tolerance of ZigBee WSNs challenged by radio frequency (RF) interference or WSN node failure.
Global exponential stability of neutral high-order stochastic Hopfield neural networks with Markovian jump parameters and mixed time delays.

PubMed

Huang, Haiying; Du, Qiaosheng; Kang, Xibing

2013-11-01

In this paper, a class of neutral high-order stochastic Hopfield neural networks with Markovian jump parameters and mixed time delays is investigated. The jumping parameters are modeled as a continuous-time finite-state Markov chain. At first, the existence of equilibrium point for the addressed neural networks is studied. By utilizing the Lyapunov stability theory, stochastic analysis theory and linear matrix inequality (LMI) technique, new delay-dependent stability criteria are presented in terms of linear matrix inequalities to guarantee the neural networks to be globally exponentially stable in the mean square. Numerical simulations are carried out to illustrate the main results. © 2013 ISA. Published by ISA. All rights reserved.
Impact of window decrement rate on TCP performance in an adhoc network

NASA Astrophysics Data System (ADS)

Suherman; Hutasuhut, Arief T. W.; Badra, Khaldun; Al-Akaidi, Marwan

2017-09-01

Transmission control protocol (TCP) is a reliable transport protocol handling end to end connection in TCP/IP stack. It works well in copper or optical fibre link, but experiences increasing delay in wireless network. Further, TCP experiences multiple retransmissions due to higher collision probability within wireless network. The situation may get worsen in an ad hoc network. This paper examines the impact half window or window reduction rate to the overall TCP performances. The evaluation using NS-2 simulator shows that the smaller the window decrement rate results the smaller end to end delay. Delay is reduced to 17.05% in average when window decrement rate decreases. Average jitter also decreases 4.15%, while packet loss is not affected.
Interact to Survive: Phyllobacterium brassicacearum Improves Arabidopsis Tolerance to Severe Water Deficit and Growth Recovery

PubMed Central

Bresson, Justine; Vasseur, François; Dauzat, Myriam; Labadie, Marc; Varoquaux, Fabrice; Touraine, Bruno; Vile, Denis

2014-01-01

Mutualistic bacteria can alter plant phenotypes and confer new abilities to plants. Some plant growth-promoting rhizobacteria (PGPR) are known to improve both plant growth and tolerance to multiple stresses, including drought, but reports on their effects on plant survival under severe water deficits are scarce. We investigated the effect of Phyllobacterium brassicacearum STM196 strain, a PGPR isolated from the rhizosphere of oilseed rape, on survival, growth and physiological responses of Arabidopsis thaliana to severe water deficits combining destructive and non-destructive high-throughput phenotyping. Soil inoculation with STM196 greatly increased the survival rate of A. thaliana under several scenarios of severe water deficit. Photosystem II efficiency, assessed at the whole-plant level by high-throughput fluorescence imaging (F v/F m), was related to the probability of survival and revealed that STM196 delayed plant mortality. Inoculated surviving plants tolerated more damages to the photosynthetic tissues through a delayed dehydration and a better tolerance to low water status. Importantly, STM196 allowed a better recovery of plant growth after rewatering and stressed plants reached a similar biomass at flowering than non-stressed plants. Our results highlight the importance of plant-bacteria interactions in plant responses to severe drought and provide a new avenue of investigations to improve drought tolerance in agriculture. PMID:25226036
Synchronization in node of complex networks consist of complex chaotic system

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

Wei, Qiang, E-mail: qiangweibeihua@163.com; Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin; Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024

2014-07-15

A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.
Coevolutionary network approach to cultural dynamics controlled by intolerance

NASA Astrophysics Data System (ADS)

Gracia-Lázaro, Carlos; Quijandría, Fernando; Hernández, Laura; Floría, Luis Mario; Moreno, Yamir

2011-12-01

Starting from Axelrod's model of cultural dissemination, we introduce a rewiring probability, enabling agents to cut the links with their unfriendly neighbors if their cultural similarity is below a tolerance parameter. For low values of tolerance, rewiring promotes the convergence to a frozen monocultural state. However, intermediate tolerance values prevent rewiring once the network is fragmented, resulting in a multicultural society even for values of initial cultural diversity in which the original Axelrod model reaches globalization.
Lambda network having 2.sup.m-1 nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, Jr., Leonard M.

1995-01-01

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance.
The Viability of a DTN System for Current Military Application

DTIC Science & Technology

2013-03-01

Agency (DARPA) Disruption-Tolerant Networking program and the Internet Research Task Force (IRTF) DTN Research Group made significant strides toward...Disruption-Tolerant Networks A Primer,” Interplanetary Internet Special Interest Group, 2012. [4] D. T. N. R. Group, “Compiling DTN2,” Internet Research Task
Exponential H(infinity) synchronization of general discrete-time chaotic neural networks with or without time delays.

PubMed

Qi, Donglian; Liu, Meiqin; Qiu, Meikang; Zhang, Senlin

2010-08-01

This brief studies exponential H(infinity) synchronization of a class of general discrete-time chaotic neural networks with external disturbance. On the basis of the drive-response concept and H(infinity) control theory, and using Lyapunov-Krasovskii (or Lyapunov) functional, state feedback controllers are established to not only guarantee exponential stable synchronization between two general chaotic neural networks with or without time delays, but also reduce the effect of external disturbance on the synchronization error to a minimal H(infinity) norm constraint. The proposed controllers can be obtained by solving the convex optimization problems represented by linear matrix inequalities. Most discrete-time chaotic systems with or without time delays, such as Hopfield neural networks, cellular neural networks, bidirectional associative memory networks, recurrent multilayer perceptrons, Cohen-Grossberg neural networks, Chua's circuits, etc., can be transformed into this general chaotic neural network to be H(infinity) synchronization controller designed in a unified way. Finally, some illustrated examples with their simulations have been utilized to demonstrate the effectiveness of the proposed methods.
An Empirical Study of Synchrophasor Communication Delay in a Utility TCP/IP Network

NASA Astrophysics Data System (ADS)

Zhu, Kun; Chenine, Moustafa; Nordström, Lars; Holmström, Sture; Ericsson, Göran

2013-07-01

Although there is a plethora of literature dealing with Phasor Measurement Unit (PMU) communication delay, there has not been any effort made to generalize empirical delay results by identifying the distribution with the best fit. The existing studies typically assume a distribution or simply build on analogies to communication network routing delay. Specifically, this study provides insight into the characterization of the communication delay of both unprocessed PMU data and synchrophasors sorted by a Phasor Data Concentrator (PDC). The results suggest that a bi-modal distribution containing two normal distributions offers the best fit of the delay of the unprocessed data, whereas the delay profile of the sorted synchrophasors resembles a normal distribution based on these results, the possibility of evaluating the reliability of a synchrophasor application with respect to a particular choice of PDC timeout is discussed.
Control of amplitude chimeras by time delay in oscillator networks

NASA Astrophysics Data System (ADS)

Gjurchinovski, Aleksandar; Schöll, Eckehard; Zakharova, Anna

2017-04-01

We investigate the influence of time-delayed coupling in a ring network of nonlocally coupled Stuart-Landau oscillators upon chimera states, i.e., space-time patterns with coexisting partially coherent and partially incoherent domains. We focus on amplitude chimeras, which exhibit incoherent behavior with respect to the amplitude rather than the phase and are transient patterns, and we show that their lifetime can be significantly enhanced by coupling delay. To characterize their transition to phase-lag synchronization (coherent traveling waves) and other coherent structures, we generalize the Kuramoto order parameter. Contrasting the results for instantaneous coupling with those for constant coupling delay, for time-varying delay, and for distributed-delay coupling, we demonstrate that the lifetime of amplitude chimera states and related partially incoherent states can be controlled, i.e., deliberately reduced or increased, depending upon the type of coupling delay.

Fault tolerant architectures for integrated aircraft electronics systems

NASA Technical Reports Server (NTRS)

Levitt, K. N.; Melliar-Smith, P. M.; Schwartz, R. L.

1983-01-01

Work into possible architectures for future flight control computer systems is described. Ada for Fault-Tolerant Systems, the NETS Network Error-Tolerant System architecture, and voting in asynchronous systems are covered.
Cluster-based single-sink wireless sensor networks and passive optical network converged network incorporating sideband modulation schemes

NASA Astrophysics Data System (ADS)

Kumar, Love; Sharma, Vishal; Singh, Amarpal

2018-02-01

Wireless sensor networks have tremendous applications, such as civil, military, and environmental monitoring. In most of the applications, sensor data are required to be propagated over the internet/core networks, which result in backhaul setback. Subsequently, there is a necessity to backhaul the sensed information of such networks together with prolonging of the transmission link. Passive optical network (PON) is next-generation access technology emerging as a potential candidate for convergence of the sensed data to the core system. Earlier, the work with single-optical line terminal-PON was demonstrated and investigated merely analytically. This work is an attempt to demonstrate a practical model of a bidirectional single-sink wireless sensor network-PON converged network in which the collected data from cluster heads are transmitted over PON networks. Further, modeled converged structure has been investigated under the influence of double, single, and tandem sideband modulation schemes incorporating a corresponding phase-delay to the sensor data entities that have been overlooked in the past. The outcome illustrates the successful fusion of the sensor data entities over PON with acceptable bit error rate and signal to noise ratio serving as a potential development in the sphere of such converged networks. It has also been revealed that the data entities treated with tandem side band modulation scheme help in improving the performance of the converged structure. Additionally, analysis for uplink transmission reported with queue theory in terms of time cycle, average time delay, data packet generation, and bandwidth utilization. An analytical analysis of proposed converged network shows that average time delay for data packet transmission is less as compared with time cycle delay.
A study on ?-dissipative synchronisation of coupled reaction-diffusion neural networks with time-varying delays

NASA Astrophysics Data System (ADS)

Ali, M. Syed; Zhu, Quanxin; Pavithra, S.; Gunasekaran, N.

2018-03-01

This study examines the problem of dissipative synchronisation of coupled reaction-diffusion neural networks with time-varying delays. This paper proposes a complex dynamical network consisting of N linearly and diffusively coupled identical reaction-diffusion neural networks. By constructing a suitable Lyapunov-Krasovskii functional (LKF), utilisation of Jensen's inequality and reciprocally convex combination (RCC) approach, strictly ?-dissipative conditions of the addressed systems are derived. Finally, a numerical example is given to show the effectiveness of the theoretical results.
Robust stability of interval bidirectional associative memory neural network with time delays.

PubMed

Liao, Xiaofeng; Wong, Kwok-wo

2004-04-01

In this paper, the conventional bidirectional associative memory (BAM) neural network with signal transmission delay is intervalized in order to study the bounded effect of deviations in network parameters and external perturbations. The resultant model is referred to as a novel interval dynamic BAM (IDBAM) model. By combining a number of different Lyapunov functionals with the Razumikhin technique, some sufficient conditions for the existence of unique equilibrium and robust stability are derived. These results are fairly general and can be verified easily. To go further, we extend our investigation to the time-varying delay case. Some robust stability criteria for BAM with perturbations of time-varying delays are derived. Besides, our approach for the analysis allows us to consider several different types of activation functions, including piecewise linear sigmoids with bounded activations as well as the usual C1-smooth sigmoids. We believe that the results obtained have leading significance in the design and application of BAM neural networks.
Improved result on stability analysis of discrete stochastic neural networks with time delay

NASA Astrophysics Data System (ADS)

Wu, Zhengguang; Su, Hongye; Chu, Jian; Zhou, Wuneng

2009-04-01

This Letter investigates the problem of exponential stability for discrete stochastic time-delay neural networks. By defining a novel Lyapunov functional, an improved delay-dependent exponential stability criterion is established in terms of linear matrix inequality (LMI) approach. Meanwhile, the computational complexity of the newly established stability condition is reduced because less variables are involved. Numerical example is given to illustrate the effectiveness and the benefits of the proposed method.
Topology design and performance analysis of an integrated communication network

NASA Technical Reports Server (NTRS)

Li, V. O. K.; Lam, Y. F.; Hou, T. C.; Yuen, J. H.

1985-01-01

A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix.
Epidemiology of acromegaly in Ecuador.

PubMed

López Gavilanez, Enrique; Guerrero Franco, Kempis; Solórzano Zambrano, Narcisa; Navarro Chávez, Manuel; López Estrella, Camilo; Vaca Burbano, Luis; Marriott Díaz, Eduardo

2016-01-01

To assess the epidemiology of acromegaly in the city of Guayaquil, Ecuador, and to compare our results to those reported in the literature. An analysis was made of retrospective and prospective data from all patients with acromegaly attending endocrinology clinics at the 4 main hospitals of the public health network of Guayaquil from January 2000 to December 2014. Age at diagnosis, estimated delay in diagnosis, imaging studies of pituitary gland, basal growth hormone (GH) level, GH after an oral glucose tolerance test (OGTT-GH), and serum levels of insulin-like growth factor 1 (IGF-1) were recorded. Incidence and prevalence of the disease were estimated using information from the 2010 census of population and housing. Forty-eight cases were recorded in the study period in 17 males (35.4%) and 31 females (64.5%); M/F ratio=1.8:1. Mean age at diagnosis was 47.3±16.8 years (range 18-86). Delay in diagnosis was 7.3±6.3 years (range 1-30). Mean age at diagnosis was 47.9±18.2 years in males and 46.3±15.8 years in females. Delay in diagnosis was 10.2±7.9 and 5.7±3.9 years in males and females, respectively. Prevalence of acromegaly is 18.7 cases per million inhabitants, and incidence of acromegaly 1.3 cases per million people per year. Acromegaly predominates in females, and is diagnosed in the fourth decade with a delay of approximately 8 years, usually even longer in males. Incidence and prevalence are lower than reported in international series. The disease is underdiagnosed and underreported in Ecuador. Copyright © 2016 SEEN. Publicado por Elsevier España, S.L.U. All rights reserved.
Data-Gathering Scheme Using AUVs in Large-Scale Underwater Sensor Networks: A Multihop Approach

PubMed Central

Khan, Jawaad Ullah; Cho, Ho-Shin

2016-01-01

In this paper, we propose a data-gathering scheme for hierarchical underwater sensor networks, where multiple Autonomous Underwater Vehicles (AUVs) are deployed over large-scale coverage areas. The deployed AUVs constitute an intermittently connected multihop network through inter-AUV synchronization (in this paper, synchronization means an interconnection between nodes for communication) for forwarding data to the designated sink. In such a scenario, the performance of the multihop communication depends upon the synchronization among the vehicles. The mobility parameters of the vehicles vary continuously because of the constantly changing underwater currents. The variations in the AUV mobility parameters reduce the inter-AUV synchronization frequency contributing to delays in the multihop communication. The proposed scheme improves the AUV synchronization frequency by permitting neighboring AUVs to share their status information via a pre-selected node called an agent-node at the static layer of the network. We evaluate the proposed scheme in terms of the AUV synchronization frequency, vertical delay (node→AUV), horizontal delay (AUV→AUV), end-to-end delay, and the packet loss ratio. Simulation results show that the proposed scheme significantly reduces the aforementioned delays without the synchronization time-out process employed in conventional works. PMID:27706042
Data-Gathering Scheme Using AUVs in Large-Scale Underwater Sensor Networks: A Multihop Approach.

PubMed

Khan, Jawaad Ullah; Cho, Ho-Shin

2016-09-30

In this paper, we propose a data-gathering scheme for hierarchical underwater sensor networks, where multiple Autonomous Underwater Vehicles (AUVs) are deployed over large-scale coverage areas. The deployed AUVs constitute an intermittently connected multihop network through inter-AUV synchronization (in this paper, synchronization means an interconnection between nodes for communication) for forwarding data to the designated sink. In such a scenario, the performance of the multihop communication depends upon the synchronization among the vehicles. The mobility parameters of the vehicles vary continuously because of the constantly changing underwater currents. The variations in the AUV mobility parameters reduce the inter-AUV synchronization frequency contributing to delays in the multihop communication. The proposed scheme improves the AUV synchronization frequency by permitting neighboring AUVs to share their status information via a pre-selected node called an agent-node at the static layer of the network. We evaluate the proposed scheme in terms of the AUV synchronization frequency, vertical delay (node→AUV), horizontal delay (AUV→AUV), end-to-end delay, and the packet loss ratio. Simulation results show that the proposed scheme significantly reduces the aforementioned delays without the synchronization time-out process employed in conventional works.
MAGMA: A Liquid Software Approach to Fault Tolerance, Computer Network Security, and Survivable Networking

DTIC Science & Technology

2001-12-01

and Lieutenant Namik Kaplan , Turkish Navy. Maj Tiefert’s thesis, “Modeling Control Channel Dynamics of SAAM using NS Network Simulation”, helped lay...DEC99] Deconinck , Dr. ir. Geert, Fault Tolerant Systems, ESAT / Division ACCA , Katholieke Universiteit Leuven, October 1999. [FRE00] Freed...Systems”, Addison-Wesley, 1989. [KAP99] Kaplan , Namik, “Prototyping of an Active and Lightweight Router,” March 1999 [KAT99] Kati, Effraim
Heterologous expression of wheat VERNALIZATION 2 (TaVRN2) gene in Arabidopsis delays flowering and enhances freezing tolerance.

PubMed

Diallo, Amadou; Kane, Ndjido; Agharbaoui, Zahra; Badawi, Mohamed; Sarhan, Fathey

2010-01-13

The vernalization gene 2 (VRN2), is a major flowering repressor in temperate cereals that is regulated by low temperature and photoperiod. Here we show that the gene from Triticum aestivum (TaVRN2) is also regulated by salt, heat shock, dehydration, wounding and abscissic acid. Promoter analysis indicates that TaVRN2 regulatory region possesses all the specific responsive elements to these stresses. This suggests pleiotropic effects of TaVRN2 in wheat development and adaptability to the environment. To test if TaVRN2 can act as a flowering repressor in species different from the temperate cereals, the gene was ectopically expressed in the model plant Arabidopsis. Transgenic plants showed no alteration in morphology, but their flowering time was significantly delayed compared to controls plants, indicating that TaVRN2, although having no ortholog in Brassicaceae, can act as a flowering repressor in these species. To identify the possible mechanism by which TaVRN2 gene delays flowering in Arabidopsis, the expression level of several genes involved in flowering time regulation was determined. The analysis indicates that the late flowering of the 35S::TaVRN2 plants was associated with a complex pattern of expression of the major flowering control genes, FCA, FLC, FT, FVE and SOC1. This suggests that heterologous expression of TaVRN2 in Arabidopsis can delay flowering by modulating several floral inductive pathways. Furthermore, transgenic plants showed higher freezing tolerance, likely due to the accumulation of CBF2, CBF3 and the COR genes. Overall, our data suggests that TaVRN2 gene could modulate a common regulator of the two interacting pathways that regulate flowering time and the induction of cold tolerance. The results also demonstrate that TaVRN2 could be used to manipulate flowering time and improve cold tolerance in other species.
Impulsive Effects on Quasi-Synchronization of Neural Networks With Parameter Mismatches and Time-Varying Delay.

PubMed

Tang, Ze; Park, Ju H; Feng, Jianwen

2018-04-01

This paper is concerned with the exponential synchronization issue of nonidentically coupled neural networks with time-varying delay. Due to the parameter mismatch phenomena existed in neural networks, the problem of quasi-synchronization is thus discussed by applying some impulsive control strategies. Based on the definition of average impulsive interval and the extended comparison principle for impulsive systems, some criteria for achieving the quasi-synchronization of neural networks are derived. More extensive ranges of impulsive effects are discussed so that impulse could either play an effective role or play an adverse role in the final network synchronization. In addition, according to the extended formula for the variation of parameters with time-varying delay, precisely exponential convergence rates and quasi-synchronization errors are obtained, respectively, in view of different types impulsive effects. Finally, some numerical simulations with different types of impulsive effects are presented to illustrate the effectiveness of theoretical analysis.
Finite-time mixed outer synchronization of complex networks with coupling time-varying delay.

PubMed

He, Ping; Ma, Shu-Hua; Fan, Tao

2012-12-01

This article is concerned with the problem of finite-time mixed outer synchronization (FMOS) of complex networks with coupling time-varying delay. FMOS is a recently developed generalized synchronization concept, i.e., in which different state variables of the corresponding nodes can evolve into finite-time complete synchronization, finite-time anti-synchronization, and even amplitude finite-time death simultaneously for an appropriate choice of the controller gain matrix. Some novel stability criteria for the synchronization between drive and response complex networks with coupling time-varying delay are derived using the Lyapunov stability theory and linear matrix inequalities. And a simple linear state feedback synchronization controller is designed as a result. Numerical simulations for two coupled networks of modified Chua's circuits are then provided to demonstrate the effectiveness and feasibility of the proposed complex networks control and synchronization schemes and then compared with the proposed results and the previous schemes for accuracy.
Extreme fluctuations in stochastic network coordination with time delays

NASA Astrophysics Data System (ADS)

Hunt, D.; Molnár, F.; Szymanski, B. K.; Korniss, G.

2015-12-01

We study the effects of uniform time delays on the extreme fluctuations in stochastic synchronization and coordination problems with linear couplings in complex networks. We obtain the average size of the fluctuations at the nodes from the behavior of the underlying modes of the network. We then obtain the scaling behavior of the extreme fluctuations with system size, as well as the distribution of the extremes on complex networks, and compare them to those on regular one-dimensional lattices. For large complex networks, when the delay is not too close to the critical one, fluctuations at the nodes effectively decouple, and the limit distributions converge to the Fisher-Tippett-Gumbel density. In contrast, fluctuations in low-dimensional spatial graphs are strongly correlated, and the limit distribution of the extremes is the Airy density. Finally, we also explore the effects of nonlinear couplings on the stability and on the extremes of the synchronization landscapes.
Constrained off-line synthesis approach of model predictive control for networked control systems with network-induced delays.

PubMed

Tang, Xiaoming; Qu, Hongchun; Wang, Ping; Zhao, Meng

2015-03-01

This paper investigates the off-line synthesis approach of model predictive control (MPC) for a class of networked control systems (NCSs) with network-induced delays. A new augmented model which can be readily applied to time-varying control law, is proposed to describe the NCS where bounded deterministic network-induced delays may occur in both sensor to controller (S-A) and controller to actuator (C-A) links. Based on this augmented model, a sufficient condition of the closed-loop stability is derived by applying the Lyapunov method. The off-line synthesis approach of model predictive control is addressed using the stability results of the system, which explicitly considers the satisfaction of input and state constraints. Numerical example is given to illustrate the effectiveness of the proposed method. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.
Oscillation, Conduction Delays, and Learning Cooperate to Establish Neural Competition in Recurrent Networks

PubMed Central

Kato, Hideyuki; Ikeguchi, Tohru

2016-01-01

Specific memory might be stored in a subnetwork consisting of a small population of neurons. To select neurons involved in memory formation, neural competition might be essential. In this paper, we show that excitable neurons are competitive and organize into two assemblies in a recurrent network with spike timing-dependent synaptic plasticity (STDP) and axonal conduction delays. Neural competition is established by the cooperation of spontaneously induced neural oscillation, axonal conduction delays, and STDP. We also suggest that the competition mechanism in this paper is one of the basic functions required to organize memory-storing subnetworks into fine-scale cortical networks. PMID:26840529
Effects of time delay and pitch control sensitivity in the flared landing

NASA Technical Reports Server (NTRS)

Berthe, C. J.; Chalk, C. R.; Wingarten, N. C.; Grantham, W.

1986-01-01

Between December 1985 and January 1986, a flared landing program was conducted, using the USAF Total In-Flight simulator airplane, to examine time delay effects in a formal manner. Results show that as pitch sensitivity is increased, tolerance to time delay decreases. With the proper selection of pitch sensitivity, Level I performance was maintained with time delays ranging from 150 milliseconds to greater than 300 milliseconds. With higher sensitivity, configurations with Level I performance at 150 milliseconds degraded to level 2 at 200 milliseconds. When metrics of time delay and pitch sensitivity effects are applied to enhance previously developed predictive criteria, the result is an improved prediction technique which accounts for significant closed loop items.
Intrusion-Tolerant Location Information Services in Intelligent Vehicular Networks

NASA Astrophysics Data System (ADS)

Yan, Gongjun; Yang, Weiming; Shaner, Earl F.; Rawat, Danda B.

Intelligent Vehicular Networks, known as Vehicle-to-Vehicle and Vehicle-to-Roadside wireless communications (also called Vehicular Ad hoc Networks), are revolutionizing our daily driving with better safety and more infortainment. Most, if not all, applications will depend on accurate location information. Thus, it is of importance to provide intrusion-tolerant location information services. In this paper, we describe an adaptive algorithm that detects and filters the false location information injected by intruders. Given a noisy environment of mobile vehicles, the algorithm estimates the high resolution location of a vehicle by refining low resolution location input. We also investigate results of simulations and evaluate the quality of the intrusion-tolerant location service.
Delay Analysis of GTS Bridging between IEEE 802.15.4 and IEEE 802.11 Networks for Healthcare Applications

PubMed Central

Mišić, Jelena; (Sherman) Shen, Xuemin

2009-01-01

We consider interconnection of IEEE 802.15.4 beacon-enabled network cluster with IEEE 802.11b network. This scenario is important in healthcare applications where IEEE 802.15.4 nodes comprise patient's body area network (BAN) and are involved in sensing some health-related data. BAN nodes have very short communication range in order to avoid harming patient's health and save energy. Sensed data needs to be transmitted to an access point in the ward room using wireless technology with higher transmission range and rate such as IEEE 802.11b. We model the interconnected network where IEEE 802.15.4-based BAN operates in guaranteed time slot (GTS) mode, and IEEE 802.11b part of the bridge conveys GTS superframe to the 802.11b access point. We then analyze the network delays. Performance analysis is performed using EKG traffic from continuous telemetry, and we discuss the delays of communication due the increasing number of patients. PMID:19107184
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
Delay Analysis of GTS Bridging between IEEE 802.15.4 and IEEE 802.11 Networks for Healthcare Applications.

PubMed

Misić, Jelena; Sherman Shen, Xuemin

2009-01-01

We consider interconnection of IEEE 802.15.4 beacon-enabled network cluster with IEEE 802.11b network. This scenario is important in healthcare applications where IEEE 802.15.4 nodes comprise patient's body area network (BAN) and are involved in sensing some health-related data. BAN nodes have very short communication range in order to avoid harming patient's health and save energy. Sensed data needs to be transmitted to an access point in the ward room using wireless technology with higher transmission range and rate such as IEEE 802.11b. We model the interconnected network where IEEE 802.15.4-based BAN operates in guaranteed time slot (GTS) mode, and IEEE 802.11b part of the bridge conveys GTS superframe to the 802.11b access point. We then analyze the network delays. Performance analysis is performed using EKG traffic from continuous telemetry, and we discuss the delays of communication due the increasing number of patients.
Network analysis of oyster transcriptome revealed a cascade of cellular responses during recovery after heat shock.

PubMed

Zhang, Lingling; Hou, Rui; Su, Hailin; Hu, Xiaoli; Wang, Shi; Bao, Zhenmin

2012-01-01

Oysters, as a major group of marine bivalves, can tolerate a wide range of natural and anthropogenic stressors including heat stress. Recent studies have shown that oysters pretreated with heat shock can result in induced heat tolerance. A systematic study of cellular recovery from heat shock may provide insights into the mechanism of acquired thermal tolerance. In this study, we performed the first network analysis of oyster transcriptome by reanalyzing microarray data from a previous study. Network analysis revealed a cascade of cellular responses during oyster recovery after heat shock and identified responsive gene modules and key genes. Our study demonstrates the power of network analysis in a non-model organism with poor gene annotations, which can lead to new discoveries that go beyond the focus on individual genes.
Impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks.

PubMed

Chen, Wu-Hua; Lu, Xiaomei; Zheng, Wei Xing

2015-04-01

This paper investigates the problems of impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks (DDNNs). Two types of DDNNs with stabilizing impulses are studied. By introducing the time-varying Lyapunov functional to capture the dynamical characteristics of discrete-time impulsive delayed neural networks (DIDNNs) and by using a convex combination technique, new exponential stability criteria are derived in terms of linear matrix inequalities. The stability criteria for DIDNNs are independent of the size of time delay but rely on the lengths of impulsive intervals. With the newly obtained stability results, sufficient conditions on the existence of linear-state feedback impulsive controllers are derived. Moreover, a novel impulsive synchronization scheme for two identical DDNNs is proposed. The novel impulsive synchronization scheme allows synchronizing two identical DDNNs with unknown delays. Simulation results are given to validate the effectiveness of the proposed criteria of impulsive stabilization and impulsive synchronization of DDNNs. Finally, an application of the obtained impulsive synchronization result for two identical chaotic DDNNs to a secure communication scheme is presented.
Delay decomposition approach to [Formula: see text] filtering analysis of genetic oscillator networks with time-varying delays.

PubMed

Revathi, V M; Balasubramaniam, P

2016-04-01

In this paper, the [Formula: see text] filtering problem is treated for N coupled genetic oscillator networks with time-varying delays and extrinsic molecular noises. Each individual genetic oscillator is a complex dynamical network that represents the genetic oscillations in terms of complicated biological functions with inner or outer couplings denote the biochemical interactions of mRNAs, proteins and other small molecules. Throughout the paper, first, by constructing appropriate delay decomposition dependent Lyapunov-Krasovskii functional combined with reciprocal convex approach, improved delay-dependent sufficient conditions are obtained to ensure the asymptotic stability of the filtering error system with a prescribed [Formula: see text] performance. Second, based on the above analysis, the existence of the designed [Formula: see text] filters are established in terms of linear matrix inequalities with Kronecker product. Finally, numerical examples including a coupled Goodwin oscillator model are inferred to illustrate the effectiveness and less conservatism of the proposed techniques.
Long-term tolerance to kidney allografts in a preclinical canine model.

PubMed

Kuhr, Christian S; Yunusov, Murad; Sale, George; Loretz, Carol; Storb, Rainer

2007-08-27

Durable immune tolerance supporting vascularized allotransplantation offers the possibility of extending graft survival and avoiding harmful complications of chronic immunosuppression. Immune tolerance to renal allografts was induced in a preclinical canine model through engraftment of donor hematopoietic cells using a combination of low-dose total body irradiation and a short course of immunosuppression. Subsequently, donor renal allografts were transplanted accompanied by bilateral native nephrectomies. With 5-year follow up, we found normal renal function in all recipients and no histological evidence of acute or chronic rejection. This tolerance does not extend universally to donor skin grafts, however, with two of four animals rejecting delayed donor skin grafts. Hematopoietic chimerism produces durable and robust immune tolerance to kidney allografts, although incomplete tolerance to donor skin grafting.
Relaxed fault-tolerant hardware implementation of neural networks in the presence of multiple transient errors.

PubMed

Mahdiani, Hamid Reza; Fakhraie, Sied Mehdi; Lucas, Caro

2012-08-01

Reliability should be identified as the most important challenge in future nano-scale very large scale integration (VLSI) implementation technologies for the development of complex integrated systems. Normally, fault tolerance (FT) in a conventional system is achieved by increasing its redundancy, which also implies higher implementation costs and lower performance that sometimes makes it even infeasible. In contrast to custom approaches, a new class of applications is categorized in this paper, which is inherently capable of absorbing some degrees of vulnerability and providing FT based on their natural properties. Neural networks are good indicators of imprecision-tolerant applications. We have also proposed a new class of FT techniques called relaxed fault-tolerant (RFT) techniques which are developed for VLSI implementation of imprecision-tolerant applications. The main advantage of RFT techniques with respect to traditional FT solutions is that they exploit inherent FT of different applications to reduce their implementation costs while improving their performance. To show the applicability as well as the efficiency of the RFT method, the experimental results for implementation of a face-recognition computationally intensive neural network and its corresponding RFT realization are presented in this paper. The results demonstrate promising higher performance of artificial neural network VLSI solutions for complex applications in faulty nano-scale implementation environments.
Distributed Fault-Tolerant Control of Networked Uncertain Euler-Lagrange Systems Under Actuator Faults.

PubMed

Chen, Gang; Song, Yongduan; Lewis, Frank L

2016-05-03

This paper investigates the distributed fault-tolerant control problem of networked Euler-Lagrange systems with actuator and communication link faults. An adaptive fault-tolerant cooperative control scheme is proposed to achieve the coordinated tracking control of networked uncertain Lagrange systems on a general directed communication topology, which contains a spanning tree with the root node being the active target system. The proposed algorithm is capable of compensating for the actuator bias fault, the partial loss of effectiveness actuation fault, the communication link fault, the model uncertainty, and the external disturbance simultaneously. The control scheme does not use any fault detection and isolation mechanism to detect, separate, and identify the actuator faults online, which largely reduces the online computation and expedites the responsiveness of the controller. To validate the effectiveness of the proposed method, a test-bed of multiple robot-arm cooperative control system is developed for real-time verification. Experiments on the networked robot-arms are conduced and the results confirm the benefits and the effectiveness of the proposed distributed fault-tolerant control algorithms.
State feedback controller design for the synchronization of Boolean networks with time delays

NASA Astrophysics Data System (ADS)

Li, Fangfei; Li, Jianning; Shen, Lijuan

2018-01-01

State feedback control design to make the response Boolean network synchronize with the drive Boolean network is far from being solved in the literature. Motivated by this, this paper studies the feedback control design for the complete synchronization of two coupled Boolean networks with time delays. A necessary condition for the existence of a state feedback controller is derived first. Then the feedback control design procedure for the complete synchronization of two coupled Boolean networks is provided based on the necessary condition. Finally, an example is given to illustrate the proposed design procedure.
The Effects of Financial Education on Impulsive Decision Making

PubMed Central

DeHart, William B.; Friedel, Jonathan E.; Lown, Jean M.; Odum, Amy L.

2016-01-01

Delay discounting, as a behavioral measure of impulsive choice, is strongly related to substance abuse and other risky behaviors. Therefore, effective techniques that alter delay discounting are of great interest. We explored the ability of a semester long financial education course to change delay discounting. Participants were recruited from a financial education course (n = 237) and an abnormal psychology course (n = 80). Both groups completed a delay-discounting task for $100 during the first two weeks (Time 1) of the semester as well as during the last two weeks (Time 2) of the semester. Participants also completed a personality inventory and financial risk tolerance scale both times and a delay-discounting task for $1,000 during Time 2. Delay discounting decreased in the financial education group at the end of the semester whereas there was no change in delay discounting in the abnormal psychology group. Financial education may be an effective method for reducing delay discounting. PMID:27442237
The Effects of Financial Education on Impulsive Decision Making.

PubMed

DeHart, William B; Friedel, Jonathan E; Lown, Jean M; Odum, Amy L

2016-01-01

Delay discounting, as a behavioral measure of impulsive choice, is strongly related to substance abuse and other risky behaviors. Therefore, effective techniques that alter delay discounting are of great interest. We explored the ability of a semester long financial education course to change delay discounting. Participants were recruited from a financial education course (n = 237) and an abnormal psychology course (n = 80). Both groups completed a delay-discounting task for $100 during the first two weeks (Time 1) of the semester as well as during the last two weeks (Time 2) of the semester. Participants also completed a personality inventory and financial risk tolerance scale both times and a delay-discounting task for $1,000 during Time 2. Delay discounting decreased in the financial education group at the end of the semester whereas there was no change in delay discounting in the abnormal psychology group. Financial education may be an effective method for reducing delay discounting.
The nature of adolescent competencies predicted by preschool delay of gratification.

PubMed

Mischel, W; Shoda, Y; Peake, P K

1988-04-01

Delay of gratification, assessed in a series of experiments when the subjects were in preschool, was related to parental personality ratings obtained a decade later for 95 of these children in adolescence. Clear and consistent patterns of correlations between self-imposed delay time in preschool and later ratings were found for both sexes over this time span. Delay behavior predicted a set of cognitive and social competencies and stress tolerance consistent with experimental analyses of the process underlying effective delay in the preschool delay situation. Specifically, children who were able to wait longer at age 4 or 5 became adolescents whose parents rated them as more academically and socially competent, verbally fluent, rational, attentive, planful, and able to deal well with frustration and stress. Comparisons with related longitudinal research using other delay situations help to clarify the important features of the situations and person variables involved in different aspects of delay of gratification.
Social networks in primates: smart and tolerant species have more efficient networks.

PubMed

Pasquaretta, Cristian; Levé, Marine; Claidière, Nicolas; van de Waal, Erica; Whiten, Andrew; MacIntosh, Andrew J J; Pelé, Marie; Bergstrom, Mackenzie L; Borgeaud, Christèle; Brosnan, Sarah F; Crofoot, Margaret C; Fedigan, Linda M; Fichtel, Claudia; Hopper, Lydia M; Mareno, Mary Catherine; Petit, Odile; Schnoell, Anna Viktoria; di Sorrentino, Eugenia Polizzi; Thierry, Bernard; Tiddi, Barbara; Sueur, Cédric

2014-12-23

Network optimality has been described in genes, proteins and human communicative networks. In the latter, optimality leads to the efficient transmission of information with a minimum number of connections. Whilst studies show that differences in centrality exist in animal networks with central individuals having higher fitness, network efficiency has never been studied in animal groups. Here we studied 78 groups of primates (24 species). We found that group size and neocortex ratio were correlated with network efficiency. Centralisation (whether several individuals are central in the group) and modularity (how a group is clustered) had opposing effects on network efficiency, showing that tolerant species have more efficient networks. Such network properties affecting individual fitness could be shaped by natural selection. Our results are in accordance with the social brain and cultural intelligence hypotheses, which suggest that the importance of network efficiency and information flow through social learning relates to cognitive abilities.
Social networks in primates: smart and tolerant species have more efficient networks

PubMed Central

Pasquaretta, Cristian; Levé, Marine; Claidière, Nicolas; van de Waal, Erica; Whiten, Andrew; MacIntosh, Andrew J. J.; Pelé, Marie; Bergstrom, Mackenzie L.; Borgeaud, Christèle; Brosnan, Sarah F.; Crofoot, Margaret C.; Fedigan, Linda M.; Fichtel, Claudia; Hopper, Lydia M.; Mareno, Mary Catherine; Petit, Odile; Schnoell, Anna Viktoria; di Sorrentino, Eugenia Polizzi; Thierry, Bernard; Tiddi, Barbara; Sueur, Cédric

2014-01-01

Network optimality has been described in genes, proteins and human communicative networks. In the latter, optimality leads to the efficient transmission of information with a minimum number of connections. Whilst studies show that differences in centrality exist in animal networks with central individuals having higher fitness, network efficiency has never been studied in animal groups. Here we studied 78 groups of primates (24 species). We found that group size and neocortex ratio were correlated with network efficiency. Centralisation (whether several individuals are central in the group) and modularity (how a group is clustered) had opposing effects on network efficiency, showing that tolerant species have more efficient networks. Such network properties affecting individual fitness could be shaped by natural selection. Our results are in accordance with the social brain and cultural intelligence hypotheses, which suggest that the importance of network efficiency and information flow through social learning relates to cognitive abilities. PMID:25534964
Lambda network having 2{sup m{minus}1} nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, L.M. Jr.

1995-11-28

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance. 14 figs.
Performance Evaluation of Telemedicine System based on multicasting over Heterogeneous Network.

PubMed

Yun, H Y; Yoo, S K; Kim, D K; Rim Kim, Sung

2005-01-01

For appropriate diagnosis, medical image such as high quality image of patient's affected part and vital signal, patient information, and teleconferencing data for communication between specialists will be transmitted. After connecting patient and specialist the center, sender acquires patient data and transmits to the center through TCP/IP protocol. Data that is transmitted to center is retransmitted to each specialist side that accomplish connection after being copied according to listener's number from transmission buffer. At transmission of medical information data in network, transmission delay and loss occur by the change of buffer size, packet size, number of user and kind of networks. As there lies the biggest delay possibility in ADSL, buffer Size should be established by 1Mbytes first to minimize transmission regionalism and each packet's size must be set accordingly to MTU Size in order to improve network efficiency by maximum. Also, listener's number should be limited by less than 6 people. Data transmission consisted smoothly all in experiment result in common use network- ADSL, VDSL, WLAN, LAN-. But, possibility of delay appeared most greatly in ADSL that has the most confined bandwidth. To minimize the possibility of delay, some adjustment is needed such as buffer size, number of receiver, packet size.
The Comprehension and Use of Self-Control Strategies for Delay Tolerance in Adjusted and Behaviorally-Disordered Kindergarten Children.

ERIC Educational Resources Information Center

Gallagher, Richard

In order to investigate the relationship between problems in behavioral control and children's capacity to utilize mediational strategies for self control, the responses of a group of disruptive (N=20) and nondisruptive (N=20) kindergarten children were compared in their approach to delay of gratification tasks. Subjects were compared on three…
Optimal therapies of a virus replication model with pharmacological delays based on reverse transcriptase inhibitors and protease inhibitors

NASA Astrophysics Data System (ADS)

Pei, Yongzhen; Li, Changguo; Liang, Xiyin

2017-11-01

A short delay in the pharmacological effect on account of the time required for drug absorption, distribution, and penetration into target cells after application of any anti-viral drug, is defined by the pharmacological delay (Herz et al 1996 Proc. Natl Acad. Sci. USA 93 7247-51). In this paper, a virus replication model with Beddington-DeAngelis incidence rate and the pharmacological and intracellular delays is presented to describe the treatment to cure the virus infection. The optimal controls represent the efficiency of reverse transcriptase inhibitors and protease inhibitors in suppressing viral production and prohibiting new infections. Due to the fact that both the control and state variables contain delays, we derive a necessary conditions for our optimal problem. Based on these results, numerical simulations are implemented not only to show the optimal therapeutic schedules for different infection and release rates, but also to compare the effective of three treatment programs. Furthermore, comparison of therapeutic effects under different maximum tolerable dosages is shown. Our research indicates that (1) the proper and specific treatment program should be determined according to the infection rates of different virus particles; (2) the optimal combined drug treatment is the most efficient; (3) the appropriate proportion of medicament must be formulated during the therapy due to the non-monotonic relationship between maximum tolerable dosages and therapeutic effects; (4) the therapeutic effect is advantageous when the pharmacological delay is considered.
Motion Imagery and Robotics Application (MIRA)

NASA Technical Reports Server (NTRS)

Martinez, Lindolfo; Rich, Thomas

2011-01-01

Objectives include: I. Prototype a camera service leveraging the CCSDS Integrated protocol stack (MIRA/SM&C/AMS/DTN): a) CCSDS MIRA Service (New). b) Spacecraft Monitor and Control (SM&C). c) Asynchronous Messaging Service (AMS). d) Delay/Disruption Tolerant Networking (DTN). II. Additional MIRA Objectives: a) Demo of Camera Control through ISS using CCSDS protocol stack (Berlin, May 2011). b) Verify that the CCSDS standards stack can provide end-to-end space camera services across ground and space environments. c) Test interoperability of various CCSDS protocol standards. d) Identify overlaps in the design and implementations of the CCSDS protocol standards. e) Identify software incompatibilities in the CCSDS stack interfaces. f) Provide redlines to the SM&C, AMS, and DTN working groups. d) Enable the CCSDS MIRA service for potential use in ISS Kibo camera commanding. e) Assist in long-term evolution of this entire group of CCSDS standards to TRL 6 or greater.
Fault-Tolerant Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R. (Inventor)

2014-01-01

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

Remote Collaboration on Task Scheduling for Humans at Mars

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2006-01-01

As humans venture farther from Earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.
In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2006-01-01

As humans venture farther from earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, there are many reasons why the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.
Moving Toward Space Internetworking via DTN: Its Operational Challenges, Benefits, and Management

NASA Technical Reports Server (NTRS)

Barkley, Erik; Burleigh, Scott; Gladden, Roy; Malhotra, Shan; Shames, Peter

2010-01-01

The international space community has begun to recognize that the established model for management of communications with spacecraft - commanded data transmission over individual pair-wise contacts - is operationally unwieldy and will not scale in support of increasingly complex and sophisticated missions such as NASA's Constellation project. Accordingly, the international Inter-Agency Operations Advisory Group (IOAG) ichartered a Space Internetworking Strategy Group (SISG), which released its initial recommendations in a November 2008 report. The report includes a recommendation that the space flight community adopt Delay-Tolerant Networking (DTN) to address the problem of interoperability and communication scaling, especially in mission environments where there are multiple spacecraft operating in concert. This paper explores some of the issues that must be addressed in implementing, deploying, and operating DTN as part of a multi-mission, multi-agency space internetwork as well as benefits and future operational scenarios afforded by DTN-based space internetworking.
Dynamic behavior of the interaction between epidemics and cascades on heterogeneous networks

NASA Astrophysics Data System (ADS)

Jiang, Lurong; Jin, Xinyu; Xia, Yongxiang; Ouyang, Bo; Wu, Duanpo

2014-12-01

Epidemic spreading and cascading failure are two important dynamical processes on complex networks. They have been investigated separately for a long time. But in the real world, these two dynamics sometimes may interact with each other. In this paper, we explore a model combined with the SIR epidemic spreading model and a local load sharing cascading failure model. There exists a critical value of the tolerance parameter for which the epidemic with high infection probability can spread out and infect a fraction of the network in this model. When the tolerance parameter is smaller than the critical value, the cascading failure cuts off the abundance of paths and blocks the spreading of the epidemic locally. While the tolerance parameter is larger than the critical value, the epidemic spreads out and infects a fraction of the network. A method for estimating the critical value is proposed. In simulations, we verify the effectiveness of this method in the uncorrelated configuration model (UCM) scale-free networks.
Tolerance allocation for an electronic system using neural network/Monte Carlo approach

NASA Astrophysics Data System (ADS)

Al-Mohammed, Mohammed; Esteve, Daniel; Boucher, Jaque

2001-12-01

The intense global competition to produce quality products at a low cost has led many industrial nations to consider tolerances as a key factor to bring about cost as well as to remain competitive. In actually, Tolerance allocation stays widely applied on the Mechanic System. It is known that to study the tolerances in an electronic domain, Monte-Carlo method well be used. But the later method spends a long time. This paper reviews several methods (Worst-case, Statistical Method, Least Cost Allocation by Optimization methods) that can be used for treating the tolerancing problem for an Electronic System and explains their advantages and their limitations. Then, it proposes an efficient method based on the Neural Networks associated with Monte-Carlo method as basis data. The network is trained using the Error Back Propagation Algorithm to predict the individual part tolerances, minimizing the total cost of the system by a method of optimization. This proposed approach has been applied on Small-Signal Amplifier Circuit as an example. This method can be easily extended to a complex system of n-components.
Time-delayed directional beam phased array antenna

DOEpatents

Fund, Douglas Eugene; Cable, John William; Cecil, Tony Myron

2004-10-19

An antenna comprising a phased array of quadrifilar helix or other multifilar antenna elements and a time-delaying feed network adapted to feed the elements. The feed network can employ a plurality of coaxial cables that physically bridge a microstrip feed circuitry to feed power signals to the elements. The cables provide an incremental time delay which is related to their physical lengths, such that replacing cables having a first set of lengths with cables having a second set of lengths functions to change the time delay and shift or steer the antenna's main beam. Alternatively, the coaxial cables may be replaced with a programmable signal processor unit adapted to introduce the time delay using signal processing techniques applied to the power signals.
Method and Apparatus for Reducing the Vulnerability of Latches to Single Event Upsets

NASA Technical Reports Server (NTRS)

Shuler, Robert L., Jr. (Inventor)

2002-01-01

A delay circuit includes a first network having an input and an output node, a second network having an input and an output, the input of the second network being coupled to the output node of the first network. The first network and the second network are configured such that: a glitch at the input to the first network having a length of approximately one-half of a standard glitch time or less does not cause the voltage at the output of the second network to cross a threshold, a glitch at the input to the first network having a length of between approximately one-half and two standard glitch times causes the voltage at the output of the second network to cross the threshold for less than the length of the glitch, and a glitch at the input to the first network having a length of greater than approximately two standard glitch times causes the voltage at the output of the second network to cross the threshold for approximately the time of the glitch. The method reduces the vulnerability of a latch to single event upsets. The latch includes a gate having an input and an output and a feedback path from the output to the input of the gate. The method includes inserting a delay into the feedback path and providing a delay in the gate.
Method and Apparatus for Reducing the Vulnerability of Latches to Single Event Upsets

NASA Technical Reports Server (NTRS)

Shuler, Robert L., Jr. (Inventor)

2002-01-01

A delay circuit includes a first network having an input and an output node, a second network having an input and an output, the input of the second network being coupled to the output node of the first network. The first network and the second network are configured such that: a glitch at the input to the first network having a length of approximately one-half of a standard glitch time or less does not cause tile voltage at the output of the second network to cross a threshold, a glitch at the input to the first network having a length of between approximately one-half and two standard glitch times causes the voltage at the output of the second network to cross the threshold for less than the length of the glitch, and a glitch at the input to the first network having a length of greater than approximately two standard glitch times causes the voltage at the output of the second network to cross the threshold for approximately the time of the glitch. A method reduces the vulnerability of a latch to single event upsets. The latch includes a gate having an input and an output and a feedback path from the output to the input of the gate. The method includes inserting a delay into the feedback path and providing a delay in the gate.
Delayed lead perforation: a disturbing trend.

PubMed

Khan, Mohammed N; Joseph, George; Khaykin, Yaariv; Ziada, Khaled M; Wilkoff, Bruce L

2005-03-01

Delayed lead perforation (occurring more than 1 month after implantation) is a rare complication. Its pathophysiology and optimal management are currently unclear. Three cases of delayed lead perforation (6-10 month) were identified in patients with low-profile active fixation leads. All cases presented in a subacute fashion with pleuritic chest pain with confirmatory chest x-ray and device interrogation. Given the potential complications of a perforated lead, all cases had the lead extracted under TEE observation with cardiac surgery backup in the operating room. All patients tolerated extraction without complication. Based on these cases, we recommend a management scheme for patients who present with delayed lead perforation.
Robust stability for uncertain stochastic fuzzy BAM neural networks with time-varying delays

NASA Astrophysics Data System (ADS)

Syed Ali, M.; Balasubramaniam, P.

2008-07-01

In this Letter, by utilizing the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, we analyze the global asymptotic stability of uncertain stochastic fuzzy Bidirectional Associative Memory (BAM) neural networks with time-varying delays which are represented by the Takagi-Sugeno (TS) fuzzy models. A new class of uncertain stochastic fuzzy BAM neural networks with time varying delays has been studied and sufficient conditions have been derived to obtain conservative result in stochastic settings. The developed results are more general than those reported in the earlier literatures. In addition, the numerical examples are provided to illustrate the applicability of the result using LMI toolbox in MATLAB.
Synchronization stability of memristor-based complex-valued neural networks with time delays.

PubMed

Liu, Dan; Zhu, Song; Ye, Er

2017-12-01

This paper focuses on the dynamical property of a class of memristor-based complex-valued neural networks (MCVNNs) with time delays. By constructing the appropriate Lyapunov functional and utilizing the inequality technique, sufficient conditions are proposed to guarantee exponential synchronization of the coupled systems based on drive-response concept. The proposed results are very easy to verify, and they also extend some previous related works on memristor-based real-valued neural networks. Meanwhile, the obtained sufficient conditions of this paper may be conducive to qualitative analysis of some complex-valued nonlinear delayed systems. A numerical example is given to demonstrate the effectiveness of our theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.
Adaptive Control of Synchronization in Delay-Coupled Heterogeneous Networks of FitzHugh-Nagumo Nodes

NASA Astrophysics Data System (ADS)

Plotnikov, S. A.; Lehnert, J.; Fradkov, A. L.; Schöll, E.

We study synchronization in delay-coupled neural networks of heterogeneous nodes. It is well known that heterogeneities in the nodes hinder synchronization when becoming too large. We show that an adaptive tuning of the overall coupling strength can be used to counteract the effect of the heterogeneity. Our adaptive controller is demonstrated on ring networks of FitzHugh-Nagumo systems which are paradigmatic for excitable dynamics but can also — depending on the system parameters — exhibit self-sustained periodic firing. We show that the adaptively tuned time-delayed coupling enables synchronization even if parameter heterogeneities are so large that excitable nodes coexist with oscillatory ones.
Bipartite consensus for multi-agent systems with antagonistic interactions and communication delays

NASA Astrophysics Data System (ADS)

Guo, Xing; Lu, Jianquan; Alsaedi, Ahmed; Alsaadi, Fuad E.

2018-04-01

This paper studies the consensus problems over signed digraphs with arbitrary finite communication delays. For the considered system, the information flow is directed and only locally delayed information can be used for each node. We derive that bipartite consensus of this system can be realized when the associated signed digraph is strongly connected. Furthermore, for structurally balanced networks, this paper studies the pinning partite consensus for the considered system. we design a pinning scheme to pin any one agent in the signed network, and obtain that the network achieves pinning bipartite consensus with any initial conditions. Finally, two examples are provided to demonstrate the effectiveness of our main results.
Cascading Policies Provide Fault Tolerance for Pervasive Clinical Communications.

PubMed

Williams, Rose; Jalan, Srikant; Stern, Edie; Lussier, Yves A

2005-03-21

We implemented an end-to-end notification system that pushed urgent clinical laboratory results to Blackberry 7510 devices over the Nextel cellular network. We designed our system to use user roles and notification policies to abstract and execute clinical notification procedures. We anticipated some problems with dropped and non-delivered messages when the device was out-of-network, however, we did not expect the same problems in other situations like device reconnection to the network. We addressed these problems by creating cascading "fault tolerance" policies to drive notification escalation when messages timed-out or delivery failed. This paper describes our experience in providing an adaptable, fault tolerant pervasive notification system for delivering secure, critical, time-sensitive patient laboratory results.
CFTLB: a novel cross-layer fault tolerant and load balancing protocol for WMN

NASA Astrophysics Data System (ADS)

Krishnaveni, N. N.; Chitra, K.

2017-12-01

Wireless mesh network (WMN) forms a wireless backbone framework for multi-hop transmission among the routers and clients in the extensible coverage area. To improve the throughput of WMNs with multiple gateways (GWs), several issues related to GW selection, load balancing and frequent link failures due to the presence of dynamic obstacles and channel interference should be addressed. This paper presents a novel cross-layer fault tolerant and load balancing (CFTLB) protocol to overcome the issues in WMN. Initially, the neighbour GW is searched and channel load is calculated. The GW having least channel load is selected which is estimated during the arrival of the new node. The proposed algorithm finds the alternate GWs and calculates the channel availability under high loading scenarios. If the current load in the GW is high, another GW is found and channel availability is calculated. Besides, it initiates the channel switching and establishes the communication with the mesh client effectively. The utilisation of hashing technique in proposed CFTLB verifies the status of the packets and achieves better performance in terms of router average throughput, throughput, average channel access time and lower end-to-end delay, communication overhead and average data loss in the channel compared to the existing protocols.
Network Configuration Analysis for Formation Flying Satellites

NASA Technical Reports Server (NTRS)

Knoblock, Eric J.; Wallett, Thomas M.; Konangi, Vijay K.; Bhasin, Kul B.

2001-01-01

The performance of two networks to support autonomous multi-spacecraft formation flying systems is presented. Both systems are comprised of a ten-satellite formation, with one of the satellites designated as the central or 'mother ship.' All data is routed through the mother ship to the terrestrial network. The first system uses a TCP/EP over ATM protocol architecture within the formation, and the second system uses the IEEE 802.11 protocol architecture within the formation. The simulations consist of file transfers using either the File Transfer Protocol (FTP) or the Simple Automatic File Exchange (SAFE) Protocol. The results compare the IP queuing delay, IP queue size and IP processing delay at the mother ship as well as end-to-end delay for both systems. In all cases, using IEEE 802.11 within the formation yields less delay. Also, the throughput exhibited by SAFE is better than FTP.
Design of on-board Bluetooth wireless network system based on fault-tolerant technology

NASA Astrophysics Data System (ADS)

You, Zheng; Zhang, Xiangqi; Yu, Shijie; Tian, Hexiang

2007-11-01

In this paper, the Bluetooth wireless data transmission technology is applied in on-board computer system, to realize wireless data transmission between peripherals of the micro-satellite integrating electronic system, and in view of the high demand of reliability of a micro-satellite, a design of Bluetooth wireless network based on fault-tolerant technology is introduced. The reliability of two fault-tolerant systems is estimated firstly using Markov model, then the structural design of this fault-tolerant system is introduced; several protocols are established to make the system operate correctly, some related problems are listed and analyzed, with emphasis on Fault Auto-diagnosis System, Active-standby switch design and Data-Integrity process.
Local and global synchronization transitions induced by time delays in small-world neuronal networks with chemical synapses.

PubMed

Yu, Haitao; Wang, Jiang; Du, Jiwei; Deng, Bin; Wei, Xile

2015-02-01

Effects of time delay on the local and global synchronization in small-world neuronal networks with chemical synapses are investigated in this paper. Numerical results show that, for both excitatory and inhibitory coupling types, the information transmission delay can always induce synchronization transitions of spiking neurons in small-world networks. In particular, regions of in-phase and out-of-phase synchronization of connected neurons emerge intermittently as the synaptic delay increases. For excitatory coupling, all transitions to spiking synchronization occur approximately at integer multiples of the firing period of individual neurons; while for inhibitory coupling, these transitions appear at the odd multiples of the half of the firing period of neurons. More importantly, the local synchronization transition is more profound than the global synchronization transition, depending on the type of coupling synapse. For excitatory synapses, the local in-phase synchronization observed for some values of the delay also occur at a global scale; while for inhibitory ones, this synchronization, observed at the local scale, disappears at a global scale. Furthermore, the small-world structure can also affect the phase synchronization of neuronal networks. It is demonstrated that increasing the rewiring probability can always improve the global synchronization of neuronal activity, but has little effect on the local synchronization of neighboring neurons.
Simultaneous energy harvesting and information processing in wireless multiple relays with multiple antennas

NASA Astrophysics Data System (ADS)

Albaaj, Azhar; Makki, S. Vahab A.; Alabkhat, Qassem; Zahedi, Abdulhamid

2017-07-01

Wireless networks suffer from battery discharging specially in cooperative communications when multiple relays have an important role but they are energy constrained. To overcome this problem, energy harvesting from radio frequency signals is applied to charge the node battery. These intermediate nodes have the ability to harvest energy from the source signal and use the energy harvested to transmit information to the destination. In fact, the node tries to harvest energy and then transmit the data to destination. Division of energy harvesting and data transmission can be done in two algorithms: time-switching-based relaying protocol and power-splitting-based relaying protocol. These two algorithms also can be applied in delay-limited and delay-tolerant transmission systems. The previous works have assumed a single relay for energy harvesting, but in this article, the proposed method is concentrated on improving the outage probability and throughput by using multiple antennas in each relay node instead of using single antenna. According to our simulation results, when using multi-antenna relays, ability of energy harvesting is increased and thus system performance will be improved to great extent. Maximum ratio combining scheme has been used when the destination chooses the best signal of relays and antennas satisfying the required signal-to-noise ratio.
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.

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.
New Approaches For Asteroid Spin State and Shape Modeling From Delay-Doppler Radar Images

NASA Astrophysics Data System (ADS)

Raissi, Chedy; Lamee, Mehdi; Mosiane, Olorato; Vassallo, Corinne; Busch, Michael W.; Greenberg, Adam; Benner, Lance A. M.; Naidu, Shantanu P.; Duong, Nicholas

2016-10-01

Delay-Doppler radar imaging is a powerful technique to characterize the trajectories, shapes, and spin states of near-Earth asteroids; and has yielded detailed models of dozens of objects. Reconstructing objects' shapes and spins from delay-Doppler data is a computationally intensive inversion problem. Since the 1990s, delay-Doppler data has been analyzed using the SHAPE software. SHAPE performs sequential single-parameter fitting, and requires considerable computer runtime and human intervention (Hudson 1993, Magri et al. 2007). Recently, multiple-parameter fitting algorithms have been shown to more efficiently invert delay-Doppler datasets (Greenberg & Margot 2015) - decreasing runtime while improving accuracy. However, extensive human oversight of the shape modeling process is still required. We have explored two new techniques to better automate delay-Doppler shape modeling: Bayesian optimization and a machine-learning neural network.One of the most time-intensive steps of the shape modeling process is to perform a grid search to constrain the target's spin state. We have implemented a Bayesian optimization routine that uses SHAPE to autonomously search the space of spin-state parameters. To test the efficacy of this technique, we compared it to results with human-guided SHAPE for asteroids 1992 UY4, 2000 RS11, and 2008 EV5. Bayesian optimization yielded similar spin state constraints within a factor of 3 less computer runtime.The shape modeling process could be further accelerated using a deep neural network to replace iterative fitting. We have implemented a neural network with a variational autoencoder (VAE), using a subset of known asteroid shapes and a large set of synthetic radar images as inputs to train the network. Conditioning the VAE in this manner allows the user to give the network a set of radar images and get a 3D shape model as an output. Additional development will be required to train a network to reliably render shapes from delay-Doppler images.This work was supported by NASA Ames, NVIDIA, Autodesk and the SETI Institute as part of the NASA Frontier Development Lab program.
Dynamics of brain networks in the aesthetic appreciation

PubMed Central

Cela-Conde, Camilo J.; García-Prieto, Juan; Ramasco, José J.; Mirasso, Claudio R.; Bajo, Ricardo; Munar, Enric; Flexas, Albert; del-Pozo, Francisco; Maestú, Fernando

2013-01-01

Neuroimage experiments have been essential for identifying active brain networks. During cognitive tasks as in, e.g., aesthetic appreciation, such networks include regions that belong to the default mode network (DMN). Theoretically, DMN activity should be interrupted during cognitive tasks demanding attention, as is the case for aesthetic appreciation. Analyzing the functional connectivity dynamics along three temporal windows and two conditions, beautiful and not beautiful stimuli, here we report experimental support for the hypothesis that aesthetic appreciation relies on the activation of two different networks, an initial aesthetic network and a delayed aesthetic network, engaged within distinct time frames. Activation of the DMN might correspond mainly to the delayed aesthetic network. We discuss adaptive and evolutionary explanations for the relationships existing between the DMN and aesthetic networks and offer unique inputs to debates on the mind/brain interaction. PMID:23754437
INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

NASA Astrophysics Data System (ADS)

Yang, Hong-Yong; Lu, Lan; Cao, Ke-Cai; Zhang, Si-Ying

2010-04-01

In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.
OTACT: ONU Turning with Adaptive Cycle Times in Long-Reach PONs

NASA Astrophysics Data System (ADS)

Zare, Sajjad; Ghaffarpour Rahbar, Akbar

2015-01-01

With the expansion of PON networks as Long-Reach PON (LR-PON) networks, the problem of degrading the efficiency of centralized bandwidth allocation algorithms threatens this network due to high propagation delay. This is because these algorithms are based on bandwidth negotiation messages frequently exchanged between the optical line terminal (OLT) in the Central Office and optical network units (ONUs) near the users, which become seriously delayed when the network is extended. To solve this problem, some decentralized algorithms are proposed based on bandwidth negotiation messages frequently exchanged between the Remote Node (RN)/Local Exchange (LX) and ONUs near the users. The network has a relatively high delay since there are relatively large distances between RN/LX and ONUs, and therefore, control messages should travel twice between ONUs and RN/LX in order to go from one ONU to another ONU. In this paper, we propose a novel framework, called ONU Turning with Adaptive Cycle Times (OTACT), that uses Power Line Communication (PLC) to connect two adjacent ONUs. Since there is a large population density in urban areas, ONUs are closer to each other. Thus, the efficiency of the proposed method is high. We investigate the performance of the proposed scheme in contrast with other decentralized schemes under the worst case conditions. Simulation results show that the average upstream packet delay can be decreased under the proposed scheme.
A Hyper-Dense GNSS Receiver Network for Monitoring Time and Spatial Variations of Precipitable Water Vapor (PWV)

NASA Astrophysics Data System (ADS)

Tsuda, T.; Ito, N.; Takeda, Y.; Realini, E.; Shinbori, A.

2016-12-01

We employ the GNSS meteorology technique to measure precipitable water vapor (PWV) from the propagation delay of GNSS signal in the atmosphere. We installed a hyper-dense GNSS network using 15 receivers with a horizontal spacing of 1-2 km in Uji, Japan (Uji network). We also obtained precipitation with a rain gauge at a nearby operational weather station and rain cloud distribution by an X-band radar. We selected 40 days from April 2011 to March 2013, when considerable precipitation was detected. Difference in PWV within 10 km was 3-10 mm during a heavy rain. We found PWV increased 10-20 minutes before a passage of a rain cloud. The maximum value of PWV correlated well with the amount of precipitation on the ground. The variance of PWV between the GNSS sites was enhanced during a heavy rain. For a future practical hyper-dense GNSS network system with many receivers, we consider to use inexpensive single frequency (SF) receivers. Because SF receiver cannot eliminate the ionospheric delay by itself, we interpolate the delay referring the delay measured by the nearby dual frequency (DF) receivers. We investigated ionospheric delay by the Uji network, taking advantages of Quasi-Zenith Satellite System (QZSS) that gives signals at high elevation angles. During a travelling ionospheric disturbance (TID), a wavy structure with a horizontal scale of several tens km was recognized. The ionospheric delay was compensated by a linear and quadratic interpolation, then the resulting error of PWV compared with DF solution was about 1.50 mm in RMS. For a real-time estimation of PWV, we used real-time satellite clock information corrected by GEONET. Difference of PWV between the real-time analysis and the post processing with the final orbit was 0.7 mm in RMS. We estimated an overall error of PWV with a dense SF-receiver network on a real-time basis was 1.7 mm in RMS.
Delay-range-dependent chaos synchronization approach under varying time-lags and delayed nonlinear coupling.

PubMed

Zaheer, Muhammad Hamad; Rehan, Muhammad; Mustafa, Ghulam; Ashraf, Muhammad

2014-11-01

This paper proposes a novel state feedback delay-range-dependent control approach for chaos synchronization in coupled nonlinear time-delay systems. The coupling between two systems is esteemed to be nonlinear subject to time-lags. Time-varying nature of both the intrinsic and the coupling delays is incorporated to broad scope of the present study for a better-quality synchronization controller synthesis. Lyapunov-Krasovskii (LK) functional is employed to derive delay-range-dependent conditions that can be solved by means of the conventional linear matrix inequality (LMI)-tools. The resultant control approach for chaos synchronization of the master-slave time-delay systems considers non-zero lower bound of the intrinsic as well as the coupling time-delays. Further, the delay-dependent synchronization condition has been established as a special case of the proposed LK functional treatment. Furthermore, a delay-range-dependent condition, independent of the delay-rate, has been provided to address the situation when upper bound of the delay-derivative is unknown. A robust state feedback control methodology is formulated for synchronization of the time-delay chaotic networks against the L2 norm bounded perturbations by minimizing the L2 gain from the disturbance to the synchronization error. Numerical simulation results are provided for the time-delay chaotic networks to show effectiveness of the proposed delay-range-dependent chaos synchronization methodologies. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.
Processing short-term and long-term information with a combination of polynomial approximation techniques and time-delay neural networks.

PubMed

Fuchs, Erich; Gruber, Christian; Reitmaier, Tobias; Sick, Bernhard

2009-09-01

Neural networks are often used to process temporal information, i.e., any kind of information related to time series. In many cases, time series contain short-term and long-term trends or behavior. This paper presents a new approach to capture temporal information with various reference periods simultaneously. A least squares approximation of the time series with orthogonal polynomials will be used to describe short-term trends contained in a signal (average, increase, curvature, etc.). Long-term behavior will be modeled with the tapped delay lines of a time-delay neural network (TDNN). This network takes the coefficients of the orthogonal expansion of the approximating polynomial as inputs such considering short-term and long-term information efficiently. The advantages of the method will be demonstrated by means of artificial data and two real-world application examples, the prediction of the user number in a computer network and online tool wear classification in turning.
A mixed-signal implementation of a polychronous spiking neural network with delay adaptation

PubMed Central

Wang, Runchun M.; Hamilton, Tara J.; Tapson, Jonathan C.; van Schaik, André

2014-01-01

We present a mixed-signal implementation of a re-configurable polychronous spiking neural network capable of storing and recalling spatio-temporal patterns. The proposed neural network contains one neuron array and one axon array. Spike Timing Dependent Delay Plasticity is used to fine-tune delays and add dynamics to the network. In our mixed-signal implementation, the neurons and axons have been implemented as both analog and digital circuits. The system thus consists of one FPGA, containing the digital neuron array and the digital axon array, and one analog IC containing the analog neuron array and the analog axon array. The system can be easily configured to use different combinations of each. We present and discuss the experimental results of all combinations of the analog and digital axon arrays and the analog and digital neuron arrays. The test results show that the proposed neural network is capable of successfully recalling more than 85% of stored patterns using both analog and digital circuits. PMID:24672422
A mixed-signal implementation of a polychronous spiking neural network with delay adaptation.

PubMed

Wang, Runchun M; Hamilton, Tara J; Tapson, Jonathan C; van Schaik, André

2014-01-01

We present a mixed-signal implementation of a re-configurable polychronous spiking neural network capable of storing and recalling spatio-temporal patterns. The proposed neural network contains one neuron array and one axon array. Spike Timing Dependent Delay Plasticity is used to fine-tune delays and add dynamics to the network. In our mixed-signal implementation, the neurons and axons have been implemented as both analog and digital circuits. The system thus consists of one FPGA, containing the digital neuron array and the digital axon array, and one analog IC containing the analog neuron array and the analog axon array. The system can be easily configured to use different combinations of each. We present and discuss the experimental results of all combinations of the analog and digital axon arrays and the analog and digital neuron arrays. The test results show that the proposed neural network is capable of successfully recalling more than 85% of stored patterns using both analog and digital circuits.
Optimal design of mixed-media packet-switching networks - Routing and capacity assignment

NASA Technical Reports Server (NTRS)

Huynh, D.; Kuo, F. F.; Kobayashi, H.

1977-01-01

This paper considers a mixed-media packet-switched computer communication network which consists of a low-delay terrestrial store-and-forward subnet combined with a low-cost high-bandwidth satellite subnet. We show how to route traffic via ground and/or satellite links by means of static, deterministic procedures and assign capacities to channels subject to a given linear cost such that the network average delay is minimized. Two operational schemes for this network model are investigated: one is a scheme in which the satellite channel is used as a slotted ALOHA channel; the other is a new multiaccess scheme we propose in which whenever a channel collision occurs, retransmission of the involved packets will route through ground links to their destinations. The performance of both schemes is evaluated and compared in terms of cost and average packet delay tradeoffs for some examples. The results offer guidelines for the design and optimal utilization of mixed-media networks.
Echo state networks with filter neurons and a delay&sum readout.

PubMed

Holzmann, Georg; Hauser, Helmut

2010-03-01

Echo state networks (ESNs) are a novel approach to recurrent neural network training with the advantage of a very simple and linear learning algorithm. It has been demonstrated that ESNs outperform other methods on a number of benchmark tasks. Although the approach is appealing, there are still some inherent limitations in the original formulation. Here we suggest two enhancements of this network model. First, the previously proposed idea of filters in neurons is extended to arbitrary infinite impulse response (IIR) filter neurons. This enables such networks to learn multiple attractors and signals at different timescales, which is especially important for modeling real-world time series. Second, a delay&sum readout is introduced, which adds trainable delays in the synaptic connections of output neurons and therefore vastly improves the memory capacity of echo state networks. It is shown in commonly used benchmark tasks and real-world examples, that this new structure is able to significantly outperform standard ESNs and other state-of-the-art models for nonlinear dynamical system modeling. Copyright 2009 Elsevier Ltd. All rights reserved.
Delay-time distribution in the scattering of time-narrow wave packets (II)—quantum graphs

NASA Astrophysics Data System (ADS)

Smilansky, Uzy; Schanz, Holger

2018-02-01

We apply the framework developed in the preceding paper in this series (Smilansky 2017 J. Phys. A: Math. Theor. 50 215301) to compute the time-delay distribution in the scattering of ultra short radio frequency pulses on complex networks of transmission lines which are modeled by metric (quantum) graphs. We consider wave packets which are centered at high wave number and comprise many energy levels. In the limit of pulses of very short duration we compute upper and lower bounds to the actual time-delay distribution of the radiation emerging from the network using a simplified problem where time is replaced by the discrete count of vertex-scattering events. The classical limit of the time-delay distribution is also discussed and we show that for finite networks it decays exponentially, with a decay constant which depends on the graph connectivity and the distribution of its edge lengths. We illustrate and apply our theory to a simple model graph where an algebraic decay of the quantum time-delay distribution is established.
Outer synchronization of complex networks with internal delay and coupling delay via aperiodically intermittent pinning control

NASA Astrophysics Data System (ADS)

Zhang, Chuan; Wang, Xingyuan; Wang, Chunpeng; Xia, Zhiqiu

This paper concerns the outer synchronization problem between two complex delayed networks via the method of aperiodically intermittent pinning control. Apart from previous works, internal delay and coupling delay are both involved in this model, and the designed intermittent controllers can be aperiodic. The main work in this paper can be summarized as follows: First, two cases of aperiodically intermittent control with constant gain and adaptive gain are implemented, respectively. The intermittent control and pinning control are combined to reduce consumptions further. Then, based on the Lyapunov stability theory, synchronization protocols are given by strict derivation. Especially, the designed controllers are indeed simple and valid in application of theory to practice. Finally, numerical examples put the proposed control methods to the test.
A Cross-Layer Optimized Opportunistic Routing Scheme for Loss-and-Delay Sensitive WSNs

PubMed Central

Xu, Xin; Yuan, Minjiao; Liu, Xiao; Cai, Zhiping; Wang, Tian

2018-01-01

In wireless sensor networks (WSNs), communication links are typically error-prone and unreliable, so providing reliable and timely data routing for loss- and delay-sensitive applications in WSNs it is a challenge issue. Additionally, with specific thresholds in practical applications, the loss and delay sensitivity implies requirements for high reliability and low delay. Opportunistic Routing (OR) has been well studied in WSNs to improve reliability for error-prone and unreliable wireless communication links where the transmission power is assumed to be identical in the whole network. In this paper, a Cross-layer Optimized Opportunistic Routing (COOR) scheme is proposed to improve the communication link reliability and reduce delay for loss-and-delay sensitive WSNs. The main contribution of the COOR scheme is making full use of the remaining energy in networks to increase the transmission power of most nodes, which will provide a higher communication reliability or further transmission distance. Two optimization strategies referred to as COOR(R) and COOR(P) of the COOR scheme are proposed to improve network performance. In the case of increasing the transmission power, the COOR(R) strategy chooses a node that has a higher communication reliability with same distance in comparison to the traditional opportunistic routing when selecting the next hop candidate node. Since the reliability of data transmission is improved, the delay of the data reaching the sink is reduced by shortening the time of communication between candidate nodes. On the other hand, the COOR(P) strategy prefers a node that has the same communication reliability with longer distance. As a result, network performance can be improved for the following reasons: (a) the delay is reduced as fewer hops are needed while the packet reaches the sink in longer transmission distance circumstances; (b) the reliability can be improved since it is the product of the reliability of every hop of the routing path, and the count is reduced while the reliability of each hop is the same as the traditional method. After analyzing the energy consumption of the network in detail, the value of optimized transmission power in different areas is given. On the basis of a large number of experimental and theoretical analyses, the results show that the COOR scheme will increase communication reliability by 36.62–87.77%, decrease delay by 21.09–52.48%, and balance the energy consumption of 86.97% of the nodes in the WSNs. PMID:29751589
A Cross-Layer Optimized Opportunistic Routing Scheme for Loss-and-Delay Sensitive WSNs.

PubMed

Xu, Xin; Yuan, Minjiao; Liu, Xiao; Liu, Anfeng; Xiong, Neal N; Cai, Zhiping; Wang, Tian

2018-05-03

In wireless sensor networks (WSNs), communication links are typically error-prone and unreliable, so providing reliable and timely data routing for loss- and delay-sensitive applications in WSNs it is a challenge issue. Additionally, with specific thresholds in practical applications, the loss and delay sensitivity implies requirements for high reliability and low delay. Opportunistic Routing (OR) has been well studied in WSNs to improve reliability for error-prone and unreliable wireless communication links where the transmission power is assumed to be identical in the whole network. In this paper, a Cross-layer Optimized Opportunistic Routing (COOR) scheme is proposed to improve the communication link reliability and reduce delay for loss-and-delay sensitive WSNs. The main contribution of the COOR scheme is making full use of the remaining energy in networks to increase the transmission power of most nodes, which will provide a higher communication reliability or further transmission distance. Two optimization strategies referred to as COOR(R) and COOR(P) of the COOR scheme are proposed to improve network performance. In the case of increasing the transmission power, the COOR(R) strategy chooses a node that has a higher communication reliability with same distance in comparison to the traditional opportunistic routing when selecting the next hop candidate node. Since the reliability of data transmission is improved, the delay of the data reaching the sink is reduced by shortening the time of communication between candidate nodes. On the other hand, the COOR(P) strategy prefers a node that has the same communication reliability with longer distance. As a result, network performance can be improved for the following reasons: (a) the delay is reduced as fewer hops are needed while the packet reaches the sink in longer transmission distance circumstances; (b) the reliability can be improved since it is the product of the reliability of every hop of the routing path, and the count is reduced while the reliability of each hop is the same as the traditional method. After analyzing the energy consumption of the network in detail, the value of optimized transmission power in different areas is given. On the basis of a large number of experimental and theoretical analyses, the results show that the COOR scheme will increase communication reliability by 36.62⁻87.77%, decrease delay by 21.09⁻52.48%, and balance the energy consumption of 86.97% of the nodes in the WSNs.
Modulation between high- and low-frequency transcutaneous electric nerve stimulation delays the development of analgesic tolerance in arthritic rats.

PubMed

Desantana, Josimari M; Santana-Filho, Valter J; Sluka, Kathleen A

2008-04-01

To investigate whether repeated administration of modulating frequency transcutaneous electric nerve stimulation (TENS) prevents development of analgesic tolerance. Knee joint inflammation (3% carrageenan and kaolin) was induced in rats. Either mixed or alternating frequency was administered daily (20min) for 2 weeks to the inflamed knee under light halothane anesthesia (1%-2%). Laboratory. Adult male Sprague-Dawley rats (N=36). Mixed- (4Hz and 100Hz) or alternating- (4Hz on 1 day; 100Hz on the next day) frequency TENS at sensory intensity and 100micros pulse duration. Paw and joint withdrawal thresholds to mechanical stimuli were assessed before induction of inflammation, and before and after daily application of TENS. The reduced paw and joint withdrawal thresholds that occur 24 hours after the induction of inflammation were significantly reversed by the first administration of TENS when compared with sham treatment or to the condition before TENS treatment, which was observed through day 9. By the tenth day, repeated daily administration of either mixed- or alternating-frequency TENS did not reverse the decreased paw and joint withdrawal thresholds. These data suggest that repeated administration of modulating frequency TENS leads to a development of opioid tolerance. However, this tolerance effect is delayed by approximately 5 days compared with administration of low- or high-frequency TENS independently. Clinically, we can infer that a treatment schedule of repeated daily TENS administration will result in a tolerance effect. Moreover, modulating low and high frequency TENS seems to produce a better analgesic effect and tolerance is slower to develop.
Study on the potential for delay tolerant networks by health workers in low resource settings.

PubMed

Syed-Abdul, Shabbir; Scholl, Jeremiah; Lee, Peisan; Jian, Wen-Shan; Liou, Der-Ming; Li, Yu-Chuan

2012-09-01

Medical Informatics Systems (MIS) have been suggested as having great potential to improve health care delivery in low resource settings. One of the major barriers for adopting MIS in this context is a lack of adequate network/communication infrastructure. Delay Tolerant Networking (DTN) is an approach for establishing network connectivity in situations where it is possible to support physical transport of the digital information. To date most DTN research has been technically oriented, and very few services have been implemented to support healthcare systems using the technology. It is thus unclear about the potential that DTN may have for supporting MIS systems in low resource settings. The goals of the paper are twofold, first, to gain an initial estimate of interest in different services that can be supported by DTN. Second, to find out the necessary frequency associated with each service for supporting health work in low resource settings. Fifty questionnaires were distributed to attendants at the International Conference on Global Health that had acknowledged having health work experience in a poor connectivity context. The respondents were using a 5-point Likert scale regarding if 9 different potential DTN services "would be useful". They also were asked how often data delivery would be necessary for these services to be useful. The Chi square was calculated to measure acceptance. 37 responses were received, aggregating the response rate of 74%. The respondents represented having work experience from 8 months to 15 years from 35 resource poor countries. The Chi square test showed very high statistical significance for "strongly agree and agree" for the potential usefulness of the proposed DTN services, with a p-value less than 0.001. The frequency of data delivery that would be necessary for services to be useful varied considerably. This study provides evidence of potential for DTN to support useful services that support health work in low resource settings, and that services like access to email, notification of lab results, backup of EHR and teleconsultation are seem to be most important services that can be supported by DTN. The necessary frequency of data delivery for each service, will be highly dependent on context. In a low resource setting with limited mobility, the physical transport of digital data at a frequency of less than once per week should still be sufficient for useful services like notification of lab results and ordering of medical supplies. Research comparing different methods for delivery of DTN data should thus be useful. Further research and collaboration between MIS and Computer Science research communities is recommended in order to help develop DTN services that can be evaluated. Efforts to enhance awareness among stakeholders about how DTN can be used to support health services should be worthwhile. Copyright © 2011. Published by Elsevier Ireland Ltd.
Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

NASA Astrophysics Data System (ADS)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.
The small-molecule TNF-α inhibitor, UTL-5g, delays deaths and increases survival rates for mice treated with high doses of cisplatin

PubMed Central

Media, Joseph; Chen, Ben; Valeriote, Fredrick

2013-01-01

Purpose UTL-5g is a novel small-molecule chemoprotector that lowers hepatotoxicity, nephrotoxicity, and myelotoxicity induced by cisplatin through TNF-α inhibition among other factors. The objective of this study was to investigate whether UTL-5g can reduce the overall acute toxicity of cisplatin and increase cisplatin tolerability in mice. Materials and Methods BDF1 female mice were treated individually with UTL-5g (suspended in Ora-Plus) by oral gavage at 60 mg/kg, 30 min before i.p. injection of cisplatin at 10, 15, and 20 mg/kg respectively on Day 0. Starting from Day 1, individual mice were again treated daily by the same dose of UTL-5g for 4 consecutive days. Survivals and bodyweights were monitored. Results UTL-5g treatment increased the survival rate and delayed the time to death for mice treated with 150% of the maximum tolerated dose (MTD) of cisplatin (15 mg/kg). Likewise, at 200% of the MTD of cisplatin (20 mg/kg), treatment of UTL-5g increased the survival rate and delayed the time to death. Treatment of UTL-5g did not have a significant effect on weight-loss induced by cisplatin indicating that bodyweight may not be a sensitive enough measure for chemoprotection of UTL-5g against cisplatin. Conclusions In summary, UTL-5g delayed deaths and increased survival rates of mice treated by high doses of cisplatin indicating that UTL-5g is capable of reducing the overall acute toxicity of cisplatin and increased cisplatin tolerability in mice; this is in line with the specific chemoprotective effects of UTL-5g previously reported. Further investigation of UTL-5g in combination with cisplatin is warranted. PMID:23881213

The small-molecule TNF-α inhibitor, UTL-5g, delays deaths and increases survival rates for mice treated with high doses of cisplatin.

PubMed

Shaw, Jiajiu; Media, Joseph; Chen, Ben; Valeriote, Fredrick

2013-09-01

UTL-5g is a novel small-molecule chemoprotector that lowers hepatotoxicity, nephrotoxicity, and myelotoxicity induced by cisplatin through TNF-α inhibition among other factors. The objective of this study was to investigate whether UTL-5g can reduce the overall acute toxicity of cisplatin and increase cisplatin tolerability in mice. BDF1 female mice were treated individually with UTL-5g (suspended in Ora-Plus) by oral gavage at 60 mg/kg, 30 min before i.p. injection of cisplatin at 10, 15, and 20 mg/kg, respectively, on Day 0. Starting from Day 1, individual mice were again treated daily by the same dose of UTL-5g for 4 consecutive days. Survivals and body weights were monitored. UTL-5g treatment increased the survival rate and delayed the time to death for mice treated with 150 % of the maximum tolerated dose (MTD) of cisplatin (15 mg/kg). Likewise, at 200 % of the MTD of cisplatin (20 mg/kg), treatment of UTL-5g increased the survival rate and delayed the time to death. Treatment of UTL-5g did not have a significant effect on weight loss induced by cisplatin, indicating that body weight may not be a sensitive-enough measure for chemoprotection of UTL-5g against cisplatin. In summary, UTL-5g delayed deaths and increased survival rates of mice treated by high doses of cisplatin, indicating that UTL-5g is capable of reducing the overall acute toxicity of cisplatin and increased cisplatin tolerability in mice; this is in line with the specific chemoprotective effects of UTL-5g previously reported. Further investigation of UTL-5g in combination with cisplatin is warranted.
O(t-α)-synchronization and Mittag-Leffler synchronization for the fractional-order memristive neural networks with delays and discontinuous neuron activations.

PubMed

Chen, Jiejie; Chen, Boshan; Zeng, Zhigang

2018-04-01

This paper investigates O(t -α )-synchronization and adaptive Mittag-Leffler synchronization for the fractional-order memristive neural networks with delays and discontinuous neuron activations. Firstly, based on the framework of Filippov solution and differential inclusion theory, using a Razumikhin-type method, some sufficient conditions ensuring the global O(t -α )-synchronization of considered networks are established via a linear-type discontinuous control. Next, a new fractional differential inequality is established and two new discontinuous adaptive controller is designed to achieve Mittag-Leffler synchronization between the drive system and the response systems using this inequality. Finally, two numerical simulations are given to show the effectiveness of the theoretical results. Our approach and theoretical results have a leading significance in the design of synchronized fractional-order memristive neural networks circuits involving discontinuous activations and time-varying delays. Copyright © 2018 Elsevier Ltd. All rights reserved.
Energy conservation in ad hoc multimedia networks using traffic-shaping mechanisms

NASA Astrophysics Data System (ADS)

Chandra, Surendar

2003-12-01

In this work, we explore network traffic shaping mechanisms that deliver packets at pre-determined intervals; allowing the network interface to transition to a lower power consuming sleep state. We focus our efforts on commodity devices, IEEE 802.11b ad hoc mode and popular streaming formats. We argue that factors such as the lack of scheduling clock phase synchronization among the participants and scheduling delays introduced by back ground tasks affect the potential energy savings. Increasing the periodic transmission delays to transmit data infrequently can offset some of these effects at the expense of flooding the wireless channel for longer periods of time; potentially increasing the time to acquire the channel for non-multimedia traffic. Buffering mechanisms built into media browsers can mitigate the effects of these added delays from being mis-interpreted as network congestion. We show that practical implementations of such traffic shaping mechanisms can offer significant energy savings.
Finite-time and fixed-time synchronization analysis of inertial memristive neural networks with time-varying delays.

PubMed

Wei, Ruoyu; Cao, Jinde; Alsaedi, Ahmed

2018-02-01

This paper investigates the finite-time synchronization and fixed-time synchronization problems of inertial memristive neural networks with time-varying delays. By utilizing the Filippov discontinuous theory and Lyapunov stability theory, several sufficient conditions are derived to ensure finite-time synchronization of inertial memristive neural networks. Then, for the purpose of making the setting time independent of initial condition, we consider the fixed-time synchronization. A novel criterion guaranteeing the fixed-time synchronization of inertial memristive neural networks is derived. Finally, three examples are provided to demonstrate the effectiveness of our main results.
Average waiting time in FDDI networks with local priorities

NASA Technical Reports Server (NTRS)

Gercek, Gokhan

1994-01-01

A method is introduced to compute the average queuing delay experienced by different priority group messages in an FDDI node. It is assumed that no FDDI MAC layer priorities are used. Instead, a priority structure is introduced to the messages at a higher protocol layer (e.g. network layer) locally. Such a method was planned to be used in Space Station Freedom FDDI network. Conservation of the average waiting time is used as the key concept in computing average queuing delays. It is shown that local priority assignments are feasable specially when the traffic distribution is asymmetric in the FDDI network.
A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays

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

Yang, Tao; Lu, Jie; Wu, Di

In power system operation, economic dispatch problem (EDP) is designed to minimize the total generation cost while meeting the demand and satisfying generator capacity limits. This paper proposes an algorithm based on the gradient-push method to solve the EDP in a distributed manner over communication networks potentially with time-varying topologies and communication delays. It has been shown that the proposed method is guaranteed to solve the EDP if the time-varying directed communication network is uniformly jointly strongly connected. Moreover, the proposed algorithm is also able to handle arbitrarily large but bounded time delays on communication links. Numerical simulations are usedmore » to illustrate and validate the proposed algorithm.« less
Stability analysis for uncertain switched neural networks with time-varying delay.

PubMed

Shen, Wenwen; Zeng, Zhigang; Wang, Leimin

2016-11-01

In this paper, stability for a class of uncertain switched neural networks with time-varying delay is investigated. By exploring the mode-dependent properties of each subsystem, all the subsystems are categorized into stable and unstable ones. Based on Lyapunov-like function method and average dwell time technique, some delay-dependent sufficient conditions are derived to guarantee the exponential stability of considered uncertain switched neural networks. Compared with general results, our proposed approach distinguishes the stable and unstable subsystems rather than viewing all subsystems as being stable, thus getting less conservative criteria. Finally, two numerical examples are provided to show the validity and the advantages of the obtained results. Copyright © 2016 Elsevier Ltd. All rights reserved.
DOE Office of Scientific and Technical Information (OSTI.GOV)

Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx; Campos-Cantón, I.

We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enablemore » future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.« less
Periodic bidirectional associative memory neural networks with distributed delays

NASA Astrophysics Data System (ADS)

Chen, Anping; Huang, Lihong; Liu, Zhigang; Cao, Jinde

2006-05-01

Some sufficient conditions are obtained for the existence and global exponential stability of a periodic solution to the general bidirectional associative memory (BAM) neural networks with distributed delays by using the continuation theorem of Mawhin's coincidence degree theory and the Lyapunov functional method and the Young's inequality technique. These results are helpful for designing a globally exponentially stable and periodic oscillatory BAM neural network, and the conditions can be easily verified and be applied in practice. An example is also given to illustrate our results.
Global exponential stability of BAM neural networks with time-varying delays: The discrete-time case

NASA Astrophysics Data System (ADS)

Raja, R.; Marshal Anthoni, S.

2011-02-01

This paper deals with the problem of stability analysis for a class of discrete-time bidirectional associative memory (BAM) neural networks with time-varying delays. By employing the Lyapunov functional and linear matrix inequality (LMI) approach, a new sufficient conditions is proposed for the global exponential stability of discrete-time BAM neural networks. The proposed LMI based results can be easily checked by LMI control toolbox. Moreover, an example is also provided to demonstrate the effectiveness of the proposed method.
Passivity analysis for uncertain BAM neural networks with time delays and reaction-diffusions

NASA Astrophysics Data System (ADS)

Zhou, Jianping; Xu, Shengyuan; Shen, Hao; Zhang, Baoyong

2013-08-01

This article deals with the problem of passivity analysis for delayed reaction-diffusion bidirectional associative memory (BAM) neural networks with weight uncertainties. By using a new integral inequality, we first present a passivity condition for the nominal networks, and then extend the result to the case with linear fractional weight uncertainties. The proposed conditions are expressed in terms of linear matrix inequalities, and thus can be checked easily. Examples are provided to demonstrate the effectiveness of the proposed results.
An Improved Forwarding of Diverse Events with Mobile Sinks in Underwater Wireless Sensor Networks.

PubMed

Raza, Waseem; Arshad, Farzana; Ahmed, Imran; Abdul, Wadood; Ghouzali, Sanaa; Niaz, Iftikhar Azim; Javaid, Nadeem

2016-11-04

In this paper, a novel routing strategy to cater the energy consumption and delay sensitivity issues in deep underwater wireless sensor networks is proposed. This strategy is named as ESDR: Event Segregation based Delay sensitive Routing. In this strategy sensed events are segregated on the basis of their criticality and, are forwarded to their respective destinations based on forwarding functions. These functions depend on different routing metrics like: Signal Quality Index, Localization free Signal to Noise Ratio, Energy Cost Function and Depth Dependent Function. The problem of incomparable values of previously defined forwarding functions causes uneven delays in forwarding process. Hence forwarding functions are redefined to ensure their comparable values in different depth regions. Packet forwarding strategy is based on the event segregation approach which forwards one third of the generated events (delay sensitive) to surface sinks and two third events (normal events) are forwarded to mobile sinks. Motion of mobile sinks is influenced by the relative distribution of normal nodes. We have also incorporated two different mobility patterns named as; adaptive mobility and uniform mobility for mobile sinks. The later one is implemented for collecting the packets generated by the normal nodes. These improvements ensure optimum holding time, uniform delay and in-time reporting of delay sensitive events. This scheme is compared with the existing ones and outperforms the existing schemes in terms of network lifetime, delay and throughput.
Impulsive effect on global exponential stability of BAM fuzzy cellular neural networks with time-varying delays

NASA Astrophysics Data System (ADS)

Li, Kelin

2010-02-01

In this article, a class of impulsive bidirectional associative memory (BAM) fuzzy cellular neural networks (FCNNs) with time-varying delays is formulated and investigated. By employing delay differential inequality and M-matrix theory, some sufficient conditions ensuring the existence, uniqueness and global exponential stability of equilibrium point for impulsive BAM FCNNs with time-varying delays are obtained. In particular, a precise estimate of the exponential convergence rate is also provided, which depends on system parameters and impulsive perturbation intention. It is believed that these results are significant and useful for the design and applications of BAM FCNNs. An example is given to show the effectiveness of the results obtained here.
Convergence of Asymptotic Systems of Non-autonomous Neural Network Models with Infinite Distributed Delays

NASA Astrophysics Data System (ADS)

Oliveira, José J.

2017-10-01

In this paper, we investigate the global convergence of solutions of non-autonomous Hopfield neural network models with discrete time-varying delays, infinite distributed delays, and possible unbounded coefficient functions. Instead of using Lyapunov functionals, we explore intrinsic features between the non-autonomous systems and their asymptotic systems to ensure the boundedness and global convergence of the solutions of the studied models. Our results are new and complement known results in the literature. The theoretical analysis is illustrated with some examples and numerical simulations.
A flow-control mechanism for distributed systems

NASA Technical Reports Server (NTRS)

Maitan, J.

1991-01-01

A new approach to the rate-based flow control in store-and-forward networks is evaluated. Existing methods display oscillations in the presence of transport delays. The proposed scheme is based on the explicit use of an embedded dynamic model of a store-and-forward buffer in a controller's feedback loop. It is shown that the use of the model eliminates the oscillations caused by the transport delays. The paper presents simulation examples and assesses the applicability of the scheme in the new generation of high-speed photonic networks where transport delays must be considered.
Formation Control over Delayed Communication Network

NASA Astrophysics Data System (ADS)

Secchi, Cristian; Fantuzzi, Cesare

In this Chapter we address the problem of formation control of a group of robots that exchange information over a communication network characterized by a non negligible delay. We consider the Virtual Body Artificial Potential approach for stabilizing a group of robots at a desired formation. We show that it is possible to model the controlled group of robots as a port-Hamiltonian system and we exploit the scattering framework to achieve a passive behavior of the controlled system and to stabilize the robots in the desired formation independently of any communication delay.
Test experience on an ultrareliable computer communication network

NASA Technical Reports Server (NTRS)

Abbott, L. W.

1984-01-01

The dispersed sensor processing mesh (DSPM) is an experimental, ultrareliable, fault-tolerant computer communications network that exhibits an organic-like ability to regenerate itself after suffering damage. The regeneration is accomplished by two routines - grow and repair. This paper discusses the DSPM concept for achieving fault tolerance and provides a brief description of the mechanization of both the experiment and the six-node experimental network. The main topic of this paper is the system performance of the growth algorithm contained in the grow routine. The characteristics imbued to DSPM by the growth algorithm are also discussed. Data from an experimental DSPM network and software simulation of larger DSPM-type networks are used to examine the inherent limitation on growth time by the growth algorithm and the relationship of growth time to network size and topology.
Targeting MOG expression to dendritic cells delays onset of experimental autoimmune disease.

PubMed

Ko, Hyun-Ja; Chung, Jie-Yu; Nasa, Zeyad; Chan, James; Siatskas, Christopher; Toh, Ban-Hock; Alderuccio, Frank

2011-05-01

Haematopoietic stem cell (HSC) transfer coupled with gene therapy is a powerful approach to treating fatal diseases such as X-linked severe combined immunodeficiency. This ability to isolate and genetically manipulate HSCs also offers a strategy for inducing immune tolerance through ectopic expression of autoantigens. We have previously shown that retroviral transduction of bone marrow (BM) with vectors encoding the autoantigen, myelin oligodendrocyte glycoprotein (MOG), can prevent the induction of experimental autoimmune encephalomyelitis (EAE). However, ubiquitous cellular expression of autoantigen driven by retroviral promoters may not be the best approach for clinical translation and a targeted expression approach may be more acceptable. As BM-derived dendritic cells (DCs) play a major role in tolerance induction, we asked whether targeted expression of MOG, a target autoantigen in EAE, to DCs can promote tolerance induction and influence the development of EAE. Self-inactivating retroviral vectors incorporating the mouse CD11c promoter were generated and used to transduce mouse BM cells. Transplantation of gene-modified cells into irradiated recipients resulted in the generation of chimeric mice with transgene expression limited to DCs. Notably, chimeric mice transplanted with MOG-expressing BM cells manifest a significant delay in the development of EAE suggesting that targeted antigen expression to tolerogenic cell types may be a feasible approach to inducing antigen-specific tolerance.
Characterization of the Decision Network for Wing Expansion in Drosophila Using Targeted Expression of the TRPM8 Channel

PubMed Central

Peabody, Nathan C.; Pohl, Jascha B.; Diao, Fengqiu; Vreede, Andrew P.; Sandstrom, David J.; Wang, Howard; Zelensky, Paul K.; White, Benjamin H.

2009-01-01

After emergence, adult flies and other insects select a suitable perch and expand their wings. Wing expansion is governed by the hormone bursicon and can be delayed under adverse environmental conditions. How environmental factors delay bursicon release and alter perch selection and expansion behaviors has not been investigated in detail. Here we provide evidence that in Drosophila the motor programs underlying perch selection and wing expansion have different environmental dependencies. Using physical manipulations, we demonstrate that the decision to perch is based primarily on environmental valuations and is incrementally delayed under conditions of increasing perturbation and confinement. In contrast, the all-or-none motor patterns underlying wing expansion are relatively invariant in length regardless of environmental conditions. Using a novel technique for targeted activation of neurons, we show that the highly stereotyped wing expansion motor patterns can be initiated by stimulation of NCCAP, a small network of central neurons that regulates the release of bursicon. Activation of this network using the cold-sensitive rat TRPM8 channel is sufficient to trigger all essential behavioral and somatic processes required for wing expansion. The delay of wing expansion under adverse circumstances thus couples an environmentally-sensitive decision network to a command-like network that initiates a fixed action pattern. Because NCCAP mediates environmentally-insensitive ecdysis-related behaviors in Drosophila development prior to adult emergence, the study of wing expansion promises insights not only into how networks mediate behavioral choices, but also into how decision networks develop. PMID:19295141
Automated Synthesis of Long Communication Delays for Testing

NASA Technical Reports Server (NTRS)

Seibert, Marc; McKim, James

2005-01-01

Planetary-Ohio Network Emulator (p- ONE) is a computer program for local laboratory testing of high bandwidth data-communication systems subject to long delays in propagation over interplanetary distances. p-ONE is installed on a personal computer connected to two bidirectional Ethernet interfaces, denoted A and B, that represent local-area networks at opposite ends of a long propagation path. Traffic that is to be passed between A and B is encapsulated in IP (Internet Protocol) packets (e.g., User Data Protocol, UDP). Intercepting this traffic between A and B in both directions, p-ONE time-tags each packet and stores it in memory or on the hard disk of the computer for a user-specified interval that equals the propagation delay to be synthesized. At the expiration of its storage time, each such packet is sent to its destination (that is, if it was received from A, it is sent to B, or vice versa). The accuracy of the p-ONE software is very high, with zero packet loss through the system and negligible latency. Optionally, p-ONE can be configured to delay all network traffic to and from all network addresses on each Ethernet interface or to selectively delay traffic between specific addresses or traffic of specific types. p-ONE works well with Linux and is also designed to be compatible with other operating systems.

A TOTP-based enhanced route optimization procedure for mobile IPv6 to reduce handover delay and signalling overhead.

PubMed

Shah, Peer Azmat; Hasbullah, Halabi B; Lawal, Ibrahim A; Aminu Mu'azu, Abubakar; Tang Jung, Low

2014-01-01

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node's reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node's compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6's Return-Routability-based Route Optimization (RR-RO).
Telecommunications Protocol Processing Subsystem Using Reconfigurable Interoperable Gate Arrays

NASA Technical Reports Server (NTRS)

Pang, Jackson; Pingree, Paula; Torgerson, J. Leigh

2006-01-01

Deep Space Telecommunications Requirements: 1) Automated file transfer across inter-planetary distances; 2) Limited communication periods; 3) Reliable transport; 4) Delay and Disruption Tolerant; and 5) Asymmetric Data Channels.
Effect of Different Insulin Response Patterns During Oral Glucose Tolerance Test on Glycemia in Individuals with Normal Glucose Tolerance.

PubMed

Praveen, Edavan Pulikkanath; Chouhan, Sunil; Sahoo, Jayaprakash; Goel, Sudhir K; Dwivedi, Sada Nand; Khurana, Madan Lal; Kulshreshtha, Bindu; Ammini, Ariachery C

2016-05-01

Research is still going on for detecting the earliest glucose homeostasis derangements in individuals, which is crucial for the prevention of glucose intolerance. This cross-sectional study analyzes different insulin response patterns during the oral glucose tolerance test (OGTT) and their implications on glycemia in normoglycemic individuals. The sample frame was the "Offspring of Individuals with Diabetes Study" database. All participants underwent OGTT. Blood samples were collected at 0, 30, 60, and 120 min for measurement of insulin, C-peptide, and proinsulin levels. Normal glucose tolerant individuals were selected for analysis. Four hundred fifty subjects (mean age, 25 years) were included and divided into two groups according to timing of plasma insulin peaking during OGTT: Group 1, peaking at 30 min; and Group 2, peaking at 60 or 120 min. Body mass index (BMI) and insulin resistance were comparable between the groups; however, Group 2 showed a significantly higher 60- and 120-min glucose level and lower disposition index. Based on the magnitude of the insulin levels, Group 1 was subdivided into Group N (normal pattern) and Group E (exaggerated pattern) with a 30-min insulin cutoff of 74 μU/mL (Group E, ≥74 μU/mL). Group 2 was subdivided into Group DL (delayed and limited pattern; 60-min insulin <73.0 μU/mL and 120-min insulin <80.0 μU/mL) and Group DE (delayed and exaggerated pattern; 60-min insulin ≥73.0 μU/mL or 120-min insulin ≥80.0 μU/mL). Group DE showed a significantly higher area under the curve (AUC) of glucose compared with the other groups and had a lower disposition index and high-density lipoprotein levels. Group DL had significantly lower insulin resistance and BMI compared with Group E but showed a similar AUC of glucose. A delayed insulin pattern was associated with higher postprandial glucose levels. Individuals with delayed and exaggerated insulin secretion may have a higher risk for glucose intolerance.
Managing Network Partitions in Structured P2P Networks

NASA Astrophysics Data System (ADS)

Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.
Observer-based output feedback control of networked control systems with non-uniform sampling and time-varying delay

NASA Astrophysics Data System (ADS)

Meng, Su; Chen, Jie; Sun, Jian

2017-10-01

This paper investigates the problem of observer-based output feedback control for networked control systems with non-uniform sampling and time-varying transmission delay. The sampling intervals are assumed to vary within a given interval. The transmission delay belongs to a known interval. A discrete-time model is first established, which contains time-varying delay and norm-bounded uncertainties coming from non-uniform sampling intervals. It is then converted to an interconnection of two subsystems in which the forward channel is delay-free. The scaled small gain theorem is used to derive the stability condition for the closed-loop system. Moreover, the observer-based output feedback controller design method is proposed by utilising a modified cone complementary linearisation algorithm. Finally, numerical examples illustrate the validity and superiority of the proposed method.
Tolerance of Erythrocytes in Poultry: Induction and Specificity

PubMed Central

Mitchison, N. A.

1962-01-01

Measurement of the rate of elimination of 51Cr-labelled erythrocytes provides a reliable test of immunity in fowls. Chickens can be rendered tolerant of homologous and turkey erythrocytes, as judged by this test, by receiving a series of transfusions of irradiated blood. The series were arranged so that foreign cells remained present in the circulation from the time of hatching. Tolerance induced by this treatment is generally incomplete, but can last indefinitely. In some chickens the manifestation of tolerance of turkey erythrocytes is delayed, probably because of passive transmission of antibody from the dam. Chickens old enough to react against small transfusions of homologous blood can still be rendered tolerant by massive transfusions. Tolerance of the erythrocytes from an individual donor extends only slightly to those from other donors. Tolerance acquired in this way, through transfusion of irradiated blood, stands in contrast to the more stable and complete tolerance that can be acquired through administration of viable cells. Viable cells, on the other hand, provide a less sensitive test, for birds which tolerate skin homografts often eliminate rapidly erythrocytes from the same donor. PMID:14474652
Voice/Data Integration in Mobile Radio Networks: Overview and Future Research Directions

DTIC Science & Technology

1989-09-30

degradation in interactive speech when delays are less than about 300 ms (Gold 1977; Gitman and Frank, 1978). When delays are larger (between 300 ms and 1.5...222-267. Gitman , 1. and H. Frank (1978), "Economic Analysis of Integrated Voice and Data Networks: A Case Study," Proc. IEEE 66 1549-1570. Glynn, P.W
Growth dominates choice in network percolation

NASA Astrophysics Data System (ADS)

Vijayaraghavan, Vikram S.; Noël, Pierre-André; Waagen, Alex; D'Souza, Raissa M.

2013-09-01

The onset of large-scale connectivity in a network (i.e., percolation) often has a major impact on the function of the system. Traditionally, graph percolation is analyzed by adding edges to a fixed set of initially isolated nodes. Several years ago, it was shown that adding nodes as well as edges to the graph can yield an infinite order transition, which is much smoother than the traditional second-order transition. More recently, it was shown that adding edges via a competitive process to a fixed set of initially isolated nodes can lead to a delayed, extremely abrupt percolation transition with a significant jump in large but finite systems. Here we analyze a process that combines both node arrival and edge competition. If started from a small collection of seed nodes, we show that the impact of node arrival dominates: although we can significantly delay percolation, the transition is of infinite order. Thus, node arrival can mitigate the trade-off between delay and abruptness that is characteristic of explosive percolation transitions. This realization may inspire new design rules where network growth can temper the effects of delay, creating opportunities for network intervention and control.
Uncovering Neuronal Networks Defined by Consistent Between-Neuron Spike Timing from Neuronal Spike Recordings

PubMed Central

2018-01-01

Abstract It is widely assumed that distributed neuronal networks are fundamental to the functioning of the brain. Consistent spike timing between neurons is thought to be one of the key principles for the formation of these networks. This can involve synchronous spiking or spiking with time delays, forming spike sequences when the order of spiking is consistent. Finding networks defined by their sequence of time-shifted spikes, denoted here as spike timing networks, is a tremendous challenge. As neurons can participate in multiple spike sequences at multiple between-spike time delays, the possible complexity of networks is prohibitively large. We present a novel approach that is capable of (1) extracting spike timing networks regardless of their sequence complexity, and (2) that describes their spiking sequences with high temporal precision. We achieve this by decomposing frequency-transformed neuronal spiking into separate networks, characterizing each network’s spike sequence by a time delay per neuron, forming a spike sequence timeline. These networks provide a detailed template for an investigation of the experimental relevance of their spike sequences. Using simulated spike timing networks, we show network extraction is robust to spiking noise, spike timing jitter, and partial occurrences of the involved spike sequences. Using rat multineuron recordings, we demonstrate the approach is capable of revealing real spike timing networks with sub-millisecond temporal precision. By uncovering spike timing networks, the prevalence, structure, and function of complex spike sequences can be investigated in greater detail, allowing us to gain a better understanding of their role in neuronal functioning. PMID:29789811
Cloud-based shaft torque estimation for electric vehicle equipped with integrated motor-transmission system

NASA Astrophysics Data System (ADS)

Zhu, Xiaoyuan; Zhang, Hui; Yang, Bo; Zhang, Guichen

2018-01-01

In order to improve oscillation damping control performance as well as gear shift quality of electric vehicle equipped with integrated motor-transmission system, a cloud-based shaft torque estimation scheme is proposed in this paper by using measurable motor and wheel speed signals transmitted by wireless network. It can help reduce computational burden of onboard controllers and also relief network bandwidth requirement of individual vehicle. Considering possible delays during signal wireless transmission, delay-dependent full-order observer design is proposed to estimate the shaft torque in cloud server. With these random delays modeled by using homogenous Markov chain, robust H∞ performance is adopted to minimize the effect of wireless network-induced delays, signal measurement noise as well as system modeling uncertainties on shaft torque estimation error. Observer parameters are derived by solving linear matrix inequalities, and simulation results using acceleration test and tip-in, tip-out test demonstrate the effectiveness of proposed shaft torque observer design.
A review on transport layer protocol performance for delivering video on an adhoc network

NASA Astrophysics Data System (ADS)

Suherman; Suwendri; Al-Akaidi, Marwan

2017-09-01

The transport layer protocol is responsible for the end to end data transmission. Transmission control protocol (TCP) provides a reliable connection and user datagram protocol (UDP) offers fast but unguaranteed data transfer. Meanwhile, the 802.11 (wireless fidelity/WiFi) networks have been widely used as internet hotspots. This paper evaluates TCP, TCP variants and UDP performances for video transmission on an adhoc network. The transport protocol - medium access cross-layer is proposed by prioritizing TCP acknowledgement to reduce delay. The NS-2 evaluations show that the average delays increase linearly for all the evaluated protocols and the average packet losses grow logarithmically. UDP produces the lowest transmission delay; 5.4% and 5.8% lower than TCP and TCP variant, but experiences the highest packet loss. Both TCP and TCP Vegas maintain packet loss as low as possible. The proposed cross-layer successfully decreases TCP and TCP Vegas delay about 0.12 % and 0.15%, although losses remain similar.
Proportional-integral and proportional-integral-derivative-based cyclic sleep controllers with anti-windup technique for energy-efficient and delay-aware passive optical networks

NASA Astrophysics Data System (ADS)

Kikuchi, Takahiro; Kubo, Ryogo

2016-08-01

In energy-efficient passive optical network (PON) systems, the increase in the queuing delays caused by the power-saving mechanism of optical network units (ONUs) is an important issue. Some researchers have proposed quality-of-service (QoS)-aware ONU cyclic sleep controllers in PON systems. We have proposed proportional (P) and proportional-derivative (PD)-based controllers to maintain the average queuing delay at a constant level regardless of the amount of downstream traffic. However, sufficient performance has not been obtained because of the sleep period limitation. In this paper, proportional-integral (PI) and proportional-integral-derivative (PID)-based controllers considering the sleep period limitation, i.e., using an anti-windup (AW) technique, are proposed to improve both the QoS and power-saving performance. Simulations confirm that the proposed controllers provide better performance than conventional controllers in terms of the average downstream queuing delay and the time occupancy of ONU active periods.
Stability switches of arbitrary high-order consensus in multiagent networks with time delays.

PubMed

Yang, Bo

2013-01-01

High-order consensus seeking, in which individual high-order dynamic agents share a consistent view of the objectives and the world in a distributed manner, finds its potential broad applications in the field of cooperative control. This paper presents stability switches analysis of arbitrary high-order consensus in multiagent networks with time delays. By employing a frequency domain method, we explicitly derive analytical equations that clarify a rigorous connection between the stability of general high-order consensus and the system parameters such as the network topology, communication time-delays, and feedback gains. Particularly, our results provide a general and a fairly precise notion of how increasing communication time-delay causes the stability switches of consensus. Furthermore, under communication constraints, the stability and robustness problems of consensus algorithms up to third order are discussed in details to illustrate our central results. Numerical examples and simulation results for fourth-order consensus are provided to demonstrate the effectiveness of our theoretical results.
APF530 (granisetron injection extended-release) in a three-drug regimen for delayed CINV in highly emetogenic chemotherapy.

PubMed

Schnadig, Ian D; Agajanian, Richy; Dakhil, Christopher; Gabrail, Nashat Y; Smith, Robert E; Taylor, Charles; Wilks, Sharon T; Schwartzberg, Lee S; Cooper, William; Mosier, Michael C; Payne, J Yvette; Klepper, Michael J; Vacirca, Jeffrey L

2016-06-01

APF530, extended-release granisetron, provides sustained release for ≥5 days for acute- and delayed-phase chemotherapy-induced nausea and vomiting (CINV). We compared efficacy and safety of APF530 versus ondansetron for delayed CINV after highly emetogenic chemotherapy (HEC), following a guideline-recommended three-drug regimen. HEC patients received APF530 500 mg subcutaneously or ondansetron 0.15 mg/kg intravenously, with dexamethasone and fosaprepitant. Primary end point was delayed-phase complete response (no emesis or rescue medication). A higher percentage of APF530 versus ondansetron patients had delayed-phase complete response (p = 0.014). APF530 was generally well tolerated; treatment-emergent adverse event incidence was similar across arms, mostly mild-to-moderate injection-site reactions. APF530 versus the standard three-drug regimen provided superior control of delayed-phase CINV following HEC. ClinicalTrials.gov : NCT02106494.
Modeling fluctuations in default-mode brain network using a spiking neural network.

PubMed

Yamanishi, Teruya; Liu, Jian-Qin; Nishimura, Haruhiko

2012-08-01

Recently, numerous attempts have been made to understand the dynamic behavior of complex brain systems using neural network models. The fluctuations in blood-oxygen-level-dependent (BOLD) brain signals at less than 0.1 Hz have been observed by functional magnetic resonance imaging (fMRI) for subjects in a resting state. This phenomenon is referred to as a "default-mode brain network." In this study, we model the default-mode brain network by functionally connecting neural communities composed of spiking neurons in a complex network. Through computational simulations of the model, including transmission delays and complex connectivity, the network dynamics of the neural system and its behavior are discussed. The results show that the power spectrum of the modeled fluctuations in the neuron firing patterns is consistent with the default-mode brain network's BOLD signals when transmission delays, a characteristic property of the brain, have finite values in a given range.
Cascading failures with local load redistribution in interdependent Watts-Strogatz networks

NASA Astrophysics Data System (ADS)

Hong, Chen; Zhang, Jun; Du, Wen-Bo; Sallan, Jose Maria; Lordan, Oriol

2016-05-01

Cascading failures of loads in isolated networks have been studied extensively over the last decade. Since 2010, such research has extended to interdependent networks. In this paper, we study cascading failures with local load redistribution in interdependent Watts-Strogatz (WS) networks. The effects of rewiring probability and coupling strength on the resilience of interdependent WS networks have been extensively investigated. It has been found that, for small values of the tolerance parameter, interdependent networks are more vulnerable as rewiring probability increases. For larger values of the tolerance parameter, the robustness of interdependent networks firstly decreases and then increases as rewiring probability increases. Coupling strength has a different impact on robustness. For low values of coupling strength, the resilience of interdependent networks decreases with the increment of the coupling strength until it reaches a certain threshold value. For values of coupling strength above this threshold, the opposite effect is observed. Our results are helpful to understand and design resilient interdependent networks.
New results on global exponential dissipativity analysis of memristive inertial neural networks with distributed time-varying delays.

PubMed

Zhang, Guodong; Zeng, Zhigang; Hu, Junhao

2018-01-01

This paper is concerned with the global exponential dissipativity of memristive inertial neural networks with discrete and distributed time-varying delays. By constructing appropriate Lyapunov-Krasovskii functionals, some new sufficient conditions ensuring global exponential dissipativity of memristive inertial neural networks are derived. Moreover, the globally exponential attractive sets and positive invariant sets are also presented here. In addition, the new proposed results here complement and extend the earlier publications on conventional or memristive neural network dynamical systems. Finally, numerical simulations are given to illustrate the effectiveness of obtained results. Copyright © 2017 Elsevier Ltd. All rights reserved.
Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

PubMed Central

Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok

2018-01-01

Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology. PMID:29659508
Towards a Low-Cost Remote Memory Attestation for the Smart Grid

PubMed Central

Yang, Xinyu; He, Xiaofei; Yu, Wei; Lin, Jie; Li, Rui; Yang, Qingyu; Song, Houbing

2015-01-01

In the smart grid, measurement devices may be compromised by adversaries, and their operations could be disrupted by attacks. A number of schemes to efficiently and accurately detect these compromised devices remotely have been proposed. Nonetheless, most of the existing schemes detecting compromised devices depend on the incremental response time in the attestation process, which are sensitive to data transmission delay and lead to high computation and network overhead. To address the issue, in this paper, we propose a low-cost remote memory attestation scheme (LRMA), which can efficiently and accurately detect compromised smart meters considering real-time network delay and achieve low computation and network overhead. In LRMA, the impact of real-time network delay on detecting compromised nodes can be eliminated via investigating the time differences reported from relay nodes. Furthermore, the attestation frequency in LRMA is dynamically adjusted with the compromised probability of each node, and then, the total number of attestations could be reduced while low computation and network overhead can be achieved. Through a combination of extensive theoretical analysis and evaluations, our data demonstrate that our proposed scheme can achieve better detection capacity and lower computation and network overhead in comparison to existing schemes. PMID:26307998
Towards a Low-Cost Remote Memory Attestation for the Smart Grid.

PubMed

Yang, Xinyu; He, Xiaofei; Yu, Wei; Lin, Jie; Li, Rui; Yang, Qingyu; Song, Houbing

2015-08-21

In the smart grid, measurement devices may be compromised by adversaries, and their operations could be disrupted by attacks. A number of schemes to efficiently and accurately detect these compromised devices remotely have been proposed. Nonetheless, most of the existing schemes detecting compromised devices depend on the incremental response time in the attestation process, which are sensitive to data transmission delay and lead to high computation and network overhead. To address the issue, in this paper, we propose a low-cost remote memory attestation scheme (LRMA), which can efficiently and accurately detect compromised smart meters considering real-time network delay and achieve low computation and network overhead. In LRMA, the impact of real-time network delay on detecting compromised nodes can be eliminated via investigating the time differences reported from relay nodes. Furthermore, the attestation frequency in LRMA is dynamically adjusted with the compromised probability of each node, and then, the total number of attestations could be reduced while low computation and network overhead can be achieved. Through a combination of extensive theoretical analysis and evaluations, our data demonstrate that our proposed scheme can achieve better detection capacity and lower computation and network overhead in comparison to existing schemes.

Some links on this page may take you to non-federal websites. Their policies may differ from this site.