batmand 0.3.2-16 source package in Ubuntu

Changelog

batmand (0.3.2-16) unstable; urgency=medium

  * Upgraded to policy 3.9.6, no changes required
  * Update years in debian/copyright
  * debian/patches:
    - Move patches to alternative DEP-3 format and manage them with gbp pq
  * debian/control, debian/rules:
    - Drop batmand-dbg in favor of -dbgsym package
  * debian/batmand.service
    - Drop whitespaces around EnvironmentFile key
  * Drop unused lintian overrides

 -- Sven Eckelmann <email address hidden>  Wed, 30 Dec 2015 19:52:29 +0100

Upload details

Uploaded by:
Holger Levsen
Uploaded to:
Sid
Original maintainer:
Holger Levsen
Architectures:
linux-any
Section:
net
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
batmand_0.3.2-16.dsc 1.9 KiB f9917e4da38d54aaa9134f2b70ce2c7195ea368bc027dd4fbe66ed3b9429827b
batmand_0.3.2.orig.tar.gz 79.1 KiB 2b0f22efc1bda016649db8d6e1214e381d034befa9c9835c3a6a75d5f95cf931
batmand_0.3.2-16.debian.tar.xz 20.0 KiB 6dc98b2b41690135663468f05167dd068c16cb841d865df3603324b9bcc637db

Available diffs

No changes file available.

Binary packages built by this source

batmand: 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.

batmand-dbgsym: debug symbols for package batmand

 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.