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.
In this paper a mathematical model of Constrained Priority Countdown Freezing (CPCF) protocol is introduced. In the new model presented, the existing model of simplified CPCF is expanded in order to include the binary exponential backoff (BEB) algorithm. Thus, the behavior of a single CPCF station is modeled using four-dimensional Markov chain. In addition, the probability of the contention loss after...
Recently, a binary contention protocol, called Binary Priority Countdown, BPC, was introduced. The BPC has the ability to manage the priority space without the need to change the length of the binary countdown round giving it optimization and adaptation capabilities. In this paper, a new protocol called Contention Overhead — Adaptive Binary Priority Countdown protocol, CO-ABPC, is introduced. The...
In this paper an accurate model of simplified Constrained Priority Countdown Freezing (CPCF) protocol is introduced. In the new model presented, we abandon the often used assumption that the probability of an idle timeslot is constant. By introducing a model that differentiates this probability based on the channel status, i.e. the transmission status of the previous timeslot, we avoid the inaccuracies...
In this paper a new mathematical model, describing the behavior of simplified Constrained Priority Countdown Freezing (CPCF) protocol, is introduced. The CPCF protocol sets constrains on DCF countdown mechanism and thus requires different mathematical model from those found in the literature. For this reason, the two-dimensional Markov chain analytical model is developed in order to accurately quantify...
In modern wireless ad hoc networks, with a high speed PHY, every collision means a significant loss of useful bandwidth. In the last few years different binary contention protocols have been introduced to address this problem. In this work we propose a novel binary contention protocol called binary priority countdown (BPC) protocol, whose goal is to reduce collisions as well as contention time. BPC...
In WTFC to TCP flow control proxy the induced loss algorithm is used to slow down TCP sender located in the TCP domain. When congestion arises in the WTFC domain, packets begin accumulating in the proxy buffer. In our previous work, the original algorithm is optimized for the case of equal delay on both domains. In the more likely case that WTFC and TCP domains have different delays, the algorithm...
In the previous work, binary contention protocol, called Binary Priority Countdown, BPC, was introduced. The BPC has the ability to manage the priority space without the need to change the length of the binary countdown round. In this work, we present a development of a new adaptive algorithm, called Collision Rate Adaptive Binary Priority Countdown, CR-ABPC, that can optimize the usage of priority...
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.