Ascending runs in dependent uniformly distributed random variables: Application to wireless networks - Archive ouverte HAL Access content directly
Journal Articles Methodology and Computing in Applied Probability Year : 2010

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

Abstract

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 applies to this domain.
Fichier principal
Vignette du fichier
pub_inria.pdf (231.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00384027 , version 1 (14-05-2009)

Identifiers

Cite

Nathalie Mitton, Katy Paroux, Bruno Sericola, Sébastien Tixeuil. Ascending runs in dependent uniformly distributed random variables: Application to wireless networks. Methodology and Computing in Applied Probability, 2010, 12 (1), pp.51-62. ⟨10.1007/s11009-008-9088-0⟩. ⟨hal-00384027⟩
462 View
98 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More