Scribd
Upload
8 views45 pages

2024 Multiple Access

Ma

Uploaded by

royal.manhas.077
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views45 pages

2024 Multiple Access

Ma

Uploaded by

royal.manhas.077
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 45

Chapter 12

Multiple Access

12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Figure 12.1 Data link layer divided into two functionality-oriented sublayers

12.2
Figure 12.2 Taxonomy of multiple-access protocols discussed in this chapter

12.3
12-1 RANDOM ACCESS

In random access or contention methods, no station is


superior to another station and none is assigned the
control over another. No station permits, or does not
permit, another station to send. At each instance, a
station that has data to send uses a procedure defined
by the protocol to make a decision on whether or not to
send.
Topics discussed in this section:
ALOHA
Carrier Sense Multiple Access
Carrier Sense Multiple Access with Collision Detection
Carrier Sense Multiple Access with Collision Avoidance
12.4
Figure 12.3 Frames in a pure ALOHA network

12.5
Figure 12.4 Procedure for pure ALOHA protocol

TB=R X Tp or R X Tfr
R: 0 to 2^k -1

12.6
12.9
12.10
12.11
e refers to the base of the natural logarithm,
approximately 2.718
Figure 12.6 Frames in a slotted ALOHA network

12.14
Figure 12.7 Vulnerable time for slotted ALOHA protocol

12.15
Figure 12.9 Vulnerable time in CSMA

12.18
Figure 12.10 Behavior of three persistence methods

12.19
Figure 12.11 Flow diagram for three persistence methods

12.20
Figure 12.12 Collision of the first bit in CSMA/CD

12.21
Figure 12.13 Collision and abortion in CSMA/CD

12.22
12.23
12.24
12.25
Figure 12.14 Flow diagram for the CSMA/CD

12.26
12.27
12.28
Example 12.5

A network using CSMA/CD has a bandwidth of 10 Mbps.


If the maximum propagation time (including the delays in
the devices and ignoring the time needed to send a
jamming signal, as we see later) is 25.6 μs, what is the
minimum size of the frame?
Solution
The frame transmission time is Tfr = 2 × Tp = 51.2 μs.
This means, in the worst case, a station needs to transmit
for a period of 51.2 μs to detect the collision. The
minimum size of the frame is 10 Mbps × 51.2 μs = 512
bits or 64 bytes. This is actually the minimum size of the
frame for Standard Ethernet.
12.29
12.30
12.31
12.32
12.33
Figure 12.15 Energy level during transmission, idleness, or collision

On a wired network, energy level is almost double during a collision.


This is how a receiver tells if there is a collision.
But on a wireless network, energy level is not that high (barely 5-10%
higher). So with wireless, we need to avoid collisions.

12.34
12.35
12.36
12.37
DIFS: Distributed coordinated function interframe space
SIFS: Short interframe space
RTS: Request to send
CTS: Clear to send
NAV: Network allocation vector(timer)
Collision during handshake
12.39
12.40
12.41
12.42
12.43
12.44
12.45

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy