Question

Problem 3: Consider the wireless topology below. The solid circles represent the transmission radius of nodes A and D, respectively, and the dashed circles represent the transmission range of B and C, respectively. In these problems, assume that losses only occur due to collisions. list the potential hidden terminals and exposed terminals when i) A is transmittng to B (ii) B is transmitting to A (iii) A is transmitting to C (iv) D is transmitting to HB Problem 4: Consider a fully connected three-node topology shown on the right slide. Let the link costs be c(x.y) - 3, c(y,z) 6, c(z,x)- 1. Compute the distance tables after the initialization step and after each iteration of distance-vector algorithm as done for the example in the lecture slides.

Answer 1

3)

1.  C and B fall within the transmission radius of A hence they are exposed while only D is hidden from A.
2.  When B is transmitting, only A and C fall within its transmission radius, hence they are exposed while only D is hidden from B.
3.  In this case as A is transmitting, hence none of the B and C can transmit and hence they are exposed while D is hidden from A's transmission range.
4.  C and B fall within the transmission radius of D hence they are exposed while only A is hidden from D.

as per guidelines we are only allowed to answer first question Please make new post for second question Thanks