On the recursive nature of end-to-end delay bound for heterogeneous wireless networks
2015 (English)Conference paper (Refereed)
Multi-hop wireless networks are increasingly becom-ing more relevant to current and emerging wireless networkdeployment. The need for understanding the performance of suchnetworks in order to be able to provide quantifiable end-to-endquality of service is apparent. Until recently, only asymptoticresults that describe the scaling of the delay in the size of thenetwork under numerous conformity conditions were available.Recently, a new methodology for wireless networks performanceanalysis based on stochastic network calculus was presented. This methodology enables the computation of end-to-endprobabilistic delay bound of multi-hop wireless networks interms of the underlying fading channel parameters. However,the approach assumes identically distributed channel gain whichapplies to a very specific class of networks. In this work, we seekto develop an end-to-end probabilistic delay bound for multi-hop wireless networks with non-identically distributed channelgains. We show that the delay bound for such networks can becomputed recursively. We validate the resulting bound by meansof simulation and discuss various numerical examples.
Place, publisher, year, edition, pages
IdentifiersURN: urn:nbn:se:kth:diva-165943DOI: 10.1109/ICC.2015.7249278ScopusID: 2-s2.0-84953715713ISBN: 978-1-4673-6432-4OAI: oai:DiVA.org:kth-165943DiVA: diva2:809174
IEEE International Conference on Communications 2015 (ICC 2015), 8-12 June, 2015, London, UK
FunderICT - The Next Generation
QC 201509232015-04-302015-04-302015-09-24Bibliographically approved