Evaluation of an efficient collision resolving protocol for highly populated wireless networks

An efficient random medium access control protocol for highly populated wireless networks is proposed and evaluated using computer simulations. The algorithm is based on non-coordinated resolving of collisions during a contention period at the beginning of frame transmission. By the end of the contention period a single node has access to the link with very high probability. This approach presents an alternative to the widely used exponential backoff approach which renders the link idle for a substantial proportion of time. We investigate the impact of varying packets length and non-optimal use of parameters on performance. The results demonstrate the robustness of the protocol and a much higher saturation throughput for highly populated wireless networks when compared with existing state-of-the-art. For tested scenarios, the saturation throughput varies slightly around 0.8 for hundreds if nodes sharing the same collision domain.