Ascending runs in dependent uniformly distributed random variables: Application to wireless networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2008

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks

Résumé

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is characterized by the fact that two successive random variables cannot take the same value. Using a Markov chain approach, we study the distribution of the maximal ascending run and we develop an algorithm to compute it. This problem comes from the analysis of several self-organizing protocols designed for large-scale wireless sensor networks, and we show how our results apply to this domain.
Fichier principal
Vignette du fichier
RR-6443.pdf (128.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00239348 , version 1 (05-02-2008)
inria-00239348 , version 2 (07-02-2008)
inria-00239348 , version 3 (11-02-2008)
inria-00239348 , version 4 (11-02-2008)
inria-00239348 , version 5 (25-02-2008)

Identifiants

  • HAL Id : inria-00239348 , version 2

Citer

Nathalie Mitton, Katy Paroux, Bruno Sericola, Sébastien Tixeuil. Ascending runs in dependent uniformly distributed random variables: Application to wireless networks. [Research Report] RR-6443, 2008, pp.12. ⟨inria-00239348v2⟩

Collections

INRIA-RRRT
796 Consultations
347 Téléchargements

Partager

Gmail Facebook X LinkedIn More