RAVI SHARMA (KCS-711) Mobile Computing

Wireless Networking
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

1
 IEEE 802 Family (of Standards)
RAVI SHARMA (KCS-711) Mobile Computing
• It is a family of standards created by IEEE for LAN / PAN / MAN
R Anetworks.
VI SHARMA (KCS-711) Mobile Computing

• Over the years, it has developed over 24 standards (and their sub-
standards) ranging from 802.1 to 802.24
•R AFew
V I SofH the
ARM A ( K Cones
notable S - 7 1are:
1) Mobile Computing

– IEEE 802.3: Ethernet

– IEEE 802.11: Wireless LAN (WLAN)
– IEEE 802.15.1: Bluetooth
RAVI SHARMA (KCS-711) Mobile Computing
• Following the protocols stack of OSI model, service and protocols of
IEEE 802 map to its two lower layers:
– Data Link (IEEE 802 further subdivides this layer into the following layers)
RAVI SHARMA (KCS-711) Mobile Computing
• LLC (Logical Link Control)
• MAC (Medium Access Control)
– Physical 2
 Wireless LAN: IEEE 802.11
RAVI SHARMA (KCS-711) Mobile Computing
• It is a part of LAN Standards of IEEE 802 family of standards.
RAVI SHARMA (KCS-711) Mobile Computing
• IEEE 802.11 specifies PHY (Physical Layer) and MAC (Media Access
Control) layers for the implementation of Wireless Local Area Network
(WLAN) communication.

•R AThe
V I base
S H Aversion
R M A (standard
K C S - 7 1was
1 ) released in 1997.M o b i l e C o m p u t i n g

• Most popular frequencies used by IEEE 802.11 are:

– 2.4 GHz, 5 GHz, 6 GHz

•R AIEEE
VI SHARMA (KCS-711) Mobile Computing
802.11 is used in most home and office networks to allow laptops,
printers, smartphones, and other devices to communicate with each
other and access the Internet without connecting wires.

•R AThe
V I standards
S H A R M Aare
( Kcreated
C S - 7 1 and
1 ) maintained by M
theo bInstitute
i l e C oof
mpElectrical
uting
and Electronics Engineers (IEEE) LAN/MAN Standards Committee (IEEE
802). 3
 Advantages of WLAN
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

• Flexibility: Within radio coverage, nodes can communicate without further
restriction. Radio waves can penetrate walls, senders and receivers can be placed
anywhere (also non-visible, e.g., within devices, in walls etc.).
RAVI SHARMA (KCS-711) Mobile Computing

• Planning: Only wireless ad-hoc networks allow for communication without

previous planning, any wired network needs wiring plans.
RAVI SHARMA (KCS-711) Mobile Computing
• Design: Wireless networks allow for the design of independent, small devices
which can for example be put into a pocket. Cables not only restrict users but
also designers of small notepads, PDAs, etc.
RAVI SHARMA (KCS-711) Mobile Computing

4
 Advantages of WLAN
RAVI SHARMA (KCS-711) Mobile Computing
• Robustness: Wireless networks can handle disasters, e.g., earthquakes, flood etc.
RAVI SHARMA (KCS-711) Mobile Computing
whereas, networks requiring a wired infrastructure will usually break down
completely in disasters.

• Cost: The cost of installing and maintaining a wireless LAN is on average lower
RAVI SHARMA (KCS-711) Mobile Computing
than the cost of installing and maintaining a traditional wired LAN, for two
reasons. First, after providing wireless access to the wireless network via an
access point for the first user, adding additional users to a network will not
RAVI SHARMA (KCS-711) Mobile Computing
increase the cost. And second, wireless LAN eliminates the direct costs of cabling
and the labor associated with installing and repairing it.

•R AEase
V I SofH Use:
A R MWireless
A ( K C LAN
S - 7 is
1 1easy
) to use and the Musers
o b i need
l e Cvery
o m plittle
u t inew
ng
information to take advantage of WLANs.
5
 Disadvantages of WLAN
RAVI SHARMA (KCS-711) Mobile Computing
• Quality of Services: Quality of wireless LAN is typically lower than wired networks. The
RAVI SHARMA (KCS-711) Mobile Computing
main reason for this is the lower bandwidth due to limitations is radio transmission, higher
error rates due to interference and higher delay/delay variation due to extensive error
correction and detection mechanisms.

•R AProprietary
V I S H A RSolutions:
M A ( K Due
C S -to7 1slow
1 ) standardization procedures,
M o b i l many
e C ocompanies
m p u t i nhave
g

come up with proprietary solutions offering standardization functionality plus many

enhanced features. Most components today adhere to the basic standards IEEE 802.11a or
R A802.11b.
VI SHARMA (KCS-711) Mobile Computing

• Restrictions: Several govt. and non-govt. institutions world-wide regulate the operation and
restrict frequencies to minimize interference.
RAVI SHARMA (KCS-711) Mobile Computing
• Global operation: Wireless LAN products are sold in all countries so, national and
international frequency regulations have to be considered.
6
 Disadvantages of WLAN
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

• Low Power: Devices communicating via a wireless LAN are typically power consuming, also
wireless devices running on battery power. Whereas the LAN design should take this into
account and implement special power saving modes and power management functions.

•R ALicense
VI SH A Roperation:
free M A ( KLANC S operators
- 7 1 1 ) don't want to apply M
foroa bspecial
i l e license
C o m to
p ubet able
i n g to

use the product. The equipment must operate in a license free band, such as the 2.4 GHz
ISM band.
RAVI SHARMA (KCS-711) Mobile Computing
• Robust transmission technology: If wireless LAN uses radio transmission, many other
electrical devices can interfere with them (such as vacuum cleaner, train engines, hair
dryers, etc.).Wireless LAN transceivers cannot be adjusted for perfect transmission is a
R Astandard
V I S Hoffice
A R MorAproduction
( K C S - environment.
711) Mobile Computing

7
 Architecture of WLAN (PHY layer)
RAVI SHARMA (KCS-711) Mobile Computing

R A V I S H A R M A ( K C S - 7 1IEEE
1 ) 802.11 (WLAN) Mobile Computing
BSS-1

ESS
STA-1 STA-2
R A V I S H A R M A ( K C S - 7 1Access
1) Point Mobile Computing

Distribution System
RAVI SHARMA (KCS-711) Mobile Computing

Access Point
STA-3 STA-4

RAVI SHARMA (KCS-711) Mobile Computing

BSS-2
IEEE 802.11 (WLAN)
8
 Components of WLAN Architecture
RAVI SHARMA (KCS-711) Mobile Computing

Stations:
RAVI SHARMA (KCS-711) Mobile Computing

• All components that can connect into a wireless medium in a network are
referred to as stations. All stations are equipped with wireless network interface

R Acontrollers.
VI SHARMA (KCS-711) Mobile Computing
• Wireless stations fall into two categories:
– Wireless access points (WAPs)
R A V I S• HWAPs
ARM areA base
( K stations
C S - 7 1for1 )the wireless network. M o btransmit
They i l e Cand
o mreceive
p u t iradio
ng
frequencies for wireless-enabled devices to communicate with.

– Clients
• Wireless clients can be mobile devices such as laptops, personal digital assistants, VoIP
RAVI SHARMA (KCS-711) Mobile Computing
phones and other smartphones, or non-portable devices such as desktop computers,
printers, and workstations that are equipped with a wireless network interface.
9
 Components of WLAN Architecture
RAVI SHARMA (KCS-711) Mobile Computing
Service set:
RAVI SHARMA (KCS-711) Mobile Computing
• The Basic Service Set (BSS) is a set of all stations that can communicate with each
other at PHY layer.
– Every BSS has an identification (ID) called the BSSID, which is the MAC address of the
access point servicing the BSS.
RAVI SHARMA (KCS-711) Mobile Computing
– There are two types of BSS:
• Independent BSS (also referred to as IBSS)
• Infrastructure BSS

• An Extended Service Set (ESS) is a set of connected BSSs. Access points in an ESS
RAVI SHARMA (KCS-711) Mobile Computing
are connected by a distribution system. Each ESS has an ID called the SSID which
is a 32-byte (maximum) character string.

AR ADistribution
V I S H A R System
M A ( K(DS)
C S - connects
711) access points in
M an
o bextended
i l e C o mservice
p u t i nset.
g
The concept of a DS can be used to increase network coverage through
roaming between cells. DS can be wired or wireless. 10
 WLAN Modes
RAVI SHARMA (KCS-711) Mobile Computing
• Stations/Hosts associated with an AP/BS are often referred to as
RAVI SHARMA (KCS-711) Mobile Computing
operating in Infrastructure mode.
– Since all traditional network services (e.g., address assignment and routing)
are provided by the network to which a Station/Host is connected via the
RAVI SHARMA (KCS-711) Mobile Computing
AP/BS.

• Stations/Hosts having no such infrastructure with which to connect

R Aare
V I often
S H A Rreferred
M A ( K to
C S as
- 7operating
11) Mobile Computing
in Ad hoc mode.
– In the absence of such infrastructure, the Stations/Hosts themselves must
provide for services such as routing, address assignment, DNS-like name
RAVI SHARMA (KCS-711) Mobile Computing
translation, and more.

11
 WLAN MAC Layer
