After waiting for IFS amount of time, the station again senses the channel. If it findsthe channel still
idle, it waits for a random amount of time partitioned into slots. This time is referred to as the contention
time and it is computed using the binary exponential back-off algorithm; a random number n is chosen
between 0 and 2
k
-1 and the station is made to wait for n time slots. After each time slot, the station
senses the channel. If the channel is busy, the timer is stopped and it is not restarted until the channel is
found idle.
After waiting for n time slots, the station sends the frame and starts waiting ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.