Tdma Fdma Cdma

Communication Networks
Topic 6: TDMA FDMA CDMA Objective: Explain and Analyze Multi-access Communication Protocols . (Refer T1-Ch.4; T2-Ch. 4 & 6 + Class Notes)
ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA
08/29/11
Shared media basis for broadcast networks
Medium Access Control Protocols

Inexpensive: radio over air; copper or coaxial cable M users communicate by broadcasting into medium
Key issue: How to share the medium?

3 1 2 4
Shared multiple access medium

M
08/29/11
Please Recall Multiplexing (As studied earlier) in the context of Switching
08/29/11
Allow sharing of expensive network resources, such as Bandwidth (analog) or bits per second (digital), etc., by several connections or information flows.
(a)
A B C A B C
Figure 4.1
Multiplexing (As covered earlier)
(b)
A B C MUX A
Trunk MUX group
B C
a.
3 pairs of users communicate using 3 separate set of wires

Dedicates network resources An unwieldy and inefficient approach as no. of users grow. allows sharing to take place. Resources allocated for only for the call duration
ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA 4
a.
Multiplexer approach

08/29/11
Frequency Division Multiplexing (As covered earlier)
08/29/11
Time Division Multiplexing (As covered earlier)
08/29/11
Multiplexing (As studied earlier) in the context of Switching
NOTE that: FDMA & TDMA are a
Generalization of FDM /TDM schemes

08/29/11
Satellite Communication
Satellite Channel uplink fin downlink fout
08/29/11
Cellular Communication
uplink f1 ; downlink f2 uplink f3 ; downlink f4
08/29/11
MAC: Channelization Schemes

Let M Stations that produce the same steady flow of information (say digital voice or audio streams), are sharing a medium the Channel. So, it makes sense to divide the transmission medium into M Channels that can be allocated for the transmission of information from each station. Channelization Schemes: FDMA, TDMA, CDMA
08/29/11
10
Approaches to Media Sharing

Medium sharing techniques
Static / Semi-static Channelization Dynamic medium access control
Partition medium Dedicated allocation to users Satellite transmission Cellular Telephone
Scheduling
Random access
Polling: take turns Request for slot in transmission schedule Token ring Wireless LANs
Loose coordination Send, wait, retry if necessary Aloha Ethernet

11
08/29/11
Why Channelization?
Channelization
Semi-static bandwidth allocation of portion of shared medium to a given user
Highly efficient for constant-bit rate traffic Preferred approach in

Cellular telephone networks Terrestrial & satellite broadcast radio & TV
Considered as Static MAC algorithms
08/29/11
12
requirements Inefficient for bursty traffic Does not scale well to large numbers of users
Channelization: Why not ? Inflexible in allocation of bandwidth to users with different

Average transfer delay increases with number of users M (fig. below)
much better at handling bursty traffic are the Dynamic MAC Other MAC algorithms are
Random Access schemes: ALOHA, Slotted ALOHA, CSMA, CSMACD Scheduling MACs: Reservation System, Polling, Token-passing Rings
Average Delay for TDMA X=Frame Tx. Time = L/R L: Frame length; R Tx bit rate; E[T]: Avg. Frame Transfer Delay M: no. of stations/users
08/29/11 ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA 13
Channelization Approaches
Frequency Division Multiple Access (FDMA)
Frequency band allocated to users Broadcast radio & TV, analog cellular phone
Time Division Multiple Access (TDMA)

Periodic time slots allocated to users Telephone backbone, GSM digital cellular phone
Code Division Multiple Access (CDMA)

Code allocated to users Cellular phones, 3G cellular
08/29/11
14
Channelization: Freq. Division Multiple Access (FDMA) Divide channel into M frequency bands Each station transmits and listens on assigned bands (implemented via BPFs) Guard bands reduce co-channel interference.
Frequency
Guard bands
2 M1 M
Time Let W is total bandwidth available; each station supports R bps; Then each station transmits at most R/M bps Good for stream traffic; Used in connection-oriented systems Inefficient for bursty traffic; then needed to allocate same band to multiple stations; leading towards dynamic sharing techniques.
08/29/11
Channelization: Time Division Multiple Access (TDMA)

