Ch4_Multiaccess_Communication-2008-3-rev

Ch4_Multiaccess_Communication-2008-3-rev - Multiaccess...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Multiaccess Communication Sunghyun Choi Adopted from Prof. Saewoong Bahk’s material
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Splitting Algorithms With small attempt rates, most collisions should be between two nodes To resolve collision of two users with each trans. prob. of ½ Throughput becomes 2/3 Split the set of colliding nodes into subsets in order to reduce collision rate = - - = = 2 ) 1 ( 3 2 ] [ k k k N E
Background image of page 2
Tree algorithm (Splitting) Assume a collision at the slot. All nodes not involved in the collision go into a waiting mode. All nodes involved in the collision are split into two subsets. The first subset transmits in slot ( k+ 1) If a collision occurs again, repeat the above. If ( k +1) is idle or successful (0 or 1), the second subset transmits in slot ( k +2). th k
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Splitting can be done in various ways Coin flipping, node ID, arrival time Improvements to the tree algorithm, e.g., using the example in the next slide If a collision is followed by an idle slot, split
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/16/2008 for the course COMPUTER S 853 taught by Professor Choi during the Spring '08 term at Seoul National.

Page1 / 17

Ch4_Multiaccess_Communication-2008-3-rev - Multiaccess...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online