RAVI SHARMA (KCS-711) Mobile Computing
• IEEE 802.11 MAC sub-layer is responsible for coordinating access to the
RAVI SHARMA (KCS-711) Mobile Computing
shared physical air interface so that the Access Point (AP) and stations in
range can communicate effectively.

• Operation of MAC layer is divided into two categories:

RAVI SHARMA (KCS-711) Mobile Computing
– Distributed Coordination Function (DCF)
• Stations contend for access to medium
• Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)
R A V– I Point
S H ACoordination
R M A ( K C Function
S - 7 1 1 )(PCF) Mobile Computing
• Built on DCF
• Allows periods of contention-free operation interleaved with periods of
contention
• One station (typically AP) polls others to control who transmits
RAVI SHARMA (KCS-711) Mobile Computing
• Permits more efficient operation under heavy loads

12
 Multiple Access Protocols
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

13
 TDMA
RAVI SHARMA (KCS-711) Mobile Computing
In the cases where continuous transmission is not required, TDMA is used
instead
R A V I SofHFDMA.
A R M AThe
( Kfeatures
C S - 7 1 of
1 )TDMA include theMfollowing.
obile Computing

• TDMA shares a single carrier frequency

with several users where each users
makes use of non-overlapping time slots.
• Data transmission in TDMA is not
R AVI SHARMA (KCS-711) Mobile Computing
continuous, but occurs in bursts. Hence
hand-off process is simpler.
• TDMA uses different time slots for
transmission and reception thus duplexers
R Aare
V I not
S required.
HARMA (KCS-711) Mobile Computing
• TDMA has an advantage that is possible to
allocate different numbers of time slots
per frame to different users.
• Bandwidth can be supplied on demand to
R Adifferent
V I S H Ausers
R M A by( Kconcatenating
C S - 7 1 1 ) or Mobile Computing
reassigning time slot based on priority.
14
 FDMA
RAVI SHARMA (KCS-711) Mobile Computing
FDMA is the basic technology for advanced mobile phone services. The
features
R A V I Sof
HAFDMA
R M Aare
( KasC follows:
S-711) Mobile Computing
• FDMA allots a different sub-band of
frequency to each different user to access
the network.
RAVI SHARMA (KCS-711) Mobile Computing
• If FDMA is not in use, the channel is left
idle instead of allotting to the other users.

• FDMA is implemented in Narrowband

R A systems
V I S Hand
A RitM A (complex
is less K C S - 7than
1 1TDMA.
) Mobile Computing

• Tight filtering is done here to reduce

adjacent channel interference.
R
• A The
V I base
S H station
A R M BSA and
( K Cmobile
S - 7 1station
1 ) MS, Mobile Computing

transmit and receive simultaneously and

15
continuously in FDMA.
 CDMA
RAVI SHARMA (KCS-711) Mobile Computing
• CDMA is a spread-spectrum multiple-
RAVI SHARMA (KCS-711) Mobile Computing
access technique.
• A spread-spectrum technique spreads the
bandwidth of the data uniformly for the
same transmitted power.
•R AThis
V I SisH done
A R M Aby ( Kassigning
C S - 7 1 1 each
) user a Mobile Computing
different Pseudo Random Code to
modulate their signal.

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

16
 CDMA Question
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Suppose that A,B,C are simultaneously transmitting 0 bits,

using CDMA system with following sequences:
RA
A V =I S( -H1A-R1M
- 1A +(1K+C 1S -- 17 1+11)+ 1 ) Mobile Computing

B = (-1-1+1-1+1+1+1-1)
RC
A V=I (S -H1A+R1M- A
1 +( 1K +C S1-+711 -11) - 1 ) Mobile Computing

What is the resulting chip sequence?

RAVI SHARMA (KCS-711) Mobile Computing

17
 CDMA Question: Idea
RAVI SHARMA (KCS-711) Mobile Computing
• Chip Sequence
RAVI SHARMA (KCS-711) M o b i l e C Bipolar
omputing
• Pseudo Random Code
NODE Notation
• Pseudo Noise
(Chip Vector)
• Pseudo Random Noise (PRN) Code
RAVI SHARMA (KCS-711) Mobile Computing
X 001 (-1,-1,+1)
Y 010 (-1,+1,-1)
RAVI SHARMA (KCS-711) Mobile Computing
Z 100 (+1,-1,-1)

1
RAVI SHARMA (KCS-711) +1 0 -1
Mobile Computing

18
 CDMA Question: Idea
RAVI SHARMA (KCS-711) Mobile Computing
• These Chip Sequences (CS) / PRN codes are chosen such that, they
RAVI SHARMA (KCS-711) Mobile Computing
are pairwise orthogonal.
– In other words, their inner-product / dot-product is zero

•R AThus,
V I Sfor
H Athe
R M given
A ( K scenario:
CS-711) Mobile Computing
– CS of X = 𝐶𝑆𝑋 = 001 ≡ −1, −1, +1
– CS of Y = 𝐶𝑆𝑌 = 010 ≡ (−1, +1, −1)
– CS of Z = 𝐶𝑆𝑍 = 100 ≡ (+1, −1, −1)
RAVI SHARMA (KCS-711) Mobile Computing

• It is evident now that:

– < 𝐶𝑆𝑋 , 𝐶𝑆𝑌 > = 0
R A –V I< S𝐶𝑆
H𝑌A, 𝐶𝑆
RM𝑍 >
A =( 0
KCS-711) Mobile Computing
– < 𝐶𝑆𝑋 , 𝐶𝑆𝑍 > = 0
19
 CDMA Question: Transmission
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Transmission
Bipolar
Chip 1’s Complement
NODE Notation
Sequence
(Chip Vector) 0 1
RAVI SHARMA (KCS-711) Mobile Computing

110 001
X 001 (-1,-1,+1)
(+1,+1,-1) (-1,-1,+1)
RAVI SHARMA (KCS-711) Mobile Computing
101 010
Y 010 (-1,+1,-1)
(+1,-1,+1) (-1,+1,-1)
011 100
Z 100
RAVI SHARMA (KCS-711)
(+1,-1,-1) Mobile Computing
(-1,+1,+1) (+1,-1,-1)
20
 CDMA Question: Example
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Bipolar Simultaneous Transmission
NODE CS Notation
Transmitted Corresponding
(Chip Vector)
RAVI SHARMA (KCS-711) Bit M o b i l e C o mCSp u t i n g
X 001 (-1,-1,+1) 0 (+1,+1,-1)
Y 010 (-1,+1,-1)
RAVI SHARMA (KCS-711) 1 (-1,+1,-1)
Mobile Computing

Z 100 (+1,-1,-1) 0 (-1,+1,+1)

Resulting Chip Sequence (R)
RAVI SHARMA (KCS-711)
(-1,+3,-1)
Mobile Computing

21
 CDMA Question: Recovery
RAVI SHARMA (KCS-711) Mobile Computing
• Resulting Chip Sequence 𝑅 = (−1, +3, −1)
RAVI SHARMA (KCS-711) Mobile Computing

• Observe the following calculations:

– < 𝐶𝑆𝑋 , 𝑅 > = −1, −1, +1 ⋅ −1, +3, −1 = 1 − 3 − 1 = −3
R A –V INormalize:
SHARMA (KCS-711) Mobile Computing
< 𝐶𝑆𝑋 , 𝑅 >
= −1 ⇒ 0
< 𝐶𝑆𝑋 , 𝑅 >

•R ACalculate
V I S H A Rfor
M the
A (Kfollowing:
CS-711) Mobile Computing
– < 𝐶𝑆𝑌 , 𝑅 > = 0
– < 𝐶𝑆𝑍 , 𝑅 > = 0

RAVI SHARMA (KCS-711) Mobile Computing

22
 Advantages of CDMA
RAVI SHARMA (KCS-711) Mobile Computing
• As the CDMA signal is spread using a pseudo-random code; it makes the
R Aspread-spectrum
V I S H A R M A (signals
K C S - 7appear
1 1 ) random or have
M noise-like
o b i l e C properties.
omputinA g
receiver cannot demodulate this transmission without the knowledge of
the pseudo-random sequence used to encode the data.

•R ACDMA
V I S HisA also
R M Aresistant
( K C S - to
7 1 jamming.
1) A jammingM signal
o b i l eonly
C o has
mpa u tfinite
ing
amount of power available to jam the signal. The jammer can either
spread its energy over the entire bandwidth of the signal or jam only part
of the entire signal.
RAVI SHARMA (KCS-711) Mobile Computing

• CDMA signals are also resistant to multipath fading. Since the spread-
spectrum signal occupies a large bandwidth, only a small portion of this
will undergo fading due to multipath at any given time. Like the narrow-
R Aband
V I S interference,
H A R M A ( Kthis
C S -will
7 1 result
1) in only a smallM loss
o b i of
l e data
Com p ucan
and t i nbe
g
overcome.
23
Disadvantage of CDMA: near-far problem
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

