BPC - A binary priority countdown protocol

  • Authors:

  • Ivan Kedo;Julije Oegović;Ante Kristić

  • Affiliations:

  • University Department of Professional Studies, University of Split, 21000 Split, Croatia;Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia;Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 uses a new priority countdown mechanism which exploits the efficiency of binary countdown, but the priority countdown process is not constrained to a single binary countdown round. This way, the priority space is not defined by the length of binary countdown round, like in other binary countdown protocols proposed in the literature, and arbitrary medium access priorities can be decremented through multiple binary countdown rounds if necessary. The ability of a new priority countdown mechanism to count down any priority number without changing the length of a binary countdown round, allows independent management of priority space. This ''independence'' of priority space introduces new optimization and adaptation possibilities. Collision memory effect is recognized and described. BPC protocol reveals connection between unary, binary and digit contention protocols. All three groups of protocols can now be seen as members of the same class of contention algorithms. Preliminary simulation results are shown.