Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 16) Show all publications
Petreska, N., Al-Zubaidy, H., Knorr, R. & Gross, J. (2019). Bound-based power optimization for multi-hop heterogeneous wireless industrial networks under statistical delay constraints. Computer Networks, 148, 262-279
Open this publication in new window or tab >>Bound-based power optimization for multi-hop heterogeneous wireless industrial networks under statistical delay constraints
2019 (English)In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 148, p. 262-279Article in journal (Refereed) Published
Abstract [en]

The noticeably increased deployment of wireless networks for battery-limited industrial applications in recent years highlights the need for tractable performance analysis methodologies as well as efficient QoS-aware transmit power management schemes. In this work, we seek to combine several important aspects of such networks, i.e., multi-hop connectivity, channel heterogeneity and the queuing effect, in order to address these needs. We design delay-bound-based algorithms for transmit power minimization and network lifetime maximization of multi-hop heterogeneous wireless networks using our previously developed stochastic network calculus approach for performance analysis of a cascade of buffered wireless fading channels. Our analysis shows an overall transmit power saving of up to 95% compared to a fixed power allocation scheme in case when the service is modeled via a Shannon capacity. For a more realistic set-up, we evaluate the performance of the suggested algorithm in a WirelessHART network, which is a widely used communication standard for industrial process automation applications. We find that link heterogeneity can significantly reduce network lifetime when no efficient power management is applied. Using extensive simulation study we further show that the proposed bound-based power allocation performs reasonably well compared to the real optimum, especially in the case of WirelessHART networks.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV, 2019
Keywords
Stochastic network calculus, Wireless sensor networks, Multi-hop, Heterogeneous networks, End-to-end delay bound, Power minimization, Industrial networks, WirelessHART
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-245168 (URN)10.1016/j.comnet.2018.09.009 (DOI)000458345100021 ()2-s2.0-85058969247 (Scopus ID)
Note

QC 20190307

Available from: 2019-03-07 Created: 2019-03-07 Last updated: 2019-03-18Bibliographically approved
Champati, J. P., Al-Zubaidy, H. & Gross, J. (2019). On the Distribution of AoI for the GI/GI/1/1 and GI/GI/1/2*Systems: Exact Expressions and Bounds. In: IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019): . Paper presented at IEEE Conference on Computer Communications (IEEE INFOCOM), APR 29-MAY 02, 2019, Paris, FRANCE (pp. 37-45). IEEE
Open this publication in new window or tab >>On the Distribution of AoI for the GI/GI/1/1 and GI/GI/1/2*Systems: Exact Expressions and Bounds
2019 (English)In: IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019), IEEE , 2019, p. 37-45Conference paper, Published paper (Refereed)
Abstract [en]

Since Age of Information (AoI) has been proposed as a metric that quantifies the freshness of information updates in a communication system, there has been a constant effort in understanding and optimizing different statistics of the AoI process for classical queueing systems. In addition to classical queuing systems, more recently, systems with no queue or a unit capacity queue storing the latest packet have been gaining importance as storing and transmitting older packets do not reduce AoI at the receiver. Following this line of research, we study the distribution of AoI for the GI/GI/1/1 and GI/GI/1/2* systems, under non-preemptive scheduling. For any single-source-single-server queueing system, we derive, using sample path analysis, a fundamental result that characterizes the AoI violation probability, and use it to obtain closed-form expressions for D/GI/1/1, M/GI/1/1 as well as systems that use zero-wait policy. Further, when exact results are not tractable, we present a simple methodology for obtaining upper bounds for the violation probability for both GI/GI/1/1 and GI/GI/1/2* systems. An interesting feature of the proposed upper bounds is that, if the departure rate is given, they overestimate the violation probability by at most a value that decreases with the arrival rate. Thus, given the departure rate and for a fixed average service, the bounds are tighter at higher utilization.

