Maximizing the probability of message delivery over ever-changing communication scenarios in tactical networks

18Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This letter introduces a stochastic model to maximize the probability of message delivery over ever-changing communication scenarios in tactical networks. Our model improves modern tactical systems implementing store-and-forward mechanisms organized in a hierarchy of layers for messages, IP packets and radios. The goal is to estimate the optimum redundancy for the user data-flow to overcome packet loss during changes in the link data rate, including disconnections. Experiments in a VHF network illustrate the numerical results from our model using messages with different sizes over two patterns of data rate change.

Cite

CITATION STYLE

APA

Loevenich, J. F., Lopes, R. R. F., Rettore, P. H., Eswarappa, S. M., & Sevenich, P. (2021). Maximizing the probability of message delivery over ever-changing communication scenarios in tactical networks. IEEE Networking Letters, 3(2), 84–88. https://doi.org/10.1109/LNET.2021.3066536

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free