08.02.2015 Views

Solutions to Chapter 6 - Communication Networks

Solutions to Chapter 6 - Communication Networks

Solutions to Chapter 6 - Communication Networks

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>Communication</strong> <strong>Networks</strong> (2 nd Edition)<br />

<strong>Chapter</strong> 6 <strong>Solutions</strong><br />

10. A channel using random access pro<strong>to</strong>cols has three stations on a bus with end-<strong>to</strong>-end propagation delay τ.<br />

Station A is located at one end of the bus, and stations B and C are <strong>to</strong>gether located at the other end of the bus.<br />

Frames arrive at the three stations and are ready <strong>to</strong> be transmitted at stations A, B, and C at the respective times t A =<br />

0, t B = τ/2, and t C = 3τ/2. Frames require transmission times of 4τ. In appropriate figures, with time as the horizontal<br />

axis, show the transmission activity of each of the three stations for<br />

Frame arrival times:<br />

A: t A = 0<br />

B: t B = τ/2<br />

C: t C = 3τ/2 = 1 1/2 τ<br />

t p = τ and X = 4τ<br />

a. ALOHA<br />

A<br />

collision<br />

B<br />

0 1τ 2τ 3τ 4τ 5τ 6τ 7τ 8τ<br />

collision<br />

No ACK; A times<br />

out, reschedules<br />

No ACK; B times<br />

out, reschedules<br />

0 1τ 2τ 3τ 4τ 5τ 6τ 7τ 8τ<br />

C<br />

collision<br />

No ACK; C<br />

times out,<br />

0 1τ 2τ 3τ 4τ 5τ 6τ 7τ 8τ reschedules<br />

b. Non-persistent CSMA<br />

A<br />

collision<br />

B<br />

0 1τ 2τ 3τ 4τ 5τ 6τ 7τ 8τ<br />

collision<br />

No ACK; A times<br />

out, reschedules<br />

No ACK; B times<br />

out, reschedules<br />

0 1τ 2τ 3τ 4τ 5τ 6τ 7τ 8τ<br />

C<br />

0 1τ 2τ 3τ 4τ 5τ 6τ 7τ 8τ<br />

Station C senses channel busy and backs off<br />

Leon-Garcia/Widjaja 4

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!