Place, publisher, year, edition, pages
IEEE, 2019
Series
IEEE INFOCOM, ISSN 0743-166X
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-257830 (URN)10.1109/INFOCOM.2019.8737474 (DOI)000480426400006 ()2-s2.0-85068226121 (Scopus ID)978-1-7281-0515-4 (ISBN)
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), APR 29-MAY 02, 2019, Paris, FRANCE
Note

QC 20190906

Available from: 2019-09-06 Created: 2019-09-06 Last updated: 2019-09-06Bibliographically approved
Forssell, H., Thobaben, R., Al-Zubaidy, H. & Gross, J. (2019). Physical Layer Authentication in Mission-Critical MTC Networks: A Security and Delay Performance Analysis. IEEE Journal on Selected Areas in Communications, 37(4), 795-808
Open this publication in new window or tab >>Physical Layer Authentication in Mission-Critical MTC Networks: A Security and Delay Performance Analysis
2019 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 37, no 4, p. 795-808Article in journal (Refereed) Published
Abstract [en]

We study the detection and delay performance impacts of a feature-based physical layer authentication (PLA) protocol in mission-critical machine-type communication (MTC) networks. The PLA protocol uses generalized likelihood-ratio testing based on the line-of-sight (LOS), single-input multiple- output channel-state information in order to mitigate imper- sonation attempts from an adversary node. We study the de- tection performance, develop a queueing model that captures the delay impacts of erroneous decisions in the PLA (i.e., the false alarms and missed detections), and model three different adversary strategies: data injection, disassociation, and Sybil attacks. Our main contribution is the derivation of analytical delay performance bounds that allow us to quantify the delay introduced by PLA that potentially can degrade the performance in mission-critical MTC networks. For the delay analysis, we utilize tools from stochastic network calculus. Our results show that with a sufficient number of receive antennas (approx. 4-8) and sufficiently strong LOS components from legitimate devices, PLA is a viable option for securing mission-critical MTC systems, despite the low latency requirements associated to corresponding use cases. Furthermore, we find that PLA can be very effective in detecting the considered attacks, and in particular, it can significantly reduce the delay impacts of disassociation and Sybil attacks.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
National Category
Communication Systems
Research subject
Telecommunication
Identifiers
urn:nbn:se:kth:diva-245235 (URN)10.1109/JSAC.2019.2899421 (DOI)000461853500008 ()2-s2.0-85061989373 (Scopus ID)
Projects
CERCES
Note

QC 20191120

Available from: 2019-03-07 Created: 2019-03-07 Last updated: 2019-11-20Bibliographically approved
Yang, G., Xiao, M., Al-Zubaidy, H., Huang, Y. & Gross, J. (2018). Analysis of Millimeter-Wave Multi-Hop Networks With Full-Duplex Buffered Relays. IEEE/ACM Transactions on Networking, 26(1), 576-590
Open this publication in new window or tab >>Analysis of Millimeter-Wave Multi-Hop Networks With Full-Duplex Buffered Relays
Show others...
2018 (English)In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 26, no 1, p. 576-590Article in journal (Refereed) Published
Abstract [en]

The abundance of spectrum in the millimeter-wave (mm-wave) bands makes it an attractive alternative for future wireless communication systems. Such systems are expected to provide data transmission rates in the order of multi-gigabits per second in order to satisfy the ever-increasing demand for high rate data communication. Unfortunately, mm-wave radio is subject to severe path loss, which limits its usability for long-range outdoor communication. In this paper, we propose a multi-hop mm-wave wireless network for outdoor communication, where multiple full-duplex buffered relays are used to extend the communication range, while providing end-to-end performance guarantees to the traffic traversing the network. We provide a cumulative service process characterization for the mm-wave propagation channel with self-interference in terms of the moment generating function of its channel capacity. Then, we then use this characterization to compute probabilistic upper bounds on the overall network performance, i.e., total backlog and end-to-end delay. Furthermore, we study the effect of self-interference on the network performance and propose an optimal power allocation scheme to mitigate its impact in order to enhance network performance. Finally, we investigate the relation between relay density and network performance under a sum power constraint. We show that increasing relay density may have adverse effects on network performance, unless the selfinterference can be kept sufficiently small.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2018
Keywords
Millimeter-wave, multi-hop, moment generating functions, delay, backlog
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-224045 (URN)10.1109/TNET.2017.2786341 (DOI)000425324000042 ()2-s2.0-85041182670 (Scopus ID)
Note

