Delay analysis and optimality of the renewal access protocol

Abstract

For many years, the IEEE 802.11 distributed coordination function (DCF) has been widely used as a dominant medium access control (MAC) protocol in wireless networks and a large number of works have been done for analyzing and improving its performance. In our earlier work, as a substitute of the IEEE 802.11 DCF, a simple MAC protocol, called the renewal access protocol (RAP), is proposed. The RAP adopts all of the legacy 802.11 standard but the backoff stage feature. Each terminal selects its backoff counter value from a fixed sized window according to a priori given selection distribution in the RAP, regardless of the packet transmission result. It is shown that, if a Poisson distribution is used as the selection distribution, then the resulting RAP achieves high short-term fairness as well as optimal throughput. In this work, we analyze the relation between delay performance and the selection distribution of the RAP. With the help of effective bandwidth theory, we derive the conditions for the selection distribution of the RAP that optimizes the queue overflow probability. We also construct the delay optimal selection distribution satisfying the optimal conditions for throughput and delay. However, we show that the use of the delay optimal selection distribution results in an extremely slow convergence to steady state compared with that of the Poisson selection distribution. Moreover, we show that the Poisson selection distribution provides near-optimal delay performance. Therefore, we conclude that the use of a Poisson selection distribution is still recommended even from the delay perspective.

A Stochastic Framework for Energy Saving in Cognitive Radio Networks using N-Policy Multiple Sleep Mode

“…The latency of an SU packet represents the time it takes from when the SU packet enters the system until it successfully leaves the system. By using Little's Law 31,32 , the average latency of SU packets (𝛽) is provided as follows:…”

Performance Improvement of Random Access by Prioritizing Collisions

“…To analyze queuing delay, we tag a station and consider the worst case for this tagged station where all other stations are saturated. In [44], leveraging effective bandwidth theory, it is shown that the queue overflow probability in steady state…”