A simple distributed gossip-style protocol that achieves near-optimal spreading rate for multimessage dissemination, with the assistance of mobility. The key observation is that random gossiping over static geometric graphs is inherently constrained by the expansion property of the underlying graph – capacity loss occurs since the copies are spatially constrained instead of being spread out. […]