Scribd
Upload
54 views

Multiple Access Protocols-F

Middle Technical University's Department of Computer Engineering Techniques presented a protocol on random access protocols. The document discusses four types of random access protocols: ALOHA, slotted ALOHA, Carrier Sense Multiple Access (CSMA), and Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). It provides examples and explanations of how these protocols operate including calculating efficiency and throughput.

Uploaded by

Zainab Monadhil
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
54 views

Multiple Access Protocols-F

Middle Technical University's Department of Computer Engineering Techniques presented a protocol on random access protocols. The document discusses four types of random access protocols: ALOHA, slotted ALOHA, Carrier Sense Multiple Access (CSMA), and Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). It provides examples and explanations of how these protocols operate including calculating efficiency and throughput.

Uploaded by

Zainab Monadhil
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

Middle Technical University

Electrical Engineering Technical College


Department of Computer Engineering Techniques

Presented by:
Yasir M.abdal
In this protocol, all the station has equal priority to send the data
over a channel.

Types of random access protocols:

1. ALOHA
• Pure aloha
• Sloted aloha
2. Carrier Sense Multiple Access (CSMA)
3. Carrier Sense Multiple Access with Collision Detection (CSMA/CD)
4. Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)
Example : A group of N stations share a 56 kbps pure (unslotted) aloha
channel. Each station has one (NEW) packet arriving every 100 seconds and
packets are 1000 bits long. What is the maximum value of N that the channel
can accommodate?

Answer:

• With pure ALOHA, the usable bandwidth = 0.184× 56 kbps = 10.3 kbps.

• Each station requires 10 bps, so N = 10300/10 = 1030 stations.


Assumptions: Operation:
 all frames same size  when node obtains fresh
 time divided into equal size frame, transmits in next slot
slots (time to transmit 1  if no collision: node can send
frame) new frame in next slot
 Nodes start to transmit only  if collision: node retransmits
slot beginning frame in each subsequent
 Nodes are synchronized slot with prob. p until
success
 If 2 or more nodes transmit in
slot, all nodes detect collision
efficiency: long-run fraction of  Max efficiency: find p* that
successful slots (many nodes, maximizes
all with many frames to send) Np(1-p)N-1
 for many nodes, take limit of
 Suppose: N nodes with many Np*(1-p*)N-1 as N goes to
frames to send, each transmits infinity, gives:
in slot with probability p max efficiency = 1/e = .37
 Prob that given node has
success in a slot = p(1-p)N-1 at best: channel used for
useful transmissions 37%
 Prob that any node has a
of time!
success = Np(1-p)N-1
The throughput for slotted ALOHA is
S = G × e−G .
The maximum throughput
Smax = 0.368 when G = 1.
Example : measurement of Slotted ALOHA channel with an infinite
number of users show that 10% of slots are idle.Find
1) What is channel load?
2) What is throughput?
3) Is channel under load or overload?
Answer:
1. P(succ) = 𝑒 −𝐺 = 0.1
𝑒 −𝐺 = 0.1
-G = ln 0.1
G = 2.303
2. S = G. 𝑒 −𝐺
S= 0.2303
3. We have G = 2.303 ,
S = 0.2303 < Smax,
G > 1 therefore the channel is overloaded
It is a carrier sense multiple access based on media access
protocol to sense the traffic on a channel (idle or busy) before
transmitting the data. It means that if the channel is idle, the station
can send data to the channel. Otherwise, it must wait until the
channel becomes idle. Hence, it reduces the chances of a collision
on a transmission medium.
 Tprop = max prop delay between 2 nodes in LAN
 ttrans = time to transmit max-size frame

 efficiency goes to 1
 as tprop goes to 0
 as ttrans goes to infinity
 better performance than ALOHA: and simple, cheap,
decentralized!
Example: In CSMA/CD, after the fifth collision, what is the probability
that a node chooses K = 4? The result K = 4 corresponds to a delay
of how many seconds on a 10 Mbps Ethernet?

Answer:
After the 5th collision, the adapter chooses from {0, 1, 2,…, 31}.
The probability that it chooses 4 is 1/32. It waits 204.8 microseconds.
Example : Recall that with the CSMA/CD protocol, the adapter
waits K.512 bit times after a collision, where K is drawn randomly.
For K = 100, how long does the adapter wait until returning to Step
2 for a 10 Mbps broadcast channel? For a 100 Mbps broadcast
channel?

Answer:
Example : 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?

Answer:

The minimum frame transmission time is Tfr = 2 × Tp = 51.2 μs.


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.
idea: allow sender to “reserve” channel rather than random
access of data frames: avoid collisions of long data frames
 sender first transmits small request-to-send (RTS) packets
to BS using CSMA
 RTSs may still collide with each other (but they’re
short)
 BS broadcasts clear-to-send CTS in response to RTS
 CTS heard by all nodes
 sender transmits data frame
 other stations defer transmissions
defer
In controlled access, the stations consult one another to find
which station has the right to send. A station cannot send
unless it has been authorized by other stations. We discuss
three popular controlled-access methods.

Controlled Access merhods:

 Polling
 Token Passing
• One device is assigned as primary station and the others as
secondary stations
• All data exchanges are done through the primary
• Primary station controls the link and initiates the session; the
secondary station follow its instructions.

• Two functions: polls and select


 Poll:If the primary wants to receive data, it asks the
secondary if they have anything to send.
 Select:if the primary wants to send data, it tells the secondary
to get ready to receive data
• If a station needs to send data, it waits for the token.
• The station captures the token and sends one or more
frames (as long as it has frames to send or the allocated
time has not expired), and finally it releases the token
to be used by next station ( successor).
• The maximum time any station can hold the token is
limited.
• Since there is only one token, only one station
transmits at a time, and collisions never occur.

You might also like