Amelioration of BEBA in distributed MAC protocol to curtail the waiting time of a station in ad hoc network

In this paper, we perform a detailed study of the Binary Exponential Back-off Algorithm (BEBA) that is widely used in distributed MAC protocols to avoid collision when more than one machine try to access the medium in ad hoc network at the same time. We begin with a generalized framework of modeling of BEBA. Then we identify a key difference between BEBA and the commonly assumed p-persistent model. Due to the characteristics of BEBA it checks the medium only after the timer becomes zero, but the proposed BEBA frequently checks the medium whether it is idle or not. Also it uses a contention window to make the slot succeeding a busy period has a uniform contention rate from other slots. This causes access to a slot to be uniform and independent on whether or not the slot immediately follows a busy period. We propose a detailed model to bate the waiting time of station which is in the contention window. From reducing the waiting time of a station it expedite the medium access, the power utilized by the system especially in the counter also reduced. It is demonstrated that the proposed model is an accurate characterization of BEBA algorithm in a broader range of system configuration.