24
Disadvantage of CDMA: near-far problem
RAVI SHARMA (KCS-711) Mobile Computing
• In CDMA, the receiver performs a time correlation operation to detect
R Aonly
V I Sthe
H A specific
R M A ( desired
K C S - 7 1code-words.
1) M ocode-words
All other b i l e C o mappear
p u t i nas
g
noise due to de-correlation.
• In CDMA, the power of multiple users at a receiver determines the noise
floor after de-correlation. If the power of each user within a cell is not
R Acontrolled
V I S H A Rsuch
M A that
( K C they
S - 7 1do
1 )not appear equalMato the
b i l eBase
C o Station
m p u t i(BS)
ng
receiver, then the near-far problem occurs.
• The near-far problem occurs when many mobile users share the same
channel. In general the strongest received mobile signal will capture the
R Ademodulator
V I S H A R M at
A a( BS.
KCS-711) Mobile Computing
• In CDMA, the stronger received signal levels raise the noise floor at the
BS demodulators for the weaker signals, thereby decreasing the
probability that weaker signals will be received.
RAVI SHARMA (KCS-711) Mobile Computing
To combat the near-far problem, power control is used in most
CDMA implementations. 25
 Solution to near-far problem
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

• Power control is provided by each BS in a cellular system and
assures that each mobile within the its coverage area provides the
same signal level to the BS receiver.
RAVI SHARMA (KCS-711) Mobile Computing

• This solves the problem of a nearby subscriber overpowering the BS

receiver and drowning out the signals of far away subscribers.
RAVI SHARMA (KCS-711) Mobile Computing
• Power control is implemented at the BS by rapidly sampling the
Received Signal Strength Indicator (RSSI) levels of each mobile and
then sending a power change command over the forward radio link.
RAVI SHARMA (KCS-711) Mobile Computing

26
 TDMA / FDMA / CDMA
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

27
Carrier Sense Multiple Access (CSMA)
RAVI SHARMA (KCS-711) Mobile Computing

•R AUnder
V I S H CSMA,
A R M A a( Ktransmitter
C S - 7 1 1 ) uses a carrier-sense
M o b i l e mechanism
C o m p u t i nto
g
determine whether another transmission is in progress before
initiating a transmission.
– That is, it tries to detect the presence of a carrier signal from another node
R A V I before
S H A attempting
R M A ( K CtoS transmit.
-711) Mobile Computing

• If a transmission is sensed, the node waits for it to end before

initiating its own transmission.
RAVI SHARMA (KCS-711) Mobile Computing

• Variations on basic CSMA include addition of:

– Collision Detection (CSMA/CD)
R A V– I Collision
SHARM A ( K C S(CSMA/CA)
Avoidance -711) Mobile Computing
– Collision Resolution (CSMA/CR)
28
 CSMA Modes
RAVI SHARMA (KCS-711) Mobile Computing
• Variations of CSMA use different algorithms to determine when to initiate
RAVI SHARMA (KCS-711) Mobile Computing
transmission onto the shared medium.

• A key distinguishing feature of these algorithms is how aggressive or persistent

they are in initiating transmission.
RAVI SHARMA (KCS-711) Mobile Computing
• A more aggressive algorithm may begin transmission more quickly and utilize a
greater percentage of the available bandwidth of the medium.

• This is typically at the expense of an increased likelihood of collision with other

RAVI SHARMA (KCS-711) Mobile Computing
transmitters.

• There are 4 types of channel access modes available in CSMA:

1. 1-Persistent
R A 2.
VI SHARMA (KCS-711)
Non-Persistent Mobile Computing
3. P-Persistent
4. O-Persistent 29
 CSMA Modes
RAVI SHARMA (KCS-711) Mobile Computing
• 1-persistent CSMA
RAVI SHARMA (KCS-711) Mobile Computing

– It is an aggressive transmission algorithm.

R A V–I When
S H A Rthe
M A transmitting
( K C S - 7 1 1 node
is ready toMtransmit,
) o b i l e Cito senses
m p u t i the
ng
transmission medium for idle or busy.
• If idle, then it transmits immediately.
• If busy, then it senses the transmission medium continuously until it
R A V I S Hbecomes
A R M A idle,
( K Cthen
S - 7transmits
11) the message (aMframe)
o b i l unconditionally
e C o m p u t i (i.e.
ng
with probability=1).

– In case of a collision, the sender waits for a random period of

RAVI SHARMA (KCS-711) Mobile Computing
time and attempts the same procedure again. 1-persistent
CSMA is used in CSMA/CD systems including Ethernet.
30
 CSMA Modes
RAVI SHARMA (KCS-711) Mobile Computing
• Non-persistent
RAVI SHARMA (KCS-711) Mobile Computing

– It is a non-aggressive transmission algorithm.

R A V–I When
S H A Rthe
M Atransmitting
( K C S - 7 1 1 node
is ready to transmit
) M o b i l e data,
C o m it
p usenses
ting
the transmission medium for idle or busy.
• If idle, then it transmits immediately.
• If busy, it jumps to the final random waiting step of 1-persistent CSMA
R A V I S Hdirectly
A R M Abefore
( K Crepeating
S - 7 1 1 )the whole logic cycle
M oagain:
b i l eit does
C o mnot
p u persist
ting
in checking the busy channel trying to get its transmission through,
hence the name.

RAVI SHARMA (KCS-711) Mobile Computing

– This approach reduces the chance of collision and results in
overall higher medium throughput but with a penalty of longer
initial delay compared to 1–persistent. 31
 CSMA Modes
RAVI SHARMA (KCS-711) Mobile Computing
• P-persistent
RAVI SHARMA (KCS-711) Mobile Computing
– This approach lies between the 1-persistent and non-persistent CSMA access
modes.
– When the transmitting node is ready to transmit data, it senses the
transmission medium for idle or busy.
R A V I S• HIf Aidle,
RM then
A it( transmits
K C S - 7 1immediately.
1) Mobile Computing
• If busy, then it senses the transmission medium continuously until it becomes idle,
then transmits with probability p. If the node does not transmit (the probability of
this event is 1-p), it waits until the next available time slot.
• If the transmission medium is not busy, it transmits again with the same
R A V I S Hprobability
A R M A p.( K C S - 7 1 1 ) Mobile Computing
• This probabilistic hold-off repeats until the frame is finally transmitted or when
the medium is found to become busy again (i.e. some other node has already
started transmitting).

RAVI SHARMA (KCS-711) Mobile Computing

P-persistent CSMA is used in CSMA/CA systems including Wi-Fi and other
packet radio systems. 32
 CSMA Modes
RAVI SHARMA (KCS-711) Mobile Computing
•R AO-persistent
VI SHARMA (KCS-711) Mobile Computing
– In this approach each node is assigned a transmission order by a supervisory
node.

R A V– I When
S H A the
R Mtransmission
A ( K C S - 7 medium
11) goes idle, nodes
M wait
o b i lfor
e their
C o mtime
p u tslot
i n gin
accordance with their assigned transmission order.

– The node assigned to transmit first transmits immediately.

R A V– I The
S Hnode
A R Massigned
A ( K C to
S - transmit
7 1 1 ) second waits oneMtime
o b islot
l e (but
Com bypthat
u t i time
ng

the first node has already started transmitting).

– Nodes monitor the medium for transmissions from other nodes and update
R A V I their
S H Aassigned
R M A (order
K C S -with
7 1 1each
) M o b i l(i.e.
detected transmission e Cthey
o m pmove
u t i none
g

position closer to the front of the queue).

33
 CSMA/CA: Collision Avoidance
RAVI SHARMA (KCS-711) Mobile Computing
• In CSMA/CA, nodes attempt to avoid collisions by beginning transmission only
R Aafter
V I Sthe
H Achannel
R M A is( Ksensed
C S - 7to
1 1be) "idle“. When they M
doo transmit,
b i l e C nodes
o m p utransmit
ting
their packet data in its entirety.

• Process:
1. If initially the station senses the channel idle, it transmits its frame after a short period
R A V I ofS time
H A Rknown
M A as( Kthe
C Distributed
S - 7 1 1 ) Inter-frame Space (DIFS)
Mobile Computing
2. Otherwise, the station chooses a random back-off value and counts down this value
when the channel is sensed idle.
• While the channel is sensed busy, the counter value remains frozen.
3. When the counter reaches zero (note that this can only occur while the channel is
R A V I sensed
S H A Ridle),
M A the( K Cstation
S - 7 1 transmits
1) the entire frame
M o b and
i l e then
Com waits
p u tfor
i n gan
acknowledgment.
4. If an acknowledgment is received, the transmitting station knows that its frame has
been correctly received at the destination station. If the station has another frame to
send, it begins the CSMA/CA protocol at step 2.
R A V5.I IfSthe
H Aacknowledgment
R M A ( K C S -isn’t7 1 received,
1) M station
the transmitting o b i l ere-enters
C o m the
p u back-off
ting
phase in step 2, with the random value chosen from a larger interval.
34
CSMA/CA: Collision Avoidance
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

35
 Hidden Node/Terminal Problem
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

A B C
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

36
 Hidden Node/Terminal Problem
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

The problem is when nodes A and C start to send packets
simultaneously to the access point B.

•R ABecause
V I S H the
ARM nodes
A (A K Cand
S -C
7 1cannot
1) receive each other's
M o bsignals,
i l e C so
o mthey
p u cannot
ting
detect the collision before or while transmitting,

• CSMA/CD does not work, and collisions occur, which then corrupt the data
R Areceived
V I S H by
A Rthe
M Aaccess
( K Cpoint.
S-711) Mobile Computing

• Methods that can be employed to solve hidden node problem are :

