# Modelling, Verification, and Comparative Performance Analysis of the   B.A.T.M.A.N. Protocol

**Authors:** Kaylash Chaudhary (University of the South Pacific), Ansgar Fehnker, (University of Twente), Vinay Mehta (University of the South Pacific)

arXiv: 1703.06570 · 2017-03-21

## TL;DR

This paper formalizes the B.A.T.M.A.N. routing protocol, identifies ambiguities in its RFC, develops two models, and compares their performance, revealing the alternative model's advantages in reducing suboptimal routes.

## Contribution

It provides a formalization of B.A.T.M.A.N., resolves ambiguities in the RFC, and compares two models to evaluate their routing efficiency and correctness.

## Key findings

- Both models ensure loop-freedom and route discovery.
- The models are comparable in route discovery time and message count.
- The alternative model reduces suboptimal routes significantly.

## Abstract

This paper considers on a network routing protocol known as Better Approach to Mobile Ad hoc Networks (B.A.T.M.A.N.). The protocol serves two aims: first, to discover all bidirectional links, and second, to identify the best-next-hop for every other node in the network. A key element is that each node will flood the network at regular intervals with so-called originator messages.   This paper describes in detail a formalisation of the B.A.T.M.A.N. protocol. This exercise revealed several ambiguities and inconsistencies in the RFC. We developed two models. The first implements, if possible, a literal reading of the RFC, while the second model tries to be closer to the underlying concepts. The alternative model is in some places less restrictive, and rebroadcasts more often when it helps route discovery, and will on the other hand drop more messages that might interfere with the process.   We verify for a basic untimed model that both interpretations ensure loop-freedom, bidirectional link discovery, and route-discovery. We use simulation of a timed model to compare the performance and found that both models are comparable when it comes to the time and number of messages needed for discovering routes. However, the alternative model identifies a significantly lower number of suboptimal routes, and thus improves on the literal interpretation of the RFC.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1703.06570/full.md

## Figures

8 figures with captions in the complete paper: https://tomesphere.com/paper/1703.06570/full.md

## References

16 references — full list in the complete paper: https://tomesphere.com/paper/1703.06570/full.md

---
Source: https://tomesphere.com/paper/1703.06570