Data transmission system and method

NASA Technical Reports Server (NTRS)

Bruck, Jehoshua (Inventor); Langberg, Michael (Inventor); Sprintson, Alexander (Inventor)

2010-01-01

A method of transmitting data packets, where randomness is added to the schedule. Universal broadcast schedules using encoding and randomization techniques are also discussed, together with optimal randomized schedules and an approximation algorithm for finding near-optimal schedules.

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.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

PubMed

Tsai, Meng-Hsun; Chou, Chien-Ming; Lan, Kun-Chan

2016-01-01

Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP

PubMed Central

2016-01-01

Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance. PMID:27529783

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.

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

Back pressure based multicast scheduling for fair bandwidth allocation.

PubMed

Sarkar, Saswati; Tassiulas, Leandros

2005-09-01

We study the fair allocation of bandwidth in multicast networks with multirate capabilities. In multirate transmission, each source encodes its signal in layers. The lowest layer contains the most important information and all receivers of a session should receive it. If a receiver's data path has additional bandwidth, it receives higher layers which leads to a better quality of reception. The bandwidth allocation objective is to distribute the layers fairly. We present a computationally simple, decentralized scheduling policy that attains the maxmin fair rates without using any knowledge of traffic statistics and layer bandwidths. This policy learns the congestion level from the queue lengths at the nodes, and adapts the packet transmissions accordingly. When the network is congested, packets are dropped from the higher layers; therefore, the more important lower layers suffer negligible packet loss. We present analytical and simulation results that guarantee the maxmin fairness of the resulting rate allocation, and upper bound the packet loss rates for different layers.

On Several Fundamental Problems of Optimization, Estimation, and Scheduling in Wireless Communications

NASA Astrophysics Data System (ADS)

Gao, Qian

For both the conventional radio frequency and the comparably recent optical wireless communication systems, extensive effort from the academia had been made in improving the network spectrum efficiency and/or reducing the error rate. To achieve these goals, many fundamental challenges such as power efficient constellation design, nonlinear distortion mitigation, channel training design, network scheduling and etc. need to be properly addressed. In this dissertation, novel schemes are proposed accordingly to deal with specific problems falling in category of these challenges. Rigorous proofs and analyses are provided for each of our work to make a fair comparison with the corresponding peer works to clearly demonstrate the advantages. The first part of this dissertation considers a multi-carrier optical wireless system employing intensity modulation (IM) and direct detection (DD). A block-wise constellation design is presented, which treats the DC-bias that conventionally used solely for biasing purpose as an information basis. Our scheme, we term it MSM-JDCM, takes advantage of the compactness of sphere packing in a higher dimensional space, and in turn power efficient constellations are obtained by solving an advanced convex optimization problem. Besides the significant power gains, the MSM-JDCM has many other merits such as being capable of mitigating nonlinear distortion by including a peak-to-power ratio (PAPR) constraint, minimizing inter-symbol-interference (ISI) caused by frequency-selective fading with a novel precoder designed and embedded, and further reducing the bit-error-rate (BER) by combining with an optimized labeling scheme. The second part addresses several optimization problems in a multi-color visible light communication system, including power efficient constellation design, joint pre-equalizer and constellation design, and modeling of different structured channels with cross-talks. Our novel constellation design scheme, termed CSK-Advanced, is compared with the conventional decoupled system with the same spectrum efficiency to demonstrate the power efficiency. Crucial lighting requirements are included as optimization constraints. To control non-linear distortion, the optical peak-to-average-power ratio (PAPR) of LEDs can be individually constrained. With a SVD-based pre-equalizer designed and employed, our scheme can achieve lower BER than counterparts applying zero-forcing (ZF) or linear minimum-mean-squared-error (LMMSE) based post-equalizers. Besides, a binary switching algorithm (BSA) is applied to improve BER performance. The third part looks into a problem of two-phase channel estimation in a relayed wireless network. The channel estimates in every phase are obtained by the linear minimum mean squared error (LMMSE) method. Inaccurate estimate of the relay to destination (RtD) channel in phase 1 could affect estimate of the source to relay (StR) channel in phase 2, which is made erroneous. We first derive a close-form expression for the averaged Bayesian mean-square estimation error (ABMSE) for both phase estimates in terms of the length of source and relay training slots, based on which an iterative searching algorithm is then proposed that optimally allocates training slots to the two phases such that estimation errors are balanced. Analysis shows how the ABMSE of the StD channel estimation varies with the lengths of relay training and source training slots, the relay amplification gain, and the channel prior information respectively. The last part deals with a transmission scheduling problem in a uplink multiple-input-multiple-output (MIMO) wireless network. Code division multiple access (CDMA) is assumed as a multiple access scheme and pseudo-random codes are employed for different users. We consider a heavy traffic scenario, in which each user always has packets to transmit in the scheduled time slots. If the relay is scheduled for transmission together with users, then it operates in a full-duplex mode, where the packets previously collected from users are transmitted to the destination while new packets are being collected from users. A novel expression of throughput is first derived and then used to develop a scheduling algorithm to maximize the throughput. Our full-duplex scheduling is compared with a half-duplex scheduling, random access, and time division multiple access (TDMA), and simulation results illustrate its superiority. Throughput gains due to employment of both MIMO and CDMA are observed.

The Long Life Ration Packet (LLRP)

DTIC Science & Technology

1991-02-18

entree, a cereal bar, a cookie component, a candy component, an instant beverage and an accessory packet. It weighs less than one pound for an...which may be eaten as is or rapidly reconstituted with either hot or cold water; other low moisture ready-to-eat foods and several instant beverage... instant beverage and accessory packet. 0 Field testing of prototype LRP scheduled for 4Q90 using Fort Drum IRP troops. 0 In-Process Review for acceptance of

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.

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

Two-Step Fair Scheduling of Continuous Media Streams over Error-Prone Wireless Channels

NASA Astrophysics Data System (ADS)

Oh, Soohyun; Lee, Jin Wook; Park, Taejoon; Jo, Tae-Chang

In wireless cellular networks, streaming of continuous media (with strict QoS requirements) over wireless links is challenging due to their inherent unreliability characterized by location-dependent, bursty errors. To address this challenge, we present a two-step scheduling algorithm for a base station to provide streaming of continuous media to wireless clients over the error-prone wireless links. The proposed algorithm is capable of minimizing the packet loss rate of individual clients in the presence of error bursts, by transmitting packets in the round-robin manner and also adopting a mechanism for channel prediction and swapping.

Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

NASA Astrophysics Data System (ADS)

Satrya, Gandeva B.; Brotoharsono, Tri

2013-03-01

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

Wireless Sensor Network Metrics for Real-Time Systems

DTIC Science & Technology

2009-05-20

to compute the probability of end-to-end packet delivery as a function of latency, the expected radio energy consumption on the nodes from relaying... schedules for WSNs. Particularly, we focus on the impact scheduling has on path diversity, using short repeating schedules and Greedy Maximal Matching...a greedy algorithm for constructing a mesh routing topology. Finally, we study the implications of using distributed scheduling schemes to generate

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

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

The Impact of Utilizing a Flexible Work Schedule on the Perceived Career Advancement Potential of Women

ERIC Educational Resources Information Center

Rogier, Sara A.; Padgett, Margaret Y.

2004-01-01

This study examined whether a woman working a flexible schedule would be perceived as having less career advancement potential than a woman on a regular schedule. Participants reviewed a packet of materials simulating the personnel file of a female employee in an accounting firm who was seeking promotion from manager to senior manager. Results…

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

PubMed

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

2015-05-28

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

Packet Scheduling Mechanism to Improve Quality of Short Flows and Low-Rate Flows

NASA Astrophysics Data System (ADS)

Yokota, Kenji; Asaka, Takuya; Takahashi, Tatsuro

In recent years elephant flows are increasing by expansion of peer-to-peer (P2P) applications on the Internet. As a result, bandwidth is occupied by specific users triggering unfair resource allocation. The main packet-scheduling mechanism currently employed is first-in first-out (FIFO) where the available bandwidth of short flows is limited by elephant flows. Least attained service (LAS), which decides transfer priority of packets by the total amount of transferred data in all flows, was proposed to solve this problem. However, routers with LAS limit flows with large amount of transferred data even if they are low-rate. Therefore, it is necessary to improve the quality of low-rate flows with long holding times such as voice over Internet protocol (VoIP) applications. This paper proposes rate-based priority control (RBPC), which calculates the flow rate and control the priority by using it. Our proposed method can transfer short flows and low-rate flows in advance. Moreover, its fair performance is shown through simulations.

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

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.

Dynamic Resource Allocation for IEEE802.16e

NASA Astrophysics Data System (ADS)

Nascimento, Alberto; Rodriguez, Jonathan

Mobile communications has witnessed an exponential increase in the amount of users, services and applications. New high bandwidth consuming applications are targeted for B3G networks raising more stringent requirements for Dynamic Resource Allocation (DRA) architectures and packet schedulers that must be spectrum efficient and deliver QoS for heterogeneous applications and services. In this paper we propose a new cross layer-based architecture framework embedded in a newly designed DRA architecture for the Mobile WiMAX standard. System level simulation results show that the proposed architecture can be considered a viable candidate solution for supporting mixed services in a cost-effective manner in contrast to existing approaches.

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.

Protocol, Engineering Research Center, University of California, Santa Barbara

DTIC Science & Technology

2005-12-01

