From HacDC Wiki
This project will be launched with a sprint on Feb 25-27, 2011.
The goal of Project Byzantium is to develop a communication system by which users can connect to each other and share information in the absence of convenient access to the Internet.
The use cases for such a system would be:
- The infrastructure for accessing the internet has become damaged or inaccessible. (Eg, a natural disaster such as Hurricane Katrina.)
- A central authority has decided to explicitly block or shutdown key infrastructure. (Eg, Egypt's recent internet blackout.)
- A zombie apocalypse in which the personnel responsible for maintaining key infrastructure have all been turned.
The project aims to develop and publish the necessary documentation, best practices, and software to construct and support such a system. Our current approach is to start by investigating and documenting the existing technologies which would support such a system. In particular, mesh networking protocols, wireless networking technologies, and decentralized (or less-centralized) alternatives to internet addressing/naming systems such as DNS. In designing the system, we aim to reduce the dependency on exotic hardware or skill sets so that the system can be deployed quickly and easily by average internet users.
Goal - Reliably bridge two different and separate wireless networks without using existing internet infrastructure.
Design goals 1) There should be a webserver on each network. 2) Nodes in either network should be able to reach both webservers. 3) Nodes on one network should be able to talk to nodes on the other network and vice versa. 4) Networks should have at least 3-5 nodes each.
Tentative schedule is as follows:
Friday - 8:00pm Pizza and planning (any particular request should email me off list). (COMPLETE!) Saturday - 9:00am Start showing up (IN PROGRESS!) Saturday - 10:00am Divide into groups and start the sprint. Sunday - 10:00am Start showing up. Sunday - 11:00am Finish the sprint! Sunday - Evening Debriefing (I'll be taking extensive notes to update the wiki).
Plans! We're gonna have two teams each will implement a mesh network using some existing mesh protocol. One team will be working with BATMAN and the other with BABEL. Each network will use at least one openwrt device the rest will be laptops and netbooks.
from Wikipedia: Byzantine
Distributed Hash Table (DHT) - Wikipeda page on DHTs. Has a decent overview of how they work.
Gossip Protocols: Nodes in a network pseudorandomly select peers to exchange information with. Could be useful for distributing the contents of a DHT-based DNS implementation within a mesh network. Kademlia has an interesting way of handling the entry distribution problem. When inserting an entry, it iterates through the table to find suitable nodes in the network to hold that entry and propagates it to them as well as saving a copy locally.
CoDoNS paper - A very good paper from 2004 on a distributed DNS alternative. It still relies on centralized domain name registration. CoDoNS main page - It appears that CoDoNS is operational and running on PlanetLab. Unfortunately, I don't see any code. I see no reason why we can't simply hijack their design.
Intentional Naming System - "INS is a new naming system intended for naming and discovering a variety of resources in future networks of devices and services. It has the following interesting characteristics about the way it names resources and the way names are resolved."
Long haul links. Tenative planning meeting: Thu Mar 3 2011 after the bike maintenance class
Stuff to bring (proposed)
- FMRS/GMRS radios that you wouldn't mind loosing
- laser pointers (the more exotic the colors the better)
- really bright LEDs
- radio shack/hardware store high bandwidth unlicensed
- Modified Ronja
- Ronja with lasers
- Ronja with balloon targets
- Ronja with lasers and balloon targets
- read up on Ronja
- read up on FMRS/GMRS
- read up on soundcard modems
- measure the bandwidth of a point to point long haul connection at maximum distance
- find the optimum distance for maximum bandwidth
- mathematically describe the way to maximize throughput with a minimum number of nodes
- run an ssh session over whatever link is established
- revisit sprint 1
- revisit sprint 2 (possibly with different methods)
- new project
- long haul mesh