Dedicate 1 slot per station in transmission cycles; TDMA stations take turns in making use of entire channel. Stations transmit data burst at full channel bandwidth
Frequency
Guard time
...
1 Time
Each station
transmits at R bps 1/M of the time for an average rate of R/M bits/second. Spends most of the time accumulating frames and preparing them for transmission in burst during the assigned time slot.
One cycle
08/29/11
Unlike TDM (where multiplexing occurs at a single location), different stations in different locations may experience different prop. Delays. To allow for inaccuracy in the prop. delay estimates, Guard time are required to ensure avoid overlap Tx times TDMA requires a preamble signal; for synchronizing receiver with Tx. bit stream. Excellent for stream traffic;Used in connection-oriented systems; variable rates/slots ECE C394 Communication Networks Inefficient for bursty traffic due to unused dedicated slots
Topic 6: TDMA FDMA and CDMA 16
Guardbands
FDMA
Frequency bands must be non-overlapping to prevent interference Guardbands ensure separation; form of overhead
TDMA
Stations must be synchronized to common clock Time gaps between transmission bursts from different stations to prevent collisions; form of overhead Must take into account propagation delays
08/29/11
17
Compare FDMA and TDMA in terms of their ability to handle groups of stations that produce information flows that are produced at constant but different bit rates.
Let the total bit rate supported by the transmission medium is R. In the typical FDMA,
each station can transmit at a rate of R/M on its assigned frequency, where M is the total number of stations. The bit rate R/M is fixed for each station, and must satisfy the highest bit rate generated by the group. But for stations with lower bit rate, unused bandwidth is wasted. FDMA is inflexible and inefficient in handling flows with different bit rates. FDMA would need to be modified to allocate bands of different bandwidth to different users to accommodate differences in bit rate requirements.
In TDMA, each time slot gives an average bit rate of R/M, where M is the number of time slots.
TDMA is more flexible than FDMA, because it can accommodate flows of different bit rates in two ways:
assign multiple slots to each flow according to their bit rate, or allow the slot to be variable in duration. In the first method, the bit rate of the flow must be some multiple of a basic bit rate. In the second method, a means of identifying the endpoints of the variable length frame must be provided, and this adds overhead.
TDMA is more flexible than FDMA in handling flows of various bit rates, but does not necessarily does this efficiently
.
08/29/11 ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA
18
Code Division Multiple Access
Channelization: CDMA
Channels determined by a code used in modulation and demodulation
Stations transmit over entire frequency band all of the time!
Frequency
1 2
Time
CDMA Spread Spectrum Signal Transmitter from one user

Binary information
R1 bps W1 Hz
R >> R1bps W >> W1 Hz
Digital modulation
Radio antenna
Unique user binary random sequence
User information mapped into: +1 or -1 for T sec. Multiply user information by pseudorandom binary pattern of G chips of +1s and -1s Resulting spread spectrum signal occupies G times more bandwidth: W = GW1 Modulate the spread signal by sinusoid at appropriate fc
08/29/11
20
CDMA Demodulationresidual Signal and

interference Signals from all transmitters
Digital demodulation
Correlate to user binary random sequence
Binary information
Recover spread spectrum signal Synchronize to and multiply spread signal by same pseudo-random binary pattern used at the transmitter In absence of other transmitters & noise, we should recover the original +1 or -1 of user information Other transmitters using different codes appear as residual noise
08/29/11
21
Pseudorandom pattern generator

Feedback shift register with appropriate feedback taps can be used to generate pseudorandom sequence
g0 R0 R1 g2 R2 output g(x) = x3 + x2 + 1 g3 Time R0 R1 R2 0 1 0 0 1 0 1 0 2 1 0 1 3 1 1 0 4 1 1 1 5 0 1 1 6 0 0 1 7 1 0 0 Sequence repeats from here onwards
22
The coefficients of a primitive generator polynomial determine the feedback taps

08/29/11
Channelization in Code Space

Each channel uses a different pseudorandom code Codes should have low cross-correlation
If they differ in approximately half the bits the correlation between codes is close to zero and the effect at the output of each others receiver is small
As number of users increases, effect of other users on a given receiver increases as additive noise CDMA has gradual increase in BER due to noise as number of users is increased Interference between channels can be eliminated is codes are selected so they are orthogonal and if receivers and transmitters are synchronized
Shown in next example
08/29/11
23
Example: CDMA with 3 users

