摘要
本文首先提出一种称为具有随机到达时间的扩频多址协议，然后用马氏链分析方法分析了该协议的信道利用率及话音分组丢失率．给出了一个计算分组丢失率的公式，如果把每一时隙地址码的数目定为1，这个公式也可同样用于PRMA分组丢失率的计算．这是文献[4]中没有解决的问题．我们利用了延时捕获现象来改进该协议的性能．在理论分析及模拟中，我们也考虑了分组传输错误对协议性能的影响．理论分析及模拟结果均表明延时捕获现象改善了协议性能．
A spread spectrum PRMA(SSPRMA)with randomized arrival time is proposed in this paper.We analyze its channel utilization and the probability of voice packet being dropped(Pdrop) by Markov chain analysis. We derive a formula that can be used in the calculation of the Pdrop of SSPRMA. It can also be used in the calculation of the Pdrop of PRMA if the number of address codes of each slot is 1. This problem is not solved in Reference[4]. We exploit the delay cape phenomenon to improve the performance of this protocol. Packet transmission errors are taken into account in the simulation and the Markov chain analysis. Numerical results prove that delay capture phnomenon improves the performace of SSPRMA.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1998年第1期53-58,共6页
Acta Electronica Sinica
