Loading [MathJax]/extensions/MathMenu.js
Transient Analysis for Multihop Wireless Networks Under Static Routing | IEEE Journals & Magazine | IEEE Xplore

Transient Analysis for Multihop Wireless Networks Under Static Routing


Abstract:

In this article, we investigate the transient behavior of a sequence of packets/bits traversing a multi-hop wireless network under static routing. Our work is motivated b...Show More

Abstract:

In this article, we investigate the transient behavior of a sequence of packets/bits traversing a multi-hop wireless network under static routing. Our work is motivated by novel applications from the domain of process automation, Machine-Type Communication (MTC) and cyber-physical systems, where short messages are communicated and statistical guarantees need to be provided on a per-message level. In order to optimize such a network, apart from understanding the stationary system dynamics, an understanding of the short-term dynamics (i.e. transient behavior) is also required. To this end, we derive novel Wireless Transient Bounds (WTB) for end-to-end delay and backlog in a multi-hop wireless network using stochastic network calculus approach. We start by analyzing a single end-to-end path, i.e. a line topology, and then we show how the obtained results can be applied to a mesh network with static routing using a concept called 'leftover service'. WTB depends on the initial backlog at each node as well as the instantaneous channel states. We numerically compare WTB with Kernel-Based-Transient Bound (KBTB), which can be obtained by adapting existing stationary bound, as well as simulated end-to-end delay of the investigated network. While KBTB and stationary bounds are not able to capture the short-term system dynamics well, WTB provides relatively tight upper bound and has a decay rate that closely matches the simulation. This is achieved by WTB only with a slight increase in the computational complexity, by a factor of O(T + N), where T is the duration of the arriving sequence and N is the number of hops in the network. We believe that the presented analysis and the bounds are necessary tools for future work on transient network optimization for many important emerging applications, e.g., massive MTC, critical MTC, edge computing and autonomous vehicle.
Published in: IEEE/ACM Transactions on Networking ( Volume: 28, Issue: 2, April 2020)
Page(s): 722 - 735
Date of Publication: 13 March 2020

ISSN Information:

Funding Agency:

No metrics found for this document.

I. Introduction

Since the introduction of wireless communication networks, there has always been a significant interest in characterizing their real-time and delay performance. Over the last decade this interest has been revived by novel applications from the domain of automation and control, and cyber-physical systems. The introduction of Ultra-Reliable Low-Latency Communication (URLLC) as one major innovation of fifth generation (5G) cellular networks [1], [2] is a good example of the contemporary industrial interest in such applications. Another example is the evolution of Time-Sensitive Networking (TSN) – which has originally been targeting multimedia applications run over Ethernet – into a new automation-centric networking standard with extensions to wireless networks.

https://1.ieee802.org/tsn/

Usage
Select a Year
2025

View as

Total usage sinceMar 2020:637
0123456JanFebMarAprMayJunJulAugSepOctNovDec353400000000
Year Total:15
Data is updated monthly. Usage includes PDF downloads and HTML views.

Contact IEEE to Subscribe

References

References is not available for this document.