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.

Efficient packet forwarding using cyber-security aware policies

DOEpatents

Ros-Giralt, Jordi

2017-04-04

For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.

Efficient packet forwarding using cyber-security aware policies

DOEpatents

Ros-Giralt, Jordi

2017-10-25

For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.

Apply network coding for H.264/SVC multicasting

NASA Astrophysics Data System (ADS)

Wang, Hui; Kuo, C.-C. Jay

2008-08-01

In a packet erasure network environment, video streaming benefits from error control in two ways to achieve graceful degradation. The first approach is application-level (or the link-level) forward error-correction (FEC) to provide erasure protection. The second error control approach is error concealment at the decoder end to compensate lost packets. A large amount of research work has been done in the above two areas. More recently, network coding (NC) techniques have been proposed for efficient data multicast over networks. It was shown in our previous work that multicast video streaming benefits from NC for its throughput improvement. An algebraic model is given to analyze the performance in this work. By exploiting the linear combination of video packets along nodes in a network and the SVC video format, the system achieves path diversity automatically and enables efficient video delivery to heterogeneous receivers in packet erasure channels. The application of network coding can protect video packets against the erasure network environment. However, the rank defficiency problem of random linear network coding makes the error concealment inefficiently. It is shown by computer simulation that the proposed NC video multicast scheme enables heterogenous receiving according to their capacity constraints. But it needs special designing to improve the video transmission performance when applying network coding.

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.

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

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.

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.

Filtering methods for broadcast authentication against PKC-based denial of service in WSN: a survey

NASA Astrophysics Data System (ADS)

Afianti, Farah; Wirawan, Iwan; Suryani, Titiek

2017-11-01

Broadcast authentication is used to determine legitimate packet from authorized user. The received packet can be forwarded or used for the further purpose. The use of digital signature is one of the compromising methods but it is followed by high complexity especially in the verification process. That phenomenon is used by the adversary to force the user to verify a lot of false packet data. Kind of Denial of Service (DoS) which attacks the main signature can be mitigated by using pre-authentication methods as the first layer to filter false packet data. The objective of the filter is not replacing the main signature but as an addition to actual verification in the sensor node. This paper contributes in comparing the cost of computation, storage, and communication among several filters. The result shows Pre- Authenticator and Dos Attack-Resistant scheme have the lower overhead than the others. Thus followed by needing powerful sender. Moreover, the key chain is promising methods because of efficiency and effectiveness.

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

Efficient priority queueing routing strategy on networks of mobile agents

NASA Astrophysics Data System (ADS)

Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

2018-03-01

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

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.

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.

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Li, Xiaohua(Edward)

In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interference cancellation (SIC) and maximal ratio combining (MRC) to deal with mutual interference and to utilize all the received signal energy, we show that the signal-to-interference-plus-noise ratio (SINR) of a node is determined only by the nodes before it, not the nodes after it, along a packet forwarding path. Based on this observation, we propose an iterative procedure to select the relay nodes and to calculate the path SINR as well as capacity of an arbitrary multi-hop packet forwarding path. The complexity of the algorithm is extremely low, and scaling well with network size. The algorithm is applicable in arbitrarily large networks. Its performance is demonstrated as desirable by simulations. The algorithm can be helpful in analyzing the performance of multi-hop wireless networks.

State-to-state reaction dynamics of 18O+32O2 studied by a time-dependent quantum wavepacket method

NASA Astrophysics Data System (ADS)

Xie, Wenbo; Liu, Lan; Sun, Zhigang; Guo, Hua; Dawes, Richard

2015-02-01

The title isotope exchange reaction was studied by converged time-dependent wave packet calculations, where an efficient 4th order split operator was applied to propagate the initial wave packet. State-to-state differential and integral cross sections up to the collision energy of 0.35 eV were obtained with 32O2 in the hypothetical j0 = 0 state. It is discovered that the differential cross sections are largely forward biased in the studied collision energy range, due to the fact that there is a considerable part of the reaction occurring with large impact parameter and short lifetime relative to the rotational period of the intermediate complex. The oscillations of the forward scattering amplitude as a function of collision energy, which result from coherent contribution of adjacent resonances, may be a sensitive probe for examining the quality of the underlying potential energy surface. A good agreement between the theoretical and recent experimental integral and differential cross sections at collision energy of 7.3 kcal/mol is obtained. However, the theoretical results predict slightly too much forward scattering and colder rotational distributions than the experimental observations at collision energy of 5.7 kcal/mol.

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.

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

DOEpatents

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

2013-04-16

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

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

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.

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.

Secure Overlay Services (SOS)

DTIC Science & Technology

2004-08-01

special node in the SOS architecture that is easily reached, called the beacon. 3. The beacon forwards the packet to a “secret” node, called the secret servlet...whose identity is known to only a small subset of participants in the SOS architecture. 6 4. The secret servlet forwards the packet to...address is the secret servlet. In the following discussion, we motivate why the SOS architecture requires the series of steps described above

Photonic integrated circuit optical buffer for packet-switched networks.

PubMed

Burmeister, Emily F; Mack, John P; Poulsen, Henrik N; Masanović, Milan L; Stamenić, Biljana; Blumenthal, Daniel J; Bowers, John E

2009-04-13

A chip-scale optical buffer performs autonomous contention resolution for 40-byte packets with 99% packet recovery. The buffer consists of a fast, InP-based 2 x 2 optical switch and a silica-on-silicon low loss delay loop. The buffer is demonstrated in recirculating operation, but may be reconfigured in feed-forward operation for longer packet lengths. The recirculating buffer provides packet storage in integer multiples of the delay length of 12.86 ns up to 64.3 ns with 98% packet recovery. The buffer is used to resolve contention between two 40 Gb/s packet streams using multiple photonic chip optical buffers.

State-to-state reaction dynamics of {sup 18}O+{sup 32}O{sub 2} studied by a time-dependent quantum wavepacket method

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

Xie, Wenbo; Liu, Lan; Sun, Zhigang, E-mail: zsun@dicp.ac.cn

2015-02-14

The title isotope exchange reaction was studied by converged time-dependent wave packet calculations, where an efficient 4th order split operator was applied to propagate the initial wave packet. State-to-state differential and integral cross sections up to the collision energy of 0.35 eV were obtained with {sup 32}O{sub 2} in the hypothetical j{sub 0} = 0 state. It is discovered that the differential cross sections are largely forward biased in the studied collision energy range, due to the fact that there is a considerable part of the reaction occurring with large impact parameter and short lifetime relative to the rotational periodmore » of the intermediate complex. The oscillations of the forward scattering amplitude as a function of collision energy, which result from coherent contribution of adjacent resonances, may be a sensitive probe for examining the quality of the underlying potential energy surface. A good agreement between the theoretical and recent experimental integral and differential cross sections at collision energy of 7.3 kcal/mol is obtained. However, the theoretical results predict slightly too much forward scattering and colder rotational distributions than the experimental observations at collision energy of 5.7 kcal/mol.« less

Flow-aggregated traffic-driven label mapping in label-switching networks

NASA Astrophysics Data System (ADS)

Nagami, Kenichi; Katsube, Yasuhiro; Esaki, Hiroshi; Nakamura, Osamu

1998-12-01

Label switching technology enables high performance, flexible, layer-3 packet forwarding based on the fixed length label information mapped to the layer-3 packet stream. A Label Switching Router (LSR) forwards layer-3 packets based on their label information mapped to the layer-3 address information as well as their layer-3 address information. This paper evaluates the required number of labels under traffic-driven label mapping policy using the real backbone traffic traces. The evaluation shows that the label mapping policy requires a large number of labels. In order to reduce the required number of labels, we propose a label mapping policy which is a traffic-driven label mapping for the traffic toward the same destination network. The evaluation shows that the proposed label mapping policy requires only about one tenth as many labels compared with the traffic-driven label mapping for the host-pair packet stream,and the topology-driven label mapping for the destination network packet stream.

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

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

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

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

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.

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

System and method for forward error correction

NASA Technical Reports Server (NTRS)

Cole, Robert M. (Inventor); Bishop, James E. (Inventor)

2006-01-01

A system and method are provided for transferring a packet across a data link. The packet may include a stream of data symbols which is delimited by one or more framing symbols. Corruptions of the framing symbol which result in valid data symbols may be mapped to invalid symbols. If it is desired to transfer one of the valid data symbols that has been mapped to an invalid symbol, the data symbol may be replaced with an unused symbol. At the receiving end, these unused symbols are replaced with the corresponding valid data symbols. The data stream of the packet may be encoded with forward error correction information to detect and correct errors in the data stream.

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

A dynamic routing strategy with limited buffer on scale-free network

NASA Astrophysics Data System (ADS)

Wang, Yufei; Liu, Feng

2016-04-01

In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

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

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

Forwarding techniques for IP fragmented packets in a real 6LoWPAN network.

PubMed

Ludovici, Alessandro; Calveras, Anna; Casademont, Jordi

2011-01-01

Wireless Sensor Networks (WSNs) are attracting more and more interest since they offer a low-cost solution to the problem of providing a means to deploy large sensor networks in a number of application domains. We believe that a crucial aspect to facilitate WSN diffusion is to make them interoperable with external IP networks. This can be achieved by using the 6LoWPAN protocol stack. 6LoWPAN enables the transmission of IPv6 packets over WSNs based on the IEEE 802.15.4 standard. IPv6 packet size is considerably larger than that of IEEE 802.15.4 data frame. To overcome this problem, 6LoWPAN introduces an adaptation layer between the network and data link layers, allowing IPv6 packets to be adapted to the lower layer constraints. This adaptation layer provides fragmentation and header compression of IP packets. Furthermore, it also can be involved in routing decisions. Depending on which layer is responsible for routing decisions, 6LoWPAN divides routing in two categories: mesh under if the layer concerned is the adaptation layer and route over if it is the network layer. In this paper we analyze different routing solutions (route over, mesh under and enhanced route over) focusing on how they forward fragments. We evaluate their performance in terms of latency and energy consumption when transmitting IP fragmented packets. All the tests have been performed in a real 6LoWPAN implementation. After consideration of the main problems in forwarding of mesh frames in WSN, we propose and analyze a new alternative scheme based on mesh under, which we call controlled mesh under.

Forwarding Techniques for IP Fragmented Packets in a Real 6LoWPAN Network

PubMed Central

Ludovici, Alessandro; Calveras, Anna; Casademont, Jordi

2011-01-01

Wireless Sensor Networks (WSNs) are attracting more and more interest since they offer a low-cost solution to the problem of providing a means to deploy large sensor networks in a number of application domains. We believe that a crucial aspect to facilitate WSN diffusion is to make them interoperable with external IP networks. This can be achieved by using the 6LoWPAN protocol stack. 6LoWPAN enables the transmission of IPv6 packets over WSNs based on the IEEE 802.15.4 standard. IPv6 packet size is considerably larger than that of IEEE 802.15.4 data frame. To overcome this problem, 6LoWPAN introduces an adaptation layer between the network and data link layers, allowing IPv6 packets to be adapted to the lower layer constraints. This adaptation layer provides fragmentation and header compression of IP packets. Furthermore, it also can be involved in routing decisions. Depending on which layer is responsible for routing decisions, 6LoWPAN divides routing in two categories: mesh under if the layer concerned is the adaptation layer and route over if it is the network layer. In this paper we analyze different routing solutions (route over, mesh under and enhanced route over) focusing on how they forward fragments. We evaluate their performance in terms of latency and energy consumption when transmitting IP fragmented packets. All the tests have been performed in a real 6LoWPAN implementation. After consideration of the main problems in forwarding of mesh frames in WSN, we propose and analyze a new alternative scheme based on mesh under, which we call controlled mesh under. PMID:22346615

A programmable Si-photonic node for SDN-enabled Bloom filter forwarding in disaggregated data centers

NASA Astrophysics Data System (ADS)

Moralis-Pegios, M.; Terzenidis, N.; Vagionas, C.; Pitris, S.; Chatzianagnostou, E.; Brimont, A.; Zanzi, A.; Sanchis, P.; Marti, J.; Kraft, J.; Rochracher, K.; Dorrestein, S.; Bogdan, M.; Tekin, T.; Syrivelis, D.; Tassiulas, L.; Miliou, A.; Pleros, N.; Vyrsokinos, K.

2017-02-01

Programmable switching nodes supporting Software-Defined Networking (SDN) over optical interconnecting technologies arise as a key enabling technology for future disaggregated Data Center (DC) environments. The SDNenabling roadmap of intra-DC optical solutions is already a reality for rack-to-rack interconnects, with recent research reporting on interesting applications of programmable silicon photonic switching fabrics addressing board-to-board and even on-board applications. In this perspective, simplified information addressing schemes like Bloom filter (BF)-based labels emerge as a highly promising solution for ensuring rapid switch reconfiguration, following quickly the changes enforced in network size, network topology or even in content location. The benefits of BF-based forwarding have been so far successfully demonstrated in the Information-Centric Network (ICN) paradigm, while theoretical studies have also revealed the energy consumption and speed advantages when applied in DCs. In this paper we present for the first time a programmable 4x4 Silicon Photonic switch that supports SDN through the use of BF-labeled router ports. Our scheme significantly simplifies packet forwarding as it negates the need for large forwarding tables, allowing for its remote control through modifications in the assigned BF labels. We demonstrate 1x4 switch operation controlling the Si-Pho switch by a Stratix V FPGA module, which is responsible for processing the packet ID and correlating its destination with the appropriate BF-labeled outgoing port. DAC- and amplifier-less control of the carrier-injection Si-Pho switches is demonstrated, revealing successful switching of 10Gb/s data packets with BF-based forwarding information changes taking place at a time-scale that equals the duration of four consecutive packets.

A distributed geo-routing algorithm for wireless sensor networks.

PubMed

Joshi, Gyanendra Prasad; Kim, Sung Won

2009-01-01

Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads.

SVANET: A smart vehicular ad hoc network for efficient data transmission with wireless sensors.

PubMed

Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

2014-11-25

Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency.

SVANET: A Smart Vehicular Ad Hoc Network for Efficient Data Transmission with Wireless Sensors

PubMed Central

Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

2014-01-01

Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency. PMID:25429409

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.

IPTV multicast with peer-assisted lossy error control

NASA Astrophysics Data System (ADS)

Li, Zhi; Zhu, Xiaoqing; Begen, Ali C.; Girod, Bernd

2010-07-01

Emerging IPTV technology uses source-specific IP multicast to deliver television programs to end-users. To provide reliable IPTV services over the error-prone DSL access networks, a combination of multicast forward error correction (FEC) and unicast retransmissions is employed to mitigate the impulse noises in DSL links. In existing systems, the retransmission function is provided by the Retransmission Servers sitting at the edge of the core network. In this work, we propose an alternative distributed solution where the burden of packet loss repair is partially shifted to the peer IP set-top boxes. Through Peer-Assisted Repair (PAR) protocol, we demonstrate how the packet repairs can be delivered in a timely, reliable and decentralized manner using the combination of server-peer coordination and redundancy of repairs. We also show that this distributed protocol can be seamlessly integrated with an application-layer source-aware error protection mechanism called forward and retransmitted Systematic Lossy Error Protection (SLEP/SLEPr). Simulations show that this joint PARSLEP/ SLEPr framework not only effectively mitigates the bottleneck experienced by the Retransmission Servers, thus greatly enhancing the scalability of the system, but also efficiently improves the resistance to the impulse noise.

Enhanced Predictive Handover for Fast Proxy Mobile IPv6

NASA Astrophysics Data System (ADS)

Jeon, Seil; Kang, Namhi; Kim, Younghan

Proxy Mobile IPv6 (PMIPv6) has been proposed in order to overcome the limitations of host-based mobility management in IPv6 networks. However, packet losses during doing handover are still a problem. To solve this issue, several schemes have been developed, and can be classified into two approaches: predictive and reactive handover. Both approaches commonly use bi-directional tunnel between mobile access gateways (MAGs). In predictive schemes especially, mobility support for a mobile node (MN) is triggered by simplified link signal strength. Thereafter, the MN sends handover notification to its serving MAG, and is then able to initiate packet forwarding. Therefore, if the MN moves toward an unexpected MAG that does not have any pre-established tunnel with the serving MAG, it may lead to packet losses. In this paper, we define this problem as Early Packet Forwarding (EPF). As a solution, we propose an enhanced PMIPv6 scheme using two-phase tunnel control based on the IEEE 802.21 Media Independent Handover (MIH).

Evaluation of AL-FEC performance for IP television services QoS

NASA Astrophysics Data System (ADS)

Mammi, E.; Russo, G.; Neri, A.

2010-01-01

The IP television services quality is a critical issue because of the nature of transport infrastructure. Packet loss is the main cause of service degradation in such kind of network platforms. The use of forward error correction (FEC) techniques in the application layer (AL-FEC), between the source of TV service (video server) and the user terminal, seams to be an efficient strategy to counteract packet losses alternatively or in addiction to suitable traffic management policies (only feasible in "managed networks"). A number of AL-FEC techniques have been discussed in literature and proposed for inclusion in TV over IP international standards. In this paper a performance evaluation of the AL-FEC defined in SMPTE 2022-1 standard is presented. Different typical events occurring in IP networks causing different types (in terms of statistic distribution) of IP packet losses have been studied and AL-FEC performance to counteract these kind of losses have been evaluated. The performed analysis has been carried out in view of fulfilling the TV services QoS requirements that are usually very demanding. For managed networks, this paper envisages a strategy to combine the use of AL-FEC with the set-up of a transport quality based on FEC packets prioritization. Promising results regard this kind of strategy have been obtained.

An Incentive Based Approach to Detect Selfish Nodes in Mobile P2P Network

DTIC Science & Technology

2011-01-01

also listens to the packet if it is in promiscuous mode. So node 1 is sure that node 8 2 has forwarded the packet if it is able to hear the packet...3) where R represents the maximum distance a transmission can be sent, λ = Vw/f ≈ Vw/B assuming bandwidth...a customized routing protocol and explore new methods to find credibility. 44 REFERENCES [1] Refaei M.T, Vivek Srivastava

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing traffic!routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems shortest path routing!problems .

Game-theoretic approach for improving cooperation in wireless multihop networks.

PubMed

Ng, See-Kee; Seah, Winston K G

2010-06-01

Traditional networks are built on the assumption that network entities cooperate based on a mandatory network communication semantic to achieve desirable qualities such as efficiency and scalability. Over the years, this assumption has been eroded by the emergence of users that alter network behavior in a way to benefit themselves at the expense of others. At one extreme, a malicious user/node may eavesdrop on sensitive data or deliberately inject packets into the network to disrupt network operations. The solution to this generally lies in encryption and authentication. In contrast, a rational node acts only to achieve an outcome that he desires most. In such a case, cooperation is still achievable if the outcome is to the best interest of the node. The node misbehavior problem would be more pronounced in multihop wireless networks like mobile ad hoc and sensor networks, which are typically made up of wireless battery-powered devices that must cooperate to forward packets for one another. However, cooperation may be hard to maintain as it consumes scarce resources such as bandwidth, computational power, and battery power. This paper applies game theory to achieve collusive networking behavior in such network environments. In this paper, pricing, promiscuous listening, and mass punishments are avoided altogether. Our model builds on recent work in the field of Economics on the theory of imperfect private monitoring for the dynamic Bertrand oligopoly, and adapts it to the wireless multihop network. The model derives conditions for collusive packet forwarding, truthful routing broadcasts, and packet acknowledgments under a lossy wireless multihop environment, thus capturing many important characteristics of the network layer and link layer in one integrated analysis that has not been achieved previously. We also provide a proof of the viability of the model under a theoretical wireless environment. Finally, we show how the model can be applied to design a generic protocol which we call the Selfishness Resilient Resource Reservation protocol, and validate the effectiveness of this protocol in ensuring cooperation using simulations.

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.

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.

When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.

PubMed

Tang, Changbing; Li, Ang; Li, Xiang

2015-10-01

In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies and derive the threshold of benefit-to-cost ratio to guarantee the convergence of cooperation. The numerical simulations verify that the proposed evolutionary game theoretic solution enforces cooperation when the benefit-to-cost ratio of the altruistic exceeds the critical condition. In addition, the network throughput performance of our proposed strategy in structured MANETs is measured, which is in close agreement with that of the full cooperative strategy.

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.

Enhanced Weight based DSR for Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Verma, Samant; Jain, Sweta

2011-12-01

Routing in ad hoc network is a great problematic, since a good routing protocol must ensure fast and efficient packet forwarding, which isn't evident in ad hoc networks. In literature there exists lot of routing protocols however they don't include all the aspects of ad hoc networks as mobility, device and medium constraints which make these protocols not efficient for some configuration and categories of ad hoc networks. Thus in this paper we propose an improvement of Weight Based DSR in order to include some of the aspects of ad hoc networks as stability, remaining battery power, load and trust factor and proposing a new approach Enhanced Weight Based DSR.

Electronic-To-Optical-To-Electronic Packet-Data Conversion

NASA Technical Reports Server (NTRS)

Monacos, Steve

1996-01-01

Space-time multiplexer (STM) cell-based communication system designed to take advantage of both high throughput attainable in optical transmission links and flexibility and functionality of electronic processing, storage, and switching. Long packets segmented and transmitted optically by wavelength-division multiplexing. Performs optoelectronic and protocol conversion between electronic "store-and-forward" protocols and optical "hot-potato" protocols.

The congestion control algorithm based on queue management of each node in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

2016-12-01

This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks

PubMed Central

Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A.; Zulkarnain, Zuriati A.

2016-01-01

Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol’s semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery. PMID:27338411

FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks.

PubMed

Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A; Zulkarnain, Zuriati A

2016-06-22

Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol's semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery.

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

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.

A Glider-Assisted Link Disruption Restoration Mechanism in Underwater Acoustic Sensor Networks.

PubMed

Jin, Zhigang; Wang, Ning; Su, Yishan; Yang, Qiuling

2018-02-07

Underwater acoustic sensor networks (UASNs) have become a hot research topic. In UASNs, nodes can be affected by ocean currents and external forces, which could result in sudden link disruption. Therefore, designing a flexible and efficient link disruption restoration mechanism to ensure the network connectivity is a challenge. In the paper, we propose a glider-assisted restoration mechanism which includes link disruption recognition and related link restoring mechanism. In the link disruption recognition mechanism, the cluster heads collect the link disruption information and then schedule gliders acting as relay nodes to restore the disrupted link. Considering the glider's sawtooth motion, we design a relay location optimization algorithm with a consideration of both the glider's trajectory and acoustic channel attenuation model. The utility function is established by minimizing the channel attenuation and the optimal location of glider is solved by a multiplier method. The glider-assisted restoration mechanism can greatly improve the packet delivery rate and reduce the communication energy consumption and it is more general for the restoration of different link disruption scenarios. The simulation results show that glider-assisted restoration mechanism can improve the delivery rate of data packets by 15-33% compared with cooperative opportunistic routing (OVAR), the hop-by-hop vector-based forwarding (HH-VBF) and the vector based forward (VBF) methods, and reduce communication energy consumption by 20-58% for a typical network's setting.

A Glider-Assisted Link Disruption Restoration Mechanism in Underwater Acoustic Sensor Networks

PubMed Central

Wang, Ning; Su, Yishan; Yang, Qiuling

2018-01-01

Underwater acoustic sensor networks (UASNs) have become a hot research topic. In UASNs, nodes can be affected by ocean currents and external forces, which could result in sudden link disruption. Therefore, designing a flexible and efficient link disruption restoration mechanism to ensure the network connectivity is a challenge. In the paper, we propose a glider-assisted restoration mechanism which includes link disruption recognition and related link restoring mechanism. In the link disruption recognition mechanism, the cluster heads collect the link disruption information and then schedule gliders acting as relay nodes to restore the disrupted link. Considering the glider’s sawtooth motion, we design a relay location optimization algorithm with a consideration of both the glider’s trajectory and acoustic channel attenuation model. The utility function is established by minimizing the channel attenuation and the optimal location of glider is solved by a multiplier method. The glider-assisted restoration mechanism can greatly improve the packet delivery rate and reduce the communication energy consumption and it is more general for the restoration of different link disruption scenarios. The simulation results show that glider-assisted restoration mechanism can improve the delivery rate of data packets by 15–33% compared with cooperative opportunistic routing (OVAR), the hop-by-hop vector-based forwarding (HH-VBF) and the vector based forward (VBF) methods, and reduce communication energy consumption by 20–58% for a typical network’s setting. PMID:29414898

An efficient collaborative approach for black hole attack discovery and mitigating its impact in manet

NASA Astrophysics Data System (ADS)

Devipriya, K.; Ivy, B. Persis Urbana; Prabha, D.

2018-04-01

A mobile ad hoc network (MANET) is an assemblage of nodes composed of mobile devices coupled in various ways wirelessly which do not have any central administration. Each node in MANET cooperates in forwarding packets in the network. This type of collaboration incurs high cost but there exits nodes that declines to cooperate leading to selfish conduct of nodes which effects overall network performance. To discover the attacks caused by such nodes, a renowned mechanism using watchdog can be deployed. In infrastructure less network attack detection and reaction and high false positives, false negatives initiating black hole attack becomes major issue in watchdog. This paper put forward a collaborative approach for identifying such attacks in MANET. Through abstract analysis and extensive simulation of this approach, the detection time of misbehaved nodes is reduced and substantial enhancement in overhead and throughput is witnessed.

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

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.

System and method for transferring data on a data link

NASA Technical Reports Server (NTRS)

Cole, Robert M. (Inventor); Bishop, James E. (Inventor)

2007-01-01

A system and method are provided for transferring a packet across a data link. The packet may include a stream of data symbols which is delimited by one or more framing symbols. Corruptions of the framing symbol which result in valid data symbols may be mapped to invalid symbols. If it is desired to transfer one of the valid data symbols that has been mapped to an invalid symbol, the data symbol may be replaced with an unused symbol. At the receiving end, these unused symbols are replaced with the corresponding valid data symbols. The data stream of the packet may be encoded with forward error correction information to detect and correct errors in the data stream.

Composable Flexible Real-time Packet Scheduling for Networks on-Chip

DTIC Science & Technology

2012-05-16

unclassified b . ABSTRACT unclassified c. THIS PAGE unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 Copyright © 2012...words, real-time flows need to be composable. We set this as the design goal for our packet scheduling discipline developed in this paper. B . Motivating...with closest deadline is chosen to forward to the next router. B . Traffic Model We assume a traffic model for real-time flows similar to the one used

Reliable Wireless Broadcast with Linear Network Coding for Multipoint-to-Multipoint Real-Time Communications

NASA Astrophysics Data System (ADS)

Kondo, Yoshihisa; Yomo, Hiroyuki; Yamaguchi, Shinji; Davis, Peter; Miura, Ryu; Obana, Sadao; Sampei, Seiichi

This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.

An Energy-Efficient Secure Routing and Key Management Scheme for Mobile Sinks in Wireless Sensor Networks Using Deployment Knowledge

PubMed Central

Hung, Le Xuan; Canh, Ngo Trong; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo

2008-01-01

For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODEplus. It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODEplus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully. PMID:27873956

An Energy-Efficient Secure Routing and Key Management Scheme for Mobile Sinks in Wireless Sensor Networks Using Deployment Knowledge.

PubMed

Hung, Le Xuan; Canh, Ngo Trong; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo

2008-12-03

For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODE plus . It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODE plus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

PubMed

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

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.

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.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

PubMed

Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

PubMed Central

Katiravan, Jeevaa; Sylvia, D.; Rao, D. Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network. PMID:26167529

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.

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility

PubMed Central

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-01-01

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. PMID:27007373

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility.

PubMed

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-03-19

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.

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

State-resolved differential and integral cross sections for the Ne + H{sub 2}{sup +} (v = 0–2, j = 0) → NeH{sup +} + H reaction

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

Wu, Hui; Yao, Cui-Xia; He, Xiao-Hu

State-to-state quantum dynamic calculations for the proton transfer reaction Ne + H{sub 2}{sup +} (v = 0–2, j = 0) are performed on the most accurate LZHH potential energy surface, with the product Jacobi coordinate based time-dependent wave packet method including the Coriolis coupling. The J = 0 reaction probabilities for the title reaction agree well with previous results in a wide range of collision energy of 0.2-1.2 eV. Total integral cross sections are in reasonable agreement with the available experiment data. Vibrational excitation of the reactant is much more efficient in enhancing the reaction cross sections than translational andmore » rotational excitation. Total differential cross sections are found to be forward-backward peaked with strong oscillations, which is the indication of the complex-forming mechanism. As the collision energy increases, state-resolved differential cross section changes from forward-backward symmetric peaked to forward scattering biased. This forward bias can be attributed to the larger J partial waves, which makes the reaction like an abstraction process. Differential cross sections summed over two different sets of J partial waves for the v = 0 reaction at the collision energy of 1.2 eV are plotted to illustrate the importance of large J partial waves in the forward bias of the differential cross sections.« less

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.

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.

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.

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 QoS scheme for a congestion core network based on dissimilar QoS structures in smart-phone environments.

PubMed

Hong, Sung-Ryong; Na, Wonshik; Kang, Jang-Mook

2010-01-01

This study suggests an approach to effective transmission of multimedia content in a rapidly changing Internet environment including smart-phones. Guaranteeing QoS in networks is currently an important research topic. When transmitting Assured Forwarding (AF) packets in a Multi-DiffServ network environment, network A may assign priority in an order AF1, AF2, AF3 and AF4; on the other hand, network B may reverse the order to a priority AF4, AF3, AF2 and AF1. In this case, the AF1 packets that received the best quality of service in network A will receive the lowest in network B, which may result in dropping of packets in network B and vice versa. This study suggests a way to guarantee QoS between hosts by minimizing the loss of AF packet class when one network transmits AF class packets to another network with differing principles. It is expected that QoS guarantees and their experimental value may be utilized as principles which can be applied to various mobile-web environments based on smart-phones.

A QoS Scheme for a Congestion Core Network Based on Dissimilar QoS Structures in Smart-Phone Environments

PubMed Central

Hong, Sung-Ryong; Na, Wonshik; Kang, Jang-Mook

2010-01-01

This study suggests an approach to effective transmission of multimedia content in a rapidly changing Internet environment including smart-phones. Guaranteeing QoS in networks is currently an important research topic. When transmitting Assured Forwarding (AF) packets in a Multi-DiffServ network environment, network A may assign priority in an order AF1, AF2, AF3 and AF4; on the other hand, network B may reverse the order to a priority AF4, AF3, AF2 and AF1. In this case, the AF1 packets that received the best quality of service in network A will receive the lowest in network B, which may result in dropping of packets in network B and vice versa. This study suggests a way to guarantee QoS between hosts by minimizing the loss of AF packet class when one network transmits AF class packets to another network with differing principles. It is expected that QoS guarantees and their experimental value may be utilized as principles which can be applied to various mobile-web environments based on smart-phones. PMID:22163453

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

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

Packet-Based Protocol Efficiency for Aeronautical and Satellite Communications

NASA Technical Reports Server (NTRS)

Carek, David A.

2005-01-01

This paper examines the relation between bit error ratios and the effective link efficiency when transporting data with a packet-based protocol. Relations are developed to quantify the impact of a protocol s packet size and header size relative to the bit error ratio of the underlying link. These relations are examined in the context of radio transmissions that exhibit variable error conditions, such as those used in satellite, aeronautical, and other wireless networks. A comparison of two packet sizing methodologies is presented. From these relations, the true ability of a link to deliver user data, or information, is determined. Relations are developed to calculate the optimal protocol packet size forgiven link error characteristics. These relations could be useful in future research for developing an adaptive protocol layer. They can also be used for sizing protocols in the design of static links, where bit error ratios have small variability.

An Efficient Conflict Detection Algorithm for Packet Filters

NASA Astrophysics Data System (ADS)

Lee, Chun-Liang; Lin, Guan-Yu; Chen, Yaw-Chung