Assume three users share same medium Users are synchronized & use different 4-bit orthogonal codes: {-1,-1,-1,-1}, {-1, +1,-1,+1}, {-1,-1,+1,+1}, {-1,+1,+1,-1},
-1 -1 +1 x Receiver +1 User 2 -1 +1 x +
User 1
+1 User 3
+1
-1 x
Shared Medium
08/29/11
24
Channel 1: 110 -> +1+1-1 -> (-1,-1,-1,-1),(-1,-1,-1,-1),(+1,+1,+1,+1) Channel 2: 010 -> -1+1-1 -> (+1,-1,+1,-1),(-1,+1,-1,+1),(+1,-1,+1,-1) Channel 3: 001 -> -1-1+1 -> (+1,+1,-1,-1),(+1,+1,-1,-1),(-1,-1,+1,+1) Sum Signal: (+1,-1,-1,-3),(-1,+1,-3,-1),(+1,-1,+3,+1)
Sum signal is input to receiver
Codes for channels 1, 2 & 3: {-1,-1,-1,-1}, {-1, +1,-1,+1}, {-1,-1,+1,+1} respectively,

Channel 1
Channel 2
Channel 3
Sum Signal
08/29/11
25
Example: Receiver for Station 2

Each receiver takes sum signal and integrates by code sequence of desired transmitter Integrate over T seconds to smooth out noise
Decoding signal from station 2 + x Integrate over T sec
Shared Medium
08/29/11
26
Decoding at Receiver 2
Sum Signal: Channel 2 Sequence: Correlator Output: Integrated Output: Binary Output: (+1,-1,-1,-3),(-1,+1,-3,-1),(+1,-1,+3,+1) (-1,+1,-1,+1),(-1,+1,-1,+1),(-1,+1,-1,+1) (-1,-1,+1,-3),(+1,+1,+3,-1),(-1,-1,-3,+1) -4, +4, -4 0, 1, 0
Codes for channels 1, 2 & 3: {-1,-1,-1,-1}, {-1, +1,-1,+1}, {-1,-1,+1,+1}

Sum Signal
X
Channel 2 Sequence Correlator Output
+4 Integrator Output -4 08/29/11 ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA -4 27
Walsh functions are provide orthogonal code sequences by mapping 0 to -1 and 1 to +1 m Walsh matrix provides orthogonal spreading sequences of length n=2 . These matrices have binary coeffs. And are defined recursively. Walsh matrices constructed recursively as follows:
Walsh Functions
W2n =
Wn W n Wn Wnc
W1=
W2=
0 0 0 1 W8=
W 4=
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0 0 0 0 0
0 1 0 1 0 1 0 1
0 0 1 1 0 0 1 1
0 1 1 0 0 1 1 0
0 0 0 0 1 1 1 1
0 1 0 1 1 0 1 0
0 0 1 1 1 1 0 0
0 1 1 0 1 0 0 1
28
08/29/11
Compare CDMA with FDMA, TDMA, in terms of their ability to handle groups of stations that produce information flows that are produced at constant but different bit rates.
Let the total bit rate supported by the transmission medium is R. Unlike TDMA and FDMA where transmission bandwidth is statically allocated to different stations in terms of time or frequency, In CDMA, the signal of every flow occupies the entire frequency band at the same time. In general CDMA assumes that the bit rate of the information source is fixed, and the symbol rate of the spreading sequence is an integer multiple of the information bit rate. If the bit rate is reduced by some integer factor, for example by 2, then the integration period for each bit time (in Figure 6.33) is twice as long. This means that the signal-to-noise ratio at the receiver will be higher, and hence the transmitter can reduce its transmitted power. The capacity of the CDMA system is limited by the interference between different flows. Thus flows of lower bit rate require lower transmission power, and cause lower interference to other flows. The extra capacity can be used to handle more flows. CDMA can efficiently handle flows of different bit rates as long as the inter-flow interference is below an acceptable level. ECE C394 Communication Networks
Topic 6: TDMA FDMA and CDMA 29
08/29/11
Channelization in Cellular Telephone Networks

Cellular networks use frequency reuse
Band of frequencies reused in other cells that are sufficiently far that interference is not a problem Cellular networks provide voice connections which is steady stream
FDMA used in Advanced Mobile Phone System (AMPS) TDMA used in IS-54 and Global System for Mobile Communications (GSM) CDMA used in Interim Standard 95 (IS-95)
Advanced Mobile Phone System

