Protocol independent link state estimation and a novel throughput aware routing strategy for B.A.T.M.A.N. V
Translated title
Protokol uafhængig link tilstands estimering og ny thorughput opmærksom routing strategi til B.A.T.M.A.N. V
Authors
Krøyer, Rolf ; Andersen, Jeppe Nellemann ; Sørensen, Daniel Greth
Term
4. term
Education
Publication year
2021
Submitted on
2021-06-03
Pages
107
Abstract
This project explores how to adapt the B.A.T.M.A.N. V ad hoc network protocol for military communication. The goal is to make routing less dependent on lower protocol layers (the parts that handle the underlying link) and to improve route choices so links with high packet loss are avoided. Implementation and evaluation are done through simulations. Part one examines interference in wireless networks and how it can be modeled and simulated. Part two proposes a method to estimate link throughput without information from lower layers. The method uses packet trains (bursts of packets sent close together) and information sharing between neighbors. Results show that this reduces overall packet loss compared to B.A.T.M.A.N. V when assuming no lower-layer data is available. Part three looks at estimating end-to-end throughput for multi-hop routes (paths that pass through several nodes). It finds that B.A.T.M.A.N. V’s hop penalties are not representative, and proposes a new method that better fits heterogeneous links (links of differing quality). Results indicate generally lower packet loss, and that routing avoids high-loss areas by sometimes choosing longer paths.
Dette projekt undersøger, hvordan ad hoc-netværksprotokollen B.A.T.M.A.N. V kan tilpasses militær kommunikation. Målet er at gøre rutevalg (routing) mindre afhængigt af de nedre protokollag (de dele af netværket, der håndterer selve forbindelsen), og samtidig forbedre rutevalget, så forbindelser med høj pakkebortfald (packet loss) undgås. Alt implementeres og vurderes gennem simuleringer. Del 1 undersøger interferens (forstyrrelser) i trådløse net og, hvordan den kan modelleres og simuleres. Del 2 foreslår en metode til at estimere forbindelsers gennemløb (throughput) uden information fra de nedre lag. Metoden bygger på “pakke-tog” (serier af pakker sendt hurtigt efter hinanden) og informationsdeling mellem naboer. Resultaterne viser, at denne metode reducerer det samlede pakkebortfald sammenlignet med B.A.T.M.A.N. V, når man antager, at der ikke er data fra de nedre lag. Del 3 undersøger, hvordan man kan lave et repræsentativt estimat af end-to-end-gennemløb for multi-hop-ruter (ruter via flere mellemled). Det konkluderes, at B.A.T.M.A.N. V’s hop-straffe ikke er repræsentative, og der foreslås derfor en ny metode, som er bedre tilpasset heterogene forbindelser (forbindelser med forskellig kvalitet). Resultaterne viser generelt lavere pakkebortfald, og at rutevalget i højere grad undgår områder med høj pakkebortfald ved at vælge længere ruter.
[This apstract has been rewritten with the help of AI based on the project's original abstract]