Packet classification is essential for supporting advanced network services such as firewalls, quality-of-service (QoS), virtual private networks (VPN), and policy-based routing. The rules that routers use to classify packets are called packet filters. If two or more filters overlap, a conflict occurs and leads to ambiguity in packet classification. This study proposes an algorithm that can efficiently detect and resolve filter conflicts using tuple based search. The time complexity of the proposed algorithm is O(nW+s), and the space complexity is O(nW), where n is the number of filters, W is the number of bits in a header field, and s is the number of conflicts. This study uses the synthetic filter databases generated by ClassBench to evaluate the proposed algorithm. Simulation results show that the proposed algorithm can achieve better performance than existing conflict detection algorithms both in time and space, particularly for databases with large numbers of conflicts.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

PubMed Central

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-01-01

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

Direct Harmonic Linear Navier-Stokes Methods for Efficient Simulation of Wave Packets

NASA Technical Reports Server (NTRS)

Streett, C. L.

1998-01-01

Wave packets produced by localized disturbances play an important role in transition in three-dimensional boundary layers, such as that on a swept wing. Starting with the receptivity process, we show the effects of wave-space energy distribution on the development of packets and other three-dimensional disturbance patterns. Nonlinearity in the receptivity process is specifically addressed, including demonstration of an effect which can enhance receptivity of traveling crossflow disturbances. An efficient spatial numerical simulation method is allowing most of the simulations presented to be carried out on a workstation.

MPNACK: an optical switching scheme enabling the buffer-less reliable transmission

NASA Astrophysics Data System (ADS)

Yu, Xiaoshan; Gu, Huaxi; Wang, Kun; Xu, Meng; Guo, Yantao

2016-01-01

Optical data center networks are becoming an increasingly promising solution to solve the bottlenecks faced by electrical networks, such as low transmission bandwidth, high wiring complexity, and unaffordable power consumption. However, the optical circuit switching (OCS) network is not flexible enough to carry the traffic burst while the optical packet switching (OPS) network cannot solve the packet contention in an efficient way. To this end, an improved switching strategy named OPS with multi-hop Negative Acknowledgement (MPNACK) is proposed. This scheme uses a feedback mechanism, rather than the buffering structure, to handle the optical packet contention. The collided packet is treated as a NACK packet and sent back to the source server. When the sender receives this NACK packet, it knows a collision happens in the transmission path and a retransmission procedure is triggered. Overall, the OPS-NACK scheme enables a reliable transmission in the buffer-less optical network. Furthermore, with this scheme, the expensive and energy-hungry elements, optical or electrical buffers, can be removed from the optical interconnects, thus a more scalable and cost-efficient network can be constructed for cloud computing data centers.

A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection

PubMed Central

Chen, Yaw-Chung

2015-01-01

The large quantities of data now being transferred via high-speed networks have made deep packet inspection indispensable for security purposes. Scalable and low-cost signature-based network intrusion detection systems have been developed for deep packet inspection for various software platforms. Traditional approaches that only involve central processing units (CPUs) are now considered inadequate in terms of inspection speed. Graphic processing units (GPUs) have superior parallel processing power, but transmission bottlenecks can reduce optimal GPU efficiency. In this paper we describe our proposal for a hybrid CPU/GPU pattern-matching algorithm (HPMA) that divides and distributes the packet-inspecting workload between a CPU and GPU. All packets are initially inspected by the CPU and filtered using a simple pre-filtering algorithm, and packets that might contain malicious content are sent to the GPU for further inspection. Test results indicate that in terms of random payload traffic, the matching speed of our proposed algorithm was 3.4 times and 2.7 times faster than those of the AC-CPU and AC-GPU algorithms, respectively. Further, HPMA achieved higher energy efficiency than the other tested algorithms. PMID:26437335

A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection.

PubMed

Lee, Chun-Liang; Lin, Yi-Shan; Chen, Yaw-Chung

2015-01-01

The large quantities of data now being transferred via high-speed networks have made deep packet inspection indispensable for security purposes. Scalable and low-cost signature-based network intrusion detection systems have been developed for deep packet inspection for various software platforms. Traditional approaches that only involve central processing units (CPUs) are now considered inadequate in terms of inspection speed. Graphic processing units (GPUs) have superior parallel processing power, but transmission bottlenecks can reduce optimal GPU efficiency. In this paper we describe our proposal for a hybrid CPU/GPU pattern-matching algorithm (HPMA) that divides and distributes the packet-inspecting workload between a CPU and GPU. All packets are initially inspected by the CPU and filtered using a simple pre-filtering algorithm, and packets that might contain malicious content are sent to the GPU for further inspection. Test results indicate that in terms of random payload traffic, the matching speed of our proposed algorithm was 3.4 times and 2.7 times faster than those of the AC-CPU and AC-GPU algorithms, respectively. Further, HPMA achieved higher energy efficiency than the other tested algorithms.

Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

NASA Astrophysics Data System (ADS)

Kumar, Sumit; Mehfuz, Shabana

2017-06-01

In mobile ad-hoc network (MANETs) flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. A probabilistic broadcasting is one of the widely used broadcasting scheme for route discovery in MANETs and provides solution for broadcasting storm problem. But it does not consider limited energy of the battery of the nodes. In this paper, a new energy efficient probabilistic broadcasting (EEPB) is proposed in which probability of broadcasting RREQs is calculated with respect to remaining energy of nodes. The analysis of simulation results clearly indicate that an EEPB route discovery scheme in ad-hoc on demand distance vector (AODV) can increase the network lifetime with a decrease in the average power consumption and RREQ packet overhead. It also decreases the number of dropped packets in the network, in comparison to other EEPB schemes like energy constraint gossip (ECG), energy aware gossip (EAG), energy based gossip (EBG) and network lifetime through energy efficient broadcast gossip (NEBG).

DMP: Detouring Using Multiple Paths against Jamming Attack for Ubiquitous Networking System

PubMed Central

Kim, Mihui; Chae, Kijoon

2010-01-01

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

DMP: detouring using multiple paths against jamming attack for ubiquitous networking system.

PubMed

Kim, Mihui; Chae, Kijoon

2010-01-01

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

Packet error rate analysis of decode-and-forward free-space optical cooperative networks in the presence of random link blockage

NASA Astrophysics Data System (ADS)

Zdravković, Nemanja; Cvetkovic, Aleksandra; Milic, Dejan; Djordjevic, Goran T.

2017-09-01

This paper analyses end-to-end packet error rate (PER) of a free-space optical decode-and-forward cooperative network over a gamma-gamma atmospheric turbulence channel in the presence of temporary random link blockage. Closed-form analytical expressions for PER are derived for the cases with and without transmission links being prone to blockage. Two cooperation protocols (denoted as 'selfish' and 'pilot-adaptive') are presented and compared, where the latter accounts for the presence of blockage and adapts transmission power. The influence of scintillation, link distance, average transmitted signal power, network topology and probability of an uplink and/or internode link being blocked are discussed when the destination applies equal gain combining. The results show that link blockage caused by obstacles can degrade system performance, causing an unavoidable PER floor. The implementation of the pilot-adaptive protocol improves performance when compared to the selfish protocol, diminishing internode link blockage and lowering the PER floor, especially for larger networks.

Understanding Route Aggregation

DTIC Science & Technology

2010-03-09

routing anomalies, and is fingered to be the cause of many reported loops and blackholes . In this paper, we posit that the problem arises from a lack of...Route aggre- gation can also result in blackholes [18], which are surprisingly prevalent in the Internet [11]. We illustrate these known anomalies with...advertisement Forwarding paths A B C 10.1.30.0/24 10.1.16.0/22 10.1.16.0/2010.1.16.0/20 Figure 4: Illustration of a blackhole . forwards the packet to Y

Performance comparison between packet and continuous data transmission using two adaptive equalizers in shallow water

NASA Astrophysics Data System (ADS)

Yoon, Jong Rak; Park, Kyu-Chil; Park, Jihyun

2015-07-01

Transmitted signals are markedly affected by sea surface and bottom boundaries in shallow water. The time variant reflection signals from such boundaries characterize the channel as a frequency-selective fading channel and cause intersymbol interference (ISI) in underwater acoustic communication. A channel-estimate-based equalizer is usually adopted to compensate for the reflected signals under this kind of acoustic channel. In this study, we apply two approaches for packet and continuous data transmission of the quadrature phase shift keying (QPSK) system. One is the use of a two-dimensional (2D) rotation matrix in a non-frequency-selective channel. The other is the use of two equalizers of types — the feed forward equalizer (FFE) and decision-directed equalizer (DDE) — with a normalized least mean square (NLMS) algorithm in a frequency-selective channel. The percentage improvement of packet transmission is notably better than that of continuous transmission.

Enhanced International Space Station Ku-Band Telemetry Service

NASA Technical Reports Server (NTRS)

Cecil, Andrew J.; Pitts, R. Lee; Welch, Steven J.; Bryan, Jason D.

2014-01-01

The International Space Station (ISS) is in an operational configuration. To fully utilize the ISS and take advantage of the modern protocols and updated Ku-band access, the Huntsville Operations Support Center (HOSC) has designed an approach to extend the Kuband forward link access for payload investigators to their on-orbit payloads. This dramatically increases the ground to ISS communications for those users. This access also enables the ISS flight controllers operating in the Payload Operations and Integration Center to have more direct control over the systems they are responsible for managing and operating. To extend the Ku-band forward link to the payload user community the development of a new command server is necessary. The HOSC subsystems were updated to process the Internet Protocol Encapsulated packets, enable users to use the service based on their approved services, and perform network address translation to insure that the packets are forwarded from the user to the correct payload repeating that process in reverse from ISS to the payload user. This paper presents the architecture, implementation, and lessons learned. This will include the integration of COTS hardware and software as well as how the device is incorporated into the operational mission of the ISS. Thus, this paper also discusses how this technology can be applicable to payload users of the ISS.

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.

The Speech multi features fusion perceptual hash algorithm based on tensor decomposition

NASA Astrophysics Data System (ADS)

Huang, Y. B.; Fan, M. H.; Zhang, Q. Y.

2018-03-01

With constant progress in modern speech communication technologies, the speech data is prone to be attacked by the noise or maliciously tampered. In order to make the speech perception hash algorithm has strong robustness and high efficiency, this paper put forward a speech perception hash algorithm based on the tensor decomposition and multi features is proposed. This algorithm analyses the speech perception feature acquires each speech component wavelet packet decomposition. LPCC, LSP and ISP feature of each speech component are extracted to constitute the speech feature tensor. Speech authentication is done by generating the hash values through feature matrix quantification which use mid-value. Experimental results showing that the proposed algorithm is robust for content to maintain operations compared with similar algorithms. It is able to resist the attack of the common background noise. Also, the algorithm is highly efficiency in terms of arithmetic, and is able to meet the real-time requirements of speech communication and complete the speech authentication quickly.

47 CFR 95.1311 - Repeater operations and signal boosters prohibited.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 5 2012-10-01 2012-10-01 false Repeater operations and signal boosters... § 95.1311 Repeater operations and signal boosters prohibited. MURS stations are prohibited from operating as a repeater station or as a signal booster. This prohibition includes store-and-forward packet...

47 CFR 95.1311 - Repeater operations and signal boosters prohibited.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Repeater operations and signal boosters... § 95.1311 Repeater operations and signal boosters prohibited. MURS stations are prohibited from operating as a repeater station or as a signal booster. This prohibition includes store-and-forward packet...

47 CFR 95.1311 - Repeater operations and signal boosters prohibited.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 5 2013-10-01 2013-10-01 false Repeater operations and signal boosters... § 95.1311 Repeater operations and signal boosters prohibited. MURS stations are prohibited from operating as a repeater station or as a signal booster. This prohibition includes store-and-forward packet...

47 CFR 95.1311 - Repeater operations and signal boosters prohibited.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 5 2014-10-01 2014-10-01 false Repeater operations and signal boosters... § 95.1311 Repeater operations and signal boosters prohibited. MURS stations are prohibited from operating as a repeater station or as a signal booster. This prohibition includes store-and-forward packet...

47 CFR 95.1311 - Repeater operations and signal boosters prohibited.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Repeater operations and signal boosters... § 95.1311 Repeater operations and signal boosters prohibited. MURS stations are prohibited from operating as a repeater station or as a signal booster. This prohibition includes store-and-forward packet...

Rejection of the maternal electrocardiogram in the electrohysterogram signal.

PubMed

Leman, H; Marque, C

2000-08-01

The electrohysterogram (EHG) signal is mainly corrupted by the mother's electrocardiogram (ECG), which remains present despite analog filtering during acquisition. Wavelets are a powerful denoising tool and have already proved their efficiency on the EHG. In this paper, we propose a new method that employs the redundant wavelet packet transform. We first study wavelet packet coefficient histograms and propose an algorithm to automatically detect the histogram mode number. Using a new criterion, we compute a best basis adapted to the denoising. After EHG wavelet packet coefficient thresholding in the selected basis, the inverse transform is applied. The ECG seems to be very efficiently removed.

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

NASA Astrophysics Data System (ADS)

Gan, Yu; Tang, Ming; Yang, Hanxin

2013-05-01

Since the discovery of non-Poisson statistics of human mobility trajectories, more attention has been paid to understand the role of these patterns in different dynamics. In this study, we first introduce the heterogeneous mobility of mobile agents into dynamical networks, and then investigate packet forwarding strategy on the heterogeneous dynamical networks. We find that the faster speed and the higher proportion of high-speed agents can enhance the network throughput and reduce the mean traveling time in random forwarding. A hierarchical structure in the dependence of high-speed is observed: the network throughput remains unchanged at small and large high-speed value. It is also interesting to find that a slightly preferential forwarding to high-speed agents can maximize the network capacity. Through theoretical analysis and numerical simulations, we show that the optimal forwarding ratio stems from the local structural heterogeneity of low-speed agents.

Soliton Gases and Generalized Hydrodynamics

NASA Astrophysics Data System (ADS)

Doyon, Benjamin; Yoshimura, Takato; Caux, Jean-Sébastien

2018-01-01

We show that the equations of generalized hydrodynamics (GHD), a hydrodynamic theory for integrable quantum systems at the Euler scale, emerge in full generality in a family of classical gases, which generalize the gas of hard rods. In this family, the particles, upon colliding, jump forward or backward by a distance that depends on their velocities, reminiscent of classical soliton scattering. This provides a "molecular dynamics" for GHD: a numerical solver which is efficient, flexible, and which applies to the presence of external force fields. GHD also describes the hydrodynamics of classical soliton gases. We identify the GHD of any quantum model with that of the gas of its solitonlike wave packets, thus providing a remarkable quantum-classical equivalence. The theory is directly applicable, for instance, to integrable quantum chains and to the Lieb-Liniger model realized in cold-atom experiments.

Hybrid Packet-Pheromone-Based Probabilistic Routing for Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Kashkouli Nejad, Keyvan; Shawish, Ahmed; Jiang, Xiaohong; Horiguchi, Susumu

Ad-Hoc networks are collections of mobile nodes communicating using wireless media without any fixed infrastructure. Minimal configuration and quick deployment make Ad-Hoc networks suitable for emergency situations like natural disasters or military conflicts. The current Ad-Hoc networks can only support either high mobility or high transmission rate at a time because they employ static approaches in their routing schemes. However, due to the continuous expansion of the Ad-Hoc network size, node-mobility and transmission rate, the development of new adaptive and dynamic routing schemes has become crucial. In this paper we propose a new routing scheme to support high transmission rates and high node-mobility simultaneously in a big Ad-Hoc network, by combining a new proposed packet-pheromone-based approach with the Hint Based Probabilistic Protocol (HBPP) for congestion avoidance with dynamic path selection in packet forwarding process. Because of using the available feedback information, the proposed algorithm does not introduce any additional overhead. The extensive simulation-based analysis conducted in this paper indicates that the proposed algorithm offers small packet-latency and achieves a significantly higher delivery probability in comparison with the available Hint-Based Probabilistic Protocol (HBPP).

Study on acceleration processes of the radiation belt electrons through interaction with sub-packet chorus waves in parallel propagation

NASA Astrophysics Data System (ADS)

Hiraga, R.; Omura, Y.

2017-12-01

By recent observations, chorus waves include fine structures such as amplitude fluctuations (i.e. sub-packet structure), and it has not been verified in detail yet how energetic electrons are efficiently accelerated under the wave features. In this study, we firstly focus on the acceleration process of a single electron: how it experiences the efficient energy increase by interaction with sub-packet chorus waves in parallel propagation along the Earth's magnetic field. In order to reproduce the chorus waves as seen by the latest observations by Van Allen Probes (Foster et al. 2017), the wave model amplitude in our simulation is structured such that when the wave amplitude nonlinearly grows to reach the optimum amplitude, it starts decreasing until crossing the threshold. Once it crosses the threshold, the wave dissipates and a new wave rises to repeat the nonlinear growth and damping in the same manner. The multiple occurrence of this growth-damping cycle forms a saw tooth-like amplitude variation called sub-packet. This amplitude variation also affects the wave frequency behavior which is derived by the chorus wave equations as a function of the wave amplitude (Omura et al. 2009). It is also reasonable to assume that when a wave packet diminishes and the next wave rises, it has a random phase independent of the previous wave. This randomness (discontinuity) in phase variation is included in the simulation. Through interaction with such waves, dynamics of energetic electrons were tracked. As a result, some electrons underwent an efficient acceleration process defined as successive entrapping, in which an electron successfully continues to surf the trapping potential generated by consecutive wave packets. When successive entrapping occurs, an electron trapped and de-trapped (escape the trapping potential) by a single wave packet falls into another trapping potential generated by the next wave sub-packet and continuously accelerated. The occurrence of successive entrapping is influenced by some factors such as the magnitude of wave amplitude or inhomogeneity of the Earth's dipole magnetic field. In addition, an energy range of electrons is also a major factor. In this way, it has been examined in detail how and under which conditions electrons are efficiently accelerated in the formation process of the radiation belts.

Systematic network coding for two-hop lossy transmissions

NASA Astrophysics Data System (ADS)

Li, Ye; Blostein, Steven; Chan, Wai-Yip

2015-12-01

In this paper, we consider network transmissions over a single or multiple parallel two-hop lossy paths. These scenarios occur in applications such as sensor networks or WiFi offloading. Random linear network coding (RLNC), where previously received packets are re-encoded at intermediate nodes and forwarded, is known to be a capacity-achieving approach for these networks. However, a major drawback of RLNC is its high encoding and decoding complexity. In this work, a systematic network coding method is proposed. We show through both analysis and simulation that the proposed method achieves higher end-to-end rate as well as lower computational cost than RLNC for finite field sizes and finite-sized packet transmissions.

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.

Availability and End-to-end Reliability in Low Duty Cycle Multihop Wireless Sensor Networks.

PubMed

Suhonen, Jukka; Hämäläinen, Timo D; Hännikäinen, Marko

2009-01-01

A wireless sensor network (WSN) is an ad-hoc technology that may even consist of thousands of nodes, which necessitates autonomic, self-organizing and multihop operations. A typical WSN node is battery powered, which makes the network lifetime the primary concern. The highest energy efficiency is achieved with low duty cycle operation, however, this alone is not enough. WSNs are deployed for different uses, each requiring acceptable Quality of Service (QoS). Due to the unique characteristics of WSNs, such as dynamic wireless multihop routing and resource constraints, the legacy QoS metrics are not feasible as such. We give a new definition to measure and implement QoS in low duty cycle WSNs, namely availability and reliability. Then, we analyze the effect of duty cycling for reaching the availability and reliability. The results are obtained by simulations with ZigBee and proprietary TUTWSN protocols. Based on the results, we also propose a data forwarding algorithm suitable for resource constrained WSNs that guarantees end-to-end reliability while adding a small overhead that is relative to the packet error rate (PER). The forwarding algorithm guarantees reliability up to 30% PER.

Performance Evaluation of AODV with Blackhole Attack

NASA Astrophysics Data System (ADS)

Dara, Karuna

2010-11-01

A Mobile Ad Hoc Network (MANET) is a temporary network set up by a wireless mobile computers moving arbitrary in the places that have no network infrastructure. These nodes maintain connectivity in a decentralized manner. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network. Thus the nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, mobile ad-hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. In this paper, we simulated the black hole attack in various mobile ad-hoc network scenarios using AODV routing protocol of MANET and have tried to find a effect if number of nodes are increased with increase in malicious nodes.

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

Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

NASA Astrophysics Data System (ADS)

Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

2018-01-01

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

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.

Efficient Sparse Signal Transmission over a Lossy Link Using Compressive Sensing

PubMed Central

Wu, Liantao; Yu, Kai; Cao, Dongyu; Hu, Yuhen; Wang, Zhi

2015-01-01

Reliable data transmission over lossy communication link is expensive due to overheads for error protection. For signals that have inherent sparse structures, compressive sensing (CS) is applied to facilitate efficient sparse signal transmissions over lossy communication links without data compression or error protection. The natural packet loss in the lossy link is modeled as a random sampling process of the transmitted data, and the original signal will be reconstructed from the lossy transmission results using the CS-based reconstruction method at the receiving end. The impacts of packet lengths on transmission efficiency under different channel conditions have been discussed, and interleaving is incorporated to mitigate the impact of burst data loss. Extensive simulations and experiments have been conducted and compared to the traditional automatic repeat request (ARQ) interpolation technique, and very favorable results have been observed in terms of both accuracy of the reconstructed signals and the transmission energy consumption. Furthermore, the packet length effect provides useful insights for using compressed sensing for efficient sparse signal transmission via lossy links. PMID:26287195

Analysis of Cisco Open Network Environment (ONE) OpenFlow Controller Implementation

DTIC Science & Technology

2014-08-01

Software - Defined Networking ( SDN ), when fully realized, offer many improvements over the current rigid and...functionalities like handshake, connection setup, switch management, and security. 15. SUBJECT TERMS OpenFlow, software - defined networking , Cisco ONE, SDN ...innovating packet-forwarding technologies. Network device roles are strictly defined with little or no flexibility. In Software - Defined Networks ( SDNs ),