– Increase transmitting power from the nodes
R A V– I Remove
S H A Robstacles
MA (KCS-711) Mobile Computing
– Move the node
– Protocol Enhancement 37
 Exposed Node/Terminal Problem
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

38
 Exposed Node/Terminal Problem
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

If a transmission between S1 and R1 is taking place, node S2 is
prevented from transmitting to R2 as it concludes after carrier sense
that it will interfere with the transmission by its neighbour S1.
RAVI SHARMA (KCS-711) Mobile Computing

• However note that R2 could still receive the transmission of S2 without

interference because it is out of range of S1.
RAVI SHARMA (KCS-711) Mobile Computing
• RTS/CTS mechanism helps to solve this problem only if the nodes are
synchronized and packet sizes and data rates are the same for both the
transmitting nodes.
RAVI SHARMA (KCS-711) Mobile Computing
• Multiple Access with Collision Avoidance (MACA) is one such protocol that uses
RTS/CTS mechanism to avoid hidden and exposed terminal problem. 39
 MACA: Multiple Access with Collision Avoidance
RAVI SHARMA (KCS-711) Mobile Computing

Process:
RAVI SHARMA (KCS-711) Mobile Computing
• A network node makes an announcement before it sends the data frame to
inform other nodes to keep silent.

•R AWhen
V I S aH node
A R Mwants
A ( K to
C Stransmit,
- 7 1 1 ) it sends a signal called
M o b Request-To-Send
i l e C o m p u t i(RTS)
ng
with the length of the data frame to send.

• If the receiver allows the transmission, it replies the sender with a signal called
R AClear-To-Send
V I S H A R M(CTS)
A ( with
K C S the
- 7 1length
1 ) of the frame thatMis oabout
b i l eto C
receive.
omputing

• When a station overhears an RTS addressed to another station, it inhibits its own
transmitter long enough for the addressed station to respond with a CTS.
RAVI SHARMA (KCS-711) Mobile Computing
• When a station overhears a CTS addressed to another station, it inhibits its own
transmitter long enough for the other station to send its data.
40
 Solving Exposed Terminal by MACA
RAVI SHARMA (KCS-711) Mobile Computing
If a node hears no response to an overheard RTS,
RAVI SHARMA (KCS-711) Mobile Computing
then it may assume that
the intended recipient of the RTS is either down or out of range.

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) M o Ibheard

ile Computing
RTS RTS

But not
CTS
RAVI SHARMA (KCS-711) M o b CTS
ile Computing

RTS 41
 IEEE 802.11: Frame
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

42
 IEEE 802.11: Frame
RAVI SHARMA (KCS-711) Mobile Computing
• Payload and CRC Fields
RAVI SHARMA (KCS-711) Mobile Computing
– At the heart of the frame is the payload, which typically consists of an IP datagram or
an ARP packet. Although the field is permitted to be as long as 2,312 bytes, it is
typically fewer than 1,500 bytes, holding an IP datagram or an ARP packet.

R A V– I AnS 802.11
HARM frame
A ( includes
K C S - 7a 132-bit
1 ) cyclic redundancy check
M o b(CRC)
i l e soC that
o m the
p u receiver
ting
can detect bit errors in the received frame. As we’ve seen, bit errors are much more
common in wireless LANs than in wired LANs, so the CRC is even more useful here.

•R AAddress
V I S H AFields
RMA (KCS-711) Mobile Computing
– Three address fields are needed for internetworking purposes. Specifically, for moving
the network-layer datagram from a wireless station through an AP to a router
interface.
RAVI SHARMA (KCS-711) Mobile Computing
– The fourth address field is used when APs forward frames to each other in ad hoc
mode. 43
 IEEE 802.11: Frame
RAVI SHARMA (KCS-711) Mobile Computing
• Sequence Number, Duration, and Frame Control Fields
RAVI SHARMA (KCS-711) Mobile Computing
– The use of sequence numbers allows the receiver to distinguish between a newly
transmitted frame and the retransmission of a previous frame.

– IEEE 802.11 protocol allows a transmitting station to reserve the channel for a period
R A V I ofS time
H A Rthat
M includes
A ( K C the
S - 7time
1 1 to
) transmit its data frame
M oand
b i the
l e time
Com to ptransmit
u t i n gan
acknowledgment. This duration value is included in the frame’s duration field (both for
data frames and for the RTS and CTS frames).

R A V– I The
S Htype
A Rand
M Asubtype
( K C fields
S - 7 1are
1 )used to distinguish theMassociation,
o b i l e CRTS,
o mCTS,
p uACK,
t i nand
g
data frames.

– The to and from fields are used to define the meanings of the different address fields.
• These meanings change depending on whether ad hoc or infrastructure modes are used and, in the case
R A V I S HofAinfrastructure
R M A (mode,K C Swhether
- 7 1 a1wireless
) Mobile Computing
station or an AP is sending the frame.
– The WEP field indicates whether encryption is being used or not.
44
 RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

TCP over WLAN

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

45
 TCP: Review
RAVI SHARMA (KCS-711) Mobile Computing
• TCP is a connection oriented transport protocol which provides a reliable byte
R Astream
V I S HtoAthe
R Mapplication
A ( K C S layer.
-711) Mobile Computing
– Reliability is achieved since TCP uses an ARQ mechanism based on positive
acknowledgments.
• Application data submitted to TCP is divided into protocol data units (PDUs)
called segments, before transmission.
RAVI SHARMA (KCS-711) Mobile Computing

Transmission:
• Each byte is numbered and the number of the first byte in a segment is used as a
sequence number in the TCP header.
RAVI SHARMA (KCS-711) Mobile Computing
• A receiver transmits a cumulative acknowledgment in response to an incoming
segment which implies that many segments can be acknowledged at the same
time.
• TCP manages a retransmission timer which is started when a segment is
R Atransmitted.
VI SHARM A (timer
If the K C S expires
- 7 1 1 ) before the segmentMiso acknowledged,
b i l e C o m p then
u t i nTCP
g
retransmits the segment. The retransmission timeout value (RTO) is calculated
dynamically based on measurements of the round trip time (RTT). 46
 TCP: Congestion Control
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Today, all TCP implementations are required to use

RAVI SHARMA (KCS-711) Mobile Computing
algorithms for congestion control, namely:
– Slow start and Congestion avoidance
RAVI SHARMA (KCS-711) Mobile Computing
– Fast retransmit and Fast recovery

RAVI SHARMA (KCS-711) Mobile Computing

47
 Slow start and Congestion avoidance
RAVI SHARMA (KCS-711) Mobile Computing
• The purpose of slow start and congestion avoidance is to control the transmission
RAVI SHARMA (KCS-711) Mobile Computing
rate in order to prevent congestion from occurring.

• TCP is described as a self-clocking protocol, since the transmission rate is

determined by the rate of incoming acknowledgments.
RAVI SHARMA (KCS-711) Mobile Computing
• The sender only transmits segments when acknowledgments are received.

• TCP estimates the available capacity in the network by gradually increasing the
number of outstanding segments.
RAVI SHARMA (KCS-711) Mobile Computing
– The congestion window (cwnd) limits the amount of data the TCP sender can inject into the
network.
– The initial value of the congestion window is between one and four segments.
– The receiver window (rwnd) indicates the maximum number of bytes the receiver can accept.
R A V– I The
S Hvalue
A R of
M the
A (rwndK C Sis -advertised
7 1 1 ) to the sender, since M
theo receiver
b i l e includes
C o m prwnd
u t iinn the
g
segments going back to the sender.
– At any moment, the amount of outstanding data is limited by the minimum of the cwnd and the
rwnd. 48
Slow start and Congestion avoidance
RAVI SHARMA (KCS-711) Mobile Computing
Congestion
RAVI SHARMA (KCS-711) Mobile Computing
Window Size
1
RAVI SHARMA (KCS-711) Mobile Computing
2 Multiplicative
Increase
4
RAVI SHARMA (KCS-711) Mobile Computing

8
RAVI SHARMA (KCS-711) Mobile Computing

⋮ 49
Slow start and Congestion avoidance
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

50
 Slow start and Congestion avoidance
RAVI SHARMA (KCS-711) Mobile Computing
• In the slow start phase, the congestion window is increased by one
RAVI SHARMA (KCS-711) Mobile Computing
segment for each acknowledgment received, which gives an
exponential increase of the congestion window.
– Slow start is used for newly established connections and after retransmission
due to timeout.
RAVI SHARMA (KCS-711) Mobile Computing
– The congestion window is increased until a timeout occurs or a threshold
value (ssthresh) is reached.

R A V1.I SIfH ssthresh

A R M A ( is
K C reached,
S-711) then the slowM start
o b i l ephase
C o m ends
putinand
g
congestion avoidance is entered instead.
• During the congestion avoidance phase, the congestion window is increased by
one segment per round trip time. This gives a linear increase of the congestion window.
2. If a timeout occurs, then ssthresh is reduced to half the amount of
RAVI SHARMA (KCS-711) Mobile Computing
outstanding data, the congestion window is reduced to one full-
sized segment, and the slow start phase is entered again.
51
 Fast Retransmit and Fast Recovery
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Duplicate ACK

RAVI SHARMA (KCS-711) Mobile Computing

