Mesh networks
Mesh networks are communication networks in which each node connects to multiple other nodes, forming redundant paths that let data route through available intermediate nodes, giving inherent fault tolerance compared to star or tree topologies.
What Are Mesh Networks?
Mesh networks are communication networks in which each node connects to multiple other nodes, forming a web of redundant paths for data to travel between any two endpoints. Unlike conventional star or tree topologies, where a central hub mediates all traffic, mesh networks allow data to route through whichever combination of intermediate nodes is currently available, giving the network inherent fault tolerance. Wireless mesh networks (WMNs) apply this topology using radio links, enabling self-organizing, multi-hop communication without requiring a wired backbone.
The concept draws on graph theory and distributed routing algorithms. Early mesh designs appeared in military packet radio systems during the 1970s, and the topology later became central to ad hoc networking research in the 1990s. The IEEE 802.11s amendment, ratified in 2011, formalized wireless mesh networking as an extension of the 802.11 (Wi-Fi) standard.
IEEE 802.11s and the Wireless Mesh Standard
The IEEE 802.11s standard defines the protocols and functions that enable WLAN nodes to forward frames to neighboring mesh points, extending network coverage without infrastructure wiring. The standard introduces mesh frame forwarding at the MAC layer, a mesh peering management protocol, and the Hybrid Wireless Mesh Protocol (HWMP) as the mandatory default routing mechanism. HWMP combines on-demand path selection, derived from the Ad hoc On-Demand Distance Vector (AODV) protocol, with a proactive tree-based mode for high-traffic backhaul paths. These mechanisms allow mesh access points to discover one another, establish encrypted peer links, and collectively form a self-configuring multi-hop fabric.
Routing and Self-Organization
Routing in mesh networks is distributed: no single controller maintains the full path table. Proactive protocols such as Optimized Link State Routing (OLSR) flood topology information periodically so every node maintains a complete view. Reactive protocols such as AODV and Dynamic Source Routing (DSR) discover paths on demand, reducing control overhead in sparse or infrequently communicating networks. Hybrid approaches, as in HWMP, blend both strategies to balance latency and overhead. Because links can appear or disappear as nodes move or face interference, mesh routing protocols must handle dynamic topology changes quickly and without central coordination. The ACM paper on IEEE 802.11s framework and challenges provides an analysis of how these routing strategies perform under realistic network conditions.
Security and Deployment Considerations
Mesh networks introduce distinct security concerns. Because every node acts as a relay, a compromised node can intercept or manipulate traffic passing through it. IEEE 802.11s addresses this through Simultaneous Authentication of Equals (SAE), a key exchange mechanism that establishes fresh pairwise keys between mesh peers without relying on a central authentication server. Beyond security, deployment planning must account for channel interference among closely placed mesh nodes, gateway placement for backhaul connectivity, and quality-of-service provisioning across multi-hop paths, where each additional hop adds latency and potential throughput degradation. The Linux Wireless documentation for 802.11s illustrates implementation details of the open-source mesh stack.
Applications
Mesh networks have applications in a wide range of disciplines, including:
- Community broadband and municipal wireless infrastructure
- Industrial IoT sensor networks in factories and warehouses
- Disaster response and military tactical communications
- Smart grid metering and utility monitoring
- Building automation systems for lighting and HVAC control
- Vehicular ad hoc networks for vehicle-to-vehicle communication