Packet-aware transport for video distribution [Invited

NASA Astrophysics Data System (ADS)

Aguirre-Torres, Luis; Rosenfeld, Gady; Bruckman, Leon; O'Connor, Mannix

2006-05-01

We describe a solution based on resilient packet rings (RPR) for the distribution of broadcast video and video-on-demand (VoD) content over a packet-aware transport network. The proposed solution is based on our experience in the design and deployment of nationwide Triple Play networks and relies on technologies such as RPR, multiprotocol label switching (MPLS), and virtual private LAN service (VPLS) to provide the most efficient solution in terms of utilization, scalability, and availability.

Embedded wavelet packet transform technique for texture compression

NASA Astrophysics Data System (ADS)

Li, Jin; Cheng, Po-Yuen; Kuo, C.-C. Jay

1995-09-01

A highly efficient texture compression scheme is proposed in this research. With this scheme, energy compaction of texture images is first achieved by the wavelet packet transform, and an embedding approach is then adopted for the coding of the wavelet packet transform coefficients. By comparing the proposed algorithm with the JPEG standard, FBI wavelet/scalar quantization standard and the EZW scheme with extensive experimental results, we observe a significant improvement in the rate-distortion performance and visual quality.

Transfer of a wave packet in double-well potential

NASA Astrophysics Data System (ADS)

Yang, Hai-Feng; Hu, Yao-Hua; Tan, Yong-Gang

2018-04-01

Energy potentials with double-well structures are typical in atoms and molecules systems. A manipulation scheme using Half Cycles Pulses (HCPs) is proposed to transfer a Gaussian wave packet between the two wells. On the basis of quantum mechanical simulations, the time evolution and the energy distribution of the wave packet are evaluated. The effect of time parameters, amplitude, and number of HCPs on spatial and energy distribution of the final state and transfer efficiency are investigated. After a carefully tailored HCPs sequence is applied to the initial wave packet localized in one well, the final state is a wave packet localized in the other well and populated at the lower energy levels with narrower distribution. The present scheme could be used to control molecular reactions and to prepare atoms with large dipole moments.

Fast WEP-Key Recovery Attack Using Only Encrypted IP Packets

NASA Astrophysics Data System (ADS)

Teramura, Ryoichi; Asakura, Yasuo; Ohigashi, Toshihiro; Kuwakado, Hidenori; Morii, Masakatu

Conventional efficient key recovery attacks against Wired Equivalent Privacy (WEP) require specific initialization vectors or specific packets. Since it takes much time to collect the packets sufficiently, any active attack should be performed. An Intrusion Detection System (IDS), however, will be able to prevent the attack. Since the attack logs are stored at the servers, it is possible to prevent such an attack. This paper proposes an algorithm for recovering a 104-bit WEP key from any IP packets in a realistic environment. This attack needs about 36, 500 packets with a success probability 0.5, and the complexity of our attack is equivalent to about 220 computations of the RC4 key setups. Since our attack is passive, it is difficult for both WEP users and administrators to detect our attack.

Enabling IP Header Compression in COTS Routers via Frame Relay on a Simplex Link

NASA Technical Reports Server (NTRS)

Nguyen, Sam P.; Pang, Jackson; Clare, Loren P.; Cheng, Michael K.

2010-01-01

NASA is moving toward a networkcentric communications architecture and, in particular, is building toward use of Internet Protocol (IP) in space. The use of IP is motivated by its ubiquitous application in many communications networks and in available commercial off-the-shelf (COTS) technology. The Constellation Program intends to fit two or more voice (over IP) channels on both the forward link to, and the return link from, the Orion Crew Exploration Vehicle (CEV) during all mission phases. Efficient bandwidth utilization of the links is key for voice applications. In Voice over IP (VoIP), the IP packets are limited to small sizes to keep voice latency at a minimum. The common voice codec used in VoIP is G.729. This new algorithm produces voice audio at 8 kbps and in packets of 10-milliseconds duration. Constellation has designed the VoIP communications stack to use the combination of IP/UDP/RTP protocols where IP carries a 20-byte header, UDP (User Datagram Protocol) carries an 8-byte header, and RTP (Real Time Transport Protocol) carries a 12-byte header. The protocol headers total 40 bytes and are equal in length to a 40-byte G.729 payload, doubling the VoIP latency. Since much of the IP/UDP/RTP header information does not change from IP packet to IP packet, IP/UDP/RTP header compression can avoid transmission of much redundant data as well as reduce VoIP latency. The benefits of IP header compression are more pronounced at low data rate links such as the forward and return links during CEV launch. IP/UDP/RTP header compression codecs are well supported by many COTS routers. A common interface to the COTS routers is through frame relay. However, enabling IP header compression over frame relay, according to industry standard (Frame Relay IP Header Compression Agreement FRF.20), requires a duplex link and negotiations between the compressor router and the decompressor router. In Constellation, each forward to and return link from the CEV in space is treated independently as a simplex link. Without negotiation, the COTS routers are prevented from entering into the IP header compression mode, and no IP header compression would be performed. An algorithm is proposed to enable IP header compression in COTS routers on a simplex link with no negotiation or with a one-way messaging. In doing so, COTS routers can enter IP header compression mode without the need to handshake through a bidirectional link as required by FRF.20. This technique would spoof the routers locally and thereby allow the routers to enter into IP header compression mode without having the negotiations between routers actually occur. The spoofing function is conducted by a frame relay adapter (also COTS) with the capability to generate control messages according to the FRF.20 descriptions. Therefore, negotiation is actually performed between the FRF.20 adapter and the connecting COTS router locally and never occurs over the space link. Through understanding of the handshaking protocol described by FRF.20, the necessary FRF.20 negotiations messages can be generated to control the connecting router, not only to turn on IP header compression but also to adjust the compression parameters. The FRF.20 negotiation (or control) message is composed in the FRF.20 adapter by interpreting the incoming router request message. Many of the fields are simply transcribed from request to response while the control field indicating response and type are modified.

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.

Protection of HEVC Video Delivery in Vehicular Networks with RaptorQ Codes

PubMed Central

Martínez-Rach, Miguel; López, Otoniel; Malumbres, Manuel Pérez

2014-01-01

With future vehicles equipped with processing capability, storage, and communications, vehicular networks will become a reality. A vast number of applications will arise that will make use of this connectivity. Some of them will be based on video streaming. In this paper we focus on HEVC video coding standard streaming in vehicular networks and how it deals with packet losses with the aid of RaptorQ, a Forward Error Correction scheme. As vehicular networks are packet loss prone networks, protection mechanisms are necessary if we want to guarantee a minimum level of quality of experience to the final user. We have run simulations to evaluate which configurations fit better in this type of scenarios. PMID:25136675

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.

Research on moving target defense based on SDN

NASA Astrophysics Data System (ADS)

Chen, Mingyong; Wu, Weimin

2017-08-01

An address mutation strategy was proposed. This strategy provided an unpredictable change in address, replacing the real address of the packet forwarding process and path mutation, thus hiding the real address of the host and path. a mobile object defense technology based on Spatio-temporal Mutation on this basis is proposed, Using the software Defined Network centralized control architecture advantage combines sFlow traffic monitoring technology and Moving Target Defense. A mutated time period which can be changed in real time according to the network traffic is changed, and the destination address is changed while the controller abruptly changes the address while the data packet is transferred between the switches to construct a moving target, confusing the host within the network, thereby protecting the host and network.

Multicast Routing of Hierarchical Data

NASA Technical Reports Server (NTRS)

Shacham, Nachum

1992-01-01

The issue of multicast of broadband, real-time data in a heterogeneous environment, in which the data recipients differ in their reception abilities, is considered. Traditional multicast schemes, which are designed to deliver all the source data to all recipients, offer limited performance in such an environment, since they must either force the source to overcompress its signal or restrict the destination population to those who can receive the full signal. We present an approach for resolving this issue by combining hierarchical source coding techniques, which allow recipients to trade off reception bandwidth for signal quality, and sophisticated routing algorithms that deliver to each destination the maximum possible signal quality. The field of hierarchical coding is briefly surveyed and new multicast routing algorithms are presented. The algorithms are compared in terms of network utilization efficiency, lengths of paths, and the required mechanisms for forwarding packets on the resulting paths.

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,

Information Switching Processor (ISP) contention analysis and control

NASA Technical Reports Server (NTRS)

Inukai, Thomas

1995-01-01

In designing a satellite system with on-board processing, the selection of a switching architecture is often critical. The on-board switching function can be implemented by circuit switching or packet switching. Destination-directed packet switching has several attractive features, such as self-routing without on-board switch reconfiguration, no switch control memory requirement, efficient bandwidth utilization for packet switched traffic, and accommodation of circuit switched traffic. Destination-directed packet switching, however, has two potential concerns: (1) contention and (2) congestion. And this report specifically deals with the first problem. It includes a description and analysis of various self-routing switch structures, the nature of contention problems, and contention and resolution techniques.

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks.

PubMed

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-07-09

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption.

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks †

PubMed Central

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-01-01

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616

An Energy-Aware Hybrid ARQ Scheme with Multi-ACKs for Data Sensing Wireless Sensor Networks.

PubMed

Zhang, Jinhuan; Long, Jun

2017-06-12

Wireless sensor networks (WSNs) are one of the important supporting technologies of edge computing. In WSNs, reliable communications are essential for most applications due to the unreliability of wireless links. In addition, network lifetime is also an important performance metric and needs to be considered in many WSN studies. In the paper, an energy-aware hybrid Automatic Repeat-reQuest protocol (ARQ) scheme is proposed to ensure energy efficiency under the guarantee of network transmission reliability. In the scheme, the source node sends data packets continuously with the correct window size and it does not need to wait for the acknowledgement (ACK) confirmation for each data packet. When the destination receives K data packets, it will return multiple copies of one ACK for confirmation to avoid ACK packet loss. The energy consumption of each node in flat circle network applying the proposed scheme is statistical analyzed and the cases under which it is more energy efficiency than the original scheme is discussed. Moreover, how to select parameters of the scheme is addressed to extend the network lifetime under the constraint of the network reliability. In addition, the energy efficiency of the proposed schemes is evaluated. Simulation results are presented to demonstrate that a node energy consumption reduction could be gained and the network lifetime is prolonged.

Optimal JPWL Forward Error Correction Rate Allocation for Robust JPEG 2000 Images and Video Streaming over Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Agueh, Max; Diouris, Jean-François; Diop, Magaye; Devaux, François-Olivier; De Vleeschouwer, Christophe; Macq, Benoit

2008-12-01

Based on the analysis of real mobile ad hoc network (MANET) traces, we derive in this paper an optimal wireless JPEG 2000 compliant forward error correction (FEC) rate allocation scheme for a robust streaming of images and videos over MANET. The packet-based proposed scheme has a low complexity and is compliant to JPWL, the 11th part of the JPEG 2000 standard. The effectiveness of the proposed method is evaluated using a wireless Motion JPEG 2000 client/server application; and the ability of the optimal scheme to guarantee quality of service (QoS) to wireless clients is demonstrated.

Privacy preservation and authentication on secure geographical routing in VANET

NASA Astrophysics Data System (ADS)

Punitha, A.; Manickam, J. Martin Leo

2017-05-01

Vehicular Ad hoc Networks (VANETs) play an important role in vehicle-to-vehicle communication as it offers a high level of safety and convenience to drivers. In order to increase the level of security and safety in VANETs, in this paper, we propose a Privacy Preservation and Authentication on Secure Geographical Routing Protocol (PPASGR) for VANET. It provides security by detecting and preventing malicious nodes through two directional antennas such as forward (f-antenna) and backward (b-antenna). The malicious nodes are detected by direction detection, consistency detection and conflict detection. The location of the trusted neighbour is identified using TNT-based location verification scheme after the implementation of the Vehicle Tamper Proof Device (VTPD), Trusted Authority (TA) is generated that produces the anonymous credentials. Finally, VTPD generates pseudo-identity using TA which retrieves the real identity of the sender. Through this approach, the authentication, integrity and confidentiality for routing packets can be achieved. The simulation results show that the proposed approach reduces the packet drop due to attack and improves the packet delivery ratio.

On Maximizing the Throughput of Packet Transmission under Energy Constraints.

PubMed

Wu, Weiwei; Dai, Guangli; Li, Yan; Shan, Feng

2018-06-23

More and more Internet of Things (IoT) wireless devices have been providing ubiquitous services over the recent years. Since most of these devices are powered by batteries, a fundamental trade-off to be addressed is the depleted energy and the achieved data throughput in wireless data transmission. By exploiting the rate-adaptive capacities of wireless devices, most existing works on energy-efficient data transmission try to design rate-adaptive transmission policies to maximize the amount of transmitted data bits under the energy constraints of devices. Such solutions, however, cannot apply to scenarios where data packets have respective deadlines and only integrally transmitted data packets contribute. Thus, this paper introduces a notion of weighted throughput, which measures how much total value of data packets are successfully and integrally transmitted before their own deadlines. By designing efficient rate-adaptive transmission policies, this paper aims to make the best use of the energy and maximize the weighted throughput. What is more challenging but with practical significance, we consider the fading effect of wireless channels in both offline and online scenarios. In the offline scenario, we develop an optimal algorithm that computes the optimal solution in pseudo-polynomial time, which is the best possible solution as the problem undertaken is NP-hard. In the online scenario, we propose an efficient heuristic algorithm based on optimal properties derived for the optimal offline solution. Simulation results validate the efficiency of the proposed algorithm.

Coupled wave-packets for non-adiabatic molecular dynamics: a generalization of Gaussian wave-packet dynamics to multiple potential energy surfaces

DOE PAGES

White, Alexander James; Tretiak, Sergei; Mozyrsky, Dima V.

2016-04-25

Accurate simulation of the non-adiabatic dynamics of molecules in excited electronic states is key to understanding molecular photo-physical processes. Here we present a novel method, based on a semiclassical approximation, that is as efficient as the commonly used mean field Ehrenfest or ad hoc surface hopping methods and properly accounts for interference and decoherence effects. This novel method is an extension of Heller's thawed Gaussian wave-packet dynamics that includes coupling between potential energy surfaces. By studying several standard test problems we demonstrate that the accuracy of the method can be systematically improved while maintaining high efficiency. The method is suitablemore » for investigating the role of quantum coherence in the non-adiabatic dynamics of many-atom molecules.« less

A Secure Multicast Framework in Large and High-Mobility Network Groups

NASA Astrophysics Data System (ADS)

Lee, Jung-San; Chang, Chin-Chen

With the widespread use of Internet applications such as Teleconference, Pay-TV, Collaborate tasks, and Message services, how to construct and distribute the group session key to all group members securely is becoming and more important. Instead of adopting the point-to-point packet delivery, these emerging applications are based upon the mechanism of multicast communication, which allows the group member to communicate with multi-party efficiently. There are two main issues in the mechanism of multicast communication: Key Distribution and Scalability. The first issue is how to distribute the group session key to all group members securely. The second one is how to maintain the high performance in large network groups. Group members in conventional multicast systems have to keep numerous secret keys in databases, which makes it very inconvenient for them. Furthermore, in case that a member joins or leaves the communication group, many involved participants have to change their own secret keys to preserve the forward secrecy and the backward secrecy. We consequently propose a novel version for providing secure multicast communication in large network groups. Our proposed framework not only preserves the forward secrecy and the backward secrecy but also possesses better performance than existing alternatives. Specifically, simulation results demonstrate that our scheme is suitable for high-mobility environments.

Towards Internet QoS provisioning based on generic distributed QoS adaptive routing engine.

PubMed

Haikal, Amira Y; Badawy, M; Ali, Hesham A

2014-01-01

Increasing efficiency and quality demands of modern Internet technologies drive today's network engineers to seek to provide quality of service (QoS). Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE) architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can be built. DQARE architecture is furnished with three relevant traffic control schemes, namely, service differentiation, QoS routing, and traffic engineering. The main objective of this paper is to (i) provide a general configuration guideline for service differentiation, (ii) formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA) based on dynamic programming technique, and (iii) propose QoS multipath forwarding (QMPF) model for paths diversity exploitation. NS2-based simulations proved the DQARE superiority in terms of delay, packet delivery ratio, throughput, and control overhead. Moreover, extensive simulations are used to compare the proposed QOPRA algorithm and QMPF model with their counterparts in the literature.

Towards Internet QoS Provisioning Based on Generic Distributed QoS Adaptive Routing Engine

PubMed Central

Haikal, Amira Y.; Badawy, M.; Ali, Hesham A.

2014-01-01

Increasing efficiency and quality demands of modern Internet technologies drive today's network engineers to seek to provide quality of service (QoS). Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE) architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can be built. DQARE architecture is furnished with three relevant traffic control schemes, namely, service differentiation, QoS routing, and traffic engineering. The main objective of this paper is to (i) provide a general configuration guideline for service differentiation, (ii) formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA) based on dynamic programming technique, and (iii) propose QoS multipath forwarding (QMPF) model for paths diversity exploitation. NS2-based simulations proved the DQARE superiority in terms of delay, packet delivery ratio, throughput, and control overhead. Moreover, extensive simulations are used to compare the proposed QOPRA algorithm and QMPF model with their counterparts in the literature. PMID:25309955

A Cross-Layer Duty Cycle MAC Protocol Supporting a Pipeline Feature for Wireless Sensor Networks

PubMed Central

Tong, Fei; Xie, Rong; Shu, Lei; Kim, Young-Chon

2011-01-01

Although the conventional duty cycle MAC protocols for Wireless Sensor Networks (WSNs) such as RMAC perform well in terms of saving energy and reducing end-to-end delivery latency, they were designed independently and require an extra routing protocol in the network layer to provide path information for the MAC layer. In this paper, we propose a new cross-layer duty cycle MAC protocol with data forwarding supporting a pipeline feature (P-MAC) for WSNs. P-MAC first divides the whole network into many grades around the sink. Each node identifies its grade according to its logical hop distance to the sink and simultaneously establishes a sleep/wakeup schedule using the grade information. Those nodes in the same grade keep the same schedule, which is staggered with the schedule of the nodes in the adjacent grade. Then a variation of the RTS/CTS handshake mechanism is used to forward data continuously in a pipeline fashion from the higher grade to the lower grade nodes and finally to the sink. No extra routing overhead is needed, thus increasing the network scalability while maintaining the superiority of duty-cycling. The simulation results in OPNET show that P-MAC has better performance than S-MAC and RMAC in terms of packet delivery latency and energy efficiency. PMID:22163895

Efficient Buffering Scheme in the LMA for Seamless Handover in PMIPv6

NASA Astrophysics Data System (ADS)

Kim, Kwang-Ryoul; Lee, Hyo-Beom; Choi, Hyon-Young; Min, Sung-Gi; Han, Youn-Hee

Proxy Mobile IPv6 (PMIPv6) is proposed as a new network-based local mobility protocol which does not involve the Mobile Node (MN) in mobility management. PMIPv6, which uses link-layer attachment information, reduces the movement detection time and eliminates duplicate address detection procedures in order to provide faster handover than Mobile IPv6 (MIPv6). To eliminate packet loss during the handover period, the Local Mobility Anchor (LMA) buffering scheme is proposed. In this scheme, the LMA buffers lost packets of the Mobile Access Gateway (MAG) and the MN during the handover and recovers them after handover. A new Automatic Repeat reQuest (ARQ) handler is defined which efficiently manages the LMA buffer. The ARQ handler relays ARQ result between the MAG and the MN to the LMA. The LMA removes any buffered packets which have been successfully delivered to the MN. The ARQ handler recovers the packet loss during the handover using buffered packets in the LMA. The ARQ information, between the MAG and LMA, is inserted in the outer header of IP-in-IP encapsulated packets of a standard PMIPv6 tunnel. Since the proposed scheme simply adds information to the standard operation of an IP-in-IP tunnel between the LMA and the MAG, it can be implemented seamlessly without modification to the original PMIPv6 messages and signaling sequence. Unlike other Fast Handovers for Mobile IPv6 (FMIPv6) based enhancement for PMIPv6, the proposed scheme does not require any handover related information before the actual handover.

Hiding the Source Based on Limited Flooding for Sensor Networks.

PubMed

Chen, Juan; Lin, Zhengkui; Hu, Ying; Wang, Bailing

2015-11-17

Wireless sensor networks are widely used to monitor valuable objects such as rare animals or armies. Once an object is detected, the source, i.e., the sensor nearest to the object, generates and periodically sends a packet about the object to the base station. Since attackers can capture the object by localizing the source, many protocols have been proposed to protect source location. Instead of transmitting the packet to the base station directly, typical source location protection protocols first transmit packets randomly for a few hops to a phantom location, and then forward the packets to the base station. The problem with these protocols is that the generated phantom locations are usually not only near the true source but also close to each other. As a result, attackers can easily trace a route back to the source from the phantom locations. To address the above problem, we propose a new protocol for source location protection based on limited flooding, named SLP. Compared with existing protocols, SLP can generate phantom locations that are not only far away from the source, but also widely distributed. It improves source location security significantly with low communication cost. We further propose a protocol, namely SLP-E, to protect source location against more powerful attackers with wider fields of vision. The performance of our SLP and SLP-E are validated by both theoretical analysis and simulation results.

Exact wave packet dynamics of singlet fission in unsubstituted and substituted polyene chains within long-range interacting models

NASA Astrophysics Data System (ADS)

Prodhan, Suryoday; Ramasesha, S.

2017-08-01

Singlet fission (SF) is a potential pathway for significant enhancement of efficiency in organic solar cells (OSC). In this paper, we study singlet fission in a pair of polyene molecules in two different stacking arrangements employing exact many-body wave packet dynamics. In the noninteracting model, the SF yield is absent. The individual molecules are treated within Hubbard and Pariser-Parr-Pople (PPP) models and the interaction between them involves transfer terms, intersite electron repulsions, and site-charge-bond-charge repulsion terms. Initial wave packet is constructed from excited singlet state of one molecule and ground state of the other. Time development of this wave packet under the influence of intermolecular interactions is followed within the Schrödinger picture by an efficient predictor-corrector scheme. In unsubstituted Hubbard and PPP chains, 2 1A excited singlet state leads to significant SF yield while the 1 1B state gives negligible fission yield. On substitution by donor-acceptor groups of moderate strength, the lowest excited state will have sufficient 2 1A character and hence results in significant SF yield. Because of rapid internal conversion, the nature of the lowest excited singlet will determine the SF contribution to OSC efficiency. Furthermore, we find the fission yield depends considerably on the stacking arrangement of the polyene molecules.

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.

Distributed reservation control protocols for random access broadcasting channels

NASA Technical Reports Server (NTRS)

Greene, E. P.; Ephremides, A.

1981-01-01

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

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

Shi, Xin, E-mail: xinshih86029@gmail.com; Zhao, Xiangmo, E-mail: xinshih86029@gmail.com; Hui, Fei, E-mail: xinshih86029@gmail.com

Clock synchronization in wireless sensor networks (WSNs) has been studied extensively in recent years and many protocols are put forward based on the point of statistical signal processing, which is an effective way to optimize accuracy. However, the accuracy derived from the statistical data can be improved mainly by sufficient packets exchange, which will consume the limited power resources greatly. In this paper, a reliable clock estimation using linear weighted fusion based on pairwise broadcast synchronization is proposed to optimize sync accuracy without expending additional sync packets. As a contribution, a linear weighted fusion scheme for multiple clock deviations ismore » constructed with the collaborative sensing of clock timestamp. And the fusion weight is defined by the covariance of sync errors for different clock deviations. Extensive simulation results show that the proposed approach can achieve better performance in terms of sync overhead and sync accuracy.« less

Real-time dynamics of Auger wave packets and decays in ultrafast charge migration processes

NASA Astrophysics Data System (ADS)

Covito, F.; Perfetto, E.; Rubio, A.; Stefanucci, G.

2018-06-01

The Auger decay is a relevant recombination channel during the first few femtoseconds of molecular targets impinged by attosecond XUV or soft x-ray pulses. Including this mechanism in time-dependent simulations of charge-migration processes is a difficult task, and Auger scatterings are often ignored altogether. In this work we present an advance of the current state-of-the-art by putting forward a real-time approach based on nonequilibrium Green's functions suitable for first-principles calculations of molecules with tens of active electrons. To demonstrate the accuracy of the method we report comparisons against accurate grid simulations of one-dimensional systems. We also predict a highly asymmetric profile of the Auger wave packet, with a long tail exhibiting ripples temporally spaced by the inverse of the Auger energy.

New hybrid reverse differential pulse position width modulation scheme for wireless optical communication

NASA Astrophysics Data System (ADS)

Liao, Renbo; Liu, Hongzhan; Qiao, Yaojun

2014-05-01

In order to improve the power efficiency and reduce the packet error rate of reverse differential pulse position modulation (RDPPM) for wireless optical communication (WOC), a hybrid reverse differential pulse position width modulation (RDPPWM) scheme is proposed, based on RDPPM and reverse pulse width modulation. Subsequently, the symbol structure of RDPPWM is briefly analyzed, and its performance is compared with that of other modulation schemes in terms of average transmitted power, bandwidth requirement, and packet error rate over ideal additive white Gaussian noise (AWGN) channels. Based on the given model, the simulation results show that the proposed modulation scheme has the advantages of improving the power efficiency and reducing the bandwidth requirement. Moreover, in terms of error probability performance, RDPPWM can achieve a much lower packet error rate than that of RDPPM. For example, at the same received signal power of -28 dBm, the packet error rate of RDPPWM can decrease to 2.6×10-12, while that of RDPPM is 2.2×10. Furthermore, RDPPWM does not need symbol synchronization at the receiving end. These considerations make RDPPWM a favorable candidate to select as the modulation scheme in the WOC systems.

Hierarchical trie packet classification algorithm based on expectation-maximization clustering.

PubMed

Bi, Xia-An; Zhao, Junxia

2017-01-01

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch.

PubMed

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-19

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch

PubMed Central

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-01

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture. PMID:26797616

Hybrid ARQ Scheme with Autonomous Retransmission for Multicasting in Wireless Sensor Networks.

PubMed

Jung, Young-Ho; Choi, Jihoon

2017-02-25

A new hybrid automatic repeat request (HARQ) scheme for multicast service for wireless sensor networks is proposed in this study. In the proposed algorithm, the HARQ operation is combined with an autonomous retransmission method that ensure a data packet is transmitted irrespective of whether or not the packet is successfully decoded at the receivers. The optimal number of autonomous retransmissions is determined to ensure maximum spectral efficiency, and a practical method that adjusts the number of autonomous retransmissions for realistic conditions is developed. Simulation results show that the proposed method achieves higher spectral efficiency than existing HARQ techniques.

Interactive Video Coding and Transmission over Heterogeneous Wired-to-Wireless IP Networks Using an Edge Proxy

NASA Astrophysics Data System (ADS)

Pei, Yong; Modestino, James W.

2004-12-01

Digital video delivered over wired-to-wireless networks is expected to suffer quality degradation from both packet loss and bit errors in the payload. In this paper, the quality degradation due to packet loss and bit errors in the payload are quantitatively evaluated and their effects are assessed. We propose the use of a concatenated forward error correction (FEC) coding scheme employing Reed-Solomon (RS) codes and rate-compatible punctured convolutional (RCPC) codes to protect the video data from packet loss and bit errors, respectively. Furthermore, the performance of a joint source-channel coding (JSCC) approach employing this concatenated FEC coding scheme for video transmission is studied. Finally, we describe an improved end-to-end architecture using an edge proxy in a mobile support station to implement differential error protection for the corresponding channel impairments expected on the two networks. Results indicate that with an appropriate JSCC approach and the use of an edge proxy, FEC-based error-control techniques together with passive error-recovery techniques can significantly improve the effective video throughput and lead to acceptable video delivery quality over time-varying heterogeneous wired-to-wireless IP networks.

Studies in integrated line-and packet-switched computer communication systems

NASA Astrophysics Data System (ADS)

Maglaris, B. S.

1980-06-01

The problem of efficiently allocating the bandwidth of a trunk to both types of traffic is handled for various system and traffic models. A performance analysis is carried out both for variable and fixed frame schemes. It is shown that variable frame schemes, adjusting the frame length according to the traffic variations, offer better trunk utilization at the cost of the additional hardware and software complexity needed because of the lack of synchronization. An optimization study on the fixed frame schemes follows. The problem of dynamically allocating the fixed frame to both types of traffic is formulated as a Markovian Decision process. It is shown that the movable boundary scheme, suggested for commercial implementations of integrated multiplexors, offers optimal or near optimal performance and simplicity of implementation. Finally, the behavior of the movable boundary integrated scheme is studied for tandem link connections. Under the assumptions made for the line-switched traffic, the forward allocation technique is found to offer the best alternative among different path set-up strategies.

Identification of speech transients using variable frame rate analysis and wavelet packets.

PubMed

Rasetshwane, Daniel M; Boston, J Robert; Li, Ching-Chung

2006-01-01

Speech transients are important cues for identifying and discriminating speech sounds. Yoo et al. and Tantibundhit et al. were successful in identifying speech transients and, emphasizing them, improving the intelligibility of speech in noise. However, their methods are computationally intensive and unsuitable for real-time applications. This paper presents a method to identify and emphasize speech transients that combines subband decomposition by the wavelet packet transform with variable frame rate (VFR) analysis and unvoiced consonant detection. The VFR analysis is applied to each wavelet packet to define a transitivity function that describes the extent to which the wavelet coefficients of that packet are changing. Unvoiced consonant detection is used to identify unvoiced consonant intervals and the transitivity function is amplified during these intervals. The wavelet coefficients are multiplied by the transitivity function for that packet, amplifying the coefficients localized at times when they are changing and attenuating coefficients at times when they are steady. Inverse transform of the modified wavelet packet coefficients produces a signal corresponding to speech transients similar to the transients identified by Yoo et al. and Tantibundhit et al. A preliminary implementation of the algorithm runs more efficiently.

Destination directed packet switch architecture for a 30/20 GHz FDMA/TDM geostationary communication satellite network

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Shalkhauser, Mary JO

1991-01-01

Emphasis is on a destination directed packet switching architecture for a 30/20 GHz frequency division multiplex access/time division multiplex (FDMA/TDM) geostationary satellite communication network. Critical subsystems and problem areas are identified and addressed. Efforts have concentrated heavily on the space segment; however, the ground segment was considered concurrently to ensure cost efficiency and realistic operational constraints.

Uplink Packet-Data Scheduling in DS-CDMA Systems

NASA Astrophysics Data System (ADS)

Choi, Young Woo; Kim, Seong-Lyun

In this letter, we consider the uplink packet scheduling for non-real-time data users in a DS-CDMA system. As an effort to jointly optimize throughput and fairness, we formulate a time-span minimization problem incorporating the time-multiplexing of different simultaneous transmission schemes. Based on simple rules, we propose efficient scheduling algorithms and compare them with the optimal solution obtained by linear programming.

Destination-directed, packet-switching architecture for 30/20-GHz FDMA/TDM geostationary communications satellite network

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Shalkhauser, Mary JO

1992-01-01

A destination-directed packet switching architecture for a 30/20-GHz frequency division multiple access/time division multiplexed (FDMA/TDM) geostationary satellite communications network is discussed. Critical subsystems and problem areas are identified and addressed. Efforts have concentrated heavily on the space segment; however, the ground segment has been considered concurrently to ensure cost efficiency and realistic operational constraints.

Body frame close coupling wave packet approach to gas phase atom-rigid rotor inelastic collisions

NASA Technical Reports Server (NTRS)

Sun, Y.; Judson, R. S.; Kouri, D. J.

1989-01-01

The close coupling wave packet (CCWP) method is formulated in a body-fixed representation for atom-rigid rotor inelastic scattering. For J greater than j-max (where J is the total angular momentum and j is the rotational quantum number), the computational cost of propagating the coupled channel wave packets in the body frame is shown to scale approximately as N exp 3/2, where N is the total number of channels. For large numbers of channels, this will be much more efficient than the space frame CCWP method previously developed which scales approximately as N-squared under the same conditions.

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.

Hierarchical trie packet classification algorithm based on expectation-maximization clustering

PubMed Central

Bi, Xia-an; Zhao, Junxia

2017-01-01

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm. PMID:28704476

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.

Energy latency tradeoffs for medium access and sleep scheduling in wireless sensor networks

NASA Astrophysics Data System (ADS)

Gang, Lu

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. The central thesis of this work is that energy efficient medium access and sleep scheduling mechanisms can be designed without necessarily sacrificing application-specific latency performance. We validate this thesis through results from four case studies that cover various aspects of medium access and sleep scheduling design in wireless sensor networks. Our first effort, DMAC, is to design an adaptive low latency and energy efficient MAC for data gathering to reduce the sleep latency. We propose staggered schedule, duty cycle adaptation, data prediction and the use of more-to-send packets to enable seamless packet forwarding under varying traffic load and channel contentions. Simulation and experimental results show significant energy savings and latency reduction while ensuring high data reliability. The second research effort, DESS, investigates the problem of designing sleep schedules in arbitrary network communication topologies to minimize the worst case end-to-end latency (referred to as delay diameter). We develop a novel graph-theoretical formulation, derive and analyze optimal solutions for the tree and ring topologies and heuristics for arbitrary topologies. The third study addresses the problem of minimum latency joint scheduling and routing (MLSR). By constructing a novel delay graph, the optimal joint scheduling and routing can be solved by M node-disjoint paths algorithm under multiple channel model. We further extended the algorithm to handle dynamic traffic changes and topology changes. A heuristic solution is proposed for MLSR under single channel interference. In the fourth study, EEJSPC, we first formulate a fundamental optimization problem that provides tunable energy-latency-throughput tradeoffs with joint scheduling and power control and present both exponential and polynomial complexity solutions. Then we investigate the problem of minimizing total transmission energy while satisfying transmission requests within a latency bound, and present an iterative approach which converges rapidly to the optimal parameter settings.

Electronically nonadiabatic wave packet propagation using frozen Gaussian scattering

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

Kondorskiy, Alexey D., E-mail: kondor@sci.lebedev.ru; Nanbu, Shinkoh, E-mail: shinkoh.nanbu@sophia.ac.jp

2015-09-21

We present an approach, which allows to employ the adiabatic wave packet propagation technique and semiclassical theory to treat the nonadiabatic processes by using trajectory hopping. The approach developed generates a bunch of hopping trajectories and gives all additional information to incorporate the effect of nonadiabatic coupling into the wave packet dynamics. This provides an interface between a general adiabatic frozen Gaussian wave packet propagation method and the trajectory surface hopping technique. The basic idea suggested in [A. D. Kondorskiy and H. Nakamura, J. Chem. Phys. 120, 8937 (2004)] is revisited and complemented in the present work by the elaborationmore » of efficient numerical algorithms. We combine our approach with the adiabatic Herman-Kluk frozen Gaussian approximation. The efficiency and accuracy of the resulting method is demonstrated by applying it to popular benchmark model systems including three Tully’s models and 24D model of pyrazine. It is shown that photoabsorption spectrum is successfully reproduced by using a few hundreds of trajectories. We employ the compact finite difference Hessian update scheme to consider feasibility of the ab initio “on-the-fly” simulations. It is found that this technique allows us to obtain the reliable final results using several Hessian matrix calculations per trajectory.« less

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

USGS Publications Warehouse

Song, W.-Z.; Yuan, F.; LaHuser, R.

2007-01-01

This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs max(2N(u1) - 1, N(u 0) -1) time slots, assuming each node reports one unit of data in each round. Here N(u0) is the total number of sensors, while N(u 1) denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also eliminated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle. ??2006 IEEE.

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

USGS Publications Warehouse

Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

2007-01-01

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

Analysing efficiency of IPv6 packet transmission over 6LoWPAN network

NASA Astrophysics Data System (ADS)

Kozłowski, Adam; Sosnowski, Janusz

2017-08-01

Practical proliferation of Internet of Things (IoT) concept depends upon communication efficiency in the related network. In the paper we outline basic features of wireless communication protocols used in IoT and concentrate on analysing communication overheads. In particular, we discuss the impact of IPv6 packet length on 6LoWPAN network operation with physical and MAC layer defined by IEEE 802.15.4 standard. The presented analysis methodology is useful in estimation of the total goodput (throughput at the application level) and energy consumptions within the whole traffic model which are the crucial features of IoT networks.

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.

pathChirp: Efficient Available Bandwidth Estimation for Network Paths

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

Cottrell, Les

2003-04-30

This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of ''self-induced congestion,'' pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several significant advantages over current probing schemes based on packet pairs or packet trains. By rapidly increasing the probing rate within each chirp, pathChirp obtains a rich set of information from which to dynamically estimate the available bandwidth. Since it uses only packet interarrival times for estimation, pathChirp does not require synchronous nor highly stable clocks at the sendermore » and receiver. We test pathChirp with simulations and Internet experiments and find that it provides good estimates of the available bandwidth while using only a fraction of the number of probe bytes that current state-of-the-art techniques use.« less

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

NASA Astrophysics Data System (ADS)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

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.

Lossless Compression of Data into Fixed-Length Packets

NASA Technical Reports Server (NTRS)

Kiely, Aaron B.; Klimesh, Matthew A.

2009-01-01

A computer program effects lossless compression of data samples from a one-dimensional source into fixed-length data packets. The software makes use of adaptive prediction: it exploits the data structure in such a way as to increase the efficiency of compression beyond that otherwise achievable. Adaptive linear filtering is used to predict each sample value based on past sample values. The difference between predicted and actual sample values is encoded using a Golomb code.

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.

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.

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.

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.

Diagnostic grade wireless ECG monitoring.

PubMed

Garudadri, Harinath; Chi, Yuejie; Baker, Steve; Majumdar, Somdeb; Baheti, Pawan K; Ballard, Dan

2011-01-01

In remote monitoring of Electrocardiogram (ECG), it is very important to ensure that the diagnostic integrity of signals is not compromised by sensing artifacts and channel errors. It is also important for the sensors to be extremely power efficient to enable wearable form factors and long battery life. We present an application of Compressive Sensing (CS) as an error mitigation scheme at the application layer for wearable, wireless sensors in diagnostic grade remote monitoring of ECG. In our previous work, we described an approach to mitigate errors due to packet losses by projecting ECG data to a random space and recovering a faithful representation using sparse reconstruction methods. Our contributions in this work are twofold. First, we present an efficient hardware implementation of random projection at the sensor. Second, we validate the diagnostic integrity of the reconstructed ECG after packet loss mitigation. We validate our approach on MIT and AHA databases comprising more than 250,000 normal and abnormal beats using EC57 protocols adopted by the Food and Drug Administration (FDA). We show that sensitivity and positive predictivity of a state-of-the-art ECG arrhythmia classifier is essentially invariant under CS based packet loss mitigation for both normal and abnormal beats even at high packet loss rates. In contrast, the performance degrades significantly in the absence of any error mitigation scheme, particularly for abnormal beats such as Ventricular Ectopic Beats (VEB).

Energy-Efficient Data Collection Method for Sensor Networks by Integrating Asymmetric Communication and Wake-Up Radio

PubMed Central

Iwata, Masanari; Tang, Suhua; Obana, Sadao

2018-01-01

In large-scale wireless sensor networks (WSNs), nodes close to sink nodes consume energy more quickly than other nodes due to packet forwarding. A mobile sink is a good solution to this issue, although it causes two new problems to nodes: (i) overhead of updating routing information; and (ii) increased operating time due to aperiodic query. To solve these problems, this paper proposes an energy-efficient data collection method, Sink-based Centralized transmission Scheduling (SC-Sched), by integrating asymmetric communication and wake-up radio. Specifically, each node is equipped with a low-power wake-up receiver. The sink node determines transmission scheduling, and transmits a wake-up message using a large transmission power, directly activating a pair of nodes simultaneously which will communicate with a normal transmission power. This paper further investigates how to deal with frame loss caused by fading and how to mitigate the impact of the wake-up latency of communication modules. Simulation evaluations confirm that using multiple channels effectively reduces data collection time and SC-Sched works well with a mobile sink. Compared with the conventional duty-cycling method, SC-Sched greatly reduces total energy consumption and improves the network lifetime by 7.47 times in a WSN with 4 data collection points and 300 sensor nodes. PMID:29642397

Packetized Video On MAGNET

NASA Astrophysics Data System (ADS)

Lazar, Aurel A.; White, John S.

1987-07-01

Theoretical analysis of integrated local area network model of MAGNET, an integrated network testbed developed at Columbia University, shows that the bandwidth freed up during video and voice calls during periods of little movement in the images and periods of silence in the speech signals could be utilized efficiently for graphics and data transmission. Based on these investigations, an architecture supporting adaptive protocols that are dynamicaly controlled by the requirements of a fluctuating load and changing user environment has been advanced. To further analyze the behavior of the network, a real-time packetized video system has been implemented. This system is embedded in the real-time multimedia workstation EDDY, which integrates video, voice, and data traffic flows. Protocols supporting variable-bandwidth, fixed-quality packetized video transport are described in detail.

Packetized video on MAGNET

NASA Astrophysics Data System (ADS)

Lazar, Aurel A.; White, John S.

1986-11-01

Theoretical analysis of an ILAN model of MAGNET, an integrated network testbed developed at Columbia University, shows that the bandwidth freed up by video and voice calls during periods of little movement in the images and silence periods in the speech signals could be utilized efficiently for graphics and data transmission. Based on these investigations, an architecture supporting adaptive protocols that are dynamically controlled by the requirements of a fluctuating load and changing user environment has been advanced. To further analyze the behavior of the network, a real-time packetized video system has been implemented. This system is embedded in the real time multimedia workstation EDDY that integrates video, voice and data traffic flows. Protocols supporting variable bandwidth, constant quality packetized video transport are descibed in detail.

Predictive onboard flow control for packet switching satellites

NASA Technical Reports Server (NTRS)

Bobinsky, Eric A.

1992-01-01

We outline two alternate approaches to predicting the onset of congestion in a packet switching satellite, and argue that predictive, rather than reactive, flow control is necessary for the efficient operation of such a system. The first method discussed is based on standard, statistical techniques which are used to periodically calculate a probability of near-term congestion based on arrival rate statistics. If this probability exceeds a present threshold, the satellite would transmit a rate-reduction signal to all active ground stations. The second method discussed would utilize a neural network to periodically predict the occurrence of buffer overflow based on input data which would include, in addition to arrival rates, the distributions of packet lengths, source addresses, and destination addresses.

Internet traffic load balancing using dynamic hashing with flow volume

NASA Astrophysics Data System (ADS)

Jo, Ju-Yeon; Kim, Yoohwan; Chao, H. Jonathan; Merat, Francis L.

2002-07-01

Sending IP packets over multiple parallel links is in extensive use in today's Internet and its use is growing due to its scalability, reliability and cost-effectiveness. To maximize the efficiency of parallel links, load balancing is necessary among the links, but it may cause the problem of packet reordering. Since packet reordering impairs TCP performance, it is important to reduce the amount of reordering. Hashing offers a simple solution to keep the packet order by sending a flow over a unique link, but static hashing does not guarantee an even distribution of the traffic amount among the links, which could lead to packet loss under heavy load. Dynamic hashing offers some degree of load balancing but suffers from load fluctuations and excessive packet reordering. To overcome these shortcomings, we have enhanced the dynamic hashing algorithm to utilize the flow volume information in order to reassign only the appropriate flows. This new method, called dynamic hashing with flow volume (DHFV), eliminates unnecessary flow reassignments of small flows and achieves load balancing very quickly without load fluctuation by accurately predicting the amount of transferred load between the links. In this paper we provide the general framework of DHFV and address the challenges in implementing DHFV. We then introduce two algorithms of DHFV with different flow selection strategies and show their performances through simulation.

A Multi-Agent Framework for Packet Routing in Wireless Sensor Networks

PubMed Central

Ye, Dayon; Zhang, Minji; Yang, Yu

2015-01-01

Wireless sensor networks (WSNs) have been widely investigated in recent years. One of the fundamental issues in WSNs is packet routing, because in many application domains, packets have to be routed from source nodes to destination nodes as soon and as energy efficiently as possible. To address this issue, a large number of routing approaches have been proposed. Although every existing routing approach has advantages, they also have some disadvantages. In this paper, a multi-agent framework is proposed that can assist existing routing approaches to improve their routing performance. This framework enables each sensor node to build a cooperative neighbour set based on past routing experience. Such cooperative neighbours, in turn, can help the sensor to effectively relay packets in the future. This framework is independent of existing routing approaches and can be used to assist many existing routing approaches. Simulation results demonstrate the good performance of this framework in terms of four metrics: average delivery latency, successful delivery ratio, number of live nodes and total sensing coverage. PMID:25928063

Design and application of discrete wavelet packet transform based multiresolution controller for liquid level system.

PubMed

Paul, Rimi; Sengupta, Anindita

2017-11-01

A new controller based on discrete wavelet packet transform (DWPT) for liquid level system (LLS) has been presented here. This controller generates control signal using node coefficients of the error signal which interprets many implicit phenomena such as process dynamics, measurement noise and effect of external disturbances. Through simulation results on LLS problem, this controller is shown to perform faster than both the discrete wavelet transform based controller and conventional proportional integral controller. Also, it is more efficient in terms of its ability to provide better noise rejection. To overcome the wind up phenomenon by considering the saturation due to presence of actuator, anti-wind up technique is applied to the conventional PI controller and compared to the wavelet packet transform based controller. In this case also, packet controller is found better than the other ones. This similar work has been extended for analogous first order RC plant as well as second order plant also. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Fast simulation of packet loss rates in a shared buffer communications switch

NASA Technical Reports Server (NTRS)

Chang, Cheng-Shang; Heidelberger, Philip; Shahabuddin, Perwez

1993-01-01

This paper describes an efficient technique for estimating, via simulation, the probability of buffer overflows in a queueing model that arises in the analysis of ATM (Asynchronous Transfer Mode) communication switches. There are multiple streams of (autocorrelated) traffic feeding the switch that has a buffer of finite capacity. Each stream is designated as either being of high or low priority. When the queue length reaches a certain threshold, only high priority packets are admitted to the switch's buffer. The problem is to estimate the loss rate of high priority packets. An asymptotically optimal importance sampling approach is developed for this rare event simulation problem. In this approach, the importance sampling is done in two distinct phases. In the first phase, an importance sampling change of measure is used to bring the queue length up to the threshold at which low priority packets get rejected. In the second phase, a different importance sampling change of measure is used to move the queue length from the threshold to the buffer capacity.

Destination-directed, packet-switched architecture for a geostationary communications satellite network

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Shalkhauser, Mary JO; Bobinsky, Eric A.; Soni, Nitin J.; Quintana, Jorge A.; Kim, Heechul; Wager, Paul; Vanderaar, Mark

1993-01-01

A major goal of the Digital Systems Technology Branch at the NASA Lewis Research Center is to identify and develop critical digital components and technologies that either enable new commercial missions or significantly enhance the performance, cost efficiency, and/or reliability of existing and planned space communications systems. NASA envisions a need for low-data-rate, interactive, direct-to-the-user communications services for data, voice, facsimile, and video conferencing. The network would provide enhanced very-small-aperture terminal (VSAT) communications services and be capable of handling data rates of 64 kbps through 2.048 Mbps in 64-kbps increments. Efforts have concentrated heavily on the space segment; however, the ground segment has been considered concurrently to ensure cost efficiency and realistic operational constraints. The focus of current space segment developments is a flexible, high-throughput, fault-tolerant onboard information-switching processor (ISP) for a geostationary satellite communications network. The Digital Systems Technology Branch is investigating both circuit and packet architectures for the ISP. Destination-directed, packet-switched architectures for geostationary communications satellites are addressed.

Error mitigation for CCSD compressed imager data

NASA Astrophysics Data System (ADS)

Gladkova, Irina; Grossberg, Michael; Gottipati, Srikanth; Shahriar, Fazlul; Bonev, George

2009-08-01

To efficiently use the limited bandwidth available on the downlink from satellite to ground station, imager data is usually compressed before transmission. Transmission introduces unavoidable errors, which are only partially removed by forward error correction and packetization. In the case of the commonly used CCSD Rice-based compression, it results in a contiguous sequence of dummy values along scan lines in a band of the imager data. We have developed a method capable of using the image statistics to provide a principled estimate of the missing data. Our method outperforms interpolation yet can be performed fast enough to provide uninterrupted data flow. The estimation of the lost data provides significant value to end users who may use only part of the data, may not have statistical tools, or lack the expertise to mitigate the impact of the lost data. Since the locations of the lost data will be clearly marked as meta-data in the HDF or NetCDF header, experts who prefer to handle error mitigation themselves will be free to use or ignore our estimates as they see fit.

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.

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.

Data Randomization and Cluster-Based Partitioning for Botnet Intrusion Detection.

PubMed

Al-Jarrah, Omar Y; Alhussein, Omar; Yoo, Paul D; Muhaidat, Sami; Taha, Kamal; Kim, Kwangjo

2016-08-01

Botnets, which consist of remotely controlled compromised machines called bots, provide a distributed platform for several threats against cyber world entities and enterprises. Intrusion detection system (IDS) provides an efficient countermeasure against botnets. It continually monitors and analyzes network traffic for potential vulnerabilities and possible existence of active attacks. A payload-inspection-based IDS (PI-IDS) identifies active intrusion attempts by inspecting transmission control protocol and user datagram protocol packet's payload and comparing it with previously seen attacks signatures. However, the PI-IDS abilities to detect intrusions might be incapacitated by packet encryption. Traffic-based IDS (T-IDS) alleviates the shortcomings of PI-IDS, as it does not inspect packet payload; however, it analyzes packet header to identify intrusions. As the network's traffic grows rapidly, not only the detection-rate is critical, but also the efficiency and the scalability of IDS become more significant. In this paper, we propose a state-of-the-art T-IDS built on a novel randomized data partitioned learning model (RDPLM), relying on a compact network feature set and feature selection techniques, simplified subspacing and a multiple randomized meta-learning technique. The proposed model has achieved 99.984% accuracy and 21.38 s training time on a well-known benchmark botnet dataset. Experiment results demonstrate that the proposed methodology outperforms other well-known machine-learning models used in the same detection task, namely, sequential minimal optimization, deep neural network, C4.5, reduced error pruning tree, and randomTree.

SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks

NASA Astrophysics Data System (ADS)

Hung, Lexuan; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo

For many sensor network applications such as military, homeland security, it is necessary for users (sinks) to access sensor networks while they are moving. However, sink mobility brings new challenges to secure routing in large-scale sensor networks. Mobile sinks have to constantly propagate their current location to all nodes, and these nodes need to exchange messages with each other so that the sensor network can establish and maintain a secure multi-hop path between a source node and a mobile sink. This causes significant computation and communication overhead for sensor nodes. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. In this paper, we propose a secure and energy-efficient data dissemination protocol — Secure COodination-based Data dissEmination (SCODE) — for mobile sinks in sensor networks. We take advantages of coordination networks (grid structure) based on Geographical Adaptive Fidelity (GAF) protocol to construct a secure and efficient routing path between sources and sinks. Our security analysis demonstrates that the proposed protocol can defend against common attacks in sensor network routing such as replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Our performance evaluation both in mathematical analysis and simulation shows that the SCODE significantly reduces communication overhead and energy consumption while the latency is similar compared with the existing routing protocols, and it always delivers more than 90 percentage of packets successfully.

Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

PubMed

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A; Al-Muhtadi, Jalal; Rodrigues, Joel J P C; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-03-31

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

PubMed Central

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A.; Al-Muhtadi, Jalal; Rodrigues, Joel J. P. C.; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-01-01

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks. PMID:27043572

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.

A feasibility study of stateful automaton packet inspection for streaming application detection systems

NASA Astrophysics Data System (ADS)

Tseng, Kuo-Kun; Lo, Jiao; Liu, Yiming; Chang, Shih-Hao; Merabti, Madjid; Ng, Felix, C. K.; Wu, C. H.

2017-10-01

The rapid development of the internet has brought huge benefits and social impacts; however, internet security has also become a great problem for users, since traditional approaches to packet classification cannot achieve satisfactory detection performance due to their low accuracy and efficiency. In this paper, a new stateful packet inspection method is introduced, which can be embedded in the network gateway and used by a streaming application detection system. This new detection method leverages the inexact automaton approach, using part of the header field and part of the application layer data of a packet. Based on this approach, an advanced detection system is proposed for streaming applications. The workflow of the system involves two stages: the training stage and the detection stage. In the training stage, the system initially captures characteristic patterns from a set of application packet flows. After this training is completed, the detection stage allows the user to detect the target application by capturing new application flows. This new detection approach is also evaluated using experimental analysis; the results of this analysis show that this new approach not only simplifies the management of the state detection system, but also improves the accuracy of data flow detection, making it feasible for real-world network applications.

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.

Quality of experience enhancement of high efficiency video coding video streaming in wireless packet networks using multiple description coding

NASA Astrophysics Data System (ADS)

Boumehrez, Farouk; Brai, Radhia; Doghmane, Noureddine; Mansouri, Khaled

2018-01-01

Recently, video streaming has attracted much attention and interest due to its capability to process and transmit large data. We propose a quality of experience (QoE) model relying on high efficiency video coding (HEVC) encoder adaptation scheme, in turn based on the multiple description coding (MDC) for video streaming. The main contributions of the paper are (1) a performance evaluation of the new and emerging video coding standard HEVC/H.265, which is based on the variation of quantization parameter (QP) values depending on different video contents to deduce their influence on the sequence to be transmitted, (2) QoE support multimedia applications in wireless networks are investigated, so we inspect the packet loss impact on the QoE of transmitted video sequences, (3) HEVC encoder parameter adaptation scheme based on MDC is modeled with the encoder parameter and objective QoE model. A comparative study revealed that the proposed MDC approach is effective for improving the transmission with a peak signal-to-noise ratio (PSNR) gain of about 2 to 3 dB. Results show that a good choice of QP value can compensate for transmission channel effects and improve received video quality, although HEVC/H.265 is also sensitive to packet loss. The obtained results show the efficiency of our proposed method in terms of PSNR and mean-opinion-score.

Enhancing In-Flight Transoceanic Communications Using Swift-64 Packet Mode Service

NASA Technical Reports Server (NTRS)

Slywczak, Richard A.

2004-01-01

Current aeronautical communications can be divided into two segments. The first provides state of the art, packet switched technology to the cabin passengers so that they have access to e-mail and web services. The second provides basic circuit switch communication technology to the cockpit, which does not use bandwidth as efficiently as packet switching nor promotes resource sharing. This paper explores the research efforts currently being conducted by the NASA/Glenn Research Center (GRC) for transoceanic communications. The goal is to bring packet mode services to both the cabin and the cockpit of the aircraft and be able to attain benefits by sharing the data link with cabin services. First, this paper will outline the goals of the program and detail the benefits and issues related to this research. We will explain our current laboratory setup and show an architecture implemented in the testbed. Finally, we will present a work plan that will show the progression of research over the next year. This plan will describe a complete cycle from conceptual design and laboratory implementation to the final flight testing.

Numerical and experimental study of a high port-density WDM optical packet switch architecture for data centers.

PubMed

Di Lucente, S; Luo, J; Centelles, R Pueyo; Rohit, A; Zou, S; Williams, K A; Dorren, H J S; Calabretta, N

2013-01-14

Data centers have to sustain the rapid growth of data traffic due to the increasing demand of bandwidth-hungry internet services. The current intra-data center fat tree topology causes communication bottlenecks in the server interaction process, power-hungry O-E-O conversions that limit the minimum latency and the power efficiency of these systems. In this paper we numerically and experimentally investigate an optical packet switch architecture with modular structure and highly distributed control that allow configuration times in the order of nanoseconds. Numerical results indicate that the candidate architecture scaled over 4000 ports, provides an overall throughput over 50 Tb/s and a packet loss rate below 10(-6) while assuring sub-microsecond latency. We present experimental results that demonstrate the feasibility of a 16x16 optical packet switch based on parallel 1x4 integrated optical cross-connect modules. Error-free operations can be achieved with 4 dB penalty while the overall energy consumption is of 66 pJ/b. Based on those results, we discuss feasibility to scale the architecture to a much larger port count.

Energy and Information Transfer Via Coherent Exciton Wave Packets

NASA Astrophysics Data System (ADS)

Zang, Xiaoning

Electronic excitons are bound electron-hole states that are generated when light interacts with matter. Such excitations typically entangle with phonons and rapidly decohere; the resulting electronic state dynamics become diffusive as a result. However, if the exciton-phonon coupling can be reduced, it may be possible to construct excitonic wave packets that offer a means of efficiently transmitting information and energy. This thesis is a combined theory/computation investigation to design condensed matter systems which support the requisite coherent transport. Under the idealizing assumption that exciton-phonon entanglement could be completely suppressed, the majority of this thesis focuses on the creation and manipulation of exciton wave packets in quasi-one-dimensional systems. While each site could be a silicon quantum dot, the actual implementation focused on organic molecular assemblies for the sake of computational simplicity, ease of experimental implementation, potential for coherent transport, and promise because of reduced structural uncertainty. A laser design was derived to create exciton wave packets with tunable shape and speed. Quantum interference was then exploited to manipulate these packets to block, pass, and even dissociate excitons based on their energies. These developments allow exciton packets to be considered within the arena of quantum information science. The concept of controllable excitonic wave packets was subsequently extended to consider molecular designs that allow photons with orbital angular momentum to be absorbed to create excitons with a quasi-angular momentum of their own. It was shown that a well-defined measure of topological charge is conserved in such light-matter interactions. Significantly, it was also discovered that such molecules allow photon angular momenta to be combined and later emitted. This amounts to a new way of up/down converting photonic angular momentum without relying on nonlinear optical materials. The associated excitations were dubbed twisted excitons. Twisted exciton packets can be manipulated as they travel down molecular chains, and this has applications in quantum information science as well. In each setting considered, exciton dynamics were initially studied using a simple tight-binding formalism. This misses the actual many-body interactions and multiple energy levels associated real systems. To remedy this, I adapted an existing time-domain Density Functional Theory code and applied it to study the dynamics of exciton wave packets on quasi-one-dimensional systems. This required the use of high-performance computing and the construction of a number of key auxiliary codes. Establishing the requisite methodology constituted a substantial part of the entire thesis. Surprisingly, this effort uncovered a computational issue associated with Rabi oscillations that had been incorrectly characterized in the literature. My research elucidated the actual problem and a solution was found. This new methodology was an integral part of the overall computational analysis. The thesis then takes up the a detailed consideration of the prospect for creating systems that support a strong measure of transport coherence. While physical implementations include molecular assemblies, solid-state superlattices, and even optical lattices, I decided to focus on assemblies of nanometer-sized silicon quantum dots. First principles computational analysis was used to quantify reorganization within individual dots and excitonic coupling between dots. Quantum dot functionalizations were identified that make it plausible to maintain a measure of excitonic coherence even at room temperatures. Attention was then turned to the use of covalently bonded bridge material to join quantum dots in a way that facilitates efficient exciton transfer. Both carbon and silicon structures were considered by considering the way in which subunits might be best brought together. This resulted in a set of design criteria which were then evaluated using first-principles, excited state analyses. It was found that efficient exciton transfer is indeed possible. When coupled to the previous quantum dot functionalizations, the notion that quantum dot materials could support partially coherent exciton wave packets was determined to be quite reasonable.

Improved routing strategy based on gravitational field theory

NASA Astrophysics Data System (ADS)

Song, Hai-Quan; Guo, Jin

2015-10-01

Routing and path selection are crucial for many communication and logistic applications. We study the interaction between nodes and packets and establish a simple model for describing the attraction of the node to the packet in transmission process by using the gravitational field theory, considering the real and potential congestion of the nodes. On the basis of this model, we propose a gravitational field routing strategy that considers the attractions of all of the nodes on the travel path to the packet. In order to illustrate the efficiency of proposed routing algorithm, we introduce the order parameter to measure the throughput of the network by the critical value of phase transition from a free flow phase to a congested phase, and study the distribution of betweenness centrality and traffic jam. Simulations show that, compared with the shortest path routing strategy, the gravitational field routing strategy considerably enhances the throughput of the network and balances the traffic load, and nearly all of the nodes are used efficiently. Project supported by the Technology and Development Research Project of China Railway Corporation (Grant No. 2012X007-D) and the Key Program of Technology and Development Research Foundation of China Railway Corporation (Grant No. 2012X003-A).

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.

Optimal Codes for the Burst Erasure Channel

NASA Technical Reports Server (NTRS)

Hamkins, Jon

2010-01-01

Deep space communications over noisy channels lead to certain packets that are not decodable. These packets leave gaps, or bursts of erasures, in the data stream. Burst erasure correcting codes overcome this problem. These are forward erasure correcting codes that allow one to recover the missing gaps of data. Much of the recent work on this topic concentrated on Low-Density Parity-Check (LDPC) codes. These are more complicated to encode and decode than Single Parity Check (SPC) codes or Reed-Solomon (RS) codes, and so far have not been able to achieve the theoretical limit for burst erasure protection. A block interleaved maximum distance separable (MDS) code (e.g., an SPC or RS code) offers near-optimal burst erasure protection, in the sense that no other scheme of equal total transmission length and code rate could improve the guaranteed correctible burst erasure length by more than one symbol. The optimality does not depend on the length of the code, i.e., a short MDS code block interleaved to a given length would perform as well as a longer MDS code interleaved to the same overall length. As a result, this approach offers lower decoding complexity with better burst erasure protection compared to other recent designs for the burst erasure channel (e.g., LDPC codes). A limitation of the design is its lack of robustness to channels that have impairments other than burst erasures (e.g., additive white Gaussian noise), making its application best suited for correcting data erasures in layers above the physical layer. The efficiency of a burst erasure code is the length of its burst erasure correction capability divided by the theoretical upper limit on this length. The inefficiency is one minus the efficiency. The illustration compares the inefficiency of interleaved RS codes to Quasi-Cyclic (QC) LDPC codes, Euclidean Geometry (EG) LDPC codes, extended Irregular Repeat Accumulate (eIRA) codes, array codes, and random LDPC codes previously proposed for burst erasure protection. As can be seen, the simple interleaved RS codes have substantially lower inefficiency over a wide range of transmission lengths.

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.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

An energy-efficient communication method based on the relationships between biological signals for ubiquitous health monitoring.

PubMed

Kwon, Hyok Chon; Na, Doosu; Ko, Byung Geun; Lee, Songjun

2008-01-01

Wireless sensor networks have been studied in the area of intelligent transportation systems, disaster perception, environment monitoring, ubiquitous healthcare, home network, and so on. For the ubiquitous healthcare, the previous systems collect the sensed health related data at portable devices without regard to correlations of various biological signals to determine the health conditions. It is not the energy-efficient method to gather a lot of information into a specific node to decide the health condition. Since the biological signals are related with each other to estimate certain body condition, it is necessary to be collected selectively by their relationship for energy efficiency of the networked nodes. One of researches about low power consumption is the reduction of the amount of packet transmission. In this paper, a health monitoring system, which allows the transmission of the reduced number of packets by means of setting the routing path considered the relations of biological signals, is proposed.

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

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks.

PubMed

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-10-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime.

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks

PubMed Central

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-01-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime. PMID:27706079

Schemes for efficient transmission of encoded video streams on high-speed networks

NASA Astrophysics Data System (ADS)

Ramanathan, Srinivas; Vin, Harrick M.; Rangan, P. Venkat

1994-04-01

In this paper, we argue that significant performance benefits can accrue if integrated networks implement application-specific mechanisms that account for the diversities in media compression schemes. Towards this end, we propose a simple, yet effective, strategy called Frame Induced Packet Discarding (FIPD), in which, upon detection of loss of a threshold number (determined by an application's video encoding scheme) of packets belonging to a video frame, the network attempts to discard all the remaining packets of that frame. In order to analytically quantify the performance of FIPD so as to obtain fractional frame losses that can be guaranteed to video channels, we develop a finite state, discrete time markov chain model of the FIPD strategy. The fractional frame loss thus computed can serve as the criterion for admission control at the network. Performance evaluations demonstrate the utility of the FIPD strategy.

Software-defined networking control plane for seamless integration of multiple silicon photonic switches in Datacom networks.

PubMed

Shen, Yiwen; Hattink, Maarten H N; Samadi, Payman; Cheng, Qixiang; Hu, Ziyiz; Gazman, Alexander; Bergman, Keren

2018-04-16

Silicon photonics based switches offer an effective option for the delivery of dynamic bandwidth for future large-scale Datacom systems while maintaining scalable energy efficiency. The integration of a silicon photonics-based optical switching fabric within electronic Datacom architectures requires novel network topologies and arbitration strategies to effectively manage the active elements in the network. We present a scalable software-defined networking control plane to integrate silicon photonic based switches with conventional Ethernet or InfiniBand networks. Our software-defined control plane manages both electronic packet switches and multiple silicon photonic switches for simultaneous packet and circuit switching. We built an experimental Dragonfly network testbed with 16 electronic packet switches and 2 silicon photonic switches to evaluate our control plane. Observed latencies occupied by each step of the switching procedure demonstrate a total of 344 µs control plane latency for data-center and high performance computing platforms.

History-based route selection for reactive ad hoc routing protocols

NASA Astrophysics Data System (ADS)

Medidi, Sirisha; Cappetto, Peter

2007-04-01

Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

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.

A novel rail defect detection method based on undecimated lifting wavelet packet transform and Shannon entropy-improved adaptive line enhancer

NASA Astrophysics Data System (ADS)

Hao, Qiushi; Zhang, Xin; Wang, Yan; Shen, Yi; Makis, Viliam

2018-07-01

Acoustic emission (AE) technology is sensitive to subliminal rail defects, however strong wheel-rail contact rolling noise under high-speed condition has gravely impeded detecting of rail defects using traditional denoising methods. In this context, the paper develops an adaptive detection method for rail cracks, which combines multiresolution analysis with an improved adaptive line enhancer (ALE). To obtain elaborate multiresolution information of transient crack signals with low computational cost, lifting scheme-based undecimated wavelet packet transform is adopted. In order to feature the impulsive property of crack signals, a Shannon entropy-improved ALE is proposed as a signal enhancing approach, where Shannon entropy is introduced to improve the cost function. Then a rail defect detection plan based on the proposed method for high-speed condition is put forward. From theoretical analysis and experimental verification, it is demonstrated that the proposed method has superior performance in enhancing the rail defect AE signal and reducing the strong background noise, offering an effective multiresolution approach for rail defect detection under high-speed and strong-noise condition.

Compression of real time volumetric echocardiographic data using modified SPIHT based on the three-dimensional wavelet packet transform.

PubMed

Hang, X; Greenberg, N L; Shiota, T; Firstenberg, M S; Thomas, J D

2000-01-01

Real-time three-dimensional echocardiography has been introduced to provide improved quantification and description of cardiac function. Data compression is desired to allow efficient storage and improve data transmission. Previous work has suggested improved results utilizing wavelet transforms in the compression of medical data including 2D echocardiogram. Set partitioning in hierarchical trees (SPIHT) was extended to compress volumetric echocardiographic data by modifying the algorithm based on the three-dimensional wavelet packet transform. A compression ratio of at least 40:1 resulted in preserved image quality.

Time-reversal-symmetric single-photon wave packets for free-space quantum communication.

PubMed

Trautmann, N; Alber, G; Agarwal, G S; Leuchs, G

2015-05-01

Readout and retrieval processes are proposed for efficient, high-fidelity quantum state transfer between a matter qubit, encoded in the level structure of a single atom or ion, and a photonic qubit, encoded in a time-reversal-symmetric single-photon wave packet. They are based on controlling spontaneous photon emission and absorption of a matter qubit on demand in free space by stimulated Raman adiabatic passage. As these processes do not involve mode selection by high-finesse cavities or photon transport through optical fibers, they offer interesting perspectives as basic building blocks for free-space quantum-communication protocols.

Resonant tunneling of spin-wave packets via quantized states in potential wells.

PubMed

Hansen, Ulf-Hendrik; Gatzen, Marius; Demidov, Vladislav E; Demokritov, Sergej O

2007-09-21

We have studied the tunneling of spin-wave pulses through a system of two closely situated potential barriers. The barriers represent two areas of inhomogeneity of the static magnetic field, where the existence of spin waves is forbidden. We show that for certain values of the spin-wave frequency corresponding to the quantized spin-wave states existing in the well formed between the barriers, the tunneling has a resonant character. As a result, transmission of spin-wave packets through the double-barrier structure is much more efficient than the sequent tunneling through two single barriers.

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

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

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

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

PubMed Central

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

2016-01-01

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

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

PubMed

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

2016-10-14

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

Packet Capture Solutions: PcapDB Benchmark for High-Bandwidth Capture, Storage, and Searching

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

Steinfadt, Shannon Irene; Ferrell, Paul Steven

PcapDB stands alone when looking at the overall field of competitors, from the cost-effective COTS hardware, to the efficient utilization of disk space that enables a longer packet history. A scalable, 100GbE-enabled system that indexes every packet and indexes flow data without complicated load-balancing requirements. The Transport Layer search and indexing approach led to patent-pending flow indexing technology, providing a specialized database system specifically optimized around providing fast flow searches. While there are a plethora of options in network packet capture, there are very few that are able to effectively manage capture rates of more than 10 Gb/s, distributed capturemore » and querying, and a responsive user interface. By far, the primary competitor in the market place is Endace and DeepSee; in addition to meeting the technical requirements we set out in this document, they provide technical support and a fully 'appliance like' system. In terms of cost, however, our experience has been that the yearly maintenance charges alone outstrip the entire hardware cost of solutions like PcapDB. Investment in cyber security research and development is a large part of what has enabled us to build the base of knowlegable workers needed to defend government resources in the rapidly evolving cyber security landscape. We believe projects like Bro, WireCap, and Farm do more than just fill temporary gaps in our capabilities. They give allow us to build the firm foundation needed to tackle the next generation of cyber challenges. PcapDB was built with loftier ambitions than simply solving the packet capture of a single lab site, but instead to provide a robust, scaleable packet capture solution to the DOE complex and beyond.« less

IDMA: improving the defense against malicious attack for mobile ad hoc networks based on ARIP protocol

NASA Astrophysics Data System (ADS)

Peng, Chaorong; Chen, Chang Wen

2008-04-01

Malicious nodes are mounting increasingly sophisticated attacking operations on the Mobile Ad Hoc Networks (MANETs). This is mainly because the IP-based MANETs are vulnerable to attacks by various malicious nodes. However, the defense against malicious attack can be improved when a new layer of network architecture can be developed to separate true IP address from disclosing to the malicious nodes. In this paper, we propose a new algorithm to improve the defense against malicious attack (IDMA) that is based on a recently developed Assignment Router Identify Protocol (ARIP) for the clustering-based MANET management. In the ARIP protocol, we design the ARIP architecture based on the new Identity instead of the vulnerable IP addresses to provide the required security that is embedded seamlessly into the overall network architecture. We make full use of ARIP's special property to monitor gateway forward packets by Reply Request Route Packets (RREP) without additional intrusion detection layer. We name this new algorithm IDMA because of its inherent capability to improve the defense against malicious attacks. Through IDMA, a watching algorithm can be established so as to counterattack the malicious node in the routing path when it unusually drops up packets. We provide analysis examples for IDMA for the defense against a malicious node that disrupts the route discovery by impersonating the destination, or by responding with state of corrupted routing information, or by disseminating forged control traffic. The IDMA algorithm is able to counterattack the malicious node in the cases when the node lunch DoS attack by broadcast a large number of route requests, or make Target traffic congestion by delivering huge mount of data; or spoof the IP addresses and send forge packets with a fake ID to the same Target causing traffic congestion at that destination. We have implemented IDMA algorism using the GloMoSim simulator and have demonstrated its performance under a variety of operational conditions.

Vibrational and rotational excitation effects of the N(2D) + D2(X1Σg +) → ND(X3Σ+) + D(2S) reaction

NASA Astrophysics Data System (ADS)

Zhu, Ziliang; Wang, Haijie; Wang, Xiquan; Shi, Yanying

2018-05-01

The effects of the rovibrational excitation of reactants in the N(2D) + D2(X1Σg+) → ND(X3Σ+) + D(2S) reaction are calculated in a collision energy range from the threshold to 1.0 eV using the time-dependent wave packet approach and a second-order split operator. The reaction probability, integral cross-section, differential cross-section and rate constant of the title reaction are calculated. The integral cross-section and rate constant of the initial states v = 0, j = 0, 1, are in good agreement with experimental data available in the literature. The rotational excitation of the D2 molecule has little effect on reaction probability, integral cross-section and the rate constant, but it increased the sideways and forward scattering signals. The vibrational excitation of the D2 molecule reduced the threshold and broke up the forward-backward symmetry of the differential cross-section; it also increased the forward scattering signals. This may be because the vibrational excitation of the D2 molecule reduced the lifetime of the intermediate complex.

Energy Efficient Cluster Based Scheduling Scheme for Wireless Sensor Networks

PubMed Central

Srie Vidhya Janani, E.; Ganesh Kumar, P.

2015-01-01

The energy utilization of sensor nodes in large scale wireless sensor network points out the crucial need for scalable and energy efficient clustering protocols. Since sensor nodes usually operate on batteries, the maximum utility of network is greatly dependent on ideal usage of energy leftover in these sensor nodes. In this paper, we propose an Energy Efficient Cluster Based Scheduling Scheme for wireless sensor networks that balances the sensor network lifetime and energy efficiency. In the first phase of our proposed scheme, cluster topology is discovered and cluster head is chosen based on remaining energy level. The cluster head monitors the network energy threshold value to identify the energy drain rate of all its cluster members. In the second phase, scheduling algorithm is presented to allocate time slots to cluster member data packets. Here congestion occurrence is totally avoided. In the third phase, energy consumption model is proposed to maintain maximum residual energy level across the network. Moreover, we also propose a new packet format which is given to all cluster member nodes. The simulation results prove that the proposed scheme greatly contributes to maximum network lifetime, high energy, reduced overhead, and maximum delivery ratio. PMID:26495417

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.

High-performance flat data center network architecture based on scalable and flow-controlled optical switching system

NASA Astrophysics Data System (ADS)

Calabretta, Nicola; Miao, Wang; Dorren, Harm

2016-03-01

Traffic in data centers networks (DCNs) is steadily growing to support various applications and virtualization technologies. Multi-tenancy enabling efficient resource utilization is considered as a key requirement for the next generation DCs resulting from the growing demands for services and applications. Virtualization mechanisms and technologies can leverage statistical multiplexing and fast switch reconfiguration to further extend the DC efficiency and agility. We present a novel high performance flat DCN employing bufferless and distributed fast (sub-microsecond) optical switches with wavelength, space, and time switching operation. The fast optical switches can enhance the performance of the DCNs by providing large-capacity switching capability and efficiently sharing the data plane resources by exploiting statistical multiplexing. Benefiting from the Software-Defined Networking (SDN) control of the optical switches, virtual DCNs can be flexibly created and reconfigured by the DCN provider. Numerical and experimental investigations of the DCN based on the fast optical switches show the successful setup of virtual network slices for intra-data center interconnections. Experimental results to assess the DCN performance in terms of latency and packet loss show less than 10^-5 packet loss and 640ns end-to-end latency with 0.4 load and 16- packet size buffer. Numerical investigation on the performance of the systems when the port number of the optical switch is scaled to 32x32 system indicate that more than 1000 ToRs each with Terabit/s interface can be interconnected providing a Petabit/s capacity. The roadmap to photonic integration of large port optical switches will be also presented.

Cool Sportswear

NASA Technical Reports Server (NTRS)

1982-01-01

New athletic wear design based on the circulating liquid cooling system used in the astronaut's space suits, allows athletes to perform more strenuous activity without becoming overheated. Techni-Clothes gear incorporates packets containing a heat-absorbing gel that slips into an insulated pocket of the athletic garment and is positioned near parts of the body where heat transfer is most efficient. A gel packet is good for about one hour. Easily replaced from a supply of spares in an insulated container worn on the belt. The products, targeted primarily for runners and joggers and any other athlete whose performance may be affected by hot weather, include cooling headbands, wrist bands and running shorts with gel-pack pockets.

Data forwarding mechanism for supporting real-time services during relocations in UMTS systems

NASA Astrophysics Data System (ADS)

Cai, Wei; Liao, Xianglong; Zheng, Liang; Liu, Zehong

2004-04-01

To minimize the interruption during the handovers or relocations invoked by subscribers moving is a very critical factor to enhance the performance of the UMTS systems. We know that the 2G systems have been optimized to minimize the interruption of speech during handovers by two main technologies: one is the bi-casting for the DL traffic and the other is the fast radio resynchronization by the UE for the UL traffic. In the UMTS systems, we have also implemented lossless relocations for non real-time services with high reliability by data buffering in the source RNC and target RNC for the UE. However, the UMTS systems support four QoS classes traffic flow: conversational class, streaming class, interactive class and background class. The main distinguishing factor between these QoS classes is how delay sensitive the traffic is: Conversational and Streaming classes are mainly used to carry real-time traffic flows, like video telephony, interactive and background classes are mainly used by traditional Internet applications like WWW, E-mail and FTP. It"s essential to provide the solutions for supporting real-time services to meet the requirement for QoS in UMTS systems. Apparently, the Data buffering mechanism is not adapted to real-time services because of it"s delay may exceed the basic requirement for real-time services. Under this background, the paper discussed two data forwarding solutions for real-time services from the PS domain in the UMTS systems: packet duplication and Core Network bi-casting. The former mechanism does not require any new procedures, messages nor information elements. The later mechanism requires that the GGSN or SGSN is able to bi-cast the DL traffic to the target RNC according to the relocations involving two SGSNs or just involving one SGSN. It also implicitly shows that we need change procedures at the nodes SGSN, GGSN and RNC which are involved in the relocation procedure based on existing procedures that we have already designed if adopt the later solution. In a detail way, the paper analyzed the characteristic for these two solutions respectively, concentrated on the packet flows and the message flows in those nodes involved in relocations. Additionally, also gave out the impact on present transport technologies in the wireless communication systems. However we shall minimize the impact of evolution of transport mechanism and utilize the resource efficiently according to the general requirements for QoS in UMTS systems.

Laser control of reactions of photoswitching functional molecules.

PubMed

Tamura, Hiroyuki; Nanbu, Shinkoh; Ishida, Toshimasa; Nakamura, Hiroki

2006-07-21

Laser control schemes of reactions of photoswitching functional molecules are proposed based on the quantum mechanical wave-packet dynamics and the design of laser parameters. The appropriately designed quadratically chirped laser pulses can achieve nearly complete transitions of wave packet among electronic states. The laser parameters can be optimized by using the Zhu-Nakamura theory of nonadiabatic transition. This method is effective not only for the initial photoexcitation process but also for the pump and dump scheme in the middle of the overall photoswitching process. The effects of momentum of the wave packet crossing a conical intersection on the branching ratio of products have also been clarified. These control schemes mentioned above are successfully applied to the cyclohexadiene/hexatriene photoisomerization (ring-opening) process which is the reaction center of practical photoswitching molecules such as diarylethenes. The overall efficiency of the ring opening can be appreciably increased by using the appropriately designed laser pulses compared to that of the natural photoisomerization without any control schemes.

Software-defined networking control plane for seamless integration of multiple silicon photonic switches in Datacom networks

DOE PAGES

Shen, Yiwen; Hattink, Maarten; Samadi, Payman; ...

2018-04-13

Silicon photonics based switches offer an effective option for the delivery of dynamic bandwidth for future large-scale Datacom systems while maintaining scalable energy efficiency. The integration of a silicon photonics-based optical switching fabric within electronic Datacom architectures requires novel network topologies and arbitration strategies to effectively manage the active elements in the network. Here, we present a scalable software-defined networking control plane to integrate silicon photonic based switches with conventional Ethernet or InfiniBand networks. Our software-defined control plane manages both electronic packet switches and multiple silicon photonic switches for simultaneous packet and circuit switching. We built an experimental Dragonfly networkmore » testbed with 16 electronic packet switches and 2 silicon photonic switches to evaluate our control plane. Observed latencies occupied by each step of the switching procedure demonstrate a total of 344 microsecond control plane latency for data-center and high performance computing platforms.« less

Software-defined networking control plane for seamless integration of multiple silicon photonic switches in Datacom networks

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

Shen, Yiwen; Hattink, Maarten; Samadi, Payman

Silicon photonics based switches offer an effective option for the delivery of dynamic bandwidth for future large-scale Datacom systems while maintaining scalable energy efficiency. The integration of a silicon photonics-based optical switching fabric within electronic Datacom architectures requires novel network topologies and arbitration strategies to effectively manage the active elements in the network. Here, we present a scalable software-defined networking control plane to integrate silicon photonic based switches with conventional Ethernet or InfiniBand networks. Our software-defined control plane manages both electronic packet switches and multiple silicon photonic switches for simultaneous packet and circuit switching. We built an experimental Dragonfly networkmore » testbed with 16 electronic packet switches and 2 silicon photonic switches to evaluate our control plane. Observed latencies occupied by each step of the switching procedure demonstrate a total of 344 microsecond control plane latency for data-center and high performance computing platforms.« less

Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability

NASA Astrophysics Data System (ADS)

Lin, Yi-Kuei; Huang, Cheng-Fu

2015-04-01

From a quality of service viewpoint, the transmission packet unreliability and transmission time are both critical performance indicators in a computer system when assessing the Internet quality for supervisors and customers. A computer system is usually modelled as a network topology where each branch denotes a transmission medium and each vertex represents a station of servers. Almost every branch has multiple capacities/states due to failure, partial failure, maintenance, etc. This type of network is known as a multi-state computer network (MSCN). This paper proposes an efficient algorithm that computes the system reliability, i.e., the probability that a specified amount of data can be sent through k (k ≥ 2) disjoint minimal paths within both the tolerable packet unreliability and time threshold. Furthermore, two routing schemes are established in advance to indicate the main and spare minimal paths to increase the system reliability (referred to as spare reliability). Thus, the spare reliability can be readily computed according to the routing scheme.

Near-Resonant Raman Amplification in the Rotational Quantum Wave Packets of Nitrogen Molecular Ions Generated by Strong Field Ionization

NASA Astrophysics Data System (ADS)

Liu, Zhaoxiang; Yao, Jinping; Chen, Jinming; Xu, Bo; Chu, Wei; Cheng, Ya

2018-02-01

The generation of laserlike narrow bandwidth emissions from nitrogen molecular ions (N2+ ) generated in intense near- and mid infrared femtosecond laser fields has aroused much interest because of the mysterious physics underlying such a phenomenon. Here, we perform a pump-probe measurement on the nonlinear interaction of rotational quantum wave packets of N2+ generated in midinfrared (e.g., at a wavelength centered at 1580 nm) femtosecond laser fields with an ultrashort probe pulse whose broad spectrum overlaps both P - and R -branch rotational transition lines between the electronic states N2+(B2Σu+,v'=0 ) and N2+(X2Σg+,v =0 ) . The results indicate the occurrence of highly efficient near-resonant stimulated Raman scattering in the quantum wave packets of N2+ ions generated in strong laser fields in the midinfrared region, of which the underlying mechanism is different from that of the air lasers generated in atmospheric environment when pumping with 800 nm intense pulses.

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.

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.

Self-action of Bessel wave packets in a system of coupled light guides and formation of light bullets

NASA Astrophysics Data System (ADS)

Balakin, A. A.; Mironov, V. A.; Skobelev, S. A.

2017-01-01

The self-action of two-dimensional and three-dimensional Bessel wave packets in a system of coupled light guides is considered using the discrete nonlinear Schrödinger equation. The features of the self-action of such wave fields are related to their initial strong spatial inhomogeneity. The numerical simulation shows that for the field amplitude exceeding a critical value, the development of an instability typical of a medium with the cubic nonlinearity is observed. Various regimes are studied: the self-channeling of a wave beam in one light guide at powers not strongly exceeding a critical value, the formation of the "kaleidoscopic" picture of a wave packet during the propagation of higher-power radiation along a stratified medium, the formation of light bullets during competition between self-focusing and modulation instabilities in the case of three-dimensional wave packets, etc. In the problem of laser pulse shortening, the situation is considered when the wave-field stratification in the transverse direction dominates. This process is accompanied by the self-compression of laser pulses in well enough separated light guides. The efficiency of conversion of the initial Bessel field distribution to two flying parallel light bullets is about 50%.

Synchronization Control for a Class of Discrete-Time Dynamical Networks With Packet Dropouts: A Coding-Decoding-Based Approach.

PubMed

Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

2017-09-06

The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.

Self-action of Bessel wave packets in a system of coupled light guides and formation of light bullets

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

Balakin, A. A., E-mail: balakin.alexey@yandex.ru; Mironov, V. A.; Skobelev, S. A., E-mail: sk.sa1981@gmail.com

The self-action of two-dimensional and three-dimensional Bessel wave packets in a system of coupled light guides is considered using the discrete nonlinear Schrödinger equation. The features of the self-action of such wave fields are related to their initial strong spatial inhomogeneity. The numerical simulation shows that for the field amplitude exceeding a critical value, the development of an instability typical of a medium with the cubic nonlinearity is observed. Various regimes are studied: the self-channeling of a wave beam in one light guide at powers not strongly exceeding a critical value, the formation of the “kaleidoscopic” picture of a wavemore » packet during the propagation of higher-power radiation along a stratified medium, the formation of light bullets during competition between self-focusing and modulation instabilities in the case of three-dimensional wave packets, etc. In the problem of laser pulse shortening, the situation is considered when the wave-field stratification in the transverse direction dominates. This process is accompanied by the self-compression of laser pulses in well enough separated light guides. The efficiency of conversion of the initial Bessel field distribution to two flying parallel light bullets is about 50%.« less

Burst-mode optical label processor with ultralow power consumption.

PubMed

Ibrahim, Salah; Nakahara, Tatsushi; Ishikawa, Hiroshi; Takahashi, Ryo

2016-04-04

A novel label processor subsystem for 100-Gbps (25-Gbps × 4λs) burst-mode optical packets is developed, in which a highly energy-efficient method is pursued for extracting and interfacing the ultrafast packet-label to a CMOS-based processor where label recognition takes place. The method involves performing serial-to-parallel conversion for the label bits on a bit-by-bit basis by using an optoelectronic converter that is operated with a set of optical triggers generated in a burst-mode manner upon packet arrival. Here we present three key achievements that enabled a significant reduction in the total power consumption and latency of the whole subsystem; 1) based on a novel operation mechanism for providing amplification with bit-level selectivity, an optical trigger pulse generator, that consumes power for a very short duration upon packet arrival, is proposed and experimentally demonstrated, 2) the energy of optical triggers needed by the optoelectronic serial-to-parallel converter is reduced by utilizing a negative-polarity signal while employing an enhanced conversion scheme entitled the discharge-or-hold scheme, 3) the necessary optical trigger energy is further cut down by half by coupling the triggers through the chip's backside, whereas a novel lens-free packaging method is developed to enable a low-cost alignment process that works with simple visual observation.

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.

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.

