B.A.T.M.A.N. (better approach to mobile ad-hoc networking) is a new routing protocol for multi-hop ad-hoc mesh networks.
The approach of the B.A.T.M.A.N algorithm is to divide the knowledge about the best end-to-end paths between nodes in the mesh to all participating nodes. Each node perceives and maintains only the information about the best next hop towards all other nodes. Thereby the need for a global knowledge about local topology changes becomes unnecessary. Additionally, an event-based but timeless flooding mechanism prevents the accruement of contradicting topology information and limits the amount of topology messages flooding the mesh. The algorithm is designed to deal with networks that are based on unreliable links.
|License||Verified by||Verified on||Notes|
|GPLv2||Debian||20 March 2013|
|GPLv2orlater||Debian||20 March 2013|
Leaders and contributors
Resources and communication