hardes2017simulating
Abstract
Community networks establish a wireless mesh network among citizens, providing a network that is independent, free, and (in some cases) available where regular Internet access is not. Following initial disappointments with their performance and availability, they are currently experiencing a second spring. Many of these networks are growing fast, but with little planning and limited oversight. Problems mostly manifest as limited scalability of the network - as has happened in the Freifunk mesh network operating in the city of Paderborn (approx. 800 nodes running the BATMAN IV protocol with control messages alone accounting for 25 GByte per month and node). In this work, we detail how we modeled this real-life network in a computer simulation as a way of allowing rapid (and worry free) experimentation with maximum insight. We describe how we parameterized and validated this model using gathered measurements. Based on the model, we were able to investigate alternative structures and parameterizations to improve the performance. The predicted performance gains map well to those measured after the proposed changes were deployed city-wide.
Quick access
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
BibTeX reference
@inproceedings{hardes2017simulating,
author = {Hardes, Tobias and Dressler, Falko and Sommer, Christoph},
title = {{Simulating a City-Scale Community Network: From Models to First Improvements for Freifunk}},
booktitle = {International Conference on Networked Systems (NetSys 2017)},
address = {G{\"{o}}ttingen, Germany},
doi = {10.1109/NetSys.2017.7903954},
month = {March},
publisher = {IEEE},
year = {2017},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.