Multi message dissemination over static and Mobile networks

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. the near-optimal spreading time O (polylog(n)) for single message dissemination can only be achieved when there is near-full mobility a lower bound on the multi-message spreading time under RANDOM PUSH protocol over static networks. a one-sided uncoded message-selection strategy called MOBILE PUSH that accelerates multimessage spreading with mobility In wireless ad hoc or social networks, a variety of scenarios require agents to share their individual information or resources with each other for mutual benefits. A partial list includes file sharing and rumor spreading , distributed computation and parameter estimation ,and scheduling and control. Due to the huge centralization overhead and unpredictable dynamics in large networks, it is usually more practical to disseminate information and exchange messages in a decentralized and asynchronous manner to combat unpredictable topology changes and the lack of global state information. This motivates the exploration of dissemination strategies that are inherently simple, distributed and asynchronous while achieving optimal spreading rates.