Neumann, A, López E, Navarro L. 2012. An evaluation of BMX6 for Community Wireless Networks. International Workshop on Community Networks and Bottom-up-Broadband (CNBuB 2012).
Nowadays, a growing number of communities of citizens build, operate and own open IP-based community wireless networks with thousands of low capacity nodes actively participating in routing the data traffic. This article focuses on one of their concerns, routing and its scalability, by presenting BatMan-eXperimental Version 6 (BMX6) and evaluating its performance. BMX6 is a low overhead and scalable mesh network routing protocol inspired by human networks. Its performance is evaluated in comparison with OLSR in terms of overhead and convergence time as networks grow in number of nodes
A. Neumann, L. Navarro, R. Baig, P. Escrich
Abstract—Community wireless mesh networks are decentralized and cooperative structures with participation rules that define their freedom, openness and neutrality. The operation of these networks require routing algorithms that may impose additional unnecessary technical restrictions in the determination of routes that can restrict the freedom of community users. We propose a receiver-driven discretionary routing mechanism
Title: Evaluation of Dynamic Routing Protocols on Realistic Wireless Topologies
Community Networks are consolidating themselves as a valid model to extend the edges of the Internet. As a result of efforts to overcome specific problems in this new model, communities have developed very interesting ideas and solutions in many fields. Nevertheless, the research community has so far paid marginal attention to them. As a consequence, not only is there a lack of references evaluating the performance of the routing protocols for IPv6 in real-life scenarios, but other interesting proposals such as BatMan-eXperimental version 6 (BMX6) remain completely unstudied.
Presentation title: Advances of BMX6 Mesh Routing Protocol
Event: International Summit for Community Wireless Networks, 2-4 October 2013, Berlin
BMX6, the successor of BatMan-eXperimental, is a mesh routing protocol for community networks. Having learned from the shortcomings of commonly used protocols such as OLSR, Babel, and Batman, this relatively young protocol incorporates fundamentally new architectural concepts and mechanisms to address the challenges of wireless community networks. After a short introduction, this presentation will briefly outline BMX6 concepts to address related aspects such as scalability, heterogeneity, performance, self-configuration, and even trust and security. Further, performance measurements based on emulation and community experimentation (e.g. during Wireless Battle Mesh) will be summarized and experiences gathered from real community deployments will be discussed....
Evaluation of mesh routing protocols for wireless community
In recent years, we have witnessed the exponential growth of wireless community networks
as a response to the clear necessity of Internet access for participation in society. For
Securely-Entrusted Multi-Topology Routing for Community Networks
Routing in open and decentralized networks relies on coop-
eration despite the participation of unknown nodes and node
administrators pursuing heterogeneous trust and security goals.
BMX7 slides from Wireless Battle Mesh v9 in Porto/Portugal
"BMX7: Decentralized Routing Security for Community Mesh Networks"
BMX7 presentation from 8. 8. 2016 at Freifunk-Berlin seminar in C-Base/Berlin
Title: "Secure and Decentralized Distance-Vector Routing with BMX7"
Title: Experimental evaluation of BMX6 routing metrics in a 802.11an wireless-community mesh network
Authors: Cerdà, L., Neumann, A., Maccari, L.
Published: CNBuB 2015. 4th Workshop on Community Networks and Bottom-up-Broadband
Modeling the performance of Wireless Mesh Networks (WMN) is a task that has received a lot of attention and has produced a large body of related literature. Most of the times, such literature is based on analytic assumptions or computer simulations, and results not always match reality. In this paper we use data collected over a one-month period in a 50-nodes wireless community network in Barcelona to compare the experimental throughput we measured over multi-hop paths with the capacity estimated using the well known conflict graph model. Our experiments show that the model generally overestimates the available capacity, despite the availability of precise information on the underlying network graph. We also use the data to test the performance of the BMX6 routing protocol that runs on the network nodes and show that in the large majority of cases the path chosen by BMX6 corresponds to the path with the highest available capacity, which is a key feature to guarantee the maximum exploitation of the network resources....