| Paketname | batmand |
| Beschreibung | better approach to mobile adhoc networking |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 0.3.2-6 |
| Sektion | net |
| Priorität | extra |
| Installierte Größe | 200 Byte |
| Hängt ab von | libc6 (>= 2.7) |
| Empfohlene Pakete | batmand-gateway-dkms (>= 0.3.2-6) | batmand-gateway-modules |
| Paketbetreuer | Holger Levsen |
| Quelle | |
| Paketgröße | 54104 Byte |
| Prüfsumme MD5 | 3ab905bd20e2a73093a5068a8c66c420 |
| Prüfsumme SHA1 | af7fa0f6c2de35c150fe2372cdb5eb8899238397 |
| Prüfsumme SHA256 | 82622d887ceae6fa2a1e5297864fc295247c2bb90984918a8e5c3d604bc6b165 |
| Link zum Herunterladen | batmand_0.3.2-6_i386.deb |
| Ausführliche Beschreibung | 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.
|