Scribd
Upload
29 views

Computer Communication & Networking: Data Link Control - MAC Sudipta Mahapatra

1) CSMA/CA is a medium access control technique used in wireless networks like IEEE 802.11. It uses carrier sensing and collision avoidance to reduce collisions between nodes that are not visible to each other. 2) With CSMA/CA, when a node has a packet to send, it first listens to detect if another transmission is occurring. If the channel is idle, it sends a Request to Send packet and waits for a Clear to Send response from the receiver before transmitting the data. 3) This exchange of RTS and CTS packets reserves the channel and notifies any hidden nodes that a transmission is occurring, avoiding collisions between nodes that cannot hear each other directly.

Uploaded by

Nachiketa Das
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

Computer Communication & Networking: Data Link Control - MAC Sudipta Mahapatra

1) CSMA/CA is a medium access control technique used in wireless networks like IEEE 802.11. It uses carrier sensing and collision avoidance to reduce collisions between nodes that are not visible to each other. 2) With CSMA/CA, when a node has a packet to send, it first listens to detect if another transmission is occurring. If the channel is idle, it sends a Request to Send packet and waits for a Clear to Send response from the receiver before transmitting the data. 3) This exchange of RTS and CTS packets reserves the channel and notifies any hidden nodes that a transmission is occurring, avoiding collisions between nodes that cannot hear each other directly.

Uploaded by

Nachiketa Das
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 27

Computer Communication

&
Networking

Data Link Control - MAC

Sudipta Mahapatra

1
Medium Access Control Techniques

• Important in distributed channels.


• ALOHA Protocol
– Pure ALOHA
– Slotted ALOHA
• CSMA
– One persistent
– Non persistent
– p-persistent – Slotted channels
• CSMA/CD
• CSMA/CA
2
Definitions

• Medium Access: A station wants to put a data frame into


the shared medium or channel.
• Contention Resolution: Multiple stations trying to access
the medium simultaneously.
• Collision: Transmissions by two or more stations overlap
in time.
• Carrier: An unmodulated signal.
• Jamming signal: In telecommunication, this is a signal
that carries a bit pattern sent by a data station to inform
the other stations that they must not transmit.

3
ALOHA Protocol

• Pure ALOHA
• A node transmits a packet whenever it has one to send.
• In case of collision the packet is retransmitted after a random time
interval.

4
Slotted ALOHA

• The time is divided into slots of fixed length (equal to the packet
duration Tp).
• All the nodes start their transmission only at the beginning of a new
time slot.

5
Throughput Analysis

6
Throughput Analysis

=e-2G

7
Throughput Analysis (Contd.)
• Throughput Analysis
– Assumptions:
• Packet duration=Tp
• Packet transmission rate = λ
• Pr[Successful transmission]=Ps
• Increase in transmission rate due to retransmissions=λr
• Total packet transmission rate observed
• λt =λ+λr.
– Definitions:
• Traffic, G=λtTp. At low load, S≈
≈G, at high load G>S.
• Throughput, S=GPs.
∞

• Pr[Success in k attempts]=P0(1-P0)k-1 = ∑ ke
k =1
−G
(1 − e −G ) k −1

• Expected number of transmissions= eG 8


Throughput Analysis (Slotted Aloha)

9
Analytical Throughput curve

10
Carrier sense multiple access (CSMA)

• A refinement of the ALOHA protocol that is used in


Ethernet.
• Improves performance when there is a higher
medium utilisation.
• When an NIC has data to transmit, it first listens to
the cable (using a transceiver) to see if a carrier
(signal) is being transmitted by another node.
• This may be achieved by monitoring whether a
current is flowing in the cable (each bit corresponds
to 18-20 mA of current).

11
CSMA (Contd.)

12
Non persistent CSMA
1. If the medium id idle, transmit; otherwise,
go to step 2.
2. If the channel is busy, wait for a random
amount of time and repeat step1.

13
1-persistent CSMA
1. If the medium id idle, transmit; otherwise,
go to step 2.
2. If the channel is busy, continue to sense
the channel until it is sensed to be idle;
then transmit immediately.

14
p-persistent CSMA
A compromise that attempts to reduce collisions
while ensuring less idle time.
1. If the medium id idle, transmit with a probability
of p, and delay for one time unit with probability
(1-p); typically, the time unit is set equal to the
maximum propagation delay.
2. If the channel is busy, continue to sense the
channel until it is sensed to be idle; then repeat
step 1.
3. If transmission is delayed by one time unit,
repeat step 1.

15
Throughput Curve
Analytical Throughput Results

16
MAC Protocol used in IEEE 802.3
• CSMA with Collision Detection (CSMA/CD)
• The Channel can be in one of three states:
(i) Transmission (ii) Contention (iii) Idle

17
CSMA/CD?
• Collision detection logic is embedded in the
transceiver interfacing a node to the
medium.

18
CSMA/CD Operation
• A station that detects a collision:
 Abruptly stops transmission.
 Puts a jamming signal into the channel.
 Chooses a retransmission time using the Binary
exponential Backoff algorithm.

19
CSMA/CD Operation

Source: Forouzan - DCN


20
Binary exponential Backoff Algorithm
Slotted Channel

• After the first collision, each station waits for either 0


or 1 time slots.
• After second collision, each station waits for either
0, 1, 2, or 3 time slots at random.
• After I collisions, a random number is chosen
between 0 and 2i-1 and that many slots are skipped.
• After 10 collisions, the randomization interval is
frozen at 1023 slots.
• After 16 collisions, failure is reported and now it’s
the job of higher layers to ensure recovery.

21
CSMA/CA
• CSMA/CA is used in 802.11 based wireless LANs.
• In wireless LANs, CSMA/CD cannot be implemented
as here it is not possible to listen while sending.
• Thus, collision detection is not possible.
• Another reason is the hidden terminal problem,
whereby a node A, in range of the receiver R, is not
in range of the sender S, and therefore cannot know
that S is transmitting to R.
• Still another problem is the exposed terminal
problem.

22
Hidden terminal problem

• In wireless networking, the hidden node problem occurs when a


node is visible from a wireless access point (AP), but not from
other nodes communicating with the said AP.
• In the above figure, nodes A and B can each communicate with
the hub, but one can not know when the other one is transmitting.
23
Exposed terminal problem
• In the following figure, S2 can not transmit to R2 as it hears S1
transmitting to R1, though R2 is not in the range of S1.

R1 S1 S2 R2

24
CSMA/CA Protocol
• CSMA/CA: explicit channel reservation
– sender: send short RTS: request to
send
– receiver: reply with short CTS: clear
to send
• CTS reserves channel for sender,
notifying (possibly hidden) stations
• Avoids hidden station collisions
25
CSMA/CA: IEEE 802.11

26
CSMA/CA Operation

27

You might also like