To appropriately divide the stations into groups, adaptive tree-walk algorithmis used, which
considers all the stations in the network as the leaves of a binary tree as shown in Figure 8.10. The pro-
cess starts at the root of the tree (node 1). Initially, in the firstslot (slot 0), all the stations under node 1
are allowed to compete for the channel. If there is a single station that is ready to transmit, it is allocated
the channel. However, if there is a collision, stations under the node 2 try to seize the channel in slot
1. If some station under node 2 acquires the channel, the next slot after ...
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.