minimizing the energy consumption in idle periods. We have designed an asynchronous wakeup schedule based on the theory of block designs. The idea is...performance of ad hoc networks through innovative packet scheduling (Baker). "* Developed a number of novel schemes to ensure loop freedom in on demand routing...network nodes to schedule their transmissions to avoid collisions (Garcia-Luna-Aceves). "* Designed and analyzed the Hybrid Activation Multiple Access (HAMA

Lightweight active router-queue management for multimedia networking

NASA Astrophysics Data System (ADS)

Parris, Mark; Jeffay, Kevin; Smith, F. D.

1998-12-01

The Internet research community is promoting active queue management in routers as a proactive means of addressing congestion in the Internet. Active queue management mechanisms such as Random Early Detection (RED) work well for TCP flows but can fail in the presence of unresponsive UDP flows. Recent proposals extend RED to strongly favor TCP and TCP-like flows and to actively penalize `misbehaving' flows. This is problematic for multimedia flows that, although potentially well-behaved, do not, or can not, satisfy the definition of a TCP-like flow. In this paper we investigate an extension to RED active queue management called Class-Based Thresholds (CBT). The goal of CBT is to reduce congestion in routers and to protect TCP from all UDP flows while also ensuring acceptable throughput and latency for well-behaved UDP flows. CBT attempts to realize a `better than best effort' service for well-behaved multimedia flows that is comparable to that achieved by a packet or link scheduling discipline, however, CBT does this by queue management rather than by scheduling. We present results of experiments comparing our mechanisms to plain RED and to FRED, a variant of RED designed to ensure fair allocation of bandwidth amongst flows. We also compare CBT to a packet scheduling scheme. The experiments show that CBT (1) realizes protection for TCP, and (2) provides throughput and end-to-end latency for tagged UDP flows, that is better than that under FRED and RED and comparable to that achieved by packet scheduling. Moreover CBT is a lighter-weight mechanism than FRED in terms of its state requirements and implementation complexity.

MPEG-compliant joint source/channel coding using discrete cosine transform and substream scheduling for visual communication over packet networks

NASA Astrophysics Data System (ADS)

Kim, Seong-Whan; Suthaharan, Shan; Lee, Heung-Kyu; Rao, K. R.

2001-01-01

Quality of Service (QoS)-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channel coding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, first, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Second, we designed a classification scheme to partition the packet stream into multiple substreams which have their own QoS requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other two popular techniques by simulation and real video experiments on the TCP/IP environment.

Adaptive control of the packet transmission period with solar energy harvesting prediction in wireless sensor networks.

PubMed

Kwon, Kideok; Yang, Jihoon; Yoo, Younghwan

2015-04-24

A number of research works has studied packet scheduling policies in energy scavenging wireless sensor networks, based on the predicted amount of harvested energy. Most of them aim to achieve energy neutrality, which means that an embedded system can operate perpetually while meeting application requirements. Unlike other renewable energy sources, solar energy has the feature of distinct periodicity in the amount of harvested energy over a day. Using this feature, this paper proposes a packet transmission control policy that can enhance the network performance while keeping sensor nodes alive. Furthermore, this paper suggests a novel solar energy prediction method that exploits the relation between cloudiness and solar radiation. The experimental results and analyses show that the proposed packet transmission policy outperforms others in terms of the deadline miss rate and data throughput. Furthermore, the proposed solar energy prediction method can predict more accurately than others by 6.92%.

A novel downlink scheduling strategy for traffic communication system based on TD-LTE technology.

PubMed

Chen, Ting; Zhao, Xiangmo; Gao, Tao; Zhang, Licheng

2016-01-01

There are many existing classical scheduling algorithms which can obtain better system throughput and user equality, however, they are not designed for traffic transportation environment, which cannot consider whether the transmission performance of various information flows could meet comprehensive requirements of traffic safety and delay tolerance. This paper proposes a novel downlink scheduling strategy for traffic communication system based on TD-LTE technology, which can perform two classification mappings for various information flows in the eNodeB: firstly, associate every information flow packet with traffic safety importance weight according to its relevance to the traffic safety; secondly, associate every traffic information flow with service type importance weight according to its quality of service (QoS) requirements. Once the connection is established, at every scheduling moment, scheduler would decide the scheduling order of all buffers' head of line packets periodically according to the instant value of scheduling importance weight function, which calculated by the proposed algorithm. From different scenario simulations, it can be verified that the proposed algorithm can provide superior differentiated transmission service and reliable QoS guarantee to information flows with different traffic safety levels and service types, which is more suitable for traffic transportation environment compared with the existing popularity PF algorithm. With the limited wireless resource, information flow closed related to traffic safety will always obtain priority scheduling right timely, which can help the passengers' journey more safe. Moreover, the proposed algorithm cannot only obtain good flow throughput and user fairness which are almost equal to those of the PF algorithm without significant differences, but also provide better realtime transmission guarantee to realtime information flow.

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

PubMed Central

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

2016-01-01

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

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

PubMed

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

2016-10-14

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

An Energy-Efficient Underground Localization System Based on Heterogeneous Wireless Networks

PubMed Central

Yuan, Yazhou; Chen, Cailian; Guan, Xinping; Yang, Qiuling

2015-01-01

A precision positioning system with energy efficiency is of great necessity for guaranteeing personnel safety in underground mines. The location information of the miners' should be transmitted to the control center timely and reliably; therefore, a heterogeneous network with the backbone based on high speed Industrial Ethernet is deployed. Since the mobile wireless nodes are working in an irregular tunnel, a specific wireless propagation model cannot fit all situations. In this paper, an underground localization system is designed to enable the adaptation to kinds of harsh tunnel environments, but also to reduce the energy consumption and thus prolong the lifetime of the network. Three key techniques are developed and implemented to improve the system performance, including a step counting algorithm with accelerometers, a power control algorithm and an adaptive packets scheduling scheme. The simulation study and experimental results show the effectiveness of the proposed algorithms and the implementation. PMID:26016918

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.

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.

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

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

NASA Astrophysics Data System (ADS)

Hanada, Masaki; Nakazato, Hidenori; Watanabe, Hitoshi

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

Efficient Network Coding-Based Loss Recovery for Reliable Multicast in Wireless Networks

NASA Astrophysics Data System (ADS)

Chi, Kaikai; Jiang, Xiaohong; Ye, Baoliu; Horiguchi, Susumu

Recently, network coding has been applied to the loss recovery of reliable multicast in wireless networks [19], where multiple lost packets are XOR-ed together as one packet and forwarded via single retransmission, resulting in a significant reduction of bandwidth consumption. In this paper, we first prove that maximizing the number of lost packets for XOR-ing, which is the key part of the available network coding-based reliable multicast schemes, is actually a complex NP-complete problem. To address this limitation, we then propose an efficient heuristic algorithm for finding an approximately optimal solution of this optimization problem. Furthermore, we show that the packet coding principle of maximizing the number of lost packets for XOR-ing sometimes cannot fully exploit the potential coding opportunities, and we then further propose new heuristic-based schemes with a new coding principle. Simulation results demonstrate that the heuristic-based schemes have very low computational complexity and can achieve almost the same transmission efficiency as the current coding-based high-complexity schemes. Furthermore, the heuristic-based schemes with the new coding principle not only have very low complexity, but also slightly outperform the current high-complexity ones.

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

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

System-level power optimization for real-time distributed embedded systems

NASA Astrophysics Data System (ADS)

Luo, Jiong

Power optimization is one of the crucial design considerations for modern electronic systems. In this thesis, we present several system-level power optimization techniques for real-time distributed embedded systems, based on dynamic voltage scaling, dynamic power management, and management of peak power and variance of the power profile. Dynamic voltage scaling has been widely acknowledged as an important and powerful technique to trade off dynamic power consumption and delay. Efficient dynamic voltage scaling requires effective variable-voltage scheduling mechanisms that can adjust voltages and clock frequencies adaptively based on workloads and timing constraints. For this purpose, we propose static variable-voltage scheduling algorithms utilizing criticalpath driven timing analysis for the case when tasks are assumed to have uniform switching activities, as well as energy-gradient driven slack allocation for a more general scenario. The proposed techniques can achieve closeto-optimal power savings with very low computational complexity, without violating any real-time constraints. We also present algorithms for power-efficient joint scheduling of multi-rate periodic task graphs along with soft aperiodic tasks. The power issue is addressed through both dynamic voltage scaling and power management. Periodic task graphs are scheduled statically. Flexibility is introduced into the static schedule to allow the on-line scheduler to make local changes to PE schedules through resource reclaiming and slack stealing, without interfering with the validity of the global schedule. We provide a unified framework in which the response times of aperiodic tasks and power consumption are dynamically optimized simultaneously. Interconnection network fabrics point to a new generation of power-efficient and scalable interconnection architectures for distributed embedded systems. As the system bandwidth continues to increase, interconnection networks become power/energy limited as well. Variable-frequency links have been designed by circuit designers for both parallel and serial links, which can adaptively regulate the supply voltage of transceivers to a desired link frequency, to exploit the variations in bandwidth requirement for power savings. We propose solutions for simultaneous dynamic voltage scaling of processors and links. The proposed solution considers real-time scheduling, flow control, and packet routing jointly. It can trade off the power consumption on processors and communication links via efficient slack allocation, and lead to more power savings than dynamic voltage scaling on processors alone. For battery-operated systems, the battery lifespan is an important concern. Due to the effects of discharge rate and battery recovery, the discharge pattern of batteries has an impact on the battery lifespan. Battery models indicate that even under the same average power consumption, reducing peak power current and variance in the power profile can increase the battery efficiency and thereby prolong battery lifetime. To take advantage of these effects, we propose battery-driven scheduling techniques for embedded applications, to reduce the peak power and the variance in the power profile of the overall system under real-time constraints. The proposed scheduling algorithms are also beneficial in addressing reliability and signal integrity concerns by effectively controlling peak power and variance of the power profile.

Research on a Queue Scheduling Algorithm in Wireless Communications Network

NASA Astrophysics Data System (ADS)

Yang, Wenchuan; Hu, Yuanmei; Zhou, Qiancai

This paper proposes a protocol QS-CT, Queue Scheduling Mechanism based on Multiple Access in Ad hoc net work, which adds queue scheduling mechanism to RTS-CTS-DATA using multiple access protocol. By endowing different queues different scheduling mechanisms, it makes networks access to the channel much more fairly and effectively, and greatly enhances the performance. In order to observe the final performance of the network with QS-CT protocol, we simulate it and compare it with MACA/C-T without QS-CT protocol. Contrast to MACA/C-T, the simulation result shows that QS-CT has greatly improved the throughput, delay, rate of packets' loss and other key indicators.

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.

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

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.

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

NASA Astrophysics Data System (ADS)

Pitts, Jonathan M.; Schormans, John A.

1999-11-01

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

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.

Asphalt Raking. Instructor Manual. Trainee Manual.

ERIC Educational Resources Information Center

Laborers-AGC Education and Training Fund, Pomfret Center, CT.

This packet consists of the instructor and trainee manuals for an asphalt raking course. The instructor manual contains a course schedule for 4 days of instruction, content outline, and instructor outline. The trainee manual is divided into five sections: safety, asphalt basics, placing methods, repair and patching, and clean-up and maintenance.…

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

A Tree Based Self-routing Scheme for Mobility Support in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Kim, Young-Duk; Yang, Yeon-Mo; Kang, Won-Seok; Kim, Jin-Wook; An, Jinung

Recently, WSNs (Wireless Sensor Networks) with mobile robot is a growing technology that offer efficient communication services for anytime and anywhere applications. However, the tiny sensor node has very limited network resources due to its low battery power, low data rate, node mobility, and channel interference constraint between neighbors. Thus, in this paper, we proposed a tree based self-routing protocol for autonomous mobile robots based on beacon mode and implemented in real test-bed environments. The proposed scheme offers beacon based real-time scheduling for reliable association process between parent and child nodes. In addition, it supports smooth handover procedure by reducing flooding overhead of control packets. Throughout the performance evaluation by using a real test-bed system and simulation, we illustrate that our proposed scheme demonstrates promising performance for wireless sensor networks with mobile robots.

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

PubMed Central

2018-01-01

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

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.

JOBS. A Partnership between Education and Industry.

ERIC Educational Resources Information Center

Mann, Sandra; And Others

This packet contains 15 lessons developed in a workplace basic skills project for the metal casting industry established jointly by Central Alabama Community College and Robinson Foundry, Inc. The lessons cover the following topics: (1) green sand schedule; (2) the core room; (3) the core room (continued); (4) figuring time; (5) the cleaning room;…

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.

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 Interactive Model for On-Demand Sensing-As-A-Servicesof Sensor-Cloud

PubMed Central

Dinh, Thanh; Kim, Younghan

2016-01-01

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

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

PubMed

Dinh, Thanh; Kim, Younghan

2016-06-28

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

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

76 FR 3184 - Self-Regulatory Organizations; Chicago Board Options Exchange, Incorporated; Notice of Filing and...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-19

...); (ii) establish a VIX Tier Appointment; (iii) amend the monthly fee for Floor Broker Trading Permits... demutualization, CBOE amended its Fees Schedule to establish Trading Permit, tier appointment and bandwidth packet... permit ($) 1 permit 10 permits 6,000 Tier 1 11 permits 20 permits 4,800 Tier 2 21 or more permits...

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.

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.

MoNET: media over net gateway processor for next-generation network

NASA Astrophysics Data System (ADS)

Elabd, Hammam; Sundar, Rangarajan; Dedes, John

2001-12-01

MoNETTM (Media over Net) SX000 product family is designed using a scalable voice, video and packet-processing platform to address applications with channel densities from few voice channels to four OC3 per card. This platform is developed for bridging public circuit-switched network to the next generation packet telephony and data network. The platform consists of a DSP farm, RISC processors and interface modules. DSP farm is required to execute voice compression, image compression and line echo cancellation algorithms for large number of voice, video, fax, and modem or data channels. RISC CPUs are used for performing various packetizations based on RTP, UDP/IP and ATM encapsulations. In addition, RISC CPUs also participate in the DSP farm load management and communication with the host and other MoP devices. The MoNETTM S1000 communications device is designed for voice processing and for bridging TDM to ATM and IP packet networks. The S1000 consists of the DSP farm based on Carmel DSP core and 32-bit RISC CPU, along with Ethernet, Utopia, PCI, and TDM interfaces. In this paper, we will describe the VoIP infrastructure, building blocks of the S500, S1000 and S3000 devices, algorithms executed on these device and associated channel densities, detailed DSP architecture, memory architecture, data flow and scheduling.

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

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.

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.

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

Touch the Future: Discovering Abilities through Technology for Living, Learning, Working and Playing. Southeast Regional Conference (3rd, Atlanta, Georgia, April 10-12, 1991).

ERIC Educational Resources Information Center

Georgia State Dept. of Human Resources, Atlanta. Div. of Rehabilitation Services.

This packet of materials was originally intended for participants in a 1991 conference on assistive technology for the disabled. After a detailed listing of the conference schedule, individual sections provide abstracts, biographical sketches, and summaries concerning the following conference topics: blending, computer labs, family, grants and…

78 FR 25500 - Options Price Reporting Authority; Notice of Filing and Immediate Effectiveness of Proposed...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-01

... chain. \\4\\ The term ``quote packet'' is defined in footnote 6 to OPRA's Fee Schedule as consisting of..., bid/ask and related market data. The term ``options chain'' is also defined in footnote 6 to OPRA's... essence, an OPRA Subscriber may obtain access to OPRA data in one of two ways: Either by signing a...

Practices & Procedures of Mason Tending I & II. Instructor Manual. Trainee Manual.

ERIC Educational Resources Information Center

Laborers-AGC Education and Training Fund, Pomfret Center, CT.

This packet consists of the instructor and trainee manuals for two courses: practices and procedures of mason tending I and II. The instructor manual for mason tending I contains a schedule for a 40-hour, 5-day course and instructor outline. The outline provides a step-by-step description of the instructor's activities and includes answer sheets…

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.

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.

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

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.

NASA Johnson Space Center Life Sciences Data System

NASA Technical Reports Server (NTRS)

Rahman, Hasan; Cardenas, Jeffery

1994-01-01

The Life Sciences Project Division (LSPD) at JSC, which manages human life sciences flight experiments for the NASA Life Sciences Division, augmented its Life Sciences Data System (LSDS) in support of the Spacelab Life Sciences-2 (SLS-2) mission, October 1993. The LSDS is a portable ground system supporting Shuttle, Spacelab, and Mir based life sciences experiments. The LSDS supports acquisition, processing, display, and storage of real-time experiment telemetry in a workstation environment. The system may acquire digital or analog data, storing the data in experiment packet format. Data packets from any acquisition source are archived and meta-parameters are derived through the application of mathematical and logical operators. Parameters may be displayed in text and/or graphical form, or output to analog devices. Experiment data packets may be retransmitted through the network interface and database applications may be developed to support virtually any data packet format. The user interface provides menu- and icon-driven program control and the LSDS system can be integrated with other workstations to perform a variety of functions. The generic capabilities, adaptability, and ease of use make the LSDS a cost-effective solution to many experiment data processing requirements. The same system is used for experiment systems functional and integration tests, flight crew training sessions and mission simulations. In addition, the system has provided the infrastructure for the development of the JSC Life Sciences Data Archive System scheduled for completion in December 1994.

Fast packet switching algorithms for dynamic resource control over ATM networks

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

Tsang, R.P.; Keattihananant, P.; Chang, T.

1996-12-01

