B.A.T.M.A.N

b.a.t.m.a.n@lists.open-mesh.org

15 participants
4308 discussions

Re: [B.A.T.M.A.N.] mesh
by Sven Eckelmann 06 May '11

06 May '11

On Friday 06 May 2011 19:21:58 Jose Armando wrote: > Sorry seven here's is what looking for I would like to build a firmware > that work like mesh and I been told that Batman is the best I'm new one > this linux open source but I want to learn and I want to build mesh > firmware that work with this > 1 open ssid > 2 close ssid with wpa password > 3 mesh ssid by MAC addresses so I can mesh 20 routers > 4 used captival portal > Used Opendns So, do you want batman-adv or batmand or bmxd or bmx6? Why is one of the previous ones better then... lets say olsr or babeld. Do you want mesh for the backbone or for the actual clients? Do you want to use multiple interfaces? Why don't you use already existing solutions? What kind of router do you use? What do you mean by open ssid? How do you think is a ssid and wpa are related? What is a "ssid by MAC addresses"? Do you know what IBSS is? Why is a dns provider relevant? Are you able to build OpenWRT? Do you know what an OpenWRT feed is? Do you know how to build packages through OpenWRT feeds and integrate them in a OpenWRT image? Kind regards, Sven

2 1

Re: [B.A.T.M.A.N.] mesh
by Sven Eckelmann 06 May '11

06 May '11

On Friday 06 May 2011 19:58:46 Sebastián D. Criado wrote: > El 06/05/11 14:39, Sven Eckelmann escribió: > > On Friday 06 May 2011 19:21:58 Jose Armando wrote: > >> Sorry seven here's is what looking for I would like to build a firmware > >> that work like mesh and I been told that Batman is the best I'm new one > >> this linux open source but I want to learn and I want to build mesh > >> firmware that work with this > >> 1 open ssid > >> 2 close ssid with wpa password > >> 3 mesh ssid by MAC addresses so I can mesh 20 routers > >> 4 used captival portal > >> Used Opendns > > Our development has everything he suggests. > > http://nightwing.lugro-mesh.org.ar/en/ > > Indeed. He knows this because it has been communicating with us for > assistance. > > http://lugro.org.ar/pipermail/nightwing/2011-February/000288.html > > I do not understand that says "i want to build" when it should say "im > using" > > In deed, today he communicated with us to offer a donation of equipment. Ok, so everything is already solved. Kind regards, Sven

1 0

Re: [B.A.T.M.A.N.] mesh
by Sven Eckelmann 06 May '11

06 May '11

On Friday 06 May 2011 19:31:33 Jose Armando wrote: > Sven are u in usa? Not right now and propably not in the near future. Kind regards, Sven

1 0

Re: [B.A.T.M.A.N.] mesh
by Sven Eckelmann 06 May '11

06 May '11

On Friday 06 May 2011 19:02:48 Jose Armando wrote: > Question so openwrt do not work with Batman? U saying I need to creater > package for my router? Diego to much Question but I'm need I was think just > install openwrt on the router u can install any package ? You still didn't answer what you want.... and the gibberish at the end doesn't help. You can try to join #batman on irc.freenode.net and maybe we can find out what you want and how this can be done. Kind regards, Sven

1 0

Re: [B.A.T.M.A.N.] mesh
by Sven Eckelmann 06 May '11

06 May '11

On Friday 06 May 2011 18:11:21 Jose Armando wrote: > Hello Sven > > Thank you so much for u info i will play with it > Note > Question if for one reason i cant make work can u help to install for > me i can open telnet on my router and u can do for me i will pay you > for u time and i will be greatfull to you No, this will not work because you must create a package on another system and ensure that you flash your router with the corresponding openwrt version. You can join #batman on irc.freenode.net to ask your questions during the installation phase. Kind regards, Sven

1 0

[B.A.T.M.A.N.] mesh
by Jose Armando 06 May '11

06 May '11

Hello Can any one tell me how to install batman on openwrt my router has openwrt install with luci but i cant install batman im need on this mesh or any one can build for me and i will pay for u time thank you Armando Dieguez Phone 714.292.0156

2 1

[B.A.T.M.A.N.] [PATCH] batman-adv: Fix rcu_lock imbalance in find_router
by Marek Lindner 05 May '11

05 May '11

