Localized probabilistic and dominating set based algorithm for efficient information dissemination in ad hoc networks

摘要

Ad hoc networks are autonomous dynamic networks composed of mobile devices like personal digital assistants (PDA) for instance. In such mobile networks, lack of infrastructure leads to non trivial information discovery and dissemination. A scheme in which a unique object centralizes information is not efficient for many reasons. We propose a probabilistic algorithm to distribute an information token satisfactorily among nodes forming the network by using localized data. Then, in order to limit the number of memorizing nodes, we propose to make memorizing nodes belong to a dominating set.