Real-time continuous media traffic, such as digital video and audio, is expected to comprise a large percentage of the network load on future high speed packet switch networks such as ATM. A major feature which distinguishes high speed networks from traditional slower speed networks is the large amount of data the network must process very quickly. For efficient network usage, traffic control mechanisms are essential. Currently, most mechanisms for traffic control (such as flow control) have centered on the support of Available Bit Rate (ABR), i.e., non real-time, traffic. With regard to ATM, for ABR traffic, two major types ofmore » schemes which have been proposed are rate- control and credit-control schemes. Neither of these schemes are directly applicable to Real-time Variable Bit Rate (VBR) traffic such as continuous media traffic. Traffic control for continuous media traffic is an inherently difficult problem due to the time- sensitive nature of the traffic and its unpredictable burstiness. In this study, we present a scheme which controls traffic by dynamically allocating/de- allocating resources among competing VCs based upon their real-time requirements. This scheme incorporates a form of rate- control, real-time burst-level scheduling and link-link flow control. We show analytically potential performance improvements of our rate- control scheme and present a scheme for buffer dimensioning. We also present simulation results of our schemes and discuss the tradeoffs inherent in maintaining high network utilization and statistically guaranteeing many users` Quality of Service.« less

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.

Flight software issues in onboard automated planning: lessons learned on EO-1

NASA Technical Reports Server (NTRS)

Tran, Daniel; Chien, Steve; Rabideau, Gregg; Cichy, Benjamin

2004-01-01

This paper focuses on the onboard planner and scheduler CASPER, whose core planning engine is based on the ground system ASPEN. Given the challenges of developing flight software, we discuss several of the issues encountered in preparing the planner for flight, including reducing the code image size, determining what data to place within the engineering telemetry packet, and performing long term planning.

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.

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.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

PubMed Central

Wang, Haiyan; He, Ke

2018-01-01

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

PubMed

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

2018-04-23

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

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.

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.

Advanced teleprocessing systems

NASA Astrophysics Data System (ADS)

Kleinrock, L.; Gerla, M.

1982-09-01

This Annual Technical Report covers research covering the period from October 1, 1981 to September 30, 1982. This contract has three primary designated research areas: packet radio systems, resource sharing and allocation, and distributed processing and control. This report contains abstracts of publications which summarize research results in these areas followed by the main body of the report which is devoted to a study of channel access protocols that are executed by the nodes of a network to schedule their transmissions on multi-access broadcast channel. In particular the main body consists of a Ph.D. dissertation, Channel Access Protocols for Multi-Hop Broadcast Packet Radio Networks. This work discusses some new channel access protocols useful for mobile radio networks. Included is an analysis of slotted ALOHA and some tight bounds on the performance of all possible protocols in a mobile environment.

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

PubMed Central

Niu, Jianjun; Deng, Zhidong

2009-01-01

Energy constraints restrict the lifetime of wireless sensor networks (WSNs) with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs) based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes' energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs. PMID:22408491

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

Interactivity vs. fairness in networked linux systems

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

Wu, Wenji; Crawford, Matt; /Fermilab

In general, the Linux 2.6 scheduler can ensure fairness and provide excellent interactive performance at the same time. However, our experiments and mathematical analysis have shown that the current Linux interactivity mechanism tends to incorrectly categorize non-interactive network applications as interactive, which can lead to serious fairness or starvation issues. In the extreme, a single process can unjustifiably obtain up to 95% of the CPU! The root cause is due to the facts that: (1) network packets arrive at the receiver independently and discretely, and the 'relatively fast' non-interactive network process might frequently sleep to wait for packet arrival. Thoughmore » each sleep lasts for a very short period of time, the wait-for-packet sleeps occur so frequently that they lead to interactive status for the process. (2) The current Linux interactivity mechanism provides the possibility that a non-interactive network process could receive a high CPU share, and at the same time be incorrectly categorized as 'interactive.' In this paper, we propose and test a possible solution to address the interactivity vs. fairness problems. Experiment results have proved the effectiveness of the proposed solution.« less

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

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.

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

Dynamic Bandwidth Allocation with Effective Utilization of Polling Interval over WDM/TDM PON

NASA Astrophysics Data System (ADS)

Ni, Cuiping; Gan, Chaoqin; Gao, Ziyue

2014-12-01

WDM/TDM (wavelength-division multiplexing/time-division multiplexing) PON (passive optical network) appears to be an attractive solution for the next generation optical access networks. Dynamic bandwidth allocation (DBA) plays a crucial role in efficiently and fairly allocating the bandwidth among all users in WDM/TDM PON. In this paper, two dynamic bandwidth allocation schemes (DBA1 and DBA2) are proposed to eliminate the idle time of polling cycles (i.e. polling interval), improve bandwidth utilization and make full use of bandwidth resources. The two DBA schemes adjust the time slot of sending request information and make fair scheduling among users to achieve the effective utilization of polling interval in WDM/TDM PON. The simulation and theoretical analyses verify that the proposed schemes outperform the conventional DBA scheme. We also make comparisons between the two schemes in terms of bandwidth utilization and average packet delay to further demonstrate the effectiveness of the scheme of DBA2.

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks

PubMed Central

Mahjoub, Reem K.; Elleithy, Khaled

2017-01-01

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

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks.

PubMed

Mahjoub, Reem K; Elleithy, Khaled

2017-04-14

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

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.

A Study of Quality of Service Communication for High-Speed Packet-Switching Computer Sub-Networks

NASA Technical Reports Server (NTRS)

Cui, Zhenqian

1999-01-01

In this thesis, we analyze various factors that affect quality of service (QoS) communication in high-speed, packet-switching sub-networks. We hypothesize that sub-network-wide bandwidth reservation and guaranteed CPU processing power at endpoint systems for handling data traffic are indispensable to achieving hard end-to-end quality of service. Different bandwidth reservation strategies, traffic characterization schemes, and scheduling algorithms affect the network resources and CPU usage as well as the extent that QoS can be achieved. In order to analyze those factors, we design and implement a communication layer. Our experimental analysis supports our research hypothesis. The Resource ReSerVation Protocol (RSVP) is designed to realize resource reservation. Our analysis of RSVP shows that using RSVP solely is insufficient to provide hard end-to-end quality of service in a high-speed sub-network. Analysis of the IEEE 802.lp protocol also supports the research hypothesis.

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 .

IpexT: Integrated Planning and Execution for Military Satellite Tele-Communications

NASA Technical Reports Server (NTRS)

Plaunt, Christian; Rajan, Kanna

2004-01-01

The next generation of military communications satellites may be designed as a fast packet-switched constellation of spacecraft able to withstand substantial bandwidth capacity fluctuation in the face of dynamic resource utilization and rapid environmental changes including jamming of communication frequencies and unstable weather phenomena. We are in the process of designing an integrated scheduling and execution tool which will aid in the analysis of the design parameters needed for building such a distributed system for nominal and battlefield communications. This paper discusses the design of such a system based on a temporal constraint posting planner/scheduler and a smart executive which can cope with a dynamic environment to make a more optimal utilization of bandwidth than the current circuit switched based approach.

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

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.

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.

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.

Performance and policy dimensions in internet routing

NASA Technical Reports Server (NTRS)

Mills, David L.; Boncelet, Charles G.; Elias, John G.; Schragger, Paul A.; Jackson, Alden W.; Thyagarajan, Ajit

1995-01-01

The Internet Routing Project, referred to in this report as the 'Highball Project', has been investigating architectures suitable for networks spanning large geographic areas and capable of very high data rates. The Highball network architecture is based on a high speed crossbar switch and an adaptive, distributed, TDMA scheduling algorithm. The scheduling algorithm controls the instantaneous configuration and swell time of the switch, one of which is attached to each node. In order to send a single burst or a multi-burst packet, a reservation request is sent to all nodes. The scheduling algorithm then configures the switches immediately prior to the arrival of each burst, so it can be relayed immediately without requiring local storage. Reservations and housekeeping information are sent using a special broadcast-spanning-tree schedule. Progress to date in the Highball Project includes the design and testing of a suite of scheduling algorithms, construction of software reservation/scheduling simulators, and construction of a strawman hardware and software implementation. A prototype switch controller and timestamp generator have been completed and are in test. Detailed documentation on the algorithms, protocols and experiments conducted are given in various reports and papers published. Abstracts of this literature are included in the bibliography at the end of this report, which serves as an extended executive summary.

Dynamic Hop Service Differentiation Model for End-to-End QoS Provisioning in Multi-Hop Wireless Networks

NASA Astrophysics Data System (ADS)

Youn, Joo-Sang; Seok, Seung-Joon; Kang, Chul-Hee

This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc environments.

An implementation of the SNR high speed network communication protocol (Receiver part)

NASA Astrophysics Data System (ADS)

Wan, Wen-Jyh

1995-03-01

This thesis work is to implement the receiver pan of the SNR high speed network transport protocol. The approach was to use the Systems of Communicating Machines (SCM) as the formal definition of the protocol. Programs were developed on top of the Unix system using C programming language. The Unix system features that were adopted for this implementation were multitasking, signals, shared memory, semaphores, sockets, timers and process control. The problems encountered, and solved, were signal loss, shared memory conflicts, process synchronization, scheduling, data alignment and errors in the SCM specification itself. The result was a correctly functioning program which implemented the SNR protocol. The system was tested using different connection modes, lost packets, duplicate packets and large data transfers. The contributions of this thesis are: (1) implementation of the receiver part of the SNR high speed transport protocol; (2) testing and integration with the transmitter part of the SNR transport protocol on an FDDI data link layered network; (3) demonstration of the functions of the SNR transport protocol such as connection management, sequenced delivery, flow control and error recovery using selective repeat methods of retransmission; and (4) modifications to the SNR transport protocol specification such as corrections for incorrect predicate conditions, defining of additional packet types formats, solutions for signal lost and processes contention problems etc.

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.

Cellular-V2X Communications for Platooning: Design and Evaluation

PubMed Central

2018-01-01

Platooning is a cooperative driving application where autonomous/semi-autonomous vehicles move on the same lane in a train-like manner, keeping a small constant inter-vehicle distance, in order to reduce fuel consumption and gas emissions and to achieve safe and efficient transport. To this aim, they may exploit multiple on-board sensors (e.g., radars, LiDARs, positioning systems) and direct vehicle-to-vehicle communications to synchronize their manoeuvres. The main objective of this paper is to discuss the design choices and factors that determine the performance of a platooning application, when exploiting the emerging cellular vehicle-to-everything (C-V2X) communication technology and considering the scheduled mode, specified by 3GPP for communications over the sidelink assisted by the eNodeB. Since no resource management algorithm is currently mandated by 3GPP for this new challenging context, we focus on analyzing the feasibility and performance of the dynamic scheduling approach, with platoon members asking for radio resources on a per-packet basis. We consider two ways of implementing dynamic scheduling, currently unspecified by 3GPP: the sequential mode, that is somehow reminiscent of time division multiple access solutions based on IEEE 802.11p—till now the only investigated access technology for platooning—and the simultaneous mode with spatial frequency reuse enabled by the eNodeB. The evaluation conducted through system-level simulations provides helpful insights about the proposed configurations and C-V2X parameter settings that mainly affect the reliability and latency performance of data exchange in platoons, under different load settings. Achieved results show that the proposed simultaneous mode succeeds in reducing the latency in the update cycle in each vehicle’s controller, thus enabling future high-density platooning scenarios. PMID:29751690

Cellular-V2X Communications for Platooning: Design and Evaluation.

PubMed

Nardini, Giovanni; Virdis, Antonio; Campolo, Claudia; Molinaro, Antonella; Stea, Giovanni

2018-05-11

Platooning is a cooperative driving application where autonomous/semi-autonomous vehicles move on the same lane in a train-like manner, keeping a small constant inter-vehicle distance, in order to reduce fuel consumption and gas emissions and to achieve safe and efficient transport. To this aim, they may exploit multiple on-board sensors (e.g., radars, LiDARs, positioning systems) and direct vehicle-to-vehicle communications to synchronize their manoeuvres. The main objective of this paper is to discuss the design choices and factors that determine the performance of a platooning application, when exploiting the emerging cellular vehicle-to-everything (C-V2X) communication technology and considering the scheduled mode, specified by 3GPP for communications over the sidelink assisted by the eNodeB. Since no resource management algorithm is currently mandated by 3GPP for this new challenging context, we focus on analyzing the feasibility and performance of the dynamic scheduling approach, with platoon members asking for radio resources on a per-packet basis. We consider two ways of implementing dynamic scheduling, currently unspecified by 3GPP: the sequential mode, that is somehow reminiscent of time division multiple access solutions based on IEEE 802.11p-till now the only investigated access technology for platooning-and the simultaneous mode with spatial frequency reuse enabled by the eNodeB. The evaluation conducted through system-level simulations provides helpful insights about the proposed configurations and C-V2X parameter settings that mainly affect the reliability and latency performance of data exchange in platoons, under different load settings. Achieved results show that the proposed simultaneous mode succeeds in reducing the latency in the update cycle in each vehicle's controller, thus enabling future high-density platooning scenarios.

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

DTIC Science & Technology

2014-02-12

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

Distributed Topology Organization and Transmission Scheduling in Wireless Ad Hoc Networks

DTIC Science & Technology

2004-01-01

slot consists of two mini -slots that support that support full-duplex transfer–one for master-to-slave transmission and the other from slave-to-master...protocol storage requirement would only be 208 bits in this case. 111 Communication requirements Each half-duplex mini -slot can be used by either a data or...either a data or control packet, eq. (4.2) sets the minimum half-duplex mini -slot size in the system or equivalently, the maximum system period

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.

Joint Cross-Layer Design for Wireless QoS Content Delivery

NASA Astrophysics Data System (ADS)

Chen, Jie; Lv, Tiejun; Zheng, Haitao

2005-12-01

In this paper, we propose a joint cross-layer design for wireless quality-of-service (QoS) content delivery. Central to our proposed cross-layer design is the concept of adaptation. Adaptation represents the ability to adjust protocol stacks and applications to respond to channel variations. We focus our cross-layer design especially on the application, media access control (MAC), and physical layers. The network is designed based on our proposed fast frequency-hopping orthogonal frequency division multiplex (OFDM) technique. We also propose a QoS-awareness scheduler and a power adaptation transmission scheme operating at both the base station and mobile sides. The proposed MAC scheduler coordinates the transmissions of an IP base station and mobile nodes. The scheduler also selects appropriate transmission formats and packet priorities for individual users based on current channel conditions and the users' QoS requirements. The test results show that our cross-layer design provides an excellent framework for wireless QoS content delivery.

Spacelab system analysis: The modified free access protocol: An access protocol for communication systems with periodic and Poisson traffic

NASA Technical Reports Server (NTRS)

Ingels, Frank; Owens, John; Daniel, Steven

1989-01-01

The protocol definition and terminal hardware for the modified free access protocol, a communications protocol similar to Ethernet, are developed. A MFA protocol simulator and a CSMA/CD math model are also developed. The protocol is tailored to communication systems where the total traffic may be divided into scheduled traffic and Poisson traffic. The scheduled traffic should occur on a periodic basis but may occur after a given event such as a request for data from a large number of stations. The Poisson traffic will include alarms and other random traffic. The purpose of the protocol is to guarantee that scheduled packets will be delivered without collision. This is required in many control and data collection systems. The protocol uses standard Ethernet hardware and software requiring minimum modifications to an existing system. The modification to the protocol only affects the Ethernet transmission privileges and does not effect the Ethernet receiver.

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.

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.

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

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.

PHACK: An Efficient Scheme for Selective Forwarding Attack Detection in WSNs.

PubMed

Liu, Anfeng; Dong, Mianxiong; Ota, Kaoru; Long, Jun

2015-12-09

In this paper, a Per-Hop Acknowledgement (PHACK)-based scheme is proposed for each packet transmission to detect selective forwarding attacks. In our scheme, the sink and each node along the forwarding path generate an acknowledgement (ACK) message for each received packet to confirm the normal packet transmission. The scheme, in which each ACK is returned to the source node along a different routing path, can significantly increase the resilience against attacks because it prevents an attacker from compromising nodes in the return routing path, which can otherwise interrupt the return of nodes' ACK packets. For this case, the PHACK scheme also has better potential to detect abnormal packet loss and identify suspect nodes as well as better resilience against attacks. Another pivotal issue is the network lifetime of the PHACK scheme, as it generates more acknowledgements than previous ACK-based schemes. We demonstrate that the network lifetime of the PHACK scheme is not lower than that of other ACK-based schemes because the scheme just increases the energy consumption in non-hotspot areas and does not increase the energy consumption in hotspot areas. Moreover, the PHACK scheme greatly simplifies the protocol and is easy to implement. Both theoretical and simulation results are given to demonstrate the effectiveness of the proposed scheme in terms of high detection probability and the ability to identify suspect nodes.

PHACK: An Efficient Scheme for Selective Forwarding Attack Detection in WSNs

PubMed Central

Liu, Anfeng; Dong, Mianxiong; Ota, Kaoru; Long, Jun

2015-01-01

In this paper, a Per-Hop Acknowledgement (PHACK)-based scheme is proposed for each packet transmission to detect selective forwarding attacks. In our scheme, the sink and each node along the forwarding path generate an acknowledgement (ACK) message for each received packet to confirm the normal packet transmission. The scheme, in which each ACK is returned to the source node along a different routing path, can significantly increase the resilience against attacks because it prevents an attacker from compromising nodes in the return routing path, which can otherwise interrupt the return of nodes’ ACK packets. For this case, the PHACK scheme also has better potential to detect abnormal packet loss and identify suspect nodes as well as better resilience against attacks. Another pivotal issue is the network lifetime of the PHACK scheme, as it generates more acknowledgements than previous ACK-based schemes. We demonstrate that the network lifetime of the PHACK scheme is not lower than that of other ACK-based schemes because the scheme just increases the energy consumption in non-hotspot areas and does not increase the energy consumption in hotspot areas. Moreover, the PHACK scheme greatly simplifies the protocol and is easy to implement. Both theoretical and simulation results are given to demonstrate the effectiveness of the proposed scheme in terms of high detection probability and the ability to identify suspect nodes. PMID:26690178

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

President Bill Clinton visits JSC

NASA Image and Video Library

1998-04-14

S98-05017 (14 April 1998) --- President Bill Clinton prepares to use a fork to sample some space food while visiting NASA's Johnson Space Center (JSC). Holding the food packet is U.S. Sen. John H. Glenn Jr. (D.-Ohio), currently in training at JSC as a payload specialist for a flight scheduled later this year aboard the Space Shuttle Discovery. Looking on is astronaut Curtis L. Brown Jr., STS-95 commander. The picture was taken in the full fuselage trainer (FFT). Photo Credit: Joe McNally, National Geographic, for NASA

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

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.

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.

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.

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

Call for Papers: Photonics in Switching

NASA Astrophysics Data System (ADS)

Wosinska, Lena; Glick, Madeleine

2006-04-01

Call for Papers: Photonics in Switching

Guest Editors:

Lena Wosinska, Royal Institute of Technology (KTH) / ICT Sweden Madeleine Glick, Intel Research, Cambridge, UK

Scope of Submission

• WDM node architectures
• Novel device technologies enabling photonics in switching, such as optical switch fabrics, optical memory, and wavelength conversion
• Routing protocols
• WDM switching and routing
• Quality of service
• Performance measurement and evaluation
• Next-generation optical networks: architecture, signaling, and control
• Traffic measurement and field trials
• Optical burst and packet switching
• OBS/OPS node architectures
• Burst/Packet scheduling and routing algorithms
• Contention resolution/avoidance strategies
• Services and applications for OBS/OPS (e.g., grid networks, storage-area networks, etc.)
• Burst assembly and ingress traffic shaping
• Hybrid OBS/TDM or OBS/wavelength routing

Manuscript Submission

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

Energy conservation in ad hoc multimedia networks using traffic-shaping mechanisms

NASA Astrophysics Data System (ADS)

Chandra, Surendar

2003-12-01

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

A novel LTE scheduling algorithm for green technology in smart grid.

PubMed

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

PubMed Central

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703

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.

Flexible quality of service model for wireless body area sensor networks.

PubMed

Liao, Yangzhe; Leeson, Mark S; Higgins, Matthew D

2016-03-01

Wireless body area sensor networks (WBASNs) are becoming an increasingly significant breakthrough technology for smart healthcare systems, enabling improved clinical decision-making in daily medical care. Recently, radio frequency ultra-wideband technology has developed substantially for physiological signal monitoring due to its advantages such as low-power consumption, high transmission data rate, and miniature antenna size. Applications of future ubiquitous healthcare systems offer the prospect of collecting human vital signs, early detection of abnormal medical conditions, real-time healthcare data transmission and remote telemedicine support. However, due to the technical constraints of sensor batteries, the supply of power is a major bottleneck for healthcare system design. Moreover, medium access control (MAC) needs to support reliable transmission links that allow sensors to transmit data safely and stably. In this Letter, the authors provide a flexible quality of service model for ad hoc networks that can support fast data transmission, adaptive schedule MAC control, and energy efficient ubiquitous WBASN networks. Results show that the proposed multi-hop communication ad hoc network model can balance information packet collisions and power consumption. Additionally, wireless communications link in WBASNs can effectively overcome multi-user interference and offer high transmission data rates for healthcare systems.

TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks

USGS Publications Warehouse

Song, W.-Z.; Huang, R.; Shirazi, B.; Husent, R.L.

2009-01-01

Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This motivates us to design an innovative localized TDMA MAC protocol to achieve high throughput and low congestion in data collection sensor networks, besides energy conservation. TreeMAC divides a time cycle into frames and frame into slots. Parent determines children's frame assigmnent based on their relative bandwidth demand, and each node calculates its own slot assignment based on its hop-count to the sink. This innovative 2-dimensional frame-slot assignment algorithm has the following nice theory properties. Firstly, given any node, at any time slot, there is at most one active sender in its neighborhood (includ ing itself). Secondly, the packet scheduling with TreelMAC is bufferless, which therefore minimizes the probability of network congestion. Thirdly, the data throughput to gateway is at least 1/3 of the optimum assuming reliable links. Our experiments on a 24 node test bed demonstrate that TreeMAC protocol significantly improves network throughput and energy efficiency, by comparing to the TinyOS's default CSMA MAC protocol and a recent TDMA MAC protocol Funneling-MAC[8]. ?? 2009 IEEE.

Towards a hybrid energy efficient multi-tree-based optimized routing protocol for wireless networks.

PubMed

Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

2012-12-13

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm.

Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

PubMed Central

Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

2012-01-01

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm. PMID:23443398

Wireless Sensor Node Power Profiling Based on IEEE 802.11 and IEEE 802.15.4 Communication Protocols. Modeling and Simulation

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

Agarwal, Vivek; Richardson, Joseph; Zhang, Yanliang

Most wireless sensor network (comprising of thousands of WSNs) applications require operation over extended periods of time beginning with their deployment. Network lifetime is extremely critical for most applications and is one of the limiting factors for energy-constrained networks. Based on applications, there are wide ranges of different energy sources suitable for powering WSNs. A battery is traditionally used to power WSNs. The deployed WSN is required to last for long time. Due to finite amount of energy present in batteries, it is not feasible to replace batteries. Recently there has been a new surge in the area of energymore » harvesting were ambient energy in the environment can be utilized to prolong the lifetime of WSNs. Some of the sources of ambient energies are solar power, thermal gradient, human motion and body heat, vibrations, and ambient RF energy. The design and development of TEGs to power WSNs that would remain active for a long period of time requires comprehensive understanding of WSN operational. This motivates the research in modeling the lifetime, i.e., power consumption, of a WSN by taking into consideration various node and network level activities. A WSN must perform three essential tasks: sense events, perform quick local information processing of sensed events, and wirelessly exchange locally processed data with the base station or with other WSNs in the network. Each task has a power cost per unit tine and an additional cost when switching between tasks. There are number of other considerations that must also be taken into account when computing the power consumption associated with each task. The considerations includes: number of events occurring in a fixed active time period and the duration of each event, event-information processing time, total communication time, number of retransmission, etc. Additionally, at the network level the communication of information data packets between WSNs involves collisions, latency, and retransmission, which result in unanticipated power losses. This report focuses rigorous stochastic modeling of power demand for a schedule-driven WSN utilizing Institute of Electrical and Electronics Engineers 802.11 and 802.15.4 communication protocols. The model captures the generic operation of a schedule-driven WSN when an external event occurs, i.e., sensing, following by processing, and followed by communication. The report will present development of an expression to compute the expected energy consumption per operational cycle of a schedule-driven WSN by taking into consideration the node level activities, i.e., sensing and processing, and the network level activities, i.e., channel access, packet collision, retransmission attempts, and transmission of a data packet.« less

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.

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

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.

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.

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks

PubMed Central

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

2016-01-01

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

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks.

PubMed

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

2016-02-26

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

Effects of wireless packet loss in industrial process control systems.

PubMed

Liu, Yongkang; Candell, Richard; Moayeri, Nader

2017-05-01

Timely and reliable sensing and actuation control are essential in networked control. This depends on not only the precision/quality of the sensors and actuators used but also on how well the communications links between the field instruments and the controller have been designed. Wireless networking offers simple deployment, reconfigurability, scalability, and reduced operational expenditure, and is easier to upgrade than wired solutions. However, the adoption of wireless networking has been slow in industrial process control due to the stochastic and less than 100% reliable nature of wireless communications and lack of a model to evaluate the effects of such communications imperfections on the overall control performance. In this paper, we study how control performance is affected by wireless link quality, which in turn is adversely affected by severe propagation loss in harsh industrial environments, co-channel interference, and unintended interference from other devices. We select the Tennessee Eastman Challenge Model (TE) for our study. A decentralized process control system, first proposed by N. Ricker, is adopted that employs 41 sensors and 12 actuators to manage the production process in the TE plant. We consider the scenario where wireless links are used to periodically transmit essential sensor measurement data, such as pressure, temperature and chemical composition to the controller as well as control commands to manipulate the actuators according to predetermined setpoints. We consider two models for packet loss in the wireless links, namely, an independent and identically distributed (IID) packet loss model and the two-state Gilbert-Elliot (GE) channel model. While the former is a random loss model, the latter can model bursty losses. With each channel model, the performance of the simulated decentralized controller using wireless links is compared with the one using wired links providing instant and 100% reliable communications. The sensitivity of the controller to the burstiness of packet loss is also characterized in different process stages. The performance results indicate that wireless links with redundant bandwidth reservation can meet the requirements of the TE process model under normal operational conditions. When disturbances are introduced in the TE plant model, wireless packet loss during transitions between process stages need further protection in severely impaired links. Techniques such as retransmission scheduling, multipath routing and enhanced physical layer design are discussed and the latest industrial wireless protocols are compared. Published by Elsevier Ltd.

Effects of Wireless Packet Loss in Industrial Process Control Systems

PubMed Central

Liu, Yongkang; Candell, Richard; Moayeri, Nader

2017-01-01

Timely and reliable sensing and actuation control are essential in networked control. This depends on not only the precision/quality of the sensors and actuators used but also on how well the communications links between the field instruments and the controller have been designed. Wireless networking offers simple deployment, reconfigurability, scalability, and reduced operational expenditure, and is easier to upgrade than wired solutions. However, the adoption of wireless networking has been slow in industrial process control due to the stochastic and less than 100 % reliable nature of wireless communications and lack of a model to evaluate the effects of such communications imperfections on the overall control performance. In this paper, we study how control performance is affected by wireless link quality, which in turn is adversely affected by severe propagation loss in harsh industrial environments, co-channel interference, and unintended interference from other devices. We select the Tennessee Eastman Challenge Model (TE) for our study. A decentralized process control system, first proposed by N. Ricker, is adopted that employs 41 sensors and 12 actuators to manage the production process in the TE plant. We consider the scenario where wireless links are used to periodically transmit essential sensor measurement data, such as pressure, temperature and chemical composition to the controller as well as control commands to manipulate the actuators according to predetermined setpoints. We consider two models for packet loss in the wireless links, namely, an independent and identically distributed (IID) packet loss model and the two-state Gilbert-Elliot (GE) channel model. While the former is a random loss model, the latter can model bursty losses. With each channel model, the performance of the simulated decentralized controller using wireless links is compared with the one using wired links providing instant and 100 % reliable communications. The sensitivity of the controller to the burstiness of packet loss is also characterized in different process stages. The performance results indicate that wireless links with redundant bandwidth reservation can meet the requirements of the TE process model under normal operational conditions. When disturbances are introduced in the TE plant model, wireless packet loss during transitions between process stages need further protection in severely impaired links. Techniques such as retransmission scheduling, multipath routing and enhanced physical layer design are discussed and the latest industrial wireless protocols are compared. PMID:28190566

Modeling and distributed gain scheduling strategy for load frequency control in smart grids with communication topology changes.

PubMed

Liu, Shichao; Liu, Xiaoping P; El Saddik, Abdulmotaleb

2014-03-01

In this paper, we investigate the modeling and distributed control problems for the load frequency control (LFC) in a smart grid. In contrast with existing works, we consider more practical and real scenarios, where the communication topology of the smart grid changes because of either link failures or packet losses. These topology changes are modeled as a time-varying communication topology matrix. By using this matrix, a new closed-loop power system model is proposed to integrate the communication topology changes into the dynamics of a physical power system. The globally asymptotical stability of this closed-loop power system is analyzed. A distributed gain scheduling LFC strategy is proposed to compensate for the potential degradation of dynamic performance (mean square errors of state vectors) of the power system under communication topology changes. In comparison to conventional centralized control approaches, the proposed method can improve the robustness of the smart grid to the variation of the communication network as well as to reduce computation load. Simulation results show that the proposed distributed gain scheduling approach is capable to improve the robustness of the smart grid to communication topology changes. © 2013 ISA. Published by ISA. All rights reserved.

Link Scheduling Algorithm with Interference Prediction for Multiple Mobile WBANs

PubMed Central

Le, Thien T. T.

2017-01-01

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

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.

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

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

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

2003-09-01

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

Efficiently Scheduling Multi-core Guest Virtual Machines on Multi-core Hosts in Network Simulation

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

Yoginath, Srikanth B; Perumalla, Kalyan S

2011-01-01

Virtual machine (VM)-based simulation is a method used by network simulators to incorporate realistic application behaviors by executing actual VMs as high-fidelity surrogates for simulated end-hosts. A critical requirement in such a method is the simulation time-ordered scheduling and execution of the VMs. Prior approaches such as time dilation are less efficient due to the high degree of multiplexing possible when multiple multi-core VMs are simulated on multi-core host systems. We present a new simulation time-ordered scheduler to efficiently schedule multi-core VMs on multi-core real hosts, with a virtual clock realized on each virtual core. The distinguishing features of ourmore » approach are: (1) customizable granularity of the VM scheduling time unit on the simulation time axis, (2) ability to take arbitrary leaps in virtual time by VMs to maximize the utilization of host (real) cores when guest virtual cores idle, and (3) empirically determinable optimality in the tradeoff between total execution (real) time and time-ordering accuracy levels. Experiments show that it is possible to get nearly perfect time-ordered execution, with a slight cost in total run time, relative to optimized non-simulation VM schedulers. Interestingly, with our time-ordered scheduler, it is also possible to reduce the time-ordering error from over 50% of non-simulation scheduler to less than 1% realized by our scheduler, with almost the same run time efficiency as that of the highly efficient non-simulation VM schedulers.« less

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.

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors.

PubMed

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-07-08

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction.

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.

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

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

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.

TinyOS-based quality of service management in wireless sensor networks

USGS Publications Warehouse

Peterson, N.; Anusuya-Rangappa, L.; Shirazi, B.A.; Huang, R.; Song, W.-Z.; Miceli, M.; McBride, D.; Hurson, A.; LaHusen, R.

2009-01-01

Previously the cost and extremely limited capabilities of sensors prohibited Quality of Service (QoS) implementations in wireless sensor networks. With advances in technology, sensors are becoming significantly less expensive and the increases in computational and storage capabilities are opening the door for new, sophisticated algorithms to be implemented. Newer sensor network applications require higher data rates with more stringent priority requirements. We introduce a dynamic scheduling algorithm to improve bandwidth for high priority data in sensor networks, called Tiny-DWFQ. Our Tiny-Dynamic Weighted Fair Queuing scheduling algorithm allows for dynamic QoS for prioritized communications by continually adjusting the treatment of communication packages according to their priorities and the current level of network congestion. For performance evaluation, we tested Tiny-DWFQ, Tiny-WFQ (traditional WFQ algorithm implemented in TinyOS), and FIFO queues on an Imote2-based wireless sensor network and report their throughput and packet loss. Our results show that Tiny-DWFQ performs better in all test cases. ?? 2009 IEEE.

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.

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.

A novel lost packets recovery scheme based on visual secret sharing

NASA Astrophysics Data System (ADS)

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

2017-08-01

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

Extensible packet processing architecture

DOEpatents

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

2013-08-20

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

Non-Evolutionary Algorithms for Scheduling Dependent Tasks in Distributed Heterogeneous Computing Environments

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

Wayne F. Boyer; Gurdeep S. Hura

2005-09-01

The Problem of obtaining an optimal matching and scheduling of interdependent tasks in distributed heterogeneous computing (DHC) environments is well known to be an NP-hard problem. In a DHC system, task execution time is dependent on the machine to which it is assigned and task precedence constraints are represented by a directed acyclic graph. Recent research in evolutionary techniques has shown that genetic algorithms usually obtain more efficient schedules that other known algorithms. We propose a non-evolutionary random scheduling (RS) algorithm for efficient matching and scheduling of inter-dependent tasks in a DHC system. RS is a succession of randomized taskmore » orderings and a heuristic mapping from task order to schedule. Randomized task ordering is effectively a topological sort where the outcome may be any possible task order for which the task precedent constraints are maintained. A detailed comparison to existing evolutionary techniques (GA and PSGA) shows the proposed algorithm is less complex than evolutionary techniques, computes schedules in less time, requires less memory and fewer tuning parameters. Simulation results show that the average schedules produced by RS are approximately as efficient as PSGA schedules for all cases studied and clearly more efficient than PSGA for certain cases. The standard formulation for the scheduling problem addressed in this paper is Rm|prec|Cmax.,« less

Scheduling for energy and reliability management on multiprocessor real-time systems

NASA Astrophysics Data System (ADS)

Qi, Xuan

Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.

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

NASA Astrophysics Data System (ADS)

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

2017-10-01

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

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.

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…

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors

PubMed Central

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-01-01

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction. PMID:27399722

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.

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.

Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

PubMed Central

Loganathan, Shyamala; Mukherjee, Saswati

2015-01-01

Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms. PMID:26473166

Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter.

PubMed

Loganathan, Shyamala; Mukherjee, Saswati

2015-01-01

Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

Hybrid scheduling mechanisms for Next-generation Passive Optical Networks based on network coding

NASA Astrophysics Data System (ADS)

Zhao, Jijun; Bai, Wei; Liu, Xin; Feng, Nan; Maier, Martin

2014-10-01

Network coding (NC) integrated into Passive Optical Networks (PONs) is regarded as a promising solution to achieve higher throughput and energy efficiency. To efficiently support multimedia traffic under this new transmission mode, novel NC-based hybrid scheduling mechanisms for Next-generation PONs (NG-PONs) including energy management, time slot management, resource allocation, and Quality-of-Service (QoS) scheduling are proposed in this paper. First, we design an energy-saving scheme that is based on Bidirectional Centric Scheduling (BCS) to reduce the energy consumption of both the Optical Line Terminal (OLT) and Optical Network Units (ONUs). Next, we propose an intra-ONU scheduling and an inter-ONU scheduling scheme, which takes NC into account to support service differentiation and QoS assurance. The presented simulation results show that BCS achieves higher energy efficiency under low traffic loads, clearly outperforming the alternative NC-based Upstream Centric Scheduling (UCS) scheme. Furthermore, BCS is shown to provide better QoS assurance.

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.

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

QoS-Oriented High Dynamic Resource Allocation in Vehicular Communication Networks

PubMed Central

2014-01-01

Vehicular ad hoc networks (VANETs) are emerging as new research area and attracting an increasing attention from both industry and research communities. In this context, a dynamic resource allocation policy that maximizes the use of available resources and meets the quality of service (QoS) requirement of constraining applications is proposed. It is a combination of a fair packet scheduling policy and a new adaptive QoS oriented call admission control (CAC) scheme based on the vehicle density variation. This scheme decides whether the connection request is to be admitted into the system, while providing fair access and guaranteeing the desired throughput. The proposed algorithm showed good performance in testing in real world environment. PMID:24616639

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.

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

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.

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.

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

PubMed

Lee, Jinseong; Lee, Jaiyong

2017-09-01

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

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

PubMed Central

2017-01-01

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

Speech transport for packet telephony and voice over IP

NASA Astrophysics Data System (ADS)

Baker, Maurice R.

1999-11-01

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

Threatened and Endangered Species: Tour Packet.

ERIC Educational Resources Information Center

Coats, Victoria; Samia, Cory

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

Development of optical packet and circuit integrated ring network testbed.

PubMed

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

2011-12-12

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

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

PubMed

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

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

The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems

NASA Astrophysics Data System (ADS)

Paprocka, I.; Kempa, W. M.; Grabowik, C.; Kalinowski, K.; Krenczyk, D.

2016-08-01

In the paper a survey of predictive and reactive scheduling methods is done in order to evaluate how the ability of prediction of reliability characteristics influences over robustness criteria. The most important reliability characteristics are: Mean Time to Failure, Mean Time of Repair. Survey analysis is done for a job shop scheduling problem. The paper answers the question: what method generates robust schedules in the case of a bottleneck failure occurrence before, at the beginning of planned maintenance actions or after planned maintenance actions? Efficiency of predictive schedules is evaluated using criteria: makespan, total tardiness, flow time, idle time. Efficiency of reactive schedules is evaluated using: solution robustness criterion and quality robustness criterion. This paper is the continuation of the research conducted in the paper [1], where the survey of predictive and reactive scheduling methods is done only for small size scheduling problems.

Design and implementation of priority and time-window based traffic scheduling and routing-spectrum allocation mechanism in elastic optical networks

NASA Astrophysics Data System (ADS)

Wang, Honghuan; Xing, Fangyuan; Yin, Hongxi; Zhao, Nan; Lian, Bizhan

2016-02-01

With the explosive growth of network services, the reasonable traffic scheduling and efficient configuration of network resources have an important significance to increase the efficiency of the network. In this paper, an adaptive traffic scheduling policy based on the priority and time window is proposed and the performance of this algorithm is evaluated in terms of scheduling ratio. The routing and spectrum allocation are achieved by using the Floyd shortest path algorithm and establishing a node spectrum resource allocation model based on greedy algorithm, which is proposed by us. The fairness index is introduced to improve the capability of spectrum configuration. The results show that the designed traffic scheduling strategy can be applied to networks with multicast and broadcast functionalities, and makes them get real-time and efficient response. The scheme of node spectrum configuration improves the frequency resource utilization and gives play to the efficiency of the network.

A System-Wide Approach to Physician Efficiency and Utilization Rates for Non-Operating Room Anesthesia Sites.

PubMed

Tsai, Mitchell H; Huynh, Tinh T; Breidenstein, Max W; O'Donnell, Stephen E; Ehrenfeld, Jesse M; Urman, Richard D

2017-07-01

There has been little in the development or application of operating room (OR) management metrics to non-operating room anesthesia (NORA) sites. This is in contrast to the well-developed management framework for the OR management. We hypothesized that by adopting the concept of physician efficiency, we could determine the applicability of this clinical productivity benchmark for physicians providing services for NORA cases at a tertiary care center. We conducted a retrospective data analysis of NORA sites at an academic, rural hospital, including both adult and pediatric patients. Using the time stamps from WiseOR® (Palo Alto, CA), we calculated site utilization and physician efficiency for each day. We defined scheduling efficiency (SE) as the number of staffed anesthesiologists divided by the number of staffed sites and stratified the data into three categories (SE < 1, SE = 1, and SE >1). The mean physician efficiency was 0.293 (95% CI, [0.281, 0.305]), and the mean site utilization was 0.328 (95% CI, [0.314, 0.343]). When days were stratified by scheduling efficiency (SE < 1, =1, or >1), we found differences between physician efficiency and site utilization. On days where scheduling efficiency was less than 1, that is, there are more sites than physicians, mean physician efficiency (95% CI, [0.326, 0.402]) was higher than mean site utilization (95% CI, [0.250, 0.296]). We demonstrate that scheduling efficiency vis-à-vis physician efficiency as an OR management metric diverge when anesthesiologists travel between NORA sites. When the opportunity to scale operational efficiencies is limited, increasing scheduling efficiency by incorporating different NORA sites into a "block" allocation on any given day may be the only suitable tactical alternative.

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.

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.

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.

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.

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.

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.

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.

Energy Efficient Real-Time Scheduling Using DPM on Mobile Sensors with a Uniform Multi-Cores

PubMed Central

Kim, Youngmin; Lee, Chan-Gun

2017-01-01

In wireless sensor networks (WSNs), sensor nodes are deployed for collecting and analyzing data. These nodes use limited energy batteries for easy deployment and low cost. The use of limited energy batteries is closely related to the lifetime of the sensor nodes when using wireless sensor networks. Efficient-energy management is important to extending the lifetime of the sensor nodes. Most effort for improving power efficiency in tiny sensor nodes has focused mainly on reducing the power consumed during data transmission. However, recent emergence of sensor nodes equipped with multi-cores strongly requires attention to be given to the problem of reducing power consumption in multi-cores. In this paper, we propose an energy efficient scheduling method for sensor nodes supporting a uniform multi-cores. We extend the proposed T-Ler plane based scheduling for global optimal scheduling of a uniform multi-cores and multi-processors to enable power management using dynamic power management. In the proposed approach, processor selection for a scheduling and mapping method between the tasks and processors is proposed to efficiently utilize dynamic power management. Experiments show the effectiveness of the proposed approach compared to other existing methods. PMID:29240695

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

Pre-Scheduled and Self Organized Sleep-Scheduling Algorithms for Efficient K-Coverage in Wireless Sensor Networks

PubMed Central

Hwang, I-Shyan

2017-01-01

The K-coverage configuration that guarantees coverage of each location by at least K sensors is highly popular and is extensively used to monitor diversified applications in wireless sensor networks. Long network lifetime and high detection quality are the essentials of such K-covered sleep-scheduling algorithms. However, the existing sleep-scheduling algorithms either cause high cost or cannot preserve the detection quality effectively. In this paper, the Pre-Scheduling-based K-coverage Group Scheduling (PSKGS) and Self-Organized K-coverage Scheduling (SKS) algorithms are proposed to settle the problems in the existing sleep-scheduling algorithms. Simulation results show that our pre-scheduled-based KGS approach enhances the detection quality and network lifetime, whereas the self-organized-based SKS algorithm minimizes the computation and communication cost of the nodes and thereby is energy efficient. Besides, SKS outperforms PSKGS in terms of network lifetime and detection quality as it is self-organized. PMID:29257078

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.

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

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.

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.

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.

Scheduling lessons learned from the Autonomous Power System

NASA Technical Reports Server (NTRS)

Ringer, Mark J.

1992-01-01

The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.

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.

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.

Increasing operating room efficiency through electronic medical record analysis.

PubMed

Attaallah, A F; Elzamzamy, O M; Phelps, A L; Ranganthan, P; Vallejo, M C

2016-05-01

We used electronic medical record (EMR) analysis to determine errors in operating room (OR) time utilisation. Over a two year period EMR data of 44,503 surgical procedures was analysed for OR duration, on-time, first case, and add-on time performance, within 19 surgical specialties. Maximal OR time utilisation at our institution could have saved over 302,620 min or 5,044 hours of OR efficiency over a two year period. Most specialties (78.95%) had inaccurately scheduled procedure times and therefore used the OR more than their scheduled allotment time. Significant differences occurred between the mean scheduled surgical durations (101.38 ± 87.11 min) and actual durations (108.18 ± 102.27 min; P < 0.001). Significant differences also occurred between the mean scheduled add-on durations (111.4 ± 75.5 min) and the actual add-on scheduled durations (118.6 ± 90.1 minutes; P < 0.001). EMR quality improvement analysis can be used to determine scheduling error and bias, in order to improve efficiency and increase OR time utilisation.

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

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.

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.

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

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

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

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.

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.

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.

9 CFR 307.4 - Schedule of operations.

Code of Federal Regulations, 2010 CFR

2010-01-01

... inspectors shall not, except as provided herein, occur prior to 4 hours after the beginning of scheduled... efficient and effective use of inspection personnel. The work schedule must specify daily clock hours of... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Schedule of operations. 307.4 Section...

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.

Framework for computationally efficient optimal irrigation scheduling using ant colony optimization

USDA-ARS?s Scientific Manuscript database

A general optimization framework is introduced with the overall goal of reducing search space size and increasing the computational efficiency of evolutionary algorithm application for optimal irrigation scheduling. The framework achieves this goal by representing the problem in the form of a decisi...

Multichannel-Sensing Scheduling and Transmission-Energy Optimizing in Cognitive Radio Networks with Energy Harvesting.

PubMed

Hoan, Tran-Nhut-Khai; Hiep, Vu-Van; Koo, In-Soo

2016-03-31

This paper considers cognitive radio networks (CRNs) utilizing multiple time-slotted primary channels in which cognitive users (CUs) are powered by energy harvesters. The CUs are under the consideration that hardware constraints on radio devices only allow them to sense and transmit on one channel at a time. For a scenario where the arrival of harvested energy packets and the battery capacity are finite, we propose a scheme to optimize (i) the channel-sensing schedule (consisting of finding the optimal action (silent or active) and sensing order of channels) and (ii) the optimal transmission energy set corresponding to the channels in the sensing order for the operation of the CU in order to maximize the expected throughput of the CRN over multiple time slots. Frequency-switching delay, energy-switching cost, correlation in spectrum occupancy across time and frequency and errors in spectrum sensing are also considered in this work. The performance of the proposed scheme is evaluated via simulation. The simulation results show that the throughput of the proposed scheme is greatly improved, in comparison to related schemes in the literature. The collision ratio on the primary channels is also investigated.

Chip-set for quality of service support in passive optical networks

NASA Astrophysics Data System (ADS)

Ringoot, Edwin; Hoebeke, Rudy; Slabbinck, B. Hans; Verhaert, Michel

1998-10-01

In this paper the design of a chip-set for QoS provisioning in ATM-based Passive Optical Networks is discussed. The implementation of a general-purpose switch chip on the Optical Network Unit is presented, with focus on the design of the cell scheduling and buffer management logic. The cell scheduling logic supports `colored' grants, priority jumping and weighted round-robin scheduling. The switch chip offers powerful buffer management capabilities enabling the efficient support of GFR and UBR services. Multicast forwarding is also supported. In addition, the architecture of a MAC controller chip developed for a SuperPON access network is introduced. In particular, the permit scheduling logic and its implementation on the Optical Line Termination will be discussed. The chip-set enables the efficient support of services with different service requirements on the SuperPON. The permit scheduling logic built into the MAC controller chip in combination with the cell scheduling and buffer management capabilities of the switch chip can be used by network operators to offer guaranteed service performance to delay sensitive services, and to efficiently and fairly distribute any spare capacity to delay insensitive services.

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.