FAIMS Mobile: Flexible, open-source software for field research

NASA Astrophysics Data System (ADS)

Ballsun-Stanton, Brian; Ross, Shawn A.; Sobotkova, Adela; Crook, Penny

2018-01-01

FAIMS Mobile is a native Android application supported by an Ubuntu server facilitating human-mediated field research across disciplines. It consists of 'core' Java and Ruby software providing a platform for data capture, which can be deeply customised using 'definition packets' consisting of XML documents (data schema and UI) and Beanshell scripts (automation). Definition packets can also be generated using an XML-based domain-specific language, making customisation easier. FAIMS Mobile includes features allowing rich and efficient data capture tailored to the needs of fieldwork. It also promotes synthetic research and improves transparency and reproducibility through the production of comprehensive datasets that can be mapped to vocabularies or ontologies as they are created.

40-Gbps optical backbone network deep packet inspection based on FPGA

NASA Astrophysics Data System (ADS)

Zuo, Yuan; Huang, Zhiping; Su, Shaojing

2014-11-01

In the era of information, the big data, which contains huge information, brings about some problems, such as high speed transmission, storage and real-time analysis and process. As the important media for data transmission, the Internet is the significant part for big data processing research. With the large-scale usage of the Internet, the data streaming of network is increasing rapidly. The speed level in the main fiber optic communication of the present has reached 40Gbps, even 100Gbps, therefore data on the optical backbone network shows some features of massive data. Generally, data services are provided via IP packets on the optical backbone network, which is constituted with SDH (Synchronous Digital Hierarchy). Hence this method that IP packets are directly mapped into SDH payload is named POS (Packet over SDH) technology. Aiming at the problems of real time process of high speed massive data, this paper designs a process system platform based on ATCA for 40Gbps POS signal data stream recognition and packet content capture, which employs the FPGA as the CPU. This platform offers pre-processing of clustering algorithms, service traffic identification and data mining for the following big data storage and analysis with high efficiency. Also, the operational procedure is proposed in this paper. Four channels of 10Gbps POS signal decomposed by the analysis module, which chooses FPGA as the kernel, are inputted to the flow classification module and the pattern matching component based on TCAM. Based on the properties of the length of payload and net flows, buffer management is added to the platform to keep the key flow information. According to data stream analysis, DPI (deep packet inspection) and flow balance distribute, the signal is transmitted to the backend machine through the giga Ethernet ports on back board. Practice shows that the proposed platform is superior to the traditional applications based on ASIC and NP.

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.