QC 20180320

Available from: 2018-03-20 Created: 2018-03-20 Last updated: 2018-04-16Bibliographically approved
Schiessl, S., Al-Zubaidy, H., Skoglund, M. & Gross, J. (2018). Delay Performance of Wireless Communications With Imperfect CSI and Finite-Length Coding. IEEE Transactions on Communications, 66(12), 6527-6541
Open this publication in new window or tab >>Delay Performance of Wireless Communications With Imperfect CSI and Finite-Length Coding
2018 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 66, no 12, p. 6527-6541Article in journal (Refereed) Published
Abstract [en]

With the rise of critical machine-to-machine applications, next generation wireless communication systems must meet challenging requirements with respect to 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 state. In this paper, we characterize the tradeoff between the training sequence length and data codeword length: shorter channel estimation leaves more time for the 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. In order to optimize the training sequence length and the rate adaptation scheme with respect to the delay performance, we employ queuing analysis on top of accurate models of the physical layer. We obtain an analytically tractable solution to the problem by deriving a closed-form approximation for the decoding error probability due to imperfect channel knowledge and finite-blocklength channel coding. The optimized training sequence length and rate adaptation strategy can reduce the delay violation probability by an order of magnitude, compared with suboptimal strategies that do not consider the delay constraints.

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
Finite blocklength regime, imperfect CSI, rate adaptation, quasi-static fading, queuing analysis
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-241008 (URN)10.1109/TCOMM.2018.2860000 (DOI)000454112200051 ()2-s2.0-85050718946 (Scopus ID)
Note

QC 20190109

Available from: 2019-01-09 Created: 2019-01-09 Last updated: 2019-08-20Bibliographically approved
Varma Champati, J. P., Al-Zubaidy, H. & Gross, J. (2018). Statistical Guarantee Optimization for Age of Information for the D/G/1 Queue. In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS): . Paper presented at IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI (pp. 130-135). IEEE
Open this publication in new window or tab >>Statistical Guarantee Optimization for Age of Information for the D/G/1 Queue
2018 (English)In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), IEEE , 2018, p. 130-135Conference paper, Published paper (Refereed)
Abstract [en]

Age of Information (AoI) has proven to be a useful metric in networked systems where timely information updates are of importance. Recently, minimizing the "average age" has received considerable attention. However, various applications pose stricter age requirements on the updates which demand knowledge of the AoI distribution. In this work, we study the distribution of the AoI and devise a problem of minimizing the tail of the AoI distribution function with respect to the frequency of generating information updates, i.e., the sampling rate of monitoring a process, for the D/G/1 queue model under FCFS queuing discipline. We argue that computing an exact expression for the AoI distribution may not always be feasible. Therefore, we opt for computing a bound on the tail of the AoI distribution and use it to formulate a tractable alpha-relaxed Upper Bound Minimization Problem (alpha-UBMP), where alpha > 1 is an approximation factor. This approximation can be used to obtain "good" heuristic solutions. We demonstrate the efficacy of our approach by solving alpha-UBMP for the D/M/1 queue. We show, using simulation, that the rate solutions obtained are near optimal for minimizing the tail of the AoI distribution.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE Conference on Computer Communications Workshops, ISSN 2159-4228
Keywords
Optimization, Queueing theory, Approximation factor, D/M/1 queues, Heuristic solutions, Information updates, Minimization problems, Networked systems, Sampling rates, Statistical guarantee, Distribution functions
National Category
Computer Systems
Identifiers
urn:nbn:se:kth:diva-239836 (URN)10.1109/INFCOMW.2018.8406909 (DOI)000450157700086 ()2-s2.0-85050654029 (Scopus ID)978-1-5386-5979-3 (ISBN)
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI
Note