Increasing operating room productivity by duration categories and a newsvendor model.

PubMed

Lehtonen, Juha-Matti; Torkki, Paulus; Peltokorpi, Antti; Moilanen, Teemu

2013-01-01

Previous studies approach surgery scheduling mainly from the mathematical modeling perspective which is often hard to apply in a practical environment. The aim of this study is to develop a practical scheduling system that considers the advantages of both surgery categorization and newsvendor model to surgery scheduling. The research was carried out in a Finnish orthopaedic specialist centre that performs only joint replacement surgery. Four surgery categorization scenarios were defined and their productivity analyzed by simulation and newsvendor model. Detailed analyses of surgery durations and the use of more accurate case categories and their combinations in scheduling improved OR productivity 11.3 percent when compared to the base case. Planning to have one OR team to work longer led to remarkable decrease in scheduling inefficiency. In surgical services, productivity and cost-efficiency can be improved by utilizing historical data in case scheduling and by increasing flexibility in personnel management. The study increases the understanding of practical scheduling methods used to improve efficiency in surgical services.

Comparison of OPC job prioritization schemes to generate data for mask manufacturing

NASA Astrophysics Data System (ADS)

Lewis, Travis; Veeraraghavan, Vijay; Jantzen, Kenneth; Kim, Stephen; Park, Minyoung; Russell, Gordon; Simmons, Mark

