Mesh Routing and Service Discovery
Stub. Neighbor discovery and mesh networking; geographic, hierarchical, and stochastic addressing; link-state and distance-vector routing and their mesh incarnations (OLSR, DSR, AODV); and the higher-layer problems mesh routing enables — hierarchical/geographic routing, delay-tolerant networking, and gossip algorithms.
How wireless devices, none of which can reach every destination directly, cooperate to discover and maintain multi-hop paths. Starts with neighbor discovery and the addressing schemes that make sense in a mesh (geographic, hierarchical, stochastic — as opposed to a fixed hierarchical IP-style scheme), then the two classical routing paradigms (link-state, distance-vector) and their concrete mesh/ad-hoc protocols (OLSR, DSR, AODV). This routing substrate is what makes higher-layer services — geographic/hierarchical routing to a role rather than an address, delay-tolerant networking for intermittently-connected nodes, and gossip algorithms for dissemination — possible.
Outline (TODO — flesh out each)
- Neighbor discovery
- Mesh networking
- Types of addressing — geographic, hierarchical, stochastic
- Link state routing
- Distance vector routing
- Mesh routing protocols
- Optimized Link State Routing (OLSR)
- Dynamic Source Routing (DSR)
- Ad-hoc On-Demand Distance Vector (AODV)
- Hierarchical and geographic routing
- Delay-tolerant networking
- Gossip algorithms