Markov-based channel characterization for tractable performance analysis in wireless packet networks

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

“…[8,9]. However, such discrete models cannot provide exact solutions when the fading channels show a continuous distribution of the SNR.…”

Section: Related Workmentioning

confidence: 99%

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

101

View full text Add to dashboard Cite

show abstract

“…The Gilbert-Elliot model is a two-state Markov model, where the channel switches between a "good state" (G; always error free) and a "bad state" (error prone). However, many recent studies have shown that the GilbertElliot model fails to predict performance measures depending on longer term correlation of errors [46], minimizes channel capacity [47], and leads to a highly conservative allocation strategy [48].…”

Section: Channel Error Modelmentioning

confidence: 99%

A New Call Admission Control Mechanism for Multimedia Traffic over Next-Generation Wireless Cellular Networks

Chatziperis

Koutsakis

Paterakis

2008

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-The subject of Call Admission Control (CAC) for wireless networks has been studied extensively in the literature. Another subject on which many researchers have focused their attention is that of video traffic modeling. However, user mobility, combined with the rapidly growing number of "greedy" multimedia applications, in terms of bandwidth and Quality of Service (QoS) requirements, form a challenging and yet unresolved problem for third and fourth-generation wireless networks. In recent work, we have built a Discrete Autoregressive (DAR (1)) model to capture the behavior of multiplexed H.263 videoconference movies from variable bit rate (VBR) coders. Based on this model, we propose in this work a new efficient CAC scheme for wireless cellular networks, which differs from the existing proposals in the literature in that it uses precomputed traffic scenarios combined with online simulation for its decision making. Our scheme is shown, via an extensive simulation study comparison and a conceptual comparison with well-known existing approaches, to clearly excel in terms of QoS provisioning to users receiving videoconference and Web traffic. To the best of our knowledge, this is the first work in the relevant literature where such an approach has been proposed.

show abstract

“…It is known that under some conditions, the tail distribution P(D > t) of the delay of a randomly chosen packet is approximately expressed as [14] …”

Section: Approximations Based On the Theory Of Ebmentioning

confidence: 99%

Queuing Delay Analysis for Packet Schedulers With/Without Multiuser Diversity Over a Fading Channel

Ishizaki

Uk²

2007

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-In this paper, we focus on a packet scheduling algorithm exploiting multiuser diversity in wireless networks. We compare the delay performance of individual user under the scheduling algorithm exploiting multiuser diversity with that under the round-robin scheduling algorithm in order to reveal the characteristics of the scheduling algorithm exploiting multiuser diversity. For this purpose, we develop an approximate formula to estimate the tail distribution of packet delay for an arbitrary user under the scheduling algorithm exploiting multiuser diversity and that under the round-robin scheduling algorithm. Numerical results exhibit that in contrast to the throughput performance of the overall system, the scheduling algorithm exploiting multiuser diversity is not necessarily superior to the round-robin scheduling algorithm for the delay performance of individual user. More specifically, it is shown that the former is superior to the latter only when the system lies in a severe environment, e.g., when the arrival rate is large, the burstiness of the arrival process is strong or the average signal-to-noise ratio is low.

show abstract

Markov-based channel characterization for tractable performance analysis in wireless packet networks

Cited by 76 publications

References 28 publications

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding

A New Call Admission Control Mechanism for Multimedia Traffic over Next-Generation Wireless Cellular Networks

Queuing Delay Analysis for Packet Schedulers With/Without Multiuser Diversity Over a Fading Channel

Contact Info

Product

Resources

About