Flashcast

In this paper, message dissemination with node mobility is studied where each node in the network having mobility wants to send its message to all the other nodes. The channel capacity between two nodes is assumed to be large enough for exchanging all the messages they have when they get close enough. We show that what type of network graph enables each node to accumulate all messages in the network, and investigate the dissemination time T for all nodes to get all messages. For a general directed graph model, the upper and lower bounds on T are given as Θ(n²) and Θ(1), respectively. For some special cases, we present tighter bounds. For general undirected graph, T is upper bounded by Θ(n). For grid graph, T is an order of Θ(√n).