medium access schemes - startseite tu ilmenau...– assign a certain frequency to a transmission...
TRANSCRIPT
Integrated Communication Systems Group Ilmenau University of Technology
Medium Access Schemes
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 2
Media Access: Motivation
The problem: multiple users compete for a common, shared resource (medium)
Can we apply media access methods from fixed networks? Example: CSMA/CD
– Carrier Sense Multiple Access with Collision Detection (IEEE 802.3) – send as soon as the medium is free (carrier sensing – CS) – listen to the medium, if a collision occurs stop transmission and jam
(collision detection – CD) Problems in wireless networks
– signal strength decreases (at least) 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”
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 3
Motivation – hidden and 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 C -> 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
B A C
B A C
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 4
Motivation – near and far terminals
Terminals A and B send, C receives – signal strength decreases with distance d (1/d2…4) – the signal of terminal B therefore drowns out A’s signal – C cannot receive A
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!
A B C
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 5
Access methods SDMA/FDMA/TDMA
SDMA (Space Division Multiple Access) – segment space into sectors, use directed antennas – cell 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
The multiplexing schemes presented previously are now used to
control medium access!
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 6
Communication link types
Each terminal needs an uplink and a downlink channel Types of communication links: • Simplex
– unidirectional link transmission
• Half Duplex – Bi-directional (but not simultaneous)
• Duplex
– simultaneous bi-directional link transmission, two types: • Frequency division duplexing (FDD) • Time division duplexing (TDD)
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 7
Duplex modes
Frequency Division Duplex (FDD)
Separate frequency bands for up- and downlink
+ separation of uplink and downlink interference
- no support for asymmetric traffic
Examples: LTE, UMTS, GSM, IS-95, AMPS
Time Division Duplex (TDD)
Separation of up- and downlink traffic on time axis
+ support for asymmetric traffic
- mix of uplink and downlink interference on single band
Examples: DECT, WLAN, UMTS (TDD), TD-LTE
Fd
Fu
Td Tu
Td Tu
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 8
FDD/FDMA - general scheme, example GSM
f
t
124
1
124
1
20 MHz
200 kHz
890.2 MHz
935.2 MHz
915 MHz
960 MHz downlink
uplink
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 9
TDD/TDMA - general scheme, example DECT
1 2 3 11 12 1 2 3 11 12
t downlink uplink
417 µs
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 10
TDMA: Aloha/slotted aloha
Mechanism – random, distributed (no central arbiter), time-multiplex – Slotted Aloha additionally uses time-slots, sending must always start
at slot boundaries Aloha
Slotted Aloha
sender A
sender B
sender C
collision
t
sender A
sender B
sender C
collision
t
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 11
TDMA: Demand Assigned Multiple Access (DAMA)
Channel efficiency only 18% for Aloha, 36% for Slotted Aloha (assuming Poisson distribution of packet arrivals and packet lengths)
Reservation can increase efficiency to 80%
Idea: – a sender reserves a future time-slot – sending within this reserved time-slot is possible without collision
Disadvantage: reservation causes higher delays
Applications: – typical scheme for satellite links (long round-trip-times) – application to packet data, e.g. in GPRS and UMTS
Examples for reservation algorithms: – Explicit Reservation (Reservation-ALOHA) – Implicit Reservation (PRMA) – Reservation-TDMA
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 12
TDMA: DAMA – Explicit Reservation based on Aloha
Explicit Reservation (e.g. applied by 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)
Synchronisation: 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
Aloha reserved Aloha reserved Aloha reserved Aloha
collision
t
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 13
TDMA: DAMA – Implicit Reservation 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 (implicit reservation)
– competition for these slots starts again as soon as the slot was empty in the last frame
1 2 3 4 5 6 7 8 time-slot
frame2 A C A B A
frame3 A B A F
frame4 A B A F D
frame5 A C E E B A F D t
frame1 A C D A B A F ACDABA-F
ACDABA-F
AC-ABA--
A---BAF-
A---BAFD
implicit reservations
ACEEBAFD
New successful reservation attempts are in bold letters
collision at reservation attempts
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 14
TDMA: 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)
• Advantage: (small) guaranteed bandwidth with small latency for each
station • Disadvantages: fixed number of stations (mini slots); global coordination
N mini-slots N * k data-slots
reservations for data slots
other stations can use free data-slots based on a round-robin scheme
e.g. N = 6 stations, k = 2 data slots per station
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 15
TDMA: Multiple Access with Collision Avoidance (MACA)
Motivation: deal with hidden terminals without a base station (central controller)
Idea: use short signaling packets for collision avoidance – RTS (request to send): a sender requests 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 – all other stations listen to the signal
Signaling packets contain – sender address – receiver address – packet size
Collisions are mainly limited to the transmission of RTS signals which is small compared to the data transmission
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program
16
TDMA: MACA examples MACA avoids the problem of hidden terminals
– A and C want to send to B
– A sends RTS first – C waits after receiving
CTS from B
MACA avoids the problem of exposed terminals – B wants to send to A, C to another terminal – B sends RTS, A replies with CTS – C does not receive CTS from A => C concludes that it is not within receiving range of A – C can start its transmission
Disadvantage: – overhead where data packets are small
A B C
RTS
CTS
RTS
A B C
RTS
CTS CTS
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 17
TDMA: MACA variant: DFWMAC in IEEE 802.11 Simplified state machine
idle
wait for the right to send
wait for ACK
sender receiver
packet ready to send; RTS
time-out; RTS
CTS; data
ACK
RxBusy
idle
wait for data
RTS; RxBusy
RTS; CTS
data; ACK
time-out ∨ incorrect data; NAK
time-out ∨ NAK; RTS
ACK: positive acknowledgement NAK: negative acknowledgement
RxBusy: receiver busy
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 18
TDMA: Polling mechanisms If one terminal can be heard by all others, this “central” terminal (e.g. 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, round-robin, random, reservation-based)
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 received 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
Application to Bluetooth and 802.11 (possible access function)
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 19
TDMA: 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 (AMPS)
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 20
CDMA access method
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 Advantages:
– all terminals can use the same frequency, less planning needed – huge code space (e.g. 232) compared to frequency space – interference (e.g. white noise) is not coded – forward error correction and encryption can be easily integrated
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 (power control)
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 21
CDMA principle
Code 0
Code 1
Code 2
Σ
data 0
data 1
data 2
Code 0
Code 1
Code 2
data 0
data 1
data 2
sender (base station)
receiver (terminal)
Transmission via air interface
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 22
CDMA by example
Source 2
Source 1
data stream A & B
Code 2
Code 1
spreading
Source 2 spread
Source 1 spread
spreaded signal
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 23
CDMA by example
Sum of Sources Spread
+
overlay of signals
Sum of Sources Spread + Noise
transmission and distortion (noise and interference)
Despread Source 2
Despread Source 1
decoding and despreading
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 24
CDMA in theory Sender A
– sends Ad = 1, key Ak = 010011 (i.e. -1 1 -1 -1 1 1) – sending signal As = Ad * Ak = (-1, +1, -1, -1, +1, +1)
Sender B – sends Bd = 0, key Bk = 110101 (i.e. 1 1 -1 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“
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 25
CDMA on signal level I data A
Code A
signal A
data ⊕ code
code sequence A
Real systems use much longer keys resulting in a larger distance between single code words in code space
1 0 1
1 0 0 1 0 0 1 0 0 0 1 0 1 1 0 0 1 1 0 1 1 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0
Ad
Ak
As
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 26
CDMA on signal level II
signal A
data B
key B key
sequence B
signal B
As + Bs
data ⊕ key
1 0 0
0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 1 1 1 1 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1
Bd
Bk
Bs
As
1 0 -1
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 27
CDMA on signal level III
Ak
(As + Bs) * Ak
integrator output
comparator output
As + Bs
data A
1 0 1
1 0 1 Ad
1 0 -1
1
-1
1 0 -1
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 28
CDMA on signal level IV
integrator output
comparator output
Bk
(As + Bs) * Bk
As + Bs
data B
1 0 0
1 0 0 Bd
1 0 -1 1
-1 1 0 -1
Integrated Communication Systems Group
comparator output
CDMA on signal level V
wrong key K
integrator output
(As + Bs) * K
As + Bs
(0) (0) ?
Assumptions – orthogonality of keys – neglectance of noise – no differences in signal level => precise power control
1 0 -1 1
-1 1 0 -1
Advanced Mobile Communication Networks, Master Program 29
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 31
Approach SDMA TDMA FDMA CDMA Idea segment space into
cells/sectors segment sending time into disjoint time-slots, demand driven or fixed patterns
segment the frequency band into disjoint sub-bands
spread the spectrum using orthogonal codes
Terminals only one terminal can be active in one cell/one sector
all terminals are active for short periods of time on the same frequency
every terminal has its own frequency, uninterrupted
all terminals can be active at the same place at the same moment, uninterrupted
Signal separation
cell structure, directed antennas
synchronization in the time domain
filtering in the frequency domain
code plus special receivers
Advantages very simple, increases capacity per km²
established, fully digital, flexible
simple, established, robust
flexible, less frequency planning needed, soft handover
Dis-advantages
inflexible, antennas typically fixed
guard space needed (multipath propagation), synchronization difficult
inflexible, frequencies are a scarce resource
complex receivers, needs more complicated power control for senders
Comment only in combination with TDMA, FDMA or CDMA useful
standard in fixed networks, together with FDMA/SDMA used in many mobile networks
typically combined with TDMA (frequency hopping patterns) and SDMA (frequency reuse)
higher complexity, typically integrated with FDMA
Comparison SDMA/TDMA/FDMA/CDMA
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 32
Summary Central or decentralized control of access to medium
• central control: • joint common view on resource situation simplifies coordination • but registration and/or static configuration of system needed • still need to coordinate the initial, random access of mobiles to
the system • decentralized control:
• disjoint & inconsistent views on shared medium (hidden & exposed terminal)
• distributed arbitration scheme needed to minimize collisions • solution: RTS/CTS – to derive a joint common view on resource
usage
How to compare access schemes? • overall throughput/goodput of system • access latency or packet delay (average or worst case) • fairness among stations • quarantees, esp. wrt. delay and throughput
Integrated Communication Systems Group
Advanced Mobile Communication Networks, Master Program 33
References
Jochen Schiller: Mobile Communications (German and English), Addison-Wesley, 2000
(most of the material covered in this chapter is based on the book) Ramjee Prasad, Marina Ruggieri: Technology Trends in Wireless Communications,
Artech House, 2003