The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This two-part paper series is devoted to a comprehensive study of IEEE 802.11 DCF protocol. Part I focuses on the derivation of throughput characteristic equation. Part II presents the stability analysis of 802.11 DCF protocol. In Part I, a Markov model of the protocol with K-Exponential Back off scheduling algorithms is proposed. The input buffer of each access node is modeled as a Geo/G/1 queue,...
Quality of service (QoS) scheduling algorithm for wireless network with lagging bound to guarantee performance is analyzed in this paper. The channel is modeled as a two-state Continuous Time Markov process. We obtain the closed-form expressions of state probabilities and queueing delay, and an approximate formula of lagging bound in terms of blocking probability. The analytical results are all verified...
We propose a queueing model of the 802.11 distributed coordination function in a non-saturated traffic environment, and obtain the characteristic equation of the network throughput in the Part I of this paper series. In the part II, we explore the stable throughput region and the bounded delay region of the retransmission factor based on this model. We find that both regions are highly dependent on...
This paper studies the performance of Non-persistent CSMA/CA protocols with Exponential Backoff scheduling algorithms. A multi-queue single-server system is proposed to model multiple access networks. The input buffer of each access node is modeled as a Geo/G/1 queue, and the service time distribution of head-of-line packets is derived from the Markov chain of underlying scheduling algorithm. The...
This paper studies the performance of Non-persistent CSMA protocols using K-Exponential Backoff collision resolution algorithms. We model it as a multi-queue single-server system with infinite buffer size and consider the service time distribution of Head-of-line packets as a Markov Chain to get the network throughput as well as the stability. The stable region of retransmission factor q is illustrated...
Symbolic computation has experienced a distinct evolutionary path than numerical computation and this has prevented its proliferation in engineering. This paper offers a contemporary look at how the historical elements in symbolic computation has lead to a renewed interest symbolic in engineering modeling and simulation today. In particular symbolic techniques are showing promise for the modernization...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.