Suppose that C is a finite collection of patterns. Observe a Markov chain until one of the patterns in C occurs as a run. This time is denoted by τ. In this paper, we aim to give an easy way to calculate the mean wai...Suppose that C is a finite collection of patterns. Observe a Markov chain until one of the patterns in C occurs as a run. This time is denoted by τ. In this paper, we aim to give an easy way to calculate the mean waiting time E(τ) and the stopping probabilities P(τ = τA)with A ∈ C, where τA is the waiting time until the pattern A appears as a run.展开更多
Ultra-Wideband(UWB)技术被认为是最适合进行室内无线定位的技术,IEEE802.15.4a给出的TW-TOA(Two Way Time of Arrival)测距协议中采用的是基于时间戳报文的接收-发送周转时延消除的方法,但是同类设备在相同的环境下其周转时延是相同的...Ultra-Wideband(UWB)技术被认为是最适合进行室内无线定位的技术,IEEE802.15.4a给出的TW-TOA(Two Way Time of Arrival)测距协议中采用的是基于时间戳报文的接收-发送周转时延消除的方法,但是同类设备在相同的环境下其周转时延是相同的,所以为了减少测距双方的数据通信量,提出了一种基于固定周转时延的测距方法;为了提高Hello帧的可靠性提出了在初次定位以及在定位过程中当周转时延发生严重漂移的情况下发送基于停-等协议的Hello报文;同时给出了与IEEE802.15.4兼容的MAC子层协议的格式,并给出了Hello报文格式以及包含品质因子的测距应答帧格式。展开更多
Dynamic sliding window is a novel ARQ protocol for half-duplex short-wave channel.This algorithm ex-tracts the virtue of Stop-and Wait and Sliding Window protocols,uses acknowledgements and timeouts to implement relia...Dynamic sliding window is a novel ARQ protocol for half-duplex short-wave channel.This algorithm ex-tracts the virtue of Stop-and Wait and Sliding Window protocols,uses acknowledgements and timeouts to implement reliability,and changes sliding window size according to channel quality.The paper puts forward the idea and the model of this protocol,The paper also analyzes the performance of this protocol,compared to the case using Wait-and-Stop protocol.展开更多
We study waiting time problems for first-order Markov dependent trials via conditional probability generating functions. Our models involve α frequency cells and β run cells with prescribed quotas and an additional ...We study waiting time problems for first-order Markov dependent trials via conditional probability generating functions. Our models involve α frequency cells and β run cells with prescribed quotas and an additional γ slack cells without quotas. For any given and , in our Model I we determine the waiting time until at least frequency cells and at least run cells reach their quotas. For any given τ ≤ α + β, in our Model II we determine the waiting time until τ cells reach their quotas. Computer algorithms are developed to calculate the distributions, expectations and standard deviations of the waiting time random variables of the two models. Numerical results demonstrate the efficiency of the algorithms.展开更多
基金Supported by the National Natural Science Foundation of China(11771286,11371317)the Zhejiang Provincial Natural Science Foundation of China(LQ18A010007)
文摘Suppose that C is a finite collection of patterns. Observe a Markov chain until one of the patterns in C occurs as a run. This time is denoted by τ. In this paper, we aim to give an easy way to calculate the mean waiting time E(τ) and the stopping probabilities P(τ = τA)with A ∈ C, where τA is the waiting time until the pattern A appears as a run.
文摘Ultra-Wideband(UWB)技术被认为是最适合进行室内无线定位的技术,IEEE802.15.4a给出的TW-TOA(Two Way Time of Arrival)测距协议中采用的是基于时间戳报文的接收-发送周转时延消除的方法,但是同类设备在相同的环境下其周转时延是相同的,所以为了减少测距双方的数据通信量,提出了一种基于固定周转时延的测距方法;为了提高Hello帧的可靠性提出了在初次定位以及在定位过程中当周转时延发生严重漂移的情况下发送基于停-等协议的Hello报文;同时给出了与IEEE802.15.4兼容的MAC子层协议的格式,并给出了Hello报文格式以及包含品质因子的测距应答帧格式。
文摘Dynamic sliding window is a novel ARQ protocol for half-duplex short-wave channel.This algorithm ex-tracts the virtue of Stop-and Wait and Sliding Window protocols,uses acknowledgements and timeouts to implement reliability,and changes sliding window size according to channel quality.The paper puts forward the idea and the model of this protocol,The paper also analyzes the performance of this protocol,compared to the case using Wait-and-Stop protocol.
文摘We study waiting time problems for first-order Markov dependent trials via conditional probability generating functions. Our models involve α frequency cells and β run cells with prescribed quotas and an additional γ slack cells without quotas. For any given and , in our Model I we determine the waiting time until at least frequency cells and at least run cells reach their quotas. For any given τ ≤ α + β, in our Model II we determine the waiting time until τ cells reach their quotas. Computer algorithms are developed to calculate the distributions, expectations and standard deviations of the waiting time random variables of the two models. Numerical results demonstrate the efficiency of the algorithms.
