Scalable Routing in a City-Scale Wi-Fi Network for Disaster Recovery

In this paper, we present a new city-scale decentralized mesh network system suited for disaster recovery and emergencies. When wide-area connectivity is unavailable or significantly degraded, our system, MapMesh, enables static access points and mobile devices equipped with Wi-Fi in a city to route packets via each other for intra-city connectivity and to/from any nodes that might have Internet access, e.g., via satellite. The chief contribution of our work is a new routing protocol that scales to millions of nodes, a significant improvement over prior work on wireless mesh and mobile ad hoc networks. Our approach uses detailed information about buildings from widely available maps--data that was unavailable at scale over a decade ago, but is widely available now--to compute paths in a scalable way.

Authors

Publication Details

Journal
ArXiv.org
Published
2025-04-08
DOI
https://doi.org/10.4230/oasics.nines.2026.10
Primary Topic
Opportunistic and Delay-Tolerant Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Routing in a City-Scale Wi-Fi Network for Disaster Recovery

Chenning Li, James C. Lynch, Manya Ghobadi, Charlie Liu et al.
ArXiv.org
Opportunistic and Delay-Tolerant Networks
article

Scalable Routing in a City-Scale Wi-Fi Network for Disaster Recovery

Chenning Li, James C. Lynch, Manya Ghobadi, Charlie Liu, Om Chabra, Hari Balakrishnan
article en

Abstract

In this paper, we present a new city-scale decentralized mesh network system suited for disaster recovery and emergencies. When wide-area connectivity is unavailable or significantly degraded, our system, MapMesh, enables static access points and mobile devices equipped with Wi-Fi in a city to route packets via each other for intra-city connectivity and to/from any nodes that might have Internet access, e.g., via satellite. The chief contribution of our work is a new routing protocol that scales to millions of nodes, a significant improvement over prior work on wireless mesh and mobile ad hoc networks. Our approach uses detailed information about buildings from widely available maps--data that was unavailable at scale over a decade ago, but is widely available now--to compute paths in a scalable way.

ArXiv.org
Openalex Percentile: Top 55%
Opportunistic and Delay-Tolerant Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.