A Geographical Heuristic Routing Protocol for VANETs

PubMed Central

Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

2016-01-01

Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation). PMID:27669254

A Geographical Heuristic Routing Protocol for VANETs.

PubMed

Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

2016-09-23

Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation).

Limited static and dynamic delivering capacity allocations in scale-free networks

NASA Astrophysics Data System (ADS)

Haddou, N. Ben; Ez-Zahraouy, H.; Rachadi, A.

In traffic networks, it is quite important to assign proper packet delivering capacities to the routers with minimum cost. In this respect, many allocation models based on static and dynamic properties have been proposed. In this paper, we are interested in the impact of limiting the packet delivering capacities already allocated to the routers; each node is assigned a packet delivering capacity limited by the maximal capacity Cmax of the routers. To study the limitation effect, we use two basic delivering capacity allocation models; static delivering capacity allocation (SDCA) and dynamic delivering capacity allocation (DDCA). In the SDCA, the capacity allocated is proportional to the node degree, and for DDCA, it is proportional to its queue length. We have studied and compared the limitation of both allocation models under the shortest path (SP) routing strategy as well as the efficient path (EP) routing protocol. In the SP case, we noted a similarity in the results; the network capacity increases with increasing Cmax. For the EP scheme, the network capacity stops increasing for relatively small packet delivering capability limit Cmax for both allocation strategies. However, it reaches high values under the limited DDCA before the saturation. We also find that in the DDCA case, the network capacity remains constant when the traffic information available to each router was updated after long period times τ.

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.

A Bernoulli Gaussian Watermark for Detecting Integrity Attacks in Control Systems

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

Weerakkody, Sean; Ozel, Omur; Sinopoli, Bruno

We examine the merit of Bernoulli packet drops in actively detecting integrity attacks on control systems. The aim is to detect an adversary who delivers fake sensor measurements to a system operator in order to conceal their effect on the plant. Physical watermarks, or noisy additive Gaussian inputs, have been previously used to detect several classes of integrity attacks in control systems. In this paper, we consider the analysis and design of Gaussian physical watermarks in the presence of packet drops at the control input. On one hand, this enables analysis in a more general network setting. On the othermore » hand, we observe that in certain cases, Bernoulli packet drops can improve detection performance relative to a purely Gaussian watermark. This motivates the joint design of a Bernoulli-Gaussian watermark which incorporates both an additive Gaussian input and a Bernoulli drop process. We characterize the effect of such a watermark on system performance as well as attack detectability in two separate design scenarios. Here, we consider a correlation detector for attack recognition. We then propose efficiently solvable optimization problems to intelligently select parameters of the Gaussian input and the Bernoulli drop process while addressing security and performance trade-offs. Finally, we provide numerical results which illustrate that a watermark with packet drops can indeed outperform a Gaussian watermark.« less

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

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

PubMed Central

Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; Lee, Malrey

2012-01-01

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

Adaptive Subframe Partitioning and Efficient Packet Scheduling in OFDMA Cellular System with Fixed Decode-and-Forward Relays

NASA Astrophysics Data System (ADS)

Wang, Liping; Ji, Yusheng; Liu, Fuqiang

The integration of multihop relays with orthogonal frequency-division multiple access (OFDMA) cellular infrastructures can meet the growing demands for better coverage and higher throughput. Resource allocation in the OFDMA two-hop relay system is more complex than that in the conventional single-hop OFDMA system. With time division between transmissions from the base station (BS) and those from relay stations (RSs), fixed partitioning of the BS subframe and RS subframes can not adapt to various traffic demands. Moreover, single-hop scheduling algorithms can not be used directly in the two-hop system. Therefore, we propose a semi-distributed algorithm called ASP to adjust the length of every subframe adaptively, and suggest two ways to extend single-hop scheduling algorithms into multihop scenarios: link-based and end-to-end approaches. Simulation results indicate that the ASP algorithm increases system utilization and fairness. The max carrier-to-interference ratio (Max C/I) and proportional fairness (PF) scheduling algorithms extended using the end-to-end approach obtain higher throughput than those using the link-based approach, but at the expense of more overhead for information exchange between the BS and RSs. The resource allocation scheme using ASP and end-to-end PF scheduling achieves a tradeoff between system throughput maximization and fairness.

Multipath routing in wireless sensor networks: survey and research challenges.

PubMed

Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

2012-01-01

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling.

PubMed

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-09-18

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols.

WEAMR — A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

PubMed Central

Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

2013-01-01

Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs. PMID:23669714

WEAMR-a weighted energy aware multipath reliable routing mechanism for hotline-based WSNs.

PubMed

Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

2013-05-13

Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling

PubMed Central

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-01-01

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols. PMID:26393608

The Pacor 2 expert system: A case-based reasoning approach to troubleshooting

NASA Technical Reports Server (NTRS)

Sary, Charisse

1994-01-01

The Packet Processor 2 (Pacor 2) Data Capture Facility (DCF) acquires, captures, and performs level-zero processing of packet telemetry for spaceflight missions that adhere to communication services recommendations established by the Consultative Committee for Space Data Systems (CCSDS). A major goal of this project is to reduce life-cycle costs. One way to achieve this goal is to increase automation. Through automation, using expert systems, and other technologies, staffing requirements will remain static, which will enable the same number of analysts to support more missions. Analysts provide packet telemetry data evaluation and analysis services for all data received. Data that passes this evaluation is forwarded to the Data Distribution Facility (DDF) and released to scientists. Through troubleshooting, data that fails this evaluation is dumped and analyzed to determine if its quality can be improved before it is released. This paper describes a proof-of-concept prototype that troubleshoots data quality problems. The Pacor 2 expert system prototype uses the case-based reasoning (CBR) approach to development, an alternative to a rule-based approach. Because Pacor 2 is not operational, the prototype has been developed using cases that describe existing troubleshooting experience from currently operating missions. Through CBR, this experience will be available to analysts when Pacor 2 becomes operational. As Pacor 2 unique experience is gained, analysts will update the case base. In essence, analysts are training the system as they learn. Once the system has learned the cases most likely to recur, it can serve as an aide to inexperienced analysts, a refresher to experienced analysts for infrequently occurring problems, or a training tool for new analysts. The Expert System Development Methodology (ESDM) is being used to guide development.

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.

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.

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.

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.

Geometric Design of Scalable Forward Scatterers for Optimally Efficient Solar Transformers.

PubMed

Kim, Hye-Na; Vahidinia, Sanaz; Holt, Amanda L; Sweeney, Alison M; Yang, Shu

2017-11-01

It will be ideal to deliver equal, optimally efficient "doses" of sunlight to all cells in a photobioreactor system, while simultaneously utilizing the entire solar resource. Backed by the numerical scattering simulation and optimization, here, the design, synthesis, and characterization of the synthetic iridocytes that recapitulated the salient forward-scattering behavior of the Tridacnid clam system are reported, which presents the first geometric solution to allow narrow, precise forward redistribution of flux, utilizing the solar resource at the maximum quantum efficiency possible in living cells. The synthetic iridocytes are composed of silica nanoparticles in microspheres embedded in gelatin, both are low refractive index materials and inexpensive. They show wavelength selectivity, have little loss (the back-scattering intensity is reduced to less than ≈0.01% of the forward-scattered intensity), and narrow forward scattering cone similar to giant clams. Moreover, by comparing experiments and theoretical calculation, it is confirmed that the nonuniformity of the scatter sizes is a "feature not a bug" of the design, allowing for efficient, forward redistribution of solar flux in a micrometer-scaled paradigm. This method is environmentally benign, inexpensive, and scalable to produce optical components that will find uses in efficiency-limited solar conversion technologies, heat sinks, and biofuel production. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Pheromone Static Routing Strategy for Complex Networks

NASA Astrophysics Data System (ADS)

Hu, Mao-Bin; Henry, Y. K. Lau; Ling, Xiang; Jiang, Rui

2012-12-01

We adopt the concept of using pheromones to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81 (2010) 016113]. The path generation method consists of two stages. In the first stage, a pheromone is dropped to the nodes by packets forwarded according to the global dynamic routing strategy. In the second stage, pheromone static paths are generated according to the pheromone density. The output paths can greatly improve traffic systems' overall capacity on different network structures, including scale-free networks, small-world networks and random graphs. Because the paths are static, the system needs much less computational resources than the global dynamic routing strategy.

Resource Management in QoS-Aware Wireless Cellular Networks

ERIC Educational Resources Information Center

Zhang, Zhi

2011-01-01

Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study…

Off-Campus Registration Procedures.

ERIC Educational Resources Information Center

Maas, Michael L.

Registration is one of the more critical functions that a college staff encounters each semester. To have a smooth, efficient, college-wide registration, it is essential that all segments of the college be aware of registration procedures as well as data control operations. This packet was designed to acquaint interested parties with the…

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.

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.

Enabling efficient vertical takeoff/landing and forward flight of unmanned aerial vehicles: Design and control of tandem wing-tip mounted rotor mechanisms

NASA Astrophysics Data System (ADS)

Mancuso, Peter Timothy

Fixed-wing unmanned aerial vehicles (UAVs) that offer vertical takeoff and landing (VTOL) and forward flight capability suffer from sub-par performance in both flight modes. Achieving the next generation of efficient hybrid aircraft requires innovations in: (i) power management, (ii) efficient structures, and (iii) control methodologies. Existing hybrid UAVs generally utilize one of three transitioning mechanisms: an external power mechanism to tilt the rotor-propulsion pod, separate propulsion units and rotors during hover and forward flight, or tilt body craft (smaller scale). Thus, hybrid concepts require more energy compared to dedicated fixed-wing or rotorcraft UAVs. Moreover, design trade-offs to reinforce the wing structure (typically to accommodate the propulsion systems and enable hover, i.e. tilt-rotor concepts) adversely impacts the aerodynamics, controllability and efficiency of the aircraft in both hover and forward flight modes. The goal of this research is to develop more efficient VTOL/ hover and forward flight UAVs. In doing so, the transition sequence, transition mechanism, and actuator performance are heavily considered. A design and control methodology was implemented to address these issues through a series of computer simulations and prototype benchtop tests to verify the proposed solution. Finally, preliminary field testing with a first-generation prototype was conducted. The methods used in this research offer guidelines and a new dual-arm rotor UAV concept to designing more efficient hybrid UAVs in both hover and forward flight.

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.

Effect of Seat Surface Inclination on Postural Stability and forward Reaching Efficiency in Children with Spastic Cerebral Palsy

ERIC Educational Resources Information Center

Cherng, Rong-Ju; Lin, Hui-Chen; Ju, Yun-Huei; Ho, Chin-Shan

2009-01-01

The purpose of this study was to examine the effect of seat surface inclination on postural stability and forward reaching efficiency in 10 children with spastic cerebral palsy (CP) and 16 typically developing (TD) children. The children performed a static sitting and a forward reaching task while sitting on a height- and inclination-adjustable…

Error Control Coding Techniques for Space and Satellite Communications

NASA Technical Reports Server (NTRS)

Costello, Daniel J., Jr.; Takeshita, Oscar Y.; Cabral, Hermano A.; He, Jiali; White, Gregory S.

1997-01-01

Turbo coding using iterative SOVA decoding and M-ary differentially coherent or non-coherent modulation can provide an effective coding modulation solution: (1) Energy efficient with relatively simple SOVA decoding and small packet lengths, depending on BEP required; (2) Low number of decoding iterations required; and (3) Robustness in fading with channel interleaving.

Experimental energy consumption of Frame Slotted ALOHA and Distributed Queuing for data collection scenarios.

PubMed

Tuset-Peiro, Pere; Vazquez-Gallego, Francisco; Alonso-Zarate, Jesus; Alonso, Luis; Vilajosana, Xavier

2014-07-24

Data collection is a key scenario for the Internet of Things because it enables gathering sensor data from distributed nodes that use low-power and long-range wireless technologies to communicate in a single-hop approach. In this kind of scenario, the network is composed of one coordinator that covers a particular area and a large number of nodes, typically hundreds or thousands, that transmit data to the coordinator upon request. Considering this scenario, in this paper we experimentally validate the energy consumption of two Medium Access Control (MAC) protocols, Frame Slotted ALOHA (FSA) and Distributed Queuing (DQ). We model both protocols as a state machine and conduct experiments to measure the average energy consumption in each state and the average number of times that a node has to be in each state in order to transmit a data packet to the coordinator. The results show that FSA is more energy efficient than DQ if the number of nodes is known a priori because the number of slots per frame can be adjusted accordingly. However, in such scenarios the number of nodes cannot be easily anticipated, leading to additional packet collisions and a higher energy consumption due to retransmissions. Contrarily, DQ does not require to know the number of nodes in advance because it is able to efficiently construct an ad hoc network schedule for each collection round. This kind of a schedule ensures that there are no packet collisions during data transmission, thus leading to an energy consumption reduction above 10% compared to FSA.

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

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.

Detecting and Blocking Network Attacks at Ultra High Speeds

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

Paxson, Vern

2010-11-29

Stateful, in-depth, in-line traffic analysis for intrusion detection and prevention has grown increasingly more difficult as the data rates of modern networks rise. One point in the design space for high-performance network analysis - pursued by a number of commercial products - is the use of sophisticated custom hardware. For very high-speed processing, such systems often cast the entire analysis process in ASICs. This project pursued a different architectural approach, which we term Shunting. Shunting marries a conceptually quite simple hardware device with an Intrusion Prevention System (IPS) running on commodity PC hardware. The overall design goal is was tomore » keep the hardware both cheap and readily scalable to future higher speeds, yet also retain the unparalleled flexibility that running the main IPS analysis in a full general-computing environment provides. The Shunting architecture we developed uses a simple in-line hardware element that maintains several large state tables indexed by packet header fields, including IP/TCP flags, source and destination IP addresses, and connection tuples. The tables yield decision values the element makes on a packet-by-packet basis: forward the packet, drop it, or divert ('shunt') it through the IPS (the default). By manipulating table entries, the IPS can, on a fine-grained basis: (i) specify the traffic it wishes to examine, (ii) directly block malicious traffic, and (iii) 'cut through' traffic streams once it has had an opportunity to 'vet' them, or (iv) skip over large items within a stream before proceeding to further analyze it. For the Shunting architecture to yield benefits, it needs to operate in an environment for which the monitored network traffic has the property that - after proper vetting - much of it can be safely skipped. This property does not universally hold. For example, if a bank needs to examine all Web traffic involving its servers for regulatory compliance, then a monitor in front of one of the bank's server farms cannot safely omit a subset of the traffic from analysis. In this environment, Shunting cannot realize its main performance benefits, and the monitoring task likely calls for using custom hardware instead. However, in many other environments we find Shunting holds promise for delivering major performance gains. This arises due to the the widely documented 'heavy tail' nature of most forms of network traffic, which we might express as 'a few of the connections carry just about all the bytes.' The key additional insight is '... and very often for these few large connections, the very beginning of the connection contains nearly all the information of interest from a security analysis perspective.' We argue that this second claim holds because it is at the beginning of connections that authentication exchanges occur, data or file names and types are specified, request and reply status codes conveyed, and encryption is negotiated. Once these occur, we have seen most of the interesting facets of the dialog. Certainly the remainder of the connection might also yield some grist for analysis, but this is generally less likely, and thus if we want to lower analysis load at as small a loss as possible of information relevant to security analysis, we might best do so by skipping the bulk of large connections. In a different context, the 'Time Machine' work by Kornexl and colleagues likewise shows that in some environments we can realize major reductions in the volume of network traffic processed, by limiting the processing to the first 10-20 KB of each connection. As a concrete example, consider an IPS that monitors SSH traffic. When a new SSH connection arrives and the Shunt fails to find an entry for it in any of its tables (per-address, per-port, per-connection), it executes the default action of diverting the connection through the IPS. The IPS analyzes the beginning of the connection in this fashion. As long as it is satisified with the dialog, it reinjects the packets forwarded to it so that the connection can continue. If the connection successfully negotiates encryption, the IPS can no longer profitably analyze it, so it downloads a per-connection table entry to the Shunt specifying that the action for the connection in the future is 'forward.' For heavy-tailed connections, this means a very large majority of the connection's packets will now pass through the Shunt device without burdening the IPS with any further analysis load. On the other hand, if the IPS is dissatisfied with some element of the initial dialog, it downloads a 'drop' entry to terminate the connection. Note that by providing for reinjection, we can promote an intrusion detection system into an intrusion prevention system, one that does not merely detect attacks but can block them before they complete. Reinjection also allows the IPS to normalize traffic to remove ambiguities that attackers can leverage to evade the IPS.« less

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.

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.

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.

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

On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

PubMed

Amanowicz, Marek; Krygier, Jaroslaw

2018-05-26

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

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.

Studies on laminar boundary-layer receptivity to freestream turbulence near a leading edge

NASA Technical Reports Server (NTRS)

Kendall, James M.

1991-01-01