Advanced Mobile Phone System (AMPS)
First generation cellular telephone system in US Analog voice channels of 30 kHz Forward channels from base station to mobiles Reverse channels from mobiles to base
Frequency band 50 MHz wide in 800 MHz region allocated to two service providers: A and B
A
824 MHz 08/29/11
AB
849 MHz
A
869 MHz
A B
Frequency
894 MHz 31
AMPS Spectral Efficiency

50 MHz @ 30kHz gives 832 2-way channels Each service provider has
416 2-way channels 21 channels used for call setup & control 395 channels used for voice AMPS uses 7-cell frequency reuse pattern, so each cell has 395/7 voice channels
AMPS spectrum efficiency: #calls/cell/MHz =395/(7*25) = 2.26 calls/cell/MHz
08/29/11
32
Interim Standard 54/136

IS-54, and later IS-136, developed to meet demand for cellular phone service Digital methods to increase capacity A 30-kHz AMPS channel converted into several TDMA channels
1 AMPS channel carries 48.6 kbps stream Stream arranged in 6-slot 40 ms cycles 1 slot = 324 bits 8.1 kbps per slot 1 full-rate channel: 2 slots to carry 1 voice signal
1 AMPS channel carries 3 voice calls 30 kHz spacing also used in 1.9 GHz PCS band
IS-54 TDMA frame structure

Base to mobile 6 1 2 3 4 5 6 1 2 3 Time Mobile to base 1 2 3 40 ms 4 5 6 1 2 3 4 Time
416 AMPS channels x 3 = 1248 digital channels Assume 21 channels for calls setup and control IS-54 spectrum efficiency: #calls/cell/MHz
(1227/7)/(25 MHz) = 7 calls/cell/MHz
Global System for Mobile Communications (GSM)

European digital cellular telephone system 890-915 MHz & 935-960 MHz band PCS: 1800 MHz (Europe), 1900 MHz (N.Am.) Hybrid TDMA/FDMA
Carrier signals 200 kHz apart 25 MHz give 124 one-way carriers
Existing services 890 MHz Initial GSM 915 MHz Existing services 935 MHz Initial GSM 960 MHz
905 MHz
950 MHz
reverse
08/29/11
forward
35
Each carrier signal carries traffic and control channels 1 full rate traffic channel = 1 slot in every traffic frame 24 slots x 114 bits/slot / 120 ms = 22.8 kbps
Traffic Channels #0-11 0 1 2 3 4 5 6 7 8 Slow Associated Control Channel Traffic Channels #13-24 Slow Associated Control Channel 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
GSM TDMA Structure
1 multiframe = 26 frames 120 ms long
08/29/11
1 TDMA frame = 8 slots 1 slot = 114 data bits / 156.25 bits total ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA
36
GSM Spectrum Efficiency

Error correction coding used in 22.8 kbps to carry 13 kbps digital voice signal Frequency reuse of 3 or 4 possible 124 carriers x 8 = 992 traffic channels Spectrum efficiency for GSM:
(992/3)/50MHz = 6.61 calls/cell/MHz
08/29/11
37
Interim Standard 95 (IS-95)

CDMA digital cellular telephone system Operates in AMPS & PCS bands 1 signal occupies 1.23 MHz
41 AMPS signals
All base stations are synchronized to a common clock

Global Positioning System accuracy to 1 sec
Forward channels use orthogonal spreading Reverse channels use non-orthogonal spreading
Base-to-Mobile Channels
Walsh channel j sequence 9600 bps Error coding, 19,200 sym/s repetition, User info interleaving 19200 sym/s User mask (ESN) Long code generator Decimator 1.2288 Mcps I short code spreading sequence
baseband filter baseband filter

Q short code spreading sequence
I(t) Q(t)
Basic user information rate is 9.6 kbps Doubled after error correction coding Converted to +1s Multiplied by 19.2 ksym/sec stream derived from 42-bit register long-code sequence generator which depends on electronic serial number
08/29/11
Base-to-Mobile Channels
Walsh channel j sequence 9600 bps Error coding, 19,200 sym/s repetition, User info interleaving 19200 sym/s User mask (ESN) Long code generator Decimator 1.2288 Mcps I short code spreading sequence

I(t) Q(t)
Each symbol multiplied by 64-bit chip Walsh orthogonal sequence (19200 x 64 = 1.2288 Msym/sec) Each base station uses the same 15-bit register short sequence to spread signal prior to transmission Base station synchronizes all its transmissions
Pilot Tone & Synchronization