2015-03-01

Delivering mask ready OPC corrected data to the mask shop on-time is critical for a foundry to meet the cycle time commitment for a new product. With current OPC compute resource sharing technology, different job scheduling algorithms are possible, such as, priority based resource allocation and fair share resource allocation. In order to maximize computer cluster efficiency, minimize the cost of the data processing and deliver data on schedule, the trade-offs of each scheduling algorithm need to be understood. Using actual production jobs, each of the scheduling algorithms will be tested in a production tape-out environment. Each scheduling algorithm will be judged on its ability to deliver data on schedule and the trade-offs associated with each method will be analyzed. It is now possible to introduce advance scheduling algorithms to the OPC data processing environment to meet the goals of on-time delivery of mask ready OPC data while maximizing efficiency and reducing cost.

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.

A Study on the Effect on Scheduling and Management of Surgeries with the Introduction of Excellent Medical Information.

PubMed

Mei, Tsai Ching

2016-01-01

The services of OR play an important role in the medical business for department of surgery. The most important issue for OR is about the scheduling and management of surgeries. Good surgery schedule could elevate the utilization efficiency of OR. Therefore, the introduction of excellent medical information can both dramatically elevate the work efficiency of health care employees and reduce workload to reach win-win benefits in both management and performance.

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.

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.

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

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

Scheduling job shop - A case study

NASA Astrophysics Data System (ADS)

Abas, M.; Abbas, A.; Khan, W. A.

2016-08-01

The scheduling in job shop is important for efficient utilization of machines in the manufacturing industry. There are number of algorithms available for scheduling of jobs which depend on machines tools, indirect consumables and jobs which are to be processed. In this paper a case study is presented for scheduling of jobs when parts are treated on available machines. Through time and motion study setup time and operation time are measured as total processing time for variety of products having different manufacturing processes. Based on due dates different level of priority are assigned to the jobs and the jobs are scheduled on the basis of priority. In view of the measured processing time, the times for processing of some new jobs are estimated and for efficient utilization of the machines available an algorithm is proposed and validated.

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.

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.

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

A heuristic approach to incremental and reactive scheduling

NASA Technical Reports Server (NTRS)

Odubiyi, Jide B.; Zoch, David R.

1989-01-01

An heuristic approach to incremental and reactive scheduling is described. Incremental scheduling is the process of modifying an existing schedule if the initial schedule does not meet its stated initial goals. Reactive scheduling occurs in near real-time in response to changes in available resources or the occurrence of targets of opportunity. Only minor changes are made during both incremental and reactive scheduling because a goal of re-scheduling procedures is to minimally impact the schedule. The described heuristic search techniques, which are employed by the Request Oriented Scheduling Engine (ROSE), a prototype generic scheduler, efficiently approximate the cost of reaching a goal from a given state and effective mechanisms for controlling search.

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.

Hidden Efficiencies: Making Completion of the Pediatric Vaccine Schedule More Efficient for Physicians

PubMed Central

Ciarametaro, Mike; Bradshaw, Steven E.; Guiglotto, Jillian; Hahn, Beth; Meier, Genevieve

2015-01-01

