Chapter 1 Basic concepts of

wireless data networks (cont’d)

Part 2: Medium access methods for

mobile data networks

Sept 15 2004 1

Fixed assignment access schemes in

voice-oriented networks
„ Frequency division multiple access (FDMA)
„ Different users using different frequency channels
„ Time division multiple access (TDMA)
„ Different users using different time slots
„ Code division multiple access (CDMA)
„ Different users using different codes
„ Time division duplex (TDD)
„ The downlink and uplink of a connection use different time
slots
„ Frequency division duplex (FDD)
„ Uplink and downlink use different frequency channels

2
 Medium access schemes in voice-
oriented networks
A A
t t
uplink downlink FDMA/TDD
FDMA/FDD User 1 User 2
User 3 User 4

downlink
uplink
f
f1 f2 f3 f4 f
f1 f2 f3 f4
A t
t
A TDMA/TDD
uplink 1
downlink
TDMA/FDD downlink
t2 2
uplink
t1 f
f1 f2 f3 f4 f
f1 f2 f3 f4 3

Random access schemes in data

networks
„ Data traffic is bursty
„ Fixed assignment access scheme wastes
resources when traffic is bursty
„ Random access schemes more flexible
and efficient for data services
„ Contention among users for access

4
 Pure ALOHA
„ Operation:
„ When a packet arrives, it is encoded for error detection,
then transmitted.
„ At the receiver side, check the correctness when a
packet received. If error-free, an ACK sent back.
„ The sender will wait an amount of time for ACK. If
ACK received within this time interval, transmission is
successful.
„ If ACK is not received in time, delay a random amount
of time, then retransmit it.

An example of pure ALOHA

X T Successful transmission

User 1
X X Random delay
User 2
X X
User 3
X
User 4
2T
New packet
No other packet arrival
Rescheduled packet
T: time for sending a packet X: collision
6
Throughput of pure ALOHA
„ A packet is successfully transmitted if no other
packets arrive within one frame time of its start.
„ Poisson arrival with mean λ pkt/s, including new and
rescheduled packets
„ P(N pkt arrive in time t) = (λt)N e- λ t / N! , N = 0, 1, …
„ Time for sending one packet T is constant.
„ G= pkt sent per pkt time T= λ T
„ Throughput (pkt successfully sent per pkt time T)
−2 G
S = Ge
„ Smax=0.184 when G=0.5
„ Advantage: simple; disadvantage: low throughput

Slotted ALOHA
„ Time is divided into discrete time intervals,
each corresponding to one packet
transmission
„ Synchronization needed among different
geographically dispersed users
„ Operation
„ When a packet arrives, it will be sent at the
beginning of next time slot
„ If ACK received in time, successful. Otherwise,
delay this packet for a random interval and
retransmitted.
„ Slotted ALOHA is adopted in GPRS
8
 Operation of slotted ALOHA
Successful transmission
X
User 1
X X
User 2
X X X Random delay
User 3
X
User 4
T
New packet
No other packet arrival
Rescheduled packet
T: one time slot X: collision
9

Throughput of slotted ALOHA

„ A packet is successfully transmitted if no
other packets arrive in the same time slot
„ Poisson arrival with mean λ
„ Time for sending one packet T. G= λT
„ Throughput
S = Ge − G
„ Smax=0.368 when G=1
„ Twice the throughput of pure ALOHA (or is it
really twice?)

10
Dynamic slotted ALOHA
„ Full duplex communication in Mobitex: BS
and mobile can transmit simultaneously
„ Mobile can only transmit during certain free
cycles consisting of several random slots that
are periodically initiated by BS
„ Long messages are transmitted in reserved
time slots.

11

Dynamic slotted ALOHA (cont’d)

„ Operation:
„ BS sends a free message to indicate a number of
random slots for MS to send requests.
„ MS having requests to send chooses one of these
random time slots to send request.
„ If the request is received by BS without collision,
an Access Grant packet is sent by the BS to the
MS indicating the reserved time slots for sending
information message.
„ MS sends the information message in the reserved
time slot.

12
 An example of dynamic slotted
ALOHA
Free Free
AG to MS2 ACK to MS2

Message to MS3

BS 1 2 3 4 5

MS Message from MS2

MS1 MS2 ACK from MS3

ƒOne message to MS3

ƒMS1 and MS2 want to send requests to BS
ƒAccess grant is given to MS2
ƒMS2 then sends packet to BS in reserved time slot
13

Operation of this example

„ BS sends a Free message indicating 5 random slots
available
„ BS sends a message to MS3 during these random
slots (in downlink channel)
„ MS1 and MS2 want to send requests to BS during
these random slots. They randomly choose one of
these 5 random slots to send requests.
„ MS1 chooses slot 1 and MS2 chooses slot 3.
„ These requests are received without collision by BS.
Access Grant is given to MS2.
„ MS2 sends message in reserved slot.
„ BS sends ACK to MS2 indicating the success of the
sent message.
14
 Carrier sense multiple access (CSMA)
„ Reason: the efficiency of ALOHA is too low as
each station operates independently. By
sensing channel status, collision can be
significantly reduced.
„ Operation:
„ Before sending packet, the MS senses if the
channel is idle.
„ If idle, send packet. Otherwise, delay using a
back-off algorithm, then sense the channel again.
„ If packet collides, reschedule as in ALOHA.
(Why would packets collide with sensing?)

