MEDIA ACCESS CONTROL SUBLAYER

MEDIA ACCESS
CONTROL SUBLAYER
MEDIA ACCESS CONTROL
SUBLAYER
CHANNEL ALLOCATION
PROBLEMS
There are two schemes to allocate a single channel among competing
users:
1) Static Channel Allocation.
2) Dynamic Channel Allocation

ALOHA
Multiple Access Protocols:
ALOHA is a system proposed for solving the
channel allocation problem.
there are two versions of ALOHA:
1)Pure ALOHA 2) Slotted ALOHA
The basic difference with respect to timing is:

Pure ALOHA – Continuous time
Slotted ALOHA – Slotted time
PURE ALOHA
In pure ALOHA, frames are transmitted at completely arbitrary times.

Whenever two frames will try to occupy the channel at the same time, there will be a
collision, and both will be garbled.
ALOHA is using fixed length frames.
PURE ALOHA
FRAMES IN A PURE ALOHA
NETWORK
PURE ALOHA
Vulnerable period for the shaded frame.
If we are looking at the when a frame can suffer collisions, we can see that there is a
vulnerable period of 2 times the frame time.
VULNERABLE TIME FOR PURE
ALOHA PROTOCOL
PURE ALOHA
Frame time – the amount of time needed to transmit the standard fixed length
frame
An infinite population of users generates new frames according to a Poisson
distribution, with mean N frames per time frame.
If N >1 than more frames than the channel can handle
0<N<1 for reasonable throughput
In addition to new frames, stations generate retransmissions. The probability of k
transmission attempts per frame time, old and new combined, is also Poisson,
with mean G per frame
G >= N (equal when there are no retransmissions)
Throughput of a channel is:
S = G P0, where P0 is the probability that a frame doesn’t suffer collisions
PURE ALOHA
The probability that k frames are generated during a given frame time is given by Poisson
distribution:
So the probability of zero frames is just e-G

In the vulnerable interval, the mean number of frames generated is 2G, so the probability
that there is no frame is therefore P0 = e-2G
Using the formula S = G P0, we obtain:
The maximum throughput occurs at G = 0.5.

For G = 0.5 we get S = 1/2e = 0.184
SLOTTED ALOHA
Assumptions Operation
• All frames same size • When node obtains fresh

• Time is divided into equal size frame, it transmits in next slot
slots, time to transmit 1 frame • No collision, node can send
• Nodes start to transmit new frame in next slot
frames only at beginning of • If collision, node retransmits
slots frame in each subsequent slot
• Nodes are synchronized with prob. p until success
• If 2 or more nodes transmit in
slot, all nodes detect collision
SLOTTED ALOHA
Pros Cons
single active node can continuously collisions, wasting slots
transmit at full rate of channel idle slots
highly decentralized: only slots in nodes may be able to detect collision in
nodes need to be in sync less than time to transmit packet
simple clock synchronization
FRAMES IN A SLOTTED ALOHA
NETWORK
VULNERABLE TIME FOR
SLOTTED ALOHA PROTOCOL
SLOTTED ALOHA
The time is divided into discrete intervals, each interval
corresponding to one frame.
The users will need to be synchronized with the beginning of the
slot
- Special station can emit a pip at the start of each interval
A computer is not allowed to send data at any arbitrary times, it will
be forced to wait until the next valid time interval
Since the vulnerable period is now halved, the throughput of this
method would be:
Slotted ALOHA peaks at G=1 :: so S=1/e=.368 (i.e. 37 %
success)…..a small increase in channel load will drastically reduce
its performance.
PURE ALOHA VS. SLOTTED
ALOHA
Throughput versus offered traffic for ALOHA systems
CSMA PROTOCOLS
Are protocols in which stations listen for a carrier (i.e.
transmission) and act accordingly
Networks based on these protocols can achieve better channel
utilization than 1/e
Protocols
1 persistent CSMA
Non persistent CSMA
p persistent CSMA
1 PERSISTENT CSMA
1 persistent CSMA
When a station has data to send, it first listens to the channel
If channel is busy, the station waits until the channel is free. When detects
an idle channel, it transmits the frame
If collision occurs, it will wait an random amount of time and starts again
The protocol is called 1 persistent, because the station sends with

probability of 1 when finds the channel idle, meaning that is continuously
listening
Propagation delay
NON PERSISTENT CSMA
Before sending a station senses the channel. If no activity,
it sends its frame
If channel is busy, then will not continue to sense the
channel until it becomes idle, but it will retry at a latter
time (waiting a random period of time and repeating the
algorithm)
With this algorithm, fewer collisions will happen; thus
better channel utilization but with longer delays than 1
persistent CSMA algorithm
P PERSISTENT CSMA
It applies to slotted channels
When a station becomes ready to send, it senses the channel.
If it is idle will transmit with a probability of p. With a
probability of q it defers to the next slot.
If next slot is also idle, it transmits or it defers again with
probabilities of p and q
This process is repeated until the frame gets either transmitted
or another station it began transmission
For latter case, the unlucky station acts the same as it would
have been a collision (waits a random time and starts again)
PERSISTENT AND
NON-PERSISTENT CSMA
Comparison of the channel utilization versus load for various random access protocols.

MEDIA ACCESS CONTROL SUBLAYER

Uploaded by

Copyright:

Available Formats

MEDIA ACCESS CONTROL SUBLAYER

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MEDIA ACCESS CONTROL SUBLAYER

Uploaded by

Copyright:

Available Formats

MEDIA ACCESS

1) Static Channel Allocation.

2) Dynamic Channel Allocation

The basic difference with respect to timing is:

In pure ALOHA, frames are transmitted at completely arbitrary times.

So the probability of zero frames is just e-G

The maximum throughput occurs at G = 0.5.

• All frames same size • When node obtains fresh

The protocol is called 1 persistent, because the station sends with

You might also like

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