Improved Dynamic p-Persistent CSMA Protocol
Wei He, Jingchang Nan, Feng Pan · Jisuanji gongcheng · 2010
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.