On the recursive nature of end-to-end delay bound for heterogeneous wireless networks

Petreska, Neda; Al-Zubaidy, Hussein; Knorr, Rudi; Gross, James

doi:10.1109/icc.2015.7249278

Cited by 12 publications

(24 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The difference was also observed in [2] and [18] and seems to be unrelated to the finite blocklength model. Despite the difference, the slope of exponential decay of the delay violation Figure 3: Simulation results and delay bounds for average SNRγ = 10 dB, with arrivals a = 240 bits.…”

Section: Validity Of the Boundsmentioning

confidence: 75%

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding

Schiessl

Gross

Al-Zubaidy

2015

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

Self Cite

108

View full text Add to dashboard Cite

Upcoming low-latency machine-to-machine (M2M) applications are currently attracting a significant amount of interest from the wireless networking research community. The design challenge with respect to such future applications is to allow wireless networks to operate extremely reliably at very short deadlines for rather small packets. To date, it is unclear how to design wireless networks efficiently for such novel requirements. One reason is that existing performance models for wireless networks often assume that the rate of the channel code is equal to the Shannon capacity. However, this model does not hold anymore when the packet size and thus blocklength of the channel code is small. Although it is known [1] that finite blocklength has a major impact on the physical layer performance, we lack higher-layer performance models which account in particular for the queueing effects under the finite blocklength regime.A recently developed methodology [2] provides probabilistic higher-layer delay bounds for fading channels when assuming transmission at the Shannon capacity limit. Based on this novel approach, we develop service process characterizations for fading channels with finite blocklength channel coding, leading to novel probabilistic delay bounds that can give a fundamental insight into the capabilities and limitations of wireless networks when facing low-latency M2M applications. In particular, we show that the Shannon capacity model significantly overestimates the delay performance for such applications, which would lead to insufficient resource allocations. Finally, based on our (validated) analytical model, we study various important parameter trade-offs highlighting the sensitivity of the delay distribution under the finite blocklength regime.

show abstract

Section: Validity Of the Boundsmentioning

confidence: 75%

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding

Schiessl

Gross

Al-Zubaidy

2015

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

Self Cite

108

View full text Add to dashboard Cite

show abstract

“…for relatively large delays. Contrary to that, stochastic network calculus [22], which has been recently extended to wireless network analysis in a transform domain [13] and which has also been applied in various scenarios [14], [17], [24], [25], provides a strict upper bound on the delay violation probability p v (w), even at low delay. This is beneficial for ultra-reliable low latency systems in an industrial context: The modeled system will violate certain delay bounds with an even lower probability than shown by the analysis.…”

Section: A Queueing Analysismentioning

confidence: 99%

“…only valid for long delays. Al-Zubaidy et al [13] used stochastic network calculus in a transform domain, which not only provides non-asymptotic bounds on the delay performance, but can also be extended for the analysis of multi-hop wireless links [13], [14]. Finite blocklength effects and imperfect CSI have been separately studied with respect to their impact on the queueing performance.…”

Section: Introductionmentioning

confidence: 99%

Delay Performance of Wireless Communications With Imperfect CSI and Finite-Length Coding

Schiessl

Al-Zubaidy

Skoglund

et al. 2018

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state estimation, which allows the transmitter to adapt the code rate to the channel. In this work, we characterize the trade-off between the estimation sequence length and data codeword length: shorter channel estimation leaves more time for the actual payload transmission but reduces the estimation accuracy and causes more decoding errors. Using lower coding rates can mitigate this effect, but may result in a higher backlog of data at the transmitter. We analyze this trade-off using queueing analysis on top of accurate models of the physical layer, which also account for the finite blocklength of the channel code. Based on a novel closed-form approximation for the error probability given the rate, we show that finding the optimal rate adaptation strategy becomes a convex problem.The optimal rate adaptation strategy and the optimal training sequence length, which both depend on the latency and reliability constraints of the application, can improve the delay performance by an order of magnitude, compared to suboptimal strategies that do not consider those constraints. Index TermsFinite blocklength regime, imperfect CSI, rate adaptation, quasi-static fading, queueing analysisThe authors are with the

show abstract

“…Actually, the research regarding delay analysis in wireless communications using stochastic network calculus is rather limited, although the theory has developed for decades. A remarkable achievement is the development of (min, ×)-algebra [21]- [23], which was proposed to bridge the conventional stochastic network calculus and its applications in wireless scenarios. However, only Rayleigh fading channel is considered for discussion in related literature, while the investigation with respect to mm-wave fading characteristics, e.g., Nakagami-m fading, still remains blank.…”

Section: Objectives and Contributionsmentioning

confidence: 99%

Low-Latency Millimeter-Wave Communications: Traffic Dispersion or Network Densification?

Yang

Xiao

Poor

2018

IEEE Trans. Commun.

View full text Add to dashboard Cite

Low latency is critical for many applications in wireless communications, e.g., vehicle-to-vehicle (V2V), multimedia, and industrial control networks. Meanwhile, for the capability of providing multi-gigabits per second (Gbps) rates, millimeter-wave (mm-wave) communication has attracted substantial research interest recently. This paper investigates two strategies to reduce the communication delay in future wireless networks: traffic dispersion and network densification. A hybrid scheme that combines these two strategies is also considered. The probabilistic delay and effective capacity are used to evaluate performance. For probabilistic delay, the violation probability of delay, i.e., the probability that the delay exceeds a given tolerance level, is characterized in terms of upper bounds, which are derived by applying stochastic network calculus theory. In addition, to characterize the maximum affordable arrival traffic for mmwave systems, the effective capacity, i.e., the service capability with a given quality-of-service (QoS) requirement, is studied. The derived bounds on the probabilistic delay and effective capacity are validated through simulations. These numerical results show that, for a given sum power budget, traffic dispersion, network densification, and the hybrid scheme exhibit different potentials to reduce the end-to-end communication delay. For instance, traffic dispersion outperforms network densification when high sum power budget and arrival rate are given, while it could be the worst option, otherwise. Furthermore, it is revealed that, increasing the number of independent paths and/or relay density is always beneficial, while the performance gain is related to the arrival rate and sum power, jointly. Therefore, a proper transmission scheme should be selected to optimize the delay performance, according to the given conditions on arrival traffic and system service capability.• It is demonstrated that, traffic dispersion, network densification and the hybrid scheme have respective advantages, and resulting end-to-end delay performance depends on the sum power budget and the density of data traffic (e.g., average arrival rate). For instance, when the given sum power is large, traffic dispersion, the hybrid scheme, and network densification are suitable for the scenarios with heavy, medium, and light arrival traffic, respectively. However, when the given sum power is small, the corresponding strengths of above three schemes significantly change with respect to arrival traffic. These observations provide interesting insights for mm-wave network designs and implementations. That is, the transmission scheme for low-latency performance should be properly selected according to the density of arrival traffic and/or the feasible system gain. The remainder of this paper is outlined as follows. In Sec. II, preliminaries for MGF-based stochastic network calculus are provided. In Sec. III, we give system models for traffic dispersion, network densification, and the hybrid scheme, respectively, and present ...

show abstract

On the recursive nature of end-to-end delay bound for heterogeneous wireless networks

Cited by 12 publications

References 16 publications

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding

Delay Performance of Wireless Communications With Imperfect CSI and Finite-Length Coding

Low-Latency Millimeter-Wave Communications: Traffic Dispersion or Network Densification?

Contact Info

Product

Resources

About