Abstract
This paper considers a network routing protocol known as Better Approach to Mobile Adhoc Networks (B.A.T.M.A.N.). The protocol has two aims: first, discovery of all bidirectional links, and second, identification of the best-next-hop to the other nodes. A key mechanism of the protocol is to flood the network at regular intervals with so-called originator messages.
In previous work we formalised the B.A.T.M.A.N. protocol in Uppaal and found several ambiguities and inconsistencies [2]. More importantly, explicit choices in the RFC had, unfortunately, a negative impact on route discovery. This previous work compared a literal model based of the RFC with an incremental improvement. This paper goes one step further and proposes an alternative that departs from the RFC. We compare the performance using simulations in Uppaal, for static as well as dynamic topologies. The analysis shows that the proposed alternative reduces the number of suboptimal routes significantly, and recovers better from routing errors that are introduced by mobility.
In previous work we formalised the B.A.T.M.A.N. protocol in Uppaal and found several ambiguities and inconsistencies [2]. More importantly, explicit choices in the RFC had, unfortunately, a negative impact on route discovery. This previous work compared a literal model based of the RFC with an incremental improvement. This paper goes one step further and proposes an alternative that departs from the RFC. We compare the performance using simulations in Uppaal, for static as well as dynamic topologies. The analysis shows that the proposed alternative reduces the number of suboptimal routes significantly, and recovers better from routing errors that are introduced by mobility.
Original language | English |
---|---|
Title of host publication | NASA Formal Methods |
Subtitle of host publication | 10th International Symposium, NFM 2018 Newport News, VA, USA, April 17-19, 2018 Proceedings |
Editors | Aaron Dutle, César Muñoz, Anthony Narkawicz |
Place of Publication | Cham |
Publisher | Springer |
Pages | 164-178 |
Number of pages | 15 |
ISBN (Electronic) | 978-3-319-77935-5 |
ISBN (Print) | 978-3-319-77934-8 |
DOIs | |
Publication status | Published - 2018 |
Event | 10th International Symposium on NASA Formal Methods 2018 - Newport News Marriott at City Center, Newport News, United States Duration: 17 Apr 2018 → 19 Apr 2018 Conference number: 10 https://shemesh.larc.nasa.gov/NFM2018/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 10811 |
ISSN (Print) | 0302-9743 |
Conference
Conference | 10th International Symposium on NASA Formal Methods 2018 |
---|---|
Abbreviated title | NFM 2018 |
Country/Territory | United States |
City | Newport News |
Period | 17/04/18 → 19/04/18 |
Internet address |