相依均匀分布随机变量的上升游程：在无线网络中的应用
Ascending runs in dependent uniformly distributed random variables: Application to wireless networks
摘要：
本文分析了一般均匀分布但不独立的随机变量的最长递增连续序列或最大上升行程。它们的相关性的特点是两个连续的随机变量不能取相同的值。使用马尔可夫链的方法，我们研究的最大上升运行的分布，我们开发了一个算法来计算it.This问题来自分析的几个自组织协议设计的大规模无线传感器网络，我们展示了我们的结果如何适用于这一领域。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
