On Maximizing the Probability of Achieving Deadlines in Communication Networks

dc.contributor.authorBecker, Benjamin
dc.contributor.authorOberli, Christian
dc.contributor.authorMeuser, Tobias
dc.contributor.authorSteinmetz, Ralf
dc.date.accessioned2025-01-20T17:08:34Z
dc.date.available2025-01-20T17:08:34Z
dc.date.issued2024
dc.description.abstractWe 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.
dc.description.funderResearch Center for Integrated Disaster Risk Management (CIGIDEN)
dc.fuente.origenWOS
dc.identifier.doi10.3390/jsan13010009
dc.identifier.eissn2224-2708
dc.identifier.urihttps://doi.org/10.3390/jsan13010009
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/90962
dc.identifier.wosidWOS:001169985500001
dc.issue.numero1
dc.language.isoen
dc.revistaJournal of sensor and actuator networks
dc.rightsacceso restringido
dc.subjectad hoc networks
dc.subjectdeadline achievement probability
dc.subjectdelay-aware routing
dc.subjectreal-time systems
dc.subjecttime-critical communications
dc.titleOn Maximizing the Probability of Achieving Deadlines in Communication Networks
dc.typeartículo
dc.volumen13
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
On maximizing.pdf
Size:
517.51 KB
Format:
Adobe Portable Document Format
Description: