Contention-based collision-resolution medium access control algorithms

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.

Preface

Introduction

Basic Backoff Algoritms

X-Increase Y-Decrease (XIYD)

Adaptive Optimum Contention Window Selection

Other Proposals

Splitting Algorithms: Introduction

Gated Access Algorithms

The Dynamic Tree Algorithm (DTA)

Window Access Algorithms (WA)

Limited Sensing Algorithms

Splitting Algorithms for Non-Standard Environments

Summary of Splitting Algorithms

Other Collision Resolution Algorithms

Resource Auction Multiple Access (RAMA)

CSMA/CD with Deterministic Collision Resolution (CSMA/DCR)

Examples of MAC Protocols and their Collision Resolution Algorithms

802.11 MAC and the Binary Exponential Backoff

MACAW and the Multiplicative Increase-Linear Decrease

802.11 MAC and the Fast Collision Resolution

ISMA and the P-Persistent CRA

DSA' and the Ternary Splitting Algorithm

DQSA and A Tree-Based CRA

Index

Available:*

On Order

Summary

Summary

Table of Contents