(Created page with " == Abstract == We give an estimate of an upper bound of information propagation speed as a function of a targeted transport capacity density. The propagation speed depends o...") |
m (Scipediacontent moved page Draft Content 330163562 to Jacquet 2011a) |
(No difference)
| |
Latest revision as of 15:46, 22 October 2020
Abstract
We give an estimate of an upper bound of information propagation speed as a function of a targeted transport capacity density. The propagation speed depends on the density of simultaneous emitters and the node mobility model. We assume that nodes move according to an independent random walk. This work makes the junction between the work of Gupta and Kumar~(2000) and Grossglauser and Tse~(2002). We show that the information speed tends to zero when the transport capacity tends to infinity. We compare our result to the performance of an actual protocol based on angle determination.; Nous donnons une borne supérieure de la vitesse de propagation en fonction d'une capacité de transport ciblée. La vitesse de propagation dépend de la densité des émetteurs et de la mobilité des postes. Nous supposons fait la jonction entre les travaux de Gupta et Kumar (2000) et ceux de Grossglauser et Tse (2002). Nous montrons que la vitesse de propagation tend vers zero quand la capacité de transport tend vers l'infini. Nous comparons avec les performances d'un algorithme réaliste basé sur des angles.
Document type: Report
Full document
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2011
Volume 2011, 2011
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?