Abstract The objective of this work is to demonstrate the potential time and labor savings that may result from increased use of combination vaccinations. The study (GSK study identifier: HO-12-4735) was a model developed to evaluate the efficiency of the pediatric vaccine schedule, using time and motion studies. The model considered vaccination time and the associated labor costs, but vaccination acquisition costs were not considered. We also did not consider any efficacy or safety differences between formulations. The model inputs were supported by a targeted literature review. The reference year for the model was 2012. The most efficient vaccination program using currently available vaccines was predicted to reduce costs through a combination of fewer injections (62%) and less time per vaccination (38%). The most versus the least efficient vaccine program was predicted to result in a 47% reduction in vaccination time and a 42% reduction in labor and supply costs. The estimated administration cost saving with the most versus the least efficient program was estimated to be nearly US $45 million. If hypothetical 6- or 7-valent vaccines are developed using the already most efficient schedule by adding additional antigens (pneumococcal conjugate vaccine and Haemophilus influenzae type b) to the most efficient 5-valent vaccine, the savings are predicted to be even greater. Combination vaccinations reduce the time burden of the childhood immunization schedule and could create the potential to improve vaccination uptake and compliance as a result of fewer required injections. PMID:25634165

Enabling Secure High-Performance Wireless Ad Hoc Networking

DTIC Science & Technology

2003-05-29

destinations, consuming energy and available bandwidth. An attacker may similarly create a routing black hole, in which all packets are dropped: by sending...of the vertex cut, for example by forwarding only routing packets and not data packets, such that the nodes waste energy forwarding packets to the...with limited resources, including network bandwidth and the CPU processing capacity, memory, and battery power ( energy ) of each individual node in the

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

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.

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

PubMed

Dasgupta, Rumpa; Yoon, Seokhoon

2017-04-01

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

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

PubMed Central

Dasgupta, Rumpa; Yoon, Seokhoon

2017-01-01

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

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.

Computer-aided resource planning and scheduling for radiological services

NASA Astrophysics Data System (ADS)

Garcia, Hong-Mei C.; Yun, David Y.; Ge, Yiqun; Khan, Javed I.

1996-05-01

There exists tremendous opportunity in hospital-wide resource optimization based on system integration. This paper defines the resource planning and scheduling requirements integral to PACS, RIS and HIS integration. An multi-site case study is conducted to define the requirements. A well-tested planning and scheduling methodology, called Constrained Resource Planning model, has been applied to the chosen problem of radiological service optimization. This investigation focuses on resource optimization issues for minimizing the turnaround time to increase clinical efficiency and customer satisfaction, particularly in cases where the scheduling of multiple exams are required for a patient. How best to combine the information system efficiency and human intelligence in improving radiological services is described. Finally, an architecture for interfacing a computer-aided resource planning and scheduling tool with the existing PACS, HIS and RIS implementation is presented.

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.

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.

Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

PubMed Central

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks. PMID:22412343

Dynamic hierarchical sleep scheduling for wireless ad-hoc sensor networks.

PubMed

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

Strategies GeoCape Intelligent Observation Studies @ GSFC

NASA Technical Reports Server (NTRS)

Cappelaere, Pat; Frye, Stu; Moe, Karen; Mandl, Dan; LeMoigne, Jacqueline; Flatley, Tom; Geist, Alessandro

2015-01-01

This presentation provides information a summary of the tradeoff studies conducted for GeoCape by the GSFC team in terms of how to optimize GeoCape observation efficiency. Tradeoffs include total ground scheduling with simple priorities, ground scheduling with cloud forecast, ground scheduling with sub-area forecast, onboard scheduling with onboard cloud detection and smart onboard scheduling and onboard image processing. The tradeoffs considered optimzing cost, downlink bandwidth and total number of images acquired.

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.

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.

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

DOE PAGES

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

2015-10-26

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

Human-Machine Collaborative Optimization via Apprenticeship Scheduling

DTIC Science & Technology

2016-09-09

prenticeship Scheduling (COVAS), which performs ma- chine learning using human expert demonstration, in conjunction with optimization, to automatically and ef...ficiently produce optimal solutions to challenging real- world scheduling problems. COVAS first learns a policy from human scheduling demonstration via...apprentice- ship learning , then uses this initial solution to provide a tight bound on the value of the optimal solution, thereby substantially

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.

Irrigation scheduling and controlling crop water use efficiency with Infrared Thermometry

USDA-ARS?s Scientific Manuscript database

Scientific methods for irrigation scheduling include weather, soil and plant-based techniques. Infrared thermometers can be used a non-invasive practice to monitor canopy temperature and better manage irrigation scheduling. This presentation will discuss the theoretical basis for monitoring crop can...

Car painting process scheduling with harmony search algorithm

NASA Astrophysics Data System (ADS)

Syahputra, M. F.; Maiyasya, A.; Purnamawati, S.; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Automotive painting program in the process of painting the car body by using robot power, making efficiency in the production system. Production system will be more efficient if pay attention to scheduling of car order which will be done by considering painting body shape of car. Flow shop scheduling is a scheduling model in which the job-job to be processed entirely flows in the same product direction / path. Scheduling problems often arise if there are n jobs to be processed on the machine, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. Harmony Search Algorithm is a metaheuristic optimization algorithm based on music. The algorithm is inspired by observations that lead to music in search of perfect harmony. This musical harmony is in line to find optimal in the optimization process. Based on the tests that have been done, obtained the optimal car sequence with minimum makespan value.

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.

Optimizing Schedules of Retrieval Practice for Durable and Efficient Learning: How Much Is Enough?

ERIC Educational Resources Information Center

Rawson, Katherine A.; Dunlosky, John

2011-01-01

The literature on testing effects is vast but supports surprisingly few prescriptive conclusions for how to schedule practice to achieve both durable and efficient learning. Key limitations are that few studies have examined the effects of initial learning criterion or the effects of relearning, and no prior research has examined the combined…

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.

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.

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.

The GBT Dynamic Scheduling System: A New Scheduling Paradigm

NASA Astrophysics Data System (ADS)

O'Neil, K.; Balser, D.; Bignell, C.; Clark, M.; Condon, J.; McCarty, M.; Marganian, P.; Shelton, A.; Braatz, J.; Harnett, J.; Maddalena, R.; Mello, M.; Sessoms, E.

2009-09-01

The Robert C. Byrd Green Bank Telescope (GBT) is implementing a new Dynamic Scheduling System (DSS) designed to maximize the observing efficiency of the telescope while ensuring that none of the flexibility and ease of use of the GBT is harmed and that the data quality of observations is not adversely affected. To accomplish this, the GBT DSS is implementing a dynamic scheduling system which schedules observers, rather than running scripts. The DSS works by breaking each project into one or more sessions which have associated observing criteria such as RA, Dec, and frequency. Potential observers may also enter dates when members of their team will not be available for either on-site or remote observing. The scheduling algorithm uses those data, along with the predicted weather, to determine the most efficient schedule for the GBT. The DSS provides all observers at least 24 hours notice of their upcoming observing. In the uncommon (< 20%) case where the actual weather does not match the predictions, a backup project, chosen from the database, is run instead. Here we give an overview of the GBT DSS project, including the ranking and scheduling algorithms for the sessions, the scheduling probabilities generation, the web framework for the system, and an overview of the results from the beta testing which were held from June - September, 2008.

Simulation based energy-resource efficient manufacturing integrated with in-process virtual management

NASA Astrophysics Data System (ADS)

Katchasuwanmanee, Kanet; Cheng, Kai; Bateman, Richard

2016-09-01

As energy efficiency is one of the key essentials towards sustainability, the development of an energy-resource efficient manufacturing system is among the great challenges facing the current industry. Meanwhile, the availability of advanced technological innovation has created more complex manufacturing systems that involve a large variety of processes and machines serving different functions. To extend the limited knowledge on energy-efficient scheduling, the research presented in this paper attempts to model the production schedule at an operation process by considering the balance of energy consumption reduction in production, production work flow (productivity) and quality. An innovative systematic approach to manufacturing energy-resource efficiency is proposed with the virtual simulation as a predictive modelling enabler, which provides real-time manufacturing monitoring, virtual displays and decision-makings and consequentially an analytical and multidimensional correlation analysis on interdependent relationships among energy consumption, work flow and quality errors. The regression analysis results demonstrate positive relationships between the work flow and quality errors and the work flow and energy consumption. When production scheduling is controlled through optimization of work flow, quality errors and overall energy consumption, the energy-resource efficiency can be achieved in the production. Together, this proposed multidimensional modelling and analysis approach provides optimal conditions for the production scheduling at the manufacturing system by taking account of production quality, energy consumption and resource efficiency, which can lead to the key competitive advantages and sustainability of the system operations in the industry.

Power-based Shift Schedule for Pure Electric Vehicle with a Two-speed Automatic Transmission

NASA Astrophysics Data System (ADS)

Wang, Jiaqi; Liu, Yanfang; Liu, Qiang; Xu, Xiangyang

2016-11-01

This paper introduces a comprehensive shift schedule for a two-speed automatic transmission of pure electric vehicle. Considering about driving ability and efficiency performance of electric vehicles, the power-based shift schedule is proposed with three principles. This comprehensive shift schedule regards the vehicle current speed and motor load power as input parameters to satisfy the vehicle driving power demand with lowest energy consumption. A simulation model has been established to verify the dynamic and economic performance of comprehensive shift schedule. Compared with traditional dynamic and economic shift schedules, simulation results indicate that the power-based shift schedule is superior to traditional shift schedules.

A new distributed systems scheduling algorithm: a swarm intelligence approach

NASA Astrophysics Data System (ADS)

Haghi Kashani, Mostafa; Sarvizadeh, Raheleh; Jameii, Mahdi

2011-12-01

The scheduling problem in distributed systems is known as an NP-complete problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The task scheduling is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of distributed systems scheduling. With regard to load balancing efficiently, Artificial Bee Colony (ABC) has been applied as local search in the proposed memetic algorithm. The proposed method has been compared to existing memetic-Based approach in which Learning Automata method has been used as local search. The results demonstrated that the proposed method outperform the above mentioned method in terms of communication cost.

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.

Wave scheduling - Decentralized scheduling of task forces in multicomputers

NASA Technical Reports Server (NTRS)

Van Tilborg, A. M.; Wittie, L. D.

1984-01-01

Decentralized operating systems that control large multicomputers need techniques to schedule competing parallel programs called task forces. Wave scheduling is a probabilistic technique that uses a hierarchical distributed virtual machine to schedule task forces by recursively subdividing and issuing wavefront-like commands to processing elements capable of executing individual tasks. Wave scheduling is highly resistant to processing element failures because it uses many distributed schedulers that dynamically assign scheduling responsibilities among themselves. The scheduling technique is trivially extensible as more processing elements join the host multicomputer. A simple model of scheduling cost is used by every scheduler node to distribute scheduling activity and minimize wasted processing capacity by using perceived workload to vary decentralized scheduling rules. At low to moderate levels of network activity, wave scheduling is only slightly less efficient than a central scheduler in its ability to direct processing elements to accomplish useful work.

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.

EQUITY EVALUATION OF PADDY IRRIGATION WATER DISTRIBUTION BY SOCIETY-JUSTICE-WATER DISTRIBUTION RULE HYPOTHESIS

NASA Astrophysics Data System (ADS)

Tanji, Hajime; Kiri, Hirohide; Kobayashi, Shintaro

When total supply is smaller than total demand, it is difficult to apply the paddy irrigation water distribution rule. The gap must be narrowed by decreasing demand. Historically, the upstream served rule, rotation schedule, or central schedule weight to irrigated area was adopted. This paper proposes the hypothesis that these rules are dependent on social justice, a hypothesis called the "Society-Justice-Water Distribution Rule Hypothesis". Justice, which means a balance of efficiency and equity of distribution, is discussed under the political philosophy of utilitarianism, liberalism (Rawls), libertarianism, and communitarianism. The upstream served rule can be derived from libertarianism. The rotation schedule and central schedule can be derived from communitarianism. Liberalism can provide arranged schedule to adjust supply and demand based on "the Difference Principle". The authors conclude that to achieve efficiency and equity, liberalism may provide the best solution after modernization.

Simulated annealing with probabilistic analysis for solving traveling salesman problems

NASA Astrophysics Data System (ADS)

Hong, Pei-Yee; Lim, Yai-Fung; Ramli, Razamin; Khalid, Ruzelan

2013-09-01

Simulated Annealing (SA) is a widely used meta-heuristic that was inspired from the annealing process of recrystallization of metals. Therefore, the efficiency of SA is highly affected by the annealing schedule. As a result, in this paper, we presented an empirical work to provide a comparable annealing schedule to solve symmetric traveling salesman problems (TSP). Randomized complete block design is also used in this study. The results show that different parameters do affect the efficiency of SA and thus, we propose the best found annealing schedule based on the Post Hoc test. SA was tested on seven selected benchmarked problems of symmetric TSP with the proposed annealing schedule. The performance of SA was evaluated empirically alongside with benchmark solutions and simple analysis to validate the quality of solutions. Computational results show that the proposed annealing schedule provides a good quality of solution.

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

A generalized network flow model for the multi-mode resource-constrained project scheduling problem with discounted cash flows

NASA Astrophysics Data System (ADS)

Chen, Miawjane; Yan, Shangyao; Wang, Sin-Siang; Liu, Chiu-Lan

2015-02-01

An effective project schedule is essential for enterprises to increase their efficiency of project execution, to maximize profit, and to minimize wastage of resources. Heuristic algorithms have been developed to efficiently solve the complicated multi-mode resource-constrained project scheduling problem with discounted cash flows (MRCPSPDCF) that characterize real problems. However, the solutions obtained in past studies have been approximate and are difficult to evaluate in terms of optimality. In this study, a generalized network flow model, embedded in a time-precedence network, is proposed to formulate the MRCPSPDCF with the payment at activity completion times. Mathematically, the model is formulated as an integer network flow problem with side constraints, which can be efficiently solved for optimality, using existing mathematical programming software. To evaluate the model performance, numerical tests are performed. The test results indicate that the model could be a useful planning tool for project scheduling in the real world.

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.

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)

Computing the Expected Cost of an Appointment Schedule for Statistically Identical Customers with Probabilistic Service Times

PubMed Central

Dietz, Dennis C.

2014-01-01

A cogent method is presented for computing the expected cost of an appointment schedule where customers are statistically identical, the service time distribution has known mean and variance, and customer no-shows occur with time-dependent probability. The approach is computationally efficient and can be easily implemented to evaluate candidate schedules within a schedule optimization algorithm. PMID:24605070

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.

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

Multi-Media Instructional Packets.

ERIC Educational Resources Information Center

Brophy, John W.

This is a collection of multi-media packets for each of the following business subjects: (1) Introduction to Business; (2) Principles of Marketing; (3) Principles of Advertising; (4) Principles of Retailing/Merchandising; and (5) Principles of Salesmanship. Each packet includes information regarding: (1) most relevant textbooks; (2) Suggested…

Monitoring and Indentification Packet in Wireless With Deep Packet Inspection Method

NASA Astrophysics Data System (ADS)

Fali Oklilas, Ahmad; Tasmi

2017-04-01

Layer 2 and Layer 3 are used to make a process of network monitoring, but with the development of applications on the network such as the p2p file sharing, VoIP, encrypted, and many applications that already use the same port, it would require a system that can classify network traffics, not only based on port number classification. This paper reports the implementation of the deep packet inspection method to analyse data packets based on the packet header and payload to be used in packet data classification. If each application can be grouped based on the application layer, then we can determine the pattern of internet users and also to perform network management of computer science department. In this study, a prototype wireless network and applications SSO were developed to detect the active user. The focus is on the ability of open DPI and nDPI in detecting the payload of an application and the results are elaborated in this paper.

Thermal averages in a quantum point contact with a single coherent wave packet.

PubMed

Heller, E J; Aidala, K E; LeRoy, B J; Bleszynski, A C; Kalben, A; Westervelt, R M; Maranowski, K D; Gossard, A C

