A performance analysis of binary exponential backoff algorithm in the random access packet networks

Abstract

We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol. When a node's message which tries to reserve a channel is involved in a collision for the n th time, it chooses one of the next 2(n) frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study shows that the system is stable if the number of request slots is more than 3 times of the arrival rate.