A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors

02/04/2020
by   Karol Rydzewski, et al.
0

novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.

READ FULL TEXT
research
02/24/2020

A Mechanised Semantics for HOL with Ad-hoc Overloading

Isabelle/HOL augments classical higher-order logic with ad-hoc overloadi...
research
04/15/2020

Sound of Guns: Digital Forensics of Gun Audio Samples meets Artificial Intelligence

Classifying a weapon based on its muzzle blast is a challenging task tha...
research
09/10/2023

Debugging Trait Errors as Logic Programs

Rust uses traits to define units of shared behavior. Trait constraints b...
research
04/12/2023

Localizing Model Behavior with Path Patching

Localizing behaviors of neural networks to a subset of the network's com...
research
07/04/2018

Comments on Cooperative Density Estimation in Random Wireless Ad Hoc Networks

In Onur et al. ["Cooperative density estimation in random wireless ad ho...
research
02/01/2021

Classifications based on response times for detecting early-stage Alzheimer's disease

Introduction: This paper mainly describes a way to detect with high accu...
research
11/04/2022

Dealing with Abbreviations in the Slovenian Biographical Lexicon

Abbreviations present a significant challenge for NLP systems because th...

Please sign up or login with your details

Forgot password? Click here to reset