摘要： 通过研究p-坚持CSMA协议发送概率的动态调整算法，提出一种动态p-坚持CSMA协议。在该协议中，发生冲突重传时的发送概率并非固定不变，而是关于冲突重传次数的函数。通过建立二维马尔可夫链模型，进行理论推导并分析归一化系统饱和吞吐量的性能，结果表明，与p-坚持CSMA相比，动态协议的性能更优。

关键词: p-坚持CSMA, 发送概率, 吐量

Abstract: By studying dynamic adjustment algorithm of p-persistent CSMA protocol preliminary, this paper proposes an improved dynamic p-persistent CSMA protocol. In p-persistent CSMA protocol, the sending probability is fixed, while in dynamic protocol, the conflict probability of retransmission is a function of the conflict times of retransmission. The performance of normalized system saturation throughput is analyzed through building a two-dimensional Markov chain. Analysis results show that the protocol has better performance compared with p-persistent CSMA.

Key words: p-persistent CSMA, transmission probability, throughput

中图分类号: 

• TN91