A Cooperative Sequential Adsorption Model for Wireless Gossiping

摘要

Wireless sensor networks require communication protocols for efficiently maintaining data in a distributed fashion. The Trickle algorithm is a popular protocol serving as the basis for many of the current standard communication protocols. In this paper we develop a mathematical model describing how Trickle maintains data, establish a relationship with a class of spatial stochastic models known as Cooperative Sequential Adsorption (CSA). We derive asymptotic results for the coverage ratio for a specific class of CSA models and investigate the scalability of the Trickle algorithm.