We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP's design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP's behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP's packet drop rate is up to 90% lower while sending up to 90% fewer packets.
|Original language||English (US)|
|Title of host publication||Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '10|
|Publisher||Association for Computing Machinery (ACM)|
|Number of pages||10|
|State||Published - 2010|