Medium Access Control

Can we apply media access methods from fixed networks?

Example CSMA/CD Carrier Sense Multiple Access with Collision Detection send as soon as the medium is free, listen into the medium if a collision occurs (original method in IEEE 802.3) Problems in wireless networks signal strength decreases proportional to the square of the distance the sender would apply CS and CD, but the collisions happen at the receiver it might be the case that a sender cannot hear the collision, i.e., CD does not work furthermore, CS might not work if, e.g., a terminal is hidden
1

Hidden Terminals

Hidden & Exposed Terminals

Hidden terminals
A sends to B, C cannot receive A C wants to send to B, C senses a free medium (CS fails) collision at B, A cannot receive the collision (CD fails) A is hidden for C

Exposed terminals
B sends to A, C wants to send to another terminal (not A or B) C has to wait, CS signals a medium in use but A is outside the radio range of C, therefore waiting is not necessary C is exposed to B

Near & Far Terminals

Near & Far Terminals

Terminals A and B send, C receives

signal strength decreases proportional to the square of the distance

the signal of terminal B therefore drowns out As signal

C cannot receive A

Near & Far Terminals

If C for example was an arbiter for sending rights, terminal B would drown out terminal A already on the physical layer Also severe problem for CDMA-networks precise power control needed!

Access methods SDMA/FDMA/TDMA

SDMA (Space Division Multiple Access)
segment cell

space into sectors, use directed antennas

structure

FDMA (Frequency Division Multiple Access)

assign

a certain frequency to a transmission channel between a sender and a receiver

permanent

(e.g., radio broadcast), slow hopping (e.g., GSM), fast hopping (FHSS, Frequency Hopping Spread Spectrum)

TDMA (Time Division Multiple Access)

assign

the fixed sending frequency to a transmission channel between a sender and a receiver for a certain amount of time
8

Fixed FDMA Example GSM

f
960 MHz
124

935.2 MHz 915 MHz

1 20 MHz 124

200 kHz

890.2 MHz

TDMA
The receiver is tuned to the same frequency all the time The receiver listens to many channels separated in time. A time slot is allocated to a channel. The channel accesses the medium at the designated time

10

Fixed TDM
The Base station assigns the fixed time pattern to all the mobile stations The mobiles synchronize to the base station and wait for its turn to access the medium

11

Fixed Duplex TDMA : Example DECT

417 s 1 2 3 downlink 11 12 1 2 3 uplink 11 12 t

12

Fixed Duplex TDMA

The channels is made of 24 time slots Uplink 12 time slots are allocated for the mobiles to access the Base station Downlink 12 time slots are allocated for the base station to access mobiles Each connection is allocated its uplinkdownlink pair The pattern repeats every 10 msec. So, every time slot is for 10msec/24 = 417 sec
13

Fixed Duplex TDMA

Merits : Every user gets a fixed bandwidth Very efficient for constant data rates Demerit: Not very suitable if the data is bursty Some slots may be unused if the user does not transmit data in a time slot.

14

Classical Aloha

TDM is applied without any access control Aloha does not coordinate the medium It does not resolve contention on MAC layer

15

Classical Aloha
collision sender A sender B

sender C
t

16

Classical Aloha
Users access the medium in a random fashion If there is a collision, the MAC protocol does not resolve It is for the higher layers to resolve Throughput is only 18%. Useful only for light loads

17

Slotted Aloha

collision sender A sender B sender C t

18

Slotted Aloha

The time for medium access is divided into slots There is no coordination of users to access the medium Users can access the medium only at the beginning of the time slots Time synchronization is very important The throughput is now 36% with the introduction of slots UMTS uses this slotted Aloha MAC.

19

Carrier Sense Multiple Access (CSMA)

Check if carrier is free

Sender MEDIUM FOR TRANSMISSION Wait for a set duration

20

CSMA
Since the medium is accessed to check if it is idle and then the transmission is initiated, probability of collision is reduced. This scheme can not still solve the Hidden Terminal problem. A variant : station tries for a slot with probability p. If not successful, it moves on to the next slot

21

Demand Assigned Multiple Access with Reservation Contention Phase : Fixed Aloha slots (very short duration slots) are used reserve future slots The satellite for example, sends a list of approved users and the slots. The users have to perfectly synchronize and use the medium exactly as per the approved list.
22

Demand Assigned Multiple Access with Reservation

collision

Aloha

reserved

Aloha

reserved

Aloha

reserved

Aloha

two modes: ALOHA mode for reservation: competition for small reservation slots, collisions possible reserved mode for data transmission within successful reserved slots (no collisions possible)
23

Demand Assigned Multiple Access with Reservation

it is important for all stations to keep the reservation list consistent at any point in time and, therefore, all stations have to synchronize from time to time

24

Implicit reservation (PRMA - Packet Reservation MA):

Implicit

reservation (PRMA - Packet Reservation MA):

a certain number of slots form a frame, frames are repeated stations compete for empty slots according to the slotted aloha principle once a station reserves a slot successfully, this slot is automatically assigned to this station in all following frames as long as the station has data to send competition for this slots starts again as soon as the slot was empty in the last frame

25

Implicit reservation (PRMA - Packet Reservation MA):

ACDABA-F

1 2 3 4 5 6 7 8 frame1 A C D A B A frame2 A C frame3 A frame4 A A B A B A F B A F D F

time-slot

ACDABA-F
AC-ABAFA---BAFD ACEEBAFD

collision at reservation attempts t

frame5 A C E E B A F D

26

PRMA - Packet Reservation MA

A Base station (for ex., a satellite) broadcasts the status of slots (for example, ACDABA-F) to all mobiles. The mobiles know which all slots are allocated to them in this frame. All stations needing a slot will contend for the free slot (Slot F in this case). There is a collision here since more than one mobile is trying for the free slot F. Slot F is not allocated since there is a collision. In the next frame, stations can compete for this and any released slots.
27

Reservation TDMA

Reservation

Time Division Multiple Access every frame consists of N mini-slots and x data-slots every station has its own mini-slot and can reserve up to k dataslots using this mini-slot (i.e. x = N * k). other stations can send data in unused data-slots according to a round-robin sending scheme (best-effort traffic)
N * k data-slots e.g. N=6, k=2

N mini-slots

reservations for data-slots

other stations can use free data-slots based on a round-robin scheme

28

MACA : Multiple Access with Collision Avoidance

MACA (Multiple Access with Collision Avoidance) uses short signaling packets for collision avoidance

RTS (request to send): a sender request the right to send from a receiver with a short RTS packet before it sends a data packet CTS (clear to send): the receiver grants the right to send as soon as it is ready to receive sender address receiver address packet size
29

Signaling packets (RTS and CTS) contain

MACA : Multiple Access with Collision Avoidance

MACA avoids the problem of hidden terminals A and C want to send to B RTS A sends RTS first CTS CTS C waits after receiving A B CTS from B

MACA avoids the problem of exposed terminals B wants to send to A, C to another terminal RTS RTS now C does not have to wait for it cannot CTS receive CTS from A A B

30

MACA State Diagram

sender
idle

receiver
idle

packet ready to send; RTS

RxBusy ACK time-out NAK; RTS wait for ACK wait for the right to send time-out; RTS

data; ACK time-out data; NAK wait for data RTS; CTS

CTS; data

ACK: positive acknowledgement NAK: negative acknowledgement

RTS; RxBusy RxBusy: receiver busy

31

Polling Mechanisms

If one terminal can be heard by all others, this central terminal (a.k.a. base station) can poll all other terminals according to a certain scheme

now all schemes known from fixed networks can be used (typical mainframe - terminal scenario) base station signals readiness to all mobile terminals terminals ready to send can now transmit a random number without collision with the help of CDMA or FDMA (the random number can be seen as dynamic address) the base station now chooses one address for polling from the list of all random numbers (collision if two terminals choose the same address) the base station acknowledges correct packets and continues polling the next terminal this cycle starts again after polling all terminals of the list

Example: Randomly Addressed Polling

32

ISMA (Inhibit Sense Multiple Access)

Current state of the medium is signaled via a busy tone the base station signals on the downlink (base station to terminals) if the medium is free or not terminals must not send if the medium is busy terminals can access the medium as soon as the busy tone stops the base station signals collisions and successful transmissions via the busy tone and acknowledgements, respectively (media access is not coordinated within this approach) mechanism used, e.g., for CDPD (USA, integrated into AMPS)

33