QC 20190107

Available from: 2019-01-07 Created: 2019-01-07 Last updated: 2019-11-06Bibliographically approved
Forssell, H., Thobaben, R., Al-Zubaidy, H. & Gross, J. (2017). On the Impact of Feature-Based Physical Layer Authentication on Network Delay Performance. In: Globecom 2017 - 2017 IEEE Global Communications Conference: . Paper presented at IEEE Global Communications Conference (GLOBECOM), DEC 04-08, 2017, Your, Singapore. Institute of Electrical and Electronics Engineers (IEEE)
Open this publication in new window or tab >>On the Impact of Feature-Based Physical Layer Authentication on Network Delay Performance
2017 (English)In: Globecom 2017 - 2017 IEEE Global Communications Conference, Institute of Electrical and Electronics Engineers (IEEE), 2017Conference paper, Published paper (Refereed)
Abstract [en]

Feature-based authentication schemes that verify wireless transmitter identities based on physical-layer features allow for fast and efficient authentication with minimal overhead. Hence, they are interesting to consider for safety-critical applications where low latency and high reliability is required. However, as erroneous authentication decisions will introduce delays, we propose to study the impact of feature-based schemes on the system-level performance. In this paper, we therefore study the queuing performance of a line-of-sight wireless link that employs a feature-based authentication scheme based on the complex channel gain. Using stochastic networks calculus, we provide bounds on the delay performance which are validated by numerical simulations. The results show that the delay and authentication performance is highly dependent on the SNR and Rice factor. However, under good channel conditions, a missed-detection rate of 10(-8) can be achieved without introducing excessive delays in the system.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2017
Series
IEEE Global Communications Conference, ISSN 2334-0983
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-226848 (URN)10.1109/GLOCOM.2017.8254003 (DOI)000428054300083 ()2-s2.0-85046437823 (Scopus ID)978-1-5090-5019-2 (ISBN)
Conference
IEEE Global Communications Conference (GLOBECOM), DEC 04-08, 2017, Your, Singapore
Projects
CERCES
Funder
Swedish Civil Contingencies Agency
Note

QC 20180507

Available from: 2018-05-07 Created: 2018-05-07 Last updated: 2018-06-25Bibliographically approved
Al-Zubaidy, H., Fodor, V., Dán, G. & Flierl, M. (2017). Reliable Video Streaming With Strict Playout Deadline in Multihop Wireless Networks. IEEE transactions on multimedia, 19(10), 2238-2251
Open this publication in new window or tab >>Reliable Video Streaming With Strict Playout Deadline in Multihop Wireless Networks
2017 (English)In: IEEE transactions on multimedia, ISSN 1520-9210, E-ISSN 1941-0077, Vol. 19, no 10, p. 2238-2251Article in journal (Refereed) Published
Abstract [en]

Motivated by emerging vision-based intelligent services, we consider the problem of rate adaptation for high-quality and low-delay visual information delivery over wireless networks using scalable video coding. Rate adaptation in this setting is inherently challenging due to the interplay between the variability of the wireless channels, the queuing at the network nodes, and the frame-based decoding and playback of the video content at the receiver at very short time scales. To address the problem, we propose a low-complexity model-based rate adaptation algorithm for scalable video streaming systems, building on a novel performance model based on stochastic network calculus. We validate the analytic model using extensive simulations. We show that it allows fast near-optimal rate adaptation for fixed transmission paths, as well as cross-layer optimized routing and video rate adaptation in mesh networks, with less than 10% quality degradation compared to the best achievable performance.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2017
Keywords
Multihop fading channels, network calculus, performance analysis, scalable video coding, wireless multimedia
National Category
Telecommunications Software Engineering
Identifiers
urn:nbn:se:kth:diva-215437 (URN)10.1109/TMM.2017.2742399 (DOI)000411247600009 ()2-s2.0-85028475488 (Scopus ID)
Note

QC 20171019

Available from: 2017-10-19 Created: 2017-10-19 Last updated: 2018-01-13Bibliographically approved
Larsson, P., Gross, J., Al-Zubaidy, H., Rasmussen, L. K. & Skoglund, M. (2016). Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach. IEEE Transactions on Communications, 64(11), 4817-4835
Open this publication in new window or tab >>Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach
Show others...
2016 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 64, no 11, p. 4817-4835Article in journal (Refereed) Published
Abstract [en]

We consider the effective capacity performance measure of persistent-and truncated-retransmission schemes that can involve any combination of multiple transmissions per packet, multiple communication modes, or multiple packet communication. We present a structured unified analytical approach, based on a random walk model and recurrence relation formulation, and give exact effective capacity expressions for persistent hybrid automatic repeat request (HARQ) and for truncated-retransmission schemes. For the latter, effective capacity expressions are given for systems with finite (infinite) time horizon on an algebraic (spectral radius-based) form of a special block companion matrix. In contrast to prior HARQ models, assuming infinite time horizon, the proposed method does not involve a non-trivial per case modeling step. We give effective capacity expressions for several important cases that have not been addressed before, e.g., persistent-HARQ, truncated-HARQ, network-coded ARQ, two-mode-ARQ, and multilayer-ARQ. We propose an alternative quality-of-service-parameter (instead of the commonly used moment generating function parameter) that represents explicitly the target delay and the delay violation probability. This also enables the closed-form expressions for many of the studied systems. Moreover, we use the recently proposed matrix-exponential distributed modeling of wireless fading channels to provide the basis for numerous new effective capacity results for HARQ.

Place, publisher, year, edition, pages
IEEE, 2016
Keywords
Recurrence relation, retransmission, automatic repeat request, hybrid-ARQ, repetition redundancy, network coding, multilayer-ARQ, effective capacity, throughput, matrix exponential distribution, random walk
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-199563 (URN)10.1109/TCOMM.2016.2602864 (DOI)000388873800028 ()2-s2.0-84999748064 (Scopus ID)
Note

QC 20170113

Available from: 2017-01-13 Created: 2017-01-09 Last updated: 2017-11-29Bibliographically approved
Al-Zubaidy, H., Liebeherr, J. & Burchard, A. (2016). Network-Layer Performance Analysis of Multihop Fading Channels. IEEE/ACM Transactions on Networking, 24(1), 204-217
Open this publication in new window or tab >>Network-Layer Performance Analysis of Multihop Fading Channels
2016 (English)In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 24, no 1, p. 204-217Article in journal (Refereed) Published
Abstract [en]

A fundamental problem for the delay and backlog analysis across multihop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate, the performance analysis of wireless networks has resorted to higher-layer abstractions, e. g., using Markov chain models. In this paper, we propose a network calculus that can incorporate common statistical models of fading channels and obtain statistical bounds on delay and backlog across multiple nodes. We conduct the analysis in a transfer domain, where the service process at a link is characterized by the instantaneous signal-to-noise ratio at the receiver. We discover that, in the transfer domain, the network model is governed by a dioid algebra, which we refer to as the algebra. Using this algebra, we derive the desired delay and backlog bounds. Using arguments from large deviations theory, we show that the bounds are asymptotically tight. An application of the analysis is demonstrated for a multihop network of Rayleigh fading channels with cross traffic at each hop.

Place, publisher, year, edition, pages
IEEE, 2016
Keywords
Communications technology, control systems, fading, queueing analysis, Rayleigh channels, signal processing, traffic control, wireless communication, wireless networks
National Category
Computer Sciences
Identifiers
urn:nbn:se:kth:diva-184041 (URN)10.1109/TNET.2014.2360675 (DOI)000370969300016 ()
Note

QC 20160323

Available from: 2016-03-23 Created: 2016-03-22 Last updated: 2018-01-10Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-0150-2489

Search in DiVA

Show all publications