CS6504 Outline

•Review of random-access Multiple Access Protocols

Mobile Computing ¾ALOHA
¾CSMA
¾CSMA/CD
Dr. Ayman Abdel-Hamid ¾CSMA/CA
Computer Science Department •Multiple Access in Wireless LANs
Virginia Tech ¾MACA
Multiple Access Protocols

Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 1 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 2
Spring 2007 Spring 2007

Multiple Access Random-Access

•Nodes or stations connected to or use a common link called a •Each station has the right to the medium without being controlled
broadcast link → the need for a multiple access protocol to by any other station
coordinate access to the link
•If more than one station tries to send, a collision occurs and the
•Multiple-access the frames will be garbled
¾Random-access protocols •We need a protocol that answers the following questions
‰ALOHA, CSMA, CSMA/CD, and CSMA/CA ¾When can the station access the medium?
¾Controlled-access protocols ¾What can the station do if the medium is busy?
‰Reservation, polling, and token passing ¾How can the station determine the success or failure of the
transmission?
¾Channelization protocols
¾What can the station do if there is a collision?
‰FDMA, TDMA, and CDMA
Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 3 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 4
Spring 2007 Spring 2007

1
 ALOHA 1/2 ALOHA 2/2
start
•University of Hawaii, early 1970s If no ACK, after several
tries, station gives up
•Base station is a central controller Set backoff to zero
•Every station sends to BS, which relays to intended recipient
•Different upload/download frequencies Send the frame
Wait backoff time
•Multiple Access: Any station sends a frame when it has a frame to
send Wait
No
•Acknowledgement: After sending the frame, the station waits for No
an acknowledgement, if no ACK during ( 2* maximum Backoff limit Increment backoff ACK received
propagation delay), assume frame lost and try sending again after Yes Yes
a random amount of time (using a backoff strategy) Abort Success

Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 5 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 6
Spring 2007 Spring 2007

CSMA 1/3 CSMA 2/3

•Persistence strategy (What to do when you sense a busy medium?)
•Sense the medium before
trying to use it ¾Non-persistent
•Cannot eliminate collision ¾Persistent
(can reduce possibility of 91-persistent
collision)
‰send frame if line is idle with probability 1
¾propagation delay
9p-persistent
¾When a station sends
a frame, it takes a ‰send frame if line is idle with probability p
while for the first bit to ‰Assume p = 0.2. Generate a random number N between 1
reach every station and and 100.
for every station to ‰If N < 20 then send else refrain from sending
sense it
¾CSMA does not define the procedure for a collision
Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 7 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 8
Spring 2007 Spring 2007

2
 CSMA 3/3 CSMA/CD 1/2
start

Set backoff to zero

Sense carrier Sense carrier

Persistence strategy
Yes
Yes Wait backoff time
Wait Busy? Busy?
(Random Send the frame
No No
Time)
No
Send the frame Yes
Send the frame Increment Send jam
with probability p Backoff limit? backoff Signal Collision?
Yes No
Non-persistent Persistent Abort Success

Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 9 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 10
Spring 2007 Spring 2007

CSMA/CD 2/2 CSMA/CA

start
•Exponential backoff method IFG: Interframe gap

Wait a random amount of time between CSMA/CA is used for wireless LANs
Set backoff to zero

0 and 2N * maximum_propagation_delay Persistence strategy

where N is the number of attempted transmissions Wait IFG time
•Why a jam signal? Wait a random time
Wait backoff time
¾Inform other stations about the collision Send the frame

Set a timer
•Backoff limit is usually 15 No
No
•CSMA/CD is used in traditional Ethernet Backoff limit? Increment ACK received
backoff before timeout?
Yes
Abort Yes

Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 11 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504
Success 12
Spring 2007 Spring 2007

3
 CSMA/CD not suitable for Wireless LANs 1/2 CSMA/CD not suitable for Wireless LANs 2/2
•Collision detection implies that a station must be able to send data
and receive collision signals at the same time → costly stations and •Distance between stations can be great, signal fading could
increased bandwidth requirements prevent a station at one end from hearing collision at the other end
•Collision may not be detected because of hidden terminal problem •Exposed terminal problem
¾well-sited station X can hear far away station Y
A B C D
¾X is too far from Y to interfere with its traffic to nearby
stations
¾A and B are within each other’s range and can potentially interfere with one
another ¾X defers to Y, wasting opportunity to reuse channel locally
¾C can interfere with B and D but not with A
¾A is transmitting to B and C senses the medium to send to B?
¾B transmitting to A and C senses the medium to send to D?

Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 13 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 14
Spring 2007 Spring 2007

MACA 1/2 MACA 2/2

Range of A’s transmitter
Phil Karn, “ MACA - A New Channel Access Method for Packet
Radio ,” in Proceedings of the 9th ARRL Computer Networking
Conference, London, Ontario, Canada, 1990. C A B D
E Range of B’s transmitter
•Later used as basis for IEEE 802.11 Wireless LAN standard
•C within range of A but not within range of B
•Sender stimulates the receiver into outputting a short frame (nearby stations
avoid transmitting for the duration of the upcoming data frame) ¾hears RTS from A but not CTS from B

•A sends RTS (Request to Send) to B (RTS contains length of data frame to ¾As long as it does not interfere with the CTS, it is free to transmit while the data
follow) frame is sent

•B replies with a CTS (Clear to Send) (upon receipt of CTS, A starts •D within range of B but not A
transmission, CTS contains length of data copied from RTS) ¾Does not hear RTS but hears CTS

•Any station hearing RTS: too close to A, remains silent enough for CTS to be ¾Defers from sending anything until that frame is expected to finish
transmitted back to A without conflict •E hears both control messages, silent until data frame completed
•Any station hearing the CTS, too close to B, must remain silent during the •B and C could both send RTS to A at the same time. Use exponential backoff in
upcoming data transmission case of collision
Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 15 Multiple Access Protocols © Dr. Ayman Abdel-Hamid, CS6504 16
Spring 2007 Spring 2007