TU Darmstadt / ULB / TUprints

On Maximizing the Probability of Achieving Deadlines in Communication Networks

Becker, Benjamin ; Oberli, Christian ; Meuser, Tobias ; Steinmetz, Ralf (2024)
On Maximizing the Probability of Achieving Deadlines in Communication Networks.
In: Journal of Sensor and Actuator Networks, 2024, 13 (1)
doi: 10.26083/tuprints-00027199
Article, Secondary publication, Publisher's Version

[img] Text
Copyright Information: CC BY 4.0 International - Creative Commons, Attribution.

Download (529kB)
Item Type: Article
Type of entry: Secondary publication
Title: On Maximizing the Probability of Achieving Deadlines in Communication Networks
Language: English
Date: 7 May 2024
Place of Publication: Darmstadt
Year of primary publication: 18 January 2024
Place of primary publication: Basel
Publisher: MDPI
Journal or Publication Title: Journal of Sensor and Actuator Networks
Volume of the journal: 13
Issue Number: 1
Collation: 24 Seiten
DOI: 10.26083/tuprints-00027199
Corresponding Links:
Origin: Secondary publication DeepGreen

We consider the problem of meeting deadline constraints in wireless communication networks. Fulfilling deadlines depends heavily on the routing algorithm used. We study this dependence generically for a broad class of routing algorithms. For analyzing the impact of routing decisions on deadline fulfillment, we adopt a stochastic model from operations research to capture the source-to-destination delay distribution and the corresponding probability of successfully delivering data before a given deadline. Based on this model, we propose a decentralized algorithm that operates locally at each node and exchanges information solely with direct neighbors in order to determine the probabilities of achieving deadlines. A modified version of the algorithm also improves routing tables iteratively to progressively increase the deadline achievement probabilities. This modified algorithm is shown to deliver routing tables that maximize the deadline achievement probabilities for all nodes in a given network. We tested the approach by simulation and compared it with routing strategies based on established metrics, specifically the average delay, minimum hop count, and expected transmission count. Our evaluations encompass different channel quality and small-scale fading conditions, as well as various traffic load scenarios. Notably, our solution consistently outperforms the other approaches in all tested scenarios.

Uncontrolled Keywords: ad hoc networks, deadline achievement probability, delay-aware routing, real-time systems, time-critical communications
Identification Number: Artikel-ID: 9
Status: Publisher's Version
URN: urn:nbn:de:tuda-tuprints-271996
Additional Information:

This article belongs to the Topic Electronic Communications, IOT and Big Data

Classification DDC: 000 Generalities, computers, information > 004 Computer science
600 Technology, medicine, applied sciences > 621.3 Electrical engineering, electronics
Divisions: 18 Department of Electrical Engineering and Information Technology > Institute of Computer Engineering > Multimedia Communications
Date Deposited: 07 May 2024 09:40
Last Modified: 07 May 2024 09:40
SWORD Depositor: Deep Green
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/27199
Actions (login required)
View Item View Item