Change search
Refine search result
1 - 20 of 20
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Al-Zubaidy, Hussein
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Fodor, Viktoria
    KTH, School of Electrical Engineering (EES), Network and Systems engineering. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Dán, György
    KTH, School of Electrical Engineering (EES), Network and Systems engineering. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Flierl, Markus
    KTH, School of Electrical Engineering (EES), Information Science and Engineering. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Reliable Video Streaming With Strict Playout Deadline in Multihop Wireless Networks2017In: IEEE transactions on multimedia, ISSN 1520-9210, E-ISSN 1941-0077, Vol. 19, no 10, p. 2238-2251Article in journal (Refereed)
    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.

  • 2.
    Al-Zubaidy, Hussein
    et al.
    KTH, School of Electrical Engineering (EES).
    Liebeherr, Joerg
    Burchard, Almut
    Network-Layer Performance Analysis of Multihop Fading Channels2016In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 24, no 1, p. 204-217Article in journal (Refereed)
    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.

  • 3.
    Al-Zubaidy, Hussein
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Liebeherr, Jörg
    Service Characterizations for Multi-Hop Multiaccess Wireless Networks2014In: 2014 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2014, p. 807-812Conference paper (Refereed)
    Abstract [en]

    The objective of a wireless multiaccess communication system is to distribute limited wireless channel resources efficiently and fairly among its users. Solutions for multiaccess communications have been approached with very different perspectives of the same problem, among them information-theoretic approaches at the physical layer, random access at the media access layer, and packet scheduling at the link or network layer. Different system models with sometimes incongruent assumptions make it difficult to compare or reconcile multiaccess solutions emerging from different areas. In this paper we address these difficulties by presenting system-theoretic characterizations of the available service in multiaccess networks for all three approaches. Using these characterizations we derive performance bounds of multiaccess systems that see bursty traffic. We take advantage of a recently proposed (min, x) network calculus, which enables the analysis of networks with time-variable traffic (in bits per second) in terms of the fading channels parameters, i.e., signal-to-noise ratio (in dB). For each of the multiaccess approaches considered, we are able to compute probabilistic performance bounds for multi-hop wireless channels. The numerical results shed light on fundamental tradeoffs offered by each of these approaches.

  • 4.
    Al-Zubaidy, Hussein Mohammed
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Dán, György
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Fodor, Viktoria
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Performance of in-network processing for visual analysis in wireless sensor networks2015In: Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015, IEEE conference proceedings, 2015Conference paper (Refereed)
    Abstract [en]

    Nodes in a sensor network are traditionally used for sensing and data forwarding. However, with the increase of their computational capability, they can be used for in-network data processing, leading to a potential increase of the quality of the networked applications as well as the network lifetime. Visual analysis in sensor networks is a prominent example where the processing power of the network nodes needs to be leveraged to meet the frame rate and the processing delay requirements of common visual analysis applications. The modeling of the end-to-end performance for such networks is, however, challenging, because in-network processing violates the flow conservation law, which is the basis for most queuing analysis. In this work we propose to solve this methodological challenge through appropriately scaling the arrival and the service processes, and we develop probabilistic performance bounds using stochastic network calculus. We use the developed model to determine the main performance bottlenecks of networked visual processing. Our numerical results show that an end-to-end delay of 2-3 frame length is obtained with violation probability in the order of 10-6. Simulation shows that the obtained bounds overestimates the end-to-end delay by no more than 10%.

  • 5.
    Champati, Jaya Prakash
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems Engineering.
    Gross, James
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    On the Distribution of AoI for the GI/GI/1/1 and GI/GI/1/2*Systems: Exact Expressions and Bounds2019In: IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019), IEEE , 2019, p. 37-45Conference 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.

  • 6.
    Forssell, Henrik
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Thobaben, Ragnar
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Gross, James
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On the Impact of Feature-Based Physical Layer Authentication on Network Delay Performance2017In: Globecom 2017 - 2017 IEEE Global Communications Conference, Institute of Electrical and Electronics Engineers (IEEE), 2017Conference 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.

  • 7.
    Forssell, Henrik
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.
    Thobaben, Ragnar
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.
    Gross, James
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.
    Physical Layer Authentication in Mission-Critical MTC Networks: A Security and Delay Performance Analysis2019In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 37, no 4, p. 795-808Article in journal (Refereed)
    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.

  • 8.
    Larsson, Peter
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Rasmussen, Lars Kildehöj
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach2016In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 64, no 11, p. 4817-4835Article in journal (Refereed)
    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.

  • 9.
    Naghibi, Farshad
    et al.
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Schiessl, Sebastian
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Performance of Wiretap Rayleigh Fading Channels under Statistical Delay Constraints2017In: 2017 IEEE International Conference on Communications, ICC 2017, Institute of Electrical and Electronics Engineers (IEEE), 2017, article id 7996661Conference paper (Refereed)
    Abstract [en]

    In this paper, we investigate the performance of the wiretap Rayleigh fading channel in the presence of statistical delay constraints. We invoke tools from stochastic network calculus to derive probabilistic bounds on the delay. This method requires a statistical characterization of the wiretap fading service process, which we derive in closed form. We then validate these analytical bounds via simulations. Interestingly, the analysis of the wiretap fading channel reveals close structural similarities with the interference channel in terms of service process characterization, which is derived in our prior work. In our numerical evaluations, we show that the delay performance of the wiretap fading channel is in particular sensitive to bursty arrival processes due to the high variance of the service process.

  • 10.
    Petreska, Neda
    et al.
    ESK Muenchen.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Power Minimization for Industrial Wireless Networks under Statistical Delay Constraints2014Conference paper (Refereed)
    Abstract [en]

    Energy efficiency is a very important aspect of modern communication systems. In particular, industrial appli-cations, that deploy wireless machine-to-machine communication and process automation, demand energy-efficient communication in order to prolong battery lifetime and reduce inter-node interference, while maintaining a predefined probabilistic delay bound. In this work, we propose an algorithm that minimizes the transmit power in a WirelessHART network under statistical delay constraints. We achieve this by utilizing a recently developed network calculus approach for wireless networks performance analysis. The evaluation of the algorithm shows that it reaches quasi-minimal power settings within a few iterations.

  • 11.
    Petreska, Neda
    et al.
    Fraunhofer Inst Embedded Syst & Commun Technol ES, Munich, Germany..
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.
    Knorr, Rudi
    Fraunhofer Inst Embedded Syst & Commun Technol ES, Munich, Germany..
    Gross, James
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Bound-based power optimization for multi-hop heterogeneous wireless industrial networks under statistical delay constraints2019In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 148, p. 262-279Article in journal (Refereed)
    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.

  • 12. Petreska, Neda
    et al.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Knorr, Rudi
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory.
    On the recursive nature of end-to-end delay bound for heterogeneous wireless networks2015Conference 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.

  • 13. Petreska, Neda
    et al.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Staehle, Barbara
    Knorr, Rudi
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Statistical Delay Bound for WirelessHART Networks2016Conference paper (Refereed)
    Abstract [en]

    In this paper we provide a performance analysis framework for wireless industrial networks by deriving a service curve and a bound on the delay violation probability. For this purpose we use the (min; ×) stochastic network calculus as well as a recently presented recursive formula for an end-To-end delay bound of wireless heterogeneous networks. The derived results are mapped to WirelessHART networks used in process automation and validated via simulations. In addition to WirelessHART, our results can be applied to any wireless network whose physical layer conforms the IEEE 802.15.4 standard, while itsMAC protocol incorporates channel hopping and TDMA, like e.g. ISA100.11a or TSCHbased networks. The provided delay analysis is especially useful during the network design phase, offering further research potential towards optimal routing and power management in QoS-constrained wireless industrial networks.

  • 14.
    Schiessl, Sebastian
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Delay Analysis of Wireless Fading Channels with Finite Blocklength Channel Coding2015In: MSWiM '15 Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, New York: ACM Digital Library, 2015, p. 13-22Conference paper (Refereed)
    Abstract [en]

    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 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 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.

  • 15.
    Schiessl, Sebastian
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Skoglund, Mikael
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Gross, James
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Delay Performance of Wireless Communications With Imperfect CSI and Finite-Length Coding2018In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 66, no 12, p. 6527-6541Article in journal (Refereed)
    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.

  • 16.
    Schiessl, Sebastian
    et al.
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Gross, James
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Finite Length Coding in Edge Computing Scenarios2017Conference paper (Refereed)
  • 17.
    Schiessl, Sebastian
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Naghibi, Farshad
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Fidler, Markus
    Leibniz Universitat, Germany.
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory.
    On the Delay Performance of Interference Channels2016In: 2016 IFIP Networking Conference (IFIP Networking) and Workshops, IFIP Networking 2016, Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 216-224Conference paper (Refereed)
    Abstract [en]

    A deep understanding of the queuing performance of wireless networks is essential for the advancement of future wireless communications. The stochastic nature of wireless channels in general gives rise to a time varying transmission rate. In such an environment, interference is increasingly becoming a key constraint. Obtaining an expressive model for offered service of such channels has major implications in the design and optimization of future networks. However, interference channels are not well-understood with respect to their higher layer performance. The particular difficulty for handling interference channels arises from the superposition of random fading processes for the signals of the transmitters involved (i.e., for the signal of interest and for the signals of the interferers). Starting from the distribution of the signal-to-interference-plus-noise ratio (SINR), we derive a statistical characterization of the underlying service process in terms of its Mellin transform. Then, we adapt a recent stochastic network calculus approach for fading channels to derive measures of the queuing performance of single-and multi-hop wireless interference networks. Special cases of our solution include noise-limited and interference-limited systems. A key finding of our analysis is that for a given average signal and average sum interference power, the performance of interfered systems not only depends on the relative strength of the sum interference with respect to the signal-of-interest power, but also on the interference structure (i.e., the number of interferers) as well as the absolute levels.

  • 18.
    Varma Champati, Jaya Prakash
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Al-Zubaidy, Hussein
    Halmstad Univ, Sch Informat Technol ITE, Halmstad, Sweden..
    Gross, James
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Statistical Guarantee Optimization for Age of Information for the D/G/1 Queue2018In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), IEEE , 2018, p. 130-135Conference 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.

  • 19.
    Yang, Guang
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Xiao, Ming
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering and Computer Science (EECS).
    Huang, Yongming
    Gross, James
    KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
    Analysis of Millimeter-Wave Multi-Hop Networks With Full-Duplex Buffered Relays2018In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 26, no 1, p. 576-590Article in journal (Refereed)
    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.

  • 20.
    Yang, Guang
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Xiao, Ming
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Gross, James
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Al-Zubaidy, Hussein
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Huang, Yongming
    Delay and Backlog Analysis for 60 GHz Wireless Networks2016In: 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2016, article id 7841725Conference paper (Refereed)
    Abstract [en]

    To meet the ever-increasing demands on higher throughput and better network delay performance, 60 GHZ networking is proposed as a promising solution for the next generation of wireless communications. To successfully deploy such networks, its important to understand their performance first. However, due to the unique fading characteristic of the 60 GHz channel, the characterization of the corresponding service process, offered by the channel, using the conventional methodologies may not be tractable. In this work, we provide an alternative approach to derive a closed-form expression that characterizes the cumulative service process of the 60 GHz channel in terms of the moment generating function (MGF) of its instantaneous channel capacity. We then use this expression to derive probabilistic upper bounds on the backlog and delay that are experienced by a flow traversing this network, using results from the MGF-based network calculus. The computed bounds are validated using simulation. We provide numerical results for different networking scenarios and for different traffic and channel parameters and we show that the 60 GHz wireless network is capable of satisfying stringent quality-of-Service (QoS) requirements, in terms of network delay and reliability. With this analysis approach at hand, a larger scale 60 GHz network design and optimization is possible.

1 - 20 of 20
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf