1(a) When node A transmits to node B, list the potential hidden terminals (in either
direction, i.e., those who might collide with A’s transmission or those who A’s
transmission might collide with) and exposed terminals.
Ans:
Hidden terminals –
D because if D tries to transmit to C, there will be inference at C.
C because if C is transmitting before A attempts to transmit, there will be collision at B.
Grading: 1 point for each correct hidden terminal
Exposed terminals –
None
Grading: 1 point
1(b) When node B transmits to node C, list the potential hidden terminals (in either
direction, i.e., those who might collide with B’s transmission or those who B’s
transmission might collide with) and exposed terminals.
Ans:
Hidden terminals –
D because if D tries to transmit to C, there will be inference at C.
Grading: 1 point for correct hidden terminal and 1 point for reason.
Exposed terminals –
None
Grading: 1 point
1(c)Suppose A is sending data to B and C is sending data to D, both at a constant bit
rate equal to the physical capacity of the wireless channel (“as fast as they can").
Assume that no mechanism is used to detect or avoid collisions. What is the
throughput of each transfer as a fraction of the capacity of the corresponding
channel?
Ans:
Throughput from A to B – 0% (collision from C)
Throughput from C to D – 100%
Grading: 1 point for correct throughput and 1 point for reason
1(d) Now node C uses CSMA/CA while A continues to use no mechanism to detect or
avoid collisions. Again, express the throughput of each transfer as a fraction of the
capacity of the corresponding channel.
Ans:
Throughput from A to B – 100%
Throughput from C to D – 0% (C will not transmit as long as A is transmitting)
Grading: 1 point for correct throughput and 1 point for reason
Ques3
1. What is be the minimum length of a packet needed to successfully implement
CSMA/CD on this network?
Ans. 6LR/C
● 2 Marks for correct answer.
2. What is the minimum length of a packet needed to successfully implement
CSMA/CD if a fifth node is added at the midpoint of the link between nodes A and B.
Ans. 6LR/C
● 2 Marks if mentioned max distance
between two nodes across the network remains unchanged or mentioned max distance
across network equal to 3L.
● 2 Marks for correct answer.
3. What is be the minimum length of a packet needed to successfully implement
CSMA/CD if a sixth node is added L units to the right of node D.
Ans. 8LR/C
● 2 Marks if mentioned max distance between two nodes across the network equal to 4L.
● 2 Marks for correct answer.
* If there is any other kind of marks deduction then reason is mentioned in feedback for 3rd
question please check. *
The utilization of the network is calculated by determining the expected
number of successful packet transmissions per time-slot and dividing it by the
maximum possible number of successful transmissions (which is 2).
For a successful transmission from node i to node j:
1. Node i must transmit (probability p) and choose j (probability 31 ).
2. Node j must not transmit (probability 1 − p).
3. No other node must transmit to j (probability (1 − p3 )2 ).
The expected number of successful transmissions for each directed link is:
p p 2
· (1 − p) · 1 − .
3 3
Summing over all 12 directed links gives the total expectation:
p p 2 p 2
12 · · (1 − p) · 1 − = 4p(1 − p) 1 − .
3 3 3
Dividing by the maximum possible (2) yields the utilization:
p 2
4p(1 − p) 1 − 3
p 2
= 2p(1 − p) 1 − .
2 3
Thus, the utilization of the network is:
p 2
2p(1 − p) 1 −
3
Marking Scheme
• 1 mark for attempting.
• 4 or 7 marks for partially correct answers.
• 10 marks for a correct answer.