Signed-off-by: Marek Lindner <lindner_marek(a)yahoo.de> --- routing.c | 14 +++++++++----- 1 files changed, 9 insertions(+), 5 deletions(-) diff --git a/routing.c b/routing.c index 49f5715..d8cde2b 100644 --- a/routing.c +++ b/routing.c @@ -1213,7 +1213,7 @@ struct neigh_node *find_router(struct bat_priv *bat_priv, router = orig_node_get_router(orig_node); if (!router) - return NULL; + goto err; /* without bonding, the first node should * always choose the default router. */ @@ -1222,10 +1222,8 @@ struct neigh_node *find_router(struct bat_priv *bat_priv, rcu_read_lock(); /* select default router to output */ router_orig = router->orig_node; - if (!router_orig) { - rcu_read_unlock(); - return NULL; - } + if (!router_orig) + goto err_unlock; if ((!recv_if) && (!bonding_enabled)) goto return_router; @@ -1268,6 +1266,12 @@ struct neigh_node *find_router(struct bat_priv *bat_priv, return_router: rcu_read_unlock(); return router; +err_unlock: + rcu_read_unlock(); +err: + if (router) + neigh_node_free_ref(router); + return NULL; } static int check_unicast_packet(struct sk_buff *skb, int hdr_size) -- 1.7.2.3

2 3

Re: [B.A.T.M.A.N.] Routing decisions
by Sven Eckelmann 05 May '11

05 May '11

Ed Okerson wrote: > On Thu, May 5, 2011 at 12:35 PM, Sven Eckelmann <sven(a)narfation.org> wrote: > > Ed Okerson wrote: > >> On Thu, May 5, 2011 at 10:44 AM, Marek Lindner <lindner_marek(a)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. > > If I increase the hop penalty on all nodes, they will all still be > equal. If all nodes have a hop penalty of 128, will it not make the > same routing decisions as it does if they are all 10? No, the wiki explains it quite well, but I'll try to explain it a little bit different. Lets assume that you have perfect links (quality = 255) between all nodes in a route. Each one would say: "hey, I can reach the following neighbors with the quality of 255".... now introduce a penalty in each hop (10 for example) which is just substracted from the incoming value. So after a distance of 5 hops only a quality of 205 would be announced. Therefore a node with only a distance of 2 (quality = 235) would be prefered as next hop in this case and not the one with the distance of 5. Target - X1 - X2 - X3 - X4 - X5 - (Announces route with quality 205 to Target) \ \ Y1 - Y2 - (Announces route with quality 235 to Target) This is a quite abstract and not 100% correct explanation of the hop penalty, but should help to understand the implications a little bit better. You have to do the calculations yourself to find a good value for hop penalty. You should have a look at send.c to find more information about it. You should see that it is not really substracted in a linear fashion and that the actual quality is calculation is also more complex,... but the idea is similar to the example mentioned before. Kind regards, Sven

1 0

[B.A.T.M.A.N.] Routing decisions
by Ed Okerson 05 May '11

05 May '11

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. Ed Okerson

3 3

[B.A.T.M.A.N.] [PATCH] batman-adv: remove duplicate code from function is_bidirectional_neigh()
by Daniele Furlan 05 May '11

05 May '11

In function is_bidirectional_neigh the code that find out the one hop neighbor is duplicated. This patch remove the duplicate code and adjust the comments. P.S. It's my first patch, let me know if there is any problem. Signed-off-by: Daniele Furlan <daniele.furlan(a)gmail.com> --- routing.c | 75 ++++++++++++++++++++---------------------------------------- 1 files changed, 25 insertions(+), 50 deletions(-) diff --git a/routing.c b/routing.c index 49f5715..c5dec8c 100644 --- a/routing.c +++ b/routing.c @@ -169,65 +169,40 @@ static int is_bidirectional_neigh(struct orig_node *orig_node, uint8_t orig_eq_count, neigh_rq_count, tq_own; int tq_asym_penalty, ret = 0; - if (orig_node == orig_neigh_node) { - rcu_read_lock(); - hlist_for_each_entry_rcu(tmp_neigh_node, node, - &orig_node->neigh_list, list) { + /* find corresponding one hop neighbor */ + rcu_read_lock(); + hlist_for_each_entry_rcu(tmp_neigh_node, node, + &orig_node->neigh_list, list) { - if (!compare_eth(tmp_neigh_node->addr, - orig_neigh_node->orig)) - continue; + if (!compare_eth(tmp_neigh_node->addr, + orig_neigh_node->orig)) + continue; - if (tmp_neigh_node->if_incoming != if_incoming) - continue; + if (tmp_neigh_node->if_incoming != if_incoming) + continue; - if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) - continue; + if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) + continue; - neigh_node = tmp_neigh_node; - } - rcu_read_unlock(); + neigh_node = tmp_neigh_node; + } + rcu_read_unlock(); - if (!neigh_node) - neigh_node = create_neighbor(orig_node, - orig_neigh_node, - orig_neigh_node->orig, - if_incoming); - if (!neigh_node) - goto out; + if (!neigh_node) + neigh_node = create_neighbor(orig_node, + orig_neigh_node, + orig_neigh_node->orig, + if_incoming); + if (!neigh_node) + goto out; + /* if orig_node is direct neighbour update neigh_node last_valid */ + if (orig_node == orig_neigh_node) { neigh_node->last_valid = jiffies; - } else { - /* find packet count of corresponding one hop neighbor */ - rcu_read_lock(); - hlist_for_each_entry_rcu(tmp_neigh_node, node, - &orig_neigh_node->neigh_list, list) { - - if (!compare_eth(tmp_neigh_node->addr, - orig_neigh_node->orig)) - continue; - - if (tmp_neigh_node->if_incoming != if_incoming) - continue; - - if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) - continue; - - neigh_node = tmp_neigh_node; - } - rcu_read_unlock(); - - if (!neigh_node) - neigh_node = create_neighbor(orig_neigh_node, - orig_neigh_node, - orig_neigh_node->orig, - if_incoming); - if (!neigh_node) - goto out; - } orig_node->last_valid = jiffies; + /* find packet count of corresponding one hop neighbor */ spin_lock_bh(&orig_node->ogm_cnt_lock); orig_eq_count = orig_neigh_node->bcast_own_sum[if_incoming->if_num]; neigh_rq_count = neigh_node->real_packet_count; -- 1.7.1 -- Daniele Furlan

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

B.A.T.M.A.N