Combined Effect of Random Transmit Power Control and Inter-Path Interference Cancellation on DS-CDMA Packet Mobile Communications

NASA Astrophysics Data System (ADS)

Kudoh, Eisuke; Ito, Haruki; Wang, Zhisen; Adachi, Fumiyuki

In mobile communication systems, high speed packet data services are demanded. In the high speed data transmission, throughput degrades severely due to severe inter-path interference (IPI). Recently, we proposed a random transmit power control (TPC) to increase the uplink throughput of DS-CDMA packet mobile communications. In this paper, we apply IPI cancellation in addition to the random TPC. We derive the numerical expression of the received signal-to-interference plus noise power ratio (SINR) and introduce IPI cancellation factor. We also derive the numerical expression of system throughput when IPI is cancelled ideally to compare with the Monte Carlo numerically evaluated system throughput. Then we evaluate, by Monte-Carlo numerical computation method, the combined effect of random TPC and IPI cancellation on the uplink throughput of DS-CDMA packet mobile communications.

Dolphin "packet" use during long-range echolocation tasks.

PubMed

Finneran, James J

2013-03-01

When echolocating, dolphins typically emit a single broadband "click," then wait to receive the echo before emitting another click. However, previous studies have shown that during long-range echolocation tasks, they may instead emit a burst, or "packet," of several clicks, then wait for the packet of echoes to return before emitting another packet of clicks. The reasons for the use of packets are unknown. In this study, packet use was examined by having trained bottlenose dolphins perform long-range echolocation tasks. The tasks featured "phantom" echoes produced by capturing the dolphin's outgoing echolocation clicks, convolving the clicks with an impulse response to create an echo waveform, and then broadcasting the delayed, scaled echo to the dolphin. Dolphins were trained to report the presence of phantom echoes or a change in phantom echoes. Target range varied from 25 to 800 m. At ranges below 75 m, the dolphins rarely used packets. As the range increased beyond 75 m, two of the three dolphins increasingly produced packets, while the third dolphin instead utilized very high click repetition rates. The use of click packets appeared to be governed more by echo delay (target range) than echo amplitude.

The sampled-data consensus of multi-agent systems with probabilistic time-varying delays and packet losses

NASA Astrophysics Data System (ADS)

Sui, Xin; Yang, Yongqing; Xu, Xianyun; Zhang, Shuai; Zhang, Lingzhong

2018-02-01

This paper investigates the consensus of multi-agent systems with probabilistic time-varying delays and packet losses via sampled-data control. On the one hand, a Bernoulli-distributed white sequence is employed to model random packet losses among agents. On the other hand, a switched system is used to describe packet dropouts in a deterministic way. Based on the special property of the Laplacian matrix, the consensus problem can be converted into a stabilization problem of a switched system with lower dimensions. Some mean square consensus criteria are derived in terms of constructing an appropriate Lyapunov function and using linear matrix inequalities (LMIs). Finally, two numerical examples are given to show the effectiveness of the proposed method.

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.

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

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

PubMed

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

2018-04-16

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.

Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

PubMed Central

Cui, Laizhong; Lu, Nan; Chen, Fu

2014-01-01

Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

Space-Time Processing for Tactical Mobile Ad Hoc Networks

DTIC Science & Technology

2008-08-01

vision for multiple concurrent communication settings, i.e., a many-to-many framework where multi-packet transmissions (MPTs) and multi-packet...modelling framework of capacity-delay tradeoffs We have introduced the first unified modeling framework for the computation of fundamental limits o We...dalities in wireless n twor i-packet modelling framework to account for the use of m lti-packet reception (MPR) f ad hoc networks with MPT under

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks.

PubMed

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-05

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

PubMed Central

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-01

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR. PMID:26742046

Unified study of Quality of Service (QoS) in OPS/OBS networks

NASA Astrophysics Data System (ADS)

Hailu, Dawit Hadush; Lema, Gebrehiwet Gebrekrstos; Yekun, Ephrem Admasu; Kebede, Samrawit Haylu

2017-07-01

With the growth of Internet traffic, an inevitable use of optical networks provide a large bandwidth, fast data transmission rates and Quality of Service (QoS) support. Currently, Optical Burst Switched (OBS)/Optical Packet Switched (OPS) networks are under study as future solutions for addressing the increase demand of Internet traffic. However, due to their high blocking probability in the intermediate nodes they have been delayed in the industries. Packet loss in OBS/OPS networks is mainly occur due to contention. Hence, the contribution of this study is to analyze the file loss ratio (FLR), packet overhead and number of disjoint paths, and processing delay over Coded Packet Transport (CPT) scheme for OBS/OPS network using simulation. The simulations show that CPT scheme reduces the FLR in OBS/OPS network for the evaluated scenarios since the data packets are chopped off into blocks of the data packet for transmission over a network. Simulation results for secrecy and survivability are verified with the help of the analytical model to define the operational range of CPT scheme.

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.

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.

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.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections.

PubMed

Quwaider, Muhannad; Taghizadeh, Mahmoud; Biswas, Subir

2011-01-01

This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks ( WBAN ) with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections

PubMed Central

Quwaider, Muhannad; Taghizadeh, Mahmoud; Biswas, Subir

2014-01-01

This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks (WBAN) with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay. PMID:25530749

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.

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

Performance Analysis of Power Saving Class of Type I for Voice Service in Two-Way Communication in IEEE 802.16e

NASA Astrophysics Data System (ADS)

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

In IEEE 802.16e, power saving is one of the important issues for battery-powered mobile stations (MSs). We present a performance analysis of power saving class (PSC) of type I in IEEE 802.16e standard for voice over Internet protocol (VoIP) service with silence suppression in two-way communication. On-off pattern of a voice user in two-way communication is characterized by the modified Brady model, which includes short silence gaps less than 200ms and talkspurt periods shorter than 15ms, and so differs from the Brady model. Our analysis of PSC I follows the standard-based procedure for the deactivation of the sleep mode, where a uplink packet arrival during a mutual silence period wakes up the MS immediately while a downlink packet arrival waits to be served until the next listening window. We derive the delay distribution of the first downlink packet arriving during a mutual silence period, and find the dropping probability of downlink packets since a voice packet drops if it is not transmitted within maximum delay constraint. In addition, we calculate the average power consumption under the modified Brady model. Analysis and simulation results show that the sleep mode operation for the MS with VoIP service yields 32 ∼ 39% reduction in the power consumption of the MS. Finally we obtain the optimal initial/final-sleep windows that yield the minimum average power consumption while satisfying QoS constraints on the packet dropping probability and the maximum delay.

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.

The ESA standard for telemetry and telecommand packet utilisation: PUS

NASA Technical Reports Server (NTRS)

Kaufeler, Jean-Francois

1994-01-01

ESA has developed standards for packet telemetry and telecommand, which are derived from the recommendations of the Inter-Agency Consultative Committee for Space Data Systems (CCSDS). These standards are now mandatory for future ESA programs as well as for many programs currently under development. However, while these packet standards address the end-to-end transfer of telemetry and telecommand data between applications on the ground and Application Processes on-board, they leave open the internal structure or content of the packets. This paper presents the ESA Packet Utilization Standard (PUS) which addresses this very subject and, as such, serves to extend and complement the ESA packet standards. The goal of the PUS is to be applicable to future ESA missions in all application areas (Telecommunications, Science, Earth Resources, microgravity, etc.). The production of the PUS falls under the responsibility of the ESA Committee for Operations and EGSE Standards (COES).

Securing internet by eliminating DDOS attacks

NASA Astrophysics Data System (ADS)

Niranchana, R.; Gayathri Devi, N.; Santhi, H.; Gayathri, P.

2017-11-01

The major threat caused to the authorised usage of Internet is Distributed Denial of Service attack. The mechanisms used to prevent the DDoS attacks are said to overcome the attack’s ability in spoofing the IP packets source addresses. By utilising Internet Protocol spoofing, the attackers cause a consequential load over the networks destination for policing attack packets. To overcome the IP Spoofing level on the Internet, We propose an Inter domain Packet Filter (IPF) architecture. The proposed scheme is not based on global routing information. The packets with reliable source addresses are not rejected, the IPF frame work works in such a manner. The spoofing capability of attackers is confined by IPF, and also the filter identifies the source of an attack packet by minimal number of candidate network.

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

DTIC Science & Technology

2002-08-01

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

The Effect of Background Traffic Packet Size to VoIP Speech Quality

NASA Astrophysics Data System (ADS)

Triyason, Tuul; Kanthamanon, Prasert; Warasup, Kittipong; Yamsaengsung, Siam; Supattatham, Montri

VoIP is gaining acceptance into the corporate world especially, in small and medium sized business that want to save cost for gaining advantage over their competitors. The good voice quality is one of challenging task in deployment plan because VoIP voice quality was affected by packet loss and jitter delay. In this paper, we study the effect of background traffic packet size to voice quality. The background traffic was generated by Bricks software and the speech quality was assessed by MOS. The obtained result shows an interesting relationship between the voice quality and the number of TCP packets and their size. With the same amount of data smaller packets affect the voice's quality more than the larger packet.

OSLG: A new granting scheme in WDM Ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Razmkhah, Ali; Rahbar, Akbar Ghaffarpour

2011-12-01

Several granting schemes have been proposed to grant transmission window and dynamic bandwidth allocation (DBA) in passive optical networks (PON). Generally, granting schemes suffer from bandwidth wastage of granted windows. Here, we propose a new granting scheme for WDM Ethernet PONs, called optical network unit (ONU) Side Limited Granting (OSLG) that conserves upstream bandwidth, thus resulting in decreasing queuing delay and packet drop ratio. In OSLG instead of optical line terminal (OLT), each ONU determines its transmission window. Two OSLG algorithms are proposed in this paper: the OSLG_GA algorithm that determines the size of its transmission window in such a way that the bandwidth wastage problem is relieved, and the OSLG_SC algorithm that saves unused bandwidth for more bandwidth utilization later on. The OSLG can be used as granting scheme of any DBA to provide better performance in the terms of packet drop ratio and queuing delay. Our performance evaluations show the effectiveness of OSLG in reducing packet drop ratio and queuing delay under different DBA techniques.

Capture and playback synchronization in video conferencing

NASA Astrophysics Data System (ADS)

Shae, Zon-Yin; Chang, Pao-Chi; Chen, Mon-Song

1995-03-01

Packet-switching based video conferencing has emerged as one of the most important multimedia applications. Lip synchronization can be disrupted in the packet network as the result of the network properties: packet delay jitters at the capture end, network delay jitters, packet loss, packet arrived out of sequence, local clock mismatch, and video playback overlay with the graphic system. The synchronization problem become more demanding as the real time and multiparty requirement of the video conferencing application. Some of the above mentioned problem can be solved in the more advanced network architecture as ATM having promised. This paper will present some of the solutions to the problems that can be useful at the end station terminals in the massively deployed packet switching network today. The playback scheme in the end station will consist of two units: compression domain buffer management unit and the pixel domain buffer management unit. The pixel domain buffer management unit is responsible for removing the annoying frame shearing effect in the display. The compression domain buffer management unit is responsible for parsing the incoming packets for identifying the complete data blocks in the compressed data stream which can be decoded independently. The compression domain buffer management unit is also responsible for concealing the effects of clock mismatch, lip synchronization, and packet loss, out of sequence, and network jitters. This scheme can also be applied to the multiparty teleconferencing environment. Some of the schemes presented in this paper have been implemented in the Multiparty Multimedia Teleconferencing (MMT) system prototype at the IBM watson research center.

A scheme for synchronizing clocks connected by a packet communication network

NASA Astrophysics Data System (ADS)

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

2012-07-01

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

Only Above Barrier Energy Components Contribute to Barrier Traversal Time

NASA Astrophysics Data System (ADS)

Galapon, Eric A.

2012-04-01

A time of arrival operator across a square potential barrier is constructed. The expectation value of the barrier time of arrival operator for a sufficiently localized incident wave packet is compared with the expectation value of the free particle time of arrival operator for the same wave packet. The comparison yields an expression for the expected traversal time across the barrier. It is shown that only the above barrier components of the momentum distribution of the incident wave packet contribute to the barrier traversal time, implying that below the barrier components are transmitted without delay. This is consistent with the recent experiment in attosecond ionization in helium indicating that there is no real tunneling delay time [P. Eckle , Science 322, 1525 (2008)SCIEAS0036-807510.1126/science.1163439].

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.

In situ accurate determination of the zero time delay between two independent ultrashort laser pulses by observing the oscillation of an atomic excited wave packet.

PubMed

Zhang, Qun; Hepburn, John W

2008-08-15

We propose a novel method that uses the oscillation of an atomic excited wave packet observed through a pump-probe technique to accurately determine the zero time delay between a pair of ultrashort laser pulses. This physically based approach provides an easy fix for the intractable problem of synchronizing two different femtosecond laser pulses in a practical experimental environment, especially where an in situ time zero measurement with high accuracy is required.

Wireless Avionics Packet to Support Fault Tolerance for Flight Applications

NASA Technical Reports Server (NTRS)

Block, Gary L.; Whitaker, William D.; Dillon, James W.; Lux, James P.; Ahmad, Mohammad

2009-01-01

In this protocol and packet format, data traffic is monitored by all network interfaces to determine the health of transmitter and subsystems. When failures are detected, the network inter face applies its recover y policies to provide continued service despite the presence of faults. The protocol, packet format, and inter face are independent of the data link technology used. The current demonstration system supports both commercial off-the-shelf wireless connections and wired Ethernet connections. Other technologies such as 1553 or serial data links can be used for the network backbone. The Wireless Avionics packet is divided into three parts: a header, a data payload, and a checksum. The header has the following components: magic number, version, quality of service, time to live, sending transceiver, function code, payload length, source Application Data Interface (ADI) address, destination ADI address, sending node address, target node address, and a sequence number. The magic number is used to identify WAV packets, and allows the packet format to be updated in the future. The quality of service field allows routing decisions to be made based on this value and can be used to route critical management data over a dedicated channel. The time to live value is used to discard misrouted packets while the source transceiver is updated at each hop. This information is used to monitor the health of each transceiver in the network. To identify the packet type, the function code is used. Besides having a regular data packet, the system supports diagnostic packets for fault detection and isolation. The payload length specifies the number of data bytes in the payload, and this supports variable-length packets in the network. The source ADI is the address of the originating interface. This can be used by the destination application to identify the originating source of the packet where the address consists of a subnet, subsystem class within the subnet, a subsystem unit, and the local ADI number. The destination ADI is used to route the packet to its ultimate destination. At each hop, the sending interface uses the destination address to determine the next node for the data. The sending node is the node address of the interface that is broadcasting the packet. This field is used to determine the health of the subsystem that is sending the packet. In the case of a packet that traverses several intermediate nodes, it may be the node address of the intermediate node. The target node is the node address of the next hop for the packet. It may be an intermediate node, or the final destination for the packet. The sequence number is used to identify duplicate packets. Because each interface has multiple transceivers, the same packet will appear at both receivers. The sequence number allows the interface to correlate the reception and forward a single, unique packet for additional processing. The subnet field allows data traffic to be partitioned into segregated local networks to support large networks while keeping each subnet at a manageable size. This also keeps the routing table small enough so routing can be done by a simple table lookup in an FPGA device. The subsystem class identifies members of a set of redundant subsystems, and, in a hot standby configuration, all members of the subsystem class will receive the data packets. Only the active subsystem will generate data traffic. Specific units in a class of redundant units can be identified and, if the hot standby configuration is not used, packets will be directed to a specific subsystem unit.

On-board closed-loop congestion control for satellite based packet switching networks

NASA Technical Reports Server (NTRS)

Chu, Pong P.; Ivancic, William D.; Kim, Heechul

1993-01-01

NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time.

Highly Efficient Multi Channel Packet Forwarding with Round Robin Intermittent Periodic Transmit for Multihop Wireless Backhaul Networks

PubMed Central

Furukawa, Hiroshi

2017-01-01

Round Robin based Intermittent Periodic Transmit (RR-IPT) has been proposed which achieves highly efficient multi-hop relays in multi-hop wireless backhaul networks (MWBN) where relay nodes are 2-dimensionally deployed. This paper newly investigates multi-channel packet scheduling and forwarding scheme for RR-IPT. Downlink traffic is forwarded by RR-IPT via one of the channels, while uplink traffic and part of downlink are accommodated in the other channel. By comparing IPT and carrier sense multiple access with collision avoidance (CSMA/CA) for uplink/downlink packet forwarding channel, IPT is more effective in reducing packet loss rate whereas CSMA/CA is better in terms of system throughput and packet delay improvement. PMID:29137164

Cognitive LF-Ant: a novel protocol for healthcare wireless sensor networks.

PubMed

Sousa, Marcelo; Lopes, Waslon; Madeiro, Francisco; Alencar, Marcelo

2012-01-01

In this paper, the authors present the Cognitive LF-Ant protocol for emergency reporting in healthcare wireless sensor networks. The protocol is inspired by the natural behaviour of ants and a cognitive component provides the capabilities to dynamically allocate resources, in accordance with the emergency degree of each patient. The intra-cluster emergency reporting is inspired by the different capabilities of leg-manipulated ants. The inter-cluster reporting is aided by the cooperative modulation diversity with spectrum sensing, which can detect new emergency reporting requests and forward them. Simulations results show the decrease of average delay time as the probability of opportunistic access increases, which privileges the emergency reporting related to the patients with higher priority of resources' usage. Furthermore, the packet loss rate is decreased by the use of cooperative modulation diversity with spectrum sensing.

Cognitive LF-Ant: A Novel Protocol for Healthcare Wireless Sensor Networks

PubMed Central

Sousa, Marcelo; Lopes, Waslon; Madeiro, Francisco; Alencar, Marcelo

2012-01-01

In this paper, the authors present the Cognitive LF-Ant protocol for emergency reporting in healthcare wireless sensor networks. The protocol is inspired by the natural behaviour of ants and a cognitive component provides the capabilities to dynamically allocate resources, in accordance with the emergency degree of each patient. The intra-cluster emergency reporting is inspired by the different capabilities of leg-manipulated ants. The inter-cluster reporting is aided by the cooperative modulation diversity with spectrum sensing, which can detect new emergency reporting requests and forward them. Simulations results show the decrease of average delay time as the probability of opportunistic access increases, which privileges the emergency reporting related to the patients with higher priority of resources' usage. Furthermore, the packet loss rate is decreased by the use of cooperative modulation diversity with spectrum sensing. PMID:23112610

Security in Intelligent Transport Systems for Smart Cities: From Theory to Practice.

PubMed

Javed, Muhammad Awais; Ben Hamida, Elyes; Znaidi, Wassim

2016-06-15

Connecting vehicles securely and reliably is pivotal to the implementation of next generation ITS applications of smart cities. With continuously growing security threats, vehicles could be exposed to a number of service attacks that could put their safety at stake. To address this concern, both US and European ITS standards have selected Elliptic Curve Cryptography (ECC) algorithms to secure vehicular communications. However, there is still a lack of benchmarking studies on existing security standards in real-world settings. In this paper, we first analyze the security architecture of the ETSI ITS standard. We then implement the ECC based digital signature and encryption procedures using an experimental test-bed and conduct an extensive benchmark study to assess their performance which depends on factors such as payload size, processor speed and security levels. Using network simulation models, we further evaluate the impact of standard compliant security procedures in dense and realistic smart cities scenarios. Obtained results suggest that existing security solutions directly impact the achieved quality of service (QoS) and safety awareness of vehicular applications, in terms of increased packet inter-arrival delays, packet and cryptographic losses, and reduced safety awareness in safety applications. Finally, we summarize the insights gained from the simulation results and discuss open research challenges for efficient working of security in ITS applications of smart cities.

Effects of inter-packet spacing on the delivery of multimedia content

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

Kapadia, A. C.; Feng, A. C.; Feng, W. C.

2001-01-01

Streaming multimedia content with UDP has become increasingly popular over distributed systems such as the Internet. However, because UDP does not possess any congestion-control mechanism and most best-effort trafic is served by the congestion-controlled TCP, UDP flows steal bandwidth from TCP to the point that TCP flows can starve for network resources. Furthermore, such applications may cause the Internet infrastructure to eventually suffer from congestion collapse because UDP trafic does not self-regulate itself. To address this problem, next-generation Internet routers will implement active queue-management schemes to punish malicious traffic, e.g., non-adaptive UDP flows, and to the improve the performance ofmore » congestion-controlled traffic, e.g., TCP flows. The arrival of such routers will cripple the performance of today's UDP-based multimedia applications. So, in this paper, we introduce the notion of inter-packet spacing with control feedback to enable these UDP-based applications to perform well in the next-generation Internet while being adaptive and self-regulating. When compared with traditional UDP-based multimedia streaming, we illustrate that our counterintuitive, interpacket-spacing scheme with control feedback can reduce packet loss by 90% without adversely affecting delivered throughput. Keywords: network protocol, multimedia, packet spacing, rate-adjusting congestion control.« less

A novel fair active queue management algorithm based on traffic delay jitter

NASA Astrophysics Data System (ADS)

Wang, Xue-Shun; Yu, Shao-Hua; Dai, Jin-You; Luo, Ting

2009-11-01

In order to guarantee the quantity of data traffic delivered in the network, congestion control strategy is adopted. According to the study of many active queue management (AQM) algorithms, this paper proposes a novel active queue management algorithm named JFED. JFED can stabilize queue length at a desirable level by adjusting output traffic rate and adopting a reasonable calculation of packet drop probability based on buffer queue length and traffic jitter; and it support burst packet traffic through the packet delay jitter, so that it can traffic flow medium data. JFED impose effective punishment upon non-responsible flow with a full stateless method. To verify the performance of JFED, it is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that the proposed JFED algorithm outperforms RED and CHOKe in stabilizing instantaneous queue length and in fairness. It is also shown that JFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

Performance of TCP variants over LTE network

NASA Astrophysics Data System (ADS)

Nor, Shahrudin Awang; Maulana, Ade Novia

2016-08-01

One of the implementation of a wireless network is based on mobile broadband technology Long Term Evolution (LTE). LTE offers a variety of advantages, especially in terms of access speed, capacity, architectural simplicity and ease of implementation, as well as the breadth of choice of the type of user equipment (UE) that can establish the access. The majority of the Internet connections in the world happen using the TCP (Transmission Control Protocol) due to the TCP's reliability in transmitting packets in the network. TCP reliability lies in the ability to control the congestion. TCP was originally designed for wired media, but LTE connected through a wireless medium that is not stable in comparison to wired media. A wide variety of TCP has been made to produce a better performance than its predecessor. In this study, we simulate the performance provided by the TCP NewReno and TCP Vegas based on simulation using network simulator version 2 (ns2). The TCP performance is analyzed in terms of throughput, packet loss and end-to-end delay. In comparing the performance of TCP NewReno and TCP Vegas, the simulation result shows that the throughput of TCP NewReno is slightly higher than TCP Vegas, while TCP Vegas gives significantly better end-to-end delay and packet loss. The analysis of throughput, packet loss and end-to-end delay are made to evaluate the simulation.

Enhancing the Quality of Service for Real Time Traffic over Optical Burst Switching (OBS) Networks with Ensuring the Fairness for Other Traffics.

PubMed

Al-Shargabi, Mohammed A; Shaikh, Asadullah; Ismail, Abdulsamad S

2016-01-01

Optical burst switching (OBS) networks have been attracting much consideration as a promising approach to build the next generation optical Internet. A solution for enhancing the Quality of Service (QoS) for high priority real time traffic over OBS with the fairness among the traffic types is absent in current OBS' QoS schemes. In this paper we present a novel Real Time Quality of Service with Fairness Ratio (RT-QoSFR) scheme that can adapt the burst assembly parameters according to the traffic QoS needs in order to enhance the real time traffic QoS requirements and to ensure the fairness for other traffic. The results show that RT-QoSFR scheme is able to fulfill the real time traffic requirements (end to end delay, and loss rate) ensuring the fairness for other traffics under various conditions such as the type of real time traffic and traffic load. RT-QoSFR can guarantee that the delay of the real time traffic packets does not exceed the maximum packets transfer delay value. Furthermore, it can reduce the real time traffic packets loss, at the same time guarantee the fairness for non real time traffic packets by determining the ratio of real time traffic inside the burst to be 50-60%, 30-40%, and 10-20% for high, normal, and low traffic loads respectively.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-11-16

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

An efficient and reliable geographic routing protocol based on partial network coding for underwater sensor networks.

PubMed

Hao, Kun; Jin, Zhigang; Shen, Haifeng; Wang, Ying

2015-05-28

Efficient routing protocols for data packet delivery are crucial to underwater sensor networks (UWSNs). However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. Network coding is a promising technique for efficient data packet delivery thanks to the broadcast nature of acoustic channels and the relatively high computation capabilities of the sensor nodes. In this work, we present GPNC, a novel geographic routing protocol for UWSNs that incorporates partial network coding to encode data packets and uses sensor nodes' location information to greedily forward data packets to sink nodes. GPNC can effectively reduce network delays and retransmissions of redundant packets causing additional network energy consumption. Simulation results show that GPNC can significantly improve network throughput and packet delivery ratio, while reducing energy consumption and network latency when compared with other routing protocols.

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.

SURGNET: An Integrated Surgical Data Transmission System for Telesurgery.

PubMed

Natarajan, Sriram; Ganz, Aura

2009-01-01

Remote surgery information requires quick and reliable transmission between the surgeon and the patient site. However, the networks that interconnect the surgeon and patient sites are usually time varying and lossy which can cause packet loss and delay jitter. In this paper we propose SURGNET, a telesurgery system for which we developed the architecture, algorithms and implemented it on a testbed. The algorithms include adaptive packet prediction and buffer time adjustment techniques which reduce the negative effects caused by the lossy and time varying networks. To evaluate the proposed SURGNET system, at the therapist site, we implemented a therapist panel which controls the force feedback device movements and provides image analysis functionality. At the patient site we controlled a virtual reality applet built in Matlab. The varying network conditions were emulated using NISTNet emulator. Our results show that even for severe packet loss and variable delay jitter, the proposed integrated synchronization techniques significantly improve SURGNET performance.

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

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.

Tuning the group delay of optical wave packets in liquid-crystal light valves

NASA Astrophysics Data System (ADS)

Bortolozzo, U.; Residori, S.; Huignard, J. P.

2009-05-01

By performing two-wave mixing experiments in a liquid-crystal light valve, optical pulses are slowed down to group velocities as slow as a few tenths of mm/s, corresponding to a very large group index. We present experiments and model of the slow-light process occurring in the liquid-crystal light valve, showing that this is characterized by multiple-beam diffraction in the Raman-Nath regime. Depending on the initial frequency detuning between pump and signal, the different output order beams are distinguished by different group delays. The group delay can be tuned by changing the main parameters of the experiment: the detuning between the pump and the input wave packet, the strength of the nonlinearity, and the intensity of the pump beam.

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…

Centering a DDR Strobe in the Middle of a Data Packet

NASA Technical Reports Server (NTRS)

Johnson, Michael; Nelson, Dave; Seefeldt, James; Roper, Weston; Passow, Craig

2014-01-01

The Orion CEV Northstar ASIC (application- specific integrated circuit) project required a DDR (double data rate) memory bus driver/receiver (DDR PHY block) to interface with external DDR memory. The DDR interface (JESD79C) is based on a source synchronous strobe (DQS\\) that is sent along with each packet of data (DQ). New data is provided concurrently with each edge of strobe and is sent irregularly. In order to capture this data, the strobe needs to be delayed and used to latch the data into a register. A circuit solves the need for training a DDR PRY block by incorporating a PVT-compensated delay element in the strobe path. This circuit takes an external reference clock signal and uses the regular clock to calibrate a known delay through a data path. The compensated delay DQS signal is then used to capture the DQ data in a normal register. This register structure can be configured as a FIFO (first in first out), in order to transfer data from the DDR domain to the system clock domain. This design is different in that it does not rely upon the need for training the system response, nor does it use a PLL (phase locked loop) or a DLL (delay locked loop) to provide an offset of the strobe signal. The circuit is created using standard ASIC building blocks, plus the PVT (process, voltage, and temperature) compensated delay line. The design uses a globally available system clock as a reference, alleviating the need to operate synchronously with the remote memory. The reference clock conditions the PVT compensated delay line to provide a pre-determined amount of delay to any data signal that passes through this delay line. The delay line is programmed in degrees of offset, so that one could think of the clock period representing 360deg of delay. In an ideal environment, delaying the strobe 1/4 of a clock cycle (90deg) would place the strobe in the middle of the data packet. This delayed strobe can then be used to clock the data into a register, satisfying setup and hold requirements of the system.

Link Scheduling Algorithm with Interference Prediction for Multiple Mobile WBANs

PubMed Central

Le, Thien T. T.

2017-01-01

As wireless body area networks (WBANs) become a key element in electronic healthcare (e-healthcare) systems, the coexistence of multiple mobile WBANs is becoming an issue. The network performance is negatively affected by the unpredictable movement of the human body. In such an environment, inter-WBAN interference can be caused by the overlapping transmission range of nearby WBANs. We propose a link scheduling algorithm with interference prediction (LSIP) for multiple mobile WBANs, which allows multiple mobile WBANs to transmit at the same time without causing inter-WBAN interference. In the LSIP, a superframe includes the contention access phase using carrier sense multiple access with collision avoidance (CSMA/CA) and the scheduled phase using time division multiple access (TDMA) for non-interfering nodes and interfering nodes, respectively. For interference prediction, we define a parameter called interference duration as the duration during which disparate WBANs interfere with each other. The Bayesian model is used to estimate and classify the interference using a signal to interference plus noise ratio (SINR) and the number of neighboring WBANs. The simulation results show that the proposed LSIP algorithm improves the packet delivery ratio and throughput significantly with acceptable delay. PMID:28956827

Experimental demonstration of time- and mode-division multiplexed passive optical network

NASA Astrophysics Data System (ADS)

Ren, Fang; Li, Juhao; Tang, Ruizhi; Hu, Tao; Yu, Jinyi; Mo, Qi; He, Yongqi; Chen, Zhangyuan; Li, Zhengbin

2017-07-01

A time- and mode-division multiplexed passive optical network (TMDM-PON) architecture is proposed, in which each optical network unit (ONU) communicates with the optical line terminal (OLT) independently utilizing both different time slots and switched optical linearly polarized (LP) spatial modes. Combination of a mode multiplexer/demultiplexer (MUX/DEUX) and a simple N × 1 optical switch is employed to select the specific LP mode in each ONU. A mode-insensitive power splitter is used for signal broadcast/combination between OLT and ONUs. We theoretically propose a dynamic mode and time slot assignment scheme for TMDM-PON based on inter-ONU priority rating, in which the time delay and packet loss ratio's variation tendency are investigated by simulation. Moreover, we experimentally demonstrate 2-mode TMDM-PON transmission over 10 km FMF with 10-Gb/s on-off keying (OOK) signal and direct detection.

Enhancing the Quality of Service for Real Time Traffic over Optical Burst Switching (OBS) Networks with Ensuring the Fairness for Other Traffics

PubMed Central

Al-Shargabi, Mohammed A.; Ismail, Abdulsamad S.

2016-01-01

Optical burst switching (OBS) networks have been attracting much consideration as a promising approach to build the next generation optical Internet. A solution for enhancing the Quality of Service (QoS) for high priority real time traffic over OBS with the fairness among the traffic types is absent in current OBS’ QoS schemes. In this paper we present a novel Real Time Quality of Service with Fairness Ratio (RT-QoSFR) scheme that can adapt the burst assembly parameters according to the traffic QoS needs in order to enhance the real time traffic QoS requirements and to ensure the fairness for other traffic. The results show that RT-QoSFR scheme is able to fulfill the real time traffic requirements (end to end delay, and loss rate) ensuring the fairness for other traffics under various conditions such as the type of real time traffic and traffic load. RT-QoSFR can guarantee that the delay of the real time traffic packets does not exceed the maximum packets transfer delay value. Furthermore, it can reduce the real time traffic packets loss, at the same time guarantee the fairness for non real time traffic packets by determining the ratio of real time traffic inside the burst to be 50–60%, 30–40%, and 10–20% for high, normal, and low traffic loads respectively. PMID:27583557

Queueing models for token and slotted ring networks. Thesis

NASA Technical Reports Server (NTRS)

Peden, Jeffery H.

1990-01-01

Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

Performance Analysis of AeroRP with Ground Station Advertisements

DTIC Science & Technology

2012-03-12

results showed that AeroRP outperforms the traditional MANET routing protocols in terms of throughput and packet delivery ra - tio (PDR) [5, 6]. AeroRP...and waiting for the source to re- send the packet increases the end-to-end delay. The AeroNP corruption indicator and HEC -CRC (header error check...Dev ID | NP HEC CRC-16 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ \\ \\ / AeroTP Payload

A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

PubMed

Guan, Xin; Wu, Huayang; Bi, Shujun

2011-01-01

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

Analysis of Optimal Jitter Buffer Size for VoIP QoS under WiMAX Power-Saving Mode

NASA Astrophysics Data System (ADS)

Kim, Hyungsuk; Kim, Taehyoun

VoIP service is expected as one of the key applications of Mobile WiMAX, but the speech quality of VoIP service often suffers deterioration due to the fluctuating transmission delay called jitter. This is commonly ameliorated by a de-jitter buffer, and we aim to find the optimal size of de-jitter buffer to achieve speech quality comparable to PSTN. We developed a new model of the packet drops at the de-jitter buffer and the end-to-end packet delay which takes account of the additional delay introduced by the WiMAX power-saving mode. Using our model, we analyzed the optimal size of the de-jitter buffer for various network parameters, and showed that the results obtained by analysis accord with simulation results.

Security in Intelligent Transport Systems for Smart Cities: From Theory to Practice

PubMed Central

Javed, Muhammad Awais; Ben Hamida, Elyes; Znaidi, Wassim

2016-01-01

Connecting vehicles securely and reliably is pivotal to the implementation of next generation ITS applications of smart cities. With continuously growing security threats, vehicles could be exposed to a number of service attacks that could put their safety at stake. To address this concern, both US and European ITS standards have selected Elliptic Curve Cryptography (ECC) algorithms to secure vehicular communications. However, there is still a lack of benchmarking studies on existing security standards in real-world settings. In this paper, we first analyze the security architecture of the ETSI ITS standard. We then implement the ECC based digital signature and encryption procedures using an experimental test-bed and conduct an extensive benchmark study to assess their performance which depends on factors such as payload size, processor speed and security levels. Using network simulation models, we further evaluate the impact of standard compliant security procedures in dense and realistic smart cities scenarios. Obtained results suggest that existing security solutions directly impact the achieved quality of service (QoS) and safety awareness of vehicular applications, in terms of increased packet inter-arrival delays, packet and cryptographic losses, and reduced safety awareness in safety applications. Finally, we summarize the insights gained from the simulation results and discuss open research challenges for efficient working of security in ITS applications of smart cities. PMID:27314358

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.

Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Ma, Jian-Feng

Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

Energy-saving EPON Bandwidth Allocation Algorithm Supporting ONU's Sleep Mode

NASA Astrophysics Data System (ADS)

Zhang, Yinfa; Ren, Shuai; Liao, Xiaomin; Fang, Yuanyuan

2014-09-01

A new bandwidth allocation algorithm was presented by combining merits of the IPACT algorithm and the cyclic DBA algorithm based on the DBA algorithm for ONU's sleep mode. Simulation results indicate that compared with the normal mode ONU, the ONU's sleep mode can save about 74% of energy. The new algorithm has a smaller average packet delay and queue length in the upstream direction. While in the downstream direction, the average packet delay of the new algorithm is less than polling cycle Tcycle and the average queue length is less than the product of Tcycle and the maximum link rate. The new algorithm achieves a better compromise between energy-saving and ensuring quality of service.

End-to-End Flow Control for Visual-Haptic Communication under Bandwidth Change

NASA Astrophysics Data System (ADS)

Yashiro, Daisuke; Tian, Dapeng; Yakoh, Takahiro

This paper proposes an end-to-end flow controller for visual-haptic communication. A visual-haptic communication system transmits non-real-time packets, which contain large-size visual data, and real-time packets, which contain small-size haptic data. When the transmission rate of visual data exceeds the communication bandwidth, the visual-haptic communication system becomes unstable owing to buffer overflow. To solve this problem, an end-to-end flow controller is proposed. This controller determines the optimal transmission rate of visual data on the basis of the traffic conditions, which are estimated by the packets for haptic communication. Experimental results confirm that in the proposed method, a short packet-sending interval and a short delay are achieved under bandwidth change, and thus, high-precision visual-haptic communication is realized.

Coherence properties of spontaneous parametric down-conversion pumped by a multi-mode cw diode laser.

PubMed

Kwon, Osung; Ra, Young-Sik; Kim, Yoon-Ho

2009-07-20

Coherence properties of the photon pair generated via spontaneous parametric down-conversion pumped by a multi-mode cw diode laser are studied with a Mach-Zehnder interferometer. Each photon of the pair enters a different input port of the interferometer and the biphoton coherence properties are studied with a two-photon detector placed at one output port. When the photon pair simultaneously enters the interferometer, periodic recurrence of the biphoton de Broglie wave packet is observed, closely resembling the coherence properties of the pump diode laser. With non-zero delays between the photons at the input ports, biphoton interference exhibits the same periodic recurrence but the wave packet shapes are shown to be dependent on both the input delay as well as the interferometer delay. These properties could be useful for building engineered entangled photon sources based on diode laser-pumped spontaneous parametric down-conversion.

Asymptotically reliable transport of multimedia/graphics over wireless channels

NASA Astrophysics Data System (ADS)

Han, Richard Y.; Messerschmitt, David G.

1996-03-01

We propose a multiple-delivery transport service tailored for graphics and video transported over connections with wireless access. This service operates at the interface between the transport and application layers, balancing the subjective delay and image quality objectives of the application with the low reliability and limited bandwidth of the wireless link. While techniques like forward-error correction, interleaving and retransmission improve reliability over wireless links, they also increase latency substantially when bandwidth is limited. Certain forms of interactive multimedia datatypes can benefit from an initial delivery of a corrupt packet to lower the perceptual latency, as long as reliable delivery occurs eventually. Multiple delivery of successively refined versions of the received packet, terminating when a sufficiently reliable version arrives, exploits the redundancy inherently required to improve reliability without a traffic penalty. Modifications to acknowledgment-repeat-request (ARQ) methods to implement this transport service are proposed, which we term `leaky ARQ'. For the specific case of pixel-coded window-based text/graphics, we describe additional functions needed to more effectively support urgent delivery and asymptotic reliability. X server emulation suggests that users will accept a multi-second delay between a (possibly corrupt) packet and the ultimate reliably-delivered version. The relaxed delay for reliable delivery can be exploited for traffic capacity improvement using scheduling of retransmissions.

A Simulation Study of Paced TCP

NASA Technical Reports Server (NTRS)

Kulik, Joanna; Coulter, Robert; Rockwell, Dennis; Partridge, Craig

2000-01-01

In this paper, we study the performance of paced TCP, a modified version of TCP designed especially for high delay- bandwidth networks. In typical networks, TCP optimizes its send-rate by transmitting increasingly large bursts, or windows, of packets, one burst per round-trip time, until it reaches a maximum window-size, which corresponds to the full capacity of the network. In a network with a high delay-bandwidth product, however, Transmission Control Protocol's (TCPs) maximum window-size may be larger than the queue size of the intermediate routers, and routers will begin to drop packets as soon as the windows become too large for the router queues. The TCP sender then concludes that the bottleneck capacity of the network has been reached, and it limits its send-rate accordingly. Partridge proposed paced TCP as a means of solving the problem of queueing bottlenecks. A sender using paced TCP would release packets in multiple, small bursts during a round-trip time in which ordinary TCP would release a single, large burst of packets. This approach allows the sender to increase its send-rate to the maximum window size without encountering queueing bottlenecks. This paper describes the performance of paced TCP in a simulated network and discusses implementation details that can affect the performance of paced TCP.

A Cooperative Downloading Method for VANET Using Distributed Fountain Code.

PubMed

Liu, Jianhang; Zhang, Wenbin; Wang, Qi; Li, Shibao; Chen, Haihua; Cui, Xuerong; Sun, Yi

2016-10-12

Cooperative downloading is one of the effective methods to improve the amount of downloaded data in vehicular ad hoc networking (VANET). However, the poor channel quality and short encounter time bring about a high packet loss rate, which decreases transmission efficiency and fails to satisfy the requirement of high quality of service (QoS) for some applications. Digital fountain code (DFC) can be utilized in the field of wireless communication to increase transmission efficiency. For cooperative forwarding, however, processing delay from frequent coding and decoding as well as single feedback mechanism using DFC cannot adapt to the environment of VANET. In this paper, a cooperative downloading method for VANET using concatenated DFC is proposed to solve the problems above. The source vehicle and cooperative vehicles encodes the raw data using hierarchical fountain code before they send to the client directly or indirectly. Although some packets may be lost, the client can recover the raw data, so long as it receives enough encoded packets. The method avoids data retransmission due to packet loss. Furthermore, the concatenated feedback mechanism in the method reduces the transmission delay effectively. Simulation results indicate the benefits of the proposed scheme in terms of increasing amount of downloaded data and data receiving rate.

Improving Explicit Congestion Notification with the Mark-Front Strategy

NASA Technical Reports Server (NTRS)

Liu, Chunlei; Jain, Raj

2001-01-01

Delivering congestion signals is essential to the performance of networks. Current TCP/IP networks use packet losses to signal congestion. Packet losses not only reduces TCP performance, but also adds large delay. Explicit Congestion Notification (ECN) delivers a faster indication of congestion and has better performance. However, current ECN implementations mark the packet from the tail of the queue. In this paper, we propose the mark-front strategy to send an even faster congestion signal. We show that mark-front strategy reduces buffer size requirement, improves link efficiency and provides better fairness among users. Simulation results that verify our analysis are also presented.

Exploration of momentum evolution and three-dimensional localization in recombined electron wave packets

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

Zeibel, J. G.; Jones, R. R.

2003-08-01

Picosecond ''half-cycle'' pulses (HCPs) have been used to produce electronic wave packets by recombining photoelectrons with their parent ions. The time-dependent momentum distributions of the bound wave packets are probed using a second HCP and the impulsive momentum retrieval (IMR) method. For a given delay between the initial photoionization event and the HCP recombination, classical trajectory simulations predict pronounced periodic wave packet motion for a restricted range of recombining HCP amplitudes. This motion is characterized by the repeated formation and collapse of a highly localized spike in the three-dimensional electron probability density at a large distance from the nucleus. Ourmore » experiments confirm that oscillatory wave packet motion occurs only for certain recombination ''kick'' strengths. Moreover, the measured time-dependent momentum distributions are consistent with the predicted formation of a highly localized electron packet. We demonstrate a variation of the IMR in which amplitude modulation of the HCP probe field is employed to suppress noise and allow for a more direct recovery of electron momentum from experimental ionization data.« less

Low Latency MAC Protocol in Wireless Sensor Networks Using Timing Offset

NASA Astrophysics Data System (ADS)

Choi, Seung Sik

This paper proposes a low latency MAC protocol that can be used in sensor networks. To extend the lifetime of sensor nodes, the conventional solution is to synchronize active/sleep periods of all sensor nodes. However, due to these synchronized sensor nodes, packets in the intermediate nodes must wait until the next node wakes up before it can forward a packet. This induces a large delay in sensor nodes. To solve this latency problem, a clustered sensor network which uses two types of sensor nodes and layered architecture is considered. Clustered heads in each cluster are synchronized with different timing offsets to reduce the sleep delay. Using this concept, the latency problem can be solved and more efficient power usage can be obtained.

Advanced teleprocessing systems

NASA Astrophysics Data System (ADS)

Kleinrock, L.; Gerla, M.

1983-03-01

This Semi-Annual Technical Report covers research covering the period from October 1, 1982 to March 31, 1983. This contract has three primary designated research areas: packet radio systems, resource sharing and allocation, and distributed processing and control. This report contains abstracts of publications which summarize research results in these areas followed by the main body of the report which is devoted to a treatment of single- and multi-hop packet radio systems. In particular, the main body consists of a Ph.D. dissertation, Analysis of Throughput and Delay for Single- and Multi-Hop Packet Radio Networks. The work presents a new approach to evaluating the performance of multi-hop packet radio networks, namely, a study of the times between successful transmissions. Also studied is the behavior of packets in a multi-hop system when a fixed transmission radius is specified and this radius is then optimized for throughput. A Markov chain model is also introduced and solved numerically to evaluate transmission and flow control strategies in these systems.

Implementing MANETS in Android based environment using Wi-Fi direct

NASA Astrophysics Data System (ADS)

Waqas, Muhammad; Babar, Mohammad Inayatullah Khan; Zafar, Mohammad Haseeb

2015-05-01

Packet loss occurs in real-time voice transmission over wireless broadcast Ad-hoc network which creates disruptions in sound. Basic objective of this research is to design a wireless Ad-hoc network based on two Android devices by using the Wireless Fidelity (WIFI) Direct Application Programming Interface (API) and apply the Network Codec, Reed Solomon Code. The network codec is used to encode the data of a music wav file and recover the lost packets if any, packets are dropped using a loss module at the transmitter device to analyze the performance with the objective of retrieving the original file at the receiver device using the network codec. This resulted in faster transmission of the files despite dropped packets. In the end both files had the original formatted music files with complete performance analysis based on the transmission delay.

Full Duplex, Spread Spectrum Radio System

NASA Technical Reports Server (NTRS)

Harvey, Bruce A.

2000-01-01

The goal of this project was to support the development of a full duplex, spread spectrum voice communications system. The assembly and testing of a prototype system consisting of a Harris PRISM spread spectrum radio, a TMS320C54x signal processing development board and a Zilog Z80180 microprocessor was underway at the start of this project. The efforts under this project were the development of multiple access schemes, analysis of full duplex voice feedback delays, and the development and analysis of forward error correction (FEC) algorithms. The multiple access analysis involved the selection between code division multiple access (CDMA), frequency division multiple access (FDMA) and time division multiple access (TDMA). Full duplex voice feedback analysis involved the analysis of packet size and delays associated with full loop voice feedback for confirmation of radio system performance. FEC analysis included studies of the performance under the expected burst error scenario with the relatively short packet lengths, and analysis of implementation in the TMS320C54x digital signal processor. When the capabilities and the limitations of the components used were considered, the multiple access scheme chosen was a combination TDMA/FDMA scheme that will provide up to eight users on each of three separate frequencies. Packets to and from each user will consist of 16 samples at a rate of 8,000 samples per second for a total of 2 ms of voice information. The resulting voice feedback delay will therefore be 4 - 6 ms. The most practical FEC algorithm for implementation was a convolutional code with a Viterbi decoder. Interleaving of the bits of each packet will be required to offset the effects of burst errors.

A low-latency high-port count optical switch with optical delay line buffering for disaggregated data centers

NASA Astrophysics Data System (ADS)

Moralis-Pegios, M.; Terzenidis, N.; Mourgias-Alexandris, G.; Vyrsokinos, K.; Pleros, N.

2018-02-01

Disaggregated Data Centers (DCs) have emerged as a powerful architectural framework towards increasing resource utilization and system power efficiency, requiring, however, a networking infrastructure that can ensure low-latency and high-bandwidth connectivity between a high-number of interconnected nodes. This reality has been the driving force towards high-port count and low-latency optical switching platforms, with recent efforts concluding that the use of distributed control architectures as offered by Broadcast-and-Select (BS) layouts can lead to sub-μsec latencies. However, almost all high-port count optical switch designs proposed so far rely either on electronic buffering and associated SerDes circuitry for resolving contention or on buffer-less designs with packet drop and re-transmit procedures, unavoidably increasing latency or limiting throughput. In this article, we demonstrate a 256x256 optical switch architecture for disaggregated DCs that employs small-size optical delay line buffering in a distributed control scheme, exploiting FPGA-based header processing over a hybrid BS/Wavelength routing topology that is implemented by a 16x16 BS design and a 16x16 AWGR. Simulation-based performance analysis reveals that even the use of a 2- packet optical buffer can yield <620nsec latency with >85% throughput for up to 100% loads. The switch has been experimentally validated with 10Gb/s optical data packets using 1:16 optical splitting and a SOA-MZI wavelength converter (WC) along with fiber delay lines for the 2-packet buffer implementation at every BS outgoing port, followed by an additional SOA-MZI tunable WC and the 16x16 AWGR. Error-free performance in all different switch input/output combinations has been obtained with a power penalty of <2.5dB.

Intelligent Sensing and Classification in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Dempsey, Tae; Sahin, Gokhan; Morton, Yu T. (Jade

Wireless ad hoc networks have fundamentally altered today's battlefield, with applications ranging from unmanned air vehicles to randomly deployed sensor networks. Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments.

Passive and Active Analysis in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Dempsey, Tae; Sahin, Gokhan; Morton, Y. T. (Jade)

Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments. Furthermore, we investigate active analysis, which is the combination of a classifier and intelligent jammer to invoke specific responses from a victim network.

Evaluation of communication in wireless underground sensor networks

NASA Astrophysics Data System (ADS)

Yu, X. Q.; Zhang, Z. L.; Han, W. T.

2017-06-01

Wireless underground sensor networks (WUSN) are an emerging area of research that promises to provide communication capabilities to buried sensors. In this paper, experimental measurements have been conducted with commodity sensor motes at the frequency of 2.4GHz and 433 MHz, respectively. Experiments are run to examine the received signal strength of correctly received packets and the packet error rate for a communication link. The tests show the potential feasibility of the WUSN with the use of powerful RF transceivers at 433MHz frequency. Moreover, we also illustrate a classification for wireless underground sensor network communication. Finally, we conclude that the effects of burial depth, inter-node distance and volumetric water content of the soil on the signal strength and packet error rate in communication of WUSN.

Molecular isomerization induced by ultrashort infrared pulses. II. Pump-dump isomerization using pairs of time-delayed half-cycle pulses.

PubMed

Uiberacker, Christoph; Jakubetz, Werner

2004-06-22

We investigate population transfer across the barrier in a double-well potential, induced by a pair of time-delayed single-lobe half-cycle pulses. We apply this setup both to a one-dimensional (1D) quartic model potential and to a three-dimensional potential representing HCN-->HNC isomerization. Overall the results for the two systems are similar, although in the 3D system some additional features appear not seen in the 1D case. The generic mechanism of population transfer is the preparation by the pump pulse of a wave packet involving delocalized states above the barrier, followed by the essentially 1D motion of the delocalized part of wave packet across the barrier, and the eventual de-excitation by the dump pulse to localized states in the other well. The correct timing is given by the well-to-well passage time of the wave packet and its recurrence properties, and by the signs of the field lobes which determine the direction and acceleration or deceleration of the wave packet motion. In the 3D system an additional pump-pump-dump mechanism linked to wave packet motion in the reagent well can mediate isomerization. Since the transfer time and the pulse durations are of the same order of magnitude, there is also a marked dependence of the dynamics and the transfer yield on the pulse duration. Our analysis also sheds light on the pronounced carrier envelope phase dependence previously observed for isomerization and molecular dissociation with one-cycle and sub-one-cycle pulses. (c) 2004 American Institute of Physics.

Adaptive Video Streaming Using Bandwidth Estimation for 3.5G Mobile Network

NASA Astrophysics Data System (ADS)

Nam, Hyeong-Min; Park, Chun-Su; Jung, Seung-Won; Ko, Sung-Jea

Currently deployed mobile networks including High Speed Downlink Packet Access (HSDPA) offer only best-effort Quality of Service (QoS). In wireless best effort networks, the bandwidth variation is a critical problem, especially, for mobile devices with small buffers. This is because the bandwidth variation leads to packet losses caused by buffer overflow as well as picture freezing due to high transmission delay or buffer underflow. In this paper, in order to provide seamless video streaming over HSDPA, we propose an efficient real-time video streaming method that consists of the available bandwidth (AB) estimation for the HSDPA network and the transmission rate control to prevent buffer overflows/underflows. In the proposed method, the client estimates the AB and the estimated AB is fed back to the server through real-time transport control protocol (RTCP) packets. Then, the server adaptively adjusts the transmission rate according to the estimated AB and the buffer state obtained from the RTCP feedback information. Experimental results show that the proposed method achieves seamless video streaming over the HSDPA network providing higher video quality and lower transmission delay.

Social Reinforcement Delays in Free-Flying Honey Bees (Apis mellifera L.)

PubMed Central

Craig, David Philip Arthur; Grice, James W.; Varnon, Chris A.; Gibson, B.; Sokolowski, Michel B. C.; Abramson, Charles I.

2012-01-01

Free-flying honey bees (Apis mellifera L.) reactions were observed when presented with varying schedules of post-reinforcement delays of 0 s, 300 s, or 600 s. We measured inter-visit-interval, response length, inter-response-time, and response rate. Honey bees exposed to these post-reinforcement delay intervals exhibit one of several patterns compared to groups not encountering delays, and had longer inter-visit-intervals. We observed no group differences in inter-response time. Honey bees with higher response rates tended to not finish the experiment. The removal of the delay intervals increased response rates for those subjects that completed the trials. PMID:23056425

Policy-Based Middleware for QoS Management and Signaling in the Evolved Packet System

NASA Astrophysics Data System (ADS)

Good, Richard; Gouveia, Fabricio; Magedanz, Thomas; Ventura, Neco

The 3GPP are currently finalizing their Evolved Packet System (EPS) with the Evolved Packet Core (EPC) central to this framework. The EPC is a simplified, flat, all IP-based architecture that supports mobility between heterogeneous access networks and incorporates an evolved QoS concept based on the 3GPP Policy Control and Charging (PCC) framework. The IP Multimedia Subsystem (IMS) is an IP service element within the EPS, introduced for the rapid provisioning of innovative multimedia services. The evolved PCC framework extends the scope of operation and defines new interactions - in particular the S9 reference point is introduced to facilitate inter-domain PCC communication. This paper proposes an enhancement to the IMS/PCC framework that uses SIP routing information to discover signaling and media paths. This mechanism uses standardized IMS/PCC operations and allows applications to effectively issue resource requests from their home domain enabling QoS-connectivity across multiple domains. Because the mechanism operates at the service control layer it does not require any significant transport layer modifications or the sharing of potentially sensitive internal topology information. The evolved PCC architecture and inter-domain route discovery mechanisms were implemented in an evaluation testbed and performed favorably without adversely effecting end user experience.

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.

New hybrid frequency reuse method for packet loss minimization in LTE network.

PubMed

Ali, Nora A; El-Dakroury, Mohamed A; El-Soudani, Magdi; ElSayed, Hany M; Daoud, Ramez M; Amer, Hassanein H

2015-11-01

This paper investigates the problem of inter-cell interference (ICI) in Long Term Evolution (LTE) mobile systems, which is one of the main problems that causes loss of packets between the base station and the mobile station. Recently, different frequency reuse methods, such as soft and fractional frequency reuse, have been introduced in order to mitigate this type of interference. In this paper, minimizing the packet loss between the base station and the mobile station is the main concern. Soft Frequency Reuse (SFR), which is the most popular frequency reuse method, is examined and the amount of packet loss is measured. In order to reduce packet loss, a new hybrid frequency reuse method is implemented. In this method, each cell occupies the same bandwidth of the SFR, but the total system bandwidth is greater than in SFR. This will provide the new method with a lot of new sub-carriers from the neighboring cells to reduce the ICI which represents a big problem in many applications and causes a lot of packets loss. It is found that the new hybrid frequency reuse method has noticeable improvement in the amount of packet loss compared to SFR method in the different frequency bands. Traffic congestion management in Intelligent Transportation system (ITS) is one of the important applications that is affected by the packet loss due to the large amount of traffic that is exchanged between the base station and the mobile node. Therefore, it is used as a studied application for the proposed frequency reuse method and the improvement in the amount of packet loss reached 49.4% in some frequency bands using the new hybrid frequency reuse method.

Verifying Safety Messages Using Relative-Time and Zone Priority in Vehicular Ad Hoc Networks.

PubMed

Banani, Sam; Gordon, Steven; Thiemjarus, Surapa; Kittipiyakul, Somsak

2018-04-13

In high-density road networks, with each vehicle broadcasting multiple messages per second, the arrival rate of safety messages can easily exceed the rate at which digital signatures can be verified. Since not all messages can be verified, algorithms for selecting which messages to verify are required to ensure that each vehicle receives appropriate awareness about neighbouring vehicles. This paper presents a novel scheme to select important safety messages for verification in vehicular ad hoc networks (VANETs). The proposed scheme uses location and direction of the sender, as well as proximity and relative-time between vehicles, to reduce the number of irrelevant messages verified (i.e., messages from vehicles that are unlikely to cause an accident). Compared with other existing schemes, the analysis results show that the proposed scheme can verify messages from nearby vehicles with lower inter-message delay and reduced packet loss and thus provides high level of awareness of the nearby vehicles.

Verifying Safety Messages Using Relative-Time and Zone Priority in Vehicular Ad Hoc Networks

PubMed Central

Banani, Sam; Thiemjarus, Surapa; Kittipiyakul, Somsak

2018-01-01

In high-density road networks, with each vehicle broadcasting multiple messages per second, the arrival rate of safety messages can easily exceed the rate at which digital signatures can be verified. Since not all messages can be verified, algorithms for selecting which messages to verify are required to ensure that each vehicle receives appropriate awareness about neighbouring vehicles. This paper presents a novel scheme to select important safety messages for verification in vehicular ad hoc networks (VANETs). The proposed scheme uses location and direction of the sender, as well as proximity and relative-time between vehicles, to reduce the number of irrelevant messages verified (i.e., messages from vehicles that are unlikely to cause an accident). Compared with other existing schemes, the analysis results show that the proposed scheme can verify messages from nearby vehicles with lower inter-message delay and reduced packet loss and thus provides high level of awareness of the nearby vehicles. PMID:29652840

An On-Demand Emergency Packet Transmission Scheme for Wireless Body Area Networks.

PubMed

Al Ameen, Moshaddique; Hong, Choong Seon

2015-12-04

The rapid developments of sensor devices that can actively monitor human activities have given rise to a new field called wireless body area network (BAN). A BAN can manage devices in, on and around the human body. Major requirements of such a network are energy efficiency, long lifetime, low delay, security, etc. Traffic in a BAN can be scheduled (normal) or event-driven (emergency). Traditional media access control (MAC) protocols use duty cycling to improve performance. A sleep-wake up cycle is employed to save energy. However, this mechanism lacks features to handle emergency traffic in a prompt and immediate manner. To deliver an emergency packet, a node has to wait until the receiver is awake. It also suffers from overheads, such as idle listening, overhearing and control packet handshakes. An external radio-triggered wake up mechanism is proposed to handle prompt communication. It can reduce the overheads and improve the performance through an on-demand scheme. In this work, we present a simple-to-implement on-demand packet transmission scheme by taking into considerations the requirements of a BAN. The major concern is handling the event-based emergency traffic. The performance analysis of the proposed scheme is presented. The results showed significant improvements in the overall performance of a BAN compared to state-of-the-art protocols in terms of energy consumption, delay and lifetime.

Encryption for confidentiality of the network and influence of this to the quality of streaming video through network

NASA Astrophysics Data System (ADS)

Sevcik, L.; Uhrin, D.; Frnda, J.; Voznak, M.; Toral-Cruz, Homer; Mikulec, M.; Jakovlev, Sergej

2015-05-01

Nowadays, the interest in real-time services, like audio and video, is growing. These services are mostly transmitted over packet networks, which are based on IP protocol. It leads to analyses of these services and their behavior in such networks which are becoming more frequent. Video has become the significant part of all data traffic sent via IP networks. In general, a video service is one-way service (except e.g. video calls) and network delay is not such an important factor as in a voice service. Dominant network factors that influence the final video quality are especially packet loss, delay variation and the capacity of the transmission links. Analysis of video quality concentrates on the resistance of video codecs to packet loss in the network, which causes artefacts in the video. IPsec provides confidentiality in terms of safety, integrity and non-repudiation (using HMAC-SHA1 and 3DES encryption for confidentiality and AES in CBC mode) with an authentication header and ESP (Encapsulating Security Payload). The paper brings a detailed view of the performance of video streaming over an IP-based network. We compared quality of video with packet loss and encryption as well. The measured results demonstrated the relation between the video codec type and bitrate to the final video quality.

An On-Demand Emergency Packet Transmission Scheme for Wireless Body Area Networks

PubMed Central

Al Ameen, Moshaddique; Hong, Choong Seon

2015-01-01

The rapid developments of sensor devices that can actively monitor human activities have given rise to a new field called wireless body area network (BAN). A BAN can manage devices in, on and around the human body. Major requirements of such a network are energy efficiency, long lifetime, low delay, security, etc. Traffic in a BAN can be scheduled (normal) or event-driven (emergency). Traditional media access control (MAC) protocols use duty cycling to improve performance. A sleep-wake up cycle is employed to save energy. However, this mechanism lacks features to handle emergency traffic in a prompt and immediate manner. To deliver an emergency packet, a node has to wait until the receiver is awake. It also suffers from overheads, such as idle listening, overhearing and control packet handshakes. An external radio-triggered wake up mechanism is proposed to handle prompt communication. It can reduce the overheads and improve the performance through an on-demand scheme. In this work, we present a simple-to-implement on-demand packet transmission scheme by taking into considerations the requirements of a BAN. The major concern is handling the event-based emergency traffic. The performance analysis of the proposed scheme is presented. The results showed significant improvements in the overall performance of a BAN compared to state-of-the-art protocols in terms of energy consumption, delay and lifetime. PMID:26690161

Performance of highly connected photonic switching lossless metro-access optical networks

NASA Astrophysics Data System (ADS)

Martins, Indayara Bertoldi; Martins, Yara; Barbosa, Felipe Rudge

2018-03-01

The present work analyzes the performance of photonic switching networks, optical packet switching (OPS) and optical burst switching (OBS), in mesh topology of different sizes and configurations. The "lossless" photonic switching node is based on a semiconductor optical amplifier, demonstrated and validated with experimental results on optical power gain, noise figure, and spectral range. The network performance was evaluated through computer simulations based on parameters such as average number of hops, optical packet loss fraction, and optical transport delay (Am). The combination of these elements leads to a consistent account of performance, in terms of network traffic and packet delivery for OPS and OBS metropolitan networks. Results show that a combination of highly connected mesh topologies having an ingress e-buffer present high efficiency and throughput, with very low packet loss and low latency, ensuring fast data delivery to the final receiver.

On-board congestion control for satellite packet switching networks

NASA Technical Reports Server (NTRS)

Chu, Pong P.

1991-01-01

It is desirable to incorporate packet switching capability on-board for future communication satellites. Because of the statistical nature of packet communication, incoming traffic fluctuates and may cause congestion. Thus, it is necessary to incorporate a congestion control mechanism as part of the on-board processing to smooth and regulate the bursty traffic. Although there are extensive studies on congestion control for both baseband and broadband terrestrial networks, these schemes are not feasible for space based switching networks because of the unique characteristics of satellite link. Here, we propose a new congestion control method for on-board satellite packet switching. This scheme takes into consideration the long propagation delay in satellite link and takes advantage of the the satellite's broadcasting capability. It divides the control between the ground terminals and satellite, but distributes the primary responsibility to ground terminals and only requires minimal hardware resource on-board satellite.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

PubMed Central

Wang, Haiyan; He, Ke

2018-01-01

The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay. PMID:29690621

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

PubMed

Bai, Weigang; Wang, Haiyan; He, Ke; Zhao, Ruiqin

2018-04-23

The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Coding and transmission of subband coded images on the Internet

NASA Astrophysics Data System (ADS)

Wah, Benjamin W.; Su, Xiao

2001-09-01

Subband-coded images can be transmitted in the Internet using either the TCP or the UDP protocol. Delivery by TCP gives superior decoding quality but with very long delays when the network is unreliable, whereas delivery by UDP has negligible delays but with degraded quality when packets are lost. Although images are delivered currently over the Internet by TCP, we study in this paper the use of UDP to deliver multi-description reconstruction-based subband-coded images. First, in order to facilitate recovery from UDP packet losses, we propose a joint sender-receiver approach for designing optimized reconstruction-based subband transform (ORB-ST) in multi-description coding (MDC). Second, we carefully evaluate the delay-quality trade-offs between the TCP delivery of SDC images and the UDP and combined TCP/UDP delivery of MDC images. Experimental results show that our proposed ORB-ST performs well in real Internet tests, and UDP and combined TCP/UDP delivery of MDC images provide a range of attractive alternatives to TCP delivery.

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

Stationary phase method and delay times for relativistic and non-relativistic tunneling particles

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

Bernardini, A.E.

2009-06-15

The stationary phase method is frequently adopted for calculating tunneling phase times of analytically-continuous Gaussian or infinite-bandwidth step pulses which collide with a potential barrier. This report deals with the basic concepts on deducing transit times for quantum scattering: the stationary phase method and its relation with delay times for relativistic and non-relativistic tunneling particles. After reexamining the above-barrier diffusion problem, we notice that the applicability of this method is constrained by several subtleties in deriving the phase time that describes the localization of scattered wave packets. Using a recently developed procedure - multiple wave packet decomposition - for somemore » specifical colliding configurations, we demonstrate that the analytical difficulties arising when the stationary phase method is applied for obtaining phase (traversal) times are all overcome. In this case, we also investigate the general relation between phase times and dwell times for quantum tunneling/scattering. Considering a symmetrical collision of two identical wave packets with an one-dimensional barrier, we demonstrate that these two distinct transit time definitions are explicitly connected. The traversal times are obtained for a symmetrized (two identical bosons) and an antisymmetrized (two identical fermions) quantum colliding configuration. Multiple wave packet decomposition shows us that the phase time (group delay) describes the exact position of the scattered particles and, in addition to the exact relation with the dwell time, leads to correct conceptual understanding of both transit time definitions. At last, we extend the non-relativistic formalism to the solutions for the tunneling zone of a one-dimensional electrostatic potential in the relativistic (Dirac to Klein-Gordon) wave equation where the incoming wave packet exhibits the possibility of being almost totally transmitted through the potential barrier. The conditions for the occurrence of accelerated and, eventually, superluminal tunneling transmission probabilities are all quantified and the problematic superluminal interpretation based on the non-relativistic tunneling dynamics is revisited. Lessons concerning the dynamics of relativistic tunneling and the mathematical structure of its solutions suggest revealing insights into mathematically analogous condensed-matter experiments using electrostatic barriers in single- and bi-layer graphene, for which the accelerated tunneling effect deserves a more careful investigation.« less

Vibrational wave packets in the B 1Πu and D 1Σu+ states of Cs2: Determination of improved Cs2+(X) and Cs2(B) spectroscopic constants

NASA Astrophysics Data System (ADS)

Oldenburg, A. L.; John, P. C.; Eden, J. G.

2000-12-01

Vibrational wave packets in the B 1Πu and D 1Σu+ excited states of Cs2 have been studied on the ˜100 fs time scale by pump-probe laser spectroscopy. The temporal behavior of the wave packets was monitored by photoionizing the electronically excited molecule with a time-delayed probe pulse and recording the time and energy-integrated photoelectron signal as a function of time delay between the pump and probe pulses. For the B 1Σu+ experiments, wave packets were produced by exciting the B 1Σu+←X 1Σg+ transition in the ˜740-790 nm region and subsequently detected by photoionizing the molecule at wavelengths between 565 nm and 600 nm. By simulating the experimentally observed transients with the density matrix formalism (and explicitly accounting for laser chirp and |Δv|>1 coherences), improved values for the equilibrium internuclear separation for the Cs2(B1Πu) state and Te for the Cs2+(X) state were determined to be Re(B 1Πu)=4.93±0.03 Å and Te[Cs2+(X)]=29 930±100 cm-1, respectively. Similar experiments were conducted for the D 1Σu+ state. Wave packets composed of vibrational levels (v'≈40-50) perturbed by the bound 2 3Πou state were produced on the D 1Σu+ potential surface by driving the D 1Σu+←X 1Σg+ transition in the 575-610 nm spectral interval.

An Efficient Power Saving Mechanism for Delay-Guaranteed Services in IEEE 802.16e

NASA Astrophysics Data System (ADS)

Park, Yunju; Hwang, Gang Uk

As the IEEE 802.16e Wireless Metropolitan Access Network (WMAN) supports the mobility of a mobile station (MS), increasing MS power efficiency has become an important issue. In this paper, we analyze the sleep-mode operation for an efficient power saving mechanism for delay-guaranteed services in the IEEE 802.16e WMAN and observe the effects of the operating parameters related to this operation. For the analysis we use the M/GI/1/K queueing system with multiple vacations, exhaustive services and setup times. In the analysis, we consider the power consumption during the wake-mode period as well as the sleep-mode period. As a performance measure for the power consumption, we propose the power consumption per unit time per effective arrival which considers the power consumption and the packet blocking probability simultaneously. In addition, since we consider delay-guaranteed services, the average packet response delay is also considered as a performance measure. Based on the performance measures, we obtain the optimal sleep-mode operation which minimizes the power consumption per unit time per effective arrival with a given delay requirement. Numerical studies are also provided to investigate the system performance and to show how to achieve our objective.

Framework based on stochastic L-Systems for modeling IP traffic with multifractal behavior

NASA Astrophysics Data System (ADS)

Salvador, Paulo S.; Nogueira, Antonio; Valadas, Rui

2003-08-01

In a previous work we have introduced a multifractal traffic model based on so-called stochastic L-Systems, which were introduced by biologist A. Lindenmayer as a method to model plant growth. L-Systems are string rewriting techniques, characterized by an alphabet, an axiom (initial string) and a set of production rules. In this paper, we propose a novel traffic model, and an associated parameter fitting procedure, which describes jointly the packet arrival and the packet size processes. The packet arrival process is modeled through a L-System, where the alphabet elements are packet arrival rates. The packet size process is modeled through a set of discrete distributions (of packet sizes), one for each arrival rate. In this way the model is able to capture correlations between arrivals and sizes. We applied the model to measured traffic data: the well-known pOct Bellcore, a trace of aggregate WAN traffic and two traces of specific applications (Kazaa and Operation Flashing Point). We assess the multifractality of these traces using Linear Multiscale Diagrams. The suitability of the traffic model is evaluated by comparing the empirical and fitted probability mass and autocovariance functions; we also compare the packet loss ratio and average packet delay obtained with the measured traces and with traces generated from the fitted model. Our results show that our L-System based traffic model can achieve very good fitting performance in terms of first and second order statistics and queuing behavior.

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

NASA Technical Reports Server (NTRS)

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

1980-01-01

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

Packet spacing : an enabling mechanism for delivering multimedia content in computational grids /

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

Feng, A. C.; Feng, W. C.; Belford, Geneva G.

2001-01-01

Streaming multimedia with UDP has become increasingly popular over distributed systems like the Internet. Scientific applications that stream multimedia include remote computational steering of visualization data and video-on-demand teleconferencing over the Access Grid. However, UDP does not possess a self-regulating, congestion-control mechanism; and most best-efort traflc is served by congestion-controlled TCF! Consequently, UDP steals bandwidth from TCP such that TCP$ows starve for network resources. With the volume of Internet traffic continuing to increase, the perpetuation of UDP-based streaming will cause the Internet to collapse as it did in the mid-1980's due to the use of non-congestion-controlled TCP. To address thismore » problem, we introduce the counterintuitive notion of inter-packet spacing with control feedback to enable UDP-based applications to perform well in the next-generation Internet and computational grids. When compared with traditional UDP-based streaming, we illustrate that our approach can reduce packet loss over SO% without adversely afecting delivered throughput. Keywords: network protocol, multimedia, packet spacing, streaming, TCI: UDlq rate-adjusting congestion control, computational grid, Access Grid.« less

Self-Learning Power Control in Wireless Sensor Networks.

PubMed

Chincoli, Michele; Liotta, Antonio

2018-01-27

Current trends in interconnecting myriad smart objects to monetize on Internet of Things applications have led to high-density communications in wireless sensor networks. This aggravates the already over-congested unlicensed radio bands, calling for new mechanisms to improve spectrum management and energy efficiency, such as transmission power control. Existing protocols are based on simplistic heuristics that often approach interference problems (i.e., packet loss, delay and energy waste) by increasing power, leading to detrimental results. The scope of this work is to investigate how machine learning may be used to bring wireless nodes to the lowest possible transmission power level and, in turn, to respect the quality requirements of the overall network. Lowering transmission power has benefits in terms of both energy consumption and interference. We propose a protocol of transmission power control through a reinforcement learning process that we have set in a multi-agent system. The agents are independent learners using the same exploration strategy and reward structure, leading to an overall cooperative network. The simulation results show that the system converges to an equilibrium where each node transmits at the minimum power while respecting high packet reception ratio constraints. Consequently, the system benefits from low energy consumption and packet delay.

Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

NASA Astrophysics Data System (ADS)

Satrya, Gandeva B.; Brotoharsono, Tri

2013-03-01

The increase of user mobility and the need for data access anytime also increases the interest in broadband wireless access (BWA). The best available quality of experience for mobile data service users are assured for IEEE 802.16e based users. The main problem of assuring a high QOS value is how to allocate available resources among users in order to meet the QOS requirement for criteria such as delay, throughput, packet loss and fairness. There is no specific standard scheduling mechanism stated by IEEE standards, which leaves it for implementer differentiation. There are five QOS service classes defined by IEEE 802.16: Unsolicited Grant Scheme (UGS), Extended Real Time Polling Service (ertPS), Real Time Polling Service (rtPS), Non Real Time Polling Service (nrtPS) and Best Effort Service (BE). Each class has different QOS parameter requirements for throughput and delay/jitter constraints. This paper proposes Modified Weighted Fair Queuing (MWFQ) scheduling scenario which was based on Weighted Round Robin (WRR) and Weighted Fair Queuing (WFQ). The performance of MWFQ was assessed by using above five QoS criteria. The simulation shows that using the concept of total packet size calculation improves the network's performance.

Self-Learning Power Control in Wireless Sensor Networks

PubMed Central

Liotta, Antonio

2018-01-01

Current trends in interconnecting myriad smart objects to monetize on Internet of Things applications have led to high-density communications in wireless sensor networks. This aggravates the already over-congested unlicensed radio bands, calling for new mechanisms to improve spectrum management and energy efficiency, such as transmission power control. Existing protocols are based on simplistic heuristics that often approach interference problems (i.e., packet loss, delay and energy waste) by increasing power, leading to detrimental results. The scope of this work is to investigate how machine learning may be used to bring wireless nodes to the lowest possible transmission power level and, in turn, to respect the quality requirements of the overall network. Lowering transmission power has benefits in terms of both energy consumption and interference. We propose a protocol of transmission power control through a reinforcement learning process that we have set in a multi-agent system. The agents are independent learners using the same exploration strategy and reward structure, leading to an overall cooperative network. The simulation results show that the system converges to an equilibrium where each node transmits at the minimum power while respecting high packet reception ratio constraints. Consequently, the system benefits from low energy consumption and packet delay. PMID:29382072

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.

Patients’ Heart Monitoring System Based on Wireless Sensor Network

NASA Astrophysics Data System (ADS)

Sollu, T. S.; Alamsyah; Bachtiar, M.; Sooai, A. G.

2018-04-01

Wireless sensor network (WSN) has been utilized to support the health field such as monitoring the patient’s heartbeat. Heart health monitoring is essential in maintaining health, especially in the elderly. Such an arrangement is needed to understand the patient’s heart characteristics. The increasing number of patients certainly will enhance the burdens of doctors or nurses in dealing with the condition of the patients. Therefore, required a solution that could help doctors or nurses in monitoring the progress of patients’ health at a real time. This research proposes a design and application of a patient heart monitoring system based on WSN. This system with using electrocardiograph (ECG) mounted on the patients’ body and sent to the server through the ZigBee. The results indicated that the retrieval of data for 15 seconds in male patients, with the age of 25 years was 17 times rate or equal to 68 bpm. For 884 data packets sent for 15 minutes using ZigBee produce a data as much as 4488 bytes, throughput of 2.39 Kbps, and 0.24486 seconds of average delay. The measurement of the communication coverage based on the open space conditions within 15 seconds through ZigBee resulting throughput value of 4.19 Kbps, packet loss of 0 %, and 6.667 seconds of average delay. While, the measurement of communication range based on closed space condition through ZigBee resulting throughput of 4.27 Kbps, packet loss of 0 %, and 6.55 seconds of average delay.

Prioritized packet video transmission over time-varying wireless channel using proactive FEC

NASA Astrophysics Data System (ADS)

Kumwilaisak, Wuttipong; Kim, JongWon; Kuo, C.-C. Jay

2000-12-01

Quality of video transmitted over time-varying wireless channels relies heavily on the coordinated effort to cope with both channel and source variations dynamically. Given the priority of each source packet and the estimated channel condition, an adaptive protection scheme based on joint source-channel criteria is investigated via proactive forward error correction (FEC). With proactive FEC in Reed Solomon (RS)/Rate-compatible punctured convolutional (RCPC) codes, we study a practical algorithm to match the relative priority of source packets and instantaneous channel conditions. The channel condition is estimated to capture the long-term fading effect in terms of the averaged SNR over a preset window. Proactive protection is performed for each packet based on the joint source-channel criteria with special attention to the accuracy, time-scale match, and feedback delay of channel status estimation. The overall gain of the proposed protection mechanism is demonstrated in terms of the end-to-end wireless video performance.

OSI Network-layer Abstraction: Analysis of Simulation Dynamics and Performance Indicators

NASA Astrophysics Data System (ADS)

Lawniczak, Anna T.; Gerisch, Alf; Di Stefano, Bruno

2005-06-01

The Open Systems Interconnection (OSI) reference model provides a conceptual framework for communication among computers in a data communication network. The Network Layer of this model is responsible for the routing and forwarding of packets of data. We investigate the OSI Network Layer and develop an abstraction suitable for the study of various network performance indicators, e.g. throughput, average packet delay, average packet speed, average packet path-length, etc. We investigate how the network dynamics and the network performance indicators are affected by various routing algorithms and by the addition of randomly generated links into a regular network connection topology of fixed size. We observe that the network dynamics is not simply the sum of effects resulting from adding individual links to the connection topology but rather is governed nonlinearly by the complex interactions caused by the existence of all randomly added and already existing links in the network. Data for our study was gathered using Netzwerk-1, a C++ simulation tool that we developed for our abstraction.

Source-Adaptation-Based Wireless Video Transport: A Cross-Layer Approach

NASA Astrophysics Data System (ADS)

Qu, Qi; Pei, Yong; Modestino, James W.; Tian, Xusheng

2006-12-01

Real-time packet video transmission over wireless networks is expected to experience bursty packet losses that can cause substantial degradation to the transmitted video quality. In wireless networks, channel state information is hard to obtain in a reliable and timely manner due to the rapid change of wireless environments. However, the source motion information is always available and can be obtained easily and accurately from video sequences. Therefore, in this paper, we propose a novel cross-layer framework that exploits only the motion information inherent in video sequences and efficiently combines a packetization scheme, a cross-layer forward error correction (FEC)-based unequal error protection (UEP) scheme, an intracoding rate selection scheme as well as a novel intraframe interleaving scheme. Our objective and subjective results demonstrate that the proposed approach is very effective in dealing with the bursty packet losses occurring on wireless networks without incurring any additional implementation complexity or delay. Thus, the simplicity of our proposed system has important implications for the implementation of a practical real-time video transmission system.

Physical-layer network coding for passive optical interconnect in datacenter networks.

PubMed

Lin, Rui; Cheng, Yuxin; Guan, Xun; Tang, Ming; Liu, Deming; Chan, Chun-Kit; Chen, Jiajia

2017-07-24

We introduce physical-layer network coding (PLNC) technique in a passive optical interconnect (POI) architecture for datacenter networks. The implementation of the PLNC in the POI at 2.5 Gb/s and 10Gb/s have been experimentally validated while the gains in terms of network layer performances have been investigated by simulation. The results reveal that in order to realize negligible packet drop, the wavelengths usage can be reduced by half while a significant improvement in packet delay especially under high traffic load can be achieved by employing PLNC over POI.

Hyperfine-Structure-Induced Depolarization of Impulsively Aligned I2 Molecules

NASA Astrophysics Data System (ADS)

Thomas, Esben F.; Søndergaard, Anders A.; Shepperson, Benjamin; Henriksen, Niels E.; Stapelfeldt, Henrik

2018-04-01

A moderately intense 450 fs laser pulse is used to create rotational wave packets in gas phase I2 molecules. The ensuing time-dependent alignment, measured by Coulomb explosion imaging with a delayed probe pulse, exhibits the characteristic revival structures expected for rotational wave packets but also a complex nonperiodic substructure and decreasing mean alignment not observed before. A quantum mechanical model attributes the phenomena to coupling between the rotational angular momenta and the nuclear spins through the electric quadrupole interaction. The calculated alignment trace agrees very well with the experimental results.

McMAC: Towards a MAC Protocol with Multi-Constrained QoS Provisioning for Diverse Traffic in Wireless Body Area Networks

PubMed Central

Monowar, Muhammad Mostafa; Hassan, Mohammad Mehedi; Bajaber, Fuad; Al-Hussein, Musaed; Alamri, Atif

2012-01-01

The emergence of heterogeneous applications with diverse requirements for resource-constrained Wireless Body Area Networks (WBANs) poses significant challenges for provisioning Quality of Service (QoS) with multi-constraints (delay and reliability) while preserving energy efficiency. To address such challenges, this paper proposes McMAC, a MAC protocol with multi-constrained QoS provisioning for diverse traffic classes in WBANs. McMAC classifies traffic based on their multi-constrained QoS demands and introduces a novel superframe structure based on the “transmit-whenever-appropriate” principle, which allows diverse periods for diverse traffic classes according to their respective QoS requirements. Furthermore, a novel emergency packet handling mechanism is proposed to ensure packet delivery with the least possible delay and the highest reliability. McMAC is also modeled analytically, and extensive simulations were performed to evaluate its performance. The results reveal that McMAC achieves the desired delay and reliability guarantee according to the requirements of a particular traffic class while achieving energy efficiency. PMID:23202224

Delay-based virtual congestion control in multi-tenant datacenters

NASA Astrophysics Data System (ADS)

Liu, Yuxin; Zhu, Danhong; Zhang, Dong

2018-03-01

With the evolution of cloud computing and virtualization, the congestion control of virtual datacenters has become the basic issue for multi-tenant datacenters transmission. Regarding to the friendly conflict of heterogeneous congestion control among multi-tenant, this paper proposes a delay-based virtual congestion control, which translates the multi-tenant heterogeneous congestion control into delay-based feedback uniformly by setting the hypervisor translation layer, modifying three-way handshake of explicit feedback and packet loss feedback and throttling receive window. The simulation results show that the delay-based virtual congestion control can effectively solve the unfairness of heterogeneous feedback congestion control algorithms.

A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks.

PubMed

Khan, Anwar; Ahmedy, Ismail; Anisi, Mohammad Hossein; Javaid, Nadeem; Ali, Ihsan; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan

2018-01-09

Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay.

A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks

PubMed Central

Khan, Anwar; Anisi, Mohammad Hossein; Javaid, Nadeem; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan

2018-01-01

Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay. PMID:29315247

A two-hop based adaptive routing protocol for real-time wireless sensor networks.

PubMed

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

Video Conferences through the Internet: How to Survive in a Hostile Environment

PubMed Central

Fernández, Carlos; Fernández-Navajas, Julián; Sequeira, Luis; Casadesus, Luis

2014-01-01

This paper analyzes and compares two different video conference solutions, widely used in corporate and home environments, with a special focus on the mechanisms used for adapting the traffic to the network status. The results show how these mechanisms are able to provide a good quality in the hostile environment of the public Internet, a best effort network without delay or delivery guarantees. Both solutions are evaluated in a laboratory, where different network impairments (bandwidth limit, delay, and packet loss) are set, in both the uplink and the downlink, and the reaction of the applications is measured. The tests show how these solutions modify their packet size and interpacket time, in order to increase or reduce the sent data. One of the solutions also uses a scalable video codec, able to adapt the traffic to the network status and to the end devices. PMID:24605066

Hack-proof Synchronization Protocol for Multi-player Online Games

NASA Astrophysics Data System (ADS)

Fung, Yeung Siu; Lui, John C. S.

Modern multi-player online games are popular and attractive because they provide a sense of virtual world experience to users: players can interact with each other on the Internet but perceive a local area network responsiveness. To make this possible, most modern multi-player online games use similar networking architecture that aims to hide the effects of network latency, packet loss, and high variance of delay from players. Because real-time interactivity is a crucial feature from a player's point of view, any delay perceived by a player can affect his/her performance [16]. Therefore, the game client must be able to run and accept new user commands continuously regardless of the condition of the underlying communication channel, and that it will not stop responding because of waiting for update packets from other players. To make this possible, multi-player online games typically use protocols based on "dead-reckoning" [5, 6, 9] which allows loose synchronization between players.

Scenarios for control and data flows in multiprotocol over ATM

NASA Astrophysics Data System (ADS)

Kujoory, Ali

1997-10-01

The multiprotocol over ATM (MPOA), specified by the ATM Forum, provides an architecture for transfer of Internetwork layer packets (Layer 3 datagram such as IP, IPX) over ATM subnets or across the emulated LANs. MPOA provides shortcuts that bypass routers to avoid router bottlenecks. It is a grand union of some of the existing standards such as LANE by the ATM Forum, NHRP by the IETF, and the Q.2931 by ITU. The intent of this paper is to clarify the data flows between pairs of source and destination hosts in an MPOA system. It includes scenarios for both the intra- and inter-subnet flows between different pairs of MPOA end-systems. The intrasubnet flows simply use LANE for address resolution or data transfer. The inter-subnet flows may use a default path for short-lived flows or a shortcut for long-lived flows. The default path uses the LANE and router capabilities. The shortcut path uses LANE plus NHRP for ATM address resoluton. An ATM virtual circuit is established before the data transfer. This allows efficient transfer of internetwork layer packets over ATM for real-time applications.

Cost-effective handoff scheme based on mobility-aware dual pointer forwarding in proxy mobile IPv6 networks.

PubMed

Son, Seungsik; Jeong, Jongpil

2014-01-01

In this paper, a mobility-aware Dual Pointer Forwarding scheme (mDPF) is applied in Proxy Mobile IPv6 (PMIPv6) networks. The movement of a Mobile Node (MN) is classified as intra-domain and inter-domain handoff. When the MN moves, this scheme can reduce the high signaling overhead for intra-handoff/inter-handoff, because the Local Mobility Anchor (LMA) and Mobile Access Gateway (MAG) are connected by pointer chains. In other words, a handoff is aware of low mobility between the previously attached MAG (pMAG) and newly attached MAG (nMAG), and another handoff between the previously attached LMA (pLMA) and newly attached LMA (nLMA) is aware of high mobility. Based on these mobility-aware binding updates, the overhead of the packet delivery can be reduced. Also, we analyse the binding update cost and packet delivery cost for route optimization, based on the mathematical analytic model. Analytical results show that our mDPF outperforms the PMIPv6 and the other pointer forwarding schemes, in terms of reducing the total cost of signaling.

Wave-packet approach to transport properties of carrier coupled with intermolecular and intramolecular vibrations of organic semiconductors

NASA Astrophysics Data System (ADS)

Ishii, Hiroyuki; Honma, Keisuke; Kobayashi, Nobuhiko; Hirose, Kenji

2012-06-01

We present a methodology to study the charge-transport properties of organic semiconductors by the time-dependent wave-packet diffusion method, taking the polaron effects into account. As an example, we investigate the transport properties of single-crystal pentacene organic semiconductors coupled with inter- and intramolecular vibrations within the mixed Holstein and Peierls model, which describes both hopping and bandlike transport behaviors due to small and large polaron formations. Taking into account static disorders, which inevitably exist in the molecular crystals, we present the temperature dependence of charge-transport properties in competition among the thermal fluctuation of molecular motions, the polaron formation, and the static disorders.

Clocking and Synchronization Circuits in Multiprocessor Systems

DTIC Science & Technology

1989-04-01

18 3.4 Inter -chip Clocking Strategies...may occur when two or more of the switches make transitions at different times during the inter - val during which those inputs are being processed...increased without any fruitful computation. The sources of the inter -chip clock skew are the electromagnetic propagation delay, the buffer delay within

Repeated Transmissions In Mobile/Satellite Communications

NASA Technical Reports Server (NTRS)

Yan, Tsun-Yee; Clare, Loren P.

1988-01-01

Repetition increases throughput and decreases delay. Paper discusses theoretical performance of communication system for land-mobile stations with satellite relay using ALOHA random-access protocol modified for repeated transimssions. Methods and conclusions contribute to general understanding of packet communications in fading channels.

A Novel Cross-Layer Routing Protocol Based on Network Coding for Underwater Sensor Networks.

PubMed

Wang, Hao; Wang, Shilian; Bu, Renfei; Zhang, Eryang

2017-08-08

Underwater wireless sensor networks (UWSNs) have attracted increasing attention in recent years because of their numerous applications in ocean monitoring, resource discovery and tactical surveillance. However, the design of reliable and efficient transmission and routing protocols is a challenge due to the low acoustic propagation speed and complex channel environment in UWSNs. In this paper, we propose a novel cross-layer routing protocol based on network coding (NCRP) for UWSNs, which utilizes network coding and cross-layer design to greedily forward data packets to sink nodes efficiently. The proposed NCRP takes full advantages of multicast transmission and decode packets jointly with encoded packets received from multiple potential nodes in the entire network. The transmission power is optimized in our design to extend the life cycle of the network. Moreover, we design a real-time routing maintenance protocol to update the route when detecting inefficient relay nodes. Substantial simulations in underwater environment by Network Simulator 3 (NS-3) show that NCRP significantly improves the network performance in terms of energy consumption, end-to-end delay and packet delivery ratio compared with other routing protocols for UWSNs.

Call Admission Control on Single Node Networks under Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) Scheduler

NASA Astrophysics Data System (ADS)

Hanada, Masaki; Nakazato, Hidenori; Watanabe, Hitoshi

Multimedia applications such as music or video streaming, video teleconferencing and IP telephony are flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve this problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) was proposed in [17]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we propose a call admission control (CAC) algorithm for ORC-GPS, for leaky-bucket constrained sessions with deterministic delay requirements. This CAC algorithm for ORC-GPS determines the optimal values of parameters of ORC-GPS from the deterministic delay requirements of the sessions. In numerical experiments, we compare the CAC algorithm for ORC-GPS with one for GPS in terms of schedulable region and computational complexity.

Neighboring and connectivity-aware routing in VANETs.

PubMed

Ghafoor, Huma; Koo, Insoo; Gohar, Nasir-ud-Din

2014-01-01

A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

High capacity low delay packet broadcasting multiaccess schemes for satellite repeater systems

NASA Astrophysics Data System (ADS)

Bose, S. K.

1980-12-01

Demand assigned packet radio schemes using satellite repeaters can achieve high capacities but often exhibit relatively large delays under low traffic conditions when compared to random access. Several schemes which improve delay performance at low traffic but which have high capacity are presented and analyzed. These schemes allow random acess attempts by users, who are waiting for channel assignments. The performance of these are considered in the context of a multiple point communication system carrying fixed length messages between geographically distributed (ground) user terminals which are linked via a satellite repeater. Channel assignments are done following a BCC queueing discipline by a (ground) central controller on the basis of requests correctly received over a collision type access channel. In TBACR Scheme A, some of the forward message channels are set aside for random access transmissions; the rest are used in a demand assigned mode. Schemes B and C operate all their forward message channels in a demand assignment mode but, by means of appropriate algorithms for trailer channel selection, allow random access attempts on unassigned channels. The latter scheme also introduces framing and slotting of the time axis to implement a more efficient algorithm for trailer channel selection than the former.

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

A comparative signaling cost analysis of Macro Mobility scheme in NEMO (MM-NEMO) with mobility management protocol

NASA Astrophysics Data System (ADS)

Islam, Shayla; Abdalla, Aisha H.; Habaebi, Mohamed H.; Latif, Suhaimi A.; Hassan, Wan H.; Hasan, Mohammad K.; Ramli, H. A. M.; Khalifa, Othman O.

2013-12-01

NEMO BSP is an upgraded addition to Mobile IPv6 (MIPv6). As MIPv6 and its enhancements (i.e. HMIPv6) possess some limitations like higher handoff latency, packet loss, NEMO BSP also faces all these shortcomings by inheritance. Network Mobility (NEMO) is involved to handle the movement of Mobile Router (MR) and it's Mobile Network Nodes (MNNs) during handoff. Hence it is essential to upgrade the performance of mobility management protocol to obtain continuous session connectivity with lower delay and packet loss in NEMO environment. The completion of handoff process in NEMO BSP usually takes longer period since MR needs to register its single primary care of address (CoA) with home network that may cause performance degradation of the applications running on Mobile Network Nodes. Moreover, when a change in point of attachment of the mobile network is accompanied by a sudden burst of signaling messages, "Signaling Storm" occurs which eventually results in temporary congestion, packet delays or even packet loss. This effect is particularly significant for wireless environment where a wireless link is not as steady as a wired link since bandwidth is relatively limited in wireless link. Hence, providing continuous Internet connection without any interruption through applying multihoming technique and route optimization mechanism in NEMO are becoming the center of attention to the current researchers. In this paper, we propose a handoff cost model to compare the signaling cost of MM-NEMO with NEMO Basic Support Protocol (NEMO BSP) and HMIPv6.The numerical results shows that the signaling cost for the MM-NEMO scheme is about 69.6 % less than the NEMO-BSP and HMIPv6.

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.

Creating high-purity angular-momentum-state Rydberg atoms by a pair of unipolar laser pulses

NASA Astrophysics Data System (ADS)

Xin, PeiPei; Cheng, Hong; Zhang, ShanShan; Wang, HanMu; Xu, ZiShan; Liu, HongPing

2018-04-01

We propose a method of producing high-purity angular-momentum-state Rydberg atoms by a pair of unipolar laser pulses. The first positive-polarity optical half-cycle pulse is used to prepare an excited-state wave packet while the second one is less intense, but with opposite polarity and time delayed, and is employed to drag back the escaping free electron and clip the shape of the bound Rydberg wave packet, selectively increasing or decreasing a fraction of the angular-momentum components. An intelligent choice of laser parameters such as phase and amplitude helps us to control the orbital-angular-momentum composition of an electron wave packet with more facility; thus, a specified angular-momentum state with high purity can be achieved. This scheme of producing high-purity angular-momentum-state Rydberg atoms has significant application in quantum-information processing.

Assessment of the 802.11g Wireless Protocol for Lunar Surface Communications

NASA Technical Reports Server (NTRS)

Chelmins, David T.; Bguyen, Hung D.; Foore, Lawrence R.

2009-01-01

Future lunar surface missions supporting the NASA Vision for Space Exploration will rely on wireless networks to transmit voice and data. The ad hoc network architecture is of particular interest since it does not require a complex infrastructure. In this report, we looked at data performance over an ad hoc network with varying distances between Apple AirPort wireless cards. We developed a testing program to transmit data packets at precise times and then monitored the receive time to characterize connection delay, packet loss, and data rate. Best results were received for wireless links of less than 75 ft, and marginally acceptable (25-percent) packet loss was received at 150 ft. It is likely that better results will be obtained on the lunar surface because of reduced radiofrequency interference; however, higher power transmitters or receivers will be needed for significant performance gains.

Hartman effect and weak measurements that are not really weak

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

Sokolovski, D.; IKERBASQUE, Basque Foundation for Science, Alameda Urquijo, 36-5, Plaza Bizkaia, 48011, Bilbao, Bizkaia; Akhmatskaya, E.

2011-08-15

We show that in wave packet tunneling, localization of the transmitted particle amounts to a quantum measurement of the delay it experiences in the barrier. With no external degree of freedom involved, the envelope of the wave packet plays the role of the initial pointer state. Under tunneling conditions such ''self-measurement'' is necessarily weak, and the Hartman effect just reflects the general tendency of weak values to diverge, as postselection in the final state becomes improbable. We also demonstrate that it is a good precision, or a 'not really weak' quantum measurement: no matter how wide the barrier d, itmore » is possible to transmit a wave packet with a width {sigma} small compared to the observed advancement. As is the case with all weak measurements, the probability of transmission rapidly decreases with the ratio {sigma}/d.« less

Efficient image data distribution and management with application to web caching architectures

NASA Astrophysics Data System (ADS)

Han, Keesook J.; Suter, Bruce W.

2003-03-01

We present compact image data structures and associated packet delivery techniques for effective Web caching architectures. Presently, images on a web page are inefficiently stored, using a single image per file. Our approach is to use clustering to merge similar images into a single file in order to exploit the redundancy between images. Our studies indicate that a 30-50% image data size reduction can be achieved by eliminating the redundancies of color indexes. Attached to this file is new metadata to permit an easy extraction of images. This approach will permit a more efficient use of the cache, since a shorter list of cache references will be required. Packet and transmission delays can be reduced by 50% eliminating redundant TCP/IP headers and connection time. Thus, this innovative paradigm for the elimination of redundancy may provide valuable benefits for optimizing packet delivery in IP networks by reducing latency and minimizing the bandwidth requirements.

The queueing perspective of asynchronous network coding in two-way relay network

NASA Astrophysics Data System (ADS)

Liang, Yaping; Chang, Qing; Li, Xianxu

2018-04-01

Asynchronous network coding (NC) has potential to improve the wireless network performance compared with a routing or the synchronous network coding. Recent researches concentrate on the optimization between throughput/energy consuming and delay with a couple of independent input flow. However, the implementation of NC requires a thorough investigation of its impact on relevant queueing systems where few work focuses on. Moreover, few works study the probability density function (pdf) in network coding scenario. In this paper, the scenario with two independent Poisson input flows and one output flow is considered. The asynchronous NC-based strategy is that a new arrival evicts a head packet holding in its queue when waiting for another packet from the other flow to encode. The pdf for the output flow which contains both coded and uncoded packets is derived. Besides, the statistic characteristics of this strategy are analyzed. These results are verified by numerical simulations.

An advanced OBP-based payload operating in an asynchronous network for future data relay satellites utilising CCSDS-standard data structures

NASA Technical Reports Server (NTRS)

Grant, M.; Vernucci, A.

1991-01-01

A possible Data Relay Satellite System (DRSS) topology and network architecture is introduced. An asynchronous network concept, whereby each link (Inter-orbit, Inter-satellite, Feeder) is allowed to operate on its own clock, without causing loss of information, in conjunction with packet data structures, such as those specified by the CCSDS for advanced orbiting systems is discussed. A matching OBP payload architecture is described, highlighting the advantages provided by the OBP-based concept and then giving some indications on the OBP mass/power requirements.

Excited-state vibronic wave-packet dynamics in H2 probed by XUV transient four-wave mixing

NASA Astrophysics Data System (ADS)

Cao, Wei; Warrick, Erika R.; Fidler, Ashley; Leone, Stephen R.; Neumark, Daniel M.

2018-02-01

The complex behavior of a molecular wave packet initiated by an extreme ultraviolet (XUV) pulse is investigated with noncollinear wave mixing spectroscopy. A broadband XUV pulse spanning 12-16 eV launches a wave packet in H2 comprising a coherent superposition of multiple electronic and vibrational levels. The molecular wave packet evolves freely until a delayed few-cycle optical laser pulse arrives to induce nonlinear signals in the XUV via four-wave mixing (FWM). The angularly resolved FWM signals encode rich energy exchange processes between the optical laser field and the XUV-excited molecule. The noncollinear geometry enables spatial separation of ladder and V- or Λ-type transitions induced by the optical field. Ladder transitions, in which the energy exchange with the optical field is around 3 eV, appear off axis from the incident XUV beam. Each vibrationally revolved FWM line probes a different part of the wave packet in energy, serving as a promising tool for energetic tomography of molecular wave packets. V- or Λ-type transitions, in which the energy exchange is well under 1 eV, result in on-axis nonlinear signals. The first-order versus third-order interference of the on-axis signal serves as a mapping tool of the energy flow pathways. Intra- and interelectronic potential energy curve transitions are decisively identified. The current study opens possibilities for accessing complete dynamic information in XUV-excited complex systems.

Evaluation of Swift Start TCP in Long-Delay Environment

NASA Technical Reports Server (NTRS)

Lawas-Grodek, Frances J.; Tran, Diepchi T.

2004-01-01

This report presents the test results of the Swift Start algorithm in single-flow and multiple-flow testbeds under the effects of high propagation delays, various slow bottlenecks, and small queue sizes. Although this algorithm estimates capacity and implements packet pacing, the findings were that in a heavily congested link, the Swift Start algorithm will not be applicable. The reason is that the bottleneck estimation is falsely influenced by timeouts induced by retransmissions and the expiration of delayed acknowledgment (ACK) timers, thus causing the modified Swift Start code to fall back to regular transmission control protocol (TCP).

All-optical clocked delay flip-flop using a single terahertz optical asymmetric demultiplexer-based switch: a theoretical study.

PubMed

Chattopadhyay, Tanay

2010-10-01

A flip-flop (FF) is a kind of latch and the simplest form of memory device, which stores various values either temporarily or permanently. Optical FF memories form a fundamental building block for all-optical packet switches in next-generation communication networks. An all-optical clocked delay FF using a single terahertz optical asymmetric demultiplexer-based interferometric switch is proposed and described. Numerical simulation results are also reported.

A novel coherent optical en/decoder for optical label processing of OCDM-based optical packets switching networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun

2007-11-01

A coherent optical en/decoder based on photonic crystal (PhC) for optical code-division-multiple (OCDM)-based optical label (OCDM-OL) optical packets switching (OPS) networks is proposed in this paper. In this scheme, the optical pulse phase and time delay can be flexibly controlled by the photonic crystal phase shifter and delayer using the appropriate design of fabrication. In this design, the combination calculation of the impurity and normal period layers is applied, according to the PhC transmission matrix theorem. The design and theoretical analysis of the PhC-based optical coherent en/decoder is mainly focused. In addition, the performances of the PhC-based optical en/decoders are analyzed in detail. The reflection, the transmission, delay characteristic and the optical spectrum of pulse en/decoded are studied for the waves tuned in the photonic band-gap by the numerical calculation, taking into account 1-Dimension (1D) PhC. Theoretical analysis and numerical results show that optical pulse is achieved to properly phase modulation and time delay by the proposed scheme, optical label based on OCDM is rewrote successfully by new code for OCDM-based OPS (OCDM-OPS), and an over 8.5 dB ration of auto- and cross-correlation is gained, which demonstrates the applicability of true pulse phase modulation in a number of applications.

A Reliable Data Transmission Model for IEEE 802.15.4e Enabled Wireless Sensor Network under WiFi Interference.

PubMed

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-06-07

The IEEE 802.15.4e standard proposes Medium Access Control (MAC) to support collision-free wireless channel access mechanisms for industrial, commercial and healthcare applications. However, unnecessary wastage of energy and bandwidth consumption occur due to inefficient backoff management and collisions. In this paper, a new channel access mechanism is designed for the buffer constraint sensor devices to reduce the packet drop rate, energy consumption and collisions. In order to avoid collision due to the hidden terminal problem, a new frame structure is designed for the data transmission. A new superframe structure is proposed to mitigate the problems due to WiFi and ZigBee interference. A modified superframe structure with a new retransmission opportunity for failure devices is proposed to reduce the collisions and retransmission delay with high reliability. Performance evaluation and validation of our scheme indicate that the packet drop rate, throughput, reliability, energy consumption and average delay of the nodes can be improved significantly.

Jump state estimation with multiple sensors with packet dropping and delaying channels

NASA Astrophysics Data System (ADS)

Dolz, Daniel; Peñarrocha, Ignacio; Sanchis, Roberto

2016-03-01

This work addresses the design of a state observer for systems whose outputs are measured through a communication network. The measurements from each sensor node are assumed to arrive randomly, scarcely and with a time-varying delay. The proposed model of the plant and the network measurement scenarios cover the cases of multiple sensors, out-of-sequence measurements, buffered measurements on a single packet and multirate sensor measurements. A jump observer is proposed that selects a different gain depending on the number of periods elapsed between successfully received measurements and on the available data. A finite set of gains is pre-calculated offline with a tractable optimisation problem, where the complexity of the observer implementation is a design parameter. The computational cost of the observer implementation is much lower than in the Kalman filter, whilst the performance is similar. Several examples illustrate the observer design for different measurement scenarios and observer complexity and show the achievable performance.

LPTA: Location Predictive and Time Adaptive Data Gathering Scheme with Mobile Sink for Wireless Sensor Networks

PubMed Central

Rodrigues, Joel J. P. C.

2014-01-01

This paper exploits sink mobility to prolong the lifetime of sensor networks while maintaining the data transmission delay relatively low. A location predictive and time adaptive data gathering scheme is proposed. In this paper, we introduce a sink location prediction principle based on loose time synchronization and deduce the time-location formulas of the mobile sink. According to local clocks and the time-location formulas of the mobile sink, nodes in the network are able to calculate the current location of the mobile sink accurately and route data packets timely toward the mobile sink by multihop relay. Considering that data packets generating from different areas may be different greatly, an adaptive dwelling time adjustment method is also proposed to balance energy consumption among nodes in the network. Simulation results show that our data gathering scheme enables data routing with less data transmission time delay and balance energy consumption among nodes. PMID:25302327

VLSI Implementation of a 2.8 Gevent/s Packet-Based AER Interface with Routing and Event Sorting Functionality

PubMed Central

Scholze, Stefan; Schiefer, Stefan; Partzsch, Johannes; Hartmann, Stephan; Mayr, Christian Georg; Höppner, Sebastian; Eisenreich, Holger; Henker, Stephan; Vogginger, Bernhard; Schüffny, Rene

2011-01-01

State-of-the-art large-scale neuromorphic systems require sophisticated spike event communication between units of the neural network. We present a high-speed communication infrastructure for a waferscale neuromorphic system, based on application-specific neuromorphic communication ICs in an field programmable gate arrays (FPGA)-maintained environment. The ICs implement configurable axonal delays, as required for certain types of dynamic processing or for emulating spike-based learning among distant cortical areas. Measurements are presented which show the efficacy of these delays in influencing behavior of neuromorphic benchmarks. The specialized, dedicated address-event-representation communication in most current systems requires separate, low-bandwidth configuration channels. In contrast, the configuration of the waferscale neuromorphic system is also handled by the digital packet-based pulse channel, which transmits configuration data at the full bandwidth otherwise used for pulse transmission. The overall so-called pulse communication subgroup (ICs and FPGA) delivers a factor 25–50 more event transmission rate than other current neuromorphic communication infrastructures. PMID:22016720

Performance analysis of local area networks

NASA Technical Reports Server (NTRS)

Alkhatib, Hasan S.; Hall, Mary Grace

1990-01-01

A simulation of the TCP/IP protocol running on a CSMA/CD data link layer was described. The simulation was implemented using the simula language, and object oriented discrete event language. It allows the user to set the number of stations at run time, as well as some station parameters. Those parameters are the interrupt time and the dma transfer rate for each station. In addition, the user may configure the network at run time with stations of differing characteristics. Two types are available, and the parameters of both types are read from input files at run time. The parameters include the dma transfer rate, interrupt time, data rate, average message size, maximum frame size and the average interarrival time of messages per station. The information collected for the network is the throughput and the mean delay per packet. For each station, the number of messages attempted as well as the number of messages successfully transmitted is collected in addition to the throughput and mean packet delay per station.

Anomalous time delays and quantum weak measurements in optical micro-resonators

PubMed Central

Asano, M.; Bliokh, K. Y.; Bliokh, Y. P.; Kofman, A. G.; Ikuta, R.; Yamamoto, T.; Kivshar, Y. S.; Yang, L.; Imoto, N.; Özdemir, Ş.K.; Nori, F.

2016-01-01

Quantum weak measurements, wavepacket shifts and optical vortices are universal wave phenomena, which originate from fine interference of multiple plane waves. These effects have attracted considerable attention in both classical and quantum wave systems. Here we report on a phenomenon that brings together all the above topics in a simple one-dimensional scalar wave system. We consider inelastic scattering of Gaussian wave packets with parameters close to a zero of the complex scattering coefficient. We demonstrate that the scattered wave packets experience anomalously large time and frequency shifts in such near-zero scattering. These shifts reveal close analogies with the Goos–Hänchen beam shifts and quantum weak measurements of the momentum in a vortex wavefunction. We verify our general theory by an optical experiment using the near-zero transmission (near-critical coupling) of Gaussian pulses propagating through a nano-fibre with a side-coupled toroidal micro-resonator. Measurements demonstrate the amplification of the time delays from the typical inverse-resonator-linewidth scale to the pulse-duration scale. PMID:27841269

A Reliable Data Transmission Model for IEEE 802.15.4e Enabled Wireless Sensor Network under WiFi Interference

PubMed Central

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-01-01

The IEEE 802.15.4e standard proposes Medium Access Control (MAC) to support collision-free wireless channel access mechanisms for industrial, commercial and healthcare applications. However, unnecessary wastage of energy and bandwidth consumption occur due to inefficient backoff management and collisions. In this paper, a new channel access mechanism is designed for the buffer constraint sensor devices to reduce the packet drop rate, energy consumption and collisions. In order to avoid collision due to the hidden terminal problem, a new frame structure is designed for the data transmission. A new superframe structure is proposed to mitigate the problems due to WiFi and ZigBee interference. A modified superframe structure with a new retransmission opportunity for failure devices is proposed to reduce the collisions and retransmission delay with high reliability. Performance evaluation and validation of our scheme indicate that the packet drop rate, throughput, reliability, energy consumption and average delay of the nodes can be improved significantly. PMID:28590434

Mobility based multicast routing in wireless mesh networks

NASA Astrophysics Data System (ADS)

Jain, Sanjeev; Tripathi, Vijay S.; Tiwari, Sudarshan

2013-01-01

There exist two fundamental approaches to multicast routing namely minimum cost trees and shortest path trees. The (MCT's) minimum cost tree is one which connects receiver and sources by providing a minimum number of transmissions (MNTs) the MNTs approach is generally used for energy constraint sensor and mobile ad hoc networks. In this paper we have considered node mobility and try to find out simulation based comparison of the (SPT's) shortest path tree, (MST's) minimum steiner trees and minimum number of transmission trees in wireless mesh networks by using the performance metrics like as an end to end delay, average jitter, throughput and packet delivery ratio, average unicast packet delivery ratio, etc. We have also evaluated multicast performance in the small and large wireless mesh networks. In case of multicast performance in the small networks we have found that when the traffic load is moderate or high the SPTs outperform the MSTs and MNTs in all cases. The SPTs have lowest end to end delay and average jitter in almost all cases. In case of multicast performance in the large network we have seen that the MSTs provide minimum total edge cost and minimum number of transmissions. We have also found that the one drawback of SPTs, when the group size is large and rate of multicast sending is high SPTs causes more packet losses to other flows as MCTs.

A Hybrid Path-Oriented Code Assignment CDMA-Based MAC Protocol for Underwater Acoustic Sensor Networks

PubMed Central

Chen, Huifang; Fan, Guangyu; Xie, Lei; Cui, Jun-Hong

2013-01-01

Due to the characteristics of underwater acoustic channel, media access control (MAC) protocols designed for underwater acoustic sensor networks (UWASNs) are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA) CDMA MAC (POCA-CDMA-MAC), is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA) or receiver-oriented code assignment (ROCA). Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols. PMID:24193100

A hybrid path-oriented code assignment CDMA-based MAC protocol for underwater acoustic sensor networks.

PubMed

Chen, Huifang; Fan, Guangyu; Xie, Lei; Cui, Jun-Hong

2013-11-04

Due to the characteristics of underwater acoustic channel, media access control (MAC) protocols designed for underwater acoustic sensor networks (UWASNs) are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA) CDMA MAC (POCA-CDMA-MAC), is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA) or receiver-oriented code assignment (ROCA). Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols.

Timing and context of dolphin clicks during and after mine simulator detection and marking in the open ocean

PubMed Central

Dibble, Dianna S.; Kennemer, Jaime A.

2018-01-01

ABSTRACT Two dolphins carrying cameras swam in the ocean as they searched for and marked mine simulators – buried, proud or moored. As the animals swam ahead of a boat they searched the ocean. Cameras on their harness recorded continuous sound and video. Once a target was detected, the dolphins received a marker to take to the simulator's location. During search and detection, dolphins made almost continuous trains of varying interval clicks. During the marking phase, shorter click trains were interrupted by periods of silence. As the dolphins marked simulators, they often produced victory squeals – pulse bursts that vary in duration, peak frequency and amplitude. Victory squeals were produced on 72% of marks. Sometimes after marking, or at other times during their long swims, the dolphins produced click packets. Packets typically consisted of two to 10 clicks with inter-click intervals of 7-117 ms followed by a silence of 223-983 ms. Click packets appeared unrelated with searching or marking. We suggest that the packets were used to improve signal to noise ratios for locating a boat or other distant object. Victory squeals produced when marking the targets suggest to us that the dolphins know when they have succeeded in this multipart task. PMID:29463515

Timing and context of dolphin clicks during and after mine simulator detection and marking in the open ocean.

PubMed

Ridgway, Sam H; Dibble, Dianna S; Kennemer, Jaime A

2018-02-20

Two dolphins carrying cameras swam in the ocean as they searched for and marked mine simulators - buried, proud or moored. As the animals swam ahead of a boat they searched the ocean. Cameras on their harness recorded continuous sound and video. Once a target was detected, the dolphins received a marker to take to the simulator's location. During search and detection, dolphins made almost continuous trains of varying interval clicks. During the marking phase, shorter click trains were interrupted by periods of silence. As the dolphins marked simulators, they often produced victory squeals - pulse bursts that vary in duration, peak frequency and amplitude. Victory squeals were produced on 72% of marks. Sometimes after marking, or at other times during their long swims, the dolphins produced click packets. Packets typically consisted of two to 10 clicks with inter-click intervals of 7-117 ms followed by a silence of 223-983 ms. Click packets appeared unrelated with searching or marking. We suggest that the packets were used to improve signal to noise ratios for locating a boat or other distant object. Victory squeals produced when marking the targets suggest to us that the dolphins know when they have succeeded in this multipart task. © 2018. Published by The Company of Biologists Ltd.

Bandwidth characteristics of multimedia data traffic on a local area network

NASA Technical Reports Server (NTRS)

Chuang, Shery L.; Doubek, Sharon; Haines, Richard F.

1993-01-01

Limited spacecraft communication links call for users to investigate the potential use of video compression and multimedia technologies to optimize bandwidth allocations. The objective was to determine the transmission characteristics of multimedia data - motion video, text or bitmap graphics, and files transmitted independently and simultaneously over an ethernet local area network. Commercial desktop video teleconferencing hardware and software and Intel's proprietary Digital Video Interactive (DVI) video compression algorithm were used, and typical task scenarios were selected. The transmission time, packet size, number of packets, and network utilization of the data were recorded. Each data type - compressed motion video, text and/or bitmapped graphics, and a compressed image file - was first transmitted independently and its characteristics recorded. The results showed that an average bandwidth of 7.4 kilobits per second (kbps) was used to transmit graphics; an average bandwidth of 86.8 kbps was used to transmit an 18.9-kilobyte (kB) image file; a bandwidth of 728.9 kbps was used to transmit compressed motion video at 15 frames per second (fps); and a bandwidth of 75.9 kbps was used to transmit compressed motion video at 1.5 fps. Average packet sizes were 933 bytes for graphics, 498.5 bytes for the image file, 345.8 bytes for motion video at 15 fps, and 341.9 bytes for motion video at 1.5 fps. Simultaneous transmission of multimedia data types was also characterized. The multimedia packets used transmission bandwidths of 341.4 kbps and 105.8kbps. Bandwidth utilization varied according to the frame rate (frames per second) setting for the transmission of motion video. Packet size did not vary significantly between the data types. When these characteristics are applied to Space Station Freedom (SSF), the packet sizes fall within the maximum specified by the Consultative Committee for Space Data Systems (CCSDS). The uplink of imagery to SSF may be performed at minimal frame rates and/or within seconds of delay, depending on the user's allocated bandwidth. Further research to identify the acceptable delay interval and its impact on human performance is required. Additional studies in network performance using various video compression algorithms and integrated multimedia techniques are needed to determine the optimal design approach for utilizing SSF's data communications system.

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets

PubMed Central

Anh, Khuong Quoc; Choo, Hyunseung

2017-01-01

Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN) registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6) is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6) protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP) problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN) to an MN. Since the problem affects the quality of service (QoS) of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG) can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently. PMID:28968450

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets.

PubMed

Kang, Byungseok; Anh, Khuong Quoc; Choo, Hyunseung

2017-01-01

Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN) registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6) is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6) protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP) problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN) to an MN. Since the problem affects the quality of service (QoS) of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG) can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.

Multicasting in Wireless Communications (Ad-Hoc Networks): Comparison against a Tree-Based Approach

NASA Astrophysics Data System (ADS)

Rizos, G. E.; Vasiliadis, D. C.

2007-12-01

We examine on-demand multicasting in ad hoc networks. The Core Assisted Mesh Protocol (CAMP) is a well-known protocol for multicast routing in ad-hoc networks, generalizing the notion of core-based trees employed for internet multicasting into multicast meshes that have much richer connectivity than trees. On the other hand, wireless tree-based multicast routing protocols use much simpler structures for determining route paths, using only parent-child relationships. In this work, we compare the performance of the CAMP protocol against the performance of wireless tree-based multicast routing protocols, in terms of two important factors, namely packet delay and ratio of dropped packets.

Double-pulse femtosecond laser peening of aluminum alloy AA5038: Effect of inter-pulse delay on transient optical plume emission and final surface micro-hardness

NASA Astrophysics Data System (ADS)

Ageev, E. I.; Bychenkov, V. Yu.; Ionin, A. A.; Kudryashov, S. I.; Petrov, A. A.; Samokhvalov, A. A.; Veiko, V. P.

2016-11-01

Double-pulse ablative femtosecond laser peening of the AA5038 aluminum alloy surface in the phase explosion regime results in its enhanced microhardness, which monotonously decreases till the initial value versus inter-pulse delay, increasing on a sub-nanosecond timescale. Optical emission spectroscopy of the double-pulse ablative plume reveals the same trend in the yield of the corresponding atomic and ion emission versus inter-pulse delay, enlightening the interaction of the second femtosecond laser pump pulse with the surface and the resulting plume.

Delay time dependence of wave packet motion and population transfer of four-level K2 molecule in pump–pump–probe pulses

NASA Astrophysics Data System (ADS)

Chang, Zhiqiang; Li, Changming; Guo, Wei; Yao, Hongbin

2018-05-01

Not Available Project supported by the National Natural Science Foundation of China (Grant Nos. 11704178 and 11764041) and the Scientific Research Fund of Hunan Provincial Education Department, China (Grant No. 15B204).

Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network

PubMed Central

Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A.; Othman, Mohamed

2018-01-01

Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26% of HH-VBF, 15% of VAPR, and 25% of H2DAB. Moreover, the average end-to-end delay has been reduced by 70% of VBF, 69% of HH-VBF, 46% of VAPR, and 73% of H2DAB. Furthermore, average hope-count has been improved by 57%, 53%, 16% and 31% as compared to VBF, HHVBF, VAPR, and H2DAB, respectively. Also, propagation delay has been reduced by 34%, 30%, 15% and 23% as compared to VBF, HHVBF, VAPR, and H2DAB, respectively. PMID:29874237

Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network.

PubMed

Rahman, Ziaur; Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A; Othman, Mohamed

2018-01-01

Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26% of HH-VBF, 15% of VAPR, and 25% of H2DAB. Moreover, the average end-to-end delay has been reduced by 70% of VBF, 69% of HH-VBF, 46% of VAPR, and 73% of H2DAB. Furthermore, average hope-count has been improved by 57%, 53%, 16% and 31% as compared to VBF, HHVBF, VAPR, and H2DAB, respectively. Also, propagation delay has been reduced by 34%, 30%, 15% and 23% as compared to VBF, HHVBF, VAPR, and H2DAB, respectively.

Cross Layered Multi-Meshed Tree Scheme for Cognitive Networks

DTIC Science & Technology

2011-06-01

Meshed Tree Routing protocol wireless ad hoc networks ,” Second IEEE International Workshop on Enabling Technologies and Standards for Wireless Mesh ...and Sensor Networks , 2004 43. Chen G.; Stojmenovic I., “Clustering and routing in mobile wireless networks ,” Technical Report TR-99-05, SITE, June...Cross-layer optimization, intra-cluster routing , packet forwarding, inter-cluster routing , mesh network communications,

A Novel Cross-Layer Routing Protocol Based on Network Coding for Underwater Sensor Networks

PubMed Central

Wang, Hao; Wang, Shilian; Bu, Renfei; Zhang, Eryang

2017-01-01

Underwater wireless sensor networks (UWSNs) have attracted increasing attention in recent years because of their numerous applications in ocean monitoring, resource discovery and tactical surveillance. However, the design of reliable and efficient transmission and routing protocols is a challenge due to the low acoustic propagation speed and complex channel environment in UWSNs. In this paper, we propose a novel cross-layer routing protocol based on network coding (NCRP) for UWSNs, which utilizes network coding and cross-layer design to greedily forward data packets to sink nodes efficiently. The proposed NCRP takes full advantages of multicast transmission and decode packets jointly with encoded packets received from multiple potential nodes in the entire network. The transmission power is optimized in our design to extend the life cycle of the network. Moreover, we design a real-time routing maintenance protocol to update the route when detecting inefficient relay nodes. Substantial simulations in underwater environment by Network Simulator 3 (NS-3) show that NCRP significantly improves the network performance in terms of energy consumption, end-to-end delay and packet delivery ratio compared with other routing protocols for UWSNs. PMID:28786915

Two-Level Scheduling for Video Transmission over Downlink OFDMA Networks

PubMed Central

Tham, Mau-Luen

2016-01-01

This paper presents a two-level scheduling scheme for video transmission over downlink orthogonal frequency-division multiple access (OFDMA) networks. It aims to maximize the aggregate quality of the video users subject to the playback delay and resource constraints, by exploiting the multiuser diversity and the video characteristics. The upper level schedules the transmission of video packets among multiple users based on an overall target bit-error-rate (BER), the importance level of packet and resource consumption efficiency factor. Instead, the lower level renders unequal error protection (UEP) in terms of target BER among the scheduled packets by solving a weighted sum distortion minimization problem, where each user weight reflects the total importance level of the packets that has been scheduled for that user. Frequency-selective power is then water-filled over all the assigned subcarriers in order to leverage the potential channel coding gain. Realistic simulation results demonstrate that the proposed scheme significantly outperforms the state-of-the-art scheduling scheme by up to 6.8 dB in terms of peak-signal-to-noise-ratio (PSNR). Further test evaluates the suitability of equal power allocation which is the common assumption in the literature. PMID:26906398

Technical support for digital systems technology development. Task order 1: ISP contention analysis and control

NASA Technical Reports Server (NTRS)

Stehle, Roy H.; Ogier, Richard G.

1993-01-01

Alternatives for realizing a packet-based network switch for use on a frequency division multiple access/time division multiplexed (FDMA/TDM) geostationary communication satellite were investigated. Each of the eight downlink beams supports eight directed dwells. The design needed to accommodate multicast packets with very low probability of loss due to contention. Three switch architectures were designed and analyzed. An output-queued, shared bus system yielded a functionally simple system, utilizing a first-in, first-out (FIFO) memory per downlink dwell, but at the expense of a large total memory requirement. A shared memory architecture offered the most efficiency in memory requirements, requiring about half the memory of the shared bus design. The processing requirement for the shared-memory system adds system complexity that may offset the benefits of the smaller memory. An alternative design using a shared memory buffer per downlink beam decreases circuit complexity through a distributed design, and requires at most 1000 packets of memory more than the completely shared memory design. Modifications to the basic packet switch designs were proposed to accommodate circuit-switched traffic, which must be served on a periodic basis with minimal delay. Methods for dynamically controlling the downlink dwell lengths were developed and analyzed. These methods adapt quickly to changing traffic demands, and do not add significant complexity or cost to the satellite and ground station designs. Methods for reducing the memory requirement by not requiring the satellite to store full packets were also proposed and analyzed. In addition, optimal packet and dwell lengths were computed as functions of memory size for the three switch architectures.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by employing bandwidth shells at areas of overutilization

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-04-27

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a final destination. The default routing strategy is altered responsive to detection of overutilization of a particular path of one or more links, and at least some traffic is re-routed by distributing the traffic among multiple paths (which may include the default path). An alternative path may require a greater number of link traversals to reach the destination node.

An Energy Scaled and Expanded Vector-Based Forwarding Scheme for Industrial Underwater Acoustic Sensor Networks with Sink Mobility.

PubMed

Wadud, Zahid; Hussain, Sajjad; Javaid, Nadeem; Bouk, Safdar Hussain; Alrajeh, Nabil; Alabed, Mohamad Souheil; Guizani, Nadra

2017-09-30

Industrial Underwater Acoustic Sensor Networks (IUASNs) come with intrinsic challenges like long propagation delay, small bandwidth, large energy consumption, three-dimensional deployment, and high deployment and battery replacement cost. Any routing strategy proposed for IUASN must take into account these constraints. The vector based forwarding schemes in literature forward data packets to sink using holding time and location information of the sender, forwarder, and sink nodes. Holding time suppresses data broadcasts; however, it fails to keep energy and delay fairness in the network. To achieve this, we propose an Energy Scaled and Expanded Vector-Based Forwarding (ESEVBF) scheme. ESEVBF uses the residual energy of the node to scale and vector pipeline distance ratio to expand the holding time. Resulting scaled and expanded holding time of all forwarding nodes has a significant difference to avoid multiple forwarding, which reduces energy consumption and energy balancing in the network. If a node has a minimum holding time among its neighbors, it shrinks the holding time and quickly forwards the data packets upstream. The performance of ESEVBF is analyzed through in network scenario with and without node mobility to ensure its effectiveness. Simulation results show that ESEVBF has low energy consumption, reduces forwarded data copies, and less end-to-end delay.

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.

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks

PubMed Central

Mahjoub, Reem K.; Elleithy, Khaled

2017-01-01

The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation. PMID:28420102

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks.

PubMed

Mahjoub, Reem K; Elleithy, Khaled

2017-04-14

The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation.

A preliminary architecture for building communication software from traffic captures

NASA Astrophysics Data System (ADS)

Acosta, Jaime C.; Estrada, Pedro

2017-05-01

Security analysts are tasked with identifying and mitigating network service vulnerabilities. A common problem associated with in-depth testing of network protocols is the availability of software that communicates across disparate protocols. Many times, the software required to communicate with these services is not publicly available. Developing this software is a time-consuming undertaking that requires expertise and understanding of the protocol specification. The work described in this paper aims at developing a software package that is capable of automatically creating communication clients by using packet capture (pcap) and TShark dissectors. Currently, our focus is on simple protocols with fixed fields. The methodologies developed as part of this work will extend to other complex protocols such as the Gateway Load Balancing Protocol (GLBP), Port Aggregation Protocol (PAgP), and Open Shortest Path First (OSPF). Thus far, we have architected a modular pipeline for an automatic traffic-based software generator. We start the transformation of captured network traffic by employing TShark to convert packets into a Packet Details Markup Language (PDML) file. The PDML file contains a parsed, textual, representation of the packet data. Then, we extract field data, types, along with inter and intra-packet dependencies. This information is then utilized to construct an XML file that encompasses the protocol state machine and field vocabulary. Finally, this XML is converted into executable code. Using our methodology, and as a starting point, we have succeeded in automatically generating software that communicates with other hosts using an automatically generated Internet Control Message Protocol (ICMP) client program.

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

Ramsey method for Auger-electron interference induced by an attosecond twin pulse

NASA Astrophysics Data System (ADS)

Buth, Christian; Schafer, Kenneth J.

2015-02-01

We examine the archetype of an interference experiment for Auger electrons: two electron wave packets are launched by inner-shell ionizing a krypton atom using two attosecond light pulses with a variable time delay. This setting is an attosecond realization of the Ramsey method of separated oscillatory fields. Interference of the two ejected Auger-electron wave packets is predicted, indicating that the coherence between the two pulses is passed to the Auger electrons. For the detection of the interference pattern an accurate coincidence measurement of photo- and Auger electrons is necessary. The method allows one to control inner-shell electron dynamics on an attosecond timescale and represents a sensitive indicator for decoherence.

Adaptive Reliable Routing Protocol Using Combined Link Stability Estimation for Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Vadivel, R.; Bhaskaran, V. Murali

2010-10-01

The main reason for packet loss in ad hoc networks is the link failure or node failure. In order to increase the path stability, it is essential to distinguish and moderate the failures. By knowing individual link stability along a path, path stability can be identified. In this paper, we develop an adaptive reliable routing protocol using combined link stability estimation for mobile ad hoc networks. The main objective of this protocol is to determine a Quality of Service (QoS) path along with prolonging the network life time and to reduce the packet loss. We calculate a combined metric for a path based on the parameters Link Expiration Time, Node Remaining Energy and Node Velocity and received signal strength to predict the link stability or lifetime. Then, a bypass route is established to retransmit the lost data, when a link failure occurs. By simulation results, we show that the proposed reliable routing protocol achieves high delivery ratio with reduced delay and packet drop.

Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks.

PubMed

Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il

2015-06-05

Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.

A multimetric, map-aware routing protocol for VANETs in urban areas.

PubMed

Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Aguilar Igartua, Mónica; Rebollo-Monedero, David; de la Cruz Llopis, Luis J; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

2014-01-28

In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery.

Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks

PubMed Central

Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il

2015-01-01

Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols. PMID:26057037

Quality of service routing in wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Sane, Sachin J.; Patcha, Animesh; Mishra, Amitabh

2003-08-01

An efficient routing protocol is essential to guarantee application level quality of service running on wireless ad hoc networks. In this paper we propose a novel routing algorithm that computes a path between a source and a destination by considering several important constraints such as path-life, availability of sufficient energy as well as buffer space in each of the nodes on the path between the source and destination. The algorithm chooses the best path from among the multiples paths that it computes between two endpoints. We consider the use of control packets that run at a priority higher than the data packets in determining the multiple paths. The paper also examines the impact of different schedulers such as weighted fair queuing, and weighted random early detection among others in preserving the QoS level guarantees. Our extensive simulation results indicate that the algorithm improves the overall lifetime of a network, reduces the number of dropped packets, and decreases the end-to-end delay for real-time voice application.

Impact of MAC Delay on AUV Localization: Underwater Localization Based on Hyperbolic Frequency Modulation Signal

PubMed Central

2018-01-01

Medium Access Control (MAC) delay which occurs between the anchor node’s transmissions is one of the error sources in underwater localization. In particular, in AUV localization, the MAC delay significantly degrades the ranging accuracy. The Cramer-Rao Low Bound (CRLB) definition theoretically proves that the MAC delay significantly degrades the localization performance. This paper proposes underwater localization combined with multiple access technology to decouple the localization performance from the MAC delay. Towards this goal, we adopt hyperbolic frequency modulation (HFM) signal that provides multiplexing based on its good property, high-temporal correlation. Owing to the multiplexing ability of the HFM signal, the anchor nodes can transmit packets without MAC delay, i.e., simultaneous transmission is possible. In addition, the simulation results show that the simultaneous transmission is not an optional communication scheme, but essential for the localization of mobile object in underwater. PMID:29373518

Impact of MAC Delay on AUV Localization: Underwater Localization Based on Hyperbolic Frequency Modulation Signal.

PubMed

Kim, Sungryul; Yoo, Younghwan

2018-01-26

Medium Access Control (MAC) delay which occurs between the anchor node's transmissions is one of the error sources in underwater localization. In particular, in AUV localization, the MAC delay significantly degrades the ranging accuracy. The Cramer-Rao Low Bound (CRLB) definition theoretically proves that the MAC delay significantly degrades the localization performance. This paper proposes underwater localization combined with multiple access technology to decouple the localization performance from the MAC delay. Towards this goal, we adopt hyperbolic frequency modulation (HFM) signal that provides multiplexing based on its good property, high-temporal correlation. Owing to the multiplexing ability of the HFM signal, the anchor nodes can transmit packets without MAC delay, i.e., simultaneous transmission is possible. In addition, the simulation results show that the simultaneous transmission is not an optional communication scheme, but essential for the localization of mobile object in underwater.

Reducing the Handover Delay in FMIPv6 Using Proactive Care-of Address Scheme

NASA Astrophysics Data System (ADS)

Li, Yong; Jin, Depeng; Su, Li; Zeng, Lieguang

To deal with the increasing number of mobile devices accessing the Internet and the increasing demands of mobility management, IETF has proposed Mobile IPv6 and its fast handover protocol FMIPv6. In FMIPv6, the possibility of Care-of Address (CoA) collision and the time for Return Routability (RR) procedure result in long handover delay, which makes it unsuitable for real-time applications. In this paper, we propose an improved handover scheme for FMIPv6, which reduces the handover delay by using proactive CoA acquisition, configuration and test method. In our proposal, collision-free CoA is proactively prepared, and the time for RR procedure does not contribute to the handover delay. Furthermore, we analyze our proposal's benefits and overhead tradeoff. The numerical results demonstrate that it outperforms the current schemes, such as FMIPv6 and enhanced FMIPv6, on the aspect of handover delay and packet transmission delay.

An Efficient Next Hop Selection Algorithm for Multi-Hop Body Area Networks

PubMed Central

Ayatollahitafti, Vahid; Ngadi, Md Asri; Mohamad Sharif, Johan bin; Abdullahi, Mohammed

2016-01-01

Body Area Networks (BANs) consist of various sensors which gather patient’s vital signs and deliver them to doctors. One of the most significant challenges faced, is the design of an energy-efficient next hop selection algorithm to satisfy Quality of Service (QoS) requirements for different healthcare applications. In this paper, a novel efficient next hop selection algorithm is proposed in multi-hop BANs. This algorithm uses the minimum hop count and a link cost function jointly in each node to choose the best next hop node. The link cost function includes the residual energy, free buffer size, and the link reliability of the neighboring nodes, which is used to balance the energy consumption and to satisfy QoS requirements in terms of end to end delay and reliability. Extensive simulation experiments were performed to evaluate the efficiency of the proposed algorithm using the NS-2 simulator. Simulation results show that our proposed algorithm provides significant improvement in terms of energy consumption, number of packets forwarded, end to end delay and packet delivery ratio compared to the existing routing protocol. PMID:26771586

SDN based millimetre wave radio over fiber (RoF) network

NASA Astrophysics Data System (ADS)

Amate, Ahmed; Milosavljevic, Milos; Kourtessis, Pandelis; Robinson, Matthew; Senior, John M.

2015-01-01

This paper introduces software-defined, millimeter Wave (mm-Wave) networks with Radio over Fiber (RoF) for the delivery of gigabit connectivity required to develop fifth generation (5G) mobile. This network will enable an effective open access system allowing providers to manage and lease the infrastructure to service providers through unbundling new business models. Exploiting the inherited benefits of RoF, complete base station functionalities are centralized at the edges of the metro and aggregation network, leaving remote radio heads (RRHs) with only tunable filtering and amplification. A Software Defined Network (SDN) Central Controller (SCC) is responsible for managing the resource across several mm-Wave Radio Access Networks (RANs) providing a global view of the several network segments. This ensures flexible resource allocation for reduced overall latency and increased throughput. The SDN based mm-Wave RAN also allows for inter edge node communication. Therefore, certain packets can be routed between different RANs supported by the same edge node, reducing latency. System level simulations of the complete network have shown significant improvement of the overall throughput and SINR for wireless users by providing effective resource allocation and coordination among interfering cells. A new Coordinated Multipoint (CoMP) algorithm exploiting the benefits of the SCC global network view for reduced delay in control message exchange is presented, accounting for a minimum packet delay and limited Channel State Information (CSI) in a Long Term Evolution-Advanced (LTE-A), Cloud RAN (CRAN) configuration. The algorithm does not require detailed CSI feedback from UEs but it rather considers UE location (determined by the eNB) as the required parameter. UE throughput in the target sector is represented using a Cumulative Distributive Function (CDF). The drawn characteristics suggest that there is a significant 60% improvement in UE cell edge throughput following the application, in the coordinating cells, of the new CoMP algorithm. Results also show a further improvement of 36% in cell edge UE throughput when eNBs are centralized in a CRAN backhaul architecture. The SINR distribution of UEs in the cooperating cells has also been evaluated using a box plot. As expected, UEs with CoMP perform better demonstrating an increase of over 2 dB at the median between the transmission scenarios.

Attosecond control of dissociative ionization of O{sub 2} molecules

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

Siu, W.; Kelkensberg, F.; Gademann, G.

We demonstrate that dissociative ionization of O{sub 2} can be controlled by the relative delay between an attosecond pulse train (APT) and a copropagating infrared (IR) field. Our experiments reveal a dependence of both the branching ratios between a range of electronic states and the fragment angular distributions on the extreme ultraviolet (XUV) to IR time delay. The observations go beyond adiabatic propagation of dissociative wave packets on IR-induced quasistatic potential energy curves and are understood in terms of an IR-induced coupling between electronic states in the molecular ion.

Elevated Outcome-Anticipation and Outcome-Evaluation ERPs Associated with a Greater Preference for Larger-But-Delayed Rewards

PubMed Central

Pornpattananangkul, Narun; Nadig, Ajay; Heidinger, Storm; Walden, Keegan; Nusslock, Robin

2017-01-01

Although waiting for a reward reduces or discounts its value, some people have a stronger tendency to wait for larger rewards and forgo smaller-but-immediate rewards. This ability to delay gratification is captured by individual differences in so-called inter-temporal choices in which individuals are asked to choose between larger-but-delayed versus smaller-but-immediate rewards. The current study used event-related potentials (ERPs) to examine whether enhancement in two neuro-cognitive processes, outcome-anticipation and outcome-evaluation, modulate individual variability in inter-temporal responses. After completing a behavioral inter-temporal choice task, 34 participants performed an ERP gambling task. From this ERP task, we separately examined individual differences in outcome-anticipation (Stimulus-Preceding Negativity, SPN), early outcome-evaluation (Feedback-Related Negativity; FRN) and late outcome-evaluation (P3). We observed that both elevated outcome-anticipation (SPN) and late outcome-evaluation (P3) neural processes predicted a stronger preference toward larger-but-delayed rewards. No relationship was observed between inter-temporal responses and early outcome-evaluation (FRN), indicating that the relationship between outcome-evaluation and inter-temporal responses was specific to the late outcome-evaluation processing stream. Moreover, multiple regression analyses indicated that the SPN and P3 independently modulate individual differences in inter-temporal responses, suggesting separate mechanisms underlie the relationship between these two neuro-cognitive processes and inter-temporal responses. Accordingly, we identify two potential neural-cognitive modulators of individual variability in inter-temporal responses. We discuss the mechanisms underlying these modulators in terms of anticipation-related processing (SPN) and a saliency-bias toward gain (compared to loss) outcomes (P3). PMID:28224457

Communication: Quantum molecular dynamics simulation of liquid para-hydrogen by nuclear and electron wave packet approach.

PubMed

Hyeon-Deuk, Kim; Ando, Koji

2014-05-07

Liquid para-hydrogen (p-H2) is a typical quantum liquid which exhibits strong nuclear quantum effects (NQEs) and thus anomalous static and dynamic properties. We propose a real-time simulation method of wave packet (WP) molecular dynamics (MD) based on non-empirical intra- and inter-molecular interactions of non-spherical hydrogen molecules, and apply it to condensed-phase p-H2. The NQEs, such as WP delocalization and zero-point energy, are taken into account without perturbative expansion of prepared model potential functions but with explicit interactions between nuclear and electron WPs. The developed MD simulation for 100 ps with 1200 hydrogen molecules is realized at feasible computational cost, by which basic experimental properties of p-H2 liquid such as radial distribution functions, self-diffusion coefficients, and shear viscosities are all well reproduced.

Nonlinear critical-layer evolution of a forced gravity wave packet

NASA Astrophysics Data System (ADS)

Campbell, L. J.; Maslowe, S. A.

2003-10-01

In this paper, numerical simulations are presented of the nonlinear critical-layer evolution of a forced gravity wave packet in a stratified shear flow. The wave packet, localized in the horizontal direction, is forced at the lower boundary of a two-dimensional domain and propagates vertically towards the critical layer. The wave mean-flow interactions in the critical layer are investigated numerically and contrasted with the results obtained using a spatially periodic monochromatic forcing. With the horizontally localized forcing, the net absorption of the disturbance at the critical layer continues for large time and the onset of the nonlinear breakdown is delayed compared with the case of monochromatic forcing. There is an outward flux of momentum in the horizontal direction so that the horizontal extent of the packet increases with time. The extent to which this happens depends on a number of factors including the amplitude and horizontal length of the forcing. It is also seen that the prolonged absorption of the disturbance stabilizes the solution to the extent that it is always convectively stable; the local Richardson number remains positive well into the nonlinear regime. In this respect, our results for the localized forcing differ from those in the case of monochromatic forcing where significant regions with negative Richardson number appear.

Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

NASA Astrophysics Data System (ADS)

Kozma, William; Lazos, Loukas

We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.

An adaptive density-based routing protocol for flying Ad Hoc networks

NASA Astrophysics Data System (ADS)

Zheng, Xueli; Qi, Qian; Wang, Qingwen; Li, Yongqiang

2017-10-01

An Adaptive Density-based Routing Protocol (ADRP) for Flying Ad Hoc Networks (FANETs) is proposed in this paper. The main objective is to calculate forwarding probability adaptively in order to increase the efficiency of forwarding in FANETs. ADRP dynamically fine-tunes the rebroadcasting probability of a node for routing request packets according to the number of neighbour nodes. Indeed, it is more interesting to privilege the retransmission by nodes with little neighbour nodes. We describe the protocol, implement it and evaluate its performance using NS-2 network simulator. Simulation results reveal that ADRP achieves better performance in terms of the packet delivery fraction, average end-to-end delay, normalized routing load, normalized MAC load and throughput, which is respectively compared with AODV.

An enhanced performance through agent-based secure approach for mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Bisen, Dhananjay; Sharma, Sanjeev

2018-01-01

This paper proposes an agent-based secure enhanced performance approach (AB-SEP) for mobile ad hoc network. In this approach, agent nodes are selected through optimal node reliability as a factor. This factor is calculated on the basis of node performance features such as degree difference, normalised distance value, energy level, mobility and optimal hello interval of node. After selection of agent nodes, a procedure of malicious behaviour detection is performed using fuzzy-based secure architecture (FBSA). To evaluate the performance of the proposed approach, comparative analysis is done with conventional schemes using performance parameters such as packet delivery ratio, throughput, total packet forwarding, network overhead, end-to-end delay and percentage of malicious detection.

A Cellular Neural Networks Based DiffServ Switch for Satellite Communication Systems

NASA Astrophysics Data System (ADS)

Tarchi, Daniele; Fantacci, Romano; Gubellini, Roberto; Pecorella, Tommaso

2003-07-01

Recent developments of Internet services and advanced compression methods has revived interest on IP based multimedia satellite communication systems. However a main problem arising here is to guarantee specific Quality of Service (QoS) constraints in order to have good performance for each traffic class.Among various QoS approach used in Internet, recently the DiffServ technique has became the most promising so- lution, mainly for its simplicity with respect to different alternatives. Moreover, in satellite communication systems, DiffServ policy computational capabilities are placed at the edge points (end-to-end philosophy); this is very important for a network constituted by one satellite link because it allows to reduce the implementation complexity of the satellite on-board equipments.The satellite switch under consideration makes use of the Multiple Input Queuing approach. Packets arrived at a switch input are stored in a shared buffer but they are logically ordered in individual queues, one for each possible output link. According to the DiffServ policy, within a same logical queue, packets are reordered in individual sub-queues according to the priority. A suitable implementation of the DiffServ policy based on a Cellular Neural Network (CNN) is proposed in the paper in order to achieve QoS requirements.The CNNs are a set of linear and nonlinear circuits connected among them that allow parallel and asynchronous computation. CNNs are a class of neural networks similar to Hopfield Neural Networks (HNN), but more flexible and suitable for solving the output contention problem, inherent of switching systems, for VLSI implementation.In this paper a CNN has been designed in order to maximize a cost functional, related to the on-board switch through- put and QoS constraints. The initial state for each neural cell is obtained looking at the presence of at least one packet from a certain input logical queue to a specific output line. The input value for each neural cell is a function of priority and length of each input logical queue. The versatility of neural network make feasible to take the best decision for the packet to be delivered to each output satellite beam, in order to meet specific QoS constraints. Numerical results for CNN approach highlights that Neural network convergence within a time slot is guaranteed, and an optimal, or at least near-optimal, solution in terms of cost function is achieved.The proposed system is based on the IETF (Internet Engineering Task Force) recommendations; this means that traffic entering the switching fabric could be marked as Expedited Forward (EF) or Assured Forward (AF), otherwise handled as Best Effort (BE). Two Assured Forward classes with different emission priority have been implemented, taking into account time spent inside the logical queue and its length. Expedited Forward traffic is typical of services to be delivered with the maximum priority, as streaming or interactive services. The packets, belonging to services that need a certain level of priority with low packet loss, are marked as Assured Forward. Best Effort traffic is related to e-mail or file transfer, or other that have not particular QoS requirements. The CNN used to solve conflict situations act as an arbiter for all the output links. Differently from other Multiple Input Queuing approach, where one arbiter for each output line is present, in proposed approach there exist only one arbiter that make the best decision. The selected rule has been defined in order to give priority to packets, according to opportunely defined functionals characteristic of each traffic class, under the constraint that no more than one packet can be delivered to the same output line. The functionals depend on queue length and time spent inside the queue by front packet.The performance of the proposed DiffServ switch has been derived in terms of delay and jitter; buffer occupancy has been analyzed for different configuration, such as a unique common buffer, one buffer for each input line, one buffer for each input line and each priority class.The obtained results highlight an high flexibility of satellite switch with CNN, taking into account that functional used to calculate priority of each queue could be easily changed, without any complexity gain nor change in CNN structure, in order to consider different traffic characteristic. Numerical results show that proposed algorithm outperform the switches based on Multiple Input Queuing, that use strictly priority methods, in terms of delay and jitter. Different buffer size have been also considered in order to analyze packet loss for CNN switch algorithm, comparing different configuration described above.The good behavior of the proposed DiffServ switch has been verified in the case of traffic with pareto distribution for packet length and a geometrical distribution for packet interarrival time, highlighting good performance in terms of delay and jitter. Numerical results also demonstrate the stability of this method for heavy load traffic; in particular maximum permitted load is higher for higher priority classes.

On the Benefits of Creeping Wave Antennas in Reducing Interference Between Neighboring Wireless Body Area Networks.

PubMed

Tsouri, Gill R; Zambito, Stephanie R; Venkataraman, Jayanti

2017-02-01

We consider the on-body, off-body, and body-to-body channels in wireless body area networks utilizing creeping wave antennas. Experimental setups are used to gather measurements in the 2.4 GHz band with body area networks operating in an office environment. Data packets providing received signal strength indicators are used to assess the performance of the creeping wave antenna in reducing interference at a neighboring on-body access point while supporting reliable on-body communications. Results demonstrate that creeping wave antennas provide reliable on-body communications while significantly reducing inter-network interference; the inter-network interference is shown to be 10 dB weaker than the on-body signal. In addition, the inter-network interference when both networks utilize creeping wave antennas is shown to be 3 dB weaker than the interference when monopole antennas are used.

Genetic expression programming-based DBA for enhancing peer-assisted music-on-demand service in EPON

NASA Astrophysics Data System (ADS)

Liem, Andrew Tanny; Hwang, I.-Shyan; Nikoukar, AliAkbar; Lee, Jhong-Yue

2015-03-01

Today, the popularity of peer-assisted music-on-demand (MoD) has increased significantly worldwide. This service allows users to access large music library tracks, listen to music, and share their playlist with other users. Unlike the conventional voice traffic, such an application maintains music quality that ranges from 160 kbps to 320 kbps, which most likely consumes more bandwidth than other traffics. In the access network, Ethernet passive optical network (EPON) is one of the best candidates for delivering such a service because of being cost-effective and with high bandwidth. To maintain music quality, a stutter needs to be prevented because of either network effects or when the due user was not receiving enough resources to play in a timely manner. Therefore, in this paper, we propose two genetic expression programming (GEP)-based dynamic bandwidth allocations (DBAs). The first DBA is a generic DBA that aims to find an optimum formula for voice, video, and data services. The second DBA aims to find optimum formulas so that Optical Line Terminal (OLT) can satisfy not only the voice and Peer-to-Peer (P2P) MoD traffics but also reduce the stutter. Optical Network Unit (ONU) traits such as REPORT and GATE messages, cycle time, and mean packet delay are set to be predictor variables. Simulation results show that our proposed DBAs can satisfy the voice and P2P MoD services packet delay and monitor other overall system performances such as expedited forwarding (EF) jitter, packet loss, bandwidth waste, and system throughputs.

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

PubMed

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-05-12

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs)

PubMed Central

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-01-01

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime. PMID:29757208

Temporal Discounting and Inter-Temporal Choice in Rhesus Monkeys

PubMed Central

Hwang, Jaewon; Kim, Soyoun; Lee, Daeyeol

2009-01-01

Humans and animals are more likely to take an action leading to an immediate reward than actions with delayed rewards of similar magnitudes. Although such devaluation of delayed rewards has been almost universally described by hyperbolic discount functions, the rate of this temporal discounting varies substantially among different animal species. This might be in part due to the differences in how the information about reward is presented to decision makers. In previous animal studies, reward delays or magnitudes were gradually adjusted across trials, so the animals learned the properties of future rewards from the rewards they waited for and consumed previously. In contrast, verbal cues have been used commonly in human studies. In the present study, rhesus monkeys were trained in a novel inter-temporal choice task in which the magnitude and delay of reward were indicated symbolically using visual cues and varied randomly across trials. We found that monkeys could extract the information about reward delays from visual symbols regardless of the number of symbols used to indicate the delay. The rate of temporal discounting observed in the present study was comparable to the previous estimates in other mammals, and the animal's choice behavior was largely consistent with hyperbolic discounting. Our results also suggest that the rate of temporal discounting might be influenced by contextual factors, such as the novelty of the task. The flexibility furnished by this new inter-temporal choice task might be useful for future neurobiological investigations on inter-temporal choice in non-human primates. PMID:19562091

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

NASA Astrophysics Data System (ADS)

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

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

Principle and verification of novel optical virtual private networks over multiprotocol label switching/optical packet switching networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Wang, Zhengsuan; Jin, Wei; Qiu, Kun

2012-11-01

A novel realization method of the optical virtual private networks (OVPN) over multiprotocol label switching/optical packet switching (MPLS/OPS) networks is proposed. In this scheme, the introduction of MPLS control plane makes OVPN over OPS networks more reliable and easier; OVPN makes use of the concept of high reconfiguration of light-paths offered by MPLS, to set up secure tunnels of high bandwidth across intelligent OPS networks. Through resource management, the signal mechanism, connection control, and the architecture of the creation and maintenance of OVPN are efficiently realized. We also present an OVPN architecture with two traffic priorities, which is used to analyze the capacity, throughput, delay time of the proposed networks, and the packet loss rate performance of the OVPN over MPLS/OPS networks based on full mesh topology. The results validate the applicability of such reliable connectivity to high quality services in the OVPN over MPLS/OPS networks. Along with the results, the feasibility of the approach as the basis for the next generation networks is demonstrated and discussed.

Communication: Quantum molecular dynamics simulation of liquid para-hydrogen by nuclear and electron wave packet approach

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

Hyeon-Deuk, Kim, E-mail: kim@kuchem.kyoto-u.ac.jp; Japan Science and Technology Agency, PRESTO, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012; Ando, Koji

2014-05-07

Liquid para-hydrogen (p-H{sub 2}) is a typical quantum liquid which exhibits strong nuclear quantum effects (NQEs) and thus anomalous static and dynamic properties. We propose a real-time simulation method of wave packet (WP) molecular dynamics (MD) based on non-empirical intra- and inter-molecular interactions of non-spherical hydrogen molecules, and apply it to condensed-phase p-H{sub 2}. The NQEs, such as WP delocalization and zero-point energy, are taken into account without perturbative expansion of prepared model potential functions but with explicit interactions between nuclear and electron WPs. The developed MD simulation for 100 ps with 1200 hydrogen molecules is realized at feasible computationalmore » cost, by which basic experimental properties of p-H{sub 2} liquid such as radial distribution functions, self-diffusion coefficients, and shear viscosities are all well reproduced.« less

Throughput and delay analysis of IEEE 802.15.6-based CSMA/CA protocol.

PubMed

Ullah, Sana; Chen, Min; Kwak, Kyung Sup

2012-12-01

The IEEE 802.15.6 is a new communication standard on Wireless Body Area Network (WBAN) that focuses on a variety of medical, Consumer Electronics (CE) and entertainment applications. In this paper, the throughput and delay performance of the IEEE 802.15.6 is presented. Numerical formulas are derived to determine the maximum throughput and minimum delay limits of the IEEE 802.15.6 for an ideal channel with no transmission errors. These limits are derived for different frequency bands and data rates. Our analysis is validated by extensive simulations using a custom C+ + simulator. Based on analytical and simulation results, useful conclusions are derived for network provisioning and packet size optimization for different applications.

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.

An Emergency Packet Forwarding Scheme for V2V Communication Networks

PubMed Central

2014-01-01

This paper proposes an effective warning message forwarding scheme for cooperative collision avoidance. In an emergency situation, an emergency-detecting vehicle warns the neighbor vehicles via an emergency warning message. Since the transmission range is limited, the warning message is broadcast in a multihop manner. Broadcast packets lead two challenges to forward the warning message in the vehicular network: redundancy of warning messages and competition with nonemergency transmissions. In this paper, we study and address the two major challenges to achieve low latency in delivery of the warning message. To reduce the intervehicle latency and end-to-end latency, which cause chain collisions, we propose a two-way intelligent broadcasting method with an adaptable distance-dependent backoff algorithm. Considering locations of vehicles, the proposed algorithm controls the broadcast of a warning message to reduce redundant EWM messages and adaptively chooses the contention window to compete with nonemergency transmission. Via simulations, we show that our proposed algorithm reduces the probability of rear-end crashes by 70% compared to previous algorithms by reducing the intervehicle delay. We also show that the end-to-end propagation delay of the warning message is reduced by 55%. PMID:25054181

Strategies for Optimal MAC Parameters Tuning in IEEE 802.15.6 Wearable Wireless Sensor Networks.

PubMed

Alam, Muhammad Mahtab; Ben Hamida, Elyes

2015-09-01

Wireless body area networks (WBAN) has penetrated immensely in revolutionizing the classical heath-care system. Recently, number of WBAN applications has emerged which introduce potential limits to existing solutions. In particular, IEEE 802.15.6 standard has provided great flexibility, provisions and capabilities to deal emerging applications. In this paper, we investigate the application-specific throughput analysis by fine-tuning the physical (PHY) and medium access control (MAC) parameters of the IEEE 802.15.6 standard. Based on PHY characterizations in narrow band, at the MAC layer, carrier sense multiple access collision avoidance (CSMA/CA) and scheduled access protocols are extensively analyzed. It is concluded that, IEEE 802.15.6 standard can satisfy most of the WBANs applications throughput requirements by maximum achieving 680 Kbps. However, those emerging applications which require high quality audio or video transmissions, standard is not able to meet their constraints. Moreover, delay, energy efficiency and successful packet reception are considered as key performance metrics for comparing the MAC protocols. CSMA/CA protocol provides the best results to meet the delay constraints of medical and non-medical WBAN applications. Whereas, the scheduled access approach, performs very well both in energy efficiency and packet reception ratio.

Fiber-wireless for smart grid: A survey

NASA Astrophysics Data System (ADS)

Radzi, NAM; Ridwan, MA; Din, NM; Abdullah, F.; Mustafa, IS; l-Mansoori, MH

2017-11-01

Smart grid allows two-way communication between power utility companies and their customers while having the ability to sense along the transmission lines. However, the downside is such, when the smart devices are transmitting data simultaneously, it results in network congestion. Fiber wireless (FiWi) network is one of the best congestion solutions for smart grid up to date. In this paper, a survey of current literature on FiWi for smart grid will be reviewed and a testbed to test the protocols and algorithms for FiWi in smart grid will be proposed. The results of number of packets received and delay vs packet transmitted obtained via the testbed are compared with the results obtained via simulation and they show that they are in line with each other, validating the accuracy of the testbed.

Energy-Efficient Deadline-Aware Data-Gathering Scheme Using Multiple Mobile Data Collectors.

PubMed

Dasgupta, Rumpa; Yoon, Seokhoon

2017-04-01

In wireless sensor networks, the data collected by sensors are usually forwarded to the sink through multi-hop forwarding. However, multi-hop forwarding can be inefficient due to the energy hole problem and high communications overhead. Moreover, when the monitored area is large and the number of sensors is small, sensors cannot send the data via multi-hop forwarding due to the lack of network connectivity. In order to address those problems of multi-hop forwarding, in this paper, we consider a data collection scheme that uses mobile data collectors (MDCs), which visit sensors and collect data from them. Due to the recent breakthroughs in wireless power transfer technology, MDCs can also be used to recharge the sensors to keep them from draining their energy. In MDC-based data-gathering schemes, a big challenge is how to find the MDCs' traveling paths in a balanced way, such that their energy consumption is minimized and the packet-delay constraint is satisfied. Therefore, in this paper, we aim at finding the MDCs' paths, taking energy efficiency and delay constraints into account. We first define an optimization problem, named the delay-constrained energy minimization (DCEM) problem, to find the paths for MDCs. An integer linear programming problem is formulated to find the optimal solution. We also propose a two-phase path-selection algorithm to efficiently solve the DCEM problem. Simulations are performed to compare the performance of the proposed algorithms with two heuristics algorithms for the vehicle routing problem under various scenarios. The simulation results show that the proposed algorithms can outperform existing algorithms in terms of energy efficiency and packet delay.

Energy-Efficient Deadline-Aware Data-Gathering Scheme Using Multiple Mobile Data Collectors

PubMed Central

Dasgupta, Rumpa; Yoon, Seokhoon

2017-01-01

In wireless sensor networks, the data collected by sensors are usually forwarded to the sink through multi-hop forwarding. However, multi-hop forwarding can be inefficient due to the energy hole problem and high communications overhead. Moreover, when the monitored area is large and the number of sensors is small, sensors cannot send the data via multi-hop forwarding due to the lack of network connectivity. In order to address those problems of multi-hop forwarding, in this paper, we consider a data collection scheme that uses mobile data collectors (MDCs), which visit sensors and collect data from them. Due to the recent breakthroughs in wireless power transfer technology, MDCs can also be used to recharge the sensors to keep them from draining their energy. In MDC-based data-gathering schemes, a big challenge is how to find the MDCs’ traveling paths in a balanced way, such that their energy consumption is minimized and the packet-delay constraint is satisfied. Therefore, in this paper, we aim at finding the MDCs’ paths, taking energy efficiency and delay constraints into account. We first define an optimization problem, named the delay-constrained energy minimization (DCEM) problem, to find the paths for MDCs. An integer linear programming problem is formulated to find the optimal solution. We also propose a two-phase path-selection algorithm to efficiently solve the DCEM problem. Simulations are performed to compare the performance of the proposed algorithms with two heuristics algorithms for the vehicle routing problem under various scenarios. The simulation results show that the proposed algorithms can outperform existing algorithms in terms of energy efficiency and packet delay. PMID:28368300

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.

Final report for the Multiprotocol Label Switching (MPLS) control plane security LDRD project.

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

Torgerson, Mark Dolan; Michalski, John T.; Tarman, Thomas David

2003-09-01

As rapid Internet growth continues, global communications becomes more dependent on Internet availability for information transfer. Recently, the Internet Engineering Task Force (IETF) introduced a new protocol, Multiple Protocol Label Switching (MPLS), to provide high-performance data flows within the Internet. MPLS emulates two major aspects of the Asynchronous Transfer Mode (ATM) technology. First, each initial IP packet is 'routed' to its destination based on previously known delay and congestion avoidance mechanisms. This allows for effective distribution of network resources and reduces the probability of congestion. Second, after route selection each subsequent packet is assigned a label at each hop, whichmore » determines the output port for the packet to reach its final destination. These labels guide the forwarding of each packet at routing nodes more efficiently and with more control than traditional IP forwarding (based on complete address information in each packet) for high-performance data flows. Label assignment is critical in the prompt and accurate delivery of user data. However, the protocols for label distribution were not adequately secured. Thus, if an adversary compromises a node by intercepting and modifying, or more simply injecting false labels into the packet-forwarding engine, the propagation of improperly labeled data flows could create instability in the entire network. In addition, some Virtual Private Network (VPN) solutions take advantage of this 'virtual channel' configuration to eliminate the need for user data encryption to provide privacy. VPN's relying on MPLS require accurate label assignment to maintain user data protection. This research developed a working distributive trust model that demonstrated how to deploy confidentiality, authentication, and non-repudiation in the global network label switching control plane. Simulation models and laboratory testbed implementations that demonstrated this concept were developed, and results from this research were transferred to industry via standards in the Optical Internetworking Forum (OIF).« less

A SIEPON based transmitter sleep mode energy-efficient mechanism in EPON

NASA Astrophysics Data System (ADS)

Nikoukar, AliAkbar; Hwang, I.-Shyan; Wang, Chien-Jung; Ab-Rahman, Mohammad Syuhaimi; Liem, Andrew Tanny

2015-06-01

The main energy consumption in computer networks is the access networks. The passive optical network (PON) has the least energy consumption among access network technologies. In addition, the time division multiplexing (TDM) Ethernet PON (EPON) is one of the best candidates to improve energy consumption by time utilization. The optical network unit (ONU) can utilize the time and save the energy in the EPON by turning off its transmitter/receiver when there is no upstream/downstream traffic. The ITU-T and IEEE organizations are published standards for energy-saving in the TDM-PON. Although their standards provide the framework to accomplish the energy-saving, the algorithms/criteria to generate events to accommodate various operational policies, time to wake up, parameter values for timers are out of scope of the standards. Many studies have proposed schemes for energy-saving in TDM-PON to achieve maximum energy saving. Even so, these schemes increase the mean packet delay and consequently, reduce the quality of service (QoS). In this paper, first we take a look to the state of the art for PON energy-saving. Additionally, a mechanism based on SIEPON standard in EPON with new components in the ONUs and optical line terminal (OLT) is proposed to save the transmitter energy and guarantee QoS. The proposed mechanism follows the SIEPON standard, considers the QoS first, and then saves the energy as far as possible. The ONU sleep controller unit (OSC) and green dynamic bandwidth allocation (GDBA) are used to calculate the ONU transmitter sleep (Tx) duration and grant the proper time to the ONUs. Simulation results show that the proposed energy-saving mechanism not only promises the QoS performance in terms of mean packet delay, packet loss, throughput, and jitter, but also saves energy in different maximum cycle times.

Future optical communication networks beyond 160 Gbit/s based on OTDM

NASA Astrophysics Data System (ADS)

Prati, Giancarlo; Bogoni, Antonella; Poti, Luca

2005-01-01

The virtually unlimited bandwidth of optical fibers has caused a great increase in data transmission speed over the past decade and, hence, stimulated high-demand multimedia services such as distance learning, video-conferencing and peer to peer applications. For this reason data traffic is exceeding telephony traffic, and this trend is driving the convergence of telecommunications and computer communications. In this scenario Internet Protocol (IP) is becoming the dominant protocol for any traffic, shifting the attention of the network designers from a circuit switching approach to a packet switching approach. A role of paramount importance in packet switching networks is played by the router that must implement the functionalities to set up and maintain the inter-nodal communications. The main functionalities a router must implement are routing, forwarding, switching, synchronization, contention resolution, and buffering. Nowadays, opto-electronic conversion is still required at each network node to process the incoming signal before routing that to the right output port. However, when the single channel bit rate increases beyond electronic speed limit, Optical Time Division Multiplexing (OTDM) becomes a forced choice, and all-optical processing must be performed to extract the information from the incoming packet. In this paper enabling techniques for ultra-fast all-optical network will be addressed. First a 160 Gbit/s complete transmission system will be considered. As enabling technique, an overview for all-optical logics will be discussed and experimental results will be presented using a particular reconfigurable NOLM based on Self-Phase-Modulation (SPM) or Cross-Phase-Modulation (XPM). Finally, a rough experiment on label extraction, all-optical switching and packet forwarding is shown.

Unified Method for Delay Analysis of Random Multiple Access Algorithms.

DTIC Science & Technology

1985-08-01

packets in the first cell of the stack. The rules of the algorithm yield the following relation for the wi’s: n-1 n w 0= ; W =1; i i 9Q h I+ + zwI .+N...for computer communica- tions", in Proc. 1970 Fall Joint Computer Conf., AFIPS Press, vol. 37, 1970, pp. 281 -285. (15] N. D. Vvedenskaya and B. S

TCP Pacing Developed

NASA Technical Reports Server (NTRS)

Ivancic, William D.

2002-01-01

Transmission control protocol (TCP) was conceived and designed to run over a variety of communication links, including wireless and high-bandwidth links. However, with recent technological advances in satellite and fiber-optic networks, researchers are reevaluating the flexibility of TCP. The TCP pacing and packet pair probing implementation may help overcome two of the major obstacles identified for efficient bandwidth utilization over communication links with large delay-bandwidth products.

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.

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.

Traffic shaping and scheduling for OBS-based IP/WDM backbones

NASA Astrophysics Data System (ADS)

Elhaddad, Mahmoud S.; Melhem, Rami G.; Znati, Taieb; Basak, Debashis

2003-10-01

We introduce Proactive Reservation-based Switching (PRS) -- a switching architecture for IP/WDM networks based on Labeled Optical Burst Switching. PRS achieves packet delay and loss performance comparable to that of packet-switched networks, without requiring large buffering capacity, or burst scheduling across a large number of wavelengths at the core routers. PRS combines proactive channel reservation with periodic shaping of ingress-egress traffic aggregates to hide the offset latency and approximate the utilization/buffering characteristics of discrete-time queues with periodic arrival streams. A channel scheduling algorithm imposes constraints on burst departure times to ensure efficient utilization of wavelength channels and to maintain the distance between consecutive bursts through the network. Results obtained from simulation using TCP traffic over carefully designed topologies indicate that PRS consistently achieves channel utilization above 90% with modest buffering requirements.

Real-time observation of intramolecular proton transfer in the electronic ground state of chloromalonaldehyde: an ab initio study of time-resolved photoelectron spectra.

PubMed

do N Varella, Márcio T; Arasaki, Yasuki; Ushiyama, Hiroshi; Takatsuka, Kazuo; Wang, Kwanghsi; McKoy, Vincent

2007-02-07

The authors report on studies of time-resolved photoelectron spectra of intramolecular proton transfer in the ground state of chloromalonaldehyde, employing ab initio photoionization matrix elements and effective potential surfaces of reduced dimensionality, wherein the couplings of proton motion to the other molecular vibrational modes are embedded by averaging over classical trajectories. In the simulations, population is transferred from the vibrational ground state to vibrationally hot wave packets by pumping to an excited electronic state and dumping with a time-delayed pulse. These pump-dump-probe simulations demonstrate that the time-resolved photoelectron spectra track proton transfer in the electronic ground state well and, furthermore, that the geometry dependence of the matrix elements enhances the tracking compared with signals obtained with the Condon approximation. Photoelectron kinetic energy distributions arising from wave packets localized in different basins are also distinguishable and could be understood, as expected, on the basis of the strength of the optical couplings in different regions of the ground state potential surface and the Franck-Condon overlaps of the ground state wave packets with the vibrational eigenstates of the ion potential surface.

Next generation communications satellites: Multiple access and network studies

NASA Technical Reports Server (NTRS)

Stern, T. E.; Schwartz, M.; Meadows, H. E.; Ahmadi, H. K.; Gadre, J. G.; Gopal, I. S.; Matsmo, K.

1980-01-01

Following an overview of issues involved in the choice of promising system architectures for efficient communication with multiple small inexpensive Earth stations serving hetergeneous user populations, performance evaluation via analysis and simulation for six SS/TDMA (satellite-switched/time-division multiple access) system architectures is discussed. These configurations are chosen to exemplify the essential alternatives available in system design. Although the performance evaluation analyses are of fairly general applicability, whenever possible they are considered in the context of NASA's 30/20 GHz studies. Packet switched systems are considered, with the assumption that only a part of transponder capacit is devoted to packets, the integration of circuit and packet switched traffic being reserved for further study. Three types of station access are distinguished: fixed (FA), demand (DA), and random access (RA). Similarly, switching in the satellite can be assigned on a fixed (FS) or demand (DS) basis, or replaced by a buffered store-and-forward system (SF) onboard the satellite. Since not all access/switching combinations are practical, six systems are analyzed in detail: three FS SYSTEMS, FA/FS, DA/ES, RA/FS; one DS system, DA/DS; and two SF systems, FA/SF, DA/SF. Results are presented primarily in terms of delay-throughput characteristics.

The Operational Impacts of the Global Network Enterprise Construct

DTIC Science & Technology

2010-05-14

Board Task Force on Achieving Interoperability in a Net-Centric Environment, xiv. 60 Lolita Baldor, “Military Asserts Right to Return Cyber-Attacks...the commander is aware that applications such video teleconferencing and large file transfers are often not possible with subordinate units...data packets, but if there is latency along the path, services such as video or large file transfers will fail. Latency is the time delay inherent in

Predictive functional control for active queue management in congested TCP/IP networks.

PubMed

Bigdeli, N; Haeri, M

2009-01-01

Predictive functional control (PFC) as a new active queue management (AQM) method in dynamic TCP networks supporting explicit congestion notification (ECN) is proposed. The ability of the controller in handling system delay along with its simplicity and low computational load makes PFC a privileged AQM method in the high speed networks. Besides, considering the disturbance term (which represents model/process mismatches, external disturbances, and existing noise) in the control formulation adds some level of robustness into the PFC-AQM controller. This is an important and desired property in the control of dynamically-varying computer networks. In this paper, the controller is designed based on a small signal linearized fluid-flow model of the TCP/AQM networks. Then, closed-loop transfer function representation of the system is derived to analyze the robustness with respect to the network and controller parameters. The analytical as well as the packet-level ns-2 simulation results show the out-performance of the developed controller for both queue regulation and resource utilization. Fast response, low queue fluctuations (and consequently low delay jitter), high link utilization, good disturbance rejection, scalability, and low packet marking probability are other features of the developed method with respect to other well-known AQM methods such as RED, PI, and REM which are also simulated for comparison.

Stochastic sampled-data control for synchronization of complex dynamical networks with control packet loss and additive time-varying delays.

PubMed

Rakkiyappan, R; Sakthivel, N; Cao, Jinde

2015-06-01

This study examines the exponential synchronization of complex dynamical networks with control packet loss and additive time-varying delays. Additionally, sampled-data controller with time-varying sampling period is considered and is assumed to switch between m different values in a random way with given probability. Then, a novel Lyapunov-Krasovskii functional (LKF) with triple integral terms is constructed and by using Jensen's inequality and reciprocally convex approach, sufficient conditions under which the dynamical network is exponentially mean-square stable are derived. When applying Jensen's inequality to partition double integral terms in the derivation of linear matrix inequality (LMI) conditions, a new kind of linear combination of positive functions weighted by the inverses of squared convex parameters appears. In order to handle such a combination, an effective method is introduced by extending the lower bound lemma. To design the sampled-data controller, the synchronization error system is represented as a switched system. Based on the derived LMI conditions and average dwell-time method, sufficient conditions for the synchronization of switched error system are derived in terms of LMIs. Finally, numerical example is employed to show the effectiveness of the proposed methods. Copyright © 2015 Elsevier Ltd. All rights reserved.

An energy saving mechanism of EPON networks for real time video transmission

NASA Astrophysics Data System (ADS)

Liu, Chien-Ping; Wu, Ho-Ting; Chiang, Yun-Ting; Chien, Shieh-Chieh; Ke, Kai-Wei

2015-07-01

Modern access networks are constructed widely by passive optical networks (PONs) to meet the growing bandwidth demand. However, higher bandwidth means more energy consumption. To save energy, a few research works propose the dual-mode energy saving mechanism that allows the ONU to operate between active and sleep modes periodically. However, such dual-mode energy saving design may induce unnecessary power consumption or packet delay increase in the case where only downstream data exist for most of the time. In this paper, we propose a new tri-mode energy saving scheme for Ethernet PON (EPON). The new tri-mode energy saving design, combining the dual-mode saving mechanism with the doze mode, allows the ONU to switch among these three modes alternatively. In the doze mode, the ONU may receive downstream data while keeping its transmitter close. Such scenario is often observed for real time video downstream transmission. Furthermore, the low packet delay of high priority upstream data can be attained through the use of early wake-up mechanism employed in both energy saving modes. The energy saving and system efficiency can thus be achieved jointly while maintaining the differentiated QoS for data with various priorities. Performance results via simulation have demonstrated the effectiveness of such mechanism.

Conceptual Design of a Communication-Based Deep Space Navigation Network

NASA Technical Reports Server (NTRS)

Anzalone, Evan J.; Chuang, C. H.

2012-01-01

As the need grows for increased autonomy and position knowledge accuracy to support missions beyond Earth orbit, engineers must push and develop more advanced navigation sensors and systems that operate independent of Earth-based analysis and processing. Several spacecraft are approaching this problem using inter-spacecraft radiometric tracking and onboard autonomous optical navigation methods. This paper proposes an alternative implementation to aid in spacecraft position fixing. The proposed method Network-Based Navigation technique takes advantage of the communication data being sent between spacecraft and between spacecraft and ground control to embed navigation information. The navigation system uses these packets to provide navigation estimates to an onboard navigation filter to augment traditional ground-based radiometric tracking techniques. As opposed to using digital signal measurements to capture inherent information of the transmitted signal itself, this method relies on the embedded navigation packet headers to calculate a navigation estimate. This method is heavily dependent on clock accuracy and the initial results show the promising performance of a notional system.

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

Connected cruise control: modelling, delay effects, and nonlinear behaviour

NASA Astrophysics Data System (ADS)

Orosz, Gábor

2016-08-01

Connected vehicle systems (CVS) are considered in this paper where vehicles exchange information using wireless vehicle-to-vehicle (V2V) communication. The concept of connected cruise control (CCC) is established that allows control design at the level of individual vehicles while exploiting V2V connectivity. Due to its high level of modularity the proposed design can be applied to large heterogeneous traffic systems. The dynamics of a simple CVS is analysed in detail while taking into account nonlinearities in the vehicle dynamics as well as in the controller. Time delays that arise due to intermittencies and packet drops in the communication channels are also incorporated. The results are summarised using stability charts which allow one to select control gains to maintain stability and ensure disturbance attenuation when the delay is below a critical value.

Evaluation Study of a Wireless Multimedia Traffic-Oriented Network Model

NASA Astrophysics Data System (ADS)

Vasiliadis, D. C.; Rizos, G. E.; Vassilakis, C.

2008-11-01

In this paper, a wireless multimedia traffic-oriented network scheme over a fourth generation system (4-G) is presented and analyzed. We conducted an extensive evaluation study for various mobility configurations in order to incorporate the behavior of the IEEE 802.11b standard over a test-bed wireless multimedia network model. In this context, the Quality of Services (QoS) over this network is vital for providing a reliable high-bandwidth platform for data-intensive sources like video streaming. Therefore, the main issues concerned in terms of QoS were the metrics for bandwidth of both dropped and lost packets and their mean packet delay under various traffic conditions. Finally, we used a generic distance-vector routing protocol which was based on an implementation of Distributed Bellman-Ford algorithm. The performance of the test-bed network model has been evaluated by using the simulation environment of NS-2.

Attosecond-resolved photoionization of chiral molecules.

PubMed

Beaulieu, S; Comby, A; Clergerie, A; Caillat, J; Descamps, D; Dudovich, N; Fabre, B; Géneaux, R; Légaré, F; Petit, S; Pons, B; Porat, G; Ruchon, T; Taïeb, R; Blanchet, V; Mairesse, Y

2017-12-08

Chiral light-matter interactions have been investigated for two centuries, leading to the discovery of many chiroptical processes used for discrimination of enantiomers. Whereas most chiroptical effects result from a response of bound electrons, photoionization can produce much stronger chiral signals that manifest as asymmetries in the angular distribution of the photoelectrons along the light-propagation axis. We implemented self-referenced attosecond photoelectron interferometry to measure the temporal profile of the forward and backward electron wave packets emitted upon photoionization of camphor by circularly polarized laser pulses. We measured a delay between electrons ejected forward and backward, which depends on the ejection angle and reaches 24 attoseconds. The asymmetric temporal shape of electron wave packets emitted through an autoionizing state further reveals the chiral character of strongly correlated electronic dynamics. Copyright © 2017 The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works.

DTN routing in body sensor networks with dynamic postural partitioning.

PubMed

Quwaider, Muhannad; Biswas, Subir

2010-11-01

This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

Control of photodissociation and photoionization of the NaI molecule by dynamic Stark effect.

PubMed

Han, Yong-Chang; Yuan, Kai-Jun; Hu, Wen-Hui; Cong, Shu-Lin

2009-01-28

The diabatic photodissociation and photoionization processes of the NaI molecule are studied theoretically using the quantum wave packet method. A pump laser pulse is used to prepare a dissociation wave packet that propagates through both the ionic channel (NaI-->Na(+)+I(-)) and the covalent channel (NaI-->Na+I). A Stark pulse is used to control the diabatic dissociation dynamics and a probe pulse is employed to ionize the products from the two channels. Based on the first order nonresonant nonperturbative dynamic Stark effect, the dissociation probabilities and the branching ratio of the products from the two channels can be controlled. Moreover the final photoelectron kinetic energy distribution can also be affected by the Stark pulse. The influences of the delay time, intensity, frequency, and carrier-envelope phase of the Stark pulse on the dissociation and ionization dynamics of the NaI molecule are discussed in detail.

Optimal Scheduling and Fair Service Policy for STDMA in Underwater Networks with Acoustic Communications

PubMed Central

2018-01-01

In this work, a multi-hop string network with a single sink node is analyzed. A periodic optimal scheduling for TDMA operation that considers the characteristic long propagation delay of the underwater acoustic channel is presented. This planning of transmissions is obtained with the help of a new geometrical method based on a 2D lattice in the space-time domain. In order to evaluate the performance of this optimal scheduling, two service policies have been compared: FIFO and Round-Robin. Simulation results, including achievable throughput, packet delay, and queue length, are shown. The network fairness has also been quantified with the Gini index. PMID:29462966

The effect of model uncertainty on some optimal routing problems

NASA Technical Reports Server (NTRS)

Mohanty, Bibhu; Cassandras, Christos G.

1991-01-01

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Creating Rydberg electron wave packets using terahertz pulses

NASA Astrophysics Data System (ADS)

Bromage, Jake

1999-10-01

In this thesis I present experiments in which we excited classical-limit states of an atom using terahertz pulses. In a classical-limit state, an atom's outer electron is confined to a wave packet that orbits the core along a classical trajectory. Researchers have excited states with classical traits, but wave packets localized in all three dimensions have proved elusive. Theoretical studies have shown such states can be created using terahertz pulses. Using these techniques, we created a linear-orbit wave packet (LOWP), that is three-dimensionally localized and orbits along a line on one side of the atom's core. Terahertz pulses are sub-picosecond bursts of far- infrared radiation. Unlike ultrashort optical pulses, the electric field of terahertz pulses barely completes a single cycle. Our simulations of the atom-pulse interaction show that this electric field profile is critical in determining the quality of the wave packet. To characterize our terahertz pulses, we invented dithered-edge sampling which time- resolves the electric field using a photoconductive receiver and a triggered attenuator. We also studied how pulses are distorted after propagating through metallic structures, and used our findings to design our atomic experiments. We excited wave packets in atomic sodium using a two-step process. First, we used tunable, nanosecond dye lasers to excite an extreme Stark state. Next, we used a terahertz pump pulse to coherently redistribute population among extreme Stark states in neighboring manifolds. Interference between the final states produces a localized, dynamic LOWP. To analyze the LOWP, we ionized it with a stronger terahertz probe pulse, varying the pump-probe delay to map out its motion. We observed two strong LOWP signatures. Changing the static electric field produced small changes (2%) in the orbital period that agreed with our theoretical predictions. Secondly, because the LOWP scatters off the core, the pump-probe signal depended on the direction of the kick the LOWP received from the robe pulse. These observations, combined with our detailed simulations that used sodium parameters and the actual shape of the terahertz pulse, lead us to conclude that we excited a LOWP.

Establishment of a definitive protocol for the diagnosis and management of body packers (drug mules).

PubMed

Mandava, Nageswara; Chang, Richard S; Wang, John H; Bertocchi, Michael; Yrad, Jonathan; Allamaneni, Shyam; Aboian, Edouard; Lall, Malini H; Mariano, Rosalind; Richards, Neil

2011-02-01

'Mules' or body packers are people who transport illegal drugs by packet ingestion into the gastrointestinal tract. These people are otherwise healthy and their management should maintain minimal morbidity. In this study, experience with body packers is presented and an algorithm for conservative and surgical management is provided. The clinical patient database for all body packer admissions at Mary Immaculate Hospital of the Caritas Health Care Inc. from 1993 to 2005 was interrogated. 56 patients (4.5%) required admission out of a total of 1250 subjects confirmed to be body packers and apprehended by United State Customs officials at JFK International Airport, New York. The retrieved patient data were analysed retrospectively. 70% of the body packers were men, with a male to female ratio of 2.8 to 1. The mean age was 33 years and 52% were from Columbia. Heroin was the most common illegally transported substance (73%). 25 patients (45%) required surgical intervention, whereas 31 patients (55%) were successfully managed conservatively. Indications for intervention included: bowel obstruction, packet rupture/toxicity, and delayed progression of packet transit on conservative management. Multiple intraoperative manoeuvres were used to remove the foreign bodies: gastrotomy, enterotomy and colotomy. Wound infection was the most common complication and is associated with distal enterotomy and colotomy. Men were more likely to present as body packers than women. Proximal enterotomies are preferred and multiple enterotomies should be avoided. A confirmatory radiological study is needed to demonstrate complete clearance of packets. A systematic protocol for the management of body packers results in minimal morbidity and no mortality.

Isolating Behavioral Mechanisms of Inter-Temporal Choice: Nicotine Effects on Delay Discounting and Amount Sensitivity

ERIC Educational Resources Information Center

Locey, Matthew L.; Dallery, Jesse

2009-01-01

Many drugs of abuse produce changes in impulsive choice, that is, choice for a smaller-sooner reinforcer over a larger-later reinforcer. Because the alternatives differ in both delay and amount, it is not clear whether these drug effects are due to the differences in reinforcer delay or amount. To isolate the effects of delay, we used a titrating…

The Abcd Formula of Phase Definition in Optical Interferometry: Combined Effect of Air Dispersion and Broad Passband

NASA Astrophysics Data System (ADS)

Mathar, Richard J.

Long-baseline interferometry detects fringes created by superposition of two beams of light collected by two telescopes pointing into a common direction. The external path difference is commonly compensated by adding a variable optical path length (delay) through air for one beam such that the optical path difference between the beams remains close to zero near the detector. The ABCD formula assigns a (wrapped) phase to the signals A to D of an interference pattern shifted by multiples of 90 degrees in phase. We study the interplay between a broad spectral passband of the optics and the dispersion of the air in the compensating delay, which leads to small deviations between the ABCD phase and the reduced, monochromatic group-delay representation of the wave packets. This adds dispersion to the effects that have been discussed for evacuated interferometers before (Milman 2005).

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.

Wide-area Power System Damping Control Coordination Based on Particle Swarm Optimization with Time Delay Considered

NASA Astrophysics Data System (ADS)

Zhang, J. Y.; Jiang, Y.

2017-10-01

To ensure satisfactory dynamic performance of controllers in time-delayed power systems, a WAMS-based control strategy is investigated in the presence of output feedback delay. An integrated approach based on Pade approximation and particle swarm optimization (PSO) is employed for parameter configuration of PSS. The coordination configuration scheme of power system controllers is achieved by a series of stability constraints at the aim of maximizing the minimum damping ratio of inter-area mode of power system. The validity of this derived PSS is verified on a prototype power system. The findings demonstrate that the proposed approach for control design could damp the inter-area oscillation and enhance the small-signal stability.

Multi-delay, phase coherent pulse pair generation for precision Ramsey-frequency comb spectroscopy.

PubMed

Morgenweg, J; Eikema, K S E

2013-03-11

We demonstrate the generation of phase-stable mJ-pulse pairs at programmable inter-pulse delays up to hundreds of nanoseconds. A detailed investigation of potential sources for phase shifts during the parametric amplification of the selected pulses from a Ti:Sapphire frequency comb is presented, both numerically and experimentally. It is shown that within the statistical error of the phase measurement of 10 mrad, there is no dependence of the differential phase shift over the investigated inter-pulse delay range of more than 300 ns. In combination with nonlinear upconversion of the amplified pulses, the presented system will potentially enable short wavelength (<100 nm), multi-transition Ramsey-frequency comb spectroscopy at the kHz-level.

A new, ultra-low latency data transmission protocol for Earthquake Early Warning Systems

NASA Astrophysics Data System (ADS)

Hill, P.; Hicks, S. P.; McGowan, M.

2016-12-01

One measure used to assess the performance of Earthquake Early Warning Systems (EEWS) is the delay time between earthquake origin and issued alert. EEWS latency is dependent on a number of sources (e.g. P-wave propagation, digitisation, transmission, receiver processing, triggering, event declaration). Many regional seismic networks use the SEEDlink protocol; however, packet size is fixed to 512-byte miniSEED records, resulting in transmission latencies of >0.5 s. Data packetisation is seen as one of the main sources of delays in EEWS (Brown et al., 2011). Optimising data-logger and telemetry configurations is a cost-effective strategy to improve EEWS alert times (Behr et al., 2015). Digitisers with smaller, selectable packets can result in faster alerts (Sokos et al., 2016). We propose a new seismic protocol for regional seismic networks benefiting low-latency applications such as EEWS. The protocol, based on Güralp's existing GDI-link format is an efficient and flexible method to exchange data between seismic stations and data centers for a range of network configurations. The main principle is to stream data sample-by-sample instead of fixed-length packets to minimise transmission latency. Self-adaptive packetisation with compression maximises available telemetry bandwidth. Highly flexible metadata fields within GDI-link are compatible with existing miniSEED definitions. Data is sent as integers or floats, supporting a wide range of data formats, including discrete parameters such as Pd & τC for on-site earthquake early warning. Other advantages include: streaming station state-of-health information, instrument control, support of backfilling and fail-over strategies during telemetry outages. Based on tests carried out on the Güralp Minimus data-logger, we show our new protocol can reduce transmission latency to as low as 1 ms. The low-latency protocol is currently being implemented with common processing packages. The results of these tests will help to highlight latency levels that can be achieved with next-generation EEWS.

A low-latency optical switch architecture using integrated μm SOI-based contention resolution and switching

NASA Astrophysics Data System (ADS)

Mourgias-Alexandris, G.; Moralis-Pegios, M.; Terzenidis, N.; Cherchi, M.; Harjanne, M.; Aalto, T.; Vyrsokinos, K.; Pleros, N.

2018-02-01

The urgent need for high-bandwidth and high-port connectivity in Data Centers has boosted the deployment of optoelectronic packet switches towards bringing high data-rate optics closer to the ASIC, realizing optical transceiver functions directly at the ASIC package for high-rate, low-energy and low-latency interconnects. Even though optics can offer a broad range of low-energy integrated switch fabrics for replacing electronic switches and seamlessly interface with the optical I/Os, the use of energy- and latency-consuming electronic SerDes continues to be a necessity, mainly dictated by the absence of integrated and reliable optical buffering solutions. SerDes undertakes the role of optimally synergizing the lower-speed electronic buffers with the incoming and outgoing optical streams, suggesting that a SerDes-released chip-scale optical switch fabric can be only realized in case all necessary functions including contention resolution and switching can be implemented on a common photonic integration platform. In this paper, we demonstrate experimentally a hybrid Broadcast-and-Select (BS) / wavelength routed optical switch that performs both the optical buffering and switching functions with μm-scale Silicon-integrated building blocks. Optical buffering is carried out in a silicon-integrated variable delay line bank with a record-high on-chip delay/footprint efficiency of 2.6ns/mm2 and up to 17.2 nsec delay capability, while switching is executed via a BS design and a silicon-integrated echelle grating, assisted by SOA-MZI wavelength conversion stages and controlled by a FPGA header processing module. The switch has been experimentally validated in a 3x3 arrangement with 10Gb/s NRZ optical data packets, demonstrating error-free switching operation with a power penalty of <5dB.

Network Policy Management

DTIC Science & Technology

1999-09-01

In truth , there may be some overlap between the various events. This could reduce the total amount of time that the function was not available to...in int-serv provides hard bounds on the maximum delay that will be experienced by the packets. It does so by explicitly reserving resources along the ...network is a soft target. This was noted by Bellovin who coined the term " Hard on the outside, soft and chewy on the inside" [Ref. 26] to describe

Flow Control and Routing in an Integrated Voice and Data Communication Network

DTIC Science & Technology

1981-08-01

require continuous and almost real - time delivery; they are very sensitive to delay. Data conversations, on the other hand, are generally intolerant of...packets arrive in time to be delivered to the sink. However, this is not the solution we seek. We have noted that voice conversations require almost real ...by long messages that require continuous real - time delivery; e.g. voice facsimile, video. Class II: characterized by short discrete messages that

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks.

PubMed

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-10-27

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor's mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay.

Performance Analyses and Improvements for the IEEE 802.15.4 CSMA/CA Scheme with Heterogeneous Buffered Conditions

PubMed Central

Zhu, Jianping; Tao, Zhengsu; Lv, Chunfeng

2012-01-01

Studies of the IEEE 802.15.4 Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme have been received considerable attention recently, with most of these studies focusing on homogeneous or saturated traffic. Two novel transmission schemes—OSTS/BSTS (One Service a Time Scheme/Bulk Service a Time Scheme)—are proposed in this paper to improve the behaviors of time-critical buffered networks with heterogeneous unsaturated traffic. First, we propose a model which contains two modified semi-Markov chains and a macro-Markov chain combined with the theory of M/G/1/K queues to evaluate the characteristics of these two improved CSMA/CA schemes, in which traffic arrivals and accessing packets are bestowed with non-preemptive priority over each other, instead of prioritization. Then, throughput, packet delay and energy consumption of unsaturated, unacknowledged IEEE 802.15.4 beacon-enabled networks are predicted based on the overall point of view which takes the dependent interactions of different types of nodes into account. Moreover, performance comparisons of these two schemes with other non-priority schemes are also proposed. Analysis and simulation results show that delay and fairness of our schemes are superior to those of other schemes, while throughput and energy efficiency are superior to others in more heterogeneous situations. Comprehensive simulations demonstrate that the analysis results of these models match well with the simulation results. PMID:22666076

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

Garlapati, Shravan; Kuruganti, Teja; Buehrer, Michael R.

The utilization of state-of-the-art 3G cellular CDMA technologies in a utility owned AMI network results in a large amount of control traffic relative to data traffic, increases the average packet delay and hence are not an appropriate choice for smart grid distribution applications. Like the CDG, we consider a utility owned cellular like CDMA network for smart grid distribution applications and classify the distribution smart grid data as scheduled data and random data. Also, we propose SMAC protocol, which changes its mode of operation based on the type of the data being collected to reduce the data collection latency andmore » control overhead when compared to 3G cellular CDMA2000 MAC. The reduction in the data collection latency and control overhead aids in increasing the number of smart meters served by a base station within the periodic data collection interval, which further reduces the number of base stations needed by a utility or reduces the bandwidth needed to collect data from all the smart meters. The reduction in the number of base stations and/or the reduction in the data transmission bandwidth reduces the CAPital EXpenditure (CAPEX) and OPerational EXpenditure (OPEX) of the AMI network. Finally, the proposed SMAC protocol is analyzed using markov chain, analytical expressions for average throughput and average packet delay are derived, and simulation results are also provided to verify the analysis.« less

Performance analyses and improvements for the IEEE 802.15.4 CSMA/CA scheme with heterogeneous buffered conditions.

PubMed

Zhu, Jianping; Tao, Zhengsu; Lv, Chunfeng

2012-01-01

Studies of the IEEE 802.15.4 Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme have been received considerable attention recently, with most of these studies focusing on homogeneous or saturated traffic. Two novel transmission schemes-OSTS/BSTS (One Service a Time Scheme/Bulk Service a Time Scheme)-are proposed in this paper to improve the behaviors of time-critical buffered networks with heterogeneous unsaturated traffic. First, we propose a model which contains two modified semi-Markov chains and a macro-Markov chain combined with the theory of M/G/1/K queues to evaluate the characteristics of these two improved CSMA/CA schemes, in which traffic arrivals and accessing packets are bestowed with non-preemptive priority over each other, instead of prioritization. Then, throughput, packet delay and energy consumption of unsaturated, unacknowledged IEEE 802.15.4 beacon-enabled networks are predicted based on the overall point of view which takes the dependent interactions of different types of nodes into account. Moreover, performance comparisons of these two schemes with other non-priority schemes are also proposed. Analysis and simulation results show that delay and fairness of our schemes are superior to those of other schemes, while throughput and energy efficiency are superior to others in more heterogeneous situations. Comprehensive simulations demonstrate that the analysis results of these models match well with the simulation results.

Monte Carlo wave-packet approach to trace nuclear dynamics in molecular excited states by XUV-pump-IR-probe spectroscopy

NASA Astrophysics Data System (ADS)

Jing, Qingli; Bello, Roger Y.; Martín, Fernando; Palacios, Alicia; Madsen, Lars Bojer

2018-04-01

Recent research interests have been raised in uncovering and controlling ultrafast dynamics in excited neutral molecules. In this work we generalize the Monte Carlo wave packet (MCWP) approach to XUV-pump-IR-probe schemes to simulate the process of dissociative double ionization of H2 where singly excited states in H2 are involved. The XUV pulse is chosen to resonantly excite the initial ground state of H2 to the lowest excited electronic state of 1Σu + symmetry in H2 within the Franck-Condon region. The delayed intense IR pulse couples the excited states of 1Σu + symmetry with the nearby excited states of 1Σg + symmetry. It also induces the first ionization from H2 to H2 + and the second ionization from H2 + to H++H+. To reduce the computational costs in the MCWP approach, a sampling method is proposed to determine in time the dominant ionization events from H2 to H2+. By conducting a trajectory analysis, which is a unique possibility within the MCWP approach, the origins of the characteristic features in the nuclear kinetic energy release spectra are identified for delays ranging from 0 to 140 fs and the nuclear dynamics in the singly excited states in H2 is mapped out.

Improve the Communication, Decrease the Distance: The Investigation into Problematic Communication and Delays in Inter-Hospital Transfer of Rural Trauma Patients

ERIC Educational Resources Information Center

Avtgis, Theodore A.; Polack, E. Phillips; Martin, Matthew M.; Rossi, Daniel

2010-01-01

Time delays in the treatment and transfer of trauma patients is a contributing factor responsible for many fatalities. Time delays are more characteristic of rural trauma systems due to factors such as greater distance, and delays in accident reporting. Efforts to reduce the trauma transfer process have resulted in many changes in protocol and use…

Design of MOEMS adjustable optical delay line to reduce link set-up time in a tera-bit/s optical interconnection network.

PubMed

Jing, Wencai; Zhang, Yimo; Zhou, Ge

2002-07-15

A new structure for bit synchronization in a tera-bit/s optical interconnection network has been designed using micro-electro-mechanical system (MEMS) technique. Link multiplexing has been adopted to reduce data packet communication latency. To eliminate link set-up time, adjustable optical delay lines (AODLs) have been adopted to shift the phases of the distributed optical clock signals for bit synchronization. By changing the optical path distance of the optical clock signal, the phase of the clock signal can be shifted at a very high resolution. A phase-shift resolution of 0.1 ps can be easily achieved with 30-microm alternation of the optical path length in vacuum.

A Twin Study of Spatial and Non-Spatial Delayed Response Performance in Middle Age

ERIC Educational Resources Information Center

Kremen, William S.; Mai, Tuan; Panizzon, Matthew S.; Franz, Carol E.; Blankfeld, Howard M.; Xian, Hong; Eisen, Seth A.; Tsuang, Ming T.; Lyons, Michael J.

2011-01-01

Delayed alternation and object alternation are classic spatial and non-spatial delayed response tasks. We tested 632 middle-aged male veteran twins on variants of these tasks in order to compare test difficulty, measure their inter-correlation, test order effects, and estimate heritabilities (proportion of observed variance due to genetic…

The Role of the Atrial Electromechanical Delay in Predicting Atrial Fibrillation in Myotonic Dystrophy Type 1 Patients.

PubMed

Russo, Vincenzo; Rago, Anna; Ciardiello, Carmine; Russo, Maria Giovanna; Calabrò, Paolo; Politano, Luisa; Nigro, Gerardo

2016-01-01

Paroxysmal atrial tachyarrhythmias frequently occur in myotonic dystrophy type 1 (DM1) patients. The aim of the current study was to evaluate the atrial electromechanical-delay (AEMD) in a DM1-population with normal cardiac function and its relationship to atrial fibrillation (AF) onset. Fifty DM1 patients (28 male; mean age 34.2 ± 11.4 years) and 50 healthy subjects used as controls, matched for age and gender, were studied for the occurrence of atrial fibrillation during a 4-year follow-up, through 30-day external loop recorder (ELR) monitoring performed every 6 months. Intra-AEMD and inter-AEMD of both atrium were measured through tissue-Doppler echocardiography. Compared to the healthy control group, the DM1 group showed a statistically significant increase in inter-AEMD and intraleft-AEMD. Dividing the DM1-group into 2 subgroups (patients with or without AF), the inter-AEMD and intraleft-AEMD were significantly higher in the subgroup with AF compared to the subgroup without AF. A cut off value of 39.2 milliseconds for intraleft-AEMD had a sensitivity of 90% and a specificity of 90% in identifying DM1 patients with AF risk. A cut off value of 57.7 milliseconds for inter-AEMD had a sensitivity of 84.2% and a specificity of 93.5% in identifying this category of patients. Our results showed that the echocardiographic atrial electromechanical delay indices (intraleft and inter-AEMD) were significantly increased in DM1 subjects with normal cardiac function. Intraleft and inter-AEMD represent noninvasive, inexpensive, useful and simple parameters to assess the AF risk in DM1 patients. © 2015 Wiley Periodicals, Inc.

Expanding the Bandwidth of Slow and Fast Pulse Propagation in Coupled Micro-resonators

NASA Technical Reports Server (NTRS)

Smith, David D.; Chang, Hongrok

2007-01-01

Coupled resonators exhibit coherence effects which can be exploited for the delay or advancement of pulses with minimal distortion. The bandwidth and normalized pulse delay are simultaneously enhanced by proper choice of the inter-resonator couplings.

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

Delay-dependent coupling for a multi-agent LTI consensus system with inter-agent delays

NASA Astrophysics Data System (ADS)

Qiao, Wei; Sipahi, Rifat

2014-01-01

Delay-dependent coupling (DDC) is considered in this paper in a broadly studied linear time-invariant multi-agent consensus system in which agents communicate with each other under homogeneous delays, while attempting to reach consensus. The coupling among the agents is designed here as an explicit parameter of this delay, allowing couplings to autonomously adapt based on the delay value, and in order to guarantee stability and a certain degree of robustness in the network despite the destabilizing effect of delay. Design procedures, analysis of convergence speed of consensus, comprehensive numerical studies for the case of time-varying delay, and limitations are presented.

Temporal Traffic Dynamics Improve the Connectivity of Ad Hoc Cognitive Radio Networks

DTIC Science & Technology

2014-02-12

more packets to send, and are (re)born when they do. We could also consider this from a duty-cycling perspective: Nodes sleep and wake up...transmitting and receiving activities in the primary network in an intricate way, we obtain the MMD by considering a flooding scheme that tries every...consider the delay caused by scheduling, contention, or queuing. It can be shown that this flooding scheme gives us the MMD. We stress that flooding is used

A Delay-Aware and Reliable Data Aggregation for Cyber-Physical Sensing

PubMed Central

Zhang, Jinhuan; Long, Jun; Zhang, Chengyuan; Zhao, Guihu

2017-01-01

Physical information sensed by various sensors in a cyber-physical system should be collected for further operation. In many applications, data aggregation should take reliability and delay into consideration. To address these problems, a novel Tiered Structure Routing-based Delay-Aware and Reliable Data Aggregation scheme named TSR-DARDA for spherical physical objects is proposed. By dividing the spherical network constructed by dispersed sensor nodes into circular tiers with specifically designed widths and cells, TSTR-DARDA tries to enable as many nodes as possible to transmit data simultaneously. In order to ensure transmission reliability, lost packets are retransmitted. Moreover, to minimize the latency while maintaining reliability for data collection, in-network aggregation and broadcast techniques are adopted to deal with the transmission between data collecting nodes in the outer layer and their parent data collecting nodes in the inner layer. Thus, the optimization problem is transformed to minimize the delay under reliability constraints by controlling the system parameters. To demonstrate the effectiveness of the proposed scheme, we have conducted extensive theoretical analysis and comparisons to evaluate the performance of TSR-DARDA. The analysis and simulations show that TSR-DARDA leads to lower delay with reliability satisfaction. PMID:28218668

Relativistic features and time delay of laser-induced tunnel ionization

NASA Astrophysics Data System (ADS)

Yakaboylu, Enderalp; Klaiber, Michael; Bauke, Heiko; Hatsagortsyan, Karen Z.; Keitel, Christoph H.

2013-12-01

The electron dynamics in the classically forbidden region during relativistic tunnel ionization is investigated. The classical forbidden region in the relativistic regime is identified by defining a gauge-invariant total-energy operator. Introducing position-dependent energy levels inside the tunneling barrier, we demonstrate that the relativistic tunnel ionization can be well described by a one-dimensional intuitive picture. This picture predicts that, in contrast to the well-known nonrelativistic regime, the ionized electron wave packet arises with a momentum shift along the laser's propagation direction. This is compatible with results from a strong-field approximation calculation where the binding potential is assumed to be zero ranged. Further, the tunneling time delay, stemming from Wigner's definition, is investigated for model configurations of tunneling and compared with results obtained from the exact propagator. By adapting Wigner's time delay definition to the ionization process, the tunneling time is investigated in the deep-tunneling and in the near-threshold-tunneling regimes. It is shown that while in the deep-tunneling regime signatures of the tunneling time delay are not measurable at remote distance, they are detectable, however, in the latter regime.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamic global mapping of contended links

DOEpatents

Archer, Charles Jens [Rochester, MN; Musselman, Roy Glenn [Rochester, MN; Peters, Amanda [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Swartz, Brent Allen [Chippewa Falls, WI; Wallenfelt, Brian Paul [Eden Prairie, MN

2011-10-04

A massively parallel nodal computer system periodically collects and broadcasts usage data for an internal communications network. A node sending data over the network makes a global routing determination using the network usage data. Preferably, network usage data comprises an N-bit usage value for each output buffer associated with a network link. An optimum routing is determined by summing the N-bit values associated with each link through which a data packet must pass, and comparing the sums associated with different possible routes.

New generation of telemetry systems using CCSDS packetisation - A prototype implementation

NASA Astrophysics Data System (ADS)

Sotta, J. P.; Held, K.

1988-07-01

The system described herein was developed under ESA contract to support the introduction of new telemetry standards based on the packetized telemetry data concept. These standards were derived from recommendations in the frame of work of CCSDS, an inter-Agency committee that counts among its members most European National Agencies, ESA, NASA as well as Japanese NASDA, Indian ISRO and Brazilian INPE and having as objective to facilitate cross-support for space missions. The development is based on the present generation of ESA on-board equipment (OBDH) subsystem and is fully compatible with OBDH bus interfaces and transfer protocol.

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

An FEC Adaptive Multicast MAC Protocol for Providing Reliability in WLANs

NASA Astrophysics Data System (ADS)

Basalamah, Anas; Sato, Takuro

For wireless multicast applications like multimedia conferencing, voice over IP and video/audio streaming, a reliable transmission of packets within short delivery delay is needed. Moreover, reliability is crucial to the performance of error intolerant applications like file transfer, distributed computing, chat and whiteboard sharing. Forward Error Correction (FEC) is frequently used in wireless multicast to enhance Packet Error Rate (PER) performance, but cannot assure full reliability unless coupled with Automatic Repeat Request forming what is knows as Hybrid-ARQ. While reliable FEC can be deployed at different levels of the protocol stack, it cannot be deployed on the MAC layer of the unreliable IEEE802.11 WLAN due to its inability to exchange ACKs with multiple recipients. In this paper, we propose a Multicast MAC protocol that enhances WLAN reliability by using Adaptive FEC and study it's performance through mathematical analysis and simulation. Our results show that our protocol can deliver high reliability and throughput performance.

PRP: peripheral routing protocol for WSN realistic marginal mobility model

NASA Astrophysics Data System (ADS)

Tudorache, I. G.; Popescu, A. M.; Kemp, A. H.

2017-02-01

This article proposes a new routing protocol called Peripheral Routing Protocol (PRP) for the scenario where the mobile destination (D) moves at the wireless sensor network (WSN) periphery for gathering data. From a connectivity point of view, when D follows the marginal mobility model (MMM), the WSN becomes a hybrid network: a sparse network, because of the interrupted connectivity between D and the rest of the nodes and a well-connected network, because of the connectivity between all the other nodes of the WSN except D. It will be proven through MATLAB simulations that, for a military application scenario where D's connectivity to the WSN varies between 10% and 95%, compared with the 100% case, PRP outperforms routing protocols recommended for Mobile Ad-hoc Networks (MANET) in three ways: it maintains an average Packet Delivery Ratio (PDR) over 90%, a below 10% and 5% increase for the Average End to End Delay (AETED) and energy per transmitted packet.

Quality of Service for Real-Time Applications Over Next Generation Data Networks

NASA Technical Reports Server (NTRS)

Ivancic, William; Atiquzzaman, Mohammed; Bai, Haowei; Su, Hongjun; Jain, Raj; Duresi, Arjan; Goyal, Mukyl; Bharani, Venkata; Liu, Chunlei; Kota, Sastri

2001-01-01

This project, which started on January 1, 2000, was funded by NASA Glenn Research Center for duration of one year. The deliverables of the project included the following tasks: Study of QoS mapping between the edge and core networks envisioned in the Next Generation networks will provide us with the QoS guarantees that can be obtained from next generation networks. Buffer management techniques to provide strict guarantees to real-time end-to-end applications through preferential treatment to packets belonging to real-time applications. In particular, use of ECN to help reduce the loss on high bandwidth-delay product satellite networks needs to be studied. Effect of Prioritized Packet Discard to increase goodput of the network and reduce the buffering requirements in the ATM switches. Provision of new IP circuit emulation services over Satellite IP backbones using MPLS will be studied. Determine the architecture and requirements for internetworking ATN and the Next Generation Internet for real-time applications.

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.

Heralded wave packet manipulation and storage of a frequency-converted pair photon at telecom wavelength

NASA Astrophysics Data System (ADS)

Kroh, Tim; Ahlrichs, Andreas; Sprenger, Benjamin; Benson, Oliver

2017-09-01

Future quantum networks require a hybrid platform of dissimilar quantum systems. Within the platform, joint quantum states have to be mediated either by single photons, photon pairs or entangled photon pairs. The photon wavelength has to lie within the telecommunication band to enable long-distance fibre transmission. In addition, the temporal shape of the photons needs to be tailored to efficiently match the involved quantum systems. Altogether, this requires the efficient coherent wavelength-conversion of arbitrarily shaped single-photon wave packets. Here, we demonstrate the heralded temporal filtering of single photons as well as the synchronisation of state manipulation and detection as key elements in a typical experiment, besides of delaying a photon in a long fibre. All three are realised by utilising commercial telecommunication fibre-optical components which will permit the transition of quantum networks from the lab to real-world applications. The combination of these renders a temporally filtering single-photon storage in a fast switchable fibre loop possible.

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.

DRDT: distributed and reliable data transmission with cooperative nodes for lossy wireless sensor networks.

PubMed

Seo, Jaewan; Kim, Moonseong; Hur, In; Choi, Wook; Choo, Hyunseung

2010-01-01

Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks

PubMed Central

Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

2016-01-01

Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance. PMID:26927118

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks

PubMed Central

Eun, Yongsoon

2017-01-01

Underwater Acoustic Sensor Network (UASN) comes with intrinsic constraints because it is deployed in the aquatic environment and uses the acoustic signals to communicate. The examples of those constraints are long propagation delay, very limited bandwidth, high energy cost for transmission, very high signal attenuation, costly deployment and battery replacement, and so forth. Therefore, the routing schemes for UASN must take into account those characteristics to achieve energy fairness, avoid energy holes, and improve the network lifetime. The depth based forwarding schemes in literature use node’s depth information to forward data towards the sink. They minimize the data packet duplication by employing the holding time strategy. However, to avoid void holes in the network, they use two hop node proximity information. In this paper, we propose the Energy and Depth variance-based Opportunistic Void avoidance (EDOVE) scheme to gain energy balancing and void avoidance in the network. EDOVE considers not only the depth parameter, but also the normalized residual energy of the one-hop nodes and the normalized depth variance of the second hop neighbors. Hence, it avoids the void regions as well as balances the network energy and increases the network lifetime. The simulation results show that the EDOVE gains more than 15% packet delivery ratio, propagates 50% less copies of data packet, consumes less energy, and has more lifetime than the state of the art forwarding schemes. PMID:28954395

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks.

PubMed

Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

2016-02-26

Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes' collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance.

Surgery for "body packers"--a 15-year experience.

PubMed

Silverberg, Daniel; Menes, Tehillah; Kim, Unsup

2006-04-01

"Body packing" of illegal drugs has increased in the last decades, and with it our experience in treating these patients, yet no clear guidelines for surgical treatment are available. We examined the characteristics and outcomes of patients who required surgical intervention. Charts of all patients who underwent surgery at our institution for ingested drug packets between January 1990 and January 2005 were reviewed. Patients were identified by a pre-existing list of names collected prospectively and by admission codes. Reviewed parameters included presentation, method of diagnosis, indication for surgery, procedure, and patient outcome. Twenty-five patients were identified, for whom charts were available for review. Main indications for surgery were drug toxicity and small bowel obstruction. Most packets were retrieved using a combination of milking and multiple enterotomies. A high rate (40%) of postoperative wound infection was found. The incidence of wound infection correlated significantly with the number of enterotomies. Surgical intervention for body packing remains the treatment for a minority of these patients. Patients should be placed in lithotomy to facilitate the exposure of the entire gastrointestinal tract, and to allow milking of the packets and their possible retrieval through the anus. The number of enterotomies should be minimized in order to reduce the risk of wound infection. If multiple enterotomies are used, the surgeon should consider leaving the wound open for delayed closure.

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks.

PubMed

Bouk, Safdar Hussain; Ahmed, Syed Hassan; Park, Kyung-Joon; Eun, Yongsoon

2017-09-26

Underwater Acoustic Sensor Network (UASN) comes with intrinsic constraints because it is deployed in the aquatic environment and uses the acoustic signals to communicate. The examples of those constraints are long propagation delay, very limited bandwidth, high energy cost for transmission, very high signal attenuation, costly deployment and battery replacement, and so forth. Therefore, the routing schemes for UASN must take into account those characteristics to achieve energy fairness, avoid energy holes, and improve the network lifetime. The depth based forwarding schemes in literature use node's depth information to forward data towards the sink. They minimize the data packet duplication by employing the holding time strategy. However, to avoid void holes in the network, they use two hop node proximity information. In this paper, we propose the Energy and Depth variance-based Opportunistic Void avoidance (EDOVE) scheme to gain energy balancing and void avoidance in the network. EDOVE considers not only the depth parameter, but also the normalized residual energy of the one-hop nodes and the normalized depth variance of the second hop neighbors. Hence, it avoids the void regions as well as balances the network energy and increases the network lifetime. The simulation results show that the EDOVE gains more than 15 % packet delivery ratio, propagates 50 % less copies of data packet, consumes less energy, and has more lifetime than the state of the art forwarding schemes.

Delayed pneumothorax after stab wound to thorax and upper abdomen: Truth or myth?

PubMed

Zehtabchi, Shahriar; Morley, Eric J; Sajed, Dana; Greenberg, Oded; Sinert, Richard

2009-01-01

Stab wounds to the thorax and upper abdomen have the potential to cause pneumothorax (PTX). When a CXR (CXR) obtained during initial resuscitation is negative, a second CXR (CXR-2) is commonly performed with the goal of identifying delayed PTX. To assess the diagnostic yield of the CXR-2 in identifying delayed PTX. Prospective observational study of patients (age >or=13 years) with stab wounds to the thorax (chest/back) and upper abdomen with suspected PTX, in a level 1 trauma centre. Patients were included if they had a negative initial CXR followed by a repeat CXR 3-6h after the initial one. patients who died, were transferred out of the ED, or received chest tubes before the second CXR. The outcome of interest was delayed PTX. All CXR were read by an attending radiologist. To test the inter-observer agreement, another blinded radiologist reviewed 20% of CXR. Continuous data is presented as mean+/-standard deviation and categorical data as percentages with 95% confidence interval (CI). Kappa statistics were used to measure the inter-observer agreement between radiologists. Between January 2003 and December 2006 a total of 185 patients qualified for the enrollment (mean age: 28+/-10 years, age range: 13-65, 94% male). Only 2 patients (1.1%, 95% CI, 0.4- 4.1%) had PTX on the CXR-2. Both patients received chest tubes. The inter-observer agreement for radiology reports was high (kappa: 0.79). Occurrence of delayed PTX in patients with stab wounds to the thorax and upper abdomen and negative triage CXR is rare.

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.

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks †

PubMed Central

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-01-01

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor’s mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay. PMID:29077017

Fuzzy Logic-based Intelligent Scheme for Enhancing QoS of Vertical Handover Decision in Vehicular Ad-hoc Networks

NASA Astrophysics Data System (ADS)

Azzali, F.; Ghazali, O.; Omar, M. H.

2017-08-01

The design of next generation networks in various technologies under the “Anywhere, Anytime” paradigm offers seamless connectivity across different coverage. A conventional algorithm such as RSSThreshold algorithm, that only uses the received strength signal (RSS) as a metric, will decrease handover performance regarding handover latency, delay, packet loss, and handover failure probability. Moreover, the RSS-based algorithm is only suitable for horizontal handover decision to examine the quality of service (QoS) compared to the vertical handover decision in advanced technologies. In the next generation network, vertical handover can be started based on the user’s convenience or choice rather than connectivity reasons. This study proposes a vertical handover decision algorithm that uses a Fuzzy Logic (FL) algorithm, to increase QoS performance in heterogeneous vehicular ad-hoc networks (VANET). The study uses network simulator 2.29 (NS 2.29) along with the mobility traffic network and generator to implement simulation scenarios and topologies. This helps the simulation to achieve a realistic VANET mobility scenario. The required analysis on the performance of QoS in the vertical handover can thus be conducted. The proposed Fuzzy Logic algorithm shows improvement over the conventional algorithm (RSSThreshold) in the average percentage of handover QoS whereby it achieves 20%, 21% and 13% improvement on handover latency, delay, and packet loss respectively. This is achieved through triggering a process in layer two and three that enhances the handover performance.

SMAC: A soft MAC to reduce control overhead and latency in CDMA-based AMI networks

DOE PAGES

Garlapati, Shravan; Kuruganti, Teja; Buehrer, Michael R.; ...

2015-10-26

The utilization of state-of-the-art 3G cellular CDMA technologies in a utility owned AMI network results in a large amount of control traffic relative to data traffic, increases the average packet delay and hence are not an appropriate choice for smart grid distribution applications. Like the CDG, we consider a utility owned cellular like CDMA network for smart grid distribution applications and classify the distribution smart grid data as scheduled data and random data. Also, we propose SMAC protocol, which changes its mode of operation based on the type of the data being collected to reduce the data collection latency andmore » control overhead when compared to 3G cellular CDMA2000 MAC. The reduction in the data collection latency and control overhead aids in increasing the number of smart meters served by a base station within the periodic data collection interval, which further reduces the number of base stations needed by a utility or reduces the bandwidth needed to collect data from all the smart meters. The reduction in the number of base stations and/or the reduction in the data transmission bandwidth reduces the CAPital EXpenditure (CAPEX) and OPerational EXpenditure (OPEX) of the AMI network. Finally, the proposed SMAC protocol is analyzed using markov chain, analytical expressions for average throughput and average packet delay are derived, and simulation results are also provided to verify the analysis.« less

Detection of inter-turn short-circuit at start-up of induction machine based on torque analysis

NASA Astrophysics Data System (ADS)

Pietrowski, Wojciech; Górny, Konrad

2017-12-01

Recently, interest in new diagnostics methods in a field of induction machines was observed. Research presented in the paper shows the diagnostics of induction machine based on torque pulsation, under inter-turn short-circuit, during start-up of a machine. In the paper three numerical techniques were used: finite element analysis, signal analysis and artificial neural networks (ANN). The elaborated numerical model of faulty machine consists of field, circuit and motion equations. Voltage excited supply allowed to determine the torque waveform during start-up. The inter-turn short-circuit was treated as a galvanic connection between two points of the stator winding. The waveforms were calculated for different amounts of shorted-turns from 0 to 55. Due to the non-stationary waveforms a wavelet packet decomposition was used to perform an analysis of the torque. The obtained results of analysis were used as input vector for ANN. The response of the neural network was the number of shorted-turns in the stator winding. Special attention was paid to compare response of general regression neural network (GRNN) and multi-layer perceptron neural network (MLP). Based on the results of the research, the efficiency of the developed algorithm can be inferred.

Validation of the Dementia Care Assessment Packet-Instrumental Activities of Daily Living

PubMed Central

Lee, Seok Bum; Park, Jeong Ran; Yoo, Jeong-Hwa; Park, Joon Hyuk; Lee, Jung Jae; Yoon, Jong Chul; Jhoo, Jin Hyeong; Lee, Dong Young; Woo, Jong Inn; Han, Ji Won; Huh, Yoonseok; Kim, Tae Hui

2013-01-01

Objective We aimed to evaluate the psychometric properties of the IADL measure included in the Dementia Care Assessment Packet (DCAP-IADL) in dementia patients. Methods The study involved 112 dementia patients and 546 controls. The DCAP-IADL was scored in two ways: observed score (OS) and predicted score (PS). The reliability of the DCAP-IADL was evaluated by testing its internal consistency, inter-rater reliability and test-retest reliability. Discriminant validity was evaluated by comparing the mean OS and PS between dementia patients and controls by ANCOVA. Pearson or Spearman correlation analysis was performed with other instruments to assess concurrent validity. Receiver operating characteristics curve analysis was performed to examine diagnostic accuracy. Results Chronbach's α coefficients of the DCAP-IADL were above 0.7. The values in dementia patients were much higher (OS=0.917, PS=0.927), indicating excellent degrees of internal consistency. Inter-rater reliabilities and test-retest reliabilities were statistically significant (p<0.05). PS exhibited higher reliabilities than OS. The mean OS and PS of dementia patients were significantly higher than those of the non-demented group after controlling for age, sex and education level. The DCAP-IADL was significantly correlated with other IADL instruments and MMSE-KC (p<0.001). Areas under the curves of the DCAP-IADL were above 0.9. Conclusion The DCAP-IADL is a reliable and valid instrument for evaluating instrumental ability of daily living for the elderly, and may also be useful for screening dementia. Moreover, administering PS may enable the DCAP-IADL to overcome the differences in gender, culture and life style that hinders accurate evaluation of the elderly in previous IADL instruments. PMID:24302946

Evaluation of atrial electromechanical conduction delay in case of hemodynamically insignificant rheumatic heart disease: A tissue Doppler study.

PubMed

Cagdas, Metin; Velibey, Yalcin; Guvenc, Tolga Sinan; Gungor, Baris; Guzelburc, Ozge; Calik, Nazmi; Ugur, Murat; Tekkesin, Ahmet Ilker; Gurkan, Kadir; Eren, Mehmet

2015-01-01

Atrial electromechanical delay (AEMD) that reflects delayed conduction may show us the clinical reflection of pathological changes in the atria. The main objective of the present study is to investigate AEMD in patients who had previous rheumatic carditis but without hemodynamically significant valvular disease. A total of 40 patients, previously diagnosed as rheumatic carditis but without significant valvular stenosis/regurgitation and atrial enlargement; and 39 age- and-sex matched controls were enrolled for the present study. Parameters of AEMD (lateral mitral annulus electromechanical delay, septal mitral annulus electromechanical delay and lateral tricuspid annulus electromechanical delay) were measured with tissue Doppler echocardiography and left intra-atrial and inter-atrial conduction times were calculated accordingly. A 24h ambulatory Holter monitoring was used in both groups to detect atrial fibrillation episodes and quantify atrial extrasystoles. Parameters of AEMD, including left intra-atrial and inter-atrial conduction times of subjects in the study group were longer compared to the control group (23.7 ± 7.0 vs. 18.3 ± 6.2). Increased AEMD is observed in patients with previous rheumatic carditis and no significant valvular stenosis/regurgitation and atrial enlargement, which may partly explain the increased incidence of atrial fibrillation observed in these patients.

Impact of packet losses in scalable 3D holoscopic video coding

NASA Astrophysics Data System (ADS)

Conti, Caroline; Nunes, Paulo; Ducla Soares, Luís.

2014-05-01

Holoscopic imaging became a prospective glassless 3D technology to provide more natural 3D viewing experiences to the end user. Additionally, holoscopic systems also allow new post-production degrees of freedom, such as controlling the plane of focus or the viewing angle presented to the user. However, to successfully introduce this technology into the consumer market, a display scalable coding approach is essential to achieve backward compatibility with legacy 2D and 3D displays. Moreover, to effectively transmit 3D holoscopic content over error-prone networks, e.g., wireless networks or the Internet, error resilience techniques are required to mitigate the impact of data impairments in the user quality perception. Therefore, it is essential to deeply understand the impact of packet losses in terms of decoding video quality for the specific case of 3D holoscopic content, notably when a scalable approach is used. In this context, this paper studies the impact of packet losses when using a three-layer display scalable 3D holoscopic video coding architecture previously proposed, where each layer represents a different level of display scalability (i.e., L0 - 2D, L1 - stereo or multiview, and L2 - full 3D holoscopic). For this, a simple error concealment algorithm is used, which makes use of inter-layer redundancy between multiview and 3D holoscopic content and the inherent correlation of the 3D holoscopic content to estimate lost data. Furthermore, a study of the influence of 2D views generation parameters used in lower layers on the performance of the used error concealment algorithm is also presented.

Generalized Ehrenfest Relations, Deformation Quantization, and the Geometry of Inter-model Reduction

NASA Astrophysics Data System (ADS)

Rosaler, Joshua

2018-03-01

This study attempts to spell out more explicitly than has been done previously the connection between two types of formal correspondence that arise in the study of quantum-classical relations: one the one hand, deformation quantization and the associated continuity between quantum and classical algebras of observables in the limit \\hbar → 0, and, on the other, a certain generalization of Ehrenfest's Theorem and the result that expectation values of position and momentum evolve approximately classically for narrow wave packet states. While deformation quantization establishes a direct continuity between the abstract algebras of quantum and classical observables, the latter result makes in-eliminable reference to the quantum and classical state spaces on which these structures act—specifically, via restriction to narrow wave packet states. Here, we describe a certain geometrical re-formulation and extension of the result that expectation values evolve approximately classically for narrow wave packet states, which relies essentially on the postulates of deformation quantization, but describes a relationship between the actions of quantum and classical algebras and groups over their respective state spaces that is non-trivially distinct from deformation quantization. The goals of the discussion are partly pedagogical in that it aims to provide a clear, explicit synthesis of known results; however, the particular synthesis offered aspires to some novelty in its emphasis on a certain general type of mathematical and physical relationship between the state spaces of different models that represent the same physical system, and in the explicitness with which it details the above-mentioned connection between quantum and classical models.

The role of the atrial electromechanical delay in predicting atrial fibrillation in beta-thalassemia major patients.

PubMed

Rago, Anna; Russo, Vincenzo; Papa, Andrea Antonio; Ciardiello, Carmine; Pannone, Bruno; Mayer, Maria Carolina; Cimmino, Giovanni; Nigro, Gerardo

2017-03-01

Paroxysmal atrial tachyarrhythmias frequently occur in beta-thalassemia major (β-TM) patients. The aim of the current study was to evaluate the atrial electromechanical delay (AEMD) in a large β-TM population with normal cardiac function and its relationship to atrial fibrillation (AF) onset. Eighty β-TM patients (44 men, 36 women), with a mean age of 36.2 ± 11.1 years, and 80 healthy subjects used as controls, matched for age and gender, were studied for the occurrence of AF during a 5-year follow-up, through 30-day external loop recorder (ELR) monitoring performed every 6 months. Intra-AEMD and inter-AEMD of both atria were measured through tissue Doppler echocardiography. P-wave dispersion (PD) was carefully measured using 12-lead electrocardiogram (ECG). Compared to the healthy control group, the β-TM patients showed a statistically significant increase in inter-AEMD, intra-left AEMD, maximum P-wave duration, and PD. Dividing the β-TM group into two subgroups (patients with or without AF), the inter-AEMD, intra-left AEMD, maximum P-wave duration, and PD were significantly higher in the subgroup with AF compared to the subgroup without AF. There were significant good correlations of intra-left AEMD and inter-AEMD with PD. A cut-off value of 40.1 ms for intra-left AEMD had a sensitivity of 76.2% and a specificity of 97.5% in identifying β-TM patients with AF risk. A cut-off value of 44.8 ms for inter-AEMD had a sensitivity of 81.2% and a specificity of 98.7% in identifying this category of patients. Our results showed that the echocardiographic atrial electromechanical delay indices (intra-left and inter-AEMD) and the PD were significantly increased in β-TM subjects with normal cardiac function. PD and AEMD represent non-invasive, inexpensive, useful, and simple parameters to assess the AF risk in β-TM patients.

A knowledge-based system with learning for computer communication network design

NASA Technical Reports Server (NTRS)

Pierre, Samuel; Hoang, Hai Hoc; Tropper-Hausen, Evelyne

1990-01-01

Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay.

Networked control of microgrid system of systems

NASA Astrophysics Data System (ADS)

Mahmoud, Magdi S.; Rahman, Mohamed Saif Ur; AL-Sunni, Fouad M.

2016-08-01

The microgrid has made its mark in distributed generation and has attracted widespread research. However, microgrid is a complex system which needs to be viewed from an intelligent system of systems perspective. In this paper, a network control system of systems is designed for the islanded microgrid system consisting of three distributed generation units as three subsystems supplying a load. The controller stabilises the microgrid system in the presence of communication infractions such as packet dropouts and delays. Simulation results are included to elucidate the effectiveness of the proposed control strategy.

SCPS-TP, TCP, and Rate-Based Protocol Evaluation. Revised

NASA Technical Reports Server (NTRS)

Tran, Diepchi T.; Lawas-Grodek, Frances J.; Dimond, Robert P.; Ivancic, William D.

2005-01-01

Tests were performed at Glenn Research Center to compare the performance of the Space Communications Protocol Standard Transport Protocol (SCPS TP, otherwise known as "TCP Tranquility") relative to other variants of TCP and to determine the implementation maturity level of these protocols, particularly for higher speeds. The testing was performed over reasonably high data rates of up to 100 Mbps with delays that are characteristic of near-planetary environments. The tests were run for a fixed packet size, but for variously errored environments. This report documents the testing performed to date.

UWB dual burst transmit driver

DOEpatents

Dallum, Gregory E [Livermore, CA; Pratt, Garth C [Discovery Bay, CA; Haugen, Peter C [Livermore, CA; Zumstein, James M [Livermore, CA; Vigars, Mark L [Livermore, CA; Romero, Carlos E [Livermore, CA

2012-04-17

A dual burst transmitter for ultra-wideband (UWB) communication systems generates a pair of precisely spaced RF bursts from a single trigger event. An input trigger pulse produces two oscillator trigger pulses, an initial pulse and a delayed pulse, in a dual trigger generator. The two oscillator trigger pulses drive a gated RF burst (power output) oscillator. A bias driver circuit gates the RF output oscillator on and off and sets the RF burst packet width. The bias driver also level shifts the drive signal to the level that is required for the RF output device.

Inter-facility transfer of surgical emergencies in a developing country: effects on management and surgical outcomes.

PubMed

Khan, Salma; Zafar, Hasnain; Zafar, Syed Nabeel; Haroon, Naveed

2014-02-01

Outcomes of surgical emergencies are associated with promptness of the appropriate surgical intervention. However, delayed presentation of surgical patients is common in most developing countries. Delays commonly occur due to transfer of patients between facilities. The aim of the present study was to assess the effect of delays in treatment caused by inter-facility transfers of patients presenting with surgical emergencies as measured by objective and subjective parameters. We prospectively collected data on all patients presenting with an acute surgical emergency at Aga Khan University Hospital (AKUH). Information regarding demographics, social class, reason and number of transfers, and distance traveled were collected. Patients were categorized into two groups, those transferred to AKUH from another facility (transferred) and direct arrivals (non-transfers). Differences between presenting physiological parameters, vital statistics, and management were tested between the two groups by the chi square and t tests. Ninety-nine patients were included, 49 (49.5 %) patients having been transferred from another facility. The most common reason for transfer was "lack of satisfactory surgical care." There were significant differences in presenting pulse, oxygen saturation, respiratory rate, fluid for resuscitation, glasgow coma scale, and revised trauma score (all p values <0.001) between transferred and non-transferred patients. In 56 patients there was a further delay in admission, and the most common reason was bed availability, followed by financial constraints. Three patients were shifted out of the hospital due to lack of ventilator, and 14 patients left against medical advice due to financial limitations. One patient died. Inter-facility transfer of patients with surgical emergencies is common. These patients arrive with deranged physiology which requires complex and prolonged hospital care. Patients who cannot afford treatment are most vulnerable to transfers and delays.

Preparing isolated vibrational wave packets with light-induced molecular potentials by chirped laser pulses

NASA Astrophysics Data System (ADS)

Vatasescu, Mihaela

2012-05-01

We consider a specific wave packet preparation arising from the control of tunneling in the 0g-(6s,6p3/2) double well potential of a Cs2 cold molecule with chirped laser pulses. Such a possibility to manipulate the population dynamics in the 0g-(6s,6p3/2) potential appears in a pump-dump scheme designed to form cold molecules by photoassociation of two cold cesium atoms. The initial population in the 0g-(6s,6p3/2) double well is a wave packet prepared in the outer well at large interatomic distances (94 a0) by a photoassociation step with a first chirped pulse, being a superposition of several vibrational states whose energies surround the energy of a tunneling resonance. Our present work is focused on a second delayed chirped pulse, coupling the 0g-(6s,6p3/2) surface with the a3Σu+(6s,6s) one in the zone of the double well barrier (15 a0) and creating deeply bound cold molecules in the a3Σu+(6s,6s) state. We explore the parameters choice (intensity, duration, chirp rate and sign) for this second pulse, showing that picoseconds pulses with a negative chirp can lead to trapping of population in the inner well in strongly bound vibrational states, out of the resonant tunneling able to transfer it back to the outer well.

A Decentralized Event-Triggered Dissipative Control Scheme for Systems With Multiple Sensors to Sample the System Outputs.

PubMed

Zhang, Xian-Ming; Han, Qing-Long

2016-12-01

This paper is concerned with decentralized event-triggered dissipative control for systems with the entries of the system outputs having different physical properties. Depending on these different physical properties, the entries of the system outputs are grouped into multiple nodes. A number of sensors are used to sample the signals from different nodes. A decentralized event-triggering scheme is introduced to select those necessary sampled-data packets to be transmitted so that communication resources can be saved significantly while preserving the prescribed closed-loop performance. First, in order to organize the decentralized data packets transmitted from the sensor nodes, a data packet processor (DPP) is used to generate a new signal to be held by the zero-order-hold once the signal stored by the DPP is updated at some time instant. Second, under the mechanism of the DPP, the resulting closed-loop system is modeled as a linear system with an interval time-varying delay. A sufficient condition is derived such that the closed-loop system is asymptotically stable and strictly (Q 0 ,S 0 ,R 0 ) -dissipative, where Q 0 ,S 0 , and R 0 are real matrices of appropriate dimensions with Q 0 and R 0 symmetric. Third, suitable output-based controllers can be designed based on solutions to a set of a linear matrix inequality. Finally, two examples are given to demonstrate the effectiveness of the proposed method.

Launch Support Video Site

NASA Technical Reports Server (NTRS)

OFarrell, Zachary L.

2013-01-01

The goal of this project is to create a website that displays video, countdown clock, and event times to customers during launches, without needing to be connected to the internal operations network. The requirements of this project are to also minimize the delay in the clock and events to be less than two seconds. The two parts of this are the webpage, which will display the data and videos to the user, and a server to send clock and event data to the webpage. The webpage is written in HTML with CSS and JavaScript. The JavaScript is responsible for connecting to the server, receiving new clock data, and updating the webpage. JavaScript is used for this because it can send custom HTTP requests from the webpage, and provides the ability to update parts of the webpage without having to refresh the entire page. The server application will act as a relay between the operations network, and the open internet. On the operations network side, the application receives multicast packets that contain countdown clock and events data. It will then parse the data into current countdown times and events, and create a packet with that information that can be sent to webpages. The other part will accept HTTP requests from the webpage, and respond to them with current data. The server is written in C# with some C++ files used to define the structure of data packets. The videos for the webpage will be shown in an embedded player from UStream.

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.

Optimal route discovery for soft QOS provisioning in mobile ad hoc multimedia networks

NASA Astrophysics Data System (ADS)

Huang, Lei; Pan, Feng

2007-09-01

In this paper, we propose an optimal routing discovery algorithm for ad hoc multimedia networks whose resource keeps changing, First, we use stochastic models to measure the network resource availability, based on the information about the location and moving pattern of the nodes, as well as the link conditions between neighboring nodes. Then, for a certain multimedia packet flow to be transmitted from a source to a destination, we formulate the optimal soft-QoS provisioning problem as to find the best route that maximize the probability of satisfying its desired QoS requirements in terms of the maximum delay constraints. Based on the stochastic network resource model, we developed three approaches to solve the formulated problem: A centralized approach serving as the theoretical reference, a distributed approach that is more suitable to practical real-time deployment, and a distributed dynamic approach that utilizes the updated time information to optimize the routing for each individual packet. Examples of numerical results demonstrated that using the route discovered by our distributed algorithm in a changing network environment, multimedia applications could achieve better QoS statistically.

Mobility based key management technique for multicast security in mobile ad hoc networks.

PubMed

Madhusudhanan, B; Chitra, S; Rajan, C

2015-01-01

In MANET multicasting, forward and backward secrecy result in increased packet drop rate owing to mobility. Frequent rekeying causes large message overhead which increases energy consumption and end-to-end delay. Particularly, the prevailing group key management techniques cause frequent mobility and disconnections. So there is a need to design a multicast key management technique to overcome these problems. In this paper, we propose the mobility based key management technique for multicast security in MANET. Initially, the nodes are categorized according to their stability index which is estimated based on the link availability and mobility. A multicast tree is constructed such that for every weak node, there is a strong parent node. A session key-based encryption technique is utilized to transmit a multicast data. The rekeying process is performed periodically by the initiator node. The rekeying interval is fixed depending on the node category so that this technique greatly minimizes the rekeying overhead. By simulation results, we show that our proposed approach reduces the packet drop rate and improves the data confidentiality.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network

PubMed Central

Ahmed, Farwa; Wadud, Zahid; Alrajeh, Nabil; Alabed, Mohamad Souheil

2018-01-01

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio. PMID:29614794

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network.

PubMed

Ahmed, Farwa; Wadud, Zahid; Javaid, Nadeem; Alrajeh, Nabil; Alabed, Mohamad Souheil; Qasim, Umar

2018-04-02

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

2016-05-01

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

Assessment of the atrial electromechanical properties of patients with human immunodeficiency virus.

PubMed

Ertem, Ahmet G; Yayla, Çağrı; Açar, Burak; Ünal, Sefa; Erdol, Mehmet A; Sonmezer, Meliha Ç; Kaya Kiliç, Esra; Ataman Hatipoglu, Çiğdem; Gokaslan, Serkan; Kafes, Habibe; Akboga, Mehmet K; Aladag, Pelin; Demirtas, Koray; Tulek, Necla; Erdinç, Fatma S; Aydogdu, Sinan

The relationship between atrial fibrillation and human immunodeficiency virus (HIV) infection was evaluated. Electro-echocardiographic methods can be used to predict the development of atrial fibrillation (AF). In this study, we aimed to investigate the atrial electromechanical delay (AEMD) parameters of HIV (+) patients. Forty-two HIV (+) patients and 40 HIV (-) healthy volunteers were prospectively enrolled in this study. The electromechanical properties of the subjects' atria were evaluated with tissue Doppler imaging. The left-AEMD, right-AEMD and inter-AEMD were increased in the HIV (+) patients relative to the controls (p=0.003, p<0.001, and p<0.001, respectively). The CD4 count was inversely correlated with the inter-AEMD (r=-0.428, p<0.001). The CD4 count was an independent predictor of the inter-AEMD (β=0.523, p=0.007). Our study demonstrated that both the inter- and intra-atrial electromechanical delays were prolonged in the patients with HIV. This non-invasive and simple technique may provide significant contributions to the assessment of the risk of atrial arrhythmia in patients with HIV. Copyright © 2017 The Authors. Published by Elsevier Ltd.. All rights reserved.

Long-Term Anabolic Androgenic Steroid Use Is Associated with Increased Atrial Electromechanical Delay in Male Bodybuilders

PubMed Central

Akçakoyun, Mustafa; Gündoğdu, Recep; Bulut, Mustafa; Tabakcı, Mehmet Mustafa; Açar, Göksel; Avcı, Anıl; Şimşek, Zeki; Demir, Serdar; Kargın, Ramazan; Emiroğlu, Mehmet Yunus

2014-01-01

We investigated the effect of long-term supraphysiologic doses of anabolic androgenic steroids (AAS) on atrial electromechanical delay (AEMD) in male bodybuilders. We clearly demonstrated that long-term consumption of supraphysiologic doses of AAS is associated with higher values of inter- and intra-AEMD in healthy young bodybuilders. PMID:24883314

77 FR 47158 - Self-Regulatory Organizations; NASDAQ OMX BX, Inc.; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-07

... not be displayed,\\3\\ a change that will improve system and inter-market price stability. The display... Delay the Implementation Date of Non-Display of Primary Pegged Orders With an Offset Amount August 1... Proposed Rule Change The Exchange proposes a rule change to delay the implementation date for its rule...

77 FR 41845 - Self-Regulatory Organizations; The NASDAQ Stock Market LLC; Notice of Filing and Immediate...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-16

... improve system and inter-market price stability. In order to implement this change contemporaneous with... Proposed Rule Change To Delay the Implementation Date for Non-Display of Primary Pegged Orders With an... Exchange proposes a rule change to delay the implementation date for its rule change that provides for non...

Production of Basic Emotions by Children with Congenital Blindness: Evidence for the Embodiment of Theory of Mind

ERIC Educational Resources Information Center

Roch-Levecq, Anne-Catherine

2006-01-01

Children with congenital blindness are delayed in understanding other people's minds. The present study examined whether this delay was related to a more primitive form of inter-subjectivity by which infants draw correspondence between parental mirroring of the infant's display and proprioceptive sensations. Twenty children with congenital…

Packet Fragmentation and Reassembly in Molecular Communication.

PubMed

Furubayashi, Taro; Nakano, Tadashi; Eckford, Andrew; Okaie, Yutaka; Yomo, Tetsuya

2016-04-01

This paper describes packet fragmentation and reassembly to achieve reliable molecular communication among bionanomachines. In the molecular communication described in this paper, a sender bionanomachine performs packet fragmentation, dividing a large molecular message into smaller pieces and embedding into smaller molecular packets, so that molecular packets have higher diffusivity to reach the receiver bionanomachine. The receiver bionanomachine then performs packet reassembly to retrieve the original molecular message from a set of molecular packets that it receives. To examine the effect of packet fragmentation and reassembly, we develop analytical models and conduct numerical experiments. Numerical results show that packet fragmentation and reassembly can improve the message delivery performance. Numerical results also indicate that packet fragmentation and reassembly may degrade the performance in the presence of drift in the environment.

A novel lost packets recovery scheme based on visual secret sharing

NASA Astrophysics Data System (ADS)

Lu, Kun; Shan, Hong; Li, Zhi; Niu, Zhao

2017-08-01

In this paper, a novel lost packets recovery scheme which encrypts the effective parts of an original packet into two shadow packets based on (2, 2)-threshold XOR-based visual Secret Sharing (VSS) is proposed. The two shadow packets used as watermarks would be embedded into two normal data packets with digital watermarking embedding technology and then sent from one sensor node to another. Each shadow packet would reveal no information of the original packet, which can improve the security of original packet delivery greatly. The two shadow packets which can be extracted from the received two normal data packets delivered from a sensor node can recover the original packet lossless based on XOR-based VSS. The Performance analysis present that the proposed scheme provides essential services as long as possible in the presence of selective forwarding attack. The proposed scheme would not increase the amount of additional traffic, namely, lower energy consumption, which is suitable for Wireless Sensor Network (WSN).

Extensible packet processing architecture

DOEpatents

Robertson, Perry J.; Hamlet, Jason R.; Pierson, Lyndon G.; Olsberg, Ronald R.; Chun, Guy D.

2013-08-20

A technique for distributed packet processing includes sequentially passing packets associated with packet flows between a plurality of processing engines along a flow through data bus linking the plurality of processing engines in series. At least one packet within a given packet flow is marked by a given processing engine to signify by the given processing engine to the other processing engines that the given processing engine has claimed the given packet flow for processing. A processing function is applied to each of the packet flows within the processing engines and the processed packets are output on a time-shared, arbitered data bus coupled to the plurality of processing engines.

Carrier frequency offset estimation for an acoustic-electric channel using 16 QAM modulation

NASA Astrophysics Data System (ADS)

Cunningham, Michael T.; Anderson, Leonard A.; Wilt, Kyle R.; Chakraborty, Soumya; Saulnier, Gary J.; Scarton, Henry A.

2016-05-01

Acoustic-electric channels can be used to send data through metallic barriers, enabling communications where electromagnetic signals are ineffective. This paper considers an acoustic-electric channel that is formed by mounting piezoelectric transducers on metallic barriers that are separated by a thin water layer. The transducers are coupled to the barriers using epoxy and the barriers are positioned to axially-align the PZTs, maximizing energy transfer efficiency. The electrical signals are converted by the transmitting transducers into acoustic waves, which propagate through the elastic walls and water medium to the receiving transducers. The reverberation of the acoustic signals in these channels can produce multipath distortion with a significant delay spread that introduces inter-symbol interference (ISI) into the received signal. While the multipath effects can be severe, the channel does not change rapidly which makes equalization easier. Here we implement a 16-QAM system on this channel, including a method for obtaining accurate carrier frequency offset (CFO) estimates in the presence of the quasi-static multipath propagation. A raised-power approach is considered but found to suffer from excessive data noise resulting from the ISI. An alternative approach that utilizes a pilot tone burst at the start of a data packet is used for CFO estimation and found to be effective. The autocorrelation method is used to estimate the frequency of the received burst. A real-time prototype of the 16 QAM system that uses a Texas Instruments MSP430 microcontroller-based transmitter and a personal computer-based receiver is presented along with performance results.

Applications of surface acoustic and shallow bulk acoustic wave devices

NASA Astrophysics Data System (ADS)

Campbell, Colin K.

1989-10-01

Surface acoustic wave (SAW) device coverage includes delay lines and filters operating at selected frequencies in the range from about 10 MHz to 11 GHz; modeling with single-crystal piezoelectrics and layered structures; resonators and low-loss filters; comb filters and multiplexers; antenna duplexers; harmonic devices; chirp filters for pulse compression; coding with fixed and programmable transversal filters; Barker and quadraphase coding; adaptive filters; acoustic and acoustoelectric convolvers and correlators for radar, spread spectrum, and packet radio; acoustooptic processors for Bragg modulation and spectrum analysis; real-time Fourier-transform and cepstrum processors for radar and sonar; compressive receivers; Nyquist filters for microwave digital radio; clock-recovery filters for fiber communications; fixed-, tunable-, and multimode oscillators and frequency synthesizers; acoustic charge transport; and other SAW devices for signal processing on gallium arsenide. Shallow bulk acoustic wave device applications include gigahertz delay lines, surface-transverse-wave resonators employing energy-trapping gratings, and oscillators with enhanced performance and capability.

Coherent Optical Memory with High Storage Efficiency and Large Fractional Delay

NASA Astrophysics Data System (ADS)

Chen, Yi-Hsin; Lee, Meng-Jung; Wang, I.-Chung; Du, Shengwang; Chen, Yong-Fan; Chen, Ying-Cheng; Yu, Ite A.

2013-02-01

A high-storage efficiency and long-lived quantum memory for photons is an essential component in long-distance quantum communication and optical quantum computation. Here, we report a 78% storage efficiency of light pulses in a cold atomic medium based on the effect of electromagnetically induced transparency. At 50% storage efficiency, we obtain a fractional delay of 74, which is the best up-to-date record. The classical fidelity of the recalled pulse is better than 90% and nearly independent of the storage time, as confirmed by the direct measurement of phase evolution of the output light pulse with a beat-note interferometer. Such excellent phase coherence between the stored and recalled light pulses suggests that the current result may be readily applied to single photon wave packets. Our work significantly advances the technology of electromagnetically induced transparency-based optical memory and may find practical applications in long-distance quantum communication and optical quantum computation.

Coherent optical memory with high storage efficiency and large fractional delay.

PubMed

Chen, Yi-Hsin; Lee, Meng-Jung; Wang, I-Chung; Du, Shengwang; Chen, Yong-Fan; Chen, Ying-Cheng; Yu, Ite A

2013-02-22

A high-storage efficiency and long-lived quantum memory for photons is an essential component in long-distance quantum communication and optical quantum computation. Here, we report a 78% storage efficiency of light pulses in a cold atomic medium based on the effect of electromagnetically induced transparency. At 50% storage efficiency, we obtain a fractional delay of 74, which is the best up-to-date record. The classical fidelity of the recalled pulse is better than 90% and nearly independent of the storage time, as confirmed by the direct measurement of phase evolution of the output light pulse with a beat-note interferometer. Such excellent phase coherence between the stored and recalled light pulses suggests that the current result may be readily applied to single photon wave packets. Our work significantly advances the technology of electromagnetically induced transparency-based optical memory and may find practical applications in long-distance quantum communication and optical quantum computation.

Control of electron excitation and localization in the dissociation of H2(+) and its isotopes using two sequential ultrashort laser pulses.

PubMed

He, Feng; Ruiz, Camilo; Becker, Andreas

2007-08-24

We study the control of dissociation of the hydrogen molecular ion and its isotopes exposed to two ultrashort laser pulses by solving the time-dependent Schrödinger equation. While the first ultraviolet pulse is used to excite the electron wave packet on the dissociative 2psigma{u} state, a second time-delayed near-infrared pulse steers the electron between the nuclei. Our results show that by adjusting the time delay between the pulses and the carrier-envelope phase of the near-infrared pulse, a high degree of control over the electron localization on one of the dissociating nuclei can be achieved (in about 85% of all fragmentation events). The results demonstrate that current (sub-)femtosecond technology can provide a control over both electron excitation and localization in the fragmentation of molecules.

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

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

Papantoni-Kazakos, P.; Paterakis, M.

1988-07-01

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

Protocol to Exploit Waiting Resources for UASNs.

PubMed

Hung, Li-Ling; Luo, Yung-Jeng

2016-03-08

The transmission speed of acoustic waves in water is much slower than that of radio waves in terrestrial wireless sensor networks. Thus, the propagation delay in underwater acoustic sensor networks (UASN) is much greater. Longer propagation delay leads to complicated communication and collision problems. To solve collision problems, some studies have proposed waiting mechanisms; however, long waiting mechanisms result in low bandwidth utilization. To improve throughput, this study proposes a slotted medium access control protocol to enhance bandwidth utilization in UASNs. The proposed mechanism increases communication by exploiting temporal and spatial resources that are typically idle in order to protect communication against interference. By reducing wait time, network performance and energy consumption can be improved. A performance evaluation demonstrates that when the data packets are large or sensor deployment is dense, the energy consumption of proposed protocol is less than that of existing protocols as well as the throughput is higher than that of existing protocols.

Method and Apparatus for Processing UDP Data Packets

NASA Technical Reports Server (NTRS)

Murphy, Brandon M. (Inventor)

2017-01-01

A method and apparatus for processing a plurality of data packets. A data packet is received. A determination is made as to whether a portion of the data packet follows a selected digital recorder standard protocol based on a header of the data packet. Raw data in the data packet is converted into human-readable information in response to a determination that the portion of the data packet follows the selected digital recorder standard protocol.

Performance of gigabit FDDI

NASA Technical Reports Server (NTRS)

Game, David; Maly, Kurt J.

1990-01-01

Great interest exists in developing high speed protocols which will be able to support data rates at gigabit speeds. Hardware currently exists which can experimentally transmit at data rates exceeding a gigabit per second, but it is not clear as to what types of protocols will provide the best performance. One possibility is to examine current protocols and their extensibility to these speeds. Scaling of Fiber Distributed Data Interface (FDDI) to gigabit speeds is studied. More specifically, delay statistics are included to provide insight as to which parameters (network length, packet length or number of nodes) have the greatest effect on performance.

Power-Constrained Fuzzy Logic Control of Video Streaming over a Wireless Interconnect

NASA Astrophysics Data System (ADS)

Razavi, Rouzbeh; Fleury, Martin; Ghanbari, Mohammed

2008-12-01

Wireless communication of video, with Bluetooth as an example, represents a compromise between channel conditions, display and decode deadlines, and energy constraints. This paper proposes fuzzy logic control (FLC) of automatic repeat request (ARQ) as a way of reconciling these factors, with a 40% saving in power in the worst channel conditions from economizing on transmissions when channel errors occur. Whatever the channel conditions are, FLC is shown to outperform the default Bluetooth scheme and an alternative Bluetooth-adaptive ARQ scheme in terms of reduced packet loss and delay, as well as improved video quality.

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).

77 FR 47159 - Self-Regulatory Organizations; NASDAQ OMX PHLX LLC; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-07

... offset amount will not be displayed,\\3\\ a change to improve system and inter-market price stability. The... Change To Delay the Implementation of Non-Display of Primary Pegged Orders With an Offset Amount August 1... Proposed Rule Change The Exchange proposes a rule change to delay the implementation date for its rule...

A Neurodevelopmental Profile of the Rural Hearing-Impaired Child in the QwaQwa Region, South Africa

ERIC Educational Resources Information Center

Bothma, Jó-Marié v. d. M.; Dunn, Munita; Kokot, Shirley

2015-01-01

Being hearing impaired does not only affect a child's academic performance, but can also influence a child's overall development and ability to succeed academically. Children with hearing impairment often experience delays in other areas of their development and an understanding of the inter-relatedness of these delays are important in order to…

Packet flow monitoring tool and method

DOEpatents

Thiede, David R [Richland, WA

2009-07-14

A system and method for converting packet streams into session summaries. Session summaries are a group of packets each having a common source and destination internet protocol (IP) address, and, if present in the packets, common ports. The system first captures packets from a transport layer of a network of computer systems, then decodes the packets captured to determine the destination IP address and the source IP address. The system then identifies packets having common destination IP addresses and source IP addresses, then writes the decoded packets to an allocated memory structure as session summaries in a queue.

I/O routing in a multidimensional torus network

DOEpatents

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

2017-02-07

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

I/O routing in a multidimensional torus network

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

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destinationmore » address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.« less

Estimating TCP Packet Loss Ratio from Sampled ACK Packets

NASA Astrophysics Data System (ADS)

Yamasaki, Yasuhiro; Shimonishi, Hideyuki; Murase, Tutomu

The advent of various quality-sensitive applications has greatly changed the requirements for IP network management and made the monitoring of individual traffic flows more important. Since the processing costs of per-flow quality monitoring are high, especially in high-speed backbone links, packet sampling techniques have been attracting considerable attention. Existing sampling techniques, such as those used in Sampled NetFlow and sFlow, however, focus on the monitoring of traffic volume, and there has been little discussion of the monitoring of such quality indexes as packet loss ratio. In this paper we propose a method for estimating, from sampled packets, packet loss ratios in individual TCP sessions. It detects packet loss events by monitoring duplicate ACK events raised by each TCP receiver. Because sampling reveals only a portion of the actual packet loss, the actual packet loss ratio is estimated statistically. Simulation results show that the proposed method can estimate the TCP packet loss ratio accurately from a 10% sampling of packets.

Random access with adaptive packet aggregation in LTE/LTE-A.

PubMed

Zhou, Kaijie; Nikaein, Navid

While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.

Packet telemetry and packet telecommand - The new generation of spacecraft data handling techniques

NASA Technical Reports Server (NTRS)

Hooke, A. J.

1983-01-01

Because of rising costs and reduced reliability of spacecraft and ground network hardware and software customization, standardization Packet Telemetry and Packet Telecommand concepts are emerging as viable alternatives. Autonomous packets of data, within each concept, which are created within ground and space application processes through the use of formatting techniques, are switched end-to-end through the space data network to their destination application processes through the use of standard transfer protocols. This process may result in facilitating a high degree of automation and interoperability because of completely mission-independent-designed intermediate data networks. The adoption of an international guideline for future space telemetry formatting of the Packet Telemetry concept, and the advancement of the NASA-ESA Working Group's Packet Telecommand concept to a level of maturity parallel to the of Packet Telemetry are the goals of the Consultative Committee for Space Data Systems. Both the Packet Telemetry and Packet Telecommand concepts are reviewed.

Error recovery to enable error-free message transfer between nodes of a computer network

DOEpatents

Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd; Steinmacher-Burow, Burkhard; Vranas, Pavlos M.

2016-01-26

An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

Unequal-Arm Interferometry and Ranging in Space

NASA Technical Reports Server (NTRS)

Tinto, Massimo

2005-01-01

Space-borne interferometric gravitational wave detectors, sensitive in the low-frequency (millihertz) band, will fly in the next decade. In these detectors the spacecraft-to-spacecraft light-traveltimes will necessarily be unequal, time-varying, and (due to aberration) have different time delays on up- and down-links. By using knowledge of the inter-spacecraft light-travel-times and their time evolution it is possible to cancel in post-processing the otherwise dominant laser phase noise and obtain a variety of interferometric data combinations sensitive to gravitational radiation. This technique, which has been named Time-Delay Interferometry (TDI), can be implemented with constellations of three or more formation-flying spacecraft that coherently track each other. As an example application we consider the Laser Interferometer Space Antenna (LISA) mission and show that TDI combinations can be synthesized by properly time-shifting and linearly combining the phase measurements performed on board the three spacecraft. Since TDI exactly suppresses the laser noises when the delays coincide with the light-travel-times, we then show that TDI can also be used for estimating the time-delays needed for its implementation. This is done by performing a post-processing non-linear minimization procedure, which provides an effective, powerful, and simple way for making measurements of the inter-spacecraft light-travel-times. This processing technique, named Time-Delay Interferometric Ranging (TDIR), is highly accurate in estimating the time-delays and allows TDI to be successfully implemented without the need of a dedicated ranging subsystem.

Effects of Paradigm and Inter-Stimulus Interval on Age Differences in Eyeblink Classical Conditioning in Rabbits

ERIC Educational Resources Information Center

Woodruff-Pak, Diana S.; Seta, Susan E.; Roker, LaToya A.; Lehr, Melissa A.

2007-01-01

The aim of this study was to examine parameters affecting age differences in eyeblink classical conditioning in a large sample of young and middle-aged rabbits. A total of 122 rabbits of mean ages of 4 or 26 mo were tested at inter-stimulus intervals (ISIs) of 600 or 750 msec in the delay or trace paradigms. Paradigm affected both age groups…

SDN-enabled hybrid emergency message transmission architecture in internet-of-vehicles

NASA Astrophysics Data System (ADS)

Zhu, Wanting; Gao, Deyun; Zhao, Weicheng; Zhang, Hongke; Chiang, Hua-Pei

2018-04-01

With the increasing number of vehicles connected to the Internet-of-Things (IoT), Internet-of-Vehicles (IoV) is becoming a hot research topic. It can improve traffic safety and efficiency and promote the development of the intelligent transportation that is a very important element in Smart Cities. As an important part of the safety application in IoV, the emergency message transmission is designed to inform all the vehicles in the relevant area timely of the accident information through the multi-hop broadcast communication. In this paper, we propose a hybrid emergency message transmission (HEMT), which introduces the SDN technology into the vehicular network environment and utilizes the flexibility of inter-vehicle communication. By deploying SDN-enabled central controller and RSU switches, we can obtain reliable and fast emergency message dissemination. Moreover, considering the space between the coverages of RSUs caused by the sparse deployment, we also use inter-vehicle multi-hop broadcast communication to improve the message coverage ratio by adding the packet modification module on the RSU switch. Simulation results show the feasibility and effectiveness of our proposed scheme.

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.

Optimizing Retransmission Threshold in Wireless Sensor Networks

PubMed Central

Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

2016-01-01

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is OnΔ·max1≤i≤n{ui}, where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1+pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

Immediate effect of percutaneous transvenous mitral commissurotomy on atrial electromechanical delay and P-wave dispersion in patients with severe mitral stenosis.

PubMed

Beig, Jahangir Rashid; Tramboo, Nisar A; Rather, Hilal A; Hafeez, Imran; Ananth, Vijai; Lone, Ajaz A; Yaqoob, Irfan; Bhat, Irfan A; Ali, Muzaffar

2015-12-01

Mitral stenosis (MS) is associated with prolonged inter- and intra-atrial electromechanical delays and increased P-wave dispersion, which are markers of atrial fibrillation (AF) risk. This study was conducted to assess the immediate effect of successful percutaneous transvenous mitral commissurotomy (PTMC) on these parameters. This single center observational study included 25 patients with severe MS (aged 34.1 ± 7.1 years, with mean mitral valve area (MVA) of 0.74 ± 0.13 cm(2)), in sinus rhythm, who underwent successful PTMC at our hospital. P-wave dispersion (PWD) was calculated by subtracting minimum P-wave duration (P min) from maximum P-wave duration (Pmax), measured on a 12-lead surface ECG obtained from each patient in supine position at a paper speed of 50mm/s and 20mm/mV. Inter-atrial (AEMD), left intra-atrial (L-IAEMD), and right intra-atrial (R-IAEMD) electromechanical delays were measured on tissue Doppler imaging. PTMC was performed using the standard Inoue Balloon technique. All these parameters were evaluated and compared before and 24-48 h after PTMC. Successful PTMC led to significant reduction in AEMD (p < 0.001), L-IAEMD (p < 0.001), and R-IAEMD (p < 0.001). There were no changes in Pmax, Pmin, and PWD immediately after PTMC. Successful PTMC has a favorable early impact on inter- and intra-atrial electromechanical delays, which are considered as novel parameters of atrial electromechanical remodeling in MS patients. Prospective large-scale studies are required to confirm whether improvement in these markers translates into reduced long-term AF risk. Copyright © 2015 Cardiological Society of India. Published by Elsevier B.V. All rights reserved.

Immediate effect of percutaneous transvenous mitral commissurotomy on atrial electromechanical delay and P-wave dispersion in patients with severe mitral stenosis

PubMed Central

Beig, Jahangir Rashid; Tramboo, Nisar A.; Rather, Hilal A.; Hafeez, Imran; Ananth, Vijai; Lone, Ajaz A.; Yaqoob, Irfan; Bhat, Irfan A.; Ali, Muzaffar

2015-01-01

Background Mitral stenosis (MS) is associated with prolonged inter- and intra-atrial electromechanical delays and increased P-wave dispersion, which are markers of atrial fibrillation (AF) risk. This study was conducted to assess the immediate effect of successful percutaneous transvenous mitral commissurotomy (PTMC) on these parameters. Methods This single center observational study included 25 patients with severe MS (aged 34.1 ± 7.1 years, with mean mitral valve area (MVA) of 0.74 ± 0.13  cm2), in sinus rhythm, who underwent successful PTMC at our hospital. P-wave dispersion (PWD) was calculated by subtracting minimum P-wave duration (Pmin) from maximum P-wave duration (Pmax), measured on a 12-lead surface ECG obtained from each patient in supine position at a paper speed of 50 mm/s and 20 mm/mV. Inter-atrial (AEMD), left intra-atrial (L-IAEMD), and right intra-atrial (R-IAEMD) electromechanical delays were measured on tissue Doppler imaging. PTMC was performed using the standard Inoue Balloon technique. All these parameters were evaluated and compared before and 24–48 h after PTMC. Results Successful PTMC led to significant reduction in AEMD (p < 0.001), L-IAEMD (p < 0.001), and R-IAEMD (p < 0.001). There were no changes in Pmax, Pmin, and PWD immediately after PTMC. Conclusions Successful PTMC has a favorable early impact on inter- and intra-atrial electromechanical delays, which are considered as novel parameters of atrial electromechanical remodeling in MS patients. Prospective large-scale studies are required to confirm whether improvement in these markers translates into reduced long-term AF risk. PMID:26688153

Precision of FLEET Velocimetry Using High-speed CMOS Camera Systems

NASA Technical Reports Server (NTRS)

Peters, Christopher J.; Danehy, Paul M.; Bathel, Brett F.; Jiang, Naibo; Calvert, Nathan D.; Miles, Richard B.

2015-01-01

Femtosecond laser electronic excitation tagging (FLEET) is an optical measurement technique that permits quantitative velocimetry of unseeded air or nitrogen using a single laser and a single camera. In this paper, we seek to determine the fundamental precision of the FLEET technique using high-speed complementary metal-oxide semiconductor (CMOS) cameras. Also, we compare the performance of several different high-speed CMOS camera systems for acquiring FLEET velocimetry data in air and nitrogen free-jet flows. The precision was defined as the standard deviation of a set of several hundred single-shot velocity measurements. Methods of enhancing the precision of the measurement were explored such as digital binning (similar in concept to on-sensor binning, but done in post-processing), row-wise digital binning of the signal in adjacent pixels and increasing the time delay between successive exposures. These techniques generally improved precision; however, binning provided the greatest improvement to the un-intensified camera systems which had low signal-to-noise ratio. When binning row-wise by 8 pixels (about the thickness of the tagged region) and using an inter-frame delay of 65 micro sec, precisions of 0.5 m/s in air and 0.2 m/s in nitrogen were achieved. The camera comparison included a pco.dimax HD, a LaVision Imager scientific CMOS (sCMOS) and a Photron FASTCAM SA-X2, along with a two-stage LaVision High Speed IRO intensifier. Excluding the LaVision Imager sCMOS, the cameras were tested with and without intensification and with both short and long inter-frame delays. Use of intensification and longer inter-frame delay generally improved precision. Overall, the Photron FASTCAM SA-X2 exhibited the best performance in terms of greatest precision and highest signal-to-noise ratio primarily because it had the largest pixels.

A multi-ring optical packet and circuit integrated network with optical buffering.

PubMed

Furukawa, Hideaki; Shinada, Satoshi; Miyazawa, Takaya; Harai, Hiroaki; Kawasaki, Wataru; Saito, Tatsuhiko; Matsunaga, Koji; Toyozumi, Tatuya; Wada, Naoya

2012-12-17

We newly developed a 3 × 3 integrated optical packet and circuit switch-node. Optical buffers and burst-mode erbium-doped fiber amplifiers with the gain flatness are installed in the 3 × 3 switch-node. The optical buffer can prevent packet collisions and decrease packet loss. We constructed a multi-ring optical packet and circuit integrated network testbed connecting two single-ring networks and a client network by the 3 × 3 switch-node. For the first time, we demonstrated 244 km fiber transmission and 5-node hopping of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10 Gigabit Ethernet frames on the testbed. Error-free (frame error rate < 1 × 10(-4)) operation was achieved with optical packets of various packet lengths. In addition, successful avoidance of packet collisions by optical buffers was confirmed.

PHY-DLL dialogue: cross-layer design for optical-wireless OFDM downlink transmission

NASA Astrophysics Data System (ADS)

Wang, Xuguo; Li, Lee

2005-11-01

The use of radio over fiber to provide radio access has a number of advantages including the ability to deploy small, low-cost remote antenna units and ease of upgrade. And due to the great potential for increasing the capacity and quality of service, the combination of Orthogonal Frequency Division Multiplexing (OFDM) modulation and the sub-carrier multiplexed optical transmission is one of the best solutions for the future millimeter-wave mobile communication. And this makes the optimum utility of valuable radio resources essential. This paper devises a cross-layer adaptive algorithm for optical-wireless OFDM system, which takes into consideration not only transmission power limitation in the physical layer, but also traffic scheduling and user fairness at the data-link layer. According to proportional fairness principle and water-pouring theorem, we put forward the complete description of this cross-layer adaptive downlink transmission 6-step algorithm. Simulation results show that the proposed cross-layer algorithm outperforms the mere physical layer adaptive algorithm markedly. The novel scheme is able to improve performance of the packet success rate per time chip and average packet delay, support added active users.

Hybrid monitoring scheme for end-to-end performance enhancement of multicast-based real-time media

NASA Astrophysics Data System (ADS)

Park, Ju-Won; Kim, JongWon

2004-10-01

As real-time media applications based on IP multicast networks spread widely, end-to-end QoS (quality of service) provisioning for these applications have become very important. To guarantee the end-to-end QoS of multi-party media applications, it is essential to monitor the time-varying status of both network metrics (i.e., delay, jitter and loss) and system metrics (i.e., CPU and memory utilization). In this paper, targeting the multicast-enabled AG (Access Grid) a next-generation group collaboration tool based on multi-party media services, the applicability of hybrid monitoring scheme that combines active and passive monitoring is investigated. The active monitoring measures network-layer metrics (i.e., network condition) with probe packets while the passive monitoring checks both application-layer metrics (i.e., user traffic condition by analyzing RTCP packets) and system metrics. By comparing these hybrid results, we attempt to pinpoint the causes of performance degradation and explore corresponding reactions to improve the end-to-end performance. The experimental results show that the proposed hybrid monitoring can provide useful information to coordinate the performance improvement of multi-party real-time media applications.

New Scheduling Algorithms for Agile All-Photonic Networks

NASA Astrophysics Data System (ADS)

Mehri, Mohammad Saleh; Ghaffarpour Rahbar, Akbar

2017-12-01

An optical overlaid star network is a class of agile all-photonic networks that consists of one or more core node(s) at the center of the star network and a number of edge nodes around the core node. In this architecture, a core node may use a scheduling algorithm for transmission of traffic through the network. A core node is responsible for scheduling optical packets that arrive from edge nodes and switching them toward their destinations. Nowadays, most edge nodes use virtual output queue (VOQ) architecture for buffering client packets to achieve high throughput. This paper presents two efficient scheduling algorithms called discretionary iterative matching (DIM) and adaptive DIM. These schedulers find maximum matching in a small number of iterations and provide high throughput and incur low delay. The number of arbiters in these schedulers and the number of messages exchanged between inputs and outputs of a core node are reduced. We show that DIM and adaptive DIM can provide better performance in comparison with iterative round-robin matching with SLIP (iSLIP). SLIP means the act of sliding for a short distance to select one of the requested connections based on the scheduling algorithm.

A Wideband Satcom Based Avionics Network with CDMA Uplink and TDM Downlink

NASA Technical Reports Server (NTRS)

Agrawal, D.; Johnson, B. S.; Madhow, U.; Ramchandran, K.; Chun, K. S.

2000-01-01

The purpose of this paper is to describe some key technical ideas behind our vision of a future satcom based digital communication network for avionics applications The key features of our design are as follows: (a) Packetized transmission to permit efficient use of system resources for multimedia traffic; (b) A time division multiplexed (TDM) satellite downlink whose physical layer is designed to operate the satellite link at maximum power efficiency. We show how powerful turbo codes (invented originally for linear modulation) can be used with nonlinear constant envelope modulation, thus permitting the satellite amplifier to operate in a power efficient nonlinear regime; (c) A code division multiple access (CDMA) satellite uplink, which permits efficient access to the satellite from multiple asynchronous users. Closed loop power control is difficult for bursty packetized traffic, especially given the large round trip delay to the satellite. We show how adaptive interference suppression techniques can be used to deal with the ensuing near-far problem; (d) Joint source-channel coding techniques are required both at the physical and the data transport layer to optimize the end-to-end performance. We describe a novel approach to multiple description image encoding at the data transport layer in this paper.

Reliable Multihop Broadcast Protocol with a Low-Overhead Link Quality Assessment for ITS Based on VANETs in Highway Scenarios

PubMed Central

Galaviz-Mosqueda, Alejandro; Villarreal-Reyes, Salvador; Galeana-Zapién, Hiram; Rubio-Loyola, Javier; Covarrubias-Rosales, David H.

2014-01-01

Vehicular ad hoc networks (VANETs) have been identified as a key technology to enable intelligent transport systems (ITS), which are aimed to radically improve the safety, comfort, and greenness of the vehicles in the road. However, in order to fully exploit VANETs potential, several issues must be addressed. Because of the high dynamic of VANETs and the impairments in the wireless channel, one key issue arising when working with VANETs is the multihop dissemination of broadcast packets for safety and infotainment applications. In this paper a reliable low-overhead multihop broadcast (RLMB) protocol is proposed to address the well-known broadcast storm problem. The proposed RLMB takes advantage of the hello messages exchanged between the vehicles and it processes such information to intelligently select a relay set and reduce the redundant broadcast. Additionally, to reduce the hello messages rate dependency, RLMB uses a point-to-zone link evaluation approach. RLMB performance is compared with one of the leading multihop broadcast protocols existing to date. Performance metrics show that our RLMB solution outperforms the leading protocol in terms of important metrics such as packet dissemination ratio, overhead, and delay. PMID:25133224

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

Sturm, F. P.; Tong, X. M.; Palacios, A.

Here, we used ultrashort femtosecond vacuum ultraviolet (VUV) and infrared (IR) pulses in a pump-probe scheme to map the dynamics and nonequilibrium dissociation channels of excited neutral H 2 molecules. A nuclear wave packet is created in the B 1Σmore » $$+\\atop{u}$$ state of the neutral H 2 molecule by absorption of the ninth harmonic of the driving infrared laser field. Due to the large stretching amplitude of the molecule excited in the B 1Σ$$+\\atop{u}$$ electronic state, the effective H 2 + ionization potential changes significantly as the nuclear wave packet vibrates in the bound, highly electronically and vibrationally excited B potential-energy curve. We probed such dynamics by ionizing the excited neutral molecule using time-delayed VUV-or-IR radiation. We identified the nonequilibrium dissociation channels by utilizing three-dimensional momentum imaging of the ion fragments. We also found that different dissociation channels can be controlled, to some extent, by changing the IR laser intensity and by choosing the wavelength of the probe laser light. Furthermore, we concluded that even in a benchmark molecular system such as H 2*, the interpretation of the nonequilibrium multiphoton and multicolor ionization processes is still a challenging task, requiring intricate theoretical analysis.« less

Channel modelling for free-space optical inter-HAP links using adaptive ARQ transmission

NASA Astrophysics Data System (ADS)

Parthasarathy, S.; Giggenbach, D.; Kirstädter, A.

2014-10-01

Free-space optical (FSO) communication systems have seen significant developments in recent years due to growing need for very high data rates and tap-proof communication. The operation of an FSO link is suited to diverse variety of applications such as satellites, High Altitude Platforms (HAPs), Unmanned Aerial Vehicles (UAVs), aircrafts, ground stations and other areas involving both civil and military situations. FSO communication systems face challenges due to different effects of the atmospheric channel. FSO channel primarily suffers from scintillation effects due to Index of Refraction Turbulence (IRT). In addition, acquisition and pointing becomes more difficult because of the high directivity of the transmitted beam: Miss-pointing of the transmitted beam and tracking errors at the receiver generate additional fading of the optical signal. High Altitude Platforms (HAPs) are quasi-stationary vehicles operating in the stratosphere. The slowly varying but precisely determined time-of-flight of the Inter-HAP channel adds to its characteristics. To propose a suitable ARQ scheme, proper theoretical understanding of the optical atmospheric propagation and modeling of a specific scenario FSO channel is required. In this paper, a bi-directional symmetrical Inter-HAP link has been selected and modeled. The Inter-HAP channel model is then investigated via simulations in terms of optical scintillation induced by IRT and in presence of pointing error. The performance characteristic of the model is then quantified in terms of fading statistics from which the Packet Error Probability (PEP) is calculated. Based on the PEP characteristics, we propose suitable ARQ schemes.

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.

Assessment of ventricular and left atrial mechanical functions, atrial electromechanical delay and P wave dispersion in patients with scleroderma.

PubMed

Aktoz, Meryem; Yilmaztepe, Mustafa; Tatli, Ersan; Turan, Fatma Nesrin; Umit, Elif G; Altun, Armagan

2011-01-01

The aim of this study was to investigate ventricular functions and left atrial (LA) mechanical functions, atrial electromechanical coupling, and P wave dispersion in scleroderma patients. Twenty-six patients with scleroderma and twenty-four controls were included. Left and right ventricular (LV and RV) functions were evaluated using conventional echocardiography and tissue Doppler imaging (TDI). LA volumes were measured using the biplane area- -length method and LA mechanical function parameters were calculated. Inter-intraatrial electromechanical delays were measured by TDI. P wave dispersion was calculated by 12-lead electrocardiograms. LV myocardial performance indices (MPI) and RV MPI were higher in patients with scleroderma (p = 0.000, p = 0.000, respectively) while LA passive emptying fraction was decreased and LA active emptying fraction was increased (p = 0.051, p = 0.000, respectively). P wave dispersion and inter-intraatrial electromechanical delay were significantly higher in patients with scleroderma (25 [10-60] vs 20 [0-30], p = 0.000, 16.50 [7.28-26.38] vs 9.44 [3.79-15.78] and 11.33 [4.88-16.06] vs 4.00 [0-12.90], p < 0.05, respectively). Interatrial electromechanical delay was negatively correlated with LV E wave, (p = 0.018). LV E wave was demonstrated to be a factor independent of the interatrial electromechanical delay (R² = = 0.270, b = -0.52, p = 0.013). This study showed that in scleroderma patients, global functions of LV, RV and mechanical functions of LA were impaired, intra-interatrial electromechanical delays were prolonged and P wave dispersion was higher. LV E wave was demonstrated to be a factor that is independent of the interatrial electromechanical delay. Reduced LV E wave may also give additional information on the process of risk stratification of atrial fibrillation.

Speech transport for packet telephony and voice over IP

NASA Astrophysics Data System (ADS)

Baker, Maurice R.

1999-11-01

Recent advances in packet switching, internetworking, and digital signal processing technologies have converged to allow realizable practical implementations of packet telephony systems. This paper provides a tutorial on transmission engineering for packet telephony covering the topics of speech coding/decoding, speech packetization, packet data network transport, and impairments which may negatively impact end-to-end system quality. Particular emphasis is placed upon Voice over Internet Protocol given the current popularity and ubiquity of IP transport.

Threatened and Endangered Species: Tour Packet.

ERIC Educational Resources Information Center

Coats, Victoria; Samia, Cory

This resource unit contains a teacher information packet and a middle school student activity packet to be used in creating a threatened and endangered species unit. The packet of student activities is designed to help maximize a field trip to the zoo and build on students' zoo experience in the classroom. The teacher information packet covers the…

Development of optical packet and circuit integrated ring network testbed.

PubMed

Furukawa, Hideaki; Harai, Hiroaki; Miyazawa, Takaya; Shinada, Satoshi; Kawasaki, Wataru; Wada, Naoya

2011-12-12

We developed novel integrated optical packet and circuit switch-node equipment. Compared with our previous equipment, a polarization-independent 4 × 4 semiconductor optical amplifier switch subsystem, gain-controlled optical amplifiers, and one 100 Gbps optical packet transponder and seven 10 Gbps optical path transponders with 10 Gigabit Ethernet (10GbE) client-interfaces were newly installed in the present system. The switch and amplifiers can provide more stable operation without equipment adjustments for the frequent polarization-rotations and dynamic packet-rate changes of optical packets. We constructed an optical packet and circuit integrated ring network testbed consisting of two switch nodes for accelerating network development, and we demonstrated 66 km fiber transmission and switching operation of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10GbE frames. Error-free (frame error rate < 1×10(-4)) operation was achieved with optical packets of various packet lengths and packet rates, and stable operation of the network testbed was confirmed. In addition, 4K uncompressed video streaming over OPS links was successfully demonstrated. © 2011 Optical Society of America

Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses.

PubMed

Zhang, Wenbing; Tang, Yang; Huang, Tingwen; Kurths, Jurgen

In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.

Mechanics of inter-modal tunneling in nonlinear waveguides

NASA Astrophysics Data System (ADS)

Jiao, Weijian; Gonella, Stefano

2018-02-01

In this article, we investigate the mechanics of nonlinearly induced inter-modal energy tunneling between flexurally-dominated and axially-dominated modes in phononic waveguides. Special attention is devoted to elucidating the role played by the coupling between axial and flexural degrees of freedom in the determination of the available mode hopping conditions and the associated mechanisms of deformation. Waveguides offer an ideal test bed to investigate the mechanics of nonlinear energy tunneling, due to the fact that they naturally feature, even at low frequencies, families of modes (flexural and axial) that are intrinsically characterized by extreme complementarity. Moreover, thanks to their geometric simplicity, their behavior can be explained by resorting to intuitive structural mechanics models that effectively capture the dichotomy and interplay between flexural and axial mechanisms. After having delineated the fundamental mechanics of flexural-to-axial hopping using the benchmark example of a homogeneous structure, we adapt the analysis to the case of periodic waveguides, in which the complex dispersive behavior due to periodicity results in additional richness of mode hopping mechanisms. We finally extend the analysis to periodic waveguides with internal resonators, in which the availability of locally-resonant bandgaps implies the possibility to activate the resonators even at relatively low frequencies, thus increasing the degree of modal complementarity that is available in the acoustic range. In this context, inter-modal tunneling provides an unprecedented mechanism to transfer conspicuous packets of energy to the resonating microstructure.

Factors Associated with Delayed Tuberculosis Test-seeking Behavior in the Peruvian Amazon

PubMed Central

Ford, Carolyn M.; Bayer, Angela M.; Gilman, Robert H.; Onifade, Dami; Acosta, Colleen; Cabrera, Lilia; Vidal, Carlos; Evans, Carlton A.

2010-01-01

This study aimed to determine the psychosocial factors associated with delayed test-seeking among tuberculosis patients. The duration of symptoms before seeking medical care was assessed by interview for 108 newly diagnosed pulmonary tuberculosis patients in the city of Iquitos in the Peruvian Amazon, which has high tuberculosis incidence. Beliefs associated with test-seeking behavior and delay was assessed in these patients. The median delay from symptom onset to seeking diagnostic testing was 61 days (inter-quartile range 30–91 days). The belief that tuberculosis is curable was associated with a 100% longer test-seeking delay; the perception that tuberculosis was common was associated with a 57% longer delay; male gender was associated with a 48% longer delay; and education less than complete secondary schooling was associated with a 44% longer delay. In conclusion, current health promotion activities that emphasize tuberculosis curability and high prevalence may paradoxically increase test-seeking delay and therefore require prospective evaluation. PMID:19996443

Concurrent validity of the Alberta Infant Motor Scale to detect delayed gross motor development in preterm infants: A comparative study with the Bayley III.

PubMed

Albuquerque, Plínio Luna de; Guerra, Miriam Queiroz de Farias; Lima, Marília de Carvalho; Eickmann, Sophie Helena

2017-05-24

To investigate the concurrent validity of AIMS in relation to the gross motor subtest of the Bayley Scale III/GM in preterm infants. A total of 159 gross motor development assessments were performed with the AIMS and Bayley-III/GM. Linear regression was used to assess the correlation between AIMS and Bayley-III/GM scores. The intra-class correlation coefficient (ICC) and the Bland-Altman plot were used to analyze intra- and inter-rater reliability. There was a prevalence of delayed gross motor development of 20.8% according to the Bayley-III/GM, and 11.9% for the 5th percentile and 21.4% for the 10th percentile of AIMS. A good correlation of AIMS with Bayley-III/GM scores and intra- and inter-rater reliability was encountered in this study. AIMS proved very capable of detecting delayed gross motor development in preterm infants when compared with the Bayley-III/GM. The 10th percentile of AIMS provided the best combination of indicators, with greater specificity.

Integrated Model for Performance Analysis of All-Optical Multihop Packet Switches

NASA Astrophysics Data System (ADS)

Jeong, Han-You; Seo, Seung-Woo

2000-09-01

The overall performance of an all-optical packet switching system is usually determined by two criteria, i.e., switching latency and packet loss rate. In some real-time applications, however, in which packets arriving later than a timeout period are discarded as loss, the packet loss rate becomes the most dominant criterion for system performance. Here we focus on evaluating the performance of all-optical packet switches in terms of the packet loss rate, which normally arises from the insufficient hardware or the degradation of an optical signal. Considering both aspects, we propose what we believe is a new analysis model for the packet loss rate that reflects the complicated interactions between physical impairments and system-level parameters. On the basis of the estimation model for signal quality degradation in a multihop path we construct an equivalent analysis model of a switching network for evaluating an average bit error rate. With the model constructed we then propose an integrated model for estimating the packet loss rate in three architectural examples of multihop packet switches, each of which is based on a different switching concept. We also derive the bounds on the packet loss rate induced by bit errors. Finally, it is verified through simulation studies that our analysis model accurately predicts system performance.

A TOTP-Based Enhanced Route Optimization Procedure for Mobile IPv6 to Reduce Handover Delay and Signalling Overhead

PubMed Central

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). PMID:24688398

Statistical performance evaluation of ECG transmission using wireless networks.

PubMed

Shakhatreh, Walid; Gharaibeh, Khaled; Al-Zaben, Awad

2013-07-01

This paper presents simulation of the transmission of biomedical signals (using ECG signal as an example) over wireless networks. Investigation of the effect of channel impairments including SNR, pathloss exponent, path delay and network impairments such as packet loss probability; on the diagnosability of the received ECG signal are presented. The ECG signal is transmitted through a wireless network system composed of two communication protocols; an 802.15.4- ZigBee protocol and an 802.11b protocol. The performance of the transmission is evaluated using higher order statistics parameters such as kurtosis and Negative Entropy in addition to the common techniques such as the PRD, RMS and Cross Correlation.

On the impact of fiber-delay-lines (FDL) in an all-optical network (AON) bottleneck without wavelength conversion

NASA Astrophysics Data System (ADS)

Argibay-Losada, Pablo Jesus; Sahin, Gokhan

2014-08-01

Random access memories (RAM) are fundamental in conventional electronic switches and routers to manage short-term congestion and to decrease data loss probabilities. Switches in all-optical networks (AONs), however, do not have access to optical RAM, and therefore are prone to much higher loss levels than their electronic counterparts. Fiber-delay-lines (FDLs), able to delay an optical data packet a fixed amount of time, have been proposed in the literature as a means to alleviate those high loss levels. However, they are extremely bulky to manage, so their usage introduces a trade-off between practicality and performance in the design and operation of the AON. In this paper we study the influence that FDLs have in the performance of flows crossing an all-optical switch that acts as their bottleneck. We show how extremely low numbers of FDLs (e.g., 1 or 2) can help in reducing losses by several orders of magnitude in several illustrative scenarios with high aggregation levels. Our results therefore suggest that FDLs can be a practical means of dealing with congestion in AONs in the absence of optical RAM buffers or of suitable data interchange protocols specifically designed for AONs.

SpaceWire Protocol ID: What Does It Mean To You?

NASA Technical Reports Server (NTRS)

Rakow, Glenn; Schnurr, Richard; Gilley, Daniel; Parks, Steve

2006-01-01

Spacewire is becoming a popular solution for satellite high-speed data buses because it is a simple standard that provides great flexibility for a wide range of system requirements. It is simple in packet format and protocol, allowing users to easily tailor their implementation for their specific application. Some of the attractive aspects of Spacewire that make it easy to implement also make it hard for future reuse. Protocol reuse is difficult because Spacewire does not have a defined mechanism to communicate with the higher layers of the protocol stack. This has forced users of Spacewire to define unique packet formats and define how these packets are to be processed. Each mission writes their own Interface Control Document (ICD) and tailors Spacewire for their specific requirements making reuse difficult. Part of the reason for this habit may be because engineers typically optimize designs for their own requirements in the absence of a standard. This is an inefficient use of project resources and costs more to develop missions. A new packet format for Spacewire has been defined as a solution for this problem. This new packet format is a compliment to the Spacewire standard that will support protocol development upon Spacewire. The new packet definition does not replace the current packet structure, i.e., does not make the standard obsolete, but merely extends the standard for those who want to develop protocols over Spacewire. The Spacewire packet is defined with the first part being the Destination Address, which may be one or more bytes. This is followed by the packet cargo, which is user defined. The cargo is truncated with an End-Of-Packet (EOP) marker. This packet structure offers low packet overhead and allows the user to define how the contents are to be formatted. It also provides for many different addressing schemes, which provide flexibility in the system. This packet flexibility is typically an attractive part of the Spacewire. The new extended packet format adds one new field to the packet that greatly enhances the capability of Spacewire. This new field called the Protocol Identifier (ID) is used to identify the packet contents and the associated processing for the packet. This feature along with the restriction in the packet format that uses the Protocol ID, allows a deterministic method of decoding packets that was not before possible. The first part of the packet is still the Destination Address, which still conforms to the original standard but with one restriction. The restriction is that the first byte seen at the destination by the user needs to be a logical address, independent of the addressing scheme used. The second field is defined as the Protocol ID, which is usually one byte in length. The packet cargo (user defined) follows the Protocol ID. After the packet cargo is the EOP, which defines the end of packet. The value of the Protocol ID is assigned by the Spacewire working group and the protocol description published for others to use. The development of Protocols for Spacewire is currently the area of greatest activity by the Spacewire working group. The first protocol definition by the working group has been completed and is now in the process of formal standardization. There are many other protocols in development for missions that have not yet received formal Protocol ID assignment, but even if the protocols are not formally assigned a value, this effort will provide synergism for future developments.

Cross Layer Design for Optimizing Transmission Reliability, Energy Efficiency, and Lifetime in Body Sensor Networks.

PubMed

Chen, Xi; Xu, Yixuan; Liu, Anfeng

2017-04-19

High transmission reliability, energy efficiency, and long lifetime are pivotal issues for wireless body area networks (WBANs. However, these performance metrics are not independent of each other, making it hard to obtain overall improvements through optimizing one single aspect. Therefore, a Cross Layer Design Optimal (CLDO) scheme is proposed to simultaneously optimize transmission reliability, energy efficiency, and lifetime of WBANs from several layers. Firstly, due to the fact that the transmission power of nodes directly influences the reliability of links, the optimized transmission power of different nodes is deduced, which is able to maximize energy efficiency in theory under the premise that requirements on delay and jitter are fulfilled. Secondly, a relay decision algorithm is proposed to choose optimized relay nodes. Using this algorithm, nodes will choose relay nodes that ensure a balance of network energy consumption, provided that all nodes transmit with optimized transmission power and the same packet size. Thirdly, the energy consumption of nodes is still unbalanced even with optimized transmission power because of their different locations in the topology of the network. In addition, packet size also has an impact on final performance metrics. Therefore, a synthesized cross layer method for optimization is proposed. With this method, the transmission power of nodes with more residual energy will be enhanced while suitable packet size is determined for different links in the network, leading to further improvements in the WBAN system. Both our comprehensive theoretical analysis and experimental results indicate that the performance of our proposed scheme is better than reported in previous studies. Relative to the relay selection and power control game (RSPCG) scheme, the CLDO scheme can enhance transmission reliability by more than 44.6% and prolong the lifetime by as much as 33.2%.

Cross Layer Design for Optimizing Transmission Reliability, Energy Efficiency, and Lifetime in Body Sensor Networks

PubMed Central

Chen, Xi; Xu, Yixuan; Liu, Anfeng

2017-01-01

High transmission reliability, energy efficiency, and long lifetime are pivotal issues for wireless body area networks (WBANs). However, these performance metrics are not independent of each other, making it hard to obtain overall improvements through optimizing one single aspect. Therefore, a Cross Layer Design Optimal (CLDO) scheme is proposed to simultaneously optimize transmission reliability, energy efficiency, and lifetime of WBANs from several layers. Firstly, due to the fact that the transmission power of nodes directly influences the reliability of links, the optimized transmission power of different nodes is deduced, which is able to maximize energy efficiency in theory under the premise that requirements on delay and jitter are fulfilled. Secondly, a relay decision algorithm is proposed to choose optimized relay nodes. Using this algorithm, nodes will choose relay nodes that ensure a balance of network energy consumption, provided that all nodes transmit with optimized transmission power and the same packet size. Thirdly, the energy consumption of nodes is still unbalanced even with optimized transmission power because of their different locations in the topology of the network. In addition, packet size also has an impact on final performance metrics. Therefore, a synthesized cross layer method for optimization is proposed. With this method, the transmission power of nodes with more residual energy will be enhanced while suitable packet size is determined for different links in the network, leading to further improvements in the WBAN system. Both our comprehensive theoretical analysis and experimental results indicate that the performance of our proposed scheme is better than reported in previous studies. Relative to the relay selection and power control game (RSPCG) scheme, the CLDO scheme can enhance transmission reliability by more than 44.6% and prolong the lifetime by as much as 33.2%. PMID:28422062

On the Traversal Time of Barriers

NASA Astrophysics Data System (ADS)

Aichmann, Horst; Nimtz, Günter

2014-06-01

Fifty years ago Hartman studied the barrier transmission time of wave packets (J Appl Phys 33:3427-3433, 1962). He was inspired by the tunneling experiments across thin insulating layers at that time. For opaque barriers he calculated faster than light propagation and a transmission time independent of barrier length, which is called the Hartman effect. A faster than light (FTL or superluminal) wave packet velocity was deduced in analog tunneling experiments with microwaves and with infrared light thirty years later. Recently, the conjectured zero time of electron tunneling was claimed to have been observed in ionizing helium inside the barrier. The calculated and measured short tunneling time arises at the barrier front. This tunneling time was found to be universal for elastic fields as well as for electromagnetic fields. Remarkable is that the delay time is the same for the reflected and the transmitted waves in the case of symmetric barriers. Several theoretical physicists predicted this strange nature of the tunneling process. However, even with this background many members of the physics community do not accept a FTL signal velocity interpretation of the experimental tunneling results. Instead a luminal front velocity was calculated to explain the FTL experimental results frequently. However, Brillouin stated in his book on wave propagation and group velocity that the front velocity is given by the group velocity of wave packets in the case of physical signals, which have only finite frequency bandwidths. Some studies assumed barriers to be cavities and the observed tunneling time does represent the cavity lifetime. We are going to discus these continuing misleading interpretations, which are found in journals and in textbooks till today.

The Traffic Adaptive Data Dissemination (TrAD) Protocol for both Urban and Highway Scenarios.

PubMed

Tian, Bin; Hou, Kun Mean; Zhou, Haiying

2016-06-21

The worldwide economic cost of road crashes and injuries is estimated to be US$518 billion per year and the annual congestion cost in France is estimated to be €5.9 billion. Vehicular Ad hoc Networks (VANETs) are one solution to improve transport features such as traffic safety, traffic jam and infotainment on wheels, where a great number of event-driven messages need to be disseminated in a timely way in a region of interest. In comparison with traditional wireless networks, VANETs have to consider the highly dynamic network topology and lossy links due to node mobility. Inter-Vehicle Communication (IVC) protocols are the keystone of VANETs. According to our survey, most of the proposed IVC protocols focus on either highway or urban scenarios, but not on both. Furthermore, too few protocols, considering both scenarios, can achieve high performance. In this paper, an infrastructure-less Traffic Adaptive data Dissemination (TrAD) protocol which takes into account road traffic and network traffic status for both highway and urban scenarios will be presented. TrAD has double broadcast suppression techniques and is designed to adapt efficiently to the irregular road topology. The performance of the TrAD protocol was evaluated quantitatively by means of realistic simulations taking into account different real road maps, traffic routes and vehicular densities. The obtained simulation results show that TrAD is more efficient in terms of packet delivery ratio, number of transmissions and delay in comparison with the performance of three well-known reference protocols. Moreover, TrAD can also tolerate a reasonable degree of GPS drift and still achieve efficient data dissemination.

The Traffic Adaptive Data Dissemination (TrAD) Protocol for both Urban and Highway Scenarios

PubMed Central

Tian, Bin; Hou, Kun Mean; Zhou, Haiying

2016-01-01

The worldwide economic cost of road crashes and injuries is estimated to be US$518 billion per year and the annual congestion cost in France is estimated to be €5.9 billion. Vehicular Ad hoc Networks (VANETs) are one solution to improve transport features such as traffic safety, traffic jam and infotainment on wheels, where a great number of event-driven messages need to be disseminated in a timely way in a region of interest. In comparison with traditional wireless networks, VANETs have to consider the highly dynamic network topology and lossy links due to node mobility. Inter-Vehicle Communication (IVC) protocols are the keystone of VANETs. According to our survey, most of the proposed IVC protocols focus on either highway or urban scenarios, but not on both. Furthermore, too few protocols, considering both scenarios, can achieve high performance. In this paper, an infrastructure-less Traffic Adaptive data Dissemination (TrAD) protocol which takes into account road traffic and network traffic status for both highway and urban scenarios will be presented. TrAD has double broadcast suppression techniques and is designed to adapt efficiently to the irregular road topology. The performance of the TrAD protocol was evaluated quantitatively by means of realistic simulations taking into account different real road maps, traffic routes and vehicular densities. The obtained simulation results show that TrAD is more efficient in terms of packet delivery ratio, number of transmissions and delay in comparison with the performance of three well-known reference protocols. Moreover, TrAD can also tolerate a reasonable degree of GPS drift and still achieve efficient data dissemination. PMID:27338393

Recovery Act: Energy Efficiency of Data Networks through Rate Adaptation (EEDNRA) - Final Technical Report

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

Matthew Andrews; Spyridon Antonakopoulos; Steve Fortune

2011-07-12

This Concept Definition Study focused on developing a scientific understanding of methods to reduce energy consumption in data networks using rate adaptation. Rate adaptation is a collection of techniques that reduce energy consumption when traffic is light, and only require full energy when traffic is at full provisioned capacity. Rate adaptation is a very promising technique for saving energy: modern data networks are typically operated at average rates well below capacity, but network equipment has not yet been designed to incorporate rate adaptation. The Study concerns packet-switching equipment, routers and switches; such equipment forms the backbone of the modern Internet.more » The focus of the study is on algorithms and protocols that can be implemented in software or firmware to exploit hardware power-control mechanisms. Hardware power-control mechanisms are widely used in the computer industry, and are beginning to be available for networking equipment as well. Network equipment has different performance requirements than computer equipment because of the very fast rate of packet arrival; hence novel power-control algorithms are required for networking. This study resulted in five published papers, one internal report, and two patent applications, documented below. The specific technical accomplishments are the following: • A model for the power consumption of switching equipment used in service-provider telecommunication networks as a function of operating state, and measured power-consumption values for typical current equipment. • An algorithm for use in a router that adapts packet processing rate and hence power consumption to traffic load while maintaining performance guarantees on delay and throughput. • An algorithm that performs network-wide traffic routing with the objective of minimizing energy consumption, assuming that routers have less-than-ideal rate adaptivity. • An estimate of the potential energy savings in service-provider networks using feasibly-implementable rate adaptivity. • A buffer-management algorithm that is designed to reduce the size of router buffers, and hence energy consumed. • A packet-scheduling algorithm designed to minimize packet-processing energy requirements. Additional research is recommended in at least two areas: further exploration of rate-adaptation in network switching equipment, including incorporation of rate-adaptation in actual hardware, allowing experimentation in operational networks; and development of control protocols that allow parts of networks to be shut down while minimizing disruption to traffic flow in the network. The research is an integral part of a large effort within Bell Laboratories, Alcatel-Lucent, aimed at dramatic improvements in the energy efficiency of telecommunication networks. This Study did not explicitly consider any commercialization opportunities.« less

Design of a Multicast Optical Packet Switch Based on Fiber Bragg Grating Technology for Future Networks

NASA Astrophysics Data System (ADS)

Cheng, Yuh-Jiuh; Yeh, Tzuoh-Chyau; Cheng, Shyr-Yuan

2011-09-01

In this paper, a non-blocking multicast optical packet switch based on fiber Bragg grating technology with optical output buffers is proposed. Only the header of optical packets is converted to electronic signals to control the fiber Bragg grating array of input ports and the packet payloads should be transparently destined to their output ports so that the proposed switch can reduce electronic interfaces as well as the bit rate. The modulation and the format of packet payloads may be non-standard where packet payloads could also include different wavelengths for increasing the volume of traffic. The advantage is obvious: the proposed switch could transport various types of traffic. An easily implemented architecture which can provide multicast services is also presented. An optical output buffer is designed to queue the packets if more than one incoming packet should reach to the same destination output port or including any waiting packets in optical output buffer that will be sent to the output port at a time slot. For preserving service-packet sequencing and fairness of routing sequence, a priority scheme and a round-robin algorithm are adopted at the optical output buffer. The fiber Bragg grating arrays for both input ports and output ports are designed for routing incoming packets using optical code division multiple access technology.

Priority arbitration mechanism

DOEpatents

Garmire, Derrick L [Kingston, NY; Herring, Jay R [Poughkeepsie, NY; Stunkel, Craig B [Bethel, CT

2007-03-06

A method is provided for selecting a data source for transmission on one of several logical (virtual) lanes embodied in a single physical connection. Lanes are assigned to either a high priority class or to a low priority class. One of six conditions is employed to determine when re-arbitration of lane priorities is desired. When this occurs a next source for transmission is selected based on a the specification of the maximum number of high priority packets that can be sent after a lower priority transmission has been interrupted. Alternatively, a next source for transmission is selected based on a the specification of the maximum number of high priority packets that can be sent while a lower priority packet is waiting. If initialized correctly, the arbiter keeps all of the packets of a high priority packet contiguous, while allowing lower priority packets to be interrupted by the higher priority packets, but not to the point of starvation of the lower priority packets.

Minimal position-velocity uncertainty wave packets in relativistic and non-relativistic quantum mechanics

NASA Astrophysics Data System (ADS)

Al-Hashimi, M. H.; Wiese, U.-J.

2009-12-01

We consider wave packets of free particles with a general energy-momentum dispersion relation E(p). The spreading of the wave packet is determined by the velocity v=∂pE. The position-velocity uncertainty relation ΔxΔv⩾12|<∂p2E>| is saturated by minimal uncertainty wave packets Φ(p)=Aexp(-αE(p)+βp). In addition to the standard minimal Gaussian wave packets corresponding to the non-relativistic dispersion relation E(p)=p2/2m, analytic calculations are presented for the spreading of wave packets with minimal position-velocity uncertainty product for the lattice dispersion relation E(p)=-cos(pa)/ma2 as well as for the relativistic dispersion relation E(p)=p2+m2. The boost properties of moving relativistic wave packets as well as the propagation of wave packets in an expanding Universe are also discussed.

Experimental investigation of all-optical packet-level time slot assignment using two optical buffers cascaded.

PubMed

Sheng, Xinzhi; Feng, Zhen; Li, Bing

2013-04-20

We proposed and experimentally demonstrated all-optical packet-level time slot assignment scheme with two optical buffers cascaded. The function of time-slot interchange (TSI) was successfully implemented on two and three optical packets at a data rate of 10 Gb/s. Therefore, the functions of TSI on N packets should be implemented easily by the use of N-1 stage optical buffer. On the basis of the above experiment, we carried out the TSI experiment on four packets with the same two-stage experimental setup. Furthermore, packets compression on three optical packets was also carried out with the same experimental setup. The shortest guard time of the packets compression can reach to 13 ns due to the limit of FPGA's control accuracy. Due to the use of the same optical buffer, the proposed scheme has the advantages of simple and scalable configuration, modularization, and easy integration.

Interconnecting network for switching data packets and method for switching data packets

DOEpatents

Benner, Alan Frederic; Minkenberg, Cyriel Johan Agnes; Stunkel, Craig Brian

2010-05-25

The interconnecting network for switching data packets, having data and flow control information, comprises a local packet switch element (S1) with local input buffers (I(1,1) . . . I(1,y)) for buffering the incoming data packets, a remote packet switch element (S2) with remote input buffers (I(2,1) . . . I(2,y)) for buffering the incoming data packets, and data lines (L) for interconnecting the local and the remote packet switch elements (S1, S2). The interconnecting network further comprises a local and a remote arbiter (A1, A2) which are connected via control lines (CL) to the input buffers (I(1,1) . . . I(1,y), I(2,1) . . . I(2,y)), and which are formed such that they can provide that the flow control information is transmitted via the data lines (L) and the control lines (CL).

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks

PubMed Central

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV. PMID:27258013

Space lab system analysis

NASA Technical Reports Server (NTRS)

Ingels, F. M.; Rives, T. B.

1987-01-01

An analytical analysis of the HOSC Generic Peripheral processing system was conducted. The results are summarized and they indicate that the maximum delay in performing screen change requests should be less than 2.5 sec., occurring for a slow VAX host to video screen I/O rate of 50 KBps. This delay is due to the average I/O rate from the video terminals to their host computer. Software structure of the main computers and the host computers will have greater impact on screen change or refresh response times. The HOSC data system model was updated by a newly coded PASCAL based simulation program which was installed on the HOSC VAX system. This model is described and documented. Suggestions are offered to fine tune the performance of the ETERNET interconnection network. Suggestions for using the Nutcracker by Excelan to trace itinerate packets which appear on the network from time to time were offered in discussions with the HOSC personnel. Several visits to the HOSC facility were to install and demonstrate the simulation model.

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.

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

PubMed

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

End-to-end QoS bounds for RTP-based service subnetworks

NASA Astrophysics Data System (ADS)

Pitts, Jonathan M.; Schormans, John A.

1999-11-01

With the increasing focus on traffic prioritization to support voice-data integration in corporate intranets, practical methods are needed to dimension and manage cost efficient service partitions. This is particularly important for the provisioning of real time, delay sensitive services such as telephony and voice/video conferencing applications. Typically these can be provided over RTP/UDP/IP or ATM DBR/SBR bearers but, irrespective of the specific networking technology, the switches or routers need to implement some form of virtual buffer management with queue scheduling mechanisms to provide partitioning. The key requirement is for operators of such networks to be able to dimension the partitions and virtual buffer sizes for efficient resource utilization, instead of simply over-dimensioning. This paper draws on recent work at Queen Mary, University of London, supported by the UK Engineering and Physical Sciences Research Council, to investigate approximate analytical methods for assessing end to end delay variation bounds in cell based and packet based networks.

Investigating the efficiency of IEEE 802.15.4 for medical monitoring applications.

PubMed

Pelegris, P; Banitsas, K

2011-01-01

Recent advancements in wireless communications technologies bring us one step closer to provide reliable Telecare services as an alternative to patients staying in a hospital mainly for monitoring purposes. In this research we investigate the efficiency of IEEE 802.15.4 in a simple scenario where a patient is being monitored using an ECG and a blood analysis module. This approach binds well with assisted living solutions, by sharing the network infrastructure for both monitoring and control while taking advantage of the low power features of the protocol. Such applications are becoming more and more realistic to implement as IEEE 802.15.4 compatible hardware becomes increasingly available. Our aim is to examine the impact of Beacon and Superframe Order in the medium access delay, dropped packets, end to end delay, average retransmission attempts and consumed power focusing on this bandwidth demanding situation where the network load does not allow low duty cycles, in order to draw some conclusions on the effect that this will have to telemonitoring applications.

An Adaptive QoS Routing Solution for MANET Based Multimedia Communications in Emergency Cases

NASA Astrophysics Data System (ADS)

Ramrekha, Tipu Arvind; Politis, Christos

The Mobile Ad hoc Networks (MANET) is a wireless network deprived of any fixed central authoritative routing entity. It relies entirely on collaborating nodes forwarding packets from source to destination. This paper describes the design, implementation and performance evaluation of CHAMELEON, an adaptive Quality of Service (QoS) routing solution, with improved delay and jitter performances, enabling multimedia communication for MANETs in extreme emergency situations such as forest fire and terrorist attacks as defined in the PEACE project. CHAMELEON is designed to adapt its routing behaviour according to the size of a MANET. The reactive Ad Hoc on-Demand Distance Vector Routing (AODV) and proactive Optimized Link State Routing (OLSR) protocols are deemed appropriate for CHAMELEON through their performance evaluation in terms of delay and jitter for different MANET sizes in a building fire emergency scenario. CHAMELEON is then implemented in NS-2 and evaluated similarly. The paper concludes with a summary of findings so far and intended future work.

Advanced teleprocessing systems

NASA Astrophysics Data System (ADS)

Kleinrock, L.; Gerla, M.

1983-09-01

This Semi-Annual Technical Report covers research carried out by the Advanced Teleprocessing Systems Group at UCLA under DARPA Contract No. MDA 903-82-C-0064 covering the period from April 1, 1983 to September 30, 1983. This contract has three primary designated research areas: packet radio systems, resource sharing and allocation, and distributed processing and control. This report contains the abstracts of the publications which summarize our research results in those areas during this semi-annual period, followed by the main body of the report which consists of the Ph.D. dissertation by H. Richard Gail, "On the Optimization of Computer Network Power', conducted under the supervision of Professor Leonard Kleinrock (Principal Investigator for this contract). It addresses the tradeoff between throughput and delay involving the selection of a suitable operating point for a computer network. This tradeoff is studied through the maximization of various throughput-delay performance measures, all known as power. The models analyzed for the most part are those for a terrestrial wire network.

Assessment of atrial electromechanical delay by tissue Doppler echocardiography in obese subjects.

PubMed

Yagmur, Julide; Cansel, Mehmet; Acikgoz, Nusret; Ermis, Necip; Yagmur, Murat; Atas, Halil; Tasolar, Hakan; Karakus, Yasin; Pekdemir, Hasan; Ozdemir, Ramazan

2011-04-01

Our aim was to evaluate whether atrial electromechanical delay measured by tissue Doppler imaging (TDI), which is an early predictor of atrial fibrillation (AF) development, is prolonged in obese subjects. A total of 40 obese and 40 normal-weight subjects with normal coronary angiograms were included in this study. P-wave dispersion (PWD) was calculated on the 12-lead electrocardiogram (ECG). Systolic and diastolic left ventricular (LV) functions, inter- and intra-atrial electromechanical delay were measured by TDI and conventional echocardiography. Inter- and intra-atrial electromechanical delay were significantly longer in the obese subjects compared with the controls (44.08 ± 10.06 vs. 19.35 ± 5.94 ms and 23.63 ± 6.41 vs. 5.13 ± 2.67 ms, P < 0.0001 for both, respectively). PWD was higher in obese subjects (53.40 ± 5.49 vs. 35.95 ± 5.93 ms, P < 0.0001). Left atrial (LA) diameter, LA volume index and LV diastolic parameters were significantly different between the groups. Interatrial electromechanical delay was correlated with PWD (r = 0.409, P = 0.009), high-sensitivity C-reactive protein (hsCRP) levels (r = 0.588, P < 0.0001). Interatrial electromechanical delay was positively correlated with LA diameter, LA volume index, and LV diastolic function parameters consisting of mitral early wave (E) deceleration time (DT) and isovolumetric relaxation time (IVRT; r = 0.323, P = 0.042; r = 0.387, P = 0.014; r = 0.339, P = 0.033; r = 0.325, P = 0.041; respectively) and, negatively correlated with mitral early (E) to late (A) wave ratio (E/A) (r = -0.380, P = 0.016) and myocardial early-to-late diastolic wave ratio (E(m)/A(m)) (r = -0.326, P = 0.040). This study showed that atrial electromechanical delay is prolonged in obese subjects. Prolonged atrial electromechanical delay is due to provoked low-grade inflammation as well as LA enlargement and early LV diastolic dysfunction in obese subjects.

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 machine-learning approach for damage detection in aircraft structures using self-powered sensor data

NASA Astrophysics Data System (ADS)

Salehi, Hadi; Das, Saptarshi; Chakrabartty, Shantanu; Biswas, Subir; Burgueño, Rigoberto

2017-04-01

This study proposes a novel strategy for damage identification in aircraft structures. The strategy was evaluated based on the simulation of the binary data generated from self-powered wireless sensors employing a pulse switching architecture. The energy-aware pulse switching communication protocol uses single pulses instead of multi-bit packets for information delivery resulting in discrete binary data. A system employing this energy-efficient technology requires dealing with time-delayed binary data due to the management of power budgets for sensing and communication. This paper presents an intelligent machine-learning framework based on combination of the low-rank matrix decomposition and pattern recognition (PR) methods. Further, data fusion is employed as part of the machine-learning framework to take into account the effect of data time delay on its interpretation. Simulated time-delayed binary data from self-powered sensors was used to determine damage indicator variables. Performance and accuracy of the damage detection strategy was examined and tested for the case of an aircraft horizontal stabilizer. Damage states were simulated on a finite element model by reducing stiffness in a region of the stabilizer's skin. The proposed strategy shows satisfactory performance to identify the presence and location of the damage, even with noisy and incomplete data. It is concluded that PR is a promising machine-learning algorithm for damage detection for time-delayed binary data from novel self-powered wireless sensors.

Interface Supports Lightweight Subsystem Routing for Flight Applications

NASA Technical Reports Server (NTRS)

Lux, James P.; Block, Gary L.; Ahmad, Mohammad; Whitaker, William D.; Dillon, James W.

2010-01-01

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Proceedings of the Image Understanding Workshop, Held at Los Angeles, California November 7-8, 1979

DTIC Science & Technology

1979-11-01

8217 We. ter. incorporated a CCD field delay to r-.move the inter ace and provide a processing capability -J^a- cent lines of video. This...is, let us change notation such that i,j are running indices over the entire frame. Then the center pixel to lower right pixel combination instead...we have what we feel is a very attractive solution to inter -pro- cessor communication, and processor-to-outside- world communicaMon. The strategy

Study of the GPS inter-frequency calibration of timing receivers

NASA Astrophysics Data System (ADS)

Defraigne, P.; Huang, W.; Bertrand, B.; Rovera, D.

2018-02-01

When calibrating Global Positioning System (GPS) stations dedicated to timing, the hardware delays of P1 and P2, the P(Y)-codes on frequencies L1 and L2, are determined separately. In the international atomic time (TAI) network the GPS stations of the time laboratories are calibrated relatively against reference stations. This paper aims at determining the consistency between the P1 and P2 hardware delays (called dP1 and dP2) of these reference stations, and to look at the stability of the inter-signal hardware delays dP1-dP2 of all the stations in the network. The method consists of determining the dP1-dP2 directly from the GPS pseudorange measurements corrected for the frequency-dependent antenna phase center and the frequency-dependent ionosphere corrections, and then to compare these computed dP1-dP2 to the calibrated values. Our results show that the differences between the computed and calibrated dP1-dP2 are well inside the expected combined uncertainty of the two quantities. Furthermore, the consistency between the calibrated time transfer solution obtained from either single-frequency P1 or dual-frequency P3 for reference laboratories is shown to be about 1.0 ns, well inside the 2.1 ns uB uncertainty of a time transfer link based on GPS P3 or Precise Point Positioning. This demonstrates the good consistency between the P1 and P2 hardware delays of the reference stations used for calibration in the TAI network. The long-term stability of the inter-signal hardware delays is also analysed from the computed dP1-dP2. It is shown that only variations larger than 2 ns can be detected for a particular station, while variations of 200 ps can be detected when differentiating the results between two stations. Finally, we also show that in the differential calibration process as used in the TAI network, using the same antenna phase center or using different positions for L1 and L2 signals gives maximum differences of 200 ps on the hardware delays of the separate codes P1 and P2; however, the final impact on the P3 combination is less than 10 ps.

106-17 Telemetry Standards Recorder Data Packet Format Standard Chapter 11

DTIC Science & Technology

2017-07-01

11.2.2 PCM Data Packets ..................................................................................... 11-11 11.2.3 Time Data Packets...11-95 11.2.15 Ethernet Data Packets ................................................................................ 11-97 11.2.16 Time Space...4 Time ............................................................ 11-10 Figure 11-5. Secondary Header IEEE 1588 Time

78 FR 63228 - Determination That Potassium Citrate, 10 Milliequivalents/Packet and 20 Milliequivalents/Packet...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-23

... approved. ANDA applicants do not have to repeat the extensive clinical testing otherwise necessary to gain... mEq/packet and 20 mEq/packet, is the subject of NDA 19-647, held by Nova-K LLC, and initially...

Packet loss mitigation for biomedical signals in healthcare telemetry.

PubMed

Garudadri, Harinath; Baheti, Pawan K

2009-01-01

In this work, we propose an effective application layer solution for packet loss mitigation in the context of Body Sensor Networks (BSN) and healthcare telemetry. Packet losses occur due to many reasons including excessive path loss, interference from other wireless systems, handoffs, congestion, system loading, etc. A call for action is in order, as packet losses can have extremely adverse impact on many healthcare applications relying on BAN and WAN technologies. Our approach for packet loss mitigation is based on Compressed Sensing (CS), an emerging signal processing concept, wherein significantly fewer sensor measurements than that suggested by Shannon/Nyquist sampling theorem can be used to recover signals with arbitrarily fine resolution. We present simulation results demonstrating graceful degradation of performance with increasing packet loss rate. We also compare the proposed approach with retransmissions. The CS based packet loss mitigation approach was found to maintain up to 99% beat-detection accuracy at packet loss rates of 20%, with a constant latency of less than 2.5 seconds.

Observation of Wave Packet Distortion during a Negative-Group-Velocity Transmission

PubMed Central

Ye, Dexin; Salamin, Yannick; Huangfu, Jiangtao; Qiao, Shan; Zheng, Guoan; Ran, Lixin

2015-01-01

In Physics, causality is a fundamental postulation arising from the second law of thermodynamics. It states that, the cause of an event precedes its effect. In the context of Electromagnetics, the relativistic causality limits the upper bound of the velocity of information, which is carried by electromagnetic wave packets, to the speed of light in free space (c). In anomalously dispersive media (ADM), it has been shown that, wave packets appear to propagate with a superluminal or even negative group velocity. However, Sommerfeld and Brillouin pointed out that the “front” of such wave packets, known as the initial point of the Sommerfeld precursor, always travels at c. In this work, we investigate the negative-group-velocity transmission of half-sine wave packets. We experimentally observe the wave front and the distortion of modulated wave packets propagating with a negative group velocity in a passive artificial ADM in microwave regime. Different from previous literature on the propagation of superluminal Gaussian packets, strongly distorted sinusoidal packets with non-superluminal wave fronts were observed. This result agrees with Brillouin's assertion, i.e., the severe distortion of seemingly superluminal wave packets makes the definition of group velocity physically meaningless in the anomalously dispersive region. PMID:25631746

Multiwavelet packet entropy and its application in transmission line fault recognition and classification.

PubMed

Liu, Zhigang; Han, Zhiwei; Zhang, Yang; Zhang, Qiaoge

2014-11-01

Multiwavelets possess better properties than traditional wavelets. Multiwavelet packet transformation has more high-frequency information. Spectral entropy can be applied as an analysis index to the complexity or uncertainty of a signal. This paper tries to define four multiwavelet packet entropies to extract the features of different transmission line faults, and uses a radial basis function (RBF) neural network to recognize and classify 10 fault types of power transmission lines. First, the preprocessing and postprocessing problems of multiwavelets are presented. Shannon entropy and Tsallis entropy are introduced, and their difference is discussed. Second, multiwavelet packet energy entropy, time entropy, Shannon singular entropy, and Tsallis singular entropy are defined as the feature extraction methods of transmission line fault signals. Third, the plan of transmission line fault recognition using multiwavelet packet entropies and an RBF neural network is proposed. Finally, the experimental results show that the plan with the four multiwavelet packet energy entropies defined in this paper achieves better performance in fault recognition. The performance with SA4 (symmetric antisymmetric) multiwavelet packet Tsallis singular entropy is the best among the combinations of different multiwavelet packets and the four multiwavelet packet entropies.

Aeroacoustic directivity via wave-packet analysis of mean or base flows

NASA Astrophysics Data System (ADS)

Edstrand, Adam; Schmid, Peter; Cattafesta, Louis

2017-11-01

Noise pollution is an ever-increasing problem in society, and knowledge of the directivity patterns of the sound radiation is required for prediction and control. Directivity is frequently determined through costly numerical simulations of the flow field combined with an acoustic analogy. We introduce a new computationally efficient method of finding directivity for a given mean or base flow field using wave-packet analysis (Trefethen, PRSA 2005). Wave-packet analysis approximates the eigenvalue spectrum with spectral accuracy by modeling the eigenfunctions as wave packets. With the wave packets determined, we then follow the method of Obrist (JFM, 2009), which uses Lighthill's acoustic analogy to determine the far-field sound radiation and directivity of wave-packet modes. We apply this method to a canonical jet flow (Gudmundsson and Colonius, JFM 2011) and determine the directivity of potentially unstable wave packets. Furthermore, we generalize the method to consider a three-dimensional flow field of a trailing vortex wake. In summary, we approximate the disturbances as wave packets and extract the directivity from the wave-packet approximation in a fraction of the time of standard aeroacoustic solvers. ONR Grant N00014-15-1-2403.

Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network

DOEpatents

Chen, Dong; Eisley, Noel A.; Steinmacher-Burow, Burkhard; Heidelberger, Philip

2013-01-29

A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

Deep Packet/Flow Analysis using GPUs

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

Gong, Qian; Wu, Wenji; DeMar, Phil

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Sincemore » the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.« less

Trade Related Reading Packets for Disabled Readers.

ERIC Educational Resources Information Center

Davis, Beverly; Woodruff, Nancy S.

Six trade-related reading packets for disabled readers are provided for these trades: assemblers, baking, building maintenance, data entry, interior landscaping, and warehousing. Each packet stresses from 9 to 14 skills. Those skills common to most packets include context clues, fact or opinion, details, following directions, main idea,…

Standard services for the capture, processing, and distribution of packetized telemetry data

NASA Technical Reports Server (NTRS)

Stallings, William H.

1989-01-01

Standard functional services for the capture, processing, and distribution of packetized data are discussed with particular reference to the future implementation of packet processing systems, such as those for the Space Station Freedom. The major functions are listed under the following major categories: input processing, packet processing, and output processing. A functional block diagram of a packet data processing facility is presented, showing the distribution of the various processing functions as well as the primary data flow through the facility.

Bindings and RESTlets: A Novel Set of CoAP-Based Application Enablers to Build IoT Applications.

PubMed

Teklemariam, Girum Ketema; Van Den Abeele, Floris; Moerman, Ingrid; Demeester, Piet; Hoebeke, Jeroen

2016-08-02

Sensors and actuators are becoming important components of Internet of Things (IoT) applications. Today, several approaches exist to facilitate communication of sensors and actuators in IoT applications. Most communications go through often proprietary gateways requiring availability of the gateway for each and every interaction between sensors and actuators. Sometimes, the gateway does some processing of the sensor data before triggering actuators. Other approaches put this processing logic further in the cloud. These approaches introduce significant latencies and increased number of packets. In this paper, we introduce a CoAP-based mechanism for direct binding of sensors and actuators. This flexible binding solution is utilized further to build IoT applications through RESTlets. RESTlets are defined to accept inputs and produce outputs after performing some processing tasks. Sensors and actuators could be associated with RESTlets (which can be hosted on any device) through the flexible binding mechanism we introduced. This approach facilitates decentralized IoT application development by placing all or part of the processing logic in Low power and Lossy Networks (LLNs). We run several tests to compare the performance of our solution with existing solutions and found out that our solution reduces communication delay and number of packets in the LLN.

Prediction-Based Energy Saving Mechanism in 3GPP NB-IoT Networks.

PubMed

Lee, Jinseong; Lee, Jaiyong

2017-09-01

The current expansion of the Internet of things (IoT) demands improved communication platforms that support a wide area with low energy consumption. The 3rd Generation Partnership Project introduced narrowband IoT (NB-IoT) as IoT communication solutions. NB-IoT devices should be available for over 10 years without requiring a battery replacement. Thus, a low energy consumption is essential for the successful deployment of this technology. Given that a high amount of energy is consumed for radio transmission by the power amplifier, reducing the uplink transmission time is key to ensure a long lifespan of an IoT device. In this paper, we propose a prediction-based energy saving mechanism (PBESM) that is focused on enhanced uplink transmission. The mechanism consists of two parts: first, the network architecture that predicts the uplink packet occurrence through a deep packet inspection; second, an algorithm that predicts the processing delay and pre-assigns radio resources to enhance the scheduling request procedure. In this way, our mechanism reduces the number of random accesses and the energy consumed by radio transmission. Simulation results showed that the energy consumption using the proposed PBESM is reduced by up to 34% in comparison with that in the conventional NB-IoT method.

Application of international videoconferences for continuing medical education programs related to laparoscopic surgery.

PubMed

Huang, Ke-Jian; Cen, Gang; Qiu, Zheng-Jun; Jiang, Tao; Cao, Jun; Fu, Chun-Yu

2014-02-01

Continuing medical education (CME) is an effective way for practicing physicians to acquire up-to-date clinical information. We conducted four CME seminars in 2007-2010 endorsed by the Chinese Medical Association Council on Medical Education. Overseas telelectures and live case demonstrations were introduced in each seminar via telemedicine based on a digital video transport system. Network stability and packet loss were recorded. An anonymous mini-questionnaire was conducted to evaluate the satisfaction of attendees regarding the image and sound quality, content selection, and overall evaluation. Four telelectures and five live case demonstrations were successfully conducted. Stability of the network was maintained during each videoconference. High-quality videos of 720 × 480 pixels at the rate of 30 frames per second were shown to the entire group of attendees. The time delay between Shanghai and Fukuoka, Japan, was only 0.3 s, and the packet loss was 0%. We obtained 129 valid responses to the mini-questionnaire from a total of 146 attendees. The majority of the attendees were satisfied with the quality of transmitted images and voices and with the selected contents. The overall evaluation was ranked as excellent or good. Videoconferences are excellent channels for CME programs associated with laparoscopic training.

An Efficient Framework Model for Optimizing Routing Performance in VANETs.

PubMed

Al-Kharasani, Nori M; Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala; Hanapi, Zurina Mohd

2018-02-15

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED).

Energy consumption and control response evaluations of AODV routing in WSANs for building-temperature control.

PubMed

Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

2013-06-27

The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved.

Bindings and RESTlets: A Novel Set of CoAP-Based Application Enablers to Build IoT Applications

PubMed Central

Teklemariam, Girum Ketema; Van Den Abeele, Floris; Moerman, Ingrid; Demeester, Piet; Hoebeke, Jeroen

2016-01-01

Sensors and actuators are becoming important components of Internet of Things (IoT) applications. Today, several approaches exist to facilitate communication of sensors and actuators in IoT applications. Most communications go through often proprietary gateways requiring availability of the gateway for each and every interaction between sensors and actuators. Sometimes, the gateway does some processing of the sensor data before triggering actuators. Other approaches put this processing logic further in the cloud. These approaches introduce significant latencies and increased number of packets. In this paper, we introduce a CoAP-based mechanism for direct binding of sensors and actuators. This flexible binding solution is utilized further to build IoT applications through RESTlets. RESTlets are defined to accept inputs and produce outputs after performing some processing tasks. Sensors and actuators could be associated with RESTlets (which can be hosted on any device) through the flexible binding mechanism we introduced. This approach facilitates decentralized IoT application development by placing all or part of the processing logic in Low power and Lossy Networks (LLNs). We run several tests to compare the performance of our solution with existing solutions and found out that our solution reduces communication delay and number of packets in the LLN. PMID:27490554

Application of International Videoconferences for Continuing Medical Education Programs Related to Laparoscopic Surgery

PubMed Central

Huang, Ke-Jian; Cen, Gang; Jiang, Tao; Cao, Jun; Fu, Chun-Yu

2014-01-01

Abstract Background: Continuing medical education (CME) is an effective way for practicing physicians to acquire up-to-date clinical information. Materials and Methods: We conducted four CME seminars in 2007–2010 endorsed by the Chinese Medical Association Council on Medical Education. Overseas telelectures and live case demonstrations were introduced in each seminar via telemedicine based on a digital video transport system. Network stability and packet loss were recorded. An anonymous mini-questionnaire was conducted to evaluate the satisfaction of attendees regarding the image and sound quality, content selection, and overall evaluation. Results: Four telelectures and five live case demonstrations were successfully conducted. Stability of the network was maintained during each videoconference. High-quality videos of 720×480 pixels at the rate of 30 frames per second were shown to the entire group of attendees. The time delay between Shanghai and Fukuoka, Japan, was only 0.3 s, and the packet loss was 0%. We obtained 129 valid responses to the mini-questionnaire from a total of 146 attendees. The majority of the attendees were satisfied with the quality of transmitted images and voices and with the selected contents. The overall evaluation was ranked as excellent or good. Conclusions: Videoconferences are excellent channels for CME programs associated with laparoscopic training. PMID:23758077

Quality of Service for Real-Time Applications Over Next Generation Data Networks

NASA Technical Reports Server (NTRS)

Atiquzzaman, Mohammed; Jain, Raj

2001-01-01

This project, which started on January 1, 2000, was funded by the NASA Glenn Research Center for duration of one year. The deliverables of the project included the following tasks: (1) Study of QoS mapping between the edge and core networks envisioned in the Next Generation networks will provide us with the QoS guarantees that can be obtained from next generation networks; (2) Buffer management techniques to provide strict guarantees to real-time end-to-end applications through preferential treatment to packets belonging to real-time applications. In particular, use of ECN to help reduce the loss on high bandwidth-delay product satellite networks needs to be studied; (3) Effect of Prioritized Packet Discard to increase goodput of the network and reduce the buffering requirements in the ATM switches; (4) Provision of new IP circuit emulation services over Satellite IP backbones using MPLS will be studied; and (5) Determine the architecture and requirements for internetworking ATN and the Next Generation Internet for real-time applications. The project has been completed on time. All the objectives and deliverables of the project have been completed. Research results obtained from this project have been published in a number of papers in journals, conferences, and technical reports, included in this document.

Mapping and controlling ultrafast dynamics of highly excited H 2 molecules by VUV-IR pump-probe schemes

DOE PAGES

Sturm, F. P.; Tong, X. M.; Palacios, A.; ...

2017-01-09

Here, we used ultrashort femtosecond vacuum ultraviolet (VUV) and infrared (IR) pulses in a pump-probe scheme to map the dynamics and nonequilibrium dissociation channels of excited neutral H 2 molecules. A nuclear wave packet is created in the B 1Σmore » $$+\\atop{u}$$ state of the neutral H 2 molecule by absorption of the ninth harmonic of the driving infrared laser field. Due to the large stretching amplitude of the molecule excited in the B 1Σ$$+\\atop{u}$$ electronic state, the effective H 2 + ionization potential changes significantly as the nuclear wave packet vibrates in the bound, highly electronically and vibrationally excited B potential-energy curve. We probed such dynamics by ionizing the excited neutral molecule using time-delayed VUV-or-IR radiation. We identified the nonequilibrium dissociation channels by utilizing three-dimensional momentum imaging of the ion fragments. We also found that different dissociation channels can be controlled, to some extent, by changing the IR laser intensity and by choosing the wavelength of the probe laser light. Furthermore, we concluded that even in a benchmark molecular system such as H 2*, the interpretation of the nonequilibrium multiphoton and multicolor ionization processes is still a challenging task, requiring intricate theoretical analysis.« less

Prediction-Based Energy Saving Mechanism in 3GPP NB-IoT Networks

PubMed Central

2017-01-01

The current expansion of the Internet of things (IoT) demands improved communication platforms that support a wide area with low energy consumption. The 3rd Generation Partnership Project introduced narrowband IoT (NB-IoT) as IoT communication solutions. NB-IoT devices should be available for over 10 years without requiring a battery replacement. Thus, a low energy consumption is essential for the successful deployment of this technology. Given that a high amount of energy is consumed for radio transmission by the power amplifier, reducing the uplink transmission time is key to ensure a long lifespan of an IoT device. In this paper, we propose a prediction-based energy saving mechanism (PBESM) that is focused on enhanced uplink transmission. The mechanism consists of two parts: first, the network architecture that predicts the uplink packet occurrence through a deep packet inspection; second, an algorithm that predicts the processing delay and pre-assigns radio resources to enhance the scheduling request procedure. In this way, our mechanism reduces the number of random accesses and the energy consumed by radio transmission. Simulation results showed that the energy consumption using the proposed PBESM is reduced by up to 34% in comparison with that in the conventional NB-IoT method. PMID:28862675

Precision of FLEET Velocimetry Using High-Speed CMOS Camera Systems

NASA Technical Reports Server (NTRS)

Peters, Christopher J.; Danehy, Paul M.; Bathel, Brett F.; Jiang, Naibo; Calvert, Nathan D.; Miles, Richard B.

2015-01-01

Femtosecond laser electronic excitation tagging (FLEET) is an optical measurement technique that permits quantitative velocimetry of unseeded air or nitrogen using a single laser and a single camera. In this paper, we seek to determine the fundamental precision of the FLEET technique using high-speed complementary metal-oxide semiconductor (CMOS) cameras. Also, we compare the performance of several different high-speed CMOS camera systems for acquiring FLEET velocimetry data in air and nitrogen free-jet flows. The precision was defined as the standard deviation of a set of several hundred single-shot velocity measurements. Methods of enhancing the precision of the measurement were explored such as digital binning (similar in concept to on-sensor binning, but done in post-processing), row-wise digital binning of the signal in adjacent pixels and increasing the time delay between successive exposures. These techniques generally improved precision; however, binning provided the greatest improvement to the un-intensified camera systems which had low signal-to-noise ratio. When binning row-wise by 8 pixels (about the thickness of the tagged region) and using an inter-frame delay of 65 microseconds, precisions of 0.5 meters per second in air and 0.2 meters per second in nitrogen were achieved. The camera comparison included a pco.dimax HD, a LaVision Imager scientific CMOS (sCMOS) and a Photron FASTCAM SA-X2, along with a two-stage LaVision HighSpeed IRO intensifier. Excluding the LaVision Imager sCMOS, the cameras were tested with and without intensification and with both short and long inter-frame delays. Use of intensification and longer inter-frame delay generally improved precision. Overall, the Photron FASTCAM SA-X2 exhibited the best performance in terms of greatest precision and highest signal-to-noise ratio primarily because it had the largest pixels.

Research on a Queue Scheduling Algorithm in Wireless Communications Network

NASA Astrophysics Data System (ADS)

Yang, Wenchuan; Hu, Yuanmei; Zhou, Qiancai

This paper proposes a protocol QS-CT, Queue Scheduling Mechanism based on Multiple Access in Ad hoc net work, which adds queue scheduling mechanism to RTS-CTS-DATA using multiple access protocol. By endowing different queues different scheduling mechanisms, it makes networks access to the channel much more fairly and effectively, and greatly enhances the performance. In order to observe the final performance of the network with QS-CT protocol, we simulate it and compare it with MACA/C-T without QS-CT protocol. Contrast to MACA/C-T, the simulation result shows that QS-CT has greatly improved the throughput, delay, rate of packets' loss and other key indicators.

Analysis of interference performance of tactical radio network

NASA Astrophysics Data System (ADS)

Nie, Hao; Cai, Xiaoxia; Chen, Hong

2017-08-01

Mobile Ad hoc network has a strong military background for its development as the core technology of the backbone network of US tactical Internet. And which tactical radio network, is the war in today's tactical use of the Internet more mature form of networking, mainly used in brigade and brigade following forces. This paper analyzes the typical protocol AODV in the tactical radio network, and then carries on the networking. By adding the interference device to the whole network, the battlefield environment is simulated, and then the throughput, delay and packet loss rate are analyzed, and the performance of the whole network and the single node before and after the interference is obtained.

Steering population transfer of the Na2 molecule by an ultrashort pulse train

NASA Astrophysics Data System (ADS)

Niu, Dong-Hua; Wang, Shuo; Zhan, Wei-Shen; Tao, Hong-Cai; Wang, Si-Qi

2018-05-01

We theoretically investigate the complete population transfer among quantum states of the Na2 molecule using ultrashort pulse trains using the time-dependent wave packet method. The population accumulation of the target state can be steered by controlling the laser parameters, such as the variable pulse pairs, the different pulse widths, the time delays and the repetition period between two contiguous pulses; in particular, the pulse pairs and the pulse widths have a great effect on the population transfer. The calculations show that the ultrashort pulse train is a feasible solution, which can steer the population transfer from the initial state to the target state efficiently with lower peak intensities.

Distance-Based and Low Energy Adaptive Clustering Protocol for Wireless Sensor Networks

PubMed Central

Gani, Abdullah; Anisi, Mohammad Hossein; Ab Hamid, Siti Hafizah; Akhunzada, Adnan; Khan, Muhammad Khurram

2016-01-01

A wireless sensor network (WSN) comprises small sensor nodes with limited energy capabilities. The power constraints of WSNs necessitate efficient energy utilization to extend the overall network lifetime of these networks. We propose a distance-based and low-energy adaptive clustering (DISCPLN) protocol to streamline the green issue of efficient energy utilization in WSNs. We also enhance our proposed protocol into the multi-hop-DISCPLN protocol to increase the lifetime of the network in terms of high throughput with minimum delay time and packet loss. We also propose the mobile-DISCPLN protocol to maintain the stability of the network. The modelling and comparison of these protocols with their corresponding benchmarks exhibit promising results. PMID:27658194

Implementation of a data packet generator using pattern matching for wearable ECG monitoring systems.

PubMed

Noh, Yun Hong; Jeong, Do Un

2014-07-15

In this paper, a packet generator using a pattern matching algorithm for real-time abnormal heartbeat detection is proposed. The packet generator creates a very small data packet which conveys sufficient crucial information for health condition analysis. The data packet envelopes real time ECG signals and transmits them to a smartphone via Bluetooth. An Android application was developed specifically to decode the packet and extract ECG information for health condition analysis. Several graphical presentations are displayed and shown on the smartphone. We evaluate the performance of abnormal heartbeat detection accuracy using the MIT/BIH Arrhythmia Database and real time experiments. The experimental result confirm our finding that abnormal heart beat detection is practically possible. We also performed data compression ratio and signal restoration performance evaluations to establish the usefulness of the proposed packet generator and the results were excellent.

Retrieval of charge mobility from apparent charge packet movements in LDPE thin films

NASA Astrophysics Data System (ADS)

Meng, Jia; Zhang, Yewen; Holé, Stéphane; Zheng, Feihu; An, Zhenlian

2017-03-01

The charge packet phenomenon observed in polyethylene materials has been reported extensively during the last decades. To explain its movement, Negative Differential Mobility (NDM) theory is a competitive model among several proposed mechanisms. However, as a key concept of this theory, a sufficiently acute relationship between charge mobility and electric field has never been reported until now, which makes it hard to precisely describe the migration of charge packets with this theory. Based on the substantial negative-charge packet observations with a sufficiently by wide electric field range from 15 kV/mm to 50 kV/mm, the present contribution successfully retrieved the negative-charge mobility from the apparent charge packet movements, which reveals a much closer relationship between the NDM theory and charge packet migrations. Back simulations of charge packets with the retrieved charge mobility offer a good agreement with the experimental data.

Physical Watermarking for Securing Cyber-Physical Systems via Packet Drop Injections

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

Ozel, Omur; Weekrakkody, Sean; Sinopoli, Bruno

Physical watermarking is a well known solution for detecting integrity attacks on Cyber-Physical Systems (CPSs) such as the smart grid. Here, a random control input is injected into the system in order to authenticate physical dynamics and sensors which may have been corrupted by adversaries. Packet drops may naturally occur in a CPS due to network imperfections. To our knowledge, previous work has not considered the role of packet drops in detecting integrity attacks. In this paper, we investigate the merit of injecting Bernoulli packet drops into the control inputs sent to actuators as a new physical watermarking scheme. Withmore » the classical linear quadratic objective function and an independent and identically distributed packet drop injection sequence, we study the effect of packet drops on meeting security and control objectives. Our results indicate that the packet drops could act as a potential physical watermark for attack detection in CPSs.« less

Evaluation of a realtime, remote monitoring telemedicine system using the Bluetooth protocol and a mobile phone network.

PubMed

Jasemian, Yousef; Arendt-Nielsen, Lars

2005-01-01

A generic, realtime wireless telemedicine system has been developed that uses the Bluetooth protocol and the general packet radio service for mobile phones. The system was tested on 10 healthy volunteers, by continuous monitoring of their electrocardiograms (ECGs). Under realistic conditions, the system had 96.5% uptime, a data throughput of 3.3 kbit/s, a mean packet error rate of 8.5x10(-3) packet/s and a mean packet loss rate of 8.2x10(-3) packet/s. During 24 h testing, the total average downtime was 66 min and 90% of the periods of downtime were of only 1-3 min duration. Less than 10% of the ECGs were of unacceptable quality. Thus, the generic telemedicine system showed high reliability and performance, and the design may provide a foundation for realtime monitoring in clinical practice, for example in cardiology.

Multi-function all optical packet switch by periodic wavelength arrangement in an arrayed waveguide grating and wideband optical filters.

PubMed

Feng, Kai-Ming; Wu, Chung-Yu; Wen, Yu-Hsiang

2012-01-16

By utilizing the cyclic filtering function of an NxN arrayed waveguide grating (AWG), we propose and experimentally demonstrate a novel multi-function all optical packet switching (OPS) architecture by applying a periodical wavelength arrangement between the AWG in the optical routing/buffering unit and a set of wideband optical filters in the switched output ports to achieve the desired routing and buffering functions. The proposed OPS employs only one tunable wavelength converter at the input port to convert the input wavelength to a designated wavelength which reduces the number of active optical components and thus the complexity of the traffic control is simplified in the OPS. With the proposed OPS architecture, multiple optical packet switching functions, including arbitrary packet switching and buffering, first-in-first-out (FIFO) packet multiplexing, packet demultiplexing and packet add/drop multiplexing, have been successfully demonstrated.

Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.

PubMed

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

PubMed Central

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736

Instrument for measurement of vacuum in sealed thin wall packets

DOEpatents

Kollie, T.G.; Thacker, L.H.; Fine, H.A.

1993-10-05

An instrument is described for the measurement of vacuum within sealed packets, the packets having a wall sufficiently thin that it can be deformed by the application of an external vacuum to small area thereof. The instrument has a detector head for placement against the deformable wall of the packet to apply the vacuum in a controlled manner to accomplish a limited deformation or lift of the wall, with this deformation or lift monitored by the application of light as via a bifurcated light pipe. Retro-reflected light through the light pipe is monitored with a photo detector. An abrupt change (e.g., a decrease) of retro-reflected light signals the wall movement such that the value of the vacuum applied through the head to achieve this initiation of movement is equal to the vacuum within the packet. In a preferred embodiment a vacuum reference plate is placed beneath the packet to ensure that no deformation occurs on the reverse surface of the packet. A packet production line model is also described. 3 figures.

Experimental evaluation of the impact of packet capturing tools for web services.

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

Choe, Yung Ryn; Mohapatra, Prasant; Chuah, Chen-Nee

Network measurement is a discipline that provides the techniques to collect data that are fundamental to many branches of computer science. While many capturing tools and comparisons have made available in the literature and elsewhere, the impact of these packet capturing tools on existing processes have not been thoroughly studied. While not a concern for collection methods in which dedicated servers are used, many usage scenarios of packet capturing now requires the packet capturing tool to run concurrently with operational processes. In this work we perform experimental evaluations of the performance impact that packet capturing process have on web-based services;more » in particular, we observe the impact on web servers. We find that packet capturing processes indeed impact the performance of web servers, but on a multi-core system the impact varies depending on whether the packet capturing and web hosting processes are co-located or not. In addition, the architecture and behavior of the web server and process scheduling is coupled with the behavior of the packet capturing process, which in turn also affect the web server's performance.« less

Error-Resilient Unequal Error Protection of Fine Granularity Scalable Video Bitstreams

NASA Astrophysics Data System (ADS)

Cai, Hua; Zeng, Bing; Shen, Guobin; Xiong, Zixiang; Li, Shipeng

2006-12-01

This paper deals with the optimal packet loss protection issue for streaming the fine granularity scalable (FGS) video bitstreams over IP networks. Unlike many other existing protection schemes, we develop an error-resilient unequal error protection (ER-UEP) method that adds redundant information optimally for loss protection and, at the same time, cancels completely the dependency among bitstream after loss recovery. In our ER-UEP method, the FGS enhancement-layer bitstream is first packetized into a group of independent and scalable data packets. Parity packets, which are also scalable, are then generated. Unequal protection is finally achieved by properly shaping the data packets and the parity packets. We present an algorithm that can optimally allocate the rate budget between data packets and parity packets, together with several simplified versions that have lower complexity. Compared with conventional UEP schemes that suffer from bit contamination (caused by the bit dependency within a bitstream), our method guarantees successful decoding of all received bits, thus leading to strong error-resilience (at any fixed channel bandwidth) and high robustness (under varying and/or unclean channel conditions).

Instrument for measurement of vacuum in sealed thin wall packets

DOEpatents

Kollie, Thomas G.; Thacker, Louis H.; Fine, H. Alan

1993-01-01

An instrument for the measurement of vacuum within sealed packets 12, the packets 12 having a wall 14 sufficiently thin that it can be deformed by the application of an external vacuum to small area thereof. The instrument has a detector head 18 for placement against the deformable wall 14 of the packet to apply the vacuum in a controlled manner to accomplish a limited deformation or lift of the wall 14, with this deformation or lift monitored by the application of light as via a bifurcated light pipe 20. Retro-reflected light through the light pipe is monitored with a photo detector 26. An abrupt change (e.g., a decrease) of retro-reflected light signals the wall movement such that the value of the vacuum applied through the head 18 to achieve this initiation of movement is equal to the vacuum Within the packet 12. In a preferred embodiment a vacuum reference plate 44 is placed beneath the packet 12 to ensure that no deformation occurs on the reverse surface 16 of the packet. A packet production line model is also described.

APC-PC Combined Scheme in Gilbert Two State Model: Proposal and Study

NASA Astrophysics Data System (ADS)

Bulo, Yaka; Saring, Yang; Bhunia, Chandan Tilak

2017-04-01

In an automatic repeat request (ARQ) scheme, a packet is retransmitted if it gets corrupted due to transmission errors caused by the channel. However, an erroneous packet may contain both erroneous bits and correct bits and hence it may still contain useful information. The receiver may be able to combine this information from multiple erroneous copies to recover the correct packet. Packet combining (PC) is a simple and elegant scheme of error correction in transmitted packet, in which two received copies are XORed to obtain the bit location of erroneous bits. Thereafter, the packet is corrected by bit inversion of bit located as erroneous. Aggressive packet combining (APC) is a logic extension of PC primarily designed for wireless communication with objective of correcting error with low latency. PC offers higher throughput than APC, but PC does not correct double bit errors if occur in same bit location of erroneous copies of the packet. A hybrid technique is proposed to utilize the advantages of both APC and PC while attempting to remove the limitation of both. In the proposed technique, applications of APC-PC on Gilbert two state model has been studied. The simulation results show that the proposed technique offers better throughput than the conventional APC and lesser packet error rate than PC scheme.

Application of the wavelet packet transform to vibration signals for surface roughness monitoring in CNC turning operations

NASA Astrophysics Data System (ADS)

García Plaza, E.; Núñez López, P. J.

2018-01-01

The wavelet packet transform method decomposes a time signal into several independent time-frequency signals called packets. This enables the temporary location of transient events occurring during the monitoring of the cutting processes, which is advantageous in monitoring condition and fault diagnosis. This paper proposes the monitoring of surface roughness using a single low cost sensor that is easily implemented in numerical control machine tools in order to make on-line decisions on workpiece surface finish quality. Packet feature extraction in vibration signals was applied to correlate the sensor signals to measured surface roughness. For the successful application of the WPT method, mother wavelets, packet decomposition level, and appropriate packet selection methods should be considered, but are poorly understood aspects in the literature. In this novel contribution, forty mother wavelets, optimal decomposition level, and packet reduction methods were analysed, as well as identifying the effective frequency range providing the best packet feature extraction for monitoring surface finish. The results show that mother wavelet biorthogonal 4.4 in decomposition level L3 with the fusion of the orthogonal vibration components (ax + ay + az) were the best option in the vibration signal and surface roughness correlation. The best packets were found in the medium-high frequency DDA (6250-9375 Hz) and high frequency ADA (9375-12500 Hz) ranges, and the feed acceleration component ay was the primary source of information. The packet reduction methods forfeited packets with relevant features to the signal, leading to poor results for the prediction of surface roughness. WPT is a robust vibration signal processing method for the monitoring of surface roughness using a single sensor without other information sources, satisfactory results were obtained in comparison to other processing methods with a low computational cost.

Children's Literature with a Science Emphasis: Twenty Teacher-Developed K-8 Activity Packets.

ERIC Educational Resources Information Center

Butler, Malcolm B.

This document features 10 science activity packets developed for elementary students by science teachers in a graduate seminar. The activity packets were designed to cover existing commercial children's books on specific content areas. The 10 activity packets are: (1) "Bringing the Rain to Kapiti Plain," which explains the water cycle;…

[KIND Worksheet Packet: Wild Animals (Junior).

ERIC Educational Resources Information Center

National Association for Humane and Environmental Education, East Haddam, CT.

This packet is the junior part of a series of worksheet packets available at both junior (grades 3-4) and senior (grades 5-6) levels that covers a variety of humane and environmental topics. Each packet includes 10 worksheets, all of which originally appeared in past issues of the annual teaching magazine "KIND (Kids in Nature's Defense)…

[KIND Worksheet Packet: Wild Animals (Senior).

ERIC Educational Resources Information Center

National Association for Humane and Environmental Education, East Haddam, CT.

This packet is the senior part of a series of worksheet packets available at both junior (grades 3-4) and senior (grades 5-6) levels that covers a variety of humane and environmental topics. Each packet includes 10 worksheets, all of which originally appeared in past issues of the annual teaching magazine "KIND (Kids in Nature's Defense)…

Accounting Clerk Guide, Exercise and Worksheet Packet--Part I.

ERIC Educational Resources Information Center

Foster, Brian; And Others

The exercise and worksheet packet is part of an eight volume unit for grades 10, 11, and 12, designed for individualized progression in preparing students for entry into the occupation of accounting clerk. The exercise and worksheet packet contains a copy of every worksheet in the learner packet for lessons 1 through 11 so that the instructor can…

Radiology/Imaging. Clinical Rotation. Instructor's Packet and Student Study Packet.

ERIC Educational Resources Information Center

Texas Univ., Austin. Extension Instruction and Materials Center.

The instructor's packet, the first of two packets, is one of a series of materials designed to help students who are investigating the activities within a radiology department or considering any of the imaging technologies as a career. The material is designed to relate training experience to information studied in the classroom. This packet…

106-17 Telemetry Standards Chapter 7 Packet Telemetry Downlink

DTIC Science & Technology

2017-07-31

Acronyms IP Internet Protocol IPv4 Internet Protocol, Version 4 IPv6 Internet Protocol, Version 6 LLP low-latency PTDP MAC media access control...o 4’b0101: PT Internet Protocol (IP) Packet o 4’b0110: PT Chapter 24 TmNSMessage Packet o 4’b0111 – 4’b1111: Reserved • Fragment (bits 17 – 16...packet is defined as a free -running 12-bit counter. The PT test counter packet shall consist of one 12-bit word and shall be encoded as one 24-bit

Path integration of head direction: updating a packet of neural activity at the correct speed using axonal conduction delays.

PubMed

Walters, Daniel; Stringer, Simon; Rolls, Edmund

2013-01-01

The head direction cell system is capable of accurately updating its current representation of head direction in the absence of visual input. This is known as the path integration of head direction. An important question is how the head direction cell system learns to perform accurate path integration of head direction. In this paper we propose a model of velocity path integration of head direction in which the natural time delay of axonal transmission between a linked continuous attractor network and competitive network acts as a timing mechanism to facilitate the correct speed of path integration. The model effectively learns a "look-up" table for the correct speed of path integration. In simulation, we show that the model is able to successfully learn two different speeds of path integration across two different axonal conduction delays, and without the need to alter any other model parameters. An implication of this model is that, by learning look-up tables for each speed of path integration, the model should exhibit a degree of robustness to damage. In simulations, we show that the speed of path integration is not significantly affected by degrading the network through removing a proportion of the cells that signal rotational velocity.

Path Integration of Head Direction: Updating a Packet of Neural Activity at the Correct Speed Using Axonal Conduction Delays

PubMed Central

Walters, Daniel; Stringer, Simon; Rolls, Edmund

2013-01-01

The head direction cell system is capable of accurately updating its current representation of head direction in the absence of visual input. This is known as the path integration of head direction. An important question is how the head direction cell system learns to perform accurate path integration of head direction. In this paper we propose a model of velocity path integration of head direction in which the natural time delay of axonal transmission between a linked continuous attractor network and competitive network acts as a timing mechanism to facilitate the correct speed of path integration. The model effectively learns a “look-up” table for the correct speed of path integration. In simulation, we show that the model is able to successfully learn two different speeds of path integration across two different axonal conduction delays, and without the need to alter any other model parameters. An implication of this model is that, by learning look-up tables for each speed of path integration, the model should exhibit a degree of robustness to damage. In simulations, we show that the speed of path integration is not significantly affected by degrading the network through removing a proportion of the cells that signal rotational velocity. PMID:23526976

A novel LTE scheduling algorithm for green technology in smart grid.

PubMed

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

PubMed Central

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703

Demonstration of a linear optical true-time delay device by use of a microelectromechanical mirror array.

PubMed

Rader, Amber; Anderson, Betty Lise

2003-03-10

We present the design and proof-of-concept demonstration of an optical device capable of producing true-time delay(s) (TTD)(s) for phased array antennas. This TTD device uses a free-space approach consisting of a single microelectromechanical systems (MEMS) mirror array in a multiple reflection spherical mirror configuration based on the White cell. Divergence is avoided by periodic refocusing by the mirrors. By using the MEMS mirror to switch between paths of different lengths, time delays are generated. Six different delays in 1-ns increments were demonstrated by using the Texas Instruments Digital Micromirror Device as the switching element. Losses of 1.6 to 5.2 dB per bounce and crosstalk of -27 dB were also measured, both resulting primarily from diffraction from holes in each pixel and the inter-pixel gaps of the MEMS.

Experience with the EURECA Packet Telemetry and Packet Telecommand system

NASA Technical Reports Server (NTRS)

Sorensen, Erik Mose; Ferri, Paolo

1994-01-01

The European Retrieval Carrier (EURECA) was launched on its first flight on the 31st of July 1992 and retrieved on the 29th of June 1993. EURECA is characterized by several new on-board features, most notably Packet telemetry, and a partial implementation of packet telecommanding, the first ESA packetised spacecraft. Today more than one year after the retrieval the data from the EURECA mission has to a large extent been analysed and we can present some of the interesting results. This paper concentrates on the implementation and operational experience with the EURECA Packet Telemetry and Packet Telecommanding. We already discovered during the design of the ground system that the use of packet telemetry has major impact on the overall design and that processing of packet telemetry may have significant effect on the computer loading and sizing. During the mission a number of problems were identified with the on-board implementation resulting in very strange anomalous behaviors. Many of these problems directly violated basic assumptions for the design of the ground segment adding to the strange behavior. The paper shows that the design of a telemetry packet system should be flexible enough to allow a rapid configuration of the telemetry processing in order to adapt it to the new situation in case of an on-board failure. The experience gained with the EURECA mission control should be used to improve ground systems for future missions.

Getting a Raise. Cooperative Work Experience Learning Activity Packet: Series on Job Entry and Adjustment; Packet Seven.

ERIC Educational Resources Information Center

Herschbach, Dennis R.; And Others

This student booklet is seventh in an illustrated series of eleven learning activity packets for use in teaching job hunting and application procedures and the management of wages to secondary students. Two units are included in this packet, one explaining the differences between periodic and merit pay increases and between flat amount and…

A Practical Terrestrial Packet Radio Network.

DTIC Science & Technology

1983-11-01

12 Howard Frank, Israel Gitman and Richard Van Slyke , "Packet Radio System--Network Considerations," AFIPS Conference Proceedings, Anaheim, 1975...p, 1396. 33 Howard Frank, Israel Gitman and Richard Van Slyke, "Packet Radio System--Network Considerations," AFIPS...44, 1975 NCC, Anaheim, pp. 233-242. J 149 I : Frank, Howard, Israel Gitman and Richard Van Slyke, "Packet Radio System — Network

Your Paycheck. Cooperative Work Experience Learning Activity Packet: Series on Job Entry and Adjustment; Packet Five.

ERIC Educational Resources Information Center

Herschbach, Dennis R.; And Others

This student booklet is fifth in an illustrated series of eleven learning activity packets for use in teaching job hunting and application procedures and the management of wages to secondary students. Two units are included in this packet: the first describing the various ways of being paid: salary (including overtime and compensatory time),…

Precise Interval Timer for Software Defined Radio

NASA Technical Reports Server (NTRS)

Pozhidaev, Aleksey (Inventor)

2014-01-01

A precise digital fractional interval timer for software defined radios which vary their waveform on a packet-by-packet basis. The timer allows for variable length in the preamble of the RF packet and allows to adjust boundaries of the TDMA (Time Division Multiple Access) Slots of the receiver of an SDR based on the reception of the RF packet of interest.

Work Hardening, Dislocation Structure, and Load Partitioning in Lath Martensite Determined by In Situ Neutron Diffraction Line Profile Analysis

NASA Astrophysics Data System (ADS)

Harjo, Stefanus; Kawasaki, Takuro; Tomota, Yo; Gong, Wu; Aizawa, Kazuya; Tichy, Geza; Shi, Zengmin; Ungár, Tamas

2017-09-01

A lath martensite steel containing 0.22 mass pct carbon was analyzed in situ during tensile deformation by high-resolution time-of-flight neutron diffraction to clarify the large work-hardening behavior at the beginning of plastic deformation. The diffraction peaks in plastically deformed states exhibit asymmetries as the reflection of redistributions of the stress and dislocation densities/arrangements in two lath packets: soft packet, where the dislocation glides are favorable, and hard packet, where they are unfavorable. The dislocation density was as high as 1015 m-2 in the as-heat-treated state. During tensile straining, the load and dislocation density became different between the two lath packets. The dislocation character and arrangement varied in the hard packet but hardly changed in the soft packet. In the hard packet, dislocations that were mainly screw-type in the as-heat-treated state became primarily edge-type and rearranged towards a dipole character related to constructing cell walls. The hard packet played an important role in the work hardening in martensite, which could be understood by considering the increase in dislocation density along with the change in dislocation arrangement.

Packet utilisation definitions for the ESA XMM mission

NASA Technical Reports Server (NTRS)

Nye, H. R.

1994-01-01

XMM, ESA's X-Ray Multi-Mirror satellite, due for launch at the end of 1999 will be the first ESA scientific spacecraft to implement the ESA packet telecommand and telemetry standards and will be the first ESOC-controlled science mission to take advantage of the new flight control system infrastructure development (based on object-oriented design and distributed-system architecture) due for deployment in 1995. The implementation of the packet standards is well defined at packet transport level. However, the standard relevant to the application level (the ESA Packet Utilization Standard) covers a wide range of on-board 'services' applicable in varying degrees to the needs of XMM. In defining which parts of the ESA PUS to implement, the XMM project first considered the mission objectives and the derived operations concept and went on to identify a minimum set of packet definitions compatible with these aspects. This paper sets the scene as above and then describes the services needed for XMM and the telecommand and telemetry packet types necessary to support each service.

100G Ethernet in the wild - first experiences

NASA Astrophysics Data System (ADS)

Hoeft, Bruno; Stoy, Robert; Schröder, Frank; Reymund, Aurelie; Niederberger, Ralf; Mextorf, Olaf; Werner, Sabine

2011-12-01

A 100 Gigabit Testbed was established in a collaboration of 6 partners. Three industry partners have contributed the fiber infrastructure, the DWDM equipment, as well as the required routers. 447 kilometer was the distance of the wide area testbed established in collaboration with the German NREN DFN between Karlsruhe Institute of Technology and Forschungszentrum Jülich Before starting, DFN assured the quality of the fiber infrastructure, the operation of the DWDM systems at both locations, as well as the connection of the routers to this WAN link with a bandwidth of 100GE. 12*10GE interfaces were available at each site for connecting the local testnodes to the routers. A monitoring and measurement framework was installed for recording the most important IP network performance metrics, among them the One Way Delay (OWD) and its Variation, Packet Loss and Packet Reordering. The delay measurements were conducted between the GPS time synchronized Hades[1]measurement nodes at each location. Additionally all relevant counters at the routers have been recorded using a SNMP based Network Manangement Station and supplemented special command line interface output gathering and parsing scripts. The interfaces statistics were stored in 60 second intervals. The aim of the testbed was to demonstrate a failure-free transmission of one or more IP datastreams over 100GE during the whole period of 4 weeks.This included the evaluation of the 100 Gbit/s optical transmission system, the 100GE interfaces between the routers and the optical system, and the evaluation of a sustained 100GE transmission as well as the evaluation of the use of 100GE in a production like environment. The evaluation included a circulated (in a routing loop) tunable load between 1 and 100 Gbit/s, measurement of transmission quality of TCP and UDP datastreams between the endsystems, measurements of one way latency, a ramping up data transmission from approx. 8 Gbit/s up to 96 Gbit/s.

Scattering of accelerated wave packets

NASA Astrophysics Data System (ADS)

Longhi, S.; Horsley, S. A. R.; Della Valle, G.

2018-03-01

Wave-packet scattering from a stationary potential is significantly modified when the wave packet is subject to an external time-dependent force during the interaction. In the semiclassical limit, wave-packet motion is simply described by Newtonian equations, and the external force can, for example, cancel the potential force, making a potential barrier transparent. Here we consider wave-packet scattering from reflectionless potentials, where in general the potential becomes reflective when probed by an accelerated wave packet. In the particular case of the recently introduced class of complex Kramers-Kronig potentials we show that a broad class of time-dependent forces can be applied without inducing any scattering, while there is a breakdown of the reflectionless property when there is a broadband distribution of initial particle momentum, involving both positive and negative components.

Analysis of the packet formation process in packet-switched networks

NASA Astrophysics Data System (ADS)

Meditch, J. S.

Two new queueing system models for the packet formation process in packet-switched telecommunication networks are developed, and their applications in process stability, performance analysis, and optimization studies are illustrated. The first, an M/M/1 queueing system characterization of the process, is a highly aggregated model which is useful for preliminary studies. The second, a marked extension of an earlier M/G/1 model, permits one to investigate stability, performance characteristics, and design of the packet formation process in terms of the details of processor architecture, and hardware and software implementations with processor structure and as many parameters as desired as variables. The two new models together with the earlier M/G/1 characterization span the spectrum of modeling complexity for the packet formation process from basic to advanced.

Detecting illegal intra-corporeal cocaine containers: Which factors influence their density?

PubMed

Platon, Alexandra; Herrera, Bruno; Becker, Minerva; Perneger, Thomas; Getaz, Laurent; Wolff, Hans; Lock, Eric; Rutschmann, Olivier; Poletti, Pierre-Alexandre

2018-05-30

To determine parameters related to hyperdensity (>40 HU) of intra-corporeal cocaine packets on low-dose CT (LDCT); hyperdensity increases detectability on abdominal radiographs. LDCT showing drug packets (n = 46) were analyzed for mean radiological density and packets volume. Following expulsion, packets weight and cocaine concentration were measured. Hypercompaction was defined as >0.9 g/cm 3 . Packets were hyperdense in 33 cases (72%). Mean compaction was 1.0 g/cm 3 , mean density 118.5 HU and mean cocaine concentration 44.2%. On multivariate analysis, only high compaction remained significantly related to hyperdensity (p = 0.001). Compaction >0.9 g/cm 3 is the only parameter significantly associated with hyperdense packets. Copyright © 2018 Elsevier Inc. All rights reserved.

Combining multi-layered bitmap files using network specific hardware

DOEpatents

DuBois, David H [Los Alamos, NM; DuBois, Andrew J [Santa Fe, NM; Davenport, Carolyn Connor [Los Alamos, NM

2012-02-28

Images and video can be produced by compositing or alpha blending a group of image layers or video layers. Increasing resolution or the number of layers results in increased computational demands. As such, the available computational resources limit the images and videos that can be produced. A computational architecture in which the image layers are packetized and streamed through processors can be easily scaled so to handle many image layers and high resolutions. The image layers are packetized to produce packet streams. The packets in the streams are received, placed in queues, and processed. For alpha blending, ingress queues receive the packetized image layers which are then z sorted and sent to egress queues. The egress queue packets are alpha blended to produce an output image or video.

Integrated SeismoGeodetic Systsem with High-Resolution, Real-Time GNSS and Accelerometer Observation For Earthquake Early Warning Application.

NASA Astrophysics Data System (ADS)

Passmore, P. R.; Jackson, M.; Zimakov, L. G.; Raczka, J.; Davidson, P.

2014-12-01

The key requirements for Earthquake Early Warning and other Rapid Event Notification Systems are: Quick delivery of digital data from a field station to the acquisition and processing center; Data integrity for real-time earthquake notification in order to provide warning prior to significant ground shaking in the given target area. These two requirements are met in the recently developed Trimble SG160-09 SeismoGeodetic System, which integrates both GNSS and acceleration measurements using the Kalman filter algorithm to create a new high-rate (200 sps), real-time displacement with sufficient accuracy and very low latency for rapid delivery of the acquired data to a processing center. The data acquisition algorithm in the SG160-09 System provides output of both acceleration and displacement digital data with 0.2 sec delay. This is a significant reduction in the time interval required for real-time transmission compared to data delivery algorithms available in digitizers currently used in other Earthquake Early Warning networks. Both acceleration and displacement data are recorded and transmitted to the processing site in a specially developed Multiplexed Recording Format (MRF) that minimizes the bandwidth required for real-time data transmission. In addition, a built in algorithm calculates the τc and Pd once the event is declared. The SG160-09 System keeps track of what data has not been acknowledged and re-transmits the data giving priority to current data. Modified REF TEK Protocol Daemon (RTPD) receives the digital data and acknowledges data received without error. It forwards this "good" data to processing clients of various real-time data processing software including Earthworm and SeisComP3. The processing clients cache packets when a data gap occurs due to a dropped packet or network outage. The cache packet time is settable, but should not exceed 0.5 sec in the Earthquake Early Warning network configuration. The rapid data transmission algorithm was tested with different communication media, including Internet, DSL, Wi-Fi, GPRS, etc. The test results show that the data latency via most communication media do not exceed 0.5 sec nominal from a first sample in the data packet. Detailed acquisition algorithm and results of data transmission via different communication media are presented.

Polling-Based High-Bit-Rate Packet Transfer in a Microcellular Network to Allow Fast Terminals

NASA Astrophysics Data System (ADS)

Hoa, Phan Thanh; Lambertsen, Gaute; Yamada, Takahiko

A microcellular network will be a good candidate for the future broadband mobile network. It is expected to support high-bit-rate connection for many fast mobile users if the handover is processed fast enough to lessen its impact on QoS requirements. One of the promising techniques is believed to use for the wireless interface in such a microcellular network is the WLAN (Wireless LAN) technique due to its very high wireless channel rate. However, the less capability of mobility support of this technique must be improved to be able to expand its utilization for the microcellular environment. The reason of its less support mobility is large handover latency delay caused by contention-based handover to the new BS (base station) and delay of re-forwarding data from the old to new BS. This paper presents a proposal of multi-polling and dynamic LMC (Logical Macro Cell) to reduce mentioned above delays. Polling frame for an MT (Mobile Terminal) is sent from every BS belonging to the same LMC — a virtual single macro cell that is a multicast group of several adjacent micro-cells in which an MT is communicating. Instead of contending for the medium of a new BS during handover, the MT responds to the polling sent from that new BS to enable the transition. Because only one BS of the LMC receives the polling ACK (acknowledgement) directly from the MT, this ACK frame has to be multicast to all BSs of the same LMC through the terrestrial network to continue sending the next polling cycle at each BS. Moreover, when an MT hands over to a new cell, its current LMC is switched over to a newly corresponding LMC to prevent the future contending for a new LMC. By this way, an MT can do handover between micro-cells of an LMC smoothly because the redundant resource is reserved for it at neighboring cells, no need to contend with others. Our simulation results using the OMNeT++ simulator illustrate the performance achievements of the multi-polling and dynamic LMC scheme in eliminating handover latency, packet loss and keeping mobile users' throughput stable in the high traffic load condition though it causes somewhat overhead on the neighboring cells.

The exact thermal rotational spectrum of a two-dimensional rigid rotor obtained using Gaussian wave packet dynamics

NASA Technical Reports Server (NTRS)

Reimers, J. R.; Heller, E. J.

1985-01-01

The exact thermal rotational spectrum of a two-dimensional rigid rotor is obtained using Gaussian wave packet dynamics. The spectrum is obtained by propagating, without approximation, infinite sets of Gaussian wave packets. These sets are constructed so that collectively they have the correct periodicity, and indeed, are coherent states appropriate to this problem. Also, simple, almost classical, approximations to full wave packet dynamics are shown to give results which are either exact or very nearly exact. Advantages of the use of Gaussian wave packet dynamics over conventional linear response theory are discussed.

Bidirectional QoS support for novelty detection applications based on hierarchical wireless sensor network model

NASA Astrophysics Data System (ADS)

Edwards, Mark; Hu, Fei; Kumar, Sunil

2004-10-01

The research on the Novelty Detection System (NDS) (called as VENUS) at the authors' universities has generated exciting results. For example, we can detect an abnormal behavior (such as cars thefts from the parking lot) from a series of video frames based on the cognitively motivated theory of habituation. In this paper, we would like to describe the implementation strategies of lower layer protocols for using large-scale Wireless Sensor Networks (WSN) to NDS with Quality-of-Service (QoS) support. Wireless data collection framework, consisting of small and low-power sensor nodes, provides an alternative mechanism to observe the physical world, by using various types of sensing capabilities that include images (and even videos using Panoptos), sound and basic physical measurements such as temperature. We do not want to lose any 'data query command' packets (in the downstream direction: sink-to-sensors) or have any bit-errors in them since they are so important to the whole sensor network. In the upstream direction (sensors-to-sink), we may tolerate the loss of some sensing data packets. But the 'interested' sensing flow should be assigned a higher priority in terms of multi-hop path choice, network bandwidth allocation, and sensing data packet generation frequency (we hope to generate more sensing data packet for that novel event in the specified network area). The focus of this paper is to investigate MAC-level Quality of Service (QoS) issue in Wireless Sensor Networks (WSN) for Novelty Detection applications. Although QoS has been widely studied in other types of networks including wired Internet, general ad hoc networks and mobile cellular networks, we argue that QoS in WSN has its own characteristics. In wired Internet, the main QoS parameters include delay, jitter and bandwidth. In mobile cellular networks, two most common QoS metrics are: handoff call dropping probability and new call blocking probability. Since the main task of WSN is to detect and report events, the most important QoS parameters should include sensing data packet transmission reliability, lifetime extension degree from sensor sleeping control, event detection latency, congestion reduction level through removal of redundant sensing data. In this paper, we will focus on the following bi-directional QoS topics: (1) Downstream (sink-to-sensor) QoS: Reliable data query command forwarding to particular sensor(s). In other words, we do not want to lose the query command packets; (2) Upstream (sensor-to-sink) QoS: transmission of sensed data with priority control. The more interested data that can help in novelty detection should be transmitted on an optimal path with higher reliability. We propose the use of Differentiated Data Collection. Due to the large-scale nature and resource constraints of typical wireless sensor networks, such as limited energy, small memory (typically RAM < 4K bytes) and short communication range, the above problems become even more challenging. Besides QoS support issue, we will also describe our low-energy Sensing Data Transmission network Architecture. Our research results show the scalability and energy-efficiency of our proposed WSN QoS schemes.

Local inhibition of GABA affects precedence effect in the inferior colliculus

PubMed Central

Wang, Yanjun; Wang, Ningyu; Wang, Dan; Jia, Jun; Liu, Jinfeng; Xie, Yan; Wen, Xiaohui; Li, Xiaoting

2014-01-01

The precedence effect is a prerequisite for faithful sound localization in a complex auditory environment, and is a physiological phenomenon in which the auditory system selectively suppresses the directional information from echoes. Here we investigated how neurons in the inferior colliculus respond to the paired sounds that produce precedence-effect illusions, and whether their firing behavior can be modulated through inhibition with gamma-aminobutyric acid (GABA). We recorded extracellularly from 36 neurons in rat inferior colliculus under three conditions: no injection, injection with saline, and injection with gamma-aminobutyric acid. The paired sounds that produced precedence effects were two identical 4-ms noise bursts, which were delivered contralaterally or ipsilaterally to the recording site. The normalized neural responses were measured as a function of different inter-stimulus delays and half-maximal interstimulus delays were acquired. Neuronal responses to the lagging sounds were weak when the inter-stimulus delay was short, but increased gradually as the delay was lengthened. Saline injection produced no changes in neural responses, but after local gamma-aminobutyric acid application, responses to the lagging stimulus were suppressed. Application of gamma-aminobutyric acid affected the normalized response to lagging sounds, independently of whether they or the paired sounds were contralateral or ipsilateral to the recording site. These observations suggest that local inhibition by gamma-aminobutyric acid in the rat inferior colliculus shapes the neural responses to lagging sounds, and modulates the precedence effect. PMID:25206830

Combined guaranteed throughput and best effort network-on-chip

DOEpatents

Chen, Gregory K.; Anders, Mark A.; Kaul, Himanshu; Krishnamurthy, Ram K.; Stillmaker, Aaron T.

2018-05-22

A first packet-switched reservation request is received. Data associated with the first packet-switched reservation request is communicated through a first circuit-switched channel according to a best effort communication scheme. A second packet-switched reservation request is received. Data associated with the second packet-switched reservation request is communicated through a second circuit-switched channel according to a guaranteed throughput communication scheme.

Design, development, and evaluation of printed educational materials for evidence-based practice dissemination.

PubMed

Williams, Jessica R; Caceda-Castro, Lizbeth E; Dusablon, Tracy; Stipa, Melissa

2016-06-01

Printed educational materials (PEMs) are one of the most common dissemination strategies for communicating information about evidence-based practices (EBPs) to healthcare professionals and organizations; however, evidence is conflicting regarding the conditions and circumstances in which PEMs are effective in achieving desired outcomes. The effectiveness of PEMs is largely dependent on the manner in which they are developed. This article reports on the findings from a comprehensive review of the literature regarding best practices for creating PEMs for health professionals and illustrates how these practices were used to design, develop, and evaluate an informational packet to disseminate information about motivational interviewing. The informational packet was disseminated to 92 community health organizations not currently implementing motivational interviewing. Evaluation surveys were completed by 212 healthcare directors and providers to examine quality and perceived helpfulness of the packets, intention to use information from the packet, and sharing of the packet with others. Associations between these and individual and organizational characteristics were also assessed. Overall, the packet was perceived as appropriate and helpful in making a decision to implement motivational interviewing. For example, 84.9% of participants stated that the content was 'about right'. Three-quarters (75.9%) of participants reported plans to use the information in the packet and almost half (46.7%) reported talking about the packet with others in the organizations. Higher levels of baseline interest in motivational interviewing adoption were significantly related to packet use and wanting to utilize additional resources presented in the packet. Positive attitudes toward EBPs were also significantly related to the desire to obtain resources in the packet. Perceptions of the packet did not differ by type of community health organization (i.e., community health center, community behavioral health organization) or whether the individual was a director or provider. Results indicated that PEMs can be a useful tool to disseminate EBP information to healthcare professionals particularly if they have a prior interest in the EBP and have general attitudes supportive of EBPs. Recommendations for the improvement of future PEMs are discussed.

Environment Resource Packets Get Wide Use

ERIC Educational Resources Information Center

Chemical and Engineering News, 1974

1974-01-01

Announces the availability of the resource packet entitled "Noise Pollution," the third in the series prepared by the University of Maryland, and the main topics which will be covered in the remaining three packets. (CC)

PULSAR SIGNAL DENOISING METHOD BASED ON LAPLACE DISTRIBUTION IN NO-SUBSAMPLING WAVELET PACKET DOMAIN

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

Wenbo, Wang; Yanchao, Zhao; Xiangli, Wang

2016-11-01

In order to improve the denoising effect of the pulsar signal, a new denoising method is proposed in the no-subsampling wavelet packet domain based on the local Laplace prior model. First, we count the true noise-free pulsar signal’s wavelet packet coefficient distribution characteristics and construct the true signal wavelet packet coefficients’ Laplace probability density function model. Then, we estimate the denosied wavelet packet coefficients by using the noisy pulsar wavelet coefficients based on maximum a posteriori criteria. Finally, we obtain the denoisied pulsar signal through no-subsampling wavelet packet reconstruction of the estimated coefficients. The experimental results show that the proposed method performs better when calculating the pulsar time of arrival than the translation-invariant wavelet denoising method.

Magnetic helicity conservation and inverse energy cascade in electron magnetohydrodynamic wave packets.

PubMed

Cho, Jungyeon

2011-05-13

Electron magnetohydrodynamics (EMHD) provides a fluidlike description of small-scale magnetized plasmas. An EMHD wave propagates along magnetic field lines. The direction of propagation can be either parallel or antiparallel to the magnetic field lines. We numerically study propagation of three-dimensional (3D) EMHD wave packets moving in one direction. We obtain two major results. (1) Unlike its magnetohydrodynamic (MHD) counterpart, an EMHD wave packet is dispersive. Because of this, EMHD wave packets traveling in one direction create opposite-traveling wave packets via self-interaction and cascade energy to smaller scales. (2) EMHD wave packets traveling in one direction clearly exhibit inverse energy cascade. We find that the latter is due to conservation of magnetic helicity. We compare inverse energy cascade in 3D EMHD turbulence and two-dimensional (2D) hydrodynamic turbulence.

Interception and modification of network authentication packets with the purpose of allowing alternative authentication modes

DOEpatents

Kent, Alexander Dale [Los Alamos, NM

2008-09-02

Methods and systems in a data/computer network for authenticating identifying data transmitted from a client to a server through use of a gateway interface system which are communicately coupled to each other are disclosed. An authentication packet transmitted from a client to a server of the data network is intercepted by the interface, wherein the authentication packet is encrypted with a one-time password for transmission from the client to the server. The one-time password associated with the authentication packet can be verified utilizing a one-time password token system. The authentication packet can then be modified for acceptance by the server, wherein the response packet generated by the server is thereafter intercepted, verified and modified for transmission back to the client in a similar but reverse process.

Spatial control of recollision wave packets with attosecond precision.

PubMed

Kitzler, Markus; Lezius, Matthias

2005-12-16

We propose orthogonally polarized two-color laser pulses to steer tunneling electrons with attosecond precision around the ion core. We numerically demonstrate that the angles of birth and recollision, the recollision energy, and the temporal structure of the recolliding wave packet can be controlled without stabilization of the carrier-envelope phase of the laser, and that the wave packet's properties can be described by classical relations for a point charge. This establishes unique mapping between parameters of the laser field and attributes of the recolliding wave packet. The method is capable of probing ionic wave packet dynamics with attosecond resolution from an adjustable direction and might be used as an alternative to aligning molecules. Shaping the properties of the recollision wave packet by controlling the laser field may also provide new routes for improvement of attosecond pulse generation via high harmonic radiation.

Performance analysis of signaling protocols on OBS switches

NASA Astrophysics Data System (ADS)

Kirci, Pinar; Zaim, A. Halim

2005-10-01

In this paper, Just-In-Time (JIT), Just-Enough-Time (JET) and Horizon signalling schemes for Optical Burst Switched Networks (OBS) are presented. These signaling schemes run over a core dWDM network and a network architecture based on Optical Burst Switches (OBS) is proposed to support IP, ATM and Burst traffic. In IP and ATM traffic several packets are assembled in a single packet called burst and the burst contention is handled by burst dropping. The burst length distribution in IP traffic is arbitrary between 0 and 1, and is fixed in ATM traffic at 0,5. Burst traffic on the other hand is arbitrary between 1 and 5. The Setup and Setup ack length distributions are arbitrary. We apply the Poisson model with rate λ and Self-Similar model with pareto distribution rate α to identify inter-arrival times in these protocols. We consider a communication between a source client node and a destination client node over an ingress and one or more multiple intermediate switches.We use buffering only in the ingress node. The communication is based on single burst connections in which, the connection is set up just before sending a burst and then closed as soon as the burst is sent. Our analysis accounts for several important parameters, including the burst setup, burst setup ack, keepalive messages and the optical switching protocol. We compare the performance of the three signalling schemes on the network under as burst dropping probability under a range of network scenarios.

Receiver-Assisted Congestion Control to Achieve High Throughput in Lossy Wireless Networks

NASA Astrophysics Data System (ADS)

Shi, Kai; Shu, Yantai; Yang, Oliver; Luo, Jiarong

2010-04-01

Many applications would require fast data transfer in high-speed wireless networks nowadays. However, due to its conservative congestion control algorithm, Transmission Control Protocol (TCP) cannot effectively utilize the network capacity in lossy wireless networks. In this paper, we propose a receiver-assisted congestion control mechanism (RACC) in which the sender performs loss-based control, while the receiver is performing delay-based control. The receiver measures the network bandwidth based on the packet interarrival interval and uses it to compute a congestion window size deemed appropriate for the sender. After receiving the advertised value feedback from the receiver, the sender then uses the additive increase and multiplicative decrease (AIMD) mechanism to compute the correct congestion window size to be used. By integrating the loss-based and the delay-based congestion controls, our mechanism can mitigate the effect of wireless losses, alleviate the timeout effect, and therefore make better use of network bandwidth. Simulation and experiment results in various scenarios show that our mechanism can outperform conventional TCP in high-speed and lossy wireless environments.

Enabling Secure High-Performance Wireless Ad Hoc Networking

DTIC Science & Technology

2003-05-29

destinations, consuming energy and available bandwidth. An attacker may similarly create a routing black hole, in which all packets are dropped: by sending...of the vertex cut, for example by forwarding only routing packets and not data packets, such that the nodes waste energy forwarding packets to the...with limited resources, including network bandwidth and the CPU processing capacity, memory, and battery power ( energy ) of each individual node in the

Design of an All-Optical Network Based on LCoS Technologies

NASA Astrophysics Data System (ADS)

Cheng, Yuh-Jiuh; Shiau, Yhi

2016-06-01

In this paper, an all-optical network composed of the ROADMs (reconfigurable optical add-drop multiplexer), L2/L3 optical packet switches, and the fiber optical cross-connection for fiber scheduling and measurement based on LCoS (liquid crystal on silicon) technologies is proposed. The L2/L3 optical packet switches are designed with optical output buffers. Only the header of optical packets is converted to electronic signals to control the wavelength of input ports and the packet payloads can be transparently destined to their output ports. An optical output buffer is designed to queue the packets when more than one incoming packet should reach to the same destination output port. For preserving service-packet sequencing and fairness of routing sequence, a priority scheme and a round-robin algorithm are adopted at the optical output buffer. The wavelength of input ports is designed for routing incoming packets using LCoS technologies. Finally, the proposed OFS (optical flow switch) with input buffers can quickly transfer the big data to the output ports and the main purpose of the OFS is to reduce the number of wavelength reflections. The all-optical content delivery network is comprised of the OFSs for a large amount of audio and video data transmissions in the future.

Energy efficient strategy for throughput improvement in wireless sensor networks.

PubMed

Jabbar, Sohail; Minhas, Abid Ali; Imran, Muhammad; Khalid, Shehzad; Saleem, Kashif

2015-01-23

Network lifetime and throughput are one of the prime concerns while designing routing protocols for wireless sensor networks (WSNs). However, most of the existing schemes are either geared towards prolonging network lifetime or improving throughput. This paper presents an energy efficient routing scheme for throughput improvement in WSN. The proposed scheme exploits multilayer cluster design for energy efficient forwarding node selection, cluster heads rotation and both inter- and intra-cluster routing. To improve throughput, we rotate the role of cluster head among various nodes based on two threshold levels which reduces the number of dropped packets. We conducted simulations in the NS2 simulator to validate the performance of the proposed scheme. Simulation results demonstrate the performance efficiency of the proposed scheme in terms of various metrics compared to similar approaches published in the literature.

Energy Efficient Strategy for Throughput Improvement in Wireless Sensor Networks

PubMed Central

Jabbar, Sohail; Minhas, Abid Ali; Imran, Muhammad; Khalid, Shehzad; Saleem, Kashif

2015-01-01

Network lifetime and throughput are one of the prime concerns while designing routing protocols for wireless sensor networks (WSNs). However, most of the existing schemes are either geared towards prolonging network lifetime or improving throughput. This paper presents an energy efficient routing scheme for throughput improvement in WSN. The proposed scheme exploits multilayer cluster design for energy efficient forwarding node selection, cluster heads rotation and both inter- and intra-cluster routing. To improve throughput, we rotate the role of cluster head among various nodes based on two threshold levels which reduces the number of dropped packets. We conducted simulations in the NS2 simulator to validate the performance of the proposed scheme. Simulation results demonstrate the performance efficiency of the proposed scheme in terms of various metrics compared to similar approaches published in the literature. PMID:25625902

Curvature effects on the electronic and transport properties of semiconductor films

NASA Astrophysics Data System (ADS)

Batista, F. F.; Chaves, Andrey; da Costa, D. R.; Farias, G. A.

2018-05-01

Within the effective mass approximation, we study the curvature effects on the electronic and transport properties of semiconductor films. We investigate how the geometry-induced potential resulting exclusively from periodic ripples in the film induces electronic confinement and a superlattice band structure. For fixed curvature parameters, such a confinement can be easily tuned by an external electric field, hence features of the superlattice band structure such as its energy gaps and band curvature can be controlled by an external parameter. We also show that, for some values of curvature and electric field, it is possible to obtain massless Dirac bands for a smooth curved structure. Moreover, we use a wave packet propagation method to demonstrate that the ripples are responsible for a significant inter-sub-band transition, specially for moderate values of the ripple height.

New approach to enhance and evaluate the performance of vehicle-infrastructure integration and its communication systems, final report.

DOT National Transportation Integrated Search

2010-09-01

Initial research studied the use of wireless local area networks (WLAN) protocols in Inter-Vehicle Communications : (IVC) environments. The protocols performance was evaluated in terms of measuring throughput, jitter time and : delay time. This re...

Temporal and spatial distribution of global mitigation cost: INDCs and equity

NASA Astrophysics Data System (ADS)

Liu, Jing-Yu; Fujimori, Shinichiro; Masui, Toshihiko

2016-11-01

Each country’s Intended Nationally Determined Contribution (INDC) pledges an emission target for 2025 or 2030. Here, we evaluated the INDC inter-generational and inter-regional equity by comparing scenarios with INDC emissions target in 2030 and with an immediate emission reduction associated with a global uniform carbon price using Asian-Pacific Integrated Model/Computable General Equilibrium. Both scenarios eventually achieve 2 °C target. The results showed that, as compared with an immediate emission reduction scenario, the inter-generational equity status is not favorable for INDC scenario and the future generation suffers more from delayed mitigation. Moreover, this conclusion was robust to the wide range of inequality aversion parameter that determines discount rate. On the other hand, the INDC scenario has better inter-regional equity in the early part of the century than does the immediate emission reduction scenario in which we assume a global carbon price during the period up to 2030. However, inter-regional equity worsens later in the century. The additional emissions reduction to the INDC in 2030 would improve both inter- and inter-regional equity as compared to the current INDC. We also suggest that countries should commit to more emissions reductions in the follow-up INDC communications and that continuous consideration for low-income countries is needed for global climate change cooperation after 2030.

Lack of CT scanner in a rural emergency department increases inter-facility transfers: a pilot study.

PubMed

Bergeron, Catherine; Fleet, Richard; Tounkara, Fatoumata Korika; Lavallée-Bourget, Isabelle; Turgeon-Pelchat, Catherine

2017-12-28

Rural emergency departments (EDs) are an important gateway to care for the 20% of Canadians who reside in rural areas. Less than 15% of Canadian rural EDs have access to a computed tomography (CT) scanner. We hypothesized that a significant proportion of inter-facility transfers from rural hospitals without CT scanners are for CT imaging. Our objective was to assess inter-facility transfers for CT imaging in a rural ED without a CT scanner. We selected a rural ED that offers 24/7 medical care with admission beds but no CT scanner. Descriptive statistics were collected from 2010 to 2015 on total ED visits and inter-facility transfers. Data was accessible through hospital and government databases. Between 2010 and 2014, there were respectively 13,531, 13,524, 13,827, 12,883, and 12,942 ED visits, with an average of 444 inter-facility transfers. An average of 33% (148/444) of inter-facility transfers were to a rural referral centre with a CT scan, with 84% being for CT scan. Inter-facility transfers incur costs and potential delays in patient diagnosis and management, yet current databases could not capture transfer times. Acquiring a CT scan may represent a reasonable opportunity for the selected rural hospital considering the number of required transfers.

The impact of neighboring infection on the computer virus spread in packets on scale-free networks

NASA Astrophysics Data System (ADS)

Lazfi, S.; Lamzabi, S.; Rachadi, A.; Ez-Zahraouy, H.

2017-12-01

In this paper, we introduce the effect of neighbors on the infection of packets by computer virus in the SI and SIR models using the minimal traffic routing protocol. We have applied this model to the Barabasi-Albert network to determine how intrasite and extrasite infection rates affect virus propagation through the traffic flow of information packets in both the free-flow and the congested phases. The numerical results show that when we change the intrasite infection rate λ1 while keeping constant the extrasite infection rate λ2, we get normal behavior in the congested phase: in the network, the proportion of infected packets increases to reach a peak and then decreases resulting in a simultaneous increase of the recovered packets. In contrast, when the intrasite infection rate λ1 is kept fixed, an increase of the extrasite infection rate results in two regimes: The first one is characterized by an increase of the proportion of infected packets until reaching some peak value and then decreases smoothly. The second regime is characterized by an increase of infected packets to some stationary value.

TCP Packet Trace Analysis. M.S. Thesis

NASA Technical Reports Server (NTRS)

Shepard, Timothy J.

1991-01-01

Examination of a trace of packets collected from the network is often the only method available for diagnosing protocol performance problems in computer networks. This thesis explores the use of packet traces to diagnose performance problems of the transport protocol TCP. Unfortunately, manual examination of these traces can be so tedious that effective analysis is not possible. The primary contribution of this thesis is a graphical method of displaying the packet trace which greatly reduce, the tediousness of examining a packet trace. The graphical method is demonstrated by the examination of some packet traces of typical TCP connections. The performance of two different implementations of TCP sending data across a particular network path is compared. Traces many thousands of packets long are used to demonstrate how effectively the graphical method simplifies examination of long complicated traces. In the comparison of the two TCP implementations, the burstiness of the TCP transmitter appeared to be related to the achieved throughput. A method of quantifying this burstiness is presented and its possible relevance to understanding the performance of TCP is discussed.

Path-integral analysis of the time delay for wave-packet scattering and the status of complex tunneling times

NASA Astrophysics Data System (ADS)

Sokolovski, D.; Connor, J. N. L.

1990-12-01

The wave-packet simulation (WPS) method for calculating the time a tunneling particle spends inside a one-dimensional potential barrier is reexamined using the Feynman path-integral technique. Following earlier work by Sokolovski and Baskin [Phys. Rev. A 36, 4604 (1987)], the tunneling (or traversal) time tTpack is defined as a matrix element of a classical nonlocal functional between two states that represent the initial and transmitted wave packets. These states do not lie on the same orbit in Hilbert space; as a result, tTpack is complex-valued. It is shown that RetTpack reduces to the standard WPS result, tTphase, for conditions similar to those employed in the conventional WPS analysis. Similarly, ImtTpack is shown to contain information about the energy dependence of the transmission probability. Under semiclassical conditions, ImtTpack reduces to the well-known Wentzel-Kramers-Brillouin expression for the tunneling time. It is shown there are different definitions for the traversal time of a classical moving object, whose size is comparable to the width of the region of interest. In the quantum case, these different definitions correspond to different ways of analyzing the WPS experiment. The path-integral approach demonstrates that the tunneling-time problem is one of understanding the physical significance of complex-valued off-orbit matrix elements of an operator or functional. The physical content of complex-valued tunneling times is discussed. It is emphasized that the use of complex tunneling times includes real-time approaches as a special case. Nevertheless, there is a limitation in the description of tunneling experiments using tunneling times, whether real or complex. The path-integral approach does not supply a universal traversal time, analogous to a classical time, that can be used in quantum situations. It is demonstrated that the often expressed hope of finding a well-defined and universal real tunneling time is erroneous.

Software Modules for the Proximity-1 Space Link Interleaved Time Synchronization (PITS) Protocol

NASA Technical Reports Server (NTRS)

Woo, Simon S.; Veregge, John R.; Gao, Jay L.; Clare, Loren P.; Mills, David

2012-01-01

The Proximity-1 Space Link Interleaved Time Synchronization (PITS) protocol provides time distribution and synchronization services for space systems. A software prototype implementation of the PITS algorithm has been developed that also provides the test harness to evaluate the key functionalities of PITS with simulated data source and sink. PITS integrates time synchronization functionality into the link layer of the CCSDS Proximity-1 Space Link Protocol. The software prototype implements the network packet format, data structures, and transmit- and receive-timestamp function for a time server and a client. The software also simulates the transmit and receive-time stamp exchanges via UDP (User Datagram Protocol) socket between a time server and a time client, and produces relative time offsets and delay estimates.

Adaptive developmental delay in Chagas disease vectors: an evolutionary ecology approach.

PubMed

Menu, Frédéric; Ginoux, Marine; Rajon, Etienne; Lazzari, Claudio R; Rabinovich, Jorge E

2010-05-25

The developmental time of vector insects is important in population dynamics, evolutionary biology, epidemiology and in their responses to global climatic change. In the triatomines (Triatominae, Reduviidae), vectors of Chagas disease, evolutionary ecology concepts, which may allow for a better understanding of their biology, have not been applied. Despite delay in the molting in some individuals observed in triatomines, no effort was made to explain this variability. We applied four methods: (1) an e-mail survey sent to 30 researchers with experience in triatomines, (2) a statistical description of the developmental time of eleven triatomine species, (3) a relationship between development time pattern and climatic inter-annual variability, (4) a mathematical optimization model of evolution of developmental delay (diapause). 85.6% of responses informed on prolonged developmental times in 5(th) instar nymphs, with 20 species identified with remarkable developmental delays. The developmental time analysis showed some degree of bi-modal pattern of the development time of the 5(th) instars in nine out of eleven species but no trend between development time pattern and climatic inter-annual variability was observed. Our optimization model predicts that the developmental delays could be due to an adaptive risk-spreading diapause strategy, only if survival throughout the diapause period and the probability of random occurrence of "bad" environmental conditions are sufficiently high. Developmental delay may not be a simple non-adaptive phenotypic plasticity in development time, and could be a form of adaptive diapause associated to a physiological mechanism related to the postponement of the initiation of reproduction, as an adaptation to environmental stochasticity through a spreading of risk (bet-hedging) strategy. We identify a series of parameters that can be measured in the field and laboratory to test this hypothesis. The importance of these findings is discussed in terms of global climatic change and epidemiological consequences.

Test particle simulation study of whistler wave packets observed near Comet Giacobini-Zinner

NASA Astrophysics Data System (ADS)

Kaya, N.; Matsumoto, H.; Tsurutani, B. T.

1989-01-01

Nonlinear interactions of water group ions with large-amplitude whistler wave packets detected at the leading edge of steepened magnetosonic waves observed near Comet Giacobini-Zinner (GZ) are studied using test particle simulations of water-ion interactions with a model wave based on GZ data. Some of the water ions are found to be decelerated in the steepened portion of the magnetosonic wave to the resonance velocity with the whistler wave packets. Through resonance and related nonlinear interaction with the large-amplitude whistler waves, the water ions become trapped by the packet. An energy balance calculation demonstrates that the trapped ions lose their kinetic energy during the trapped motion in the packet. Thus, the nonlinear trapping motion in the wave structure leads to effective energy transfer from the water group ions to the whistler wave packets in the leading edge of the steepened MHD waves.

Theory for low-frequency modulated Langmuir wave packets

NASA Technical Reports Server (NTRS)

Cairns, Iver H.; Robinson, P. A.

1992-01-01

Langmuir wave packets with low frequency modulations (or beats) observed in the Jovian foreshock are argued to be direct evidence for the Langmuir wave decay L yields L-prime + S. In this decay, 'pump' Langmuir waves L, driven by an electron beam, produce backscattered product Langmuir waves L-prime and ion sound waves S. The L and L-prime waves beat at the frequency and wavevector of the S waves, thereby modulating the wave packets. Beam speeds calculated using the modulated Jovian wave packets (1) are reasonable, at 4-10 times the electron thermal speed, (2) are consistent with theoretical limits on the decay process, and (3) decrease with increasing foreshock depth, as expected theoretically. These results strongly support the theory. The modulation depth of some wave packets suggests saturation by the decay L yields L-prime + S. Applications to modulated Langmuir packets in the Venusian and terrestrial foreshocks and in a type III radio source are proposed.

On-board B-ISDN fast packet switching architectures. Phase 2: Development. Proof-of-concept architecture definition report

NASA Technical Reports Server (NTRS)

Shyy, Dong-Jye; Redman, Wayne

1993-01-01

For the next-generation packet switched communications satellite system with onboard processing and spot-beam operation, a reliable onboard fast packet switch is essential to route packets from different uplink beams to different downlink beams. The rapid emergence of point-to-point services such as video distribution, and the large demand for video conference, distributed data processing, and network management makes the multicast function essential to a fast packet switch (FPS). The satellite's inherent broadcast features gives the satellite network an advantage over the terrestrial network in providing multicast services. This report evaluates alternate multicast FPS architectures for onboard baseband switching applications and selects a candidate for subsequent breadboard development. Architecture evaluation and selection will be based on the study performed in phase 1, 'Onboard B-ISDN Fast Packet Switching Architectures', and other switch architectures which have become commercially available as large scale integration (LSI) devices.

Dispatching packets on a global combining network of a parallel computer

DOEpatents

Almasi, Gheorghe [Ardsley, NY; Archer, Charles J [Rochester, MN

2011-07-19

Methods, apparatus, and products are disclosed for dispatching packets on a global combining network of a parallel computer comprising a plurality of nodes connected for data communications using the network capable of performing collective operations and point to point operations that include: receiving, by an origin system messaging module on an origin node from an origin application messaging module on the origin node, a storage identifier and an operation identifier, the storage identifier specifying storage containing an application message for transmission to a target node, and the operation identifier specifying a message passing operation; packetizing, by the origin system messaging module, the application message into network packets for transmission to the target node, each network packet specifying the operation identifier and an operation type for the message passing operation specified by the operation identifier; and transmitting, by the origin system messaging module, the network packets to the target node.

Does the hand that controls the cigarette packet rule the smoker? Findings from ethnographic interviews with smokers in Canada, Australia, the United Kingdom and the USA.

PubMed

Bell, Kirsten; Dennis, Simone; Robinson, Jude; Moore, Roland

2015-10-01

Throughout the twentieth century, packaging was a carefully cultivated element of the appeal of the cigarette. However, the tobacco industry's control over cigarette packaging has been steadily eroded through legislation that aims to rebrand the packet from a desirable to a dangerous commodity-epitomized in Australia's introduction of plain packaging in 2012. Evident in both the enactment of cigarette packaging legislation and industry efforts to overturn it is the assumption that packets do things-i.e. that they have a critical role to play in either promoting or discouraging the habit. Drawing on 175 ethnographic interviews conducted with people smoking in public spaces in Vancouver, Canada; Canberra, Australia; Liverpool, England; and San Francisco, USA, we produce a 'thick description' of smokers' engagements with cigarette packets. We illustrate that despite the very different types of cigarette packaging legislation in place in the four countries, there are marked similarities in the ways smokers engage with their packets. In particular, they are not treated as a purely visual sign; instead, a primary means through which one's own cigarette packet is apprehended is by touch rather than by sight. Smokers perceive cigarette packets largely through the operations of their hands-through their 'handiness'. Thus, our study findings problematize the assumption that how smokers engage with packets when asked to do so on a purely intellectual or aesthetic level reflects how they engage with packets as they are enfolded into their everyday lives. Copyright © 2015 The Authors. Published by Elsevier Ltd.. All rights reserved.

A robust coding scheme for packet video

NASA Technical Reports Server (NTRS)

Chen, Y. C.; Sayood, Khalid; Nelson, D. J.

1991-01-01

We present a layered packet video coding algorithm based on a progressive transmission scheme. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

A robust coding scheme for packet video

NASA Technical Reports Server (NTRS)

Chen, Yun-Chung; Sayood, Khalid; Nelson, Don J.

1992-01-01

A layered packet video coding algorithm based on a progressive transmission scheme is presented. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

Novel elastic protection against DDF failures in an enhanced software-defined SIEPON

NASA Astrophysics Data System (ADS)

Pakpahan, Andrew Fernando; Hwang, I.-Shyan; Yu, Yu-Ming; Hsu, Wu-Hsiao; Liem, Andrew Tanny; Nikoukar, AliAkbar

2017-07-01

Ever-increasing bandwidth demands on passive optical networks (PONs) are pushing the utilization of every fiber strand to its limit. This is mandating comprehensive protection until the end of the distribution drop fiber (DDF). Hence, it is important to provide refined protection with an advanced fault-protection architecture and recovery mechanism that is able to cope with various DDF failures. We propose a novel elastic protection against DDF failures that incorporates a software-defined networking (SDN) capability and a bus protection line to enhance the resiliency of the existing Service Interoperability in Ethernet Passive Optical Networks (SIEPON) system. We propose the addition of an integrated SDN controller and flow tables to the optical line terminal and optical network units (ONUs) in order to deliver various DDF protection scenarios. The proposed architecture enables flexible assignment of backup ONU(s) in pre/post-fault conditions depending on the PON traffic load. A transient backup ONU and multiple backup ONUs can be deployed in the pre-fault and post-fault scenarios, respectively. Our extensively discussed simulation results show that our proposed architecture provides better overall throughput and drop probability compared to the architecture with a fixed DDF protection mechanism. It does so while still maintaining overall QoS performance in terms of packet delay, mean jitter, packet loss, and throughput under various fault conditions.

An Efficient Framework Model for Optimizing Routing Performance in VANETs

PubMed Central

Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala

2018-01-01

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED). PMID:29462884

Power Allocation Based on Data Classification in Wireless Sensor Networks

PubMed Central

Wang, Houlian; Zhou, Gongbo

2017-01-01

Limited node energy in wireless sensor networks is a crucial factor which affects the monitoring of equipment operation and working conditions in coal mines. In addition, due to heterogeneous nodes and different data acquisition rates, the number of arriving packets in a queue network can differ, which may lead to some queue lengths reaching the maximum value earlier compared with others. In order to tackle these two problems, an optimal power allocation strategy based on classified data is proposed in this paper. Arriving data is classified into dissimilar classes depending on the number of arriving packets. The problem is formulated as a Lyapunov drift optimization with the objective of minimizing the weight sum of average power consumption and average data class. As a result, a suboptimal distributed algorithm without any knowledge of system statistics is presented. The simulations, conducted in the perfect channel state information (CSI) case and the imperfect CSI case, reveal that the utility can be pushed arbitrarily close to optimal by increasing the parameter V, but with a corresponding growth in the average delay, and that other tunable parameters W and the classification method in the interior of utility function can trade power optimality for increased average data class. The above results show that data in a high class has priorities to be processed than data in a low class, and energy consumption can be minimized in this resource allocation strategy. PMID:28498346

Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks.

PubMed

Perumal, Madhumathy; Dhandapani, Sivakumar

2015-01-01

Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a "splitting tree" technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the "Biased Random Walk" model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.