A study of contention resolution algorithms with different types of feedback

This paper presents a frame based contention resolution algorithm that can be systematically applied for random access protocols under different assumption of feedback types which include binary, ternary and known multiplicity feedbacks. We introduce two new algorithms that can effectively utilize feedback information to resolve packet collisions. Based on extensive simulation results, the achievable delay performance is shown to be highly dependent upon the amount of feedback information available to each user and how the feedback information is used in contention resolution. Multiplicity feedback in particular where the information about number of accessing packets is available, significant improvement in average delay can be achieved compared to binary and ternary feedbacks.