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 CO-ABPC protocol is based on the BPC protocol but it uses a new adaptation mechanism. This mechanism observes the length of the contention resolution period in order to determine the common optimal priority space, similar to Idle Sense protocol. Also, in order to control the collision memory and countdown effects, the protocol is enhanced with collision memory avoidance algorithm CPCF proposed earlier. Both of these enhancements have been verified through simulations, confirming higher throughput results in various network scenarios.
['Ivan Kedzo', 'Julije Ozegovic', 'Ante Kristic']
Contention Overhead — Adaptive Binary Priority Countdown protocol