Walsh channel 0 sequence Pilot channel all 1s I short code spreading sequence

I(t) Q(t)
All 0s Walsh sequence reserved to generate pilot tone Short code sequences transmitted to all receivers Receivers can then recover user information using Walsh orthogonal sequence Different base stations use different phase of same short sequence Mobiles compare signal strengths of pilots from different base stations to decide when to initiate handoff
08/29/11
41
Mobile-to-Base Channels
I short code spreading sequence 9600 bps Error coding, repetition, User info interleaving 307,200 sym/s 1/2 chip delay
I(t) Q(t)
D
User mask (ESN)
Long code generator
1.2288 Mcps
9.6 kbps user information coded and spread to 307.2 kbps Spread by 4 by multiplying by long code sequence Different mobiles use different phase of long code sequence Multiplied by short code sequence Transmitted to Base
08/29/11
42
Spread spectrum reduces interference
IS-95 Spectrum Efficiency
Signals arriving at a base station from within or from outside its cell are uncorrelated because mobiles have different long code sequences Signals arriving at mobiles from different base stations are uncorrelated because they use different phases of the short code sequence
Enables reuse factor of 1 Goodman [1997] estimates spectrum efficiency for IS95 is:
between 12 & 45 call/cell/MHz
Much higher spectrum efficiency than IS-54 & GSM
08/29/11
43
Scheduling & Random Access

(Other than Channelization) And Performance Measures
Approaches to Media Sharing

Medium sharing techniques
Static / Semi-static Channelization Dynamic medium access control
Partition medium Dedicated allocation to users Satellite transmission Cellular Telephone
Scheduling
Random access
Polling: take turns Request for slot in transmission schedule Token ring Wireless LANs
Loose coordination Send, wait, retry if necessary Aloha Ethernet

45
08/29/11
Scheduling: Polling
Data from 1 from 2 Data Poll 1 Poll 2 1 2
Inbound line
Data to M
Host computer
Outbound line
3 M
Stations
Scheduling: Token-Passing
Ring networks
token
Data to M token
Station that holds token transmits into ring

Random Access
Multitapped Bus Crash!!
Transmit when ready Transmissions can occur; need retransmission strategy
08/29/11
48
Wireless LAN
AdHoc: station-to-station Infrastructure: stations to base station Random access & polling
08/29/11
49
Selecting a Medium Access Control

Applications
What type of traffic? Voice streams? Steady traffic, low delay/jitter Data? Short messages? Web page downloads? Enterprise or Consumer market? Reliability, cost
Scale
How much traffic can be carried? How many users can be supported?
Current Examples:
Design MAC to provide wireless DSL-equivalent access to rural communities Design MAC to provide Wireless-LAN-equivalent access to mobile users (user in car travelling at 130 km/hr)
08/29/11
50
Delay-bandwidth product key parameter
Delay-Bandwidth Product
Coordination in sharing medium involves using bandwidth (explicitly or implicitly) Difficulty of coordination commensurate with delaybandwidth product
Simple two-station example

Station with frame to send listens to medium and transmits if medium found idle Station monitors medium to detect collision If collision occurs, station that begin transmitting earlier retransmits (propagation time is known)
08/29/11
51
Two-Station MAC Example

Two stations are trying to share a common medium
A transmits at t = 0
Distance d meters tprop = d / seconds A B

B does not transmit before t = tprop & A captures channel B transmits before t = tprop and detects collision soon thereafter
Case 1
Case 2
A
A detects collision at t = 2 tprop
B B
08/29/11
52
Efficiency requiresTwo-Station Example of 2t of quiet time Each frame transmission

pp ro
Station B needs to be quiet tprop before and after time when Station A transmits; so, Waiting time=2tprop R transmission bit rate (Note is different from Effe. Throughput, Reff .) L bits/frame; Sending station requires X=L/R secs for transmitting its frame. Effe. Throughput is Actual rate (bps) at which info. sent over channel Efficiency is Normalized Maximum throughput (= Reff./R). Normalized delay-b/w product (a) = ratio of 1-way delay b/w product to avg. frame length.
MaxThrough put = Reff
Efficiency = max
Normalized Delay-Bandwidth Product
08/29/11
L 1 1 = = = L + 2t prop R 1 + 2t prop R / L 1 + 2a
L 1 = = R bits/secon d L / R + 2t prop 1 + 2a
a=
t prop L/R
Propagation delay Time to transmit a frame

