Latency (engineering)

About: Latency (engineering) is a research topic. Over the lifetime, 7278 publications have been published within this topic receiving 115409 citations. The topic is also known as: lag.

Experimental approaches to the study of HIV-1 latency

Abstract: Viral latency is a reversibly non-productive state of infection that allows some viruses to evade host immune responses. As a consequence of its tropism for activated CD4(+) T cells, HIV-1 can establish latent infection in resting memory CD4(+) T cells, which are generated when activated CD4(+) T cells return to a quiescent state. Latent HIV-1 persists as a stably integrated but transcriptionally silent provirus. In this state, the virus is unaffected by immune responses or antiretroviral drugs, and this latent reservoir in resting CD4(+) T cells is a major barrier to curing the infection. Unfortunately, there is no simple assay to measure the number of latently infected cells in a patient, nor is there an entirely representative in vitro model in which to explore the molecular mechanisms of latency. This Review will consider current approaches to the analysis of HIV-1 latency both in vivo and in vitro.

System capacity, latency, and power consumption in multihop-routed SS-CDMA wireless networks

Abstract: Ad-hoc wireless networking presents challenges that are different from those of tethered networks in several significant ways. In addition to high error rates and constantly varying channels, mobile communication imposes new constraints, including limited energy supplies, and the need for portability. A system for wireless networking utilizing code division multiple access (CDMA), in conjunction with spread spectrum (SS) modulation is presented. By combining SS, automatic power control and local coordination, a "collisionless," energy and spectrum efficient system can be created which is capable of simultaneously providing high bandwidth and low latency communications. A new routing method, minimum consumed energy routing is evaluated. This new method is shown to reduce latency by 75%, reduce power consumption by 15%, and avoid congestion, in comparison with minimum transmitted energy routing. A simulator, SSNetSim, was developed to simulate the performance of these networks. By taking into account factors such as station placement, traffic patterns, routing strategies, and path loss, network performance, in terms of SNR, throughput, latency, and power consumption, is computed.

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

Abstract: Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of least latency [1] has a latency bound of (Delta - 1)R, where Delta is the maximum degree and R is the network radius. Since both Delta and R could be of the same order of the network size, this algorithm can still have a rather high latency. In this paper, we designed an algorithm based on maximal independent sets which has an latency bound of 23R + Delta - 18. Here Delta contributes to an additive factor instead of a multiplicative one; thus our algorithm is nearly constant approximation and it has a significantly less latency bound than earlier algorithms especially when Delta is large.