An experimental study of the generation of Tollmien-Schlichting waves and wave packets in a flat-plate boundary-layer by weak freestream turbulence has been conducted with the intent of clarifying receptivity mechanisms. Emphasis was placed upon the properties of such waves at stations as far forward as the minimum critical Reynolds number. It was found that alteration of the flow about the leading edge, due either to an asymmetry associated with lift, or due to a change of the fineness ratio of the leading edge, altered the T-S wave amplitude at early stations. The subsequent growth of the waves proceeded faster than expected according to certain stability theory results. Speculation regarding receptivity mechanisms is made.

Investigation of the NACA 4-(3)(8)-045 Two-blade Propellers at Forward Mach Numbers to 0.725 to Determine the Effects of Compressibility and Solidity on Performance

NASA Technical Reports Server (NTRS)

Stack, John; Draley, Eugene C; Delano, James B; Feldman, Lewis

1950-01-01

As part of a general investigation of propellers at high forward speeds, tests of two 2-blade propellers having the NACA 4-(3)(8)-03 and NACA 4-(3)(8)-45 blade designs have been made in the Langley 8-foot high-speed tunnel through a range of blade angle from 20 degrees to 60 degrees for forward Mach numbers from 0.165 to 0.725 to establish in detail the changes in propeller characteristics due to compressibility effects. These propellers differed primarily only in blade solidity, one propeller having 50 percent and more solidity than the other. Serious losses in propeller efficiency were found as the propeller tip Mach number exceeded 0.91, irrespective of forward speed or blade angle. The magnitude of the efficiency losses varied from 9 percent to 22 percent per 0.1 increase in tip Mach number above the critical value. The range of advance ratio for peak efficiency decreased markedly with increase of forward speed. The general form of the changes in thrust and power coefficients was found to be similar to the changes in airfoil lift coefficient with changes in Mach number. Efficiency losses due to compressibility effects decreased with increase of blade width. The results indicated that the high level of propeller efficiency obtained at low speeds could be maintained to forward sea-level speeds exceeding 500 miles per hour.

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

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

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.

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.

Research on the energy and ecological efficiency of mechanical equipment remanufacturing systems

NASA Astrophysics Data System (ADS)

Shi, Junli; Cheng, Jinshi; Ma, Qinyi; Wang, Yajun

2017-08-01

According to the characteristics of mechanical equipment remanufacturing system, the dynamic performance of energy consumption and emission is explored, the equipment energy efficiency and emission analysis model is established firstly, and then energy and ecological efficiency analysis method of the remanufacturing system is put forward, at last, the energy and ecological efficiency of WD615.87 automotive diesel engine remanufacturing system as an example is analyzed, the way of energy efficiency improvementnt and environmental friendly mechanism of remanufacturing process is put forward.

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.

Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation.

PubMed

Waheed, Maham; Ahmad, Rizwan; Ahmed, Waqas; Drieberg, Micheal; Alam, Muhammad Mahtab

2018-02-13

The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs). Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor's battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE) and packet error rate (PER) are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC) coding the cooperative link.

Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation

PubMed Central

Waheed, Maham; Ahmad, Rizwan; Ahmed, Waqas

2018-01-01

The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs). Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor’s battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE) and packet error rate (PER) are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC) coding the cooperative link. PMID:29438278

Event-driven charge-coupled device design and applications therefor

NASA Technical Reports Server (NTRS)

Doty, John P. (Inventor); Ricker, Jr., George R. (Inventor); Burke, Barry E. (Inventor); Prigozhin, Gregory Y. (Inventor)

2005-01-01

An event-driven X-ray CCD imager device uses a floating-gate amplifier or other non-destructive readout device to non-destructively sense a charge level in a charge packet associated with a pixel. The output of the floating-gate amplifier is used to identify each pixel that has a charge level above a predetermined threshold. If the charge level is above a predetermined threshold the charge in the triggering charge packet and in the charge packets from neighboring pixels need to be measured accurately. A charge delay register is included in the event-driven X-ray CCD imager device to enable recovery of the charge packets from neighboring pixels for accurate measurement. When a charge packet reaches the end of the charge delay register, control logic either dumps the charge packet, or steers the charge packet to a charge FIFO to preserve it if the charge packet is determined to be a packet that needs accurate measurement. A floating-diffusion amplifier or other low-noise output stage device, which converts charge level to a voltage level with high precision, provides final measurement of the charge packets. The voltage level is eventually digitized by a high linearity ADC.

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.

Beamforming transmission in IEEE 802.11ac under time-varying channels.

PubMed

Yu, Heejung; Kim, Taejoon

2014-01-01

The IEEE 802.11ac wireless local area network (WLAN) standard has adopted beamforming (BF) schemes to improve spectral efficiency and throughput with multiple antennas. To design the transmit beam, a channel sounding process to feedback channel state information (CSI) is required. Due to sounding overhead, throughput increases with the amount of transmit data under static channels. Under practical channel conditions with mobility, however, the mismatch between the transmit beam and the channel at transmission time causes performance loss when transmission duration after channel sounding is too long. When the fading rate, payload size, and operating signal-to-noise ratio are given, the optimal transmission duration (i.e., packet length) can be determined to maximize throughput. The relationship between packet length and throughput is also investigated for single-user and multiuser BF modes.

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.

Beamforming Transmission in IEEE 802.11ac under Time-Varying Channels

PubMed Central

2014-01-01

The IEEE 802.11ac wireless local area network (WLAN) standard has adopted beamforming (BF) schemes to improve spectral efficiency and throughput with multiple antennas. To design the transmit beam, a channel sounding process to feedback channel state information (CSI) is required. Due to sounding overhead, throughput increases with the amount of transmit data under static channels. Under practical channel conditions with mobility, however, the mismatch between the transmit beam and the channel at transmission time causes performance loss when transmission duration after channel sounding is too long. When the fading rate, payload size, and operating signal-to-noise ratio are given, the optimal transmission duration (i.e., packet length) can be determined to maximize throughput. The relationship between packet length and throughput is also investigated for single-user and multiuser BF modes. PMID:25152927

Strong quantum scarring by local impurities

PubMed Central

Luukko, Perttu J. J.; Drury, Byron; Klales, Anna; Kaplan, Lev; Heller, Eric J.; Räsänen, Esa

2016-01-01

We discover and characterise strong quantum scars, or quantum eigenstates resembling classical periodic orbits, in two-dimensional quantum wells perturbed by local impurities. These scars are not explained by ordinary scar theory, which would require the existence of short, moderately unstable periodic orbits in the perturbed system. Instead, they are supported by classical resonances in the unperturbed system and the resulting quantum near-degeneracy. Even in the case of a large number of randomly scattered impurities, the scars prefer distinct orientations that extremise the overlap with the impurities. We demonstrate that these preferred orientations can be used for highly efficient transport of quantum wave packets across the perturbed potential landscape. Assisted by the scars, wave-packet recurrences are significantly stronger than in the unperturbed system. Together with the controllability of the preferred orientations, this property may be very useful for quantum transport applications. PMID:27892510

Strong quantum scarring by local impurities

NASA Astrophysics Data System (ADS)

Luukko, Perttu J. J.; Drury, Byron; Klales, Anna; Kaplan, Lev; Heller, Eric J.; Räsänen, Esa

2016-11-01

We discover and characterise strong quantum scars, or quantum eigenstates resembling classical periodic orbits, in two-dimensional quantum wells perturbed by local impurities. These scars are not explained by ordinary scar theory, which would require the existence of short, moderately unstable periodic orbits in the perturbed system. Instead, they are supported by classical resonances in the unperturbed system and the resulting quantum near-degeneracy. Even in the case of a large number of randomly scattered impurities, the scars prefer distinct orientations that extremise the overlap with the impurities. We demonstrate that these preferred orientations can be used for highly efficient transport of quantum wave packets across the perturbed potential landscape. Assisted by the scars, wave-packet recurrences are significantly stronger than in the unperturbed system. Together with the controllability of the preferred orientations, this property may be very useful for quantum transport applications.

Strong quantum scarring by local impurities.

PubMed

Luukko, Perttu J J; Drury, Byron; Klales, Anna; Kaplan, Lev; Heller, Eric J; Räsänen, Esa

2016-11-28

We discover and characterise strong quantum scars, or quantum eigenstates resembling classical periodic orbits, in two-dimensional quantum wells perturbed by local impurities. These scars are not explained by ordinary scar theory, which would require the existence of short, moderately unstable periodic orbits in the perturbed system. Instead, they are supported by classical resonances in the unperturbed system and the resulting quantum near-degeneracy. Even in the case of a large number of randomly scattered impurities, the scars prefer distinct orientations that extremise the overlap with the impurities. We demonstrate that these preferred orientations can be used for highly efficient transport of quantum wave packets across the perturbed potential landscape. Assisted by the scars, wave-packet recurrences are significantly stronger than in the unperturbed system. Together with the controllability of the preferred orientations, this property may be very useful for quantum transport applications.

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

Distributed Denial of Service Attack Source Detection Using Efficient Traceback Technique (ETT) in Cloud-Assisted Healthcare Environment.

PubMed

Latif, Rabia; Abbas, Haider; Latif, Seemab; Masood, Ashraf

2016-07-01

Security and privacy are the first and foremost concerns that should be given special attention when dealing with Wireless Body Area Networks (WBANs). As WBAN sensors operate in an unattended environment and carry critical patient health information, Distributed Denial of Service (DDoS) attack is one of the major attacks in WBAN environment that not only exhausts the available resources but also influence the reliability of information being transmitted. This research work is an extension of our previous work in which a machine learning based attack detection algorithm is proposed to detect DDoS attack in WBAN environment. However, in order to avoid complexity, no consideration was given to the traceback mechanism. During traceback, the challenge lies in reconstructing the attack path leading to identify the attack source. Among existing traceback techniques, Probabilistic Packet Marking (PPM) approach is the most commonly used technique in conventional IP- based networks. However, since marking probability assignment has significant effect on both the convergence time and performance of a scheme, it is not directly applicable in WBAN environment due to high convergence time and overhead on intermediate nodes. Therefore, in this paper we have proposed a new scheme called Efficient Traceback Technique (ETT) based on Dynamic Probability Packet Marking (DPPM) approach and uses MAC header in place of IP header. Instead of using fixed marking probability, the proposed scheme uses variable marking probability based on the number of hops travelled by a packet to reach the target node. Finally, path reconstruction algorithms are proposed to traceback an attacker. Evaluation and simulation results indicate that the proposed solution outperforms fixed PPM in terms of convergence time and computational overhead on nodes.

Integrating mitosis, toxicity, and transgene expression in a telecommunications packet-switched network model of lipoplex-mediated gene delivery.

PubMed

Martin, Timothy M; Wysocki, Beata J; Beyersdorf, Jared P; Wysocki, Tadeusz A; Pannier, Angela K

2014-08-01

Gene delivery systems transport exogenous genetic information to cells or biological systems with the potential to directly alter endogenous gene expression and behavior with applications in functional genomics, tissue engineering, medical devices, and gene therapy. Nonviral systems offer advantages over viral systems because of their low immunogenicity, inexpensive synthesis, and easy modification but suffer from lower transfection levels. The representation of gene transfer using models offers perspective and interpretation of complex cellular mechanisms,including nonviral gene delivery where exact mechanisms are unknown. Here, we introduce a novel telecommunications model of the nonviral gene delivery process in which the delivery of the gene to a cell is synonymous with delivery of a packet of information to a destination computer within a packet-switched computer network. Such a model uses nodes and layers to simplify the complexity of modeling the transfection process and to overcome several challenges of existing models. These challenges include a limited scope and limited time frame, which often does not incorporate biological effects known to affect transfection. The telecommunication model was constructed in MATLAB to model lipoplex delivery of the gene encoding the green fluorescent protein to HeLa cells. Mitosis and toxicity events were included in the model resulting in simulation outputs of nuclear internalization and transfection efficiency that correlated with experimental data. A priori predictions based on model sensitivity analysis suggest that increasing endosomal escape and decreasing lysosomal degradation, protein degradation, and GFP-induced toxicity can improve transfection efficiency by three-fold. Application of the telecommunications model to nonviral gene delivery offers insight into the development of new gene delivery systems with therapeutically relevant transfection levels.

The Localized Discovery and Recovery for Query Packet Losses in Wireless Sensor Networks with Distributed Detector Clusters

PubMed Central

Teng, Rui; Leibnitz, Kenji; Miura, Ryu

2013-01-01

An essential application of wireless sensor networks is to successfully respond to user queries. Query packet losses occur in the query dissemination due to wireless communication problems such as interference, multipath fading, packet collisions, etc. The losses of query messages at sensor nodes result in the failure of sensor nodes reporting the requested data. Hence, the reliable and successful dissemination of query messages to sensor nodes is a non-trivial problem. The target of this paper is to enable highly successful query delivery to sensor nodes by localized and energy-efficient discovery, and recovery of query losses. We adopt local and collective cooperation among sensor nodes to increase the success rate of distributed discoveries and recoveries. To enable the scalability in the operations of discoveries and recoveries, we employ a distributed name resolution mechanism at each sensor node to allow sensor nodes to self-detect the correlated queries and query losses, and then efficiently locally respond to the query losses. We prove that the collective discovery of query losses has a high impact on the success of query dissemination and reveal that scalability can be achieved by using the proposed approach. We further study the novel features of the cooperation and competition in the collective recovery at PHY and MAC layers, and show that the appropriate number of detectors can achieve optimal successful recovery rate. We evaluate the proposed approach with both mathematical analyses and computer simulations. The proposed approach enables a high rate of successful delivery of query messages and it results in short route lengths to recover from query losses. The proposed approach is scalable and operates in a fully distributed manner. PMID:23748172

Estimation of network path segment delays

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

Nichols, Kathleen Marie

A method for estimation of a network path segment delay includes determining a scaled time stamp for each packet of a plurality of packets by scaling a time stamp for each respective packet to minimize a difference of at least one of a frequency and a frequency drift between a transport protocol clock of a host and a monitoring point. The time stamp for each packet is provided by the transport protocol clock of the host. A corrected time stamp for each packet is determined by removing from the scaled time stamp for each respective packet, a temporal offset betweenmore » the transport protocol clock and the monitoring clock by minimizing a temporal delay variation of the plurality of packets traversing a segment between the host and the monitoring point.« less

Bluetooth and security

NASA Astrophysics Data System (ADS)

Ivo, Penn

2004-04-01

Bluetooth is the new emerging technology for wireless communication. It can be used to connect almost any device to another device. The traditional example is to link a Personal Digital Assistant (PDA) or a laptop to a mobile phone. That way you can easily take remote connections with your PDA or laptop without getting your mobile phone from your pocket or messing around with cables. A Class 3 Bluetooth device has range of 0,1 - 10 meters. The architecture of Bluetooth is formed by the radio, the base frequency part and the Link Manager. Bluetooth uses the radio range of 2.45 GHz. The theoretical maximum bandwidth is 1 Mb/s, which is slowed down a bit by Forward Error Correction (FEC). Bluetooth specification designates the frequency hopping to be implemented with Gaussian Frequency Shift Keying (GFSK). The base frequency part of the Bluetooth architecture uses a combination of circuit and packet switching technologies. Bluetooth can support either one asynchronous data channel and up to three simultaneous synchronous speech channels, or one channel that transfers asynchronous data and synchronous speech simultaneously. The Link Manager is an essential part of the Bluetooth architecture. It uses Link Manager Protocol (LMP) to configure, authenticate and handle the connections between Bluetooth devices. Several Bluetooth devices can form an ad hoc network. In these piconets, one of the Bluetooth devices will act as a master and the others are slaves. The master sets the frequency-hopping behavior of the piconet. It is also possible to connect up to 10 piconets to each other to form so-called scatternets. Bluetooth has been designed to operate in noisy radio frequency environments, and uses a fast acknowledgement and frequency-hopping scheme to make the link robust, communication-wise. Bluetooth radio modules avoid interference from other signals by hopping to a new frequency after transmitting or receiving a packet. Compared with other systems operating in the same frequency band, the Bluetooth radio typically hops faster and uses shorter packets. This is because short packages and fast hopping limit the impact of microwave ovens and other sources of disturbances. Use of Forward Error Correction (FEC) limits the impact of random noise on long-distance links. Bluetooth transmissions are secure in a business and home environment. Bluetooth has built in sufficient encryption and authentication and is thus very secure in any environment. In addition to this, a frequency-hopping scheme with 1600 hops/sec. is employed. This is far quicker than any other competing system. This, together with an automatic output power adaption to reduce the range exactly to requirement, makes the system extremely difficult to eavesdrop. Information Integrity in Bluetooth has these components: Random Number Generation, Encryption, Encryption Key Management and Authentication.

In-Network Processing for Mission-Critical Wireless Networked Sensing and Control: A Real-Time, Efficiency, and Resiliency Perspective

ERIC Educational Resources Information Center

Xiang, Qiao

2014-01-01

As wireless cyber-physical systems (WCPS) are increasingly being deployed in mission-critical applications, it becomes imperative that we consider application QoS requirements in in-network processing (INP). In this dissertation, we explore the potentials of two INP methods, packet packing and network coding, on improving network performance while…

Efficient Byzantine Fault Tolerance for Scalable Storage and Services

DTIC Science & Technology

2009-07-01

most critical applications must survive in ever harsher environments. Less synchronous networking delivers packets unreliably and unpredictably, and... synchronous environments to allowing asynchrony, and from tolerating crashes to tolerating some corruptions through ad-hoc consistency checks. Ad-hoc...servers are responsive. To support this thesis statement, this disseration takes the following steps. First, it develops a new cryptographic primitive

Energy-Efficient High-Performance Routers

DTIC Science & Technology

2012-02-01

award, the PI Dr. Sartaj Sahni, AFRL research scientist Dr. Gunasekaran Seetharaman, and University of Florida Ph.D. student Ms. Tania Banerjee...Sartaj Sahni, AFRL research scientist Dr. Gunasekaran Seetharaman, and University of Florida Ph.D. student Ms. Tania Banerjee-Mishra...Searching and Shift Redundancy Architecture, IJSSC, 40, 1, Jan 2005, 245-253. PC-DUOS+: A TCAM Architecture for Packet Classifiers Tania Banerjee

Frequency Count Attribute Oriented Induction of Corporate Network Data for Mapping Business Activity

NASA Astrophysics Data System (ADS)

Tanutama, Lukas

2014-03-01

Companies increasingly rely on Internet for effective and efficient business communication. As Information Technology infrastructure backbone for business activities, corporate network connects the company to Internet and enables its activities globally. It carries data packets generated by the activities of the users performing their business tasks. Traditionally, infrastructure operations mainly maintain data carrying capacity and network devices performance. It would be advantageous if a company knows what activities are running in its network. The research provides a simple method of mapping the business activity reflected by the network data. To map corporate users' activities, a slightly modified Attribute Oriented Induction (AOI) approach to mine the network data was applied. The frequency of each protocol invoked were counted to show what the user intended to do. The collected data was samples taken within a certain sampling period. Samples were taken due to the enormous data packets generated. Protocols of interest are only Internet related while intranet protocols are ignored. It can be concluded that the method could provide the management a general overview of the usage of its infrastructure and lead to efficient, effective and secure ICT infrastructure.

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.

Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle–Infrastructure Systems †

PubMed Central

Tang, Xiaolan; Hong, Donghui; Chen, Wenlong

2017-01-01

Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay. PMID:28594359

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.

Comparison Between Three Different Types of Routing Algorithms of Network on Chip

NASA Astrophysics Data System (ADS)

Soni, Neetu; Deshmukh, Khemraj

Network on Chip (NoC) is an on-chip communication technology in which a large number of processing elements and storage blocks are integrated on a single chip. Due to scalability, adaptive nature, well resource utilization NoCs have become popular in and has efficiently replaced SoCs. NoCs performance depends mainly on the type of routing algorithm chosen. In this paper three different types of routing algorithms are being compared firstly one is deterministic routing (XY routing algorithm), secondly three partially adaptive routing (West-first, North-last and Negative-first) and two adaptive routing (DyAD, OE) are being compared with respect to Packet Injection Rate (PIR) of load for random traffic pattern for 4 × 4 mesh topology. All these comparison and simulation is done in NOXIM 2.3.1 simulator which is a cycle accurate systemC based simulator. The distribution of packets is Poisson type with Buffer depth (number of buffers) of input channel FIFO is 8. Packet size is taken as 8 bytes. The simulation time is taken 50,000 cycles. We found that XY routing is better when the PIR is low. The partially adaptive routing is good when the PIR is moderate. DyAD routing is suited when the load i.e. PIR is high.

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.

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.

Performance of cellular frequency-hopped spread-spectrum radio networks

NASA Astrophysics Data System (ADS)

Gluck, Jeffrey W.; Geraniotis, Evaggelos

1989-10-01

Multiple access interference is characterized for cellular mobile networks, in which users are assumed to be Poisson-distributed in the plane and employ frequency-hopped spread-spectrum signaling with transmitter-oriented assignment of frequency-hopping patterns. Exact expressions for the bit error probabilities are derived for binary coherently demodulated systems without coding. Approximations for the packet error probability are derived for coherent and noncoherent systems and these approximations are applied when forward-error-control coding is employed. In all cases, the effects of varying interference power are accurately taken into account according to some propagation law. Numerical results are given in terms of bit error probability for the exact case and throughput for the approximate analyses. Comparisons are made with previously derived bounds and it is shown that these tend to be very pessimistic.

High-port low-latency optical switch architecture with optical feed-forward buffering for 256-node disaggregated data centers.

PubMed

Terzenidis, Nikos; Moralis-Pegios, Miltiadis; Mourgias-Alexandris, George; Vyrsokinos, Konstantinos; Pleros, Nikos

2018-04-02

Departing from traditional server-centric data center architectures towards disaggregated systems that can offer increased resource utilization at reduced cost and energy envelopes, the use of high-port switching with highly stringent latency and bandwidth requirements becomes a necessity. We present an optical switch architecture exploiting a hybrid broadcast-and-select/wavelength routing scheme with small-scale optical feedforward buffering. The architecture is experimentally demonstrated at 10Gb/s, reporting error-free performance with a power penalty of <2.5dB. Moreover, network simulations for a 256-node system, revealed low-latency values of only 605nsec, at throughput values reaching 80% when employing 2-packet-size optical buffers, while multi-rack network performance was also investigated.

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.

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.

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,…

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.

Performance of circuit switching in the Internet

NASA Astrophysics Data System (ADS)

Molinero-Fernández, Pablo; McKeown, Nick

2003-04-01

We study the performance of an Internet that uses circuit switching (CS) instead of, or in addition to, packet switching (PS). On the face of it, this would seem a pointless exercise; the Internet is packet switched, and it was deliberately built that way to enable the efficiencies afforded by statistical multiplexing and the robustness of fast rerouting around failures. But link utilization is low particularly at the core of the Internet, which makes statistical multiplexing less important than it once was. Moreover, circuit switches today are capable of rapid reconfiguration around failures. There is also renewed interest in CS because of the ease of building very-high-capacity optical circuit switches. Although several proposals have suggested ways in which CS may be introduced into the Internet, the research presented here is based on Transmission Control Protocol (TCP) switching, in which a new circuit is created for each application flow. Here we explore the performance of a network that uses TCP switching, with particular emphasis on the response time experienced by users. We use simple M/GI/1 and M/GI/N queues to model application flows in both packet-switched and circuit-switched networks, as well as ns-2 simulations. We conclude that because of high-bandwidth long-lived flows, it does not make sense to use CS in shared-access or local area networks. But our results suggest that in the core of the network, where high capacity is needed most, and where peak flow rate is limited by the access link, there is little or no difference in performance between CS and PS. Given that circuit switches can be built to be much faster than packet switches, this suggests that a circuit-switched core warrants further investigation.

Multidimensional signaling via wavelet packets

NASA Astrophysics Data System (ADS)

Lindsey, Alan R.

1995-04-01

This work presents a generalized signaling strategy for orthogonally multiplexed communication. Wavelet packet modulation (WPM) employs the basis functions from an arbitrary pruning of a full dyadic tree structured filter bank as orthogonal pulse shapes for conventional QAM symbols. The multi-scale modulation (MSM) and M-band wavelet modulation (MWM) schemes which have been recently introduced are handled as special cases, with the added benefit of an entire library of potentially superior sets of basis functions. The figures of merit are derived and it is shown that the power spectral density is equivalent to that for QAM (in fact, QAM is another special case) and hence directly applicable in existing systems employing this standard modulation. Two key advantages of this method are increased flexibility in time-frequency partitioning and an efficient all-digital filter bank implementation, making the WPM scheme more robust to a larger set of interferences (both temporal and sinusoidal) and computationally attractive as well.

An Efficient Monte Carlo Method for Modeling Radiative Transfer in Protoplanetary Disks

NASA Technical Reports Server (NTRS)

Kim, Stacy

2011-01-01

Monte Carlo methods have been shown to be effective and versatile in modeling radiative transfer processes to calculate model temperature profiles for protoplanetary disks. Temperatures profiles are important for connecting physical structure to observation and for understanding the conditions for planet formation and migration. However, certain areas of the disk such as the optically thick disk interior are under-sampled, or are of particular interest such as the snow line (where water vapor condenses into ice) and the area surrounding a protoplanet. To improve the sampling, photon packets can be preferentially scattered and reemitted toward the preferred locations at the cost of weighting packet energies to conserve the average energy flux. Here I report on the weighting schemes developed, how they can be applied to various models, and how they affect simulation mechanics and results. We find that improvements in sampling do not always imply similar improvements in temperature accuracies and calculation speeds.

Cascade defense via routing in complex networks

NASA Astrophysics Data System (ADS)

Xu, Xiao-Lan; Du, Wen-Bo; Hong, Chen

2015-05-01

As the cascading failures in networked traffic systems are becoming more and more serious, research on cascade defense in complex networks has become a hotspot in recent years. In this paper, we propose a traffic-based cascading failure model, in which each packet in the network has its own source and destination. When cascade is triggered, packets will be redistributed according to a given routing strategy. Here, a global hybrid (GH) routing strategy, which uses the dynamic information of the queue length and the static information of nodes' degree, is proposed to defense the network cascade. Comparing GH strategy with the shortest path (SP) routing, efficient routing (ER) and global dynamic (GD) routing strategies, we found that GH strategy is more effective than other routing strategies in improving the network robustness against cascading failures. Our work provides insight into the robustness of networked traffic systems.

Noise enhances information transfer in hierarchical networks.

PubMed

Czaplicka, Agnieszka; Holyst, Janusz A; Sloot, Peter M A

2013-01-01

We study the influence of noise on information transmission in the form of packages shipped between nodes of hierarchical networks. Numerical simulations are performed for artificial tree networks, scale-free Ravasz-Barabási networks as well for a real network formed by email addresses of former Enron employees. Two types of noise are considered. One is related to packet dynamics and is responsible for a random part of packets paths. The second one originates from random changes in initial network topology. We find that the information transfer can be enhanced by the noise. The system possesses optimal performance when both kinds of noise are tuned to specific values, this corresponds to the Stochastic Resonance phenomenon. There is a non-trivial synergy present for both noisy components. We found also that hierarchical networks built of nodes of various degrees are more efficient in information transfer than trees with a fixed branching factor.

Noise enhances information transfer in hierarchical networks

PubMed Central

Czaplicka, Agnieszka; Holyst, Janusz A.; Sloot, Peter M. A.

2013-01-01

We study the influence of noise on information transmission in the form of packages shipped between nodes of hierarchical networks. Numerical simulations are performed for artificial tree networks, scale-free Ravasz-Barabási networks as well for a real network formed by email addresses of former Enron employees. Two types of noise are considered. One is related to packet dynamics and is responsible for a random part of packets paths. The second one originates from random changes in initial network topology. We find that the information transfer can be enhanced by the noise. The system possesses optimal performance when both kinds of noise are tuned to specific values, this corresponds to the Stochastic Resonance phenomenon. There is a non-trivial synergy present for both noisy components. We found also that hierarchical networks built of nodes of various degrees are more efficient in information transfer than trees with a fixed branching factor. PMID:23390574

Smart home design for electronic devices monitoring based wireless gateway network using cisco packet tracer

NASA Astrophysics Data System (ADS)

Sihombing, Oloan; Zendrato, Niskarto; Laia, Yonata; Nababan, Marlince; Sitanggang, Delima; Purba, Windania; Batubara, Diarmansyah; Aisyah, Siti; Indra, Evta; Siregar, Saut

2018-04-01

In the era of technological development today, the technology has become the need for the life of today's society. One is needed to create a smart home in turning on and off electronic devices via smartphone. So far in turning off and turning the home electronic device is done by pressing the switch or remote button, so in control of electronic device control less effective. The home smart design is done by simulation concept by testing system, network configuration, and wireless home gateway computer network equipment required by a smart home network on cisco packet tracer using Internet Thing (IoT) control. In testing the IoT home network wireless network gateway system, multiple electronic devices can be controlled and monitored via smartphone based on predefined configuration conditions. With the Smart Ho me can potentially increase energy efficiency, decrease energy usage costs, control electronics and change the role of residents.

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.

Priority-based methods for reducing the impact of packet loss on HEVC encoded video streams

NASA Astrophysics Data System (ADS)

Nightingale, James; Wang, Qi; Grecos, Christos

2013-02-01

The rapid growth in the use of video streaming over IP networks has outstripped the rate at which new network infrastructure has been deployed. These bandwidth-hungry applications now comprise a significant part of all Internet traffic and present major challenges for network service providers. The situation is more acute in mobile networks where the available bandwidth is often limited. Work towards the standardisation of High Efficiency Video Coding (HEVC), the next generation video coding scheme, is currently on track for completion in 2013. HEVC offers the prospect of a 50% improvement in compression over the current H.264 Advanced Video Coding standard (H.264/AVC) for the same quality. However, there has been very little published research on HEVC streaming or the challenges of delivering HEVC streams in resource-constrained network environments. In this paper we consider the problem of adapting an HEVC encoded video stream to meet the bandwidth limitation in a mobile networks environment. Video sequences were encoded using the Test Model under Consideration (TMuC HM6) for HEVC. Network abstraction layers (NAL) units were packetized, on a one NAL unit per RTP packet basis, and transmitted over a realistic hybrid wired/wireless testbed configured with dynamically changing network path conditions and multiple independent network paths from the streamer to the client. Two different schemes for the prioritisation of RTP packets, based on the NAL units they contain, have been implemented and empirically compared using a range of video sequences, encoder configurations, bandwidths and network topologies. In the first prioritisation method the importance of an RTP packet was determined by the type of picture and the temporal switching point information carried in the NAL unit header. Packets containing parameter set NAL units and video coding layer (VCL) NAL units of the instantaneous decoder refresh (IDR) and the clean random access (CRA) pictures were given the highest priority followed by NAL units containing pictures used as reference pictures from which others can be predicted. The second method assigned a priority to each NAL unit based on the rate-distortion cost of the VCL coding units contained in the NAL unit. The sum of the rate-distortion costs of each coding unit contained in a NAL unit was used as the priority weighting. The preliminary results of extensive experiments have shown that all three schemes offered an improvement in PSNR, when comparing original and decoded received streams, over uncontrolled packet loss. Using the first method consistently delivered a significant average improvement of 0.97dB over the uncontrolled scenario while the second method provided a measurable, but less consistent, improvement across the range of testing conditions and encoder configurations.

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.

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.

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

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.

Single-hidden-layer feed-forward quantum neural network based on Grover learning.

PubMed

Liu, Cheng-Yi; Chen, Chein; Chang, Ching-Ter; Shih, Lun-Min

2013-09-01

In this paper, a novel single-hidden-layer feed-forward quantum neural network model is proposed based on some concepts and principles in the quantum theory. By combining the quantum mechanism with the feed-forward neural network, we defined quantum hidden neurons and connected quantum weights, and used them as the fundamental information processing unit in a single-hidden-layer feed-forward neural network. The quantum neurons make a wide range of nonlinear functions serve as the activation functions in the hidden layer of the network, and the Grover searching algorithm outstands the optimal parameter setting iteratively and thus makes very efficient neural network learning possible. The quantum neuron and weights, along with a Grover searching algorithm based learning, result in a novel and efficient neural network characteristic of reduced network, high efficient training and prospect application in future. Some simulations are taken to investigate the performance of the proposed quantum network and the result show that it can achieve accurate learning. Copyright © 2013 Elsevier Ltd. All rights reserved.

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