FAST Recovery
RAVI SHARMA (KCS-711) Mobile Computing

52
 Fast Retransmit and Fast Recovery
RAVI SHARMA (KCS-711) Mobile Computing
• If a segment arrives out of order:
RAVI SHARMA (KCS-711) Mobile Computing
– The receiver transmits an acknowledgment for the last segment received in
sequence

– Since this segment already has been acknowledged once before, when it was
RAVI SHARMA (KCS-711) Mobile Computing
first received, this subsequent acknowledgment is called a duplicate
acknowledgment (dupack).
– Fast Retransmit: After receiving three dupacks in a row,
R A V I S• HThe
A R sender
MA (K C S - 7 1 1that
concludes ) unacknowledgedMdata o b i that
l e Cwas
o mtransmitted
puting
before the dupack-ed segment must have been lost.
• Data is retransmitted directly after the receipt of the third dupack

RAVI SHARMA (KCS-711) Mobile Computing

• After the retransmission, fast recovery is performed until all lost
data is recovered and the sender receives an acknowledgment
53
which covers new data.
 TCP Options
RAVI SHARMA (KCS-711) Mobile Computing
• Selective Acknowledgments
R A V– I With
S H SACK
A R Menabled,
A ( K Cif Smultiple
- 7 1 1 segments
) are lost in M same
the o b i lwindow,
e Com p u t i ncan
a receiver g
acknowledge up to three non-continuous blocks of received bytes in the same
acknowledgment. The sender then knows which segments are missing and can
retransmit only those.

•R ATimestamps
VI SHARMA (KCS-711) Mobile Computing
– If the timestamps option is enabled, then the sender can sample the round trip time
with a higher frequency, which gives a more accurate round trip time estimation. This
is especially useful when using large windows, since the round trip time can be
estimated more often than only once per window.
RAVI SHARMA (KCS-711) Mobile Computing

• Window Scaling
– The window scale option can be used in order to utilize the network capacity between
the sender and the receiver more efficiently. As the transmission is limited by the
R A V I advertised
S H A R Mreceiver
A ( K window
C S - 7 1(although
1) the network canMtransport
o b i l e more
C o data),
m p uwith
t i nthe
g
window scale option, a larger window can be used, since, it is possible to advertise
receiver windows of 32 bits.
54
 TCP Variants
RAVI SHARMA (KCS-711) Mobile Computing
• TCP Tahoe
RAVI SHARMA (KCS-711) Mobile Computing
– It is the original BSD implementation, including the congestion control
schemes of slow start and congestion avoidance algorithm.

• TCP Reno:
RAVI SHARMA (KCS-711) Mobile Computing
– The addition of the fast retransmit and fast recovery algorithms to TCP are
called TCP Tahoe .

•R ATCP
V I NewReno
SHARMA (KCS-711) Mobile Computing
– It further improves upon TCP Reno by changing some thresholds in the fast
recovery algorithm and avoiding a scenario where multiple retransmits can
occur.
RAVI SHARMA (KCS-711) Mobile Computing

55
Issues with TCP in Wireless Networks
RAVI SHARMA (KCS-711) Mobile Computing
• TCP cannot distinguish problems that typically occur in wireless
RAVI SHARMA (KCS-711) Mobile Computing
networks from congestion.
– The congestion control algorithms in TCP are based on the assumptions that data is
lost mainly due to congestion and that data loss due to transmission errors is rare.
• TCP segments may be lost if the radio conditions are poor and the link layer protocol provides a low
reliability.
RAVI S• HHandover
A R MeventsA ( may
K Calso
S -lead
7 1to1data
) loss. Mobile Computing
– Data loss due to an unreliable link layer or a handover, may cause a timeout event
followed by slow start or fast retransmit and fast recovery. In either case, the
congestion control action taken by TCP is unnecessary.

RAVI SHARMA (KCS-711) Mobile Computing

• TCP may also misinterpret a sudden increase in the round trip time
as data loss.
– If the delay is long enough for the retransmission timer to expire before an
R A V I acknowledgment
S H A R M A ( isK received,
C S - 7 1 then
1 ) TCP misinterprets the
M delay
o b i lase anCindication
o m p u tofi ndata
g
loss due to congestion.
– The delayed data is unnecessarily retransmitted and TCP enters slow start.
56
 RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Bluetooth
RAVI SHARMA (KCS-711) Mobile Computing

57
 Introduction
RAVI SHARMA (KCS-711) Mobile Computing
• Bluetooth is a wireless standard intended for very short range communication
RAVI SHARMA (KCS-711) Mobile Computing
between mobile phones, PDAs, notebook computers, and other personal or
peripheral devices.
• The IEEE standardized Bluetooth as IEEE 802.15.1.
– But it no longer maintains the standard.
RAVI SHARMA (KCS-711) Mobile Computing
• Its specifications are overseen by the Bluetooth Special Interest Group (SIG)
– The SIG, formalized Bluetooth's specifications and formally announced on 20 May
1998.
•R AThe
V I first
S H Bluetooth
A R M A (device
K C S - was
7 1 1revealed
) in 1999. Mobile Computing
– A hands-free mobile headset that earned the "Best of show Technology Award" at
COMDEX.
• The first Bluetooth mobile phone was the Ericsson T36.
R A V– I ItSwas
H Athe
RM revised
A ( KT39
C Smodel
- 7 1 that
1 ) actually made it to store
M o shelves
b i l e inC 2001.
omputing
• IBM introduced the first notebook with integrated Bluetooth.
– IBM ThinkPad A30 in October 2001 which was. 58
 Bluetooth®: Specifications
RAVI SHARMA (KCS-711) Mobile Computing
• It operates in the globally unlicensed (but not unregulated) industrial,
R Ascientific
V I S H Aand
R Mmedical
A ( K C S2.4
- 7GHz
1 1 )short-range radio M o b i l e band.
frequency Computing

• Bluetooth uses a radio technology called frequency-hopping spread

spectrum (FHSS).
– It divides transmitted data into packets, and transmits each packet on one of 79
R A V I designated
S H A R MBluetooth
A ( K C channels.
S-711) Mobile Computing
• In most common mode, its transmission power is limited to 2.5 mW. This
gives:
– A very short range of communication of up to 10 metres
R A V– I Typical
S H A bandwidths
R M A ( K around
C S - 7 11to1 3) Mbps Mobile Computing
• In contrast to IEEE 802.11, IEEE 802.15.1 is essentially a low-power, short-
range, low-rate “cable replacement” technology. For this reason, 802.15.1
networks are sometimes referred to as wireless personal area networks
R A(WPANs).
VI SHARMA (KCS-711) Mobile Computing
– The link and physical layers of 802.15.1 are based on the earlier Bluetooth
specification for PANs
59
 Bluetooth®: piconets
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

M Master
𝑺𝑷
Slave
RAVI SHARMA (KCS-711) 𝑺𝑨 𝑺𝑨
Mobile Computing

𝑺𝑨 Active
Upto 7 such devices are allowed
M
RAVI SHARMA (KCS-711) Mobile Computing
𝑺𝑷 𝑺𝑷
𝑺𝑷 Parked / In-active
RAVI SHARMA (KCS-711)
Upto 255 such devices are allowed 𝑺𝑨
Mobile Computing

60
 Bluetooth®: piconet
RAVI SHARMA (KCS-711) Mobile Computing
• Bluetooth networks are ad hoc networks.
RAVI SHARMA (KCS-711) Mobile Computing
– No network infrastructure (e.g., an access point) is needed to interconnect
Bluetooth devices.
– Hence Bluetooth devices must organize themselves.

•R ABluetooth
V I S H A Rdevices
M A ( Kare
C S first
- 7 1 organized
1) into a piconet
M o b of
i l eup Cto
omeight
p u tactive
ing
devices. One of these devices is designated as the master, with the
remaining seven devices acting as slaves.
R A V– I Any
S Hcommunication
A R M A ( K C Sis-between
7 1 1 ) the master and a M
slave
obile Computing
– The slaves do not communicate directly with each other.

• Bluetooth uses frequency-hopping with 79 channels, using each for 625 μs

R Aat
V Ia time.
SHARMA (KCS-711) Mobile Computing

– This provides a natural time slot for Bluetooth to use for synchronous TDM.
61
 Bluetooth®: piconet
RAVI SHARMA (KCS-711) Mobile Computing
• The master node truly rules the piconet as its clock determines time in the
RAVI SHARMA (KCS-711) Mobile Computing
piconet.

• Only the master can start to transmit in odd-numbered slots.

•R AAV Islave
S H Acan
R M start
A ( Kto
C S transmit
- 7 1 1 ) in an even-numbered
M o b i l eslot,
C o but
m p uonly
t i n gin

response to a request from the master during the previous slot.

– This prevents any contention between the slave devices.

•R AAV slave
I S Hdevice
A R M Ais parked
( K C S -when
7 1 1 )it is set to an inactive,
M o blow-power
i l e C o mstate.
puting
– A parked device cannot communicate on the piconet unless their status has been
changed from parked to active by the master node.

• ZigBee® is another low-power, short-range communication technology,

RAVI SHARMA (KCS-711) Mobile Computing
devised by the ZigBee alliance and standardized as IEEE 802.15.4.
62
 Bluetooth®: scatternet
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) M o b i lPiconet-2

