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

Simple item page
dc.creatorMitton, Nathalie
dc.creatorParoux, Katy
dc.creatorSericola, Bruno
dc.creatorTixeuil, Sébastien
dc.date2008-02-11
dc.date2008-02-25
dc.date.accessioned2026-07-07T09:22:43Z
dc.date.available2026-07-07T09:22:43Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0802.1387
dc.identifierhttp://arxiv.org/abs/0802.1387
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155475
dc.subjectDiscrete Mathematics
dc.subjectNetworking and Internet Architecture
dc.subjectCombinatorics
dc.subjectProbability
dc.titleAscending runs in dependent uniformly distributed random variables: Application to wireless networks
dc.typetext

Files

Collections

arXiv