Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Limited-Contention Protocols
Limited Contention Protocols are media access control (MAC) protocols that combine the advantages of collision-based protocols and collision-free protocols. They behave like slotted ALOHA under light loads and bitmap protocols under heavy loads, adapting dynamically to network conditions.
How It Works
In computer networks, when multiple stations try to transmit simultaneously via a shared channel, the transmitted data becomes garbled in an event called collision. Limited contention protocols address this by using an adaptive approach:
-
Under light loads − Behave like slotted ALOHA where all stations can compete freely for transmission slots
-
Under heavy loads − Behave like bitmap protocols where collisions are eliminated through organized channel access
Working Principle
Limited contention protocols divide the contending stations into groups, which may or may not be disjoint. The protocol operates as follows:
-
Group-based access − At slot 0, only stations in group 0 can compete for channel access. At slot 1, only stations in group 1 can compete, and so on.
-
Successful transmission − If a station successfully acquires the channel, it transmits its data frame.
-
Collision handling − If there is a collision or no stations compete for a given slot, stations from the next group can compete.
By dynamically adjusting the number of groups and stations per group according to network load, the protocol adapts its behavior. Under low loads, only one group contains all stations (slotted ALOHA behavior). As load increases, more groups are created with fewer stations each. Under very high loads, each group contains just one station (bitmap protocol behavior).
Key Features
| Load Condition | Group Configuration | Behavior | Performance |
|---|---|---|---|
| Light Load | 1 group, all stations | Slotted ALOHA | High throughput, few collisions |
| Medium Load | Multiple groups | Adaptive contention | Balanced performance |
| Heavy Load | 1 station per group | Bitmap protocol | No collisions, higher overhead |
Examples
The Adaptive Tree Walk Protocol is a well-known example of limited contention protocols. It uses a binary tree structure to organize stations and dynamically adjusts the tree traversal based on collision feedback.
Conclusion
Limited contention protocols provide adaptive media access control by combining the efficiency of slotted ALOHA under light loads with the collision-free operation of bitmap protocols under heavy loads. Their performance depends heavily on the algorithm used to dynamically adjust group configurations based on network conditions.
8K+ Views
