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 apply to this domain.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Csaki E, Foldes A (1996) On the length of the longest monotone block. Stud Sci Math Hung 31:35–46
Dijkstra EW (1974) Self-stabilizing systems in spite of distributed control. Commun ACM 17(11): 643–644
Dolev S (2000) Self stabilization. MIT Press
Eryilmaz S (2006) A note on runs of geometrically distributed random variables. Discrete Math 306: 1765–1770
Foata D, Fuchs A (1996) Calcul des probabilités. Masson
Frolov AN, Martikainen AI (1999) On the length of the longest increasing run in Rd. Stat Probab Lett 41(2):153–161
Fu JC, Chang YM (2002) On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials. J Appl Probab 39:70–80
Fu JC, Lou WYW (2003) Distribution theory of runs and patterns and its applications: a finite Markov chain imbedding approach world scientific. Singapore
Herman T, Tixeuil S (2004) A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Proceedings of the first workshop on algorithmic aspects of wireless sensor networks (AlgoSensors’2004), no. 3121 in lecture notes in computer science. Springer-Verlag, Turku, Finland, pp 45–58
Louchard G (2002) Runs of geometrically distributed random variables: a probabilistic analysis. J Comput Appl Math 142(1):137–153
Louchard G (2005) Monotone runs of uniformly distributed integer random variables: a probabilistic analysis. Theor Comp Sci 346(2–3):358–387
Louchard G, Prodinger H (2003) Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Theor Comp Sci 304:59–86
Mitton N, Fleury E, Guérin-Lassous I, Tixeuil S (2005) Self-stabilization in self-organized multihop wireless networks. In: WWAN’05. Columbus, Ohio, USA
Mitton N, Fleury E, Guérin-Lassous I, Sericola B, Tixeuil S (2006) Fast convergence in self-stabilizing wireless networks. In: 12th international conference on parallel and distributed systems (ICPADS’06). Minneapolis, MN, USA
Tixeuil S (2007) Wireless ad hoc and sensor networks, chap. Fault-tolerant distributed algorithms for scalable systems. ISTE http://www.iste.co.uk/index.php?p=a&ACTION=View&id=166. ISBN: 978 1 905209 86
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mitton, N., Paroux, K., Sericola, B. et al. Ascending Runs in Dependent Uniformly Distributed Random Variables: Application to Wireless Networks. Methodol Comput Appl Probab 12, 51–62 (2010). https://doi.org/10.1007/s11009-008-9088-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-008-9088-0