Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

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

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

Postprint urn:nbn:de:0011-n-3641376 (733 KByte PDF)
MD5 Fingerprint: eb762fd3c8dd0b8a8e0f87e87ef54abf
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Created on: 27.10.2015

Institute of Electrical and Electronics Engineers -IEEE-:
IEEE International Conference on Communications, ICC 2015. Proceedings. Vol.8 : Smart City and Smart World, 8-12 June 2015, London, United Kingdom
Piscataway, NJ: IEEE, 2015
ISBN: 978-1-4673-6432-4 (E-ISBN)
ISBN: 978-1-4673-6430-0
International Conference on Communications (ICC) <2015, London>
Conference Paper, Electronic Publication
Fraunhofer ESK ()
recursive; multi-hop; heterogeneous; wireless link; wireless network; network calculus; stochastic network calculus; delay bound; queuing network; industrial connectivity

Multi-hop wireless networks are increasingly becoming more relevant to current and emerging wireless network deployment. The need for understanding the performance of such networks in order to be able to provide quantifiable end-to-end quality of service is apparent. Until recently, only asymptotic results that describe the scaling of the delay in the size of the network under numerous conformity conditions were available. Recently, a new methodology for wireless networks performance analysis based on stochastic network calculus was presented. This methodology enables the computation of end-to-end probabilistic delay bound of multi-hop wireless networks in terms of the underlying fading channelparameters. However, the approach assumes identically distributed channel gain which applies to a very specific class of networks. In this work, we seek to develop an end-to-end probabilistic delay bound for multi-hop wireless networks with non-identically distributed channel gains. We show that the delay bound for such networks can be computed recursively. We validate the resulting bound by means of simulation and discuss various numerical examples.