53
Summary of Two Stations example

When a is much larger than 1, the medium can be used very efficiently by using the above protocol. If a = 0.01, then the efficiency = 1/1.02 = 0.98. As a becomes larger, channel becomes more inefficient. (if a=0.5, efficiency =0.5)
08/29/11
54
Typical MAC Efficiencies

Two-Station Example:
1 Efficiency = 1 + 2a
CSMA-CD (Ethernet) protocol:
1 Efficiency = 1 + 6.44a
Token-ring network
If a<<1, then efficiency close to 100% As a approaches 1, the efficiency becomes low
1 Efficiency = 1 + a
a= latency of the ring (bits)/average frame length
Distance
Typical Delay-Bandwidth Products

10 Mbps 100 Mbps 1 Gbps Network Type 1 m 3.33 x 10-02 3.33 x 10-01 3.33 x 100 Desk area network 100 m 3.33 x 1001 3.33 x 1002 3.33 x 1003 Local area network 10 km 3.33 x 1002 3.33 x 1003 3.33 x 1004 Metropolitan area network 1000 km 3.33 x 1004 3.33 x 1005 3.33 x 1006 Wide area network
100000 km 3.33 x 1006 3.33 x 1007 3.33 x 1008 Global area network
Max size Ethernet frame: 1500 bytes = 12000 bits Long and/or fat pipes give large a
MAC protocol features

Delay-bandwidth product Efficiency Transfer delay Fairness Reliability Capability to carry different types of traffic Quality of service Cost
08/29/11
MAC Delay Performance

Frame transfer delay Throughput
From first bit of frame arrives at source MAC To last bit of frame delivered at destination MAC Actual transfer rate through the shared medium Measured in frames/sec or bits/sec R bits/sec & L bits/frame X=L/R seconds/frame frames/second average arrival rate Load = X, rate at which work arrives Maximum throughput (@100% efficiency): R/L fr/sec
Parameters
08/29/11
58
E[T]/X
Normalized Delay versus Load

E[T] = average frame transfer delay X = average frame transmission time
1 Load
08/29/11
m a x
At low arrival rate, only frame transmission time At high arrival rates, increasingly longer waits to access channel Max efficiency typically less than 100%
59
Transfer delay
Dependence on Rtprop /L
E[T]/X
a > a a a
Transfer Delay
1 max Load
mx a
Delay Performance of Channelization Schemes
08/29/11
61
traffic onto a shared line Packets are encapsulated in frames and queued in a buffer prior to transmission Central control allows variety of service disciplines
Statistical Multiplexing & Random Access allows sharing of a broadcast Multiplexing concentrates bursty MAC
medium Packets are encapsulated in frames and queued at station prior to transmission Decentralized control wastes bandwidth to allow sharing
A Shared Medium
Buffer
R bps
C Input lines
08/29/11
R bps
C Input lines
62
Output line
Performance Issues in Statistical Multiplexing & Multiple Access

Application Properties How often are packets generated? How long are packets? What are loss & delay requirements?
System Performance Transfer Delay Packet/frame Loss Efficiency & Throughput Priority, scheduling, & QoS
A Shared Medium
Buffer
R bps
C Input lines
08/29/11
R bps
C Input lines
63
Output line
M/G/1 Queueing Model for Statistical Multiplexer

Poisson Arrivals rate
buffer
General service time X

server
Arrival Model
Independent frame interarrival times: Average 1/ Exponential distribution Poisson Arrivals
Frame Length Model

Independent frame transmission times X Average E[X] = 1/ General distribution Constant, exponential,
Load = /
Stability Condition: <1
Infinite Buffer
No Blocking
We will use M/G/1 model as baseline for MAC performance

M/G/1 Performance Results

Total Delay = Waiting Time + Service Time Average Waiting Time:
2 X E[W ] = (1 + ) E[ X ] 2 2(1 ) E[ X ]
(From Appendix A)
Average Total Delay: E[T ] = E[W ] + E[ X ] Example: M/D/1

E[W ] = E[ X ] 2(1 )
08/29/11
In M/G/1 model, a frame arriving to an empty multiplexer begins transmission immediately In many MACs, there is a delay before transmission can begin M/G/1 Vacation Model: when system empties, server goes away on vacation for random time V
M/G/1 Vacation Model
2 X E[V 2 ] E[W ] = (1 + ) E[ X ] + 2 2(1 ) E[ X ] 2 E[V ]
Extra delay term

