Abstract
Based on the protocol of IEEE 802.11 for ad hoc networks, the distributed coordination function (DCF) of ad hoc networks was modified, and an adaptive minimum contention window binary exponential backoff algorithm (AWBEB algorithm) was presented. We use a 2D Markov chain model to educe the stationary distribution probabilities and the probability that a given node will transmit in an arbitrary time slot of AWBEB algorithm. The throughput, the stationary throughput and the system delay of AWBEB algorithm were analyzed theoretically, and then the performance of AWBEB algorithm were simulated and calculated. The results show that AWBEB is simpler, and it can more throughput and less delay. Moreover, the results of simulation are agreed with those of mathematical analysis.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
