Lec 12

Aloha/slotted aloha
• Mechanism
– random, distributed (no central arbiter), time-multiplex
– Slotted Aloha additionally uses time-slots, sending must
always start at slot boundaries
collision
• Aloha
sender A
sender B
sender C
t
• Slotted Aloha collision
sender A
sender B
sender C
t
DAMA - Demand Assigned Multiple Access
• Channel efficiency only 18% for Aloha, 36% for Slotted Aloha
(assuming Poisson distribution for packet arrival and packet length)
• Reservation can increase efficiency to 80%
– a sender reserves a future time-slot
– sending within this reserved time-slot is possible without collision
– reservation also causes higher delays
– typical scheme for satellite links
• Examples for reservation algorithms:
– Explicit Reservation according to Roberts (Reservation-ALOHA)
– Implicit Reservation (PRMA)
– Reservation-TDMA
Access method DAMA: Explicit Reservation
•Explicit Reservation (Reservation 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)
– 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
collision
t
Aloha reserved Aloha reserved Aloha reserved Aloha
Access method DAMA: PRMA
•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
reservation
1 2 3 4 5 6 7 8 time-slot
ACDABA-F
frame1 A C D A B A F
ACDABA-F
frame2 A C A B A
AC-ABAF-
frame3 A B A F collision at
A---BAFD reservation
frame4 A B A F D attempts
ACEEBAFD
frame5 A C E E B A F D
t
Access method DAMA: 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
data-slots 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)
e.g. N=6, k=2
N mini-slots N * k data-slots
reservations other stations can use free data-slots

for data-slots based on a round-robin scheme
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)
• Example: Randomly Addressed Polling
– 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
Access method CDMA
•CDMA (Code Division Multiple Access)
– all terminals send on the same frequency probably at the same
time and can use the whole bandwidth of the transmission
channel
– each sender has a unique random number, the sender XORs the
signal with this random number
– the receiver can “tune” into this signal if it knows the pseudo
random number, tuning is done via a correlation function
•Disadvantages:
– higher complexity of a receiver (receiver cannot just listen into
the medium and start receiving if there is a signal)
– all signals should have the same strength at a receiver
•Advantages:
– all terminals can use the same frequency, no planning needed
– huge code space (e.g. 232) compared to frequency space
– interferences (e.g. white noise) is not coded
– forward error correction and encryption can be easily integrated
CDMA in theory
• Sender A
– sends Ad = 1, key Ak = 010011 (assign: „0“= -1, „1“= +1)
– sending signal As = Ad * Ak = (-1, +1, -1, -1, +1, +1)
• Sender B
– sends Bd = 0, key Bk = 110101 (assign: „0“= -1, „1“= +1)
– sending signal Bs = Bd * Bk = (-1, -1, +1, -1, +1, -1)
• Both signals superimpose in space
– interference neglected (noise etc.)
– As + Bs = (-2, 0, 0, -2, +2, 0)
• Receiver wants to receive signal from sender A
– apply key Ak bitwise (inner product)
• Ae = (-2, 0, 0, -2, +2, 0)  Ak = 2 + 0 + 0 + 2 + 2 + 0 = 6
• result greater than 0, therefore, original bit was „1“
– receiving B
• Be = (-2, 0, 0, -2, +2, 0)  Bk = -2 + 0 + 0 - 2 - 2 + 0 = -6, i.e.
„0“
data A
CDMA on signal level I
1 0 1 Ad
key A
key
0 1 0 1 0 0 1 0 0 0 1 0 1 1 0 0 1 1 Ak
sequence A
data  key 1 0 1 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0
signal A As
Real systems use much longer keys resulting in a larger distance

between single code words in code space.
CDMA on signal level II
signal A As
data B 1 0 0 Bd
key B
key 0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 1 1 1 Bk
sequence B
1 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1
data  key
Bs
signal B
As + Bs
data ACDMA
1
on signal
0
level III
1 Ad
As + Bs
Ak
(As + Bs)
* Ak
integrator
output
comparator 1 0 1
output
CDMA on signal level IV
data B Bd
1 0 0
As + Bs
Bk
(As + Bs)
* Bk
integrator
output
comparator 1 0 0
output
CDMA on signal level V
As + Bs
wrong
key K
(As + Bs)
*K
integrator
output
comparator
(0) (0) ?
output
SAMA - Spread Aloha Multiple
Access
Aloha has only a very low efficiency, CDMA needs complex receivers to be
able to receive different senders with individual codes at the same time
Idea: use spread spectrum with only one single code (chipping sequence) for
spreading for all senders accessing according to aloha
collision
sender A 1 0 1 narrow
sender B 0 1 1 band
send for a
shorter period
with higher power
spread the signal e.g. using the chipping sequence 110101 („CDMA without CD“)
Problem: find a chipping sequence with good characteristics

Comparison
SDMA/TDMA/FDMA/CDMA
Approach SDMA TDMA FDMA CDMA
Idea segment space into segment sending segment the spread the spectrum
cells/sectors time into disjoint frequency band into using orthogonal codes
time-slots, demand disjoint sub-bands
driven or fixed
patterns
Terminals only one terminal can all terminals are every terminal has its all terminals can be active
be active in one active for short own frequency, at the same place at the
cell/one sector periods of time on uninterrupted same moment,
the same frequency uninterrupted
Signal cell structure, directed synchronization in filtering in the code plus special
separation antennas the time domain frequency domain receivers
Advantages very simple, increases established, fully simple, established, flexible, less frequency
capacity per km² digital, flexible robust planning needed, soft
handover
Dis- inflexible, antennas guard space inflexible, complex receivers, needs
advantages typically fixed needed (multipath frequencies are a more complicated power
propagation), scarce resource control for senders
synchronization
difficult
Comment only in combination standard in fixed typically combined still faces some problems,
with TDMA, FDMA or networks, together with TDMA higher complexity,
CDMA useful with FDMA/SDMA (frequency hopping lowered expectations; will
used in many patterns) and SDMA be integrated with
mobile networks (frequency reuse) TDMA/FDMA

Lec 12

Uploaded by

Copyright:

Available Formats

Lec 12

Uploaded by

Document Information

Original Title

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

Lec 12

Uploaded by

Copyright:

Available Formats

Aloha/slotted aloha

reservations other stations can use free data-slots

Real systems use much longer keys resulting in a larger distance

Problem: find a chipping sequence with good characteristics

You might also like