New code and paper for the community network analysis
I have released an update of the python code for the analysis of community networks topologies. The code is part of a collaboration with the SmartUC project, that I have described in a previous post and is available with a GPL license on my github page. The new version includes some refactoring of existent code, a new heuristic to compute group centrality and the measurement of group centrality considering only routes to the gateways of the network. This feature is particularly important to identify the nodes that an attacker should control to be able to intercept a given fraction of all the traffic going to the Internet. It has been used for my last publication to the CNBUB workshop (of which I am in the program committee), titled "An analysis of the Ninux wireless community network" that can be found at this link and it is now still in development for a new publication that will analyse the behaviour of three large community wireless networks, with particular attention to their privacy features.