15

An example of CSMA
X
User 1

User 2
X
User 3

New packet
Reschedule delay
Delayed packet
Busy delay
Packet arrival Rescheduled packet
X: collision
16
 Variations of CSMA
„ Non-persistent CSMA: after sensing channel is busy,
delay a certain amount of time before sensing the
channel again.
„ 1-persistent CSMA: after sensing the channel is busy,
continues sensing the channel until the channel is
idle and then sends the packet
„ p-persistent CSMA (for slotted channel): after sensing
the channel is busy, continues sensing the channel
until it is idle. Then the packet is sent with probability
p.
delay
Non-persistent
Channel busy

ready 1-persistent 17
p-persistent

Throughput of CSMA
G[1 + G + aG (1 + G + aG / 2)]e − G (1+ 2 a )
„ Unslotted, 1-persistent: S=
G (1 + 2a ) − (1 − e − aG ) + (1 + aG )e −G (1+ a )

[ ]
G 1 + a − e − aG e −G (1+ a )
„ Slotted, 1-persistent: S=
(1 + a )(1 − e − aG ) + ae −G (1+ a )

Ge − aG
S=
„ Unslotted, non-persistent: G (1 + 2a) + e − aG

aGe − aG
„ Slotted, non-persistent: S=
1 − e − aG + a
G: the same as in ALOHA
a= τ/TP
τ: maximum propagation delay
TP: packet transmission time 18
 Comparison

Throughput versus offered traffic load for various

19
random access protocols

Comparison (cont’d)

Capacity versus normalized delay for various random access protocols

20
Comparison (cont’d)

Delay-throughput behavior of random access protocols

21

CSMA/CA (collision avoidance)

„ Adopted by IEEE 802.11 WLAN
„ Operation:
„ Step 1: When packet arrives, sense the channel. If
it is idle, send packet; otherwise, choose a back-
off time delay randomly. Then continues sensing
the channel.
„ Step 2: When channel becomes idle, delay an IFS
(interframe spacing). Then count down the back-
off delay.
„ Step 3: If channel remains idle until the delay is 0,
send packet.
„ If channel becomes busy during delay count-
down, freeze the delay and continues sensing the
channel. Go to Step 2. 22
 An example of CSMA/CA
IFS IFS IFS IFS

A Frame

Frame
B
Frame
C

Frame
D

Frame
E
CW CW CW CW

Delay after packet ready Back off Remaining back-off

23

Complications caused by wireless

channel
„ Hidden terminal problem: two nodes are too
far away that they cannot sense the
transmission of each other and cause
collision. Throughput is decreased

24
 Complications (cont’d)
„ Capture effect: when two nodes are trying to send
packets simultaneously, and the distances to the
receiver are different, the packet sent by the closer
node may be correctly received, and performance
may be improved.

25

Impact of capture effect

26
Impact of capture effect on throughput, BPSK modulation and SNR=20dB
 Impact of capture effect (cont’d)

Delay versus throughput of CSMA for BPSK modulation and SNR=20dB

27

Impact of hidden terminals

Mobile terminal
Access point

Area 1
Area 2

Area 1 carrier sensible by red mobile terminal

Area 2 carrier non-sensible by red mobile
terminal, but still within coverage area of AP
=> hidden terminal effect

Coverage areas of an AP and a mobile terminal in a WLAN

28
Impact of hidden terminals (cont’d)

With capture
RMS< RBS

RMS= RBS

Without capture

RMS: radius of the coverage of MS

RBS : radius of the coverage of BS
29

Providing data services in voice-

oriented networks
„ Two reasons for providing data services
in voice-oriented networks (to improve
efficiency and save cost):
„ Some portion of unused resources can be
used by data users
„ Short pauses in voice channel can be used
for data services

30
 Providing data services in FDMA
system
„ CDPD (cellular digital packet data) packet
data system uses available frequency channel
in existing analog FDMA cellular phone
network (AMPS)
„ Data rate<=19.2kbps
„ Idle frequency channels are used for data services
„ Talk pauses not exploited
„ Frequency hopping allowed to release current
channel to voice users
„ Only one frequency channel for one data user:
data rate limited

31

Average number of idle channels in

FDMA system

„ Required call blocking lower, more available channels for

data services
„ For 1% call blocking and 15 channels, 7 available 32
 Average channel AMPS idle period

„ Higher call blocking requirement, longer idle period

33

Providing data services in TDMA

system
„ GPRS in GSM
„ Unused time slots are assigned for data
services
„ Multiple time slot assignment possible to
increase data rate
„ Talk pause not exploited

34
Movable boundary TDMA scheme with
silence detection
„ Some slots dedicated for data services only
„ Remaining slots shared by data and voice
users, with voice users having higher priority
„ Movable boundary. When the number of
voice users increases, the number of
dedicated slots for data decreases
Movable boundary

Voice slots data slots Voice slots data slots

frame frame
35

Providing data services in CDMA system

„ Data services in 3G
„ Integration of data and voice services
„ Assign multiple parallel channels or reduce
processing gain, data rate increased

36