Re: [B.A.T.M.A.N.] Routing decisions

[Sven Eckelmann <sven@narfation.org>]

[-- Attachment #1: Type: Text/Plain, Size: 1720 bytes --]

Ed Okerson wrote:
> On Thu, May 5, 2011 at 10:44 AM, Marek Lindner <lindner_marek@yahoo.de> 
wrote:
> > Hi,
> > 
> >> We are evaluating using Batman in an environment where there could be
> >> 200-300 devices in a single building.  We started out setting up 10
> >> devices in our office to figure out how everything works and do some
> >> throughput testing.  We have noticed that the routing decisions always
> >> send the packet to the node towards the destination with the highest
> >> signal strength.  This causes the packet to always traverse the
> >> network with the maximum possible number of hops, which causes
> >> performance to degrade quickly.  Is it possible to use a different
> >> routing algorithm?  It would seem that sending to the node closest to
> >> the destination that the source node can still communicate with
> >> directly would minimize the number of hops.
> > 
> > if you wish to minimize the number of hops you have to increase the hop
> > penalty. Check the "hop penalty" section here:
> > http://www.open-mesh.org/wiki/batman-adv/Tweaking
> 
> That seems to indicate that it is a per node setting, i.e. "using this
> node will incur a penalty of x".  That is also not the desired
> behavior.  For our installation all nodes are in a fixed location, so
> using a particular node as a next hop in the route may incur a penalty
> for one source node, but not another.  This should be dynamically
> determined for each route from each source to each destination to
> minimize hops.

So you have to increase the hop penalty everywhere to force the routing 
algorithm to reduce the number of hops and prefer worse routes with less hops.

Kind regards,
	Sven

[-- Attachment #2: This is a digitally signed message part. --]
[-- Type: application/pgp-signature, Size: 836 bytes --]