Collision-Free Protocols

In computer networks, when more than one station tries to transmit simultaneously via a shared channel, the transmitted data is garbled. This event is called collision. The Medium Access Control (MAC) layer of the OSI model is responsible for handling collision of frames.

Collision-free protocols are devised so that collisions do not occur. Protocols like CSMA/CD and CSMA/CA nullify the possibility of collisions once the transmission channel is acquired by any station. However, collision can still occur during the contention period if more than one station starts to transmit at the same time. Collision-free protocols resolve collision in the contention period, eliminating the possibility of collisions entirely.

Types of Collision-Free Protocols

Bit-Map Protocol

In bit-map protocol, the contention period is divided into N slots, where N is the total number of stations sharing the channel. If a station has a frame to send, it sets the corresponding bit in its assigned slot. Before transmission, each station knows whether other stations want to transmit. Collisions are avoided by mutual agreement among the contending stations on who gets the channel.

This protocol uses a reservation mechanism where stations announce their intention to transmit during a dedicated reservation phase before actual data transmission begins.

Binary Countdown

This protocol overcomes the overhead of 1 bit per station in the bit-map protocol. Here, binary addresses of equal lengths are assigned to each station. For example, if there are 6 stations, they may be assigned the binary addresses 001, 010, 011, 100, 101, and 110.

All stations wanting to communicate broadcast their addresses simultaneously. The station with the higher binary address gets higher priority for transmitting. During the arbitration process, stations with lower addresses detect higher-priority transmissions and withdraw from contention.

Limited Contention Protocols

These protocols combine the advantages of collision-based protocols and collision-free protocols. Under light load, they behave like ALOHA scheme, allowing immediate transmission attempts. Under heavy load, they behave like bitmap protocols, using structured access methods to avoid collisions.

This adaptive approach optimizes channel utilization across varying network traffic conditions by dynamically switching between contention-based and reservation-based access methods.

Adaptive Tree Walk Protocol

In adaptive tree walk protocol, the stations or nodes are arranged in the form of a binary tree structure for systematic collision resolution.

Initially, all nodes (A, B, C, D, E, F, G, H) are permitted to compete for the channel. If a node successfully acquires the channel, it transmits its frame. In case of collision, the nodes are divided into two groups - left subtree (A, B, C, D) and right subtree (E, F, G, H). Only nodes from one group are permitted to compete next. This binary splitting process continues recursively until successful transmission occurs.

Comparison of Collision-Free Protocols

Conclusion

Collision-free protocols eliminate data collisions through structured access methods like reservation, priority-based arbitration, and systematic contention resolution. These protocols ensure reliable channel access by coordinating transmission attempts among competing stations, making them essential for high-performance network environments.