TL;DR: This document describes the implementation of the MIT Roofnet, an experimental multi-hop 802.11b mesh network in apartments in Cambridge, MA, which is intended to turn into a self-sustaining community network in the near future.
Abstract: This document describes the implementation of the MIT Roofnet, an experimental multi-hop 802.11b mesh network. Roofnet consists of about 50 nodes in apartments in Cambridge, MA. Each node is in radio range of a subset of the other nodes, and can communicate with the rest of the nodes via multihop forwarding. A few of the nodes act as gateways to the wired Internet. A primary feature of the Roofnet design is that it requires no configuration or planning, and is thus easy to deploy and expand. A new user can turn on a new node and start using it for Internet connectivity with no configuration beyond installing the hardware. The new user need not allocate an IP address, aim a directional antenna, or ask existing users to perform any special actions to add the new node. One consequence of an unplanned network is that each node can route packets through any of a large number of neighbors, but the radio link to each neighbor is typically of marginal quality; finding the best multi-hop routes through a rich mesh of marginal links turns out to be a challenge. Roofnet performs well. The longest routes are four hops long. Typical latencies are dozens of milliseconds, even for long routes; typical throughputs are dozens to hundreds of kilobytes per second. While the current network is an experimental prototype, we intend that it turn into a self-sustaining community network in the near future.
TL;DR: This paper proposes a mechanism combining service differentiation and packet aggregation in IEEE 802.11-based WMNs that does not require any modification to the IEEE802.11 MAC and can be readily deployed exploiting off-the-shelf hardware.
TL;DR: This work proposes an approach for self-organization in ad-hoc wireless multi-hop mesh networks, where the client is fully freed from such mundane tasks as IP configuration, etc and the community mesh network itself is fully self-organized thus no operator or provider is required.
Abstract: A community network must be usable for inexperienced end users; thus self-organization is essential On the one hand, we propose an approach for self-organization in ad-hoc wireless multi-hop mesh networks, where the client is fully freed from such mundane tasks as IP configuration, etc On the other hand, the community mesh network itself is fully self-organized thus no operator or provider is required We present the architecture of the Berlin RoofNet (BRN) and a distributed realization of services like DHCP, ARP and Internet gateway discovery and selection In addition, results of a detailed simulation and experimental evaluation comparing our distributed hash table based approach to traditional methods are presented We show that our approach is more reliable, efficient and responsive
TL;DR: An entirely backwards-compatible extension to the 802.11 link-layer protocol for making use of overheard packets, called RTS-id, is examined, which provides a 12% decrease in the number of expected data transmissions for a median path, and over 25% reduction for more than 10% of Roofnet paths.
Abstract: The broadcast nature of wireless networks is the source of both their utility and much of their complexity. To turn what would otherwise be unwanted interference into an advantage, this paper examines an entirely backwards-compatible extension to the 802.11 link-layer protocol for making use of overheard packets, called RTS-id. RTS-id operates by augmenting the standard 802.11 RTS/CTS process with a packet ID check, so that if the receiver of an RTS message has already received the packet in question, it can inform the sender and bypass the data transmission entirely.
We present the design, implementation, and evaluation of RTS-id on a real hardware platform that provides a DSP-programmable 802.11 radio. While limited in scale due to restricted availability of the CalRadio platform, our testbed experiments demonstrate that RTS-id can reduce air time usage by 25.2% in simple 802.11b infrastructure deployments on real hardware, even when taking into account all of the protocol overhead. Additionally, we present trace-based simulations demonstrating the potential savings on the MIT Roofnet mesh network. In particular, RTS-id provides a 12% decrease in the number of expected data transmissions for a median path, and over 25% reduction for more than 10% of Roofnet paths.
TL;DR: This extended abstract describes the experiences from constructing the MIT Roofnet, an experimental rooftop wireless network that is self-configuring, robust in the face of varying link conditions, and automatically finds high throughput paths in the system.
Abstract: This extended abstract describes our experiences from constructing the MIT Roofnet, an experimental rooftop wireless network. The ultimate goal of Roofnet is to build an ad-hoc network infrastructure capable of providing pervasive highspeed network access. Currently, the network currently consists of more than 35 nodes spread over two square kilometers of Cambridge, MA. The network is self-configuring, robust in the face of varying link conditions, and automatically finds high throughput paths in the system. The main focus of this paper is on lessons we’ve learned about building and deploying this kind of system, though we will touch on some research results as well.