PubMed Central

Kim, Sang-Ha

2017-01-01

Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, and messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency. PMID:29053623

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.

Next generation communications satellites: multiple access and network studies

NASA Technical Reports Server (NTRS)

Meadows, H. E.; Schwartz, M.; Stern, T. E.; Ganguly, S.; Kraimeche, B.; Matsuo, K.; Gopal, I.

1982-01-01

Efficient resource allocation and network design for satellite systems serving heterogeneous user populations with large numbers of small direct-to-user Earth stations are discussed. Focus is on TDMA systems involving a high degree of frequency reuse by means of satellite-switched multiple beams (SSMB) with varying degrees of onboard processing. Algorithms for the efficient utilization of the satellite resources were developed. The effect of skewed traffic, overlapping beams and batched arrivals in packet-switched SSMB systems, integration of stream and bursty traffic, and optimal circuit scheduling in SSMB systems: performance bounds and computational complexity are discussed.

Filtering for networked control systems with single/multiple measurement packets subject to multiple-step measurement delays and multiple packet dropouts

NASA Astrophysics Data System (ADS)

Moayedi, Maryam; Foo, Yung Kuan; Chai Soh, Yeng

2011-03-01

The minimum-variance filtering problem in networked control systems, where both random measurement transmission delays and packet dropouts may occur, is investigated in this article. Instead of following the many existing results that solve the problem by using probabilistic approaches based on the probabilities of the uncertainties occurring between the sensor and the filter, we propose a non-probabilistic approach by time-stamping the measurement packets. Both single-measurement and multiple measurement packets are studied. We also consider the case of burst arrivals, where more than one packet may arrive between the receiver's previous and current sampling times; the scenario where the control input is non-zero and subject to delays and packet dropouts is examined as well. It is shown that, in such a situation, the optimal state estimate would generally be dependent on the possible control input. Simulations are presented to demonstrate the performance of the various proposed filters.

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.

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.

Scalable video transmission over Rayleigh fading channels using LDPC codes

NASA Astrophysics Data System (ADS)

Bansal, Manu; Kondi, Lisimachos P.

2005-03-01

