Question: Problem 2: Two stations A and B located within the same collision domain are backlogged and always have a packet to send. They use

Problem 2: Two stations A and B located within the same collision domain are backlogged and always have a

Problem 2: Two stations A and B located within the same collision domain are backlogged and always have a packet to send. They use the the DCF function of 802.11 to mediate access to the wireless medium. 1. Plot the probability of a collision on the next transmission round as a function of the contention window CWo. Let the contention window vary from 4 to 2048. 2. Assume that after several successive collisions and the contention window at A and B has become equal to 16. Let A win the next round by selecting a backoff equal to zero. What is the probability that B will win the contention in the subsequent round, given that CWo = 4? 3. Assume that after several successive collisions, the contention window at A and B has become equal to 64. Let A win the next round by selecting a backoff equal to zero whereas B selects a backoff of 23. What is the least number of successive transmissions that A is guaranteed before B has a chance to capture the channel, given that CWo = 4?

Step by Step Solution

3.50 Rating (147 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve these problems well use the Binary Exponential Backoff algorithm used in the IEEE 80211 Dis... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!