1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
Source: batmand
Section: net
Priority: extra
Maintainer: Holger Levsen <holger@debian.org>
Uploaders: Wesley Tsai <wesleyboy42@gmail.com>
Build-Depends: debhelper (>= 5)
Standards-Version: 3.8.0
Homepage: http://open-mesh.net/batman
Vcs-Svn: svn://svn.debian.org/svn/collab-maint/deb-maint/batmand
Vcs-Browser: http://svn.debian.org/wsvn/collab-maint/deb-maint/batmand
Package: batmand
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: better approach to mobile adhoc networking
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.
|