In this paper, we investigate an important problem of efficiently utilizing the available resources for video transmission over wireless channels while maintaining a good decoded video quality and resilience to channel impairments. Our system consists of the video codec based on 3-D set partitioning in hierarchical trees (3-D SPIHT) algorithm and employs two different schemes using low-density parity check (LDPC) codes for channel error protection. The first method uses the serial concatenation of the constant-rate LDPC code and rate-compatible punctured convolutional (RCPC) codes. Cyclic redundancy check (CRC) is used to detect transmission errors. In the other scheme, we use the product code structure consisting of a constant rate LDPC/CRC code across the rows of the `blocks' of source data and an erasure-correction systematic Reed-Solomon (RS) code as the column code. In both the schemes introduced here, we use fixed-length source packets protected with unequal forward error correction coding ensuring a strictly decreasing protection across the bitstream. A Rayleigh flat-fading channel with additive white Gaussian noise (AWGN) is modeled for the transmission. The rate-distortion optimization algorithm is developed and carried out for the selection of source coding and channel coding rates using Lagrangian optimization. The experimental results demonstrate the effectiveness of this system under different wireless channel conditions and both the proposed methods (LDPC+RCPC/CRC and RS+LDPC/CRC) outperform the more conventional schemes such as those employing RCPC/CRC.

Dynamic PROOF clusters with PoD: architecture and user experience

NASA Astrophysics Data System (ADS)

Manafov, Anar

2011-12-01

PROOF on Demand (PoD) is a tool-set, which sets up a PROOF cluster on any resource management system. PoD is a user oriented product with an easy to use GUI and a command-line interface. It is fully automated. No administrative privileges or special knowledge is required to use it. PoD utilizes a plug-in system, to use different job submission front-ends. The current PoD distribution is shipped with LSF, Torque (PBS), Grid Engine, Condor, gLite, and SSH plug-ins. The product is to be extended. We therefore plan to implement a plug-in for AliEn Grid as well. Recently developed algorithms made it possible to efficiently maintain two types of connections: packet-forwarding and native PROOF connections. This helps to properly handle most kinds of workers, with and without firewalls. PoD maintains the PROOF environment automatically and, for example, prevents resource misusage in case when workers idle for too long. As PoD matures as a product and provides more plug-ins, it's used as a standard for setting up dynamic PROOF clusters in many different institutions. The GSI Analysis Facility (GSIAF) is in production since 2007. The static PROOF cluster has been phased out end of 2009. GSIAF is now completely based on PoD. Users create private dynamic PROOF clusters on the general purpose batch farm. This provides an easier resource sharing between interactive local batch and Grid usage. The main user communities are FAIR and ALICE.

Towards Reliable and Energy-Efficient Incremental Cooperative Communication for Wireless Body Area Networks.

PubMed

Yousaf, Sidrah; Javaid, Nadeem; Qasim, Umar; Alrajeh, Nabil; Khan, Zahoor Ali; Ahmed, Mansoor

2016-02-24

In this study, we analyse incremental cooperative communication for wireless body area networks (WBANs) with different numbers of relays. Energy efficiency (EE) and the packet error rate (PER) are investigated for different schemes. We propose a new cooperative communication scheme with three-stage relaying and compare it to existing schemes. Our proposed scheme provides reliable communication with less PER at the cost of surplus energy consumption. Analytical expressions for the EE of the proposed three-stage cooperative communication scheme are also derived, taking into account the effect of PER. Later on, the proposed three-stage incremental cooperation is implemented in a network layer protocol; enhanced incremental cooperative critical data transmission in emergencies for static WBANs (EInCo-CEStat). Extensive simulations are conducted to validate the proposed scheme. Results of incremental relay-based cooperative communication protocols are compared to two existing cooperative routing protocols: cooperative critical data transmission in emergencies for static WBANs (Co-CEStat) and InCo-CEStat. It is observed from the simulation results that incremental relay-based cooperation is more energy efficient than the existing conventional cooperation protocol, Co-CEStat. The results also reveal that EInCo-CEStat proves to be more reliable with less PER and higher throughput than both of the counterpart protocols. However, InCo-CEStat has less throughput with a greater stability period and network lifetime. Due to the availability of more redundant links, EInCo-CEStat achieves a reduced packet drop rate at the cost of increased energy consumption.

Towards Reliable and Energy-Efficient Incremental Cooperative Communication for Wireless Body Area Networks

PubMed Central

Yousaf, Sidrah; Javaid, Nadeem; Qasim, Umar; Alrajeh, Nabil; Khan, Zahoor Ali; Ahmed, Mansoor

2016-01-01

In this study, we analyse incremental cooperative communication for wireless body area networks (WBANs) with different numbers of relays. Energy efficiency (EE) and the packet error rate (PER) are investigated for different schemes. We propose a new cooperative communication scheme with three-stage relaying and compare it to existing schemes. Our proposed scheme provides reliable communication with less PER at the cost of surplus energy consumption. Analytical expressions for the EE of the proposed three-stage cooperative communication scheme are also derived, taking into account the effect of PER. Later on, the proposed three-stage incremental cooperation is implemented in a network layer protocol; enhanced incremental cooperative critical data transmission in emergencies for static WBANs (EInCo-CEStat). Extensive simulations are conducted to validate the proposed scheme. Results of incremental relay-based cooperative communication protocols are compared to two existing cooperative routing protocols: cooperative critical data transmission in emergencies for static WBANs (Co-CEStat) and InCo-CEStat. It is observed from the simulation results that incremental relay-based cooperation is more energy efficient than the existing conventional cooperation protocol, Co-CEStat. The results also reveal that EInCo-CEStat proves to be more reliable with less PER and higher throughput than both of the counterpart protocols. However, InCo-CEStat has less throughput with a greater stability period and network lifetime. Due to the availability of more redundant links, EInCo-CEStat achieves a reduced packet drop rate at the cost of increased energy consumption. PMID:26927104

Hit efficiency study of CMS prototype forward pixel detectors

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

Kim, Dongwook; /Johns Hopkins U.

2006-01-01

In this paper the author describes the measurement of the hit efficiency of a prototype pixel device for the CMS forward pixel detector. These pixel detectors were FM type sensors with PSI46V1 chip readout. The data were taken with the 120 GeV proton beam at Fermilab during the period of December 2004 to February 2005. The detectors proved to be highly efficient (99.27 {+-} 0.02%). The inefficiency was primarily located near the corners of the individual pixels.

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.

LANGMUIR WAVE DECAY IN INHOMOGENEOUS SOLAR WIND PLASMAS: SIMULATION RESULTS

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

Krafft, C.; Volokitin, A. S.; Krasnoselskikh, V. V., E-mail: catherine.krafft@u-psud.fr

2015-08-20

Langmuir turbulence excited by electron flows in solar wind plasmas is studied on the basis of numerical simulations. In particular, nonlinear wave decay processes involving ion-sound (IS) waves are considered in order to understand their dependence on external long-wavelength plasma density fluctuations. In the presence of inhomogeneities, it is shown that the decay processes are localized in space and, due to the differences between the group velocities of Langmuir and IS waves, their duration is limited so that a full nonlinear saturation cannot be achieved. The reflection and the scattering of Langmuir wave packets on the ambient and randomly varying density fluctuationsmore » lead to crucial effects impacting the development of the IS wave spectrum. Notably, beatings between forward propagating Langmuir waves and reflected ones result in the parametric generation of waves of noticeable amplitudes and in the amplification of IS waves. These processes, repeated at different space locations, form a series of cascades of wave energy transfer, similar to those studied in the frame of weak turbulence theory. The dynamics of such a cascading mechanism and its influence on the acceleration of the most energetic part of the electron beam are studied. Finally, the role of the decay processes in the shaping of the profiles of the Langmuir wave packets is discussed, and the waveforms calculated are compared with those observed recently on board the spacecraft Solar TErrestrial RElations Observatory and WIND.« less

Fairchild C-82 Packet Destroyed in NACA Crash Fire Tests

NASA Image and Video Library

1952-09-21

A Fairchild C-82 Packet is purposely destroyed by researchers at the National Advisory Committee for Aeronautics (NACA) Lewis Flight Propulsion Laboratory. In response to an escalating number of transport aircraft crashes in the mid-1940s, the NACA researchers undertook a decade-long investigation into a number of issues surrounding low-altitude aircraft crashes. The tests were conducted at the Ravenna Arsenal, approximately 60 miles south of the Lewis laboratory in Cleveland, Ohio. The aircraft were excess military transports from World War II. The aircraft was guided down the runway at speeds of 80 to 105 miles per hour. It came into contact with poles which tore open the 1500-gallon fuel tanks in the wings before reaching the barriers at the end of the runway. Fuel poured from the tanks and supply lines, resulting in the spread of both liquid fuel and a large cloud of spray. Solomon Weiss developed a method of dying the fuel red to improve its visibility during the crashes. This red fuel cloud trailed slightly behind the skidding aircraft, then rushed forward when the aircraft stopped. The nine-crash initial phase of testing used Lockheed C-56 Lodestar and C-82 transport aircraft to identify potential ignition sources and analyze the spread of flammable materials. The researchers were able to identify different classes of ignition sources, fuel disbursement patterns, the time when a particular ignition source might appear, rate of the fire spread, cabin survival times, and deceleration rates.

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.

Control of chemical dynamics by lasers: theoretical considerations.

PubMed

Kondorskiy, Alexey; Nanbu, Shinkoh; Teranishi, Yoshiaki; Nakamura, Hiroki

2010-06-03

Theoretical ideas are proposed for laser control of chemical dynamics. There are the following three elementary processes in chemical dynamics: (i) motion of the wave packet on a single adiabatic potential energy surface, (ii) excitation/de-excitation or pump/dump of wave packet, and (iii) nonadiabatic transitions at conical intersections of potential energy surfaces. A variety of chemical dynamics can be controlled, if we can control these three elementary processes as we desire. For (i) we have formulated the semiclassical guided optimal control theory, which can be applied to multidimensional real systems. The quadratic or periodic frequency chirping method can achieve process (ii) with high efficiency close to 100%. Concerning process (iii) mentioned above, the directed momentum method, in which a predetermined momentum vector is given to the initial wave packet, makes it possible to enhance the desired transitions at conical intersections. In addition to these three processes, the intriguing phenomenon of complete reflection in the nonadiabatic-tunneling-type of potential curve crossing can also be used to control a certain class of chemical dynamics. The basic ideas and theoretical formulations are provided for the above-mentioned processes. To demonstrate the effectiveness of these controlling methods, numerical examples are shown by taking the following processes: (a) vibrational photoisomerization of HCN, (b) selective and complete excitation of the fine structure levels of K and Cs atoms, (c) photoconversion of cyclohexadiene to hexatriene, and (d) photodissociation of OHCl to O + HCl.

An Approach for On-Board Software Building Blocks Cooperation and Interfaces Definition

NASA Astrophysics Data System (ADS)

Pascucci, Dario; Campolo, Giovanni; Candia, Sante; Lisio, Giovanni

2010-08-01

This paper provides an insight on the Avionic SW architecture developed by Thales Alenia Space Italy (TAS-I) to achieve structuring of the OBSW as a set of self-standing and re-usable building blocks. It is initially described the underlying framework for building blocks cooperation, which is based on ECSSE-70 packets forwarding (for services request to a building block) and standard parameters exchange for data communication. Subsequently it is discussed the high level of flexibility and scalability of the resulting architecture, reporting as example an implementation of the Failure Detection, Isolation and Recovery (FDIR) function which exploits the proposed architecture. The presented approach evolves from avionic SW architecture developed in the scope of the project PRIMA (Mult-Purpose Italian Re-configurable Platform) and has been adopted for the Sentinel-1 Avionic Software (ASW).

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

Efficient packet transportation on complex networks with nonuniform node capacity distribution

NASA Astrophysics Data System (ADS)

He, Xuan; Niu, Kai; He, Zhiqiang; Lin, Jiaru; Jiang, Zhong-Yuan

2015-03-01

Provided that node delivery capacity may be not uniformly distributed in many realistic networks, we present a node delivery capacity distribution in which each node capacity is composed of uniform fraction and degree related proportion. Based on the node delivery capacity distribution, we construct a novel routing mechanism called efficient weighted routing (EWR) strategy to enhance network traffic capacity and transportation efficiency. Compared with the shortest path routing and the efficient routing strategies, the EWR achieves the highest traffic capacity. After investigating average path length, network diameter, maximum efficient betweenness, average efficient betweenness, average travel time and average traffic load under extensive simulations, it indicates that the EWR appears to be a very effective routing method. The idea of this routing mechanism gives us a good insight into network science research. The practical use of this work is prospective in some real complex systems such as the Internet.

Hot Swapping Protocol Implementations in the OPNET Modeler Development Environment

DTIC Science & Technology

2008-03-01

components. Unfortunately, this style is not efficient or particularly human–readable. Even purely pedagogical scenarios consisting of a client and a...definition provided by the mock object. sion of this kernel procedure steers all packets sent with op pk deliver() to the unit testing’s specialized...forms of development. Moreover, batteries of unit tests could ship with the accompanying process models and serve as robust regression tests

Cluster-based adaptive power control protocol using Hidden Markov Model for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Vinutha, C. B.; Nalini, N.; Nagaraja, M.

2017-06-01

This paper presents strategies for an efficient and dynamic transmission power control technique, in order to reduce packet drop and hence energy consumption of power-hungry sensor nodes operated in highly non-linear channel conditions of Wireless Sensor Networks. Besides, we also focus to prolong network lifetime and scalability by designing cluster-based network structure. Specifically we consider weight-based clustering approach wherein, minimum significant node is chosen as Cluster Head (CH) which is computed stemmed from the factors distance, remaining residual battery power and received signal strength (RSS). Further, transmission power control schemes to fit into dynamic channel conditions are meticulously implemented using Hidden Markov Model (HMM) where probability transition matrix is formulated based on the observed RSS measurements. Typically, CH estimates initial transmission power of its cluster members (CMs) from RSS using HMM and broadcast this value to its CMs for initialising their power value. Further, if CH finds that there are variations in link quality and RSS of the CMs, it again re-computes and optimises the transmission power level of the nodes using HMM to avoid packet loss due noise interference. We have demonstrated our simulation results to prove that our technique efficiently controls the power levels of sensing nodes to save significant quantity of energy for different sized network.

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

Power-efficient distributed resource allocation under goodput QoS constraints for heterogeneous networks

NASA Astrophysics Data System (ADS)

Andreotti, Riccardo; Del Fiorentino, Paolo; Giannetti, Filippo; Lottici, Vincenzo

2016-12-01

This work proposes a distributed resource allocation (RA) algorithm for packet bit-interleaved coded OFDM transmissions in the uplink of heterogeneous networks (HetNets), characterized by small cells deployed over a macrocell area and sharing the same band. Every user allocates its transmission resources, i.e., bits per active subcarrier, coding rate, and power per subcarrier, to minimize the power consumption while both guaranteeing a target quality of service (QoS) and accounting for the interference inflicted by other users transmitting over the same band. The QoS consists of the number of information bits delivered in error-free packets per unit of time, or goodput (GP), estimated at the transmitter by resorting to an efficient effective SNR mapping technique. First, the RA problem is solved in the point-to-point case, thus deriving an approximate yet accurate closed-form expression for the power allocation (PA). Then, the interference-limited HetNet case is examined, where the RA problem is described as a non-cooperative game, providing a solution in terms of generalized Nash equilibrium. Thanks to the closed-form of the PA, the solution analysis is based on the best response concept. Hence, sufficient conditions for existence and uniqueness of the solution are analytically derived, along with a distributed algorithm capable of reaching the game equilibrium.

Prioritized Degree Distribution in Wireless Sensor Networks with a Network Coded Data Collection Method

PubMed Central

Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng

2012-01-01

The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious ‘cliff effect’ may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the ‘cliff effect’ is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected. PMID:23235451

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.

zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm.

PubMed

Sand, Andreas; Kristiansen, Martin; Pedersen, Christian N S; Mailund, Thomas

2013-11-22

Hidden Markov models are widely used for genome analysis as they combine ease of modelling with efficient analysis algorithms. Calculating the likelihood of a model using the forward algorithm has worst case time complexity linear in the length of the sequence and quadratic in the number of states in the model. For genome analysis, however, the length runs to millions or billions of observations, and when maximising the likelihood hundreds of evaluations are often needed. A time efficient forward algorithm is therefore a key ingredient in an efficient hidden Markov model library. We have built a software library for efficiently computing the likelihood of a hidden Markov model. The library exploits commonly occurring substrings in the input to reuse computations in the forward algorithm. In a pre-processing step our library identifies common substrings and builds a structure over the computations in the forward algorithm which can be reused. This analysis can be saved between uses of the library and is independent of concrete hidden Markov models so one preprocessing can be used to run a number of different models.Using this library, we achieve up to 78 times shorter wall-clock time for realistic whole-genome analyses with a real and reasonably complex hidden Markov model. In one particular case the analysis was performed in less than 8 minutes compared to 9.6 hours for the previously fastest library. We have implemented the preprocessing procedure and forward algorithm as a C++ library, zipHMM, with Python bindings for use in scripts. The library is available at http://birc.au.dk/software/ziphmm/.

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

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.

Modular Energy-Efficient and Robust Paradigms for a Disaster-Recovery Process over Wireless Sensor Networks

PubMed Central

Razaque, Abdul; Elleithy, Khaled

2015-01-01

Robust paradigms are a necessity, particularly for emerging wireless sensor network (WSN) applications. The lack of robust and efficient paradigms causes a reduction in the provision of quality of service (QoS) and additional energy consumption. In this paper, we introduce modular energy-efficient and robust paradigms that involve two archetypes: (1) the operational medium access control (O-MAC) hybrid protocol and (2) the pheromone termite (PT) model. The O-MAC protocol controls overhearing and congestion and increases the throughput, reduces the latency and extends the network lifetime. O-MAC uses an optimized data frame format that reduces the channel access time and provides faster data delivery over the medium. Furthermore, O-MAC uses a novel randomization function that avoids channel collisions. The PT model provides robust routing for single and multiple links and includes two new significant features: (1) determining the packet generation rate to avoid congestion and (2) pheromone sensitivity to determine the link capacity prior to sending the packets on each link. The state-of-the-art research in this work is based on improving both the QoS and energy efficiency. To determine the strength of O-MAC with the PT model; we have generated and simulated a disaster recovery scenario using a network simulator (ns-3.10) that monitors the activities of disaster recovery staff; hospital staff and disaster victims brought into the hospital. Moreover; the proposed paradigm can be used for general purpose applications. Finally; the QoS metrics of the O-MAC and PT paradigms are evaluated and compared with other known hybrid protocols involving the MAC and routing features. The simulation results indicate that O-MAC with PT produced better outcomes. PMID:26153768

Modular Energy-Efficient and Robust Paradigms for a Disaster-Recovery Process over Wireless Sensor Networks.

PubMed

Razaque, Abdul; Elleithy, Khaled

2015-07-06

Robust paradigms are a necessity, particularly for emerging wireless sensor network (WSN) applications. The lack of robust and efficient paradigms causes a reduction in the provision of quality of service (QoS) and additional energy consumption. In this paper, we introduce modular energy-efficient and robust paradigms that involve two archetypes: (1) the operational medium access control (O-MAC) hybrid protocol and (2) the pheromone termite (PT) model. The O-MAC protocol controls overhearing and congestion and increases the throughput, reduces the latency and extends the network lifetime. O-MAC uses an optimized data frame format that reduces the channel access time and provides faster data delivery over the medium. Furthermore, O-MAC uses a novel randomization function that avoids channel collisions. The PT model provides robust routing for single and multiple links and includes two new significant features: (1) determining the packet generation rate to avoid congestion and (2) pheromone sensitivity to determine the link capacity prior to sending the packets on each link. The state-of-the-art research in this work is based on improving both the QoS and energy efficiency. To determine the strength of O-MAC with the PT model; we have generated and simulated a disaster recovery scenario using a network simulator (ns-3.10) that monitors the activities of disaster recovery staff; hospital staff and disaster victims brought into the hospital. Moreover; the proposed paradigm can be used for general purpose applications. Finally; the QoS metrics of the O-MAC and PT paradigms are evaluated and compared with other known hybrid protocols involving the MAC and routing features. The simulation results indicate that O-MAC with PT produced better outcomes.

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.

A new potential energy surface of the OH2+ system and state-to-state quantum dynamics studies of the O+ + H2 reaction.

PubMed

Li, Wentao; Yuan, Jiuchuang; Yuan, Meiling; Zhang, Yong; Yao, Minghai; Sun, Zhigang

2018-01-03

A new global potential energy surface (PES) of the O + + H 2 system was constructed with the permutation invariant polynomial neural network method, using about 63 000 ab initio points, which were calculated by employing the multi-reference configuration interaction method with aug-cc-pVTZ and aug-cc-pVQZ basis sets. For improving the accuracy of the PES, the basis set was extrapolated to the complete basis set limit by the two-point extrapolation method. The root mean square error of fitting was only 5.28 × 10 -3 eV. The spectroscopic constants of the diatomic molecules were calculated and compared with previous theoretical and experimental results, which suggests that the present results agree well with the experiment. On the newly constructed PES, reaction dynamics studies were performed using the time-dependent wave packet method. The calculated integral cross sections (ICSs) were compared with the available theoretical and experimental results, where a good agreement with the experimental data was seen. Significant forward and backward scatterings were observed in the whole collision energy region studied. At the same time, the differential cross sections biased the forward scattering, especially at higher collision energies.

Real-Time Station Grouping under Dynamic Traffic for IEEE 802.11ah

PubMed Central

Tian, Le; Latré, Steven

2017-01-01

IEEE 802.11ah, marketed as Wi-Fi HaLow, extends Wi-Fi to the sub-1 GHz spectrum. Through a number of physical layer (PHY) and media access control (MAC) optimizations, it aims to bring greatly increased range, energy-efficiency, and scalability. This makes 802.11ah the perfect candidate for providing connectivity to Internet of Things (IoT) devices. One of these new features, referred to as the Restricted Access Window (RAW), focuses on improving scalability in highly dense deployments. RAW divides stations into groups and reduces contention and collisions by only allowing channel access to one group at a time. However, the standard does not dictate how to determine the optimal RAW grouping parameters. The optimal parameters depend on the current network conditions, and it has been shown that incorrect configuration severely impacts throughput, latency and energy efficiency. In this paper, we propose a traffic-adaptive RAW optimization algorithm (TAROA) to adapt the RAW parameters in real time based on the current traffic conditions, optimized for sensor networks in which each sensor transmits packets with a certain (predictable) frequency and may change the transmission frequency over time. The TAROA algorithm is executed at each target beacon transmission time (TBTT), and it first estimates the packet transmission interval of each station only based on packet transmission information obtained by access point (AP) during the last beacon interval. Then, TAROA determines the RAW parameters and assigns stations to RAW slots based on this estimated transmission frequency. The simulation results show that, compared to enhanced distributed channel access/distributed coordination function (EDCA/DCF), the TAROA algorithm can highly improve the performance of IEEE 802.11ah dense networks in terms of throughput, especially when hidden nodes exist, although it does not always achieve better latency performance. This paper contributes with a practical approach to optimizing RAW grouping under dynamic traffic in real time, which is a major leap towards applying RAW mechanism in real-life IoT networks. PMID:28677617

Real-Time Station Grouping under Dynamic Traffic for IEEE 802.11ah.

PubMed

Tian, Le; Khorov, Evgeny; Latré, Steven; Famaey, Jeroen

2017-07-04

IEEE 802.11ah, marketed as Wi-Fi HaLow, extends Wi-Fi to the sub-1 GHz spectrum. Through a number of physical layer (PHY) and media access control (MAC) optimizations, it aims to bring greatly increased range, energy-efficiency, and scalability. This makes 802.11ah the perfect candidate for providing connectivity to Internet of Things (IoT) devices. One of these new features, referred to as the Restricted Access Window (RAW), focuses on improving scalability in highly dense deployments. RAW divides stations into groups and reduces contention and collisions by only allowing channel access to one group at a time. However, the standard does not dictate how to determine the optimal RAW grouping parameters. The optimal parameters depend on the current network conditions, and it has been shown that incorrect configuration severely impacts throughput, latency and energy efficiency. In this paper, we propose a traffic-adaptive RAW optimization algorithm (TAROA) to adapt the RAW parameters in real time based on the current traffic conditions, optimized for sensor networks in which each sensor transmits packets with a certain (predictable) frequency and may change the transmission frequency over time. The TAROA algorithm is executed at each target beacon transmission time (TBTT), and it first estimates the packet transmission interval of each station only based on packet transmission information obtained by access point (AP) during the last beacon interval. Then, TAROA determines the RAW parameters and assigns stations to RAW slots based on this estimated transmission frequency. The simulation results show that, compared to enhanced distributed channel access/distributed coordination function (EDCA/DCF), the TAROA algorithm can highly improve the performance of IEEE 802.11ah dense networks in terms of throughput, especially when hidden nodes exist, although it does not always achieve better latency performance. This paper contributes with a practical approach to optimizing RAW grouping under dynamic traffic in real time, which is a major leap towards applying RAW mechanism in real-life IoT networks.

Mobile Router Developed and Tested

NASA Technical Reports Server (NTRS)

Ivancic, William D.

2002-01-01

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

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

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.

Coverage-maximization in networks under resource constraints.

PubMed

Nandi, Subrata; Brusch, Lutz; Deutsch, Andreas; Ganguly, Niloy

2010-06-01

Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T . Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating message packets and temporally modulated proliferation rate. The algorithm performs as efficiently as a single random walker but O(B(d-2)/d) times faster, resulting in significant service speed-up on a regular grid of dimension d . The algorithm is numerically compared to a class of generalized proliferating random walk strategies and on regular grids shown to perform best in terms of the product metric of speed and efficiency.

Kolakoski sequence as an element to radiate giant forward and backward second harmonic signals

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

Parvini, T. S.; Tehranchi, M. M., E-mail: m-hamidi@sbu.ac.ir, E-mail: teranchi@sbu.ac.ir; Laser and Plasma Research Institute, Shahid Beheshti University, Tehran

2015-11-14

We propose a novel type of aperiodic one-dimensional photonic crystal structures which can be used for generating giant forward and backward second harmonic signals. The studied structure is formed by stacking together the air and nonlinear layers according to the Kolakoski self-generation scheme in which each nonlinear layer contains a pair of antiparallel 180° poled LiNbO{sub 3} crystal layers. For different generation stages of the structure, conversion efficiencies of forward and backward second harmonic waves have been calculated by nonlinear transfer matrix method. Numerical simulations show that conversion efficiencies in the Kolakoski-based multilayer are larger than the perfect ones formore » at least one order of magnitude. Especially for 33rd and 39th generation stages, forward second harmonic wave are 42 and 19 times larger, respectively. In this paper, we validate the strong fundamental field enhancement and localization within Kolakoski-based multilayer due to periodicity breaking which consequently leads to very strong radiation of backward and forward second harmonic signals. Following the applications of analogous aperiodic structures, we expect that Kolakosi-based multilayer can play a role in optical parametric devices such as multicolor second harmonic generators with high efficiency.« less

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.

Synchronous Half-Wave Rectifier

NASA Technical Reports Server (NTRS)

Rippel, Wally E.

1989-01-01

Synchronous rectifying circuit behaves like diode having unusually low voltage drop during forward-voltage half cycles. Circuit particularly useful in power supplies with potentials of 5 Vdc or less, where normal forward-voltage drops in ordinary diodes unacceptably large. Fabricated as monolithic assembly or as hybrid. Synchronous half-wave rectifier includes active circuits to attain low forward voltage drop and high rectification efficiency.

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.

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.

Ingestion of Laundry Detergent Packets in Children.

PubMed

Shah, Lindsey Wilson

2016-08-01

Ingestion of laundry detergent packets is an important threat to young children. Because of their developmental stage, toddlers are prone to place these small, colorful packets in their mouths. The packets can easily burst, sending a large volume of viscous, alkaline liquid throughout the oropharynx. Ingestion causes major toxic effects, including depression of the central nervous system, metabolic acidosis, respiratory distress, and dysphagia. Critical care nurses should anticipate these clinical effects and facilitate prompt intervention. Increased understanding of the risks and clinical effects of ingestion of laundry detergent packets will better prepare critical care nurses to provide care for these children. (Critical Care Nurse 2016; 36[4]:70-75). ©2016 American Association of Critical-Care Nurses.

Event-Driven Simulation and Analysis of an Underwater Acoustic Local Area Network

DTIC Science & Technology

2010-06-01

Successful number of data packets % b. PSUP = Successful number of Utility packets % c. PSB = Successful number of byte Tx. % d. PSPRT = Number of sub...g. PFU = Number of failed utilities Tx failures with time log of failure % h. PTO = Number of Time-outs 55 function [PSDP,PSUP, PSB ,PSPRT,PFP,PFSP...transmitted PSB = 0 ; % Number of Bytes transmitted PSPRT = 0; % Number of sub-packets retransmitted PFP = 0; % Number of failed packets event PFSP

Fast packet switch architectures for broadband integrated services digital networks

NASA Technical Reports Server (NTRS)

Tobagi, Fouad A.

1990-01-01

Background information on networking and switching is provided, and the various architectures that have been considered for fast packet switches are described. The focus is solely on switches designed to be implemented electronically. A set of definitions and a brief description of the functionality required of fast packet switches are given. Three basic types of packet switches are identified: the shared-memory, shared-medium, and space-division types. Each of these is described, and examples are given.

Identification of Low-Latency Obfuscated Traffic Using Multi-Attribute Analysis

DTIC Science & Technology

2017-03-01

the distribution of common Tor packet sizes. Herrmann et al. also contend that the remaining variations in observed packet sizes are caused by OS...specific fragmentation and that Tor’s variation in packet size provides an additional level of protection as the false positive rate (FPR) using packet...three pre-filter variations , the observed FPR for non-Tor ranged from 94.4 percent to 7.2 percent, and the observed FNR for Tor ranged from 61.3

"Ms. B changes doctors": using a comic and patient transition packet to engineer patient-oriented clinic handoffs (EPOCH).

PubMed

Pincavage, Amber T; Lee, Wei Wei; Venable, Laura Ruth; Prochaska, Megan; Staisiunas, Daina D; Beiting, Kimberly J; Czerweic, M K; Oyler, Julie; Vinci, Lisa M; Arora, Vineet M

2015-02-01

Few patient-centered interventions exist to improve year-end residency clinic handoffs. Our purpose was to assess the impact of a patient-centered transition packet and comic on clinic handoff outcomes. The study was conducted at an academic medicine residency clinic. Participants were patients undergoing resident clinic handoff 2011-2013 PROGRAM DESCRIPTION: Two months before the 2012 handoff, patients received a "transition packet" incorporating patient-identified solutions (i.e., a new primary care provider (PCP) welcome letter with photo, certificate of recognition, and visit preparation tool). In 2013, a comic was incorporated to stress the importance of follow-up. Patients were interviewed by phone with response rates of 32 % in 2011, 43 % in 2012 and 36 % in 2013. Most patients who were interviewed were aware of the handoff post-packet (95 %). With the comic, more patients recalled receiving the packet (44 % 2012 vs. 64 % 2013, p< 0.001) and correctly identified their new PCP (77 % 2012 vs. 98 % 2013, p< 0.001). Among patients recalling the packet, most (70 % 2012; 65 % 2013) agreed it helped them establish rapport. Both years, fewer patients missed their first new PCP visit (43 % in 2011, 31 % in 2012 and 26 % in 2013, p< 0.001). A patient-centered transition packet helped prepare patients for clinic handoffs. The comic was associated with increased packet recall and improved follow-up rates.

A packet-based dual-rate PID control strategy for a slow-rate sensing Networked Control System.

PubMed

Cuenca, A; Alcaina, J; Salt, J; Casanova, V; Pizá, R

2018-05-01

This paper introduces a packet-based dual-rate control strategy to face time-varying network-induced delays, packet dropouts and packet disorder in a Networked Control System. Slow-rate sensing enables to achieve energy saving and to avoid packet disorder. Fast-rate actuation makes reaching the desired control performance possible. The dual-rate PID controller is split into two parts: a slow-rate PI controller located at the remote side (with no permanent communication to the plant) and a fast-rate PD controller located at the local side. The remote side also includes a prediction stage in order to generate the packet of future, estimated slow-rate control actions. These actions are sent to the local side and converted to fast-rate ones to be used when a packet does not arrive at this side due to the network-induced delay or due to occurring dropouts. The proposed control solution is able to approximately reach the nominal (no-delay, no-dropout) performance despite the existence of time-varying delays and packet dropouts. Control system stability is ensured in terms of probabilistic Linear Matrix Inequalities (LMIs). Via real-time control for a Cartesian robot, results clearly reveal the superiority of the control solution compared to a previous proposal by authors. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Role of Feshbach resonances in enhancing the production of deeply bound ultracold LiRb molecules with laser pulses

NASA Astrophysics Data System (ADS)

Gacesa, Marko; Ghosal, Subhas; Côté, Robin

2010-03-01

We investigate the possibility of forming deeply bound LiRb molecules in a two-color photoassociation experiment. Ultracold ^6Li and ^87Rb atoms colliding in the vicinity of a magnetic Feshbach resonance are photoassociated into an excited electronic state. A wavepacket is then formed by exciting a few vibrational levels of the excited state and allowed to propagate. We calculate the time-dependent overlaps between the wave packet and the lowest vibrational levels of the ground state. After the optimal overlap is obtained we use the second laser pulse to dump the wave packet and efficiently populate the deeply bound ro-vibrational levels of ^6Li^87Rb in the ground state. The resulting combination of Feshbach-optimized photoassociation (FOPA) with the time-dependent pump-dump approach will produce a large number of stable ultracold molecules in the ground state. This technique is general and applicable to other systems.

Single-electron pulses for ultrafast diffraction

PubMed Central

Aidelsburger, M.; Kirchner, F. O.; Krausz, F.; Baum, P.

2010-01-01

Visualization of atomic-scale structural motion by ultrafast electron diffraction and microscopy requires electron packets of shortest duration and highest coherence. We report on the generation and application of single-electron pulses for this purpose. Photoelectric emission from metal surfaces is studied with tunable ultraviolet pulses in the femtosecond regime. The bandwidth, efficiency, coherence, and electron pulse duration are investigated in dependence on excitation wavelength, intensity, and laser bandwidth. At photon energies close to the cathode’s work function, the electron pulse duration shortens significantly and approaches a threshold that is determined by interplay of the optical pulse width and the acceleration field. An optimized choice of laser wavelength and bandwidth results in sub-100-fs electron pulses. We demonstrate single-electron diffraction from polycrystalline diamond films and reveal the favorable influences of matched photon energies on the coherence volume of single-electron wave packets. We discuss the consequences of our findings for the physics of the photoelectric effect and for applications of single-electron pulses in ultrafast 4D imaging of structural dynamics. PMID:21041681

Driver drowsiness classification using fuzzy wavelet-packet-based feature-extraction algorithm.

PubMed

Khushaba, Rami N; Kodagoda, Sarath; Lal, Sara; Dissanayake, Gamini

2011-01-01

Driver drowsiness and loss of vigilance are a major cause of road accidents. Monitoring physiological signals while driving provides the possibility of detecting and warning of drowsiness and fatigue. The aim of this paper is to maximize the amount of drowsiness-related information extracted from a set of electroencephalogram (EEG), electrooculogram (EOG), and electrocardiogram (ECG) signals during a simulation driving test. Specifically, we develop an efficient fuzzy mutual-information (MI)- based wavelet packet transform (FMIWPT) feature-extraction method for classifying the driver drowsiness state into one of predefined drowsiness levels. The proposed method estimates the required MI using a novel approach based on fuzzy memberships providing an accurate-information content-estimation measure. The quality of the extracted features was assessed on datasets collected from 31 drivers on a simulation test. The experimental results proved the significance of FMIWPT in extracting features that highly correlate with the different drowsiness levels achieving a classification accuracy of 95%-- 97% on an average across all subjects.

Spectro-spatial analysis of wave packet propagation in nonlinear acoustic metamaterials

NASA Astrophysics Data System (ADS)

Zhou, W. J.; Li, X. P.; Wang, Y. S.; Chen, W. Q.; Huang, G. L.

2018-01-01

The objective of this work is to analyze wave packet propagation in weakly nonlinear acoustic metamaterials and reveal the interior nonlinear wave mechanism through spectro-spatial analysis. The spectro-spatial analysis is based on full-scale transient analysis of the finite system, by which dispersion curves are generated from the transmitted waves and also verified by the perturbation method (the L-P method). We found that the spectro-spatial analysis can provide detailed information about the solitary wave in short-wavelength region which cannot be captured by the L-P method. It is also found that the optical wave modes in the nonlinear metamaterial are sensitive to the parameters of the nonlinear constitutive relation. Specifically, a significant frequency shift phenomenon is found in the middle-wavelength region of the optical wave branch, which makes this frequency region behave like a band gap for transient waves. This special frequency shift is then used to design a direction-biased waveguide device, and its efficiency is shown by numerical simulations.

A network monitor for HTTPS protocol based on proxy

NASA Astrophysics Data System (ADS)

Liu, Yangxin; Zhang, Lingcui; Zhou, Shuguang; Li, Fenghua

2016-10-01

With the explosive growth of harmful Internet information such as pornography, violence, and hate messages, network monitoring is essential. Traditional network monitors is based mainly on bypass monitoring. However, we can't filter network traffic using bypass monitoring. Meanwhile, only few studies focus on the network monitoring for HTTPS protocol. That is because HTTPS data is in the encrypted traffic, which makes it difficult to monitor. This paper proposes a network monitor for HTTPS protocol based on proxy. We adopt OpenSSL to establish TLS secure tunes between clients and servers. Epoll is used to handle a large number of concurrent client connections. We also adopt Knuth- Morris-Pratt string searching algorithm (or KMP algorithm) to speed up the search process. Besides, we modify request packets to reduce the risk of errors and modify response packets to improve security. Experiments show that our proxy can monitor the content of all tested HTTPS websites efficiently with little loss of network performance.

High speed packet switching

NASA Technical Reports Server (NTRS)

1991-01-01

This document constitutes the final report prepared by Proteon, Inc. of Westborough, Massachusetts under contract NAS 5-30629 entitled High-Speed Packet Switching (SBIR 87-1, Phase 2) prepared for NASA-Greenbelt, Maryland. The primary goal of this research project is to use the results of the SBIR Phase 1 effort to develop a sound, expandable hardware and software router architecture capable of forwarding 25,000 packets per second through the router and passing 300 megabits per second on the router's internal busses. The work being delivered under this contract received its funding from three different sources: the SNIPE/RIG contract (Contract Number F30602-89-C-0014, CDRL Sequence Number A002), the SBIR contract, and Proteon. The SNIPE/RIG and SBIR contracts had many overlapping requirements, which allowed the research done under SNIPE/RIG to be applied to SBIR. Proteon funded all of the work to develop new router interfaces other than FDDI, in addition to funding the productization of the router itself. The router being delivered under SBIR will be a fully product-quality machine. The work done during this contract produced many significant findings and results, summarized here and explained in detail in later sections of this report. The SNIPE/RIG contract was completed. That contract had many overlapping requirements with the SBIR contract, and resulted in the successful demonstration and delivery of a high speed router. The development that took place during the SNIPE/RIG contract produced findings that included the choice of processor and an understanding of the issues surrounding inter processor communications in a multiprocessor environment. Many significant speed enhancements to the router software were made during that time. Under the SBIR contract (and with help from Proteon-funded work), it was found that a single processor router achieved a throughput significantly higher than originally anticipated. For this reason, a single processor router was developed and the final delivery under this contract will include a single processor CNX-500 router. The router and its interface boards (2 FDDIs and 2 dual-ethernets) are all product-quality components.

Performance Evaluation of INMARSAT Fleet 77 Services Aboard the R/V Ewing

NASA Astrophysics Data System (ADS)

Schmidt, V. E.; Chayes, D. N.; Gold, E.

2002-12-01

In late 2001, the R/V Ewing was asked to conduct a trial installation of the Thrane and Thrane [of Denmark] F77 antennae [TT-3084A Capsat] and the newest IMNARSAT communications channel, INMARSAT F. Branded as "Fleet F77 Service" by INMARSAT, the service provides ISDN 64kbps and 56kbps high quality voice and data connections as well as Mobile Packet Data Service which allows an "always on" connection under which users pay for the packets they send rather than the time they are connected. Fleet F77 also allows low bandwidth [2.4kbps] "Mini-M" voice and fax services. While not currently available, the Capsat antennae also is prepared to take advantage of 4th Generation Inm-IV satellites [expected in 2004] allowing LAN speeds up to 432kbps. The F77 antenna consists of two units, the TT-3084A antenna and a single "Below Deck Unit". The Capsat antennae radome is a mere 84 cm in diameter - considerably smaller than that typically associated with INMARSAT A or B. It was mounted above the forward port corner of the pilot house atop a reinforced mast. Below deck electronics consist of a single unit containing three analog RJ-11 interfaces, a single ISDN interface, two RS-232 serial interfaces, a USB interface [not functional on our test unit] and a standard Handset. This was mounted in the pilot house electronics space. The Capsat antennae and associated electronics were installed in Guam in mid February 2002 and the system began operational trials during the following cruise on February 24th. Tests of the Fleet 77 system consisted of Mini-M voice and fax both to and from the ship, 64kbs voice to and from the ship, MPDS connects to shore, and operational tests with the INMARSAT Command Center. The trial period completed May 12th after which the F77 became an integral part of the Ewing's communication suite. Results of these tests as well as latency and packet loss measurements made over various data connection types will be presented.

Gradient Self-Doped CuBi2O4 with Highly Improved Charge Separation Efficiency.

PubMed

Wang, Fuxian; Septina, Wilman; Chemseddine, Abdelkrim; Abdi, Fatwa F; Friedrich, Dennis; Bogdanoff, Peter; van de Krol, Roel; Tilley, S David; Berglund, Sean P

2017-10-25

A new strategy of using forward gradient self-doping to improve the charge separation efficiency in metal oxide photoelectrodes is proposed. Gradient self-doped CuBi 2 O 4 photocathodes are prepared with forward and reverse gradients in copper vacancies using a two-step, diffusion-assisted spray pyrolysis process. Decreasing the Cu/Bi ratio of the CuBi 2 O 4 photocathodes introduces Cu vacancies that increase the carrier (hole) concentration and lowers the Fermi level, as evidenced by a shift in the flat band toward more positive potentials. Thus, a gradient in Cu vacancies leads to an internal electric field within CuBi 2 O 4 , which can facilitate charge separation. Compared to homogeneous CuBi 2 O 4 photocathodes, CuBi 2 O 4 photocathodes with a forward gradient show highly improved charge separation efficiency and enhanced photoelectrochemical performance for reduction reactions, while CuBi 2 O 4 photocathodes with a reverse gradient show significantly reduced charge separation efficiency and photoelectrochemical performance. The CuBi 2 O 4 photocathodes with a forward gradient produce record AM 1.5 photocurrent densities for CuBi 2 O 4 up to -2.5 mA/cm 2 at 0.6 V vs RHE with H 2 O 2 as an electron scavenger, and they show a charge separation efficiency of 34% for 550 nm light. The gradient self-doping accomplishes this without the introduction of external dopants, and therefore the tetragonal crystal structure and carrier mobility of CuBi 2 O 4 are maintained. Lastly, forward gradient self-doped CuBi 2 O 4 photocathodes are protected with a CdS/TiO 2 heterojunction and coated with Pt as an electrocatalyst. These photocathodes demonstrate photocurrent densities on the order of -1.0 mA/cm 2 at 0.0 V vs RHE and evolve hydrogen with a faradaic efficiency of ∼91%.

Payload Instrument Design Rules for Safe and Efficient Flight Operations

NASA Astrophysics Data System (ADS)

Montagnon, E.; Ferri, P.

2004-04-01

Payload operations are often being neglected in favour of optimisation of scientific performance of the instrument design. This has major drawbacks in terms of cost, safety, efficiency of operations and finally science return. By taking operational aspects into account in the early phases of the instrument design, with a minimum more cultural than financial or technological additional effort, many problems can be avoided or minimized, with significant benefits to be gained in the mission execution phases. This paper presents possible improvements based on the use of the telemetry and telecommand packet standard, proper sharing of autonomy functions between instrument and platform, and enhanced interface documents.

Instrument for measurement of vacuum in sealed thin wall packets

DOEpatents

Kollie, T.G.; Thacker, L.H.; Fine, H.A.

1995-04-18

An instrument is disclosed for the measurement of vacuum within sealed packets, the packets having a wall that it can be deformed by the application of an external dynamic vacuum to an 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. A change (e.g., a decrease) of retro-reflected light signals the wall movement such that the value of the dynamic vacuum applied through the head be to achieve this initiation of movement is equal to the vacuum within the packet. In a preferred embodiment a vacuum plate is placed beneath the packet to ensure that no deformation occurs on the reverse surface of the packet. A vacuum can be applied to a recess in this vacuum plate, the value of which can be used to calibrate the vacuum transducer in the detector head. 4 figs.

Instrument for measurement of vacuum in sealed thin wall packets

DOEpatents

Kollie, Thomas G.; Thacker, Louis H.; Fine, H. Alan

1995-01-01

An instrument for the measurement of vacuum within sealed packets 12, the packets 12 having a wall 14 that it can be deformed by the application of an external dynamic vacuum to an 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. A change (e.g., a decrease) of retro-reflected light signals the wall movement such that the value of the dynamic vacuum applied through the head be to achieve this initiation of movement is equal to the vacuum within the packet 12. In a preferred embodiment a vacuum plate 44 is placed beneath the packet 12 to ensure that no deformation occurs on the reverse surface 16 of the packet. A vacuum can be applied to a recess in this vacuum plate, the value of which can be used to calibrate the vacuum transducer in the detector head.

Acoustic emission detection for mass fractions of materials based on wavelet packet technology.

PubMed

Wang, Xianghong; Xiang, Jianjun; Hu, Hongwei; Xie, Wei; Li, Xiongbing

2015-07-01

Materials are often damaged during the process of detecting mass fractions by traditional methods. Acoustic emission (AE) technology combined with wavelet packet analysis is used to evaluate the mass fractions of microcrystalline graphite/polyvinyl alcohol (PVA) composites in this study. Attenuation characteristics of AE signals across the composites with different mass fractions are investigated. The AE signals are decomposed by wavelet packet technology to obtain the relationships between the energy and amplitude attenuation coefficients of feature wavelet packets and mass fractions as well. Furthermore, the relationship is validated by a sample. The larger proportion of microcrystalline graphite will correspond to the higher attenuation of energy and amplitude. The attenuation characteristics of feature wavelet packets with the frequency range from 125 kHz to 171.85 kHz are more suitable for the detection of mass fractions than those of the original AE signals. The error of the mass fraction of microcrystalline graphite calculated by the feature wavelet packet (1.8%) is lower than that of the original signal (3.9%). Therefore, AE detection base on wavelet packet analysis is an ideal NDT method for evaluate mass fractions of composite materials. Copyright © 2015 Elsevier B.V. All rights reserved.

MIRAGE: The data acquisition, analysis, and display system

NASA Technical Reports Server (NTRS)

Rosser, Robert S.; Rahman, Hasan H.

1993-01-01

Developed for the NASA Johnson Space Center and Life Sciences Directorate by GE Government Services, the Microcomputer Integrated Real-time Acquisition Ground Equipment (MIRAGE) system is a portable ground support system for Spacelab life sciences experiments. The MIRAGE system can acquire digital or analog data. Digital data may be NRZ-formatted telemetry packets of packets from a network interface. Analog signal are digitized and stored in experimental packet format. Data packets from any acquisition source are archived to a disk as they are received. Meta-parameters are generated from the data packet parameters by applying mathematical and logical operators. Parameters are displayed in text and graphical form or output to analog devices. Experiment data packets may be retransmitted through the network interface. Data stream definition, experiment parameter format, parameter displays, and other variables are configured using spreadsheet database. A database can be developed to support virtually any data packet format. The user interface provides menu- and icon-driven program control. The MIRAGE system can be integrated with other workstations to perform a variety of functions. The generic capabilities, adaptability and ease of use make the MIRAGE a cost-effective solution to many experimental data processing requirements.

Flexible-rate optical packet generation/detection and label swapping for optical label switching networks

NASA Astrophysics Data System (ADS)

Wu, Zhongying; Li, Juhao; Tian, Yu; Ge, Dawei; Zhu, Paikun; Chen, Yuanxiang; Chen, Zhangyuan; He, Yongqi

2017-03-01

In recent years, optical label switching (OLS) gains lots of attentions due to its intrinsic advantages to implement protocol, bit-rate, granularity and data format transparency packet switching. In this paper, we propose a novel scheme to realize flexible-rate optical packet switching for OLS networks. At the transmitter node, flexible-rate packet is generated by parallel modulating different combinations of optical carriers generated from the optical multi-carrier generator (OMCG), among which the low-speed optical label occupies one carrier. At the switching node, label is extracted and re-generated in label processing unit (LPU). The payloads are switched based on routing information and new label is added after switching. At the receiver node, another OMCG serves as local oscillators (LOs) for optical payloads coherent detection. The proposed scheme offers good flexibility for dynamic optical packet switching by adjusting the payload bandwidth and could also effectively reduce the number of lasers, modulators and receivers for packet generation/detection. We present proof-of-concept demonstrations of flexible-rate packet generation/detection and label swapping in 12.5 GHz grid. The influence of crosstalk for cascaded label swapping is also investigated.

A novel EPON architecture for supporting direct communication between ONUs

NASA Astrophysics Data System (ADS)

Wang, Liqian; Chen, Xue; Wang, Zhen

2008-11-01

In the traditional EPON network, optical signal from one ONU can not reach other ONUs. So ONUs can not directly transmit packets to other ONUs .The packets must be transferred by the OLT and it consumes both upstream bandwidth and downstream bandwidth. The bandwidth utilization is low and becomes lower when there are more packets among ONUs. When the EPON network carries P2P (Peer-to-Peer) applications and VPN applications, there would be a great lot of packets among ONUs and the traditional EPON network meets the problem of low bandwidth utilization. In the worst situation the bandwidth utilization of traditional EPON only is 50 percent. This paper proposed a novel EPON architecture and a novel medium access control protocol to realize direct packets transmission between ONUs. In the proposed EPON we adopt a novel circled architecture in the splitter. Due to the circled-splitter, optical signals from an ONU can reach the other ONUs and packets could be directly transmitted between two ONUs. The traffic between two ONUs only consumes upstream bandwidth and the bandwidth cost is reduced by 50 percent. Moreover, this kind of directly transmission reduces the packet's latency.

On-Line Fringe Tracking and Prediction at IOTA

NASA Technical Reports Server (NTRS)

Wilson, Edward; Mah, Robert; Lau, Sonie (Technical Monitor)

1999-01-01

The Infrared/Optical Telescope Array (IOTA) is a multi-aperture Michelson interferometer located on Mt. Hopkins near Tucson, Arizona. To enable viewing of fainter targets, an on-line fringe tracking system is presently under development at NASA Ames Research Center. The system has been developed off-line using actual data from IOTA, and is presently undergoing on-line implementation at IOTA. The system has two parts: (1) a fringe tracking system that identifies the center of a fringe packet by fitting a parametric model to the data; and (2) a fringe packet motion prediction system that uses characteristics of past fringe packets to predict fringe packet motion. Combined, this information will be used to optimize on-line the scanning trajectory, resulting in improved visibility of faint targets. Fringe packet identification is highly accurate and robust (99% of the 4000 fringe packets were identified correctly, the remaining 1% were either out of the scan range or too noisy to be seen) and is performed in 30-90 milliseconds on a Pentium II-based computer. Fringe packet prediction, currently performed using an adaptive linear predictor, delivers a 10% improvement over the baseline of predicting no motion.

An Experimental Exploration of the Impact of Network-Level Packet Loss on Network Intrusion Detection

DTIC Science & Technology

2015-08-01

Experimental environment 5 Table 1 Hardware specifications Name Manufacture Model CPU Memory Hard Drive IP Address Bilbo Dell PowerEdge R610 Intel...10 we replayed the same hour of network traffic from the CDX 20093 that we used in our theoretical2 exploration to show the impact of our packet... replay the traffic at arbitrary speeds. Table 3 lists the speed multiplier that we used and the packet loss we observed. Table 3 Network packet loss

Crossbar Switches For Optical Data-Communication Networks

NASA Technical Reports Server (NTRS)

Monacos, Steve P.

1994-01-01

Optoelectronic and electro-optical crossbar switches called "permutation engines" (PE's) developed to route packets of data through fiber-optic communication networks. Basic network concept described in "High-Speed Optical Wide-Area Data-Communication Network" (NPO-18983). Nonblocking operation achieved by decentralized switching and control scheme. Each packet routed up or down in each column of this 5-input/5-output permutation engine. Routing algorithm ensures each packet arrives at its designated output port without blocking any other packet that does not contend for same output port.

Symplectic semiclassical wave packet dynamics II: non-Gaussian states

NASA Astrophysics Data System (ADS)

Ohsawa, Tomoki

2018-05-01

We generalize our earlier work on the symplectic/Hamiltonian formulation of the dynamics of the Gaussian wave packet to non-Gaussian semiclassical wave packets. We find the symplectic forms and asymptotic expansions of the Hamiltonians associated with these semiclassical wave packets, and obtain Hamiltonian systems governing their dynamics. Numerical experiments demonstrate that the dynamics give a very good approximation to the short-time dynamics of the expectation values computed by a method based on Egorov’s theorem or the initial value representation.

Multi-Orbital contributions in High Harmonic Generation

NASA Astrophysics Data System (ADS)

Guehr, Markus

2009-05-01

The high harmonic spectrum generated from atoms or molecules in a strong laser field contains information about the electronic structure of the generation medium. In the high harmonic generation (HHG) process, a free electron wave packet tunnel-ionizes from the molecular orbital in a strong laser field. After being accelerated by the laser electric field, the free electron wave packet coherently recombines to the orbital from which is was initially ionized, thereby emitting the harmonic spectrum. Interferences between the free electron wave packet and the molecular orbital will shape the spectrum in a characteristic way. These interferences have been used to tomographically image the highest occupied molecular orbital (HOMO) of N2 [1]. Molecular electronic states energetically below the HOMO should contribute to laser-driven high harmonic generation (HHG), but this behavior has not been observed previously. We have observed evidence of HHG from multiple orbitals in aligned N2 [2]. The tunneling ionization (and therefore the harmonic generation) is most efficient if the orbital has a large extension in the direction of the harmonic generation polarization. The HOMO with its σg symmetry therefore dominates the harmonic spectrum if the molecular axis is parallel to the harmonic generation polarization, the lower bound πu HOMO-1 dominates in the perpendicular case. The HOMO contributions appear as a regular plateau with a cutoff in the HHG spectrum. In contrast, the HOMO-1 signal is strongly peaked in the cutoff region. We explain this by semi-classical simulations of the recombination process that show constructive interferences between the HOMO-1 and the recombining wave packet in the cutoff region. The ability to monitor several orbitals opens the route to imaging coherent superpositions of electronic orbitals. [1] J. Itatani et al., Nature 432, 867 (2004)[2] B. K. McFarland, J. P. Farrell, P. H. Bucksbaum and M. Gühr, Science 322, 1232 (2008)

Glider Observations of Internal Tide Packets on the Australian Northwest Shelf

NASA Astrophysics Data System (ADS)

Book, J. W.; Steinberg, C. R.; Brinkman, R. M.; Jones, N. L.; Lowe, R.; Ivey, G. N.; Pattiaratchi, C. B.; Rice, A. E.

2016-02-01

The rapid profiling capabilities (less than 10 minutes per profile in 100 m of water excluding surfacing times) of autonomous gliders were utilized to study the structure of non-linear internal tide packets on the Australian Northwest Shelf. A total of five gliders were deployed on the shelf from 11 February - 21 April 2012 with more than 2900 glider CTD profiles collected during the final three weeks of this time period when the internal tide activity was intense. In general the internal tide packets showed high degrees of non-linearity, for example in one case a glider observed a 62 m rise of the 28° isotherm over 2.25 hours in a shelf location of 90 meters water depth. In addition to the glider measurements, moored strings of CTD sensors were used to measure the internal tide packets at fixed positions and the results show that the wave packets vary significantly with respect to their structure and arrival times from one tidal period to the next. This fact complicates interpretation of the glider data as wave packet spatial evolution is non-stationary and cannot be simply recovered from repeat glider visits to the same location. Furthermore, the packets were found to move at speeds near or greater (e.g., 0.55 m/s) than the speed that the gliders were moving. Despite these challenges, the gliders offer the only resource that can measure the spatial structure of the wave packets beyond the scope of our limited mooring positions. Therefore, we have implemented methods such as time-augmented empirical orthogonal functions to combine these glider measurements with the fixed mooring measurements in order to better understand the spatial and temporal patterns of the wave packet evolution over the slope and shelf of this region.

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.

A slotted access control protocol for metropolitan WDM ring networks

NASA Astrophysics Data System (ADS)

Baziana, P. A.; Pountourakis, I. E.

2009-03-01

In this study we focus on the serious scalability problems that many access protocols for WDM ring networks introduce due to the use of a dedicated wavelength per access node for either transmission or reception. We propose an efficient slotted MAC protocol suitable for WDM ring metropolitan area networks. The proposed network architecture employs a separate wavelength for control information exchange prior to the data packet transmission. Each access node is equipped with a pair of tunable transceivers for data communication and a pair of fixed tuned transceivers for control information exchange. Also, each access node includes a set of fixed delay lines for synchronization reasons; to keep the data packets, while the control information is processed. An efficient access algorithm is applied to avoid both the data wavelengths and the receiver collisions. In our protocol, each access node is capable of transmitting and receiving over any of the data wavelengths, facing the scalability issues. Two different slot reuse schemes are assumed: the source and the destination stripping schemes. For both schemes, performance measures evaluation is provided via an analytic model. The analytical results are validated by a discrete event simulation model that uses Poisson traffic sources. Simulation results show that the proposed protocol manages efficient bandwidth utilization, especially under high load. Also, comparative simulation results prove that our protocol achieves significant performance improvement as compared with other WDMA protocols which restrict transmission over a dedicated data wavelength. Finally, performance measures evaluation is explored for diverse numbers of buffer size, access nodes and data wavelengths.

Collective network routing

DOEpatents

Hoenicke, Dirk

2014-12-02

Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

Statistics of Gaussian packets on metric and decorated graphs.

PubMed

Chernyshev, V L; Shafarevich, A I

2014-01-28

We study a semiclassical asymptotics of the Cauchy problem for a time-dependent Schrödinger equation on metric and decorated graphs with a localized initial function. A decorated graph is a topological space obtained from a graph via replacing vertices with smooth Riemannian manifolds. The main term of an asymptotic solution at an arbitrary finite time is a sum of Gaussian packets and generalized Gaussian packets (localized near a certain set of codimension one). We study the number of packets as time tends to infinity. We prove that under certain assumptions this number grows in time as a polynomial and packets fill the graph uniformly. We discuss a simple example of the opposite situation: in this case, a numerical experiment shows a subexponential growth.

Femtosecond laser spectroscopy on the vibrational wave packet dynamics of the A 1Σ+ state of NaK

NASA Astrophysics Data System (ADS)

Berg, L.-E.; Beutter, M.; Hansson, T.

1996-05-01

The vibrational wave packet dynamics of a heteronuclear diatomic alkali molecule in an excited state, the A 1Σ+ state of gaseous NaK, has been measured for the first time. At λpump = 790 nm, a wave packet oscillation period of 442 fs and dephasing within 10 ps has been observed. This dynamics has been analysed by calculation of Franck-Condon factors and difference potentials. It is from this seen that initially the pump pulse prepares a wave packet at the inner turning point of the A-state. The wave packet then evolves in time and is probed at the outer turning point by a transition to the E-state with subsequent fluorescence detection.

Physiologic responses to forward and retrograde simulated stair stepping.

PubMed

Ryan, P T; Plowman, S A; Ball, T E; Looney, M A

1994-07-01

This study compared the physiologic responses to forward and retrograde simulated stair stepping on the StairMaster 4000 PT. Twenty male subjects (mean age 23.65 +/- 1.63 years) volunteered for this study. Subjects completed a practice trial of 6 minutes of both forward and retrograde stepping at Level 5. Each experimental trial was divided into four 3-minute stages: Level 3, Level 5, Level 7, and Level 9. Heart rate, blood pressure, and rating of perceived exertion (RPE) were recorded during the second minute of each stage. Expired gases were analyzed and averaged over the last 2 minutes of each stage. Caloric expenditure and delta efficiency were later calculated. Data were analyzed using a 2 x 4 ANOVA (direction by level) and 2 x 3 ANOVA (for delta efficiency). Compared to forward responses, retrograde heart rates were significantly higher at Levels 7 and 9 (p < 0.01). Retrograde responses for RPE, metabolic equivalents (METS), and caloric expenditure were significantly higher at (p < 0.01) Levels 5, 7, and 9 when compared to forward responses. However, the results of this study show that these differences between forward and retrograde stepping are not practically meaningful.

Astrology and Astronomy.

ERIC Educational Resources Information Center

Astronomical Society of the Pacific, San Francisco, CA.

One of a series of information packets, the document provides clear, specific information about the controversial subject of astrology. The packet includes six articles explaining the dozens of careful scientific tests which have concluded that there is no scientific evidence supporting astrology. The packet includes an interview with astronomer…

Notes from beyond the Cognitive Domain.

ERIC Educational Resources Information Center

Brand, Alice, Comp.; Graves, Dick, Comp.

This packet summarizes the ideas, concepts, suggestions, and speculations growing out of a think tank which explored the uncharted region beyond cognitive learning. The packet shows that participants were divided into groups to discuss teaching, research, bibliographic information, theoretical ideas, and professional issues. The packet contains:…