A simple network consist of two nodes X and Y. Each node has a single frame of F = 1500 bits (including all header and preambles) to send to each other. Both nodes attempt to transmit at ‘t = 0’. In case that a node executes the exponential Back-off algorithm. In the algorithm, a node experiencing the nth collision in a row for given frame, randomly chooses a value of k from {1, . . . 2m} where m is min (n, 10). The node then wait 8k μs before attempting to retransmit the frame. It is also given that the propagation speed of the signal over the network is 2 × 108 m/s and a data rate of 150 Mbps.
Assume that collision occur at time t = 0, and that the node X draws k = 1 and Y draws k = 2. The time taken by X’s packet (from t = 0) to be completely delivered to Y is ________ μs.