Performance of FDMA & CDMA Channelization Bursty Traffic

1 2
R/M R/M Channelized Medium
R/M
M stations do not interact Poisson arrivals /M fr/sec Constant frame length L bits Transmission time at full rate X=L/R Station bit rate is R/M Neglect guardbands Transmission time from station L/(R/M)=M(L/R) =MX M times longer Load at one station: = ( / ) X= = X
08/29/11
...
67
Transfer Delay for FDMA and CDMA

ML/R ML/R ML/R ML/R
Time-slotted transmission from each station When station becomes empty, transmitter goes on vacation for 1 time slot of constant duration V=MX
V MX E[WFDMA ] = MX + = MX + 2(1 ) 2 2(1 ) 2

Average Total Transfer Delay is:
MX E[TFDMA ] = E[TFDMA ] + MX = MX + + MX 2(1 ) 2

The delay increases in proportion with M, the number of stations Allocated bandwidth to a given station is wasted when other stations have data to send
08/29/11
Transfer Delay of TDMA & CDMA

FDMA
Our frame arrives and finds two frames in queue First frame transmitted 0 3 Second frame transmitted 6 Our frame finishes transmission 9 t
TDMA
FDMA & TDMA have same waiting time
Our frame arrives and finds two frames in queue
Last TDMA frame finishes sooner Our frame finishes transmission
0 1 First frame transmitted

08/29/11
3 4 Second frame transmitted
69
Transfer Delay for TDMA

Time-slotted transmission from each station Same waiting time as FDMA
MX E[WTDMA ] = MX + 2(1 ) 2
Frame service time is X Average Total Transfer Delay is:
MX E[TTDMA ] = MX + +X 2(1 ) 2
Better than FDMA & CDMA Total Delay still grows proportional to M
TDMA Average Transfer Delay
08/29/11
71

Tdma Fdma Cdma

Diunggah oleh

Informasi Dokumen

Deskripsi Asli:

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Tdma Fdma Cdma

Diunggah oleh

Hak Cipta:

Format Tersedia

Communication Networks

Shared media basis for broadcast networks

Medium Access Control Protocols

Key issue: How to share the medium?

Shared multiple access medium

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Please Recall Multiplexing (As studied earlier) in the context of Switching

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Multiplexing (As covered earlier)

Trunk MUX group

3 pairs of users communicate using 3 separate set of wires

Frequency Division Multiplexing (As covered earlier)

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Time Division Multiplexing (As covered earlier)

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Multiplexing (As studied earlier) in the context of Switching

NOTE that: FDMA & TDMA are a

Generalization of FDM /TDM schemes

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

MAC: Channelization Schemes

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Approaches to Media Sharing

Partition medium Dedicated allocation to users Satellite transmission Cellular Telephone

Loose coordination Send, wait, retry if necessary Aloha Ethernet

Highly efficient for constant-bit rate traffic Preferred approach in

Considered as Static MAC algorithms

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Channelization: Why not ? Inflexible in allocation of bandwidth to users with different

Time Division Multiple Access (TDMA)

Code Division Multiple Access (CDMA)

Channelization: Time Division Multiple Access (TDMA)

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Code Division Multiple Access

Channels determined by a code used in modulation and demodulation

Stations transmit over entire frequency band all of the time!

CDMA Spread Spectrum Signal Transmitter from one user

R >> R1bps W >> W1 Hz

Unique user binary random sequence

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

CDMA Demodulationresidual Signal and

Correlate to user binary random sequence

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Pseudorandom pattern generator

The coefficients of a primitive generator polynomial determine the feedback taps

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Channelization in Code Space

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Example: CDMA with 3 users

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Sum signal is input to receiver

Codes for channels 1, 2 & 3: {-1,-1,-1,-1}, {-1, +1,-1,+1}, {-1,-1,+1,+1} respectively,

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Example: Receiver for Station 2

Codes for channels 1, 2 & 3: {-1,-1,-1,-1}, {-1, +1,-1,+1}, {-1,-1,+1,+1}

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

Channelization in Cellular Telephone Networks

Advanced Mobile Phone System

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA

AMPS Spectral Efficiency

AMPS spectrum efficiency: #calls/cell/MHz =395/(7*25) = 2.26 calls/cell/MHz

ECE C394 Communication Networks Topic 6: TDMA FDMA and CDMA