2005-07-01

A novel formal equivalence between thermal averages of coherent properties (e.g., conductance) and time averages of a single wave packet arises for Fermi gases and certain geometries. In the case of one open channel in a quantum point contact (QPC), only one wave packet history, with the wave packet width equal to the thermal length, completely determines the thermally averaged conductance. The formal equivalence moreover allows very simple physical interpretations of interference features surviving under thermal averaging. Simply put, pieces of the thermal wave packet returning to the QPC along independent paths must arrive at the same time in order to interfere. Remarkably, one immediate result of this approach is that higher temperature leads to narrower wave packets and therefore better resolution of events in the time domain. In effect, experiments at 4.2 K are performing time-gated experiments at better than a gigahertz. Experiments involving thermally averaged ballistic conductance in 2DEGS are presented as an application of this picture.

Phase Structure of Strong-Field Tunneling Wave Packets from Molecules.

PubMed

Liu, Ming-Ming; Li, Min; Wu, Chengyin; Gong, Qihuang; Staudte, André; Liu, Yunquan

2016-04-22

We study the phase structure of the tunneling wave packets from strong-field ionization of molecules and present a molecular quantum-trajectory Monte Carlo model to describe the laser-driven dynamics of photoelectron momentum distributions of molecules. Using our model, we reproduce and explain the alignment-dependent molecular frame photoelectron spectra of strong-field tunneling ionization of N_{2} reported by M. Meckel et al. [Nat. Phys. 10, 594 (2014)]. In addition to modeling the low-energy photoelectron angular distributions quantitatively, we extract the phase structure of strong-field molecular tunneling wave packets, shedding light on its physical origin. The initial phase of the tunneling wave packets at the tunnel exit depends on both the initial transverse momentum distribution and the molecular internuclear distance. We further show that the ionizing molecular orbital has a critical effect on the initial phase of the tunneling wave packets. The phase structure of the photoelectron wave packet is a key ingredient for modeling strong-field molecular photoelectron holography, high-harmonic generation, and molecular orbital imaging.

Recognition of the optical packet header for two channels utilizing the parallel reservoir computing based on a semiconductor ring laser

NASA Astrophysics Data System (ADS)

Bao, Xiurong; Zhao, Qingchun; Yin, Hongxi; Qin, Jie

2018-05-01

In this paper, an all-optical parallel reservoir computing (RC) system with two channels for the optical packet header recognition is proposed and simulated, which is based on a semiconductor ring laser (SRL) with the characteristic of bidirectional light paths. The parallel optical loops are built through the cross-feedback of the bidirectional light paths where every optical loop can independently recognize each injected optical packet header. Two input signals are mapped and recognized simultaneously by training all-optical parallel reservoir, which is attributed to the nonlinear states in the laser. The recognition of optical packet headers for two channels from 4 bits to 32 bits is implemented through the simulation optimizing system parameters and therefore, the optimal recognition error ratio is 0. Since this structure can combine with the wavelength division multiplexing (WDM) optical packet switching network, the wavelength of each channel of optical packet headers for recognition can be different, and a better recognition result can be obtained.

User-oriented end-to-end transport protocols for the real-time distribution of telemetry data from NASA spacecraft

NASA Technical Reports Server (NTRS)

Hooke, A. J.

1979-01-01

A set of standard telemetry protocols for downlink data flow facilitating the end-to-end transport of instrument data from the spacecraft to the user in real time is proposed. The direct switching of data by autonomous message 'packets' that are assembled by the source instrument on the spacecraft is discussed. The data system consists thus of a format on a message rather than word basis, and such packet telemetry would include standardized protocol headers. Standards are being developed within the NASA End-to-End Data System (NEEDS) program for the source packet and transport frame protocols. The source packet protocol contains identification of both the sequence number of the packet as it is generated by the source and the total length of the packet, while the transport frame protocol includes a sequence count defining the serial number of the frame as it is generated by the spacecraft data system, and a field specifying any 'options' selected in the format of the frame itself.

Support for non-locking parallel reception of packets belonging to a single memory reception FIFO

DOEpatents

Chen, Dong [Yorktown Heights, NY; Heidelberger, Philip [Yorktown Heights, NY; Salapura, Valentina [Yorktown Heights, NY; Senger, Robert M [Yorktown Heights, NY; Steinmacher-Burow, Burkhard [Boeblingen, DE; Sugawara, Yutaka [Yorktown Heights, NY

2011-01-27

A method and apparatus for distributed parallel messaging in a parallel computing system. A plurality of DMA engine units are configured in a multiprocessor system to operate in parallel, one DMA engine unit for transferring a current packet received at a network reception queue to a memory location in a memory FIFO (rmFIFO) region of a memory. A control unit implements logic to determine whether any prior received packet destined for that rmFIFO is still in a process of being stored in the associated memory by another DMA engine unit of the plurality, and prevent the one DMA engine unit from indicating completion of storing the current received packet in the reception memory FIFO (rmFIFO) until all prior received packets destined for that rmFIFO are completely stored by the other DMA engine units. Thus, there is provided non-locking support so that multiple packets destined for a single rmFIFO are transferred and stored in parallel to predetermined locations in a memory.

Adaptive Packet Combining Scheme in Three State Channel Model

NASA Astrophysics Data System (ADS)

Saring, Yang; Bulo, Yaka; Bhunia, Chandan Tilak

2018-01-01

The two popular techniques of packet combining based error correction schemes are: Packet Combining (PC) scheme and Aggressive Packet Combining (APC) scheme. PC scheme and APC scheme have their own merits and demerits; PC scheme has better throughput than APC scheme, but suffers from higher packet error rate than APC scheme. The wireless channel state changes all the time. Because of this random and time varying nature of wireless channel, individual application of SR ARQ scheme, PC scheme and APC scheme can't give desired levels of throughput. Better throughput can be achieved if appropriate transmission scheme is used based on the condition of channel. Based on this approach, adaptive packet combining scheme has been proposed to achieve better throughput. The proposed scheme adapts to the channel condition to carry out transmission using PC scheme, APC scheme and SR ARQ scheme to achieve better throughput. Experimentally, it was observed that the error correction capability and throughput of the proposed scheme was significantly better than that of SR ARQ scheme, PC scheme and APC scheme.

Wavelet packet-based insufficiency murmurs analysis method

NASA Astrophysics Data System (ADS)

Choi, Samjin; Jiang, Zhongwei

2007-12-01

In this paper, the aortic and mitral insufficiency murmurs analysis method using the wavelet packet technique is proposed for classifying the valvular heart defects. Considering the different frequency distributions between the normal sound and insufficiency murmurs in frequency domain, we used two properties such as the relative wavelet energy and the Shannon wavelet entropy which described the energy information and the entropy information at the selected frequency band, respectively. Then, the signal to murmur ratio (SMR) measures which could mean the ratio between the frequency bands for normal heart sounds and for aortic and mitral insufficiency murmurs allocated to 15.62-187.50 Hz and 187.50-703.12 Hz respectively, were employed as a classification manner to identify insufficiency murmurs. The proposed measures were validated by some case studies. The 194 heart sound signals with 48 normal and 146 abnormal sound cases acquired from 6 healthy volunteers and 30 patients were tested. The normal sound signals recorded by applying a self-produced wireless electric stethoscope system to subjects with no history of other heart complications were used. Insufficiency murmurs were grouped into two valvular heart defects such as aortic insufficiency and mitral insufficiency. These murmur subjects included no other coexistent valvular defects. As a result, the proposed insufficiency murmurs detection method showed relatively very high classification efficiency. Therefore, the proposed heart sound classification method based on the wavelet packet was validated for the classification of valvular heart defects, especially insufficiency murmurs.

Full-dimensional quantum dynamics study on the mode-specific unimolecular dissociation reaction of HFCO

NASA Astrophysics Data System (ADS)

Yamamoto, Takeshi; Kato, Shigeki

2000-05-01

The mode specificity of the unimolecular reaction of HFCO is studied by six-dimensional quantum dynamics calculations. The energy and mode dependency of the dissociation rate is examined by propagating a number of wave packets with a small energy dispersion representing highly excited states with respect to a specific vibrational mode. The wave packets are generated by applying a set of filter operators onto a source vibrational state. All the information necessary for propagating the wave packets is obtained from a single propagation of the source state, thus allowing a significant decrease of computational effort. The relevant spectral peaks are assigned using the three-dimensional CH chromophore Hamiltonian. The resulting dissociation rate of the CH stretching excited state is in agreement with that obtained from a statistical theory, while the rates of the out-of-plane bending excited states are about one order of magnitude smaller than the statistical rates. A local-mode analysis also shows that the relaxation of the out-of-plane excitation proceeds very slowly within 3 ps. These results clearly indicate weak couplings of the out-of-plane bending excited states with other in-plane vibrational states, which is in qualitative agreement with experimental findings. From a computational point of view, a parallel supercomputer is utilized efficiently to handle an ultra large basis set of an order of 108, and 200 Gflops rate on average is achieved in the dynamics calculations.

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

NASA Astrophysics Data System (ADS)

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

2003-08-01

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

The cause of larger local magnitude (Mj) in western Japan

NASA Astrophysics Data System (ADS)

Kawamoto, H.; Furumura, T.

2017-12-01

The local magnitude of the Japan Meteorological Agency (JMA) scale (Mj) in Japan sometimes show a significant discrepancy between Mw. The Mj is calculated using the amplitude of the horizontal component of ground displacement recorded by seismometers with the natural period of T0=5 s using Katsumata et al. (2004). A typical example of such a discrepancy in estimating Mj was an overestimation of the 2000 Western Tottori earthquake (Mj=7.3, Mw=6.7; hereafter referred to as event T). In this study, we examined the discrepancy between Mj and Mw for recent large earthquakes occurring in Japan.We found that the most earthquakes with larger Mj (>Mw) occur in western Japan while the earthquakes in northern Japan show reasonable Mj (=Mw). To understand the cause of such larger Mj for western Japan earthquakes we examined the strong motion record from the K-NET and KiK-net network for the event T and other earthquakes for reference. The observed ground displacement record from the event T shows a distinctive Love wave packet in tangential motion with a dominant period of about T=5 s which propagates long distances without showing strong dispersions. On the other hand, the ground motions from the earthquakes in northeastern Japan do not have such surface wave packet, and attenuation of ground motion is significant. Therefore, the overestimation of the Mj for earthquakes in western Japan may be attributed to efficient generation and propagation properties of Love wave probably relating to the crustal structure of western Japan. To explain this, we then conducted a numerical simulation of seismic wave propagation using 3D sedimentary layer model (JIVSM; Koketsu et al., 2012) and the source model of the event T. The result demonstrated the efficient generation of Love wave from the shallow strike-slip source which propagates long distances in western Japan without significant dispersions. On the other hand, the generation of surface wave was not so efficient when using a sedimentary layer model of northeastern Japan. In this case, the attenuation of surface wave is very significant due to the dispersion and scattering as propagating through sedimentary basins. Therefore, overestimation of the Mj for earthquakes in western Japan strongly relates to the structure of western Japan to generate distinctive Love wave packet for long distances.

A criterion autoscheduler for long range planning

NASA Technical Reports Server (NTRS)

Sponsler, Jeffrey L.

1994-01-01

A constraint-based scheduling system called SPIKE is used to create long-term schedules for the Hubble Space Telescope. A meta-level scheduler called the Criterion Autoscheduler for Long range planning (CASL) was created to guide SPIKE's schedule generation according to the agenda of the planning scientists. It is proposed that sufficient flexibility exists in a schedule to allow high level planning heuristics to be applied without adversely affected crucial constraints such as spacecraft efficiency. This hypothesis is supported by test data which is described.

Canoeing.

ERIC Educational Resources Information Center

Little, Mildred J.; Smith, Carole F.

Designed to be used in conjunction with the book "Canoeing", published by the American Red Cross in 1977, the teaching packet provides assistance in organizing and teaching a basic canoeing class. The packet lists 20 class objectives and details essential and recommended equipment and safety precautions. The packet contains a 15-day unit…

78 FR 10263 - Proposed Collection; Comment Request for ADA Accommodations Request Packet

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-13

... DEPARTMENT OF THE TREASURY Internal Revenue Service Proposed Collection; Comment Request for ADA... the ADA Accommodations Packet. DATES: Written comments should be received on or before April 15, 2013...: ADA Accommodations Request Packet. OMB Number: 1545-2027. Abstract: Information is collected so that...

The R-Shell approach - Using scheduling agents in complex distributed real-time systems

NASA Technical Reports Server (NTRS)

Natarajan, Swaminathan; Zhao, Wei; Goforth, Andre

1993-01-01

Large, complex real-time systems such as space and avionics systems are extremely demanding in their scheduling requirements. The current OS design approaches are quite limited in the capabilities they provide for task scheduling. Typically, they simply implement a particular uniprocessor scheduling strategy and do not provide any special support for network scheduling, overload handling, fault tolerance, distributed processing, etc. Our design of the R-Shell real-time environment fcilitates the implementation of a variety of sophisticated but efficient scheduling strategies, including incorporation of all these capabilities. This is accomplished by the use of scheduling agents which reside in the application run-time environment and are responsible for coordinating the scheduling of the application.

An on-time power-aware scheduling scheme for medical sensor SoC-based WBAN systems.

PubMed

Hwang, Tae-Ho; Kim, Dong-Sun; Kim, Jung-Guk

2012-12-27

The focus of many leading technologies in the field of medical sensor systems is on low power consumption and robust data transmission. For example, the implantable cardioverter-defibrillator (ICD), which is used to maintain the heart in a healthy state, requires a reliable wireless communication scheme with an extremely low duty-cycle, high bit rate, and energy-efficient media access protocols. Because such devices must be sustained for over 5 years without access to battery replacement, they must be designed to have extremely low power consumption in sleep mode. Here, an on-time, energy-efficient scheduling scheme is proposed that performs power adjustments to minimize the sleep-mode current. The novelty of this scheduler is that it increases the determinacy of power adjustment and the predictability of scheduling by employing non-pre-emptible dual priority scheduling. This predictable scheduling also guarantees the punctuality of important periodic tasks based on their serialization, by using their worst case execution time) and the power consumption optimization. The scheduler was embedded into a system on chip (SoC) developed to support the wireless body area network-a wakeup-radio and wakeup-timer for implantable medical devices. This scheduling system is validated by the experimental results of its performance when used with life-time extensions of ICD devices.

An On-Time Power-Aware Scheduling Scheme for Medical Sensor SoC-Based WBAN Systems

PubMed Central

Hwang, Tae-Ho; Kim, Dong-Sun; Kim, Jung-Guk

2013-01-01

The focus of many leading technologies in the field of medical sensor systems is on low power consumption and robust data transmission. For example, the implantable cardioverter-defibrillator (ICD), which is used to maintain the heart in a healthy state, requires a reliable wireless communication scheme with an extremely low duty-cycle, high bit rate, and energy-efficient media access protocols. Because such devices must be sustained for over 5 years without access to battery replacement, they must be designed to have extremely low power consumption in sleep mode. Here, an on-time, energy-efficient scheduling scheme is proposed that performs power adjustments to minimize the sleep-mode current. The novelty of this scheduler is that it increases the determinacy of power adjustment and the predictability of scheduling by employing non-pre-emptible dual priority scheduling. This predictable scheduling also guarantees the punctuality of important periodic tasks based on their serialization, by using their worst case execution time) and the power consumption optimization. The scheduler was embedded into a system on chip (SoC) developed to support the wireless body area network—a wakeup-radio and wakeup-timer for implantable medical devices. This scheduling system is validated by the experimental results of its performance when used with life-time extensions of ICD devices. PMID:23271602

Performance Evaluation and Control of Distributed Computer Communication Networks.

DTIC Science & Technology

1984-09-01

including: L. Clare, L.A. De Moraes, J. Baker, M. Zuckerman, S. Katz, P. Rodrigues, R. Pazos , S. Resheff. Other participants are the following visiting...investigations have been reported in reference (1) and (2) below. References (1) M. Gerla, R. Pazos -Rangel "Bandwidth Allocation and Routing in ISDN’s," IEEE...and efficient methods for its solution are presented. (2) R.A. Pazos -Rangel "Evaluation and Design of Integrated Packet Switching and Circuit Switching

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.

An Efficient Framework Model for Optimizing Routing Performance in VANETs

PubMed Central

Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala

2018-01-01

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED). PMID:29462884

Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks.

PubMed

Perumal, Madhumathy; Dhandapani, Sivakumar

2015-01-01

Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a "splitting tree" technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the "Biased Random Walk" model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.

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

Advertising and the Economy: A Teaching Package.

ERIC Educational Resources Information Center

Proctor and Gamble Co., Cincinnati, OH.

This teaching packet is designed to enrich lessons and motivate students, and is based on real-life marketing problems. The packet includes a booklet containing background for instructors on advertising's crucial economic role and its history in the United States, eight reproducible lessons, and teaching tips for each lesson. The packet also…

Continuing Development of California State Packet Radio Project.

ERIC Educational Resources Information Center

Brownrigg, Edwin

1992-01-01

Provides background on the California State Library Packet Radio project, which will use packet radios to deploy a wireless, high-speed, wide-area network of 600 nodes, including 100 libraries, in the San Francisco Bay Area. Project goals and objectives, plan of operation, equipment, and evaluation plans are summarized. (MES)

Vocational and Industrial Arts Packets.

ERIC Educational Resources Information Center

Maine Audubon Society, Falmouth.

This book is a teacher's guide to energy alternatives. It is divided into seven informational packets on the following topics: parabolic solar concentrators, solar flat plate collectors, wood as fuel, heat loss, bio-gas, wind, and water. Each packet contains background information for the teachers and learning activities for the students. The…

Cebuano Language Packet.

ERIC Educational Resources Information Center

Peace Corps, Manila (Philippines).

The materials in this packet were designed for the rapid Cebuano language training of Peace Corps volunteers, focusing on daily communication needs in this context. The packet contains: lists of common phrases, expressions, and vocabulary on a variety of topics related to Peace Corps work; a list of core competencies for specific topics…

Learn about Seabirds. Teaching Packet, Grades 4-6.

ERIC Educational Resources Information Center

Fish and Wildlife Service (Dept. of Interior), Anchorage, AK.

This teaching packet is designed to teach Alaskan students in grades 4-6 about Alaska's seabird populations, the worldwide significance of seabirds, and the environmental conditions to which seabirds are sensitive. The packet includes a curriculum guide (containing a teacher's background story and 12 teaching activities), a separately published…

Personal Skills. Facilitator's Skill Packets 1-7. Social Skills Training.

ERIC Educational Resources Information Center

Model Classrooms, Bellevue, WA.

This document contains the following seven facilitators' skill packets on personal skills: (1) personal hygiene; (2) personal appearance; (3) locker hygiene; (4) dorm cleanliness; (5) punctuality and attendance; (6) responding to supervision; and (7) teamwork. Each packet contains the following sections: definition of personal skills; objective;…

Student Activity Packet for the California State Capitol Museum.

ERIC Educational Resources Information Center

2001

This packet contains materials to help fourth and fifth grade teachers provide their students with background information for field trips to the California State Capitol Museum (Sacramento). The working museum focuses on the theme areas of California history, the state government/legislative process, and state symbols. The packet presents teacher…

Realization of localized Bohr-like wave packets.

PubMed

Mestayer, J J; Wyker, B; Lancaster, J C; Dunning, F B; Reinhold, C O; Yoshida, S; Burgdörfer, J

2008-06-20

We demonstrate a protocol to create localized wave packets in very-high-n Rydberg states which travel in nearly circular orbits around the nucleus. Although these wave packets slowly dephase and eventually lose their localization, their motion can be monitored over several orbital periods. These wave packets represent the closest analog yet achieved to the original Bohr model of the hydrogen atom, i.e., an electron in a circular classical orbit around the nucleus. The possible extension of the approach to create "planetary atoms" in highly correlated stable multiply excited states is discussed.

Photoionization of NaK molecule with a double-well potential in femtosecond pump probe pulse laser fields

NASA Astrophysics Data System (ADS)

Yu, Jie; Wang, Sen-Ming; Yuan, Kai-Jun; Cong, Shu-Lin

2006-09-01

The method of time-dependent quantum wave packet dynamics is used to calculate the femtosecond pump-probe photoelectron spectra and study the wave packet dynamic processes of the double-minimum potential state 61Σ+ of NaK in intense laser fields. The evolutions of the wave packet and the photoelectron energy spectra with time and internuclear distance are described in detail. The wave packet dynamic information of the 61Σ+ state can be extracted from the photoelectron energy spectra.

Coherent wave packet dynamics in a double-well potential in cavity

NASA Astrophysics Data System (ADS)

Zheng, Li; Li, Gang; Ding, Ming-Song; Wang, Yong-Liang; Zhang, Yun-Cui

2018-02-01

We investigate the coherent wave packet dynamics of a two-level atom trapped in a symmetric double-well potential in a near-resonance cavity. Prepared on one side of the double-well potential, the atom wave packet oscillates between the left and right wells, while recoil induced by the emitted photon from the atom entangles the atomic internal and external degrees of freedom. The collapse and revival of the tunneling occurs. Adjusting the width of the wave packets, one can modify the tunneling frequency and suppress the tunneling.

Securing internet by eliminating DDOS attacks

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

Dynamically reconfigurable optical packet switch (DROPS)

NASA Astrophysics Data System (ADS)

Huang, Chi-Heng; Chou, Hsu-Feng; Bowers, John E.; Toudeh-Fallah, Farzam; Gyurek, Russ

2006-12-01

A novel Dynamically Reconfigurable Optical Packet Switch (DROPS) that combines both spectral and spatial switching capabilities is proposed and experimentally demonstrated for the first time. Compared with an Arrayed Waveguide Grating Router (AWGR), the added spatial switching capability provided by the microelectromechanical systems (MEMS) enables dynamically reconfigurable routing that is not possible with an AWGR alone. This methodology has several advantages over an AWGR including scalability, additional degrees of freedom in routing a packet from an ingress port to an egress port and more flexibility in path or line card recovery. The experimental demonstration implemented with 10-Gb/s packets shows that the added spatial switching does not degrade the bit-error-rate performance, indicating the promising potential of DROPS as a versatile and ultra-high capacity switch for optical packet-switched networks.

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.

Wireless network interface energy consumption implications of popular streaming formats

NASA Astrophysics Data System (ADS)

Chandra, Surendar

2001-12-01

With the proliferation of mobile streaming multimedia, available battery capacity constrains the end-user experience. Since streaming applications tend to be long running, wireless network interface card's (WNIC) energy consumption is particularly an acute problem. In this work, we explore the WNIC energy consumption implications of popular multimedia streaming formats from Microsoft (Windows media), Real (Real media) and Apple (Quick Time). We investigate the energy consumption under varying stream bandwidth and network loss rates. We also explore history-based client-side strategies to reduce the energy consumed by transitioning the WNICs to a lower power consuming sleep state. We show that Microsoft media tends to transmit packets at regular intervals; streams optimized for 28.8 Kbps can save over 80% in energy consumption with 2% data loss. A high bandwidth stream (768 Kbps) can still save 57% in energy consumption with less than 0.3% data loss. For high bandwidth streams, Microsoft media exploits network-level packet fragmentation, which can lead to excessive packet loss (and wasted energy) in a lossy network. Real stream packets tend to be sent closer to each other, especially at higher bandwidths. Quicktime packets sometimes arrive in quick succession; most likely an application level fragmentation mechanism. Such packets are harder to predict at the network level without understanding the packet semantics.

Time-Efficient High-Rate Data Flooding in One-Dimensional Acoustic Underwater Sensor Networks

PubMed Central

Kwon, Jae Kyun; Seo, Bo-Min; Yun, Kyungsu; Cho, Ho-Shin

2015-01-01

Because underwater communication environments have poor characteristics, such as severe attenuation, large propagation delays and narrow bandwidths, data is normally transmitted at low rates through acoustic waves. On the other hand, as high traffic has recently been required in diverse areas, high rate transmission has become necessary. In this paper, transmission/reception timing schemes that maximize the time axis use efficiency to improve the resource efficiency for high rate transmission are proposed. The excellence of the proposed scheme is identified by examining the power distributions by node, rate bounds, power levels depending on the rates and number of nodes, and network split gains through mathematical analysis and numerical results. In addition, the simulation results show that the proposed scheme outperforms the existing packet train method. PMID:26528983

Optical storage with electromagnetically induced transparency in cold atoms at a high optical depth

NASA Astrophysics Data System (ADS)

Zhang, Shanchao; Zhou, Shuyu; Liu, Chang; Chen, J. F.; Wen, Jianming; Loy, M. M. T.; Wong, G. K. L.; Du, Shengwang

2012-06-01

We report experimental demonstration of efficient optical storage with electromagnetically induced transparency (EIT) in a dense cold ^85Rb atomic ensemble trapped in a two-dimensional magneto-optical trap. By varying the optical depth (OD) from 0 to 140, we observe that the optimal storage efficiency for coherent optical pulses has a saturation value of 50% as OD > 50. Our result is consistent with that obtained from hot vapor cell experiments which suggest that a four-wave mixing nonlinear process degrades the EIT storage coherence and efficiency. We apply this EIT quantum memory for narrow-band single photons with controllable waveforms, and obtain an optimal storage efficiency of 49±3% for single-photon wave packets. This is the highest single-photon storage efficiency reported up to today and brings the EIT atomic quantum memory close to practical application because an efficiency of above 50% is necessary to operate the memory within non-cloning regime and beat the classical limit.

Computer Applications in Class and Transportation Scheduling. Educational Management Review Series Number 1.

ERIC Educational Resources Information Center

Piele, Philip K.

This document shows how computer technology can aid educators in meeting demands for improved class scheduling and more efficient use of transportation resources. The first section surveys literature on operational systems that provide individualized scheduling for students, varied class structures, and maximum use of space and staff skills.…

A Market-Based Approach to Multi-factory Scheduling

NASA Astrophysics Data System (ADS)

Vytelingum, Perukrishnen; Rogers, Alex; MacBeth, Douglas K.; Dutta, Partha; Stranjak, Armin; Jennings, Nicholas R.

In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations of scheduling in a centralised manner - which requires a center to have complete and perfect information for optimality and the truthful revelation of potentially commercially private preferences to that center - we advocate an informationally decentralised approach that is both agile and dynamic. In particular, this work adopts a market-based approach for decentralised scheduling by considering the different stakeholders representing different factories as self-interested, profit-motivated economic agents that trade resources for the scheduling of jobs. The overall schedule of these jobs is then an emergent behaviour of the strategic interaction of these trading agents bidding for resources in a market based on limited information and their own preferences. Using a simple (zero-intelligence) bidding strategy, we empirically demonstrate that our market-based approach achieves a lower bound efficiency of 84%. This represents a trade-off between a reasonable level of efficiency (compared to a centralised approach) and the desirable benefits of a decentralised solution.

Centralized mission planning and scheduling system for the Landsat Data Continuity Mission

USGS Publications Warehouse

Kavelaars, Alicia; Barnoy, Assaf M.; Gregory, Shawna; Garcia, Gonzalo; Talon, Cesar; Greer, Gregory; Williams, Jason; Dulski, Vicki

2014-01-01

Satellites in Low Earth Orbit provide missions with closer range for studying aspects such as geography and topography, but often require efficient utilization of space and ground assets. Optimizing schedules for these satellites amounts to a complex planning puzzle since it requires operators to face issues such as discontinuous ground contacts, limited onboard memory storage, constrained downlink margin, and shared ground antenna resources. To solve this issue for the Landsat Data Continuity Mission (LDCM, Landsat 8), all the scheduling exchanges for science data request, ground/space station contact, and spacecraft maintenance and control will be coordinated through a centralized Mission Planning and Scheduling (MPS) engine, based upon GMV’s scheduling system flexplan9 . The synchronization between all operational functions must be strictly maintained to ensure efficient mission utilization of ground and spacecraft activities while working within the bounds of the space and ground resources, such as Solid State Recorder (SSR) and available antennas. This paper outlines the functionalities that the centralized planning and scheduling system has in its operational control and management of the Landsat 8 spacecraft.

Artificial magnetic-field quenches in synthetic dimensions

NASA Astrophysics Data System (ADS)

Yılmaz, F.; Oktel, M. Ö.

2018-02-01

Recent cold atom experiments have realized models where each hyperfine state at an optical lattice site can be regarded as a separate site in a synthetic dimension. In such synthetic ribbon configurations, manipulation of the transitions between the hyperfine levels provide direct control of the hopping in the synthetic dimension. This effect was used to simulate a magnetic field through the ribbon. Precise control over the hopping matrix elements in the synthetic dimension makes it possible to change this artificial magnetic field much faster than the time scales associated with atomic motion in the lattice. In this paper, we consider such a magnetic-flux quench scenario in synthetic dimensions. Sudden changes have not been considered for real magnetic fields as such changes in a conducting system would result in large induced currents. Hence we first study the difference between a time varying real magnetic field and an artificial magnetic field using a minimal six-site model. This minimal model clearly shows the connection between gauge dependence and the lack of on-site induced scalar potential terms. We then investigate the dynamics of a wave packet in an infinite two- or three-leg ladder following a flux quench and find that the gauge choice has a dramatic effect on the packet dynamics. Specifically, a wave packet splits into a number of smaller packets moving with different velocities. Both the weights and the number of packets depend on the implemented gauge. If an initial packet, prepared under zero flux in an n -leg ladder, is quenched to Hamiltonian with a vector potential parallel to the ladder, it splits into at most n smaller wave packets. The same initial wave packet splits into up to n2 packets if the vector potential is implemented to be along the rungs. Even a trivial difference in the gauge choice such as the addition of a constant to the vector potential produces observable effects. We also calculate the packet weights for arbitrary initial and final fluxes. Finally, we show that edge states in a thick ribbon are robust under the quench only when the same gap supports an edge state for the final Hamiltonian.

Annular wave packets at Dirac points in graphene and their probability-density oscillation.

PubMed

Luo, Ji; Valencia, Daniel; Lu, Junqiang

2011-12-14

Wave packets in graphene whose central wave vector is at Dirac points are investigated by numerical calculations. Starting from an initial Gaussian function, these wave packets form into annular peaks that propagate to all directions like ripple-rings on water surface. At the beginning, electronic probability alternates between the central peak and the ripple-rings and transient oscillation occurs at the center. As time increases, the ripple-rings propagate at the fixed Fermi speed, and their widths remain unchanged. The axial symmetry of the energy dispersion leads to the circular symmetry of the wave packets. The fixed speed and widths, however, are attributed to the linearity of the energy dispersion. Interference between states that, respectively, belong to two branches of the energy dispersion leads to multiple ripple-rings and the probability-density oscillation. In a magnetic field, annular wave packets become confined and no longer propagate to infinity. If the initial Gaussian width differs greatly from the magnetic length, expanding and shrinking ripple-rings form and disappear alternatively in a limited spread, and the wave packet resumes the Gaussian form frequently. The probability thus oscillates persistently between the central peak and the ripple-rings. If the initial Gaussian width is close to the magnetic length, the wave packet retains the Gaussian form and its height and width oscillate with a period determined by the first Landau energy. The wave-packet evolution is determined jointly by the initial state and the magnetic field, through the electronic structure of graphene in a magnetic field. © 2011 American Institute of Physics

Capture and playback synchronization in video conferencing

NASA Astrophysics Data System (ADS)

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

1995-03-01

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