Change search
ReferencesLink to record
Permanent link

Direct link
On the recursive nature of end-to-end delay bound for heterogeneous wireless networks
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-0150-2489
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0001-6682-6559
2015 (English)Conference paper (Refereed)
Abstract [en]

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[1]. 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
National Category
URN: urn:nbn:se:kth:diva-165943DOI: 10.1109/ICC.2015.7249278ScopusID: 2-s2.0-84953715713ISBN: 978-1-4673-6432-4OAI: diva2:809174
IEEE International Conference on Communications 2015 (ICC 2015), 8-12 June, 2015, London, UK
ICT - The Next Generation

QC 20150923

Available from: 2015-04-30 Created: 2015-04-30 Last updated: 2015-09-24Bibliographically approved

Open Access in DiVA

fulltext(449 kB)16 downloads
File information
File name FULLTEXT01.pdfFile size 449 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Al-Zubaidy, HusseinGross, James
By organisation
Communication NetworksCommunication Theory

Search outside of DiVA

GoogleGoogle Scholar
Total: 16 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 154 hits
ReferencesLink to record
Permanent link

Direct link