79 resultados para end-to-side
Resumo:
In a cooperative relay-assisted communication system that uses rateless codes, packets get transmitted from a source to a destination at a rate that depends on instantaneous channel states of the wireless links between nodes. When multiple relays are present, the relay with the highest channel gain to the source is the first to successfully decode a packet from the source and forward it to the destination. Thus, the unique properties of rateless codes ensure that both rate adaptation and relay selection occur without the transmitting source or relays acquiring instantaneous channel knowledge. In this paper, we show that in such cooperative systems, buffering packets at relays significantly increases throughput. We develop a novel analysis of these systems that combines the communication-theoretic aspects of cooperation over fading channels with the queuing-theoretic aspects associated with buffering. Closed-form expressions are derived for the throughput and end-to-end delay for the general case in which the channels between various nodes are not statistically identical. Corresponding results are also derived for benchmark systems that either do not exploit spatial diversity or do not buffer packets. Altogether, our results show that buffering - a capability that will be commonly available in practical deployments of relays - amplifies the benefits of cooperation.
Resumo:
The effect of natural convection on the oscillatory flow in an open-ended pipe driven by a timewise sinusoidally varying pressure at one end and subjected to an ambient-to-cryogenic temperature difference across the ends, is numerically studied. Conjugate effects arising out of the interaction of oscillatory flow with heat conduction in the pipe wall are taken into account by considering a finite thickness wall with an insulated exterior surface. Two cases, namely, one with natural convection acting downwards and the other, with natural convection acting upwards, are considered. The full set of compressible flow equations with axissymmetry are solved using a pressure correction algorithm. Parametric studies are conducted with frequencies in the range 5-15 Hz for an end-to-end temperature difference of 200 and 50 K. Results are obtained for the variation of velocity, temperature. Nusselt number and the phase relationship between mass flow rate and temperature. It is found that the Rayleigh number has a minimal effect on the time averaged Nusselt number and phase angle. However, it does influence the local variation of velocity and Nusselt number over one cycle. The natural convection and pressure amplitude have influence on the energy flow through the gas and solid. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
We have investigated electrical transport properties of long (>10 mu m) multiwalled carbon nanotubes (NTs) by dividing individuals into several segments of identical length. Each segment has different resistance because of the random distribution of defect density in an NT and is corroborated by Raman studies. Higher is the resistance, lower is the current required to break the segments indicating that breakdown occurs at the highly resistive segment/site and not necessarily at the middle. This is consistent with the one-dimensional thermal transport model. We have demonstrated the healing of defects by annealing at moderate temperatures or by current annealing. To strengthen our mechanism, we have carried out electrical breakdown of nitrogen doped NTs (NNTs) with diameter variation from one end to the other. It reveals that the electrical breakdown occurs selectively at the narrower diameter region. Overall, we believe that our results will help to predict the breakdown position of both semiconducting and metallic NTs. Copyright 2012 Author(s). This article is distributed under a Creative Commons Attribution 3.0 Unported License. http://dx.doi.org/10.1063/1.4720426]
Resumo:
The reaction of a tridentate Schiff base ligand HL (2-(3-dimethylaminopropylimino)-methyl]-phenol) with Ni(II) acetate or perchlorate salts in the presence of azide as coligand has led to two new Ni(II) complexes of formulas Ni3L2(OAc)(2)(mu(1,1)-N-3)(2)(H2O)(2)]center dot 2H(2)O (1) and Ni2L2(mu(1,1)-N-3) (mu(1,3)-N-3)](n)(2). Single crystal X-ray structures show that complex 1 is a linear trinuclear Ni(II) compound containing a mu(2)-phenwddo, an end-on (EO) azido and a syn-syn acetato bridge between the terminal and the central Ni(II) ions. Complex 2 can be viewed as a one-dimensional (1D) chain in which the triply bridged (di-mu(2)-phenoxido and EO azido) dimeric Ni-2 units are linked to each other in a zigzag pattern by a single end-to-end (EE) azido bridge. Variable-temperature magnetic susceptibility studies indicate the presence of moderate ferromagnetic exchange coupling in complex 1 with J value of 16.51(6) cm(-1). The magnetic behavior of 2 can be fitted in an alternating ferro- and antiferromagnetic model J(FM) = +34.2(2.8) cm(-1) and J(AF) = -21.6(1.1) cm(-1)] corresponding to the triple bridged dinuclear core and EE azido bridge respectively. Density functional theory (DFT) calculations were performed to corroborate the magnetic results of 1 and 2. The contributions of the different bridges toward magnetic interactions in both compounds have also been calculated.
Resumo:
Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].
Resumo:
Background: Peste-des-petits ruminants virus (PPRV) is a non segmented negative strand RNA virus of the genus Morbillivirus within Paramyxoviridae family. Negative strand RNA viruses are known to carry nucleocapsid (N) protein, phospho (P) protein and RNA polymerase (L protein) packaged within the virion which possess all activities required for transcription, post-transcriptional modification of mRNA and replication. In order to understand the mechanism of transcription and replication of the virus, an in vitro transcription reconstitution system is required. In the present work, an in vitro transcription system has been developed with ribonucleoprotein (RNP) complex purified from virus infected cells as well as partially purified recombinant polymerase (L-P) complex from insect cells along with N-RNA (genomic RNA encapsidated by N protein) template isolated from virus infected cells. Results: RNP complex isolated from virus infected cells and recombinant L-P complex purified from insect cells was used to reconstitute transcription on N-RNA template. The requirement for this transcription reconstitution has been defined. Transcription of viral genes in the in vitro system was confirmed by PCR amplification of cDNAs corresponding to individual transcripts using gene specific primers. In order to measure the relative expression level of viral transcripts, real time PCR analysis was carried out. qPCR analysis of the transcription products made in vitro showed a gradient of polarity of transcription from 3' end to 5' end of the genome similar to that exhibited by the virus in infected cells. Conclusion: This report describes for the first time, the development of an in vitro transcription reconstitution system for PPRV with RNP complex purified from infected cells and recombinant L-P complex expressed in insect cells. Both the complexes were able to synthesize all the mRNA species in vitro, exhibiting a gradient of polarity in transcription.
Resumo:
We consider the problem of optimal routing in a multi-stage network of queues with constraints on queue lengths. We develop three algorithms for probabilistic routing for this problem using only the total end-to-end delays. These algorithms use the smoothed functional (SF) approach to optimize the routing probabilities. In our model all the queues are assumed to have constraints on the average queue length. We also propose a novel quasi-Newton based SF algorithm. Policies like Join Shortest Queue or Least Work Left work only for unconstrained routing. Besides assuming knowledge of the queue length at all the queues. If the only information available is the expected end-to-end delay as with our case such policies cannot be used. We also give simulation results showing the performance of the SF algorithms for this problem.
Resumo:
The telecommunication, broadcasting and other instrumented towers carry power and/or signal cables from their ground end to their upper regions. During a direct hit to the tower, significant induction can occur to these mounted cables. In order to provide adequate protection to the equipments connected to them, protection schemes have been evolved in the literature. Development of more effective protection schemes requires a quantitative knowledge on various parameters. However, such quantitative knowledge is difficult to find at present. Amongst several of these aspects, the present work aims to investigate on the two important aspects: (i) what would be the nature of the induced currents and (ii) what will be the current sharing if as per the practice, the sheath of the cable is connected to the down conductor/tower. These aspects will be useful in design of protection schemes and also in analyzing the field structure around instrumented towers.
Resumo:
The performance analysis of adaptive physical layer network-coded two-way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. The deep channel fade conditions which occur at the relay referred as the singular fade states fall in the following two classes: (i) removable and (ii) non-removable singular fade states. With every singular fade state, we associate an error probability that the relay transmits a wrong network-coded symbol during the BC phase. It is shown that adaptive network coding provides a coding gain over fixed network coding, by making the error probabilities associated with the removable singular fade states contributing to the average Symbol Error Rate (SER) fall as SNR-2 instead of SNR-1. A high SNR upper-bound on the average end-to-end SER for the adaptive network coding scheme is derived, for a Rician fading scenario, which is found to be tight through simulations. Specifically, it is shown that for the adaptive network coding scheme, the probability that the relay node transmits a wrong network-coded symbol is upper-bounded by twice the average SER of a point-to-point fading channel, at high SNR. Also, it is shown that in a Rician fading scenario, it suffices to remove the effect of only those singular fade states which contribute dominantly to the average SER.
Resumo:
We present a study correlating uniaxial stress in a polymer with its underlying structure when it is strained. The uniaxial stress is significantly influenced by the mean-square bond length and mean bond angle. In contrast, the size and shape of the polymer, typically represented by the end-to-end length, mass ratio, and radius of gyration, contribute negligibly. Among externally set control variables, density and polymer chain length play a critical role in influencing the anisotropic uniaxial stress. Short chain polymers more or less behave like rigid molecules. Temperature and rate of loading, in the range considered, have a very mild effect on the uniaxial stress.
Resumo:
In this paper, we study the diversity-multiplexing-gain tradeoff (DMT) of wireless relay networks under the half-duplex constraint. It is often unclear what penalty if any, is imposed by the half-duplex constraint on the DMT of such networks. We study two classes of networks; the first class, called KPP(I) networks, is the class of networks with the relays organized in K parallel paths between the source and the destination. While we assume that there is no direct source-destination path, the K relaying paths can interfere with each other. The second class, termed as layered networks, is comprised of relays organized in layers, where links exist only between adjacent layers. We present a communication scheme based on static schedules and amplify-and-forward relaying for these networks. We also show that for KPP(I) networks with K >= 3, the proposed schemes can achieve full-duplex DMT performance, thus demonstrating that there is no performance hit on the DMT due to the half-duplex constraint. We also show that, for layered networks, a linear DMT of d(max)(1 - r)(+) between the maximum diversity d(max) and the maximum MG, r(max) = 1 is achievable. We adapt existing DMT optimal coding schemes to these networks, thus specifying the end-to-end communication strategy explicitly.
Resumo:
Peer to peer networks are being used extensively nowadays for file sharing, video on demand and live streaming. For IPTV, delay deadlines are more stringent compared to file sharing. Coolstreaming was the first P2P IPTV system. In this paper, we model New Coolstreaming (newer version of Coolstreaming) via a queueing network. We use two time scale decomposition of Markov chains to compute the stationary distribution of number of peers and the expected number of substreams in the overlay which are not being received at the required rate due to parent overloading. We also characterize the end-to-end delay encountered by a video packet received by a user and originated at the server. Three factors contribute towards the delay. The first factor is the mean shortest path length between any two overlay peers in terms of overlay hops of the partnership graph which is shown to be O (log n) where n is the number of peers in the overlay. The second factor is the mean number of routers between any two overlay neighbours which is seen to be at most O (log N-I) where N-I is the number of routers in the internet. Third factor is the mean delay at a router in the internet. We provide an approximation of this mean delay E W]. Thus, the mean end to end delay in New Coolstreaming is shown to be upper bounded by O (log E N]) (log N-I) E (W)] where E N] is the mean number of peers at a channel.
Resumo:
Negatively charged DNA can be compacted by positively charged dendrimers and the degree of compaction is a delicate balance between the strength of the electrostatic interaction and the elasticity of DNA. We report various elastic properties of short double-stranded DNA (dsDNA) and the effect of dendrimer binding using fully atomistic molecular dynamics and numerical simulations. In equilibrium at room temperature, the contour length distribution P(L) and the end-to-end distance distribution P(R) are nearly Gaussian, the former gives an estimate of the stretch modulus gamma(1) of dsDNA in quantitative agreement with the literature value. The bend angle distribution P(.) of the dsDNA also has a Gaussian form and allows to extract a persistence length, L-p of 43 nm. When the dsDNA is compacted by positively charged dendrimer, the stretch modulus stays invariant but the effective bending rigidity estimated from the end-to-end distance distribution decreases dramatically due to backbone charge neutralization of dsDNA by dendrimer. We support our observations with numerical solutions of the worm-like-chain (WLC) model as well as using non-equilibrium dsDNA stretching simulations. These results are helpful in understanding the dsDNA elasticity at short length scales as well as how the elasticity is modulated when dsDNA binds to a charged object such as a dendrimer or protein.
Resumo:
The motion of DNA (in the bulk solution) and the non-Newtonian effective fluid behavior are considered separately and self-consistently with the fluid motion satisfying the no-slip boundary condition on the surface of the confining geometry in the presence of channel pressure gradients. A different approach has been developed to model DNA in the micro-channel. In this study the DNA is assumed as an elastic chain with its characteristic Young's modulus, Poisson's ratio and density. The force which results from the fluid dynamic pressure, viscous forces and electromotive forces is applied to the elastic chain in a coupled manner. The velocity fields in the micro-channel are influenced by the transport properties. Simulations are carried out for the DNAs attached to the micro-fluidic wall. Numerical solutions based on a coupled multiphysics finite element scheme are presented. The modeling scheme is derived based on mass conservation including biomolecular mass, momentum balance including stress due to Coulomb force field and DNA-fluid interaction, and charge transport associated to DNA and other ionic complexes in the fluid. Variation in the velocity field for the non-Newtonian flow and the deformation of the DNA strand which results from the fluid-structure interaction are first studied considering a single DNA strand. Motion of the effective center of mass is analyzed considering various straight and coil geometries. Effects of DNA statistical parameters (geometry and spatial distribution of DNAs along the channel) on the effective flow behavior are analyzed. In particular, the dynamics of different DNA physical properties such as radius of gyration, end-to-end length etc. which are obtained from various different models (Kratky-Porod, Gaussian bead-spring etc.) are correlated to the nature of interaction and physical properties under the same background fluid environment.
Resumo:
In this paper we present the design of ``e-SURAKSHAK,'' a novel cyber-physical health care management system of Wireless Embedded Internet Devices (WEIDs) that sense vital health parameters. The system is capable of sensing body temperature, heart rate, oxygen saturation level and also allows noninvasive blood pressure (NIBP) measurement. End to end internet connectivity is provided by using 6LoWPAN based wireless network that uses the 802.15.4 radio. A service oriented architecture (SOA) 1] is implemented to extract meaningful information and present it in an easy-to-understand form to the end-user instead of raw data made available by sensors. A central electronic database and health care management software are developed. Vital health parameters are measured and stored periodically in the database. Further, support for real-time measurement of health parameters is provided through a web based GUI. The system has been implemented completely and demonstrated with multiple users and multiple WEIDs.