e Computing

P S
P
S
RAVI SHARMA (KCS-711) Mobile Computing

S
M M
RAVI SHARMA (KCS-711) S S
Mobile Computing
P

S
RAVI SHARMA (KCS-711) P
Mobile Computing
M
Piconet-1
Piconet-3
63
 Bluetooth®: scatternet
RAVI SHARMA (KCS-711) Mobile Computing
•R ABluetooth
V I S H A R Core
M A (Specification
K C S - 7 1 1 ) provides for the
M oconnection
b i l e C o mof
p utwo
t i n or
g
more piconets to form a scatternet.

•R AAV Iscatternet
S H A R M A is( KaC set
S - 7 of
1 1 )interconnected M
piconets
o b i l e that
C o m psupports
uting

communication between more than 8 devices.

RAVI SHARMA (KCS-711) Mobile Computing

• Scatternets can be formed when a member of one piconet (either
the master or one of the slaves) elects to participate as a slave in a
second, separate piconet.
RAVI SHARMA (KCS-711) Mobile Computing

64
 Bluetooth®: Generations
RAVI SHARMA (KCS-711) Mobile Computing
• Bluetooth 1.0 - 1.2
RAVI SHARMA (KCS-711) Mobile Computing
– Ratification as IEEE 802.15.1 standard
• Bluetooth 2.1 - 2.2
– Introduction of Enhanced Data Rate (EDR)
• Bluetooth 3.0
RAVI SHARMA (KCS-711) Mobile Computing
– The new feature is AMP (Alternative MAC/PHY), the addition of 802.11 as a
high-speed (HS) transport.
• Bluetooth 4.0 - 4.2
R A V– I ItSisHalso
A R called
M A Bluetooth
( K C S - 7 1Smart
1) Mobile Computing
– It includes Classic Bluetooth, Bluetooth high speed and Bluetooth Low Energy
(LE) protocols
• Bluetooth 5.0 - 5.3
R A V– I ItsS new
H A Rfeatures
M A ( Kare
C Smainly
- 7 1 1focused
) M oofb Things
on new Internet i l e Ctechnology
omputing

65
 Bluetooth®: Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

66
 Bluetooth®: Core Protocols
RAVI SHARMA (KCS-711) Mobile Computing
• BR/EDR Radio:
RAVI SHARMA (KCS-711) Mobile Computing
– The BR/EDR radio is the lowest defined layer of the Bluetooth specification.
– The BR mode is mandatory, whereas the EDR mode is optional.
– This layer defines the requirements of the Bluetooth transceiver device
operating in the 2.4 GHz ISM frequency band. M o b i l e C o m p u t i n g
RAVI SHARMA (KCS-711)
– It implements a 1600 hops/sec FHSS technique. The radio hops in a pseudo-
random way on 79 designated Bluetooth channels.
– Each Bluetooth channel has a bandwidth of 1 MHz.
RAVI SHARMA (KCS-711) Mobile Computing
– Each frequency is located at (2402 + k) MHz, where k = 0,1,...78.
– The modulation technique for BR and EDR mode is GFSK and differential
phase shift keying (DPSK), respectively.
R A V– I The
S HBluetooth
A R M A (BR/EDR
K C S - 7radio
1 1 )uses the time division
M oduplex
b i l e (TDD)
C o mtopology
p u t i n gin
which data transmission occurs in one direction at one time. The transmission
alternates in two directions, one after the other. 67
 Bluetooth®: Core Protocols
RAVI SHARMA (KCS-711) Mobile Computing
• Baseband and Link Control.
RAVI SHARMA (KCS-711) Mobile Computing
– This layer enables the PHY RF link between different Bluetooth devices,
forming a piconet.
• The baseband handles the channel processing and timing
• The link control handles the channel access control.
RAVI SHARMA (KCS-711) Mobile Computing

• Link Manager Protocol (LMP)

– The LMP layer is primarily responsible for link setup and link configuration
R A V I between
SHARM different
A ( K CBluetooth
S - 7 1 1 )devices. Mobile Computing
– These processes include establishing security functions such as authentication
and encryption by generating, exchanging, and checking link and encryption
keys.
RAVI SHARMA (KCS-711) Mobile Computing
– Furthermore, this layer controls the power modes and duty cycles of the
Bluetooth radio device and the connection states of a Bluetooth unit in a
68
piconet.
 Bluetooth®: Core Protocols
RAVI SHARMA (KCS-711) Mobile Computing
•R ALogical
V I S H Link
A R MControl
A ( K C Sand
- 7 1Adaptation
1) ProtocolM o(L2CAP)
bile Computing
– The L2CAP adapts higher-layer protocols over the baseband.

– It shields the higher-layer protocols from the details of the lower-layer

protocols.
RAVI SHARMA (KCS-711) Mobile Computing
– The L2CAP provides connection-oriented and connectionless services to the
higher-layer protocols. This includes protocol multiplexing capability,

R A V I segmentation
S H A R M A and
( K Creassembly
S - 7 1 1 ) operations, and group
M o abstractions.
bile Computing

• Service Discovery Protocol (SDP)

– SDP provides a means for applications to query services and the
RAVI SHARMA (KCS-711) Mobile Computing
characteristics of services, following which a connection can be established
between two or more Bluetooth devices. 69
Bluetooth®: Simplified Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

70
 RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Mobility Management
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

71
 Addressing Issue
RAVI SHARMA (KCS-711) Mobile Computing
Post Office
R A VHome
I SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

you father
RAVI SHARMA (KCS-711) Mobile Computing
1. Letter intended for you is delivered at your home address.

2. Your father receives the letter and passes it on to you.

RAVI SHARMA (KCS-711) Mobile Computing

72
 Addressing Issue
RAVI SHARMA (KCS-711) Mobile Computing

R A VHome
I S H A father
RMA (KCS-711) M o bowner
i l e C o m p PG
uting
Father sends it to you

@ Your owner’s address

mentioning
R A V I S H A R M A ( K C S -In7Care
1 1 )of your owner Mobile Computing

R A V I Letter
S H A for
R Myour
A (KCS-711) Mobile Computing
@ Your home address

RAVI SHARMA (KCS-711) Mobile Computing

73
 Addressing Issue
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

How do we manage this address assignment in case of
movement of Mobile devices?
R A V I S H A R M A ( K(from
C S - 7one
1 1 )network to another)
Mobile Computing

• Understandably it is the primary issue of network layer to solve.

•R AIP
V I addresses
S H A R M Aare
( Kfundamentally
CS-711) designed to
M owork
b i l e with
C o mstationary
puting
hosts
• A part of IP address defines the network to which it is attached
• This could be solved by:
RAVI SHARMA (KCS-711) Mobile Computing
– Changing the address
– Carrying Multiple addresses
74
 Obtaining IP addresses
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

• Manually

•R AAutomatically
VI SHARMA (KCS-711) Mobile Computing

– PPP (Point-to-Point Protocol) / IPCP (IP Control Protocol)

R A V–I BOOTP
S H A R (Bootstrap
M A ( K C S -Protocol)
711) Mobile Computing

– DHCP (Dynamic Host Configuration Protocol)

RAVI SHARMA (KCS-711) Mobile Computing

75
 Obtaining IP addresses
RAVI SHARMA (KCS-711) Mobile Computing

R A VBut,
I SHWhile
A R M being
A ( K Cmobile,
S - 7 1 1 if
) the IP addresses
M are
o b i changing
l e C o m p????
uting

172.56.X.X 10.16.X.X

128.100.X.X
192.168.X.X
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

76
 Obtaining IP addresses: Drawbacks
RAVI SHARMA (KCS-711) Mobile Computing
• The configuration files would need to be changed.
RAVI SHARMA (KCS-711) Mobile Computing
• Each time the computer moves from one network to another, it
must be rebooted.
• The DNS tables need to be revised so that every other host in the
RAVI SHARMA (KCS-711) Mobile Computing
Internet is aware of the change.
• If the host roams from one network to another during a
transmission, the data exchange will be interrupted.
R A V—I Since
S H Athe
RM A and
port ( KIP
C addresses
S - 7 1 1 )of the client and the server
M o bmust
i l e remain
C o mconstant
p u t i nfor
g
the duration of the connection

The solution is to hold on to a unique IP address

RAVI S H A R M A ( K C S - 7 1 1 along
) with Mobile Computing
a mechanism to handle it while being mobile
77
 Mobile IP: Basic Definitions
RAVI SHARMA (KCS-711) Mobile Computing
• Home network
R A V—I The
S Hpermanent
A R M A home
( K C Sof- a7 mobile
1 1 ) node (such as a laptop
M o or
b i smartphone)
l e C o m pisuknown
ting
as the home network.
— The home network of a mobile device is the network within which the device
receives its identifying IP address (home address/permanent address).
•R AHome
V I S Hagent
ARMA (KCS-711) Mobile Computing
— The entity within the home network that performs the mobility management
functions on behalf of the mobile node is known as the home agent.
— A home agent is essentially a router on a mobile node’s home network which
R A V I tunnels
S H A Rdatagrams
M A ( K for
C S delivery
- 7 1 1 )to the mobile node when
M o bit i isl eaway
C ofrom
m p home.
u t i n Itg

maintains current location (IP address) information for the mobile node. It is used
with one or more foreign agents.
• Home address
RAVI SHARMA (KCS-711) Mobile Computing
— The home address of a mobile device is the IP address assigned to the device within
its home network.
78
 Mobile IP: Basic Definitions
RAVI SHARMA (KCS-711) Mobile Computing
• Foreign (Visited) network
RAVI SHARMA (KCS-711) Mobile Computing
— The network in which the mobile node is currently residing / operating (when away
from its home network).
• Foreign agent
R A V—I The
S Hentity
A R Mwithin
A ( the
K C foreign
S - 7 1 1network
) that helps the M
mobile
o b i node
l e Cwith
o mthe
p umobility
ting
management functions is known as a foreign agent.
— A foreign agent is a router that stores information about mobile nodes visiting its
network. Foreign agents also advertise care-of-addresses which are used by Mobile IP.
RAVI SHARMA (KCS-711) Mobile Computing
• Care-of address (Foreign Address)
— The care-of address of a mobile device is the network-native IP address of the device
when operating in a foreign network.
RAVI SHARMA (KCS-711) Mobile Computing
• Correspondent
— It is the entity wishing to communicate with the mobile node.
79
 Mobile IP: Basic Definitions
RAVI SHARMA (KCS-711) Mobile Computing
• Mobility Binding
RAVI SHARMA (KCS-711) Mobile Computing
— The association of a home address with a COA along with the remaining
lifetime of that association.
• It is worth noting that the mobile node can also assume the responsibilities of
R Athe
V I foreign
S H A Ragent.
MA (KCS-711) Mobile Computing

• For example, the mobile node could obtain a COA in the foreign network (for
R Aexample,
V I S H Ausing
RMA ( K C S - such
a protocol 7 1 1as
) DHCP) and itself inform
M o b ithe
l e home
C o magent
p u t of
i nits
g

COA.
• In this case, COA is called a co-located COA.
RAVI SHARMA (KCS-711) Mobile Computing

80
 Mobile IP
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Carrying Multiple
Addresses

RAVI SHARMA (KCS-711) Mobile Computing

81
 Mobile IP: The Standard
RAVI SHARMA (KCS-711) Mobile Computing
• The Internet architecture and protocols for supporting mobility, collectively
R Aknown
V I S as
H AMobile
R M A IP,( are
K C Sdefined
- 7 1 1 primarily
) in RFC 5944Mfor
o bIPv4.
ile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

82
https://www.rfc-editor.org/rfc/rfc5944.html
 Mobile IP: Communication Process
RAVI SHARMA (KCS-711) Mobile Computing
The mobile IP process consists of three main phases:
RAVI SHARMA (KCS-711) Mobile Computing
1. Agent Discovery
• Agent Discovery is the method by which a mobile node determines whether
it is currently connected to its home network or to a foreign network, and
RAVI SHARMA (KCS-711) Mobile Computing
by which a mobile node can detect when it has moved from one network to
another.
• During the agent discovery phase, the home agent and foreign agent
RAVI SHARMA (KCS-711) Mobile Computing
advertise their services on the network by using the ICMP Router Discovery
Protocol (IRDP).
• The mobile node listens to these advertisements to determine if it is
RAVI SHARMA (KCS-711) Mobile Computing
connected to its home network or foreign network.

83
 Mobile IP: Communication Process
RAVI SHARMA (KCS-711) Mobile Computing
2. Registration
R A V• I SMobile
HARM IP Aregistration
( K C S - 7 provides
11) M o b i lfor
a flexible mechanism e mobile
C o m pnodes
u t i n to
g

communicate their current reachability information to their home agent. It

is the method by which mobile nodes:
R A V I S—H ARequest
R M A forwarding
( K C S - 7services
1 1 ) when visiting a foreign
M onetwork
b i l e .C o m p u t i n g
— Inform their home agent of their current COA.
— Renew a registration that is due to expire.
— Deregister when they return home.
RAVI SHARMA (KCS-711) Mobile Computing
• Registration messages exchange information between a mobile node,
(optionally) a foreign agent, and the home agent. Registration creates or
modifies a mobility binding at the home agent, associating the mobile
RAVI SHARMA (KCS-711) Mobile Computing
node's home address with its care-of address for the specified Lifetime.

84
 Mobile IP: Communication Process
RAVI SHARMA (KCS-711) Mobile Computing
2. Registration
RAVI SHARMA (KCS-711) Mobile Computing
1. The mobile node sends a registration
request to the prospective foreign
agent to begin the registration
process.
R A VThe
2. I Sforeign
H A R Magent
A ( Kprocesses
C S - 7 1 1the
) Mobile Computing
registration request and then relays
it to the home agent.

3. The home agent sends a registration

R A Vreply
I StoH the
A Rforeign
M A (agent
K C Sto- 7grant
1 1 or
) Mobile Computing
deny the request.

4. The foreign agent processes the

registration reply and then relays it
R A VtoI the
SH ARM
mobile A to
node ( Kinform
C S - 7it 1of1the
) Mobile Computing
disposition of its request.
85
 Mobile IP: Communication Process
RAVI SHARMA (KCS-711) Mobile Computing
3. Tunneling (Data Transfer)
R A• VThere
I S Hcan
A Rbe
M two
A ( cases
K C S (directional)
-711) M o b i l ewith
Co m p unode:
ting
for the communication mobile
A. Correspondent → Mobile-Node
B. Mobile-Node → Correspondent

• Correspondent → Mobile-Node
RAVI SHARMA (KCS-711) Mobile Computing
• A correspondent wanting to communicate with the mobile-node uses the
permanent home address of the mobile-node as the destination address to send
packets to.
RAVI SHARMA (KCS-711) Mobile Computing
• Because the home address logically belongs to the network associated with the
home agent, normal IP routing mechanisms forward these packets to the home
agent.
R A V •I SThe
H Ahome
R M agent
A ( Kredirects
C S - 7 1these
1 ) packets towards theMremote
o b i laddress
e Com through
p u t iann IP
g
tunnel by encapsulating the datagram with a new IP header using the COA of the
mobile node. 86
 Mobile IP: Communication Process
RAVI SHARMA (KCS-711) Mobile Computing
3. Tunneling (Data Transfer)
R A• VThere
I S Hcan
A Rbe
M two
A ( cases
K C S (directional)
-711) M o b i l ewith
Co m p unode:
ting
for the communication mobile
A. Correspondent → Mobile-Node
B. Mobile-Node → Correspondent

• Correspondent → Mobile-Node
RAVI SHARMA (KCS-711) Mobile Computing
• A correspondent wanting to communicate with the mobile-node uses the
permanent home address of the mobile-node as the destination address to send
packets to.
RAVI SHARMA (KCS-711) Mobile Computing
• Because the home address logically belongs to the network associated with the
home agent, normal IP routing mechanisms forward these packets to the home
agent.
R A V •I SThe
H Ahome
R M agent
A ( Kredirects
C S - 7 1these
1 ) packets towards theMremote
o b i laddress
e Com through
p u t iann IP
g
tunnel by encapsulating the datagram with a new IP header using the COA of the
mobile node. 87
 Mobile IP: IP Tunneling (IP-in-IP)
RAVI SHARMA (KCS-711) Mobile Computing
Mobile IP encapsulation as per the RFC 5994:
RAVI SHARMA (KCS-711) Mobile Computing
• Home agents and foreign agents MUST support tunnelling datagrams using IP in
IP encapsulation.
• Any mobile node that uses a co-located COA must support receiving datagrams
RAVI SHARMA (KCS-711) Mobile Computing
tunnelled using IP in IP encapsulation.
• Minimal encapsulation and Generic Routing Encapsulation (GRE) encapsulation
are alternate encapsulation methods that MAY optionally be supported by
RAVI SHARMA (KCS-711) Mobile Computing
mobility agents and mobile nodes.
• Reference RFCs:
• IP in IP Tunneling (RFC 1853)
R A V• I IPS Encapsulation
H A R M A ( within
K C S -IP7 (RFC
1 1 )2003) Mobile Computing

88
 Mobile IP: IP-in-IP Encapsulation
RAVI SHARMA (KCS-711) Mobile Computing
• To encapsulate an IP packet in another IP packet, an outer header is added
RAVI SHARMA (KCS-711) Mobile Computing
before the original IP header.
• Within the Outer IP header, Source Address and Destination Address identify the
"endpoints" of the tunnel.
S H A RIPM→Athe
R A V• I Source ( Kentry
C S -point
7 1 1 of
) the tunnel (i.e. theMHome
o b i lAgent)
e Computing

• Destination IP → the exit point of the tunnel (i.e. COA)

• Within the Inner IP header, Source Address and Destination Addresses identify
R Athe
V I original
S H A Rsender
M A (and
K C Srecipient,
- 7 1 1 ) respectively. Mobile Computing

Outer IP Header
R A V I S H A R MIP
A Header
(KCS-711) Inner IPMHeader
obile Computing
IP Payload IP Payload
89
 Wireless Application Protocol
RAVI SHARMA (KCS-711) Mobile Computing

(WAP)

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

90
 WAP Introduction
RAVI SHARMA (KCS-711) Mobile Computing
• Wireless Application Protocol (WAP) is a technical standard for provisioning
RAVI SHARMA (KCS-711) Mobile Computing
information access over a mobile wireless network.
• Before WAP’s arrival, mobile service providers had limited opportunities to offer
interactive data services for web applications such as email, stock prices, news
R Aand
V I sports
S H A headlines.
RMA (KCS-711) Mobile Computing

• WAP was positioned at the convergence of two then rapidly evolving network
technologies, wireless data and the Internet.
•R AIntroduced
V I S H A RinM1999
A (and
K C became
S - 7 1 1 outdated
) by modern M o b i l e by
standards C 2010s.
omputing
• As all the browsers today provision full support for HTML, hence they do not need
to use WAP’s markup language i.e. WML.
• WAP standard described a protocol stack with five layers allowing the
RAVI SHARMA (KCS-711) Mobile Computing
interoperability of WAP equipment and software with different network
technologies, such as GSM and IS-95 /CDMA.
91
 World Wide Web (WWW) Model
RAVI SHARMA (KCS-711) Mobile Computing

RA VI SHARMA (KCS-711)
Client M o b i l e C o mServer
puting

Request (URL) CGI Scripts

etc.

R A V I S HWeb
ARM Browser
A (KCS-711) Mobile Computing

Response (Content)
Content
RAVI SHARMA (KCS-711) Mobile Computing

• Uniform Resource Locator (URL) Different Server Types:

• HyperText Markup Language (HTML) • Origin Server
R A V •I SHARM
Scripting A ( K C (JavaScript
Languages S - 7 1 1 )etc.) • Proxy Mobile Computing
• HyperText Transfer Protocol (HTTP) • Gateway

92
 WAP Model
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

Client Gateway Origin Server

R A V I S H A R M Encoded
A (KCS-711) M o b iCGI
l e Scripts
Computing
Request Request etc.
Encoders
WAE and
User Agent Decoders
RAVI SHARMA (KCS-711) Mobile Computing
Encoded Response
Response (Content) Content

RAVI SHARMA (KCS-711) Mobile Computing

93
 WAP Model: functioning
RAVI SHARMA (KCS-711) Mobile Computing
• WAP content and applications are specified in a set of well-known content
R Aformats
V I S Hbased
A R Mon
A the
( K familiar
C S - 7 1WWW
1) content formats.M o b i l e C o m p u t i n g
• Content is transported using a set of standard communication protocols based on the
WWW communication protocols.

• A micro browser in the wireless terminal co-ordinates the user interface and is
analogous to a standard web browser.
RAVI SHARMA (KCS-711) Mobile Computing
• WAP utilises proxy technology to connect between the wireless domain and the
WWW.
— The WAP proxy allows content and applications to be hosted on standard WWW
servers and to be developed using proven WWW technologies such as CGI scripting.
RAVI SHARMA (KCS-711) Mobile Computing
• The WAP proxy typically is comprised of the following functionality:

— Protocol Gateway – The protocol gateway translates requests from the WAP protocol
stack (WSP, WTP, WTLS, and WDP) to the WWW protocol stack (HTTP and TCP/IP).
RAVI SHARMA (KCS-711) Mobile Computing
— Content Encoders and Decoders – The content encoders translate WAP content into
compact encoded formats to reduce the size of data over the network. 94
 WAP network: Example
RAVI SHARMA (KCS-711) Mobile Computing

R A V I S H A R M WAP
A ( KProxy
CS-711) Mobile Computing

WML

RA
Web S H A R M A ( K WML
V I Server CS-711) M o b i l eBinary
Com puting
Wireless WML

Network
HTML
RAVI SHARMA (KCS-711) Mobile Computing
HTML Filter

R A V I S H A R M A ( K C S - 7WTA
1 1 Server
) Mobile Computing

Note that a WAP client can communicates with two servers in the wireless network. 95
 WAP Model: Example
RAVI SHARMA (KCS-711) Mobile Computing
• The WAP proxy (for Web Server)
R A V—I SItHtranslates
A R M A WAP
( K Crequests
S - 7 1 1to) WWW requests thereby
M oallowing
b i l e the
C o WAP
m p uclient
t i n to
g
submit requests to the web server.
 If the web server provides WAP content (e.g., WML), the WAP proxy retrieves it
directly from the web server.
R A V I S H AHowever,
R M A if( Kthe
C Sweb
- 7 server
1 1 ) provides WWW content
M o b(such
i l e asCHTML),
o m p au filter
t i n gis
used to translate the WWW content into WAP content. For example, the HTML
filter would translate HTML into WML.
— The proxy also encodes the responses from the web server into the compact binary
R A V I Sformat
H A R understood
M A ( K C by
S -the
7 1client.
1) Mobile Computing

• Wireless Telephony Application (WTA) server

— It is an example origin or gateway server that responds to requests from the WAP
R A V I Sclient
H A Rdirectly.
MA (KCS-711) Mobile Computing
— The WTA server is used to provide WAP access to features of the wireless network
provider’s telecommunications infrastructure. 96
 WAP Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

RAVI SHARMA (KCS-711) Mobile Computing

97
 WAP Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing
• Wireless Datagram Protocol (WDP)
RAVI SHARMA (KCS-711) Mobile Computing
— The Transport layer protocol in the WAP architecture is referred to as the
Wireless Datagram Protocol (WDP).
— The WDP layer operates above the data capable bearer services
RAVI SHARMA (KCS-711) Mobile Computing
supported by the various network types.
• It resembles the UDP to the upper layers by providing unreliable transport of
data.
— Since the WDP protocols provide a common interface to the upper layer
RAVI SHARMA (KCS-711) Mobile Computing
protocols the Security, Session and Application layers are able to function
independently of the underlying wireless network.
• This is accomplished by adapting the transport layer to specific features of
R A V I S H A Rthe
M underlying
A ( K C S bearer.
-711) Mobile Computing
• By keeping the transport layer interface and the basic features consistent,
global interoperability can be achieved using mediating gateways.
98
 WAP Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing
• Wireless Transport Layer Security (WTLS)
RAVI SHARMA (KCS-711) Mobile Computing
— WTLS is a security protocol based upon the industry-standard Transport
Layer Security (TLS) protocol, formerly known as Secure Sockets Layer
(SSL).
RAVI SHARMA (KCS-711) Mobile Computing
— WTLS is intended for use with the WAP transport protocols and has been
optimised for use over narrow-band communication channels. WTLS
provides the following features:
RAVI SHARMA (KCS-711) Mobile Computing
• Data integrity
• Privacy
• Authentication
RAVI SHARMA (KCS-711) Mobile Computing
• Denial-of-service protection

99
 WAP Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing
• Wireless Transaction Protocol (WTP)
RAVI SHARMA (KCS-711) Mobile Computing
— The WTP runs on top of a datagram service and provides as a light-weight
transaction-oriented protocol that is suitable for implementation in “thin”
clients (mobile stations).
R A V I— S H A R operates
WTP M A ( K Cefficiently
S - 7 1 1 ) over secure or non-secure
M o b i l ewireless
C o m pdatagram
uting

networks and provides the following features:

• Three classes of transaction service:
 Unreliable one-way requests
R A V I S H A R M Reliable
A ( K Cone-way
S - 7 1 requests
1) Mobile Computing
 Reliable two-way request-reply transactions
• Optional user-to-user reliability - WTP user triggers the confirmation
of each received message
• Optional out-of-band data on acknowledgements
RAVI SHARMA (KCS-711) Mobile Computing
• PDU concatenation and delayed acknowledgement to reduce the
number of messages sent
• Asynchronous transactions 100
 WAP Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing
• Wireless Session Protocol (WSP)
RAVI SHARMA (KCS-711) Mobile Computing
— The Wireless Session Protocol (WSP) provides the application layer of
WAP with a consistent interface for two session services.
• The first is a connection-oriented service that operates above the transaction
layer protocol WTP.
R A V I S H• A The
R Msecond
A ( K isC aS connectionless
-711) M o b iabove
service that operates l e Caosecure
m p uor
t inon-
ng

secure datagram service (WDP).

— The WSP consists of services suited for browsing applications (WSP/B).

R A V I SWSP/B
HARM provides
A ( K Cthe
S -following
7 1 1 ) functionality: Mobile Computing
 HTTP/1.1 functionality and semantics in a compact over-the-air encoding
 Long-lived session state
 Session suspend and resume with session migration
RAVI SHARMA (KCS-711) Mobile Computing
 A common facility for reliable and unreliable data push
 Protocol feature negotiation
101
 WAP Protocol Stack
RAVI SHARMA (KCS-711) Mobile Computing
• Wireless Application Environment (WAE)
RAVI SHARMA (KCS-711) Mobile Computing
— WAE is a general-purpose application environment based on a
combination of World Wide Web (WWW) and Mobile Telephony
technologies.

— WAE includes a micro-browser environment containing the following

R A V I Sfunctionality:
HARMA (KCS-711) Mobile Computing
 Wireless Markup Language (WML) – a lightweight markup language,
similar to HTML, but optimised for use in hand-held mobile terminals
 WMLScript – a lightweight scripting language, similar to JavaScript™
RAVI SHARMA (KCS-711) Mobile Computing
 Wireless Telephony Application (WTA, WTAI) – telephony services and
programming interfaces
 Content Formats – a set of well-defined data formats, including images,
RAVI SHARMA (KCS-711) Mobile Computing
phone book records and calendar information

102