This book is an overview of the most relevant collision resolution
algorithms used in contention-based multiple access protocols to
handle collisions among users contending for channel access. The
two main categories of collision resolution algorithms are the so
called back-off and the splitting algorithms. The described
back-off algorithms are further classified into p-persistent,
binary exponential, X-Increase Y-Decrease and dynamic optimum
back-off window algorithms. On the other hand, the splitting
algorithms are basically characterised as gated-access,
window-access and free-access. The dynamic tree algorithm and some
limited sensing algorithms are also discussed. Other proposals that
cannot be classified in the previous categories are also presented.
Finally, examples of MAC protocols for wireless communications that
make use of some of the aforementioned collision resolution
algorithms are included.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!