www.studymaterialz.in www.

studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY laptop from one hotel to the next, reconnecting to the company’s network via the
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING telephone network and a modem.
CS8601 MOBILE COMPUTING  Fixed and wireless: This mode is used for installing networks, e.g., in historical
buildings to avoid damage by installing wires, or at trade shows to ensure fast
UNIT I – INTRODUCTION network setup.
Introduction to Mobile Computing – Applications of Mobile Computing- Generations of Mobile
Communication Technologies-- Multiplexing – Spread spectrum -MAC Protocols – SDMA-  Mobile and wireless: This is the most interesting case. No cable restricts the user,
TDMA- FDMA- CDMA who can roam between different wireless networks. Most technologies discussed
1.1 Introduction to Mobile Computing: in this book deal with this type of device and the networks supporting them.
The rapidly expanding technology of cellular communication, wireless LANs, and Today’s most successful example for this category is GSM with more than 800
satellite services will make information accessible anywhere and at any time. Regardless million users.
of size, most mobile computers will be equipped with a wireless connection to the fixed
part of the network, and, perhaps, to other mobile computers. 1.2 Applications of Mobile Computing:
The resulting computing environment, which is often referred to as mobile or In many fields of work, the ability to keep on the move is vital in order to utilise time
nomadic computing, no longer requires users to maintain a fixed and universally known efficiently. The importance of Mobile Computers has been highlighted in many fields of
position in the network and enables almost unrestricted mobility. which a few are described below:
Mobile Computing is an umbrella term used to describe technologies that a. Vehicles:
enable people to access network services anyplace, anytime, and anywhere  Music, news, road conditions, weather reports, and other broadcast information
There are two different kinds of mobility: user mobility and device portability. are received via digital audio broadcasting (DAB) with 1.5 Mbit/s.
 For personal communication, GSM, universal mobile telecommunications
User mobility refers to a user who has access to the same or similar telecommunication system (UMTS) phone might be available offering voice and data connectivity
services at different places, i.e., users communicate (wireless) “anytime, anywhere, with with 384 kbit/s.
anyone”  The current position of the car is determined via the global positioning system
(GPS). Cars driving in the same area build a local ad-hoc network for the fast
With device portability,1 the communication device moves (with or without a user). exchange of information in emergency situations or to help each other keep a safe
Many mechanisms in the network and inside the device have to make sure that distance. In case of an accident, not only will the airbag be triggered, but the police
communication is still possible while the device is moving. devices can be connected and ambulance service will be informed via an emergency call to a service
anytime, anywhere to the network provider.
 Buses, trucks, and trains are already transmitting maintenance and logistic
A communication device can exhibit any one of the following characteristics: information to their home base, which helps to improve organization (fleet
 Fixed and wired: This configuration describes the typical desktop computer in an management), and saves time and money.
office. Neither weight nor power consumption of the devices allow for mobile b. Emergencies:
usage. The devices use fixed networks for performance reasons. • An ambulance with a high-quality wireless connection to a hospital can carry
 Mobile and wired: Many of today’s laptops fall into this category; users carry the vital information about injured persons to the hospital from the scene of the

CS8601-Mobile Computing Page 1 CS8601-Mobile Computing Page 2

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

accident. weather forecasts, earthquake detection, or to provide environmental

• All the necessary steps for this particular type of accident can be prepared and information.
specialists can be consulted for an early diagnosis.  Wireless connections, e.g., via satellite, can help in this situation. Other
• Wireless networks are the only means of communication in the case of natural examples for wireless networks are computers, sensors, or information displays
disasters such as hurricanes or earthquakes. In the worst cases, only in historical buildings, where excess cabling may destroy valuable walls or floors.
decentralized, wireless ad-hoc networks survive. f. Infotainment:
c. Business:  Wireless networks can provide up-to-date information at any appropriate
 Managers can use mobile computers say, critical presentations to major location.
customers. They can access the latest market share information. At a small  The travel guide might tell you something about the history of a building
recess, they can revise the presentation to take advantage of this information. (knowing via GPS, contact to a local base station, or triangulation where you are)
 They can communicate with the office about possible new offers and call downloading information about a concert in the building at the same evening via
meetings for discussing responds to the new proposals. Therefore, mobile a local wireless network.
computers can leverage competitive advantages.  Another growing field of wireless network applications lies in entertainment and
 A travelling salesman today needs instant access to the company’s database: games to enable, e.g., ad-hoc gaming networks as soon as people meet to play
to ensure that files on his or her laptop reflect the current situation, to enable the together.
company to keep track of all activities of their travelling employees, to keep g. Location dependent services
databases consistent etc.  It is important for an application to ‘know’ something about the location or
 With wireless access, the laptop can be turned into a true mobile office, but the user might need location information for further activities
efficient and powerful synchronization mechanisms are needed to ensure data • Location aware services
consistency. • what services, e.g., printer, fax, phone, server etc. exist in the local
d. Credit Card Verification: environment
 At Point of Sale (POS) terminals in shops and supermarkets, when customers • Follow-on services
use credit cards for transactions, the intercommunication required between the • automatic call-forwarding, transmission of the actual workspace to
bank central computer and the POS terminal, in order to effect verification of the the current location
card usage, can take place quickly and securely over cellular channels using a • Information services
mobile computer unit. • “push”: e.g., current special offers in the supermarket
 This can speed up the transaction process and relieve congestion at the POS • “pull”: e.g., where is the Black Forrest Cheese Cake?
terminals. • Support services
e. Replacement of Wired Networks: • caches, intermediate results, state information etc. “follow” the
 wireless networks can also be used to replace wired networks, e.g., remote mobile device through the fixed network
sensors, for tradeshows, or in historic buildings. • Privacy
• who should gain knowledge about the location
 Due to economic reasons, it is often impossible to wire remote sensors for 1.3 Limitations of Mobile Computing

CS8601-Mobile Computing Page 3 CS8601-Mobile Computing Page 4

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

 Resource constraints: Battery • secure access mechanisms important

 Interference: Radio transmission cannot be protected against interference using 1.4 A simplified reference model
shielding and result in higher loss rates for transmitted data or higher bit error The figure shows the protocol stack implemented in the system according to the
rates respectively reference model. End-systems, such as the PDA and computer in the example, need a full
 Bandwidth: Although they are continuously increasing, transmission rates are protocol stack comprising the application layer, transport layer, network layer, data link
still very low for wireless devices compared to desktop systems. Researchers look layer, and physical layer. Applications on the end-systems communicate with each other
for more efficient communication protocols with low overhead. using the lower layer services. Intermediate systems, such as the interworking unit, do
 Dynamic changes in communication environment: variations in signal power not necessarily need all of the layers.
within a region, thus link delays and connection losses
 Network Issues: discovery of the connection-service to destination and
connection stability
 Interoperability issues: the varying protocol standards
 Security constraints: Not only can portable devices be stolen more easily, but the
radio interface is also prone to the dangers of eavesdropping. Wireless access
must always include encryption, authentication, and other security mechanisms
that must be efficient and simple to use.
Wireless networks in comparison to fixed networks

Higher loss-rates due to interference

• emissions of, e.g., engines, lightning
Restrictive regulations of frequencies
• frequencies have to be coordinated, useful frequencies are almost all
Physical layer: This is the lowest layer in a communication system and is responsible for
occupied
the conversion of a stream of bits into signals that can be transmitted on the sender
Lower transmission rates
side. The physical layer of the receiver then transforms the signals back into a bit stream.
• local some Mbit/s, regional sometimes only, e.g., 53kbit/s with GSM/GPRS
For wireless communication, the physical layer is responsible for frequency
or about 150 kbit/s using EDGE – some Mbit/s with LTE
selection, generation of the carrier frequency, signal detection (although heavy
Higher delays, higher jitter
interference may disturb the signal), modulation of data onto a carrier frequency and
• connection setup time with GSM in the second range, several hundred
(depending on the transmission scheme) encryption.
milliseconds for other wireless systems –in ms range with LTE
Lower security, simpler active attacking
Data link layer: The main tasks of this layer include accessing the medium,
• radio interface accessible for everyone, base station can be simulated, thus
multiplexing of different data streams, correction of transmission errors, and
attracting calls from mobile phones
synchronization (i.e., detection of a data frame).
Always shared medium

CS8601-Mobile Computing Page 5 CS8601-Mobile Computing Page 6

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

Altogether, the data link layer is responsible for a reliable point-to-point connection  It introduces mobile technologies such as Mobile Telephone System (MTS),
between two devices or a point-to-multipoint connection between one sender and Advanced Mobile Telephone System (AMTS), Improved Mobile Telephone
several receivers. Service (IMTS), and Push to Talk (PTT).
Network layer: This third layer is responsible for routing packets through a network  It has low capacity, unreliable handoff, poor voice links, and no security at all
or establishing a connection between two entities over many other intermediate systems. since voice calls were played back in radio towers, making these calls susceptible
Important functions are addressing, routing, device location, and handover between to unwanted eavesdropping by third parties.
different networks.
Transport layer: This layer is used in the reference model to establish an end-to-end
connection
Application layer: Finally, the applications (complemented by additional layers that can
support applications) are situated on top of all transmission oriented layers. Functions
Architecture of Advanced mobile phone system
are service location, support for multimedia applications, adaptive applications
that can handle the large variations in transmission characteristics, and wireless access
B. Second Generation (2G)
to the world-wide web using a portable device.
 2G refers to the second generation based on GSM and was emerged in late
1980s.
1.5 Generations of Mobile Communication Technologies
 It uses digital signals for voice transmission. Main focus of this technology was
Mobile communication has become more popular in last few years due to fast reform
on digital signals and provides services to deliver text and picture message at
from 1G to 5G in mobile technology. This reform is due to requirement of service
low speed (in kbps).
compatible transmission technology and very high increase in telecoms customers.
 It use the bandwidth of 30 to 200KHz.
Generation refers change in nature of service compatible transmission technology and
 Next to 2G, 2.5G system uses packet switched and circuit switched domain
new frequency bands. In 1980 the mobile cellular era had started, and since then mobile
and provide data rate up to 144 kbps.
communications have undergone considerable changes and experienced massive
e.g. GPRS, CDMA and EDGE.
growth.
The main features of 2G and 2.5G are :
A. First Generation
 Data speed was upto 64kbps
 1G These phones were the first mobile phones to be used, which was
 Use digital signals
introduced in 1982 and completed in early 1990.
 Enables services such as text messages, picture messages and MMS(Multimedia
 It was used for voice services and was based on technology called as Advanced
message)
Mobile Phone System (AMPS). The AMPS system was frequency modulated and
used frequency division multiple access (FDMA) with a channel capacity of 30  Provides better quality and capacity

KHz and frequency band of 824- 894MHz. .  Unable to handle complex data such as videos.
 Required strong digital signals to help mobile phones work. If there is no network
coverage in any specific area, digital signals would weak.

Its basic features are: 2.5 G :

CS8601-Mobile Computing Page 7 CS8601-Mobile Computing Page 8

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

 The GSM technology was continuously improved to provide better services which  Large capacities and broadband capabilities
led to development of advanced Technology between 2g and 3g  TV streaming/mobile TV/Phone calls
 Provides phone calls  To download a 3 minute MP3 song only 11 sec-1.5 mins time required.
 Send/receive e-mail messages  Expensive fees for 3G licenses services
 Web browsing  It was challenge to build the infrastructure for 3G
 Speed : 64-144 kbps  High bandwidth requirement
 Camera phones  Expensive 3G phones
 Take a time of 6-9 mins. to download a 3 mins. MP3 song.  Large cell phones
3G mobile system was called as UMTS(Universal Mobile Telecommunication
System) in Europe,while CDMA2000 is the name of American 3G variant. Also the
IMT2000 has accepted a new 3G standard from China, i.e TD-SCDMA. WCDMA is the air-
interface technology for UMTS.

C. Third Generation (3G)

 3G is based on GSM and was launched in 2000. The aim of this technology was
to offer high speed data. The original technology was improved to allow data up
to 14 Mbps and more using packet switching.
 It uses Wide Band Wireless Network with which clarity is increased. It also offers
WCDMA Network
data services, access to television/video, new services like Global Roaming.
 It operates at a range of 2100MHz and has a bandwidth of 15-20MHz used for
D. Fourth Generation (4G)
High-speed internet service, video chatting.
 4G offers a downloading speed of 100Mbps.
The main features of 3G are:
 4G provides same feature as 3G and additional services like Multi-Media
 Speed 2 Mbps
Newspapers, to watch T.V programs with more clarity and send Data much
 Typically called smart phones
faster than previous generations .
 Increased bandwidth and data transfer rates to accommodate web-based
 LTE (Long Term Evolution) is considered as 4G technology.
applications and audio and video files.
 4G is being developed to accommodate the QoS and rate requirements set by
 Provides faster communication forthcoming applications like wireless broadband access, Multimedia Messaging
 Send/receive large email messages Service (MMS), video chat, mobile TV, HDTV content, Digital Video
 High speed web/more security/video conferencing/3D gaming Broadcasting (DVB), minimal services like voice and data, and other services

CS8601-Mobile Computing Page 9 CS8601-Mobile Computing Page 10

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

that utilize bandwidth.

The main features of 4G are :
 Capable of provide 10Mbps-1Gbps speed
 High quality streaming video
 Combination of Wi-Fi and Wi-Max
 High security
 Provide any kind of service at any time as per user requirements anywhere
 Expanded multimedia services
 Low cost per-bit
 Battery use is more
 Hard to implement
 Need complicated hardware
 Expensive equipment required to implement next generation network

E. Fifth Generation (5G)

 5G refer to Fifth Generation which was started from late 2010s.
 Facilities that might be seen with 5G technology includes far better levels of
connectivity and coverage.
 The main focus of 5G will be on world-Wireless World Wide Web (WWWW).
1.6 Multiplexing
 It is a complete wireless communication with no limitations.
• Multiplexing describes how several users can share a medium with minimum
The main features of 5G are :
or no interference
 It is highly supportable to WWWW (wireless World Wide Web)
• It is concerned with sharing the frequency range amongst the users
 High speed, high capacity
• Bands are split into channels
 Provides large broadcasting of data in Gbps.
• Four main ways of assigning channels
 Multi-media newspapers, watch TV programs with the clarity(HD Clarity)
• Space Division Multiplexing (SDM) : allocate according to location
 Faster data transmission that of the previous generation
• Time Division Multiplexing (TDM): allocate according to units of time
 Large phone memory, dialing speed, clarity in audio/video
• Frequency Division Multiplexing (FDM): allocate according to the
 Support interactive multimedia, voice, streaming video, internet and other
frequencies
 More effective and attractive
• Code Division Multiplexing (CDM) : allocate according to access codes
• Guard Space: gaps between allocations
Comparison of all generations of mobile Technologies:

CS8601-Mobile Computing Page 11 CS8601-Mobile Computing Page 12

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

A. Space division multiplexing copper wires to the local exchange. In wireless transmission, SDM implies a separate
 This is the basis of frequency reuse sender for each communication channel with a wide enough distance between
 Each physical space is assigned channels senders.
 Spaces that don’t overlap can have the same channels assigned B. Frequency division multiplexing
to them  Separation of the whole spectrum into smaller non overlapping
 Example: FM radio stations in different countries frequency bands (guard spaces are needed)
This multiplexing scheme is used, for example, at FM radio  A channel gets a certain band of the spectrum for the whole time –
stations where the transmission range is limited to a certain region, receiver has to tune to the sender frequency
many radio stations around the world can use the same frequency
without interference Again, guard spaces are needed to avoid frequency band overlapping (also called
Below figure shows six channels ki and introduces a three dimensional coordinate adjacent channel interference).
system. This system shows the dimensions of code c, time t and frequency f. For this first This scheme is used for radio stations within the same region, where each radio station
type of multiplexing, space division multiplexing (SDM), the (three dimensional) space has its own frequency. This very simple multiplexing scheme does not need complex
si is also shown. Here space is represented via circles indicating the interference range coordination between sender and receiver: the receiver only has to tune in to the specific
sender.

• Advantages
For the remaining channels (k4 to k6) three additional spaces would be needed. In our  No dynamic coordination necessary
highway example this would imply that each driver had his or her own lane.  Works also for analog signal
Drawback Disadvantages:
Although this procedure clearly represents a waste of space, this is exactly the principle  While radio stations broadcast 24 hours a day, mobile communication typically
used by the old analog telephone system: each subscriber is given a separate pair of takes place for only a few minutes at a time. Assigning a separate frequency for

CS8601-Mobile Computing Page 13 CS8601-Mobile Computing Page 14

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

each possible communication scenario would be a tremendous waste of (scarce) Frequency and time division multiplexing can be combined, i.e., a channel
frequency resources. • A channel gets a certain frequency band for a certain amount of time
 Additionally, the fixed assignment of a frequency to a sender makes the . Now guard spaces are needed both in the time and in the frequency
scheme very inflexible and limits the number of senders. dimension.
• Example: GSM
C. Time division multiplexing • Advantages
Here a channel ki is given the whole bandwidth for a certain amount of time, i.e., all • Better protection against tapping
senders use the same frequency but at different points in time. • Protection against frequency selective interference
Again, guard spaces, which now represent time gaps, have to separate the different Disadvantages
periods when the senders use the medium. In our highway example, this would refer to Precise clock synchronization necessary
the gap between two cars.
If two transmissions overlap in time, this is called co-channel interference. (In the
highway example, interference between two cars results in an accident.)
To avoid this type of interference, precise synchronization between different senders
is necessary.
Advantages:
 Only one carrier in the medium at any time
 Throughput high even for many users
Disadvantages
 Precise clock synchronization necessary

D. Code division multiplexing

 Below figure shows how all channels ki use the same frequency at the same time
for transmission.
 Separation is now achieved by assigning each channel its own ‘code’,
 guard spaces are realized by using codes with the necessary ‘distance’ in
code space, e.g., orthogonal codes.
 Implemented using spread spectrum technology

Frequency and time division multiplexing

CS8601-Mobile Computing Page 15 CS8601-Mobile Computing Page 16

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

Good protection against interference and tapping

Disadvantages
Precise power control required
More complex signal regeneration
1.7 Spread spectrum
• Problem of radio transmission: frequency dependent fading can wipe out narrow
band signals for duration of the interference
• Solution: spread the narrow band signal into a broad band signal using a
special code
• protection against narrow band interference
• Figure shows i) shows an idealized narrowband signal from a sender of user data
(here power density dP/df versus frequency f).
 The typical everyday example of CDM is a party with many participants from • The sender now spreads the signal in step ii), i.e., converts the narrowband
different countries around the world who establish communication channels, i.e., signal into a broadband signal. The energy needed to transmit the signal (the
they talk to each other, using the same frequency range (approx. 300–6000 Hz area shown in the diagram) is the same, but it is now spread over a larger
depending on a person’s voice) at the same time. If everybody speaks the same frequency range. The power level of the spread signal can be much lower than
language, SDM is needed to be able to communicate (i.e., standing in groups, that of the original narrowband signal without losing data.
talking with limited transmit power).

 But as soon as another code, i.e., another language, is used, one can tune in to this
language and clearly separate communication in this language from all the other
languages. (The other languages appear as background noise.)

step iii). During transmission, narrowband and broadband interference add to the signal
 This explains why CDM has built-in security: if the language is unknown, the
The sum of interference and user signal is received. The receiver now knows how to
signals can still be received, but they are useless. By using a secret code (or
despread the signal, converting the spread user signal into a narrowband signal again,
language), a secure channel can be established in a ‘hostile’ environment. (At
while spreading the narrowband interference and leaving the broadband interference.
parties this may cause some confusion.). Guard spaces are also of importance in
In step v) the receiver applies a bandpass filter to cut off frequencies left and right of the
this illustrative example. Using, e.g., Swedish and Norwegian does not really work;
narrowband signal. Finally, the receiver can reconstruct the original data because the
the languages are too close. But Swedish and Finnish are ‘orthogonal’ enough to
power level of the user signal is high enough, i.e., the signal is much stronger than the
separate the communication channels.
remaining interference.
Advantages
Drawbacks:
Bandwidth efficient
(i) Increased complexity of receivers that have to despread a signal.
No coordination and synchronization necessary

CS8601-Mobile Computing Page 17 CS8601-Mobile Computing Page 18

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

(ii) Large frequency band that is needed due to the spreading of the signal. This signal is then transmitted.
Although spread signals appear more like noise, they still raise the background noise level
and may interfere with other transmissions if no special precautions are taken.
• Spreading the spectrum can be achieved in two different ways as shown in
the following two sections
1.7.1 Direct sequence spread spectrum
Direct sequence spread spectrum (DSSS) systems take a user bit stream and
perform an (XOR) with a so-called chipping sequence as shown in below figure.
The example shows that the result is either the sequence 0110101 (if the user bit
equals 0) or its complement 1001010 (if the user bit equals 1). While each user bit has a
duration tb, the chipping sequence consists of smaller pulses, called chips, with a duration
tc.
If the chipping sequence is generated properly it appears as random noise: this The DSSS receiver is more complex than the transmitter. The receiver only

sequence is also sometimes called pseudo-noise sequence. has to perform the inverse functions of the two transmitter modulation steps. However,

The spreading factor s = tb/tc determines the bandwidth of the resulting signal. noise and multi-path propagation require additional mechanisms to reconstruct the

If the original signal needs a bandwidth w, the resulting signal needs s·w after spreading. original data.
The first step in the receiver involves demodulating the received signal. This
is achieved using the same carrier as the transmitter reversing the modulation and
results in a signal with approximately the same bandwidth as the original spread
spectrum signal. Additional filtering can be applied to generate this signal.
If transmitter and receiver are perfectly synchronized and the signal is not too
distorted by noise or multi-path propagation, DSSS works perfectly well according to the
simple scheme shown. Sending the user data 01 and applying the 11-chip Barker code
10110111000 results in the spread ‘signal’ 1011011100001001000111. On the receiver
side, this ‘signal’ is XORed bit-wise after demodulation with the same Barker code as
chipping sequence. This results in the sum of products equal to 0 for the first bit and to
DSSS need additional components as shown in the simplified block diagrams in below
11 for the second bit. The decision unit can now map the first sum (=0) to a binary 0, the
figure
second sum (=11) to a binary 1 – this constitutes the original user data.
The first step in a DSSS transmitter, the spreading of the user data with the
1.7.2 Frequency hopping spread spectrum
chipping sequence (digital modulation).
For frequency hopping spread spectrum (FHSS) systems, the total available
Assuming for example a user signal with a bandwidth of 1 MHz. Spreading with the
bandwidth is split into many channels of smaller bandwidth plus guard spaces
above 11-chip Barker code would result in a signal with 11 MHz bandwidth. The
between the channels.
radio carrier then shifts this signal to the carrier frequency (e.g., 2.4 GHz in the ISM band).
Transmitter and receiver stay on one of these channels for a certain time and then

CS8601-Mobile Computing Page 19 CS8601-Mobile Computing Page 20

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

hop to another channel. This system implements FDM and TDM. carrier frequencies fi.
The pattern of channel usage is called the hopping sequence, the time spend on A second modulation uses the modulated narrowband signal and the carrier
a channel with a certain frequency is called the dwell time. FHSS comes in two variants, frequency to generate a new spread signal with frequency of fi+f0 for a 0 and fi+f1 for a 1
slow and fast hopping respectively. If different FHSS transmitters use hopping sequences that never overlap, i.e.,
if two transmitters never use the same frequency fi at the same time, then these two
transmissions do not interfere.
This requires the coordination of all transmitters and their hopping sequences. As
for DSSS systems, pseudo-random hopping sequences can also be used without
coordination.
The receiver of an FHSS system has to know the hopping sequence and must
stay synchronized. It then performs the inverse operations of the modulation to
reconstruct user data. Several filters are also needed (these are not shown in the
simplified diagram in Figure 2.40
In slow hopping, the transmitter uses one frequency for several bit periods.
Above figure shows five user bits with a bit period tb. Performing slow hopping, the
transmitter uses the frequency f2 for transmitting the first three bits during the dwell
time td. Then, the transmitter hops to the next frequency f3. Slow hopping systems are
typically cheaper and have relaxed tolerances, but they are not as immune to narrowband
interference as fast hopping systems.
For fast hopping systems, the transmitter changes the frequency several times
during the transmission of a single bit. In the above figure, the transmitter hops three
times during a bit period. Fast hopping systems are more complex to implement because
the transmitter and receiver have to stay synchronized within smaller tolerances to
perform hopping at more or less the same points in time. However, these systems are
much better at overcoming the effects of narrowband interference and frequency
selective fading as they only stick to one frequency for a very short time. Compared to DSSS, spreading is simpler using FHSS systems. FHSS systems only use a
The below Figures show simplified block diagrams of FHSS transmitters and portion of the total band at any time, while DSSS systems always use the total bandwidth
receivers respectively. available. DSSS systems on the other hand are more resistant to fading and multi-path
The first step in an FHSS transmitter is the modulation of user data according effects. DSSS signals are much harder to detect – without knowing the spreading code,
to one of the digital-to analog modulation schemes, e.g., FSK or BPSK. This results in detection is virtually impossible. If each sender has its own pseudo-random number
a narrowband signal, if FSK is used with a frequency f0 for a binary 0 and f1 for a binary sequence for spreading the signal (DSSS or FHSS), the system implements CDM.
1. In the next step, frequency hopping is performed, based on a hopping sequence.
The hopping sequence is fed into a frequency synthesizer generating the

CS8601-Mobile Computing Page 21 CS8601-Mobile Computing Page 22

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

Medium access control(MAC) • the signal of terminal B therefore drowns out A’s signal
Motivation • C cannot receive A
• Can we apply media access methods from fixed networks? • If C for example was an arbiter for sending rights, terminal B would drown
• Example CSMA/CD Carrier Sense Multiple Access with Collision out terminal A already on the physical layer
Detection • Also severe problem for CDMA-networks - precise power control needed!
• send as soon as the medium is free, listen into the medium if a
collision occurs (legacy method in IEEE 802.3)
Why CSMA/CD not suit for wireless networks?
• signal strength decreases proportional to the square of the distance
• the sender would apply CS and CD, but the collisions happen at the receiver
• it might be the case that a sender cannot “hear” the collision, i.e., CD does
not work Access methods SDMA/FDMA/TDMA

• furthermore, CS might not work if, e.g., a terminal is “hidden” • SDMA (Space Division Multiple Access)

Hidden and exposed terminals • segment space into sectors, use directed antennas

• Hidden terminals (cause collision) • cell structure

• A sends to B, C cannot receive A • FDMA (Frequency Division Multiple Access)

• C wants to send to B, C senses a “free” medium (CS fails) • assign a certain frequency to a transmission channel between a

• collision at B, A cannot receive the collision (CD fails) sender and a receiver

• A is “hidden” for C • permanent (e.g., radio broadcast), slow hopping (e.g., GSM), fast
hopping (FHSS, Frequency Hopping Spread Spectrum)
• TDMA (Time Division Multiple Access)
• assign the fixed sending frequency to a transmission channel between
a sender and a receiver for a certain amount of time
1.SDMA
 Space Division Multiple Access (SDMA) is used for allocating a separated space
• Exposed terminals(unnecessary delay) to users in wireless networks.
• B sends to A, C wants to send to another terminal (not A or B)  A typical application involves assigning an optimal base station to a mobile
• C has to wait, CS signals a medium in use phone user. The mobile phone may receive several base stations with different
• but A is outside the radio range of C, therefore waiting is not necessary quality.
• C is “exposed” to B  A MAC algorithm could now decide which base station is best, taking into
Near and far terminals account which frequencies (FDM), time slots (TDM) or code (CDM) are still
• Terminals A and B send, C receives available.
• signal strength decreases proportional to the square of the distance  The basis for the SDMA algorithm is formed by cells and sectorized antennas

CS8601-Mobile Computing Page 23 CS8601-Mobile Computing Page 24

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

which constitute the infrastructure implementing space division multiplexing The two frequencies are also known as uplink, i.e., from mobile station to base station or
(SDM). from ground control to satellite, and as downlink, i.e., from base station to mobile station
 SDM has the unique advantage of not requiring any multiplexing equipment. or from satellite to ground control.
 It is usually combined with other multiplexing techniques to better utilize the The basic frequency allocation scheme for GSM is fixed and regulated by national
individual physical channels. authorities.
2.FDMA All uplinks use the band between 890.2 and 915 MHz,
Frequency division multiplexing (FDM) describes schemes to subdivide the frequency All downlinks use 935.2 to 960 MHz.
dimension into several non-overlapping frequency bands.  According to FDMA, the base station, shown on the right side, allocates a certain
frequency for up- and downlink to establish a duplex channel with a mobile phone.
Up- and downlink have a fixed relation. If the uplink frequency is fu = 890 MHz +
n·0.2 MHz, the downlink frequency is fd = fu + 45 MHz,
 i.e., fd = 935 MHz + n·0.2 MHz for a certain channel n.
 Frequency Division Multiple Access is a method employed to permit several  The base station selects the channel. Each channel (uplink and downlink) has a
users to transmit simultaneously on one satellite transponder by assigning bandwidth of 200 kHz.
a specific frequency within the channel to each user.  This scheme also has disadvantages. While radio stations broadcast 24 hours
 Each conversation gets its own, unique, radio channel. The channels are a day, mobile communication typically takes place for only a few minutes at a time.
relatively narrow, usually 30 KHz or less and are defined as either transmit or Assigning a separate frequency for each possible communication scenario would
receive channels. be a tremendous waste of (scarce) frequency resources.
 A full duplex conversation requires a transmit & receive channel pair.  Additionally, the fixed assignment of a frequency to a sender makes the scheme
 FDM is often used for simultaneous access to the medium by base station and very inflexible and limits the number of senders.
mobile station in cellular networks establishing a duplex channel.
 A scheme called frequency division duplexing (FDD) in which the two 3.TDMA
directions, mobile station to base station and vice versa are now separated using A more flexible multiplexing scheme for typical mobile communications is time division
different frequencies. multiplexing (TDM). Compared to FDMA, time division multiple access (TDMA) offers
a much more flexible scheme, which comprises all technologies that allocate certain
time slots for communication.
Now synchronization between sender and receiver has to be achieved in the time
domain. Again this can be done by using a fixed pattern similar to FDMA techniques, i.e.,
allocating a certain time slot for a channel, or by using a dynamic allocation scheme.

CS8601-Mobile Computing Page 25 CS8601-Mobile Computing Page 26

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

 As shown in the figure, the base station uses one out of 12 slots for the downlink,
whereas the mobile station uses one out of 12 different slots for the uplink. Uplink
and downlink are separated in time. Up to 12 different mobile stations can use the
same frequency without interference using this scheme. Each connection is
allotted its own up- and downlink pair.
 This general scheme still wastes a lot of bandwidth.
 It is too static, too inflexible for data communication. In this case,
connectionless, demand-oriented TDMA schemes can be used
Listening to different frequencies at the same time is quite difficult, but listening to
many channels separated in time at the same frequency is simple. Fixed schemes do not 3.2 Classical Aloha
need identification, but are not as flexible considering varying bandwidth requirements.  In this scheme, TDM is applied without controlling medium access.
3.1 Fixed TDM Here each station can access the medium at any time as shown below:
 The simplest algorithm for using TDM is allocating time slots for channels in a
fixed pattern. This results in a fixed bandwidth and is the typical solution for
wireless phone systems.
 MAC is quite simple, as the only crucial factor is accessing the reserved time slot
at the right moment.
 If this synchronization is assured, each mobile station knows its turn and no
interference will happen.
 The fixed pattern can be assigned by the base station, where competition  This is a random access scheme, without a central arbiter controlling access and

between different mobile stations that want to access the medium is solved. without coordination among the stations.
 If two or more stations access the medium at the same time, a collision occurs and
the transmitted data is destroyed.
 Resolving this problem is left to higher layers (e.g., retransmission of data). The
simple Aloha works fine for a light load and does not require any complicated
access mechanisms.

3.3Slotted Aloha
 The first refinement of the classical Aloha scheme is provided by the introduction
 The above figure shows how these fixed TDM patterns are used to implement of time slots (slotted Aloha).
multiple access and a duplex channel between a base station and mobile station.  In this case, all senders have to be synchronized, transmission can only start at
 Assigning different slots for uplink and downlink using the same frequency the beginning of a time slot as shown below.
is called time division duplex (TDD).  If a station misses the time-slot, the station must wait until the beginning of the

CS8601-Mobile Computing Page 27 CS8601-Mobile Computing Page 28

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

next time-slot
1) 1-Persistent
• Before sending a frame, a station senses the line (Figure 12.10a).
i) If the line is idle, the station sends immediately (with probability = 1).
ii) If the line is busy, the station continues sensing the line.
• This method has the highest chance of collision because 2 or more stations:
→ may find the line idle and
→ send the frames immediately.
The introduction of slots raises the throughput from 18 per cent to 36 per cent, i.e.,
2) Non-persistent
slotting doubles the throughput. Both basic Aloha principles occur in many systems that
• Before sending a frame, a station senses the line (Figure 12.10b).
implement distributed access to a medium. Aloha systems work perfectly well under a
i) If the line is idle, the station sends immediately.
light load, but they cannot give any hard transmission guarantees, such as maximum
ii) If the line is busy, the station waits a random amount of time and then
delay before accessing the medium or minimum throughput.
senses the line again.
• This method reduces the chance of collision because 2 or more stations:
3.4 Carrier sense multiple access
→ will not wait for the same amount of time and
• CSMA was developed to minimize the chance of collision and, therefore,
→ will not retry to send simultaneously.
increase the performance.
3) P-Persistent
• CSMA is based on the principle “sense before transmit” or “listen before
• This method is used if the channel has time-slots with a slot-duration equal to or
talk.”
greater than the maximum propagation time (Figure 12.10c).
• Here is how it works:
• Advantages:
1) Each station checks the state of the medium: idle or busy.
i)It combines the advantages of the other 2 methods.
2) i) If the medium is idle, the station sends the data.
ii) It reduces the chance of collision and improves efficiency.
• After the station finds the line idle, it follows these steps:
1) With probability p, the station sends the frame.
2) With probability q=1-p, the station waits for the beginning of the next
time-slot and checks the line again.
i) If line is idle, it goes to step 1.
ii) If line is busy, it assumes that collision has occurred and uses the
back off procedure.
3.5 Reservation algorithms
1. DAMA - Demand Assigned Multiple Access
• Channel efficiency only 18% for Aloha, 36% for Slotted Aloha (assuming
Poisson distribution for packet arrival and packet length)

CS8601-Mobile Computing Page 29 CS8601-Mobile Computing Page 30

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

• Reservation can increase efficiency to 80%

• a sender reserves a future time-slot
• sending within this reserved time-slot is possible without collision
• reservation also causes higher delays
• typical scheme for satellite links
• Examples for reservation algorithms:
• Explicit Reservation according to Roberts (Reservation-ALOHA)-DAMA
• Implicit Reservation (PRMA)
• Reservation-TDMA  In the illustration, a successful transmission of data is indicated by the
Access method DAMA: Explicit Reservation station’s name (A to F).
• two modes:  In the example, the base station broadcasts the reservation status
• ALOHA mode for reservation ‘ACDABA-F’ to all stations, here A to F. This means that slots one to six and
• competition for small reservation slots, collisions possible eight are occupied, but slot seven is free in the following transmission.
• reserved mode for data transmission within successful  All stations wishing to transmit can now compete for this free slot in Aloha
reserved slots (no collisions possible) fashion. The already occupied slots are not touched.
• it is important for all stations to keep the reservation list consistent  In the example shown, more than one station wants to access this slot, so a
at any point in time and, therefore, all stations have to synchronize collision occurs.
from time to time  The base station returns the reservation status ‘ACDABA-F’, indicating that
the reservation of slot seven failed (still indicated as free) and that nothing
has changed for the other slots. Again, stations can compete for this slot.
 Additionally, station D has stopped sending in slot three and station F in
slot eight. This is noticed by the base station after the second frame.
2. PRMA packet reservation multiple access  Before the third frame starts, the base station indicates that slots three and
Implicit reservation scheme is packet reservation multiple access (PRMA). eight are now idle. Station F has succeeded in reserving slot seven as also
A certain number of slots forms a frame indicated by the base station.
The frame is repeated in time (forming frames one to five in the example), 3. Reservation TDMA
A base station, which could be a satellite, now broadcasts the status of each  An even more fixed pattern that still allows some random access is exhibited by
slot to all mobile stations. reservation TDMA
All stations receiving this vector will then know which slot is occupied and which
slot is currently free.

CS8601-Mobile Computing Page 31 CS8601-Mobile Computing Page 32

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

 In a fixed TDM scheme N mini-slots followed by N·k data-slots form a frame that
is repeated.
 Each station is allotted its own mini-slot and can use it to reserve up to k data-
slots. This guarantees each station a certain bandwidth and a fixed delay. Other
stations can now send data in unused data-slots as shown.
 Using these free slots can be based on a simple round-robin scheme or can be 4.CDMA
uncoordinated using an Aloha scheme.  Code division multiple access systems apply codes with certain characteristics
 This scheme allows for the combination of, e.g., isochronous traffic with fixed to the transmission to separate different users in code space and to enable access
bitrates and best-effort traffic without any guarantees. to a shared medium without interference.
3.5 MACA - collision avoidance
• MACA (Multiple Access with Collision Avoidance) uses short signaling
packets for collision avoidance
• RTS (request to send): a sender request the right to send from a
receiver with a short RTS packet before it sends a data packet
• CTS (clear to send): the receiver grants the right to send as soon as it
is ready to receive  All terminals send on the same frequency probably at the same time and can
• Signaling packets contain use the whole bandwidth of the transmission channel.
• sender address  Each sender has a unique random number, the sender XORs the signal with
• receiver address this random number.
• packet size  The receiver can “tune” into this signal if it knows the pseudo random
• MACA avoids the problem of hidden terminals number, tuning is done via a correlation function
Disadvantages:
 higher complexity of a receiver (receiver cannot just listen into the medium and
start receiving if there is a signal)
 all signals should have the same strength at a receiver
Advantages:
A and C wants to send to B
 all terminals can use the same frequency, no planning needed
A sends RTS first
 huge code space (e.g. 232) compared to frequency space
C waits after receiving CTS from B
• MACA avoids the problem of exposed terminals  interferences (e.g. white noise) is not coded

B wants to send to A,  forward error correction and encryption can be easily integrated

C wants to send to another terminal Example:

Now C does not have to wait for it, cannot receive CTS from A

CS8601-Mobile Computing Page 33 CS8601-Mobile Computing Page 34

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION Unit 1- INTRODUCTION

The following figure shows a sender A that wants to transmit the bits 101. The key of A is
shown as signal and binary sequence Ak. The binary “0” is assigned a positive signal value,
the binary “1” a negative signal value. After spreading, i.e., XORing Ad and Ak, the
resulting signal is As.
Soft handover or soft handoff refers to a feature used by the CDMA and WCDMA
standards, where a cell phone is simultaneously connected to two or more cells (or cell
sectors) during a call. If the sectors are from the same physical cell site (a sectorised site),
it is referred to as softer handoff. This technique is a form of mobile-assisted handover,
for IS-95/CDMA2000 CDMA cell phones continuously make power measurements of a
list of neighboring cell sites, and determine whether or not to request or end soft
handover with the cell sectors on the list.
Soft handoff is different from the traditional hard-handoff process.
With hard handoff, a definite decision is made on whether to hand off or not. The
handoff is initiated and executed without the user attempting to have simultaneous
traffic channel communications with the two base stations. With soft handoff, a
conditional decision is made on whether to hand off. Depending on the changes in pilot

The same happens with data from sender B with bits 100. The result is Bs. As and Bs now signal strength from the two or more base stations involved, a hard decision will

superimpose during transmission. The resulting signal is simply the sum As + Bs as eventually be made to communicate with only one. This normally happens after it is

shown above. A now tries to reconstruct the original data from Ad. The receiver applies evident that the signal from one base station is considerably stronger than those from the

A’s key, Ak, to the received signal and feeds the result into an integrator. The integrator others. In the interim period, the user has simultaneous traffic channel communication

adds the products, a comparator then has to decide if the result is a 0 or a 1 as shown with all candidate base stations. It is desirable to implement soft handoff in power-

below. As clearly seen, although the original signal form is distorted by B’s signal, the controlled CDMA systems because implementing hard handoff is potentially difficult in

result is quite clear. The same happens if a receiver wants to receive B’s data. such systems.

CS8601-Mobile Computing Page 35 CS8601-Mobile Computing Page 36

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial
Unit 1- INTRODUCTION

UNIT III

MOBILE NETWORK LAYER

Mobile IP – DHCP – AdHoc– Proactive protocol-DSDV, Reactive

Routing Protocols – DSR, AODV , Hybrid routing –ZRP, Multicast
Routing- ODMRP, Vehicular Ad Hoc networks ( VANET) – MANET
Vs VANET – Security.

3.1 MOBILE IP
 Mobile IP is an Internet Engineering Task Force (IETF)
standard communications protocol that enhances the existing
IP to accommodate mobility.
 Mobile IP allows mobile computers to stay connected to the
internet regardless of their location & without having to
continually change their IP address.
 Every mobile user needs continuous network connectivity
irrespective of his physical location. The traditional IP does not
support user mobility.
 Mobile IP was created by extending IP to enable users to keep
the same IP address while travelling to different networks.
 Advantages of using Mobile IP :
 It allows fast, continuous low‐cost access to corporate
networks in remote areas where there is no public telephone
system or cellular coverage.
 It supports a wide range of applications from Internet access
and e‐mail to e‐commerce.
 Users can be permanently connected to their Internet
provider and charged only for the data packets that are sent
and received
 It can move from one type of medium to another without losing
connectivity
 Disadvantage of Mobile IP:
 Routing inefficiency problem caused by the “triangle routing”
formed by the home agent, correspondent host, and the
foreign agent.

CS8601-Mobile Computing Page 37 1

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Security risks are the most important problem facing Mobile

IP.  Home Agent (HA)
 Problem in making Mobile IP coexist with the security features  System in the home network of the MN, typically a router.
within the Internet.  Provides several services for the MN :
 Tunnels IP datagrams to the COA.
3.1.1 GOALS, ASSUMPTIONS & REQUIREMENTS
 Maintains a location registry of MA
 Goal of a mobile IP: Supporting end-system mobility while
 Implementation of an HA:
maintaining scalability, efficiency, and compatibility in all
 Implemented on a router that is responsible for the
respects with existing applications and Internet protocols. home network.
 Requirements of Mobile IP:  Implemented on an arbitrary node in the subnet.
 Compatibility: A new standard cannot require changes for Disadvantage: "Double crossing of the router" - A packet for
applications or network protocols already in use. the MN comes in via the router; the HA sends it through the
 Transparency: Mobility should remain “invisible” for many tunnel which again crosses the router.
higher layer protocols and applications.  The HA could be again on the ‘router’ but this time only
 Scalability and efficiency: Introducing a new mechanism acting as a manager for MNs belonging to a virtual home
into the Internet must not degrade the efficiency of the network.
network.  Foreign Agent (FA)
 Security: All messages used to transmit information to
 System in the current foreign network of the MN, typically a
another node about the location of a mobile node must be
router.
authenticated to protect against remote redirection attacks
 It can have COA
3.1.2 MOBILE IP - ENTITIES AND TERMINOLOGIES  Provides several services to MN during its visit to the foreign
network:
 Mobile Node (MN):
 Forwards the tunnel datagrams to the MA.
 Device that moves from home network to Foreign network  Provides security services
 Node that can change the point of connection to the network
 Foreign Network
without changing its IP address.
A new network that MN visits and which is not the home
 Example: laptops with antennas or mobile phones
network
 Home Address:
 Correspondent Node (CN)
Permanent address of the MN in its original network i.e., IP  Communication partner i.e., Node that wants to
address of MN communicate with MN
 Home Network  At least one partner is needed for communication.
Original network the MN was associated with respect to its IP  It can be a fixed or mobile node.
address before moving to new network. No mobile IP support is
needed within the home network.

2 3

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 STEP 1: CN sends the Packet to the IP address(home address)

of the MN
 STEP 2:
 Internet Routes the Packet to the router of the MN’s home
network.
 The HA examines the packet to find whether the MN is
present in its current home network or not.
 If the MN is not present, then the HA encapsulates that
datagram in a new packet.
 Care-of Address (COA)  STEP 3:
 A new address of MN in the foreign network.  The encapsulated packet is tunneled to the FA, which act as
 Two different possibilities for the location of the COA (Types the new destination address.
of COA):  Then FA performs decapsulation to remove the additional
header
(i) Foreign Agent COA - The static IP address of a foreign
 Then forwards the decapsulated packet to the MN.
agent(FA) on a visited network
 STEP 4: MN after receiving the packet from CN forwards a
(ii) Co-located COA - Temporary IP address assigned to
reply packet to the CN by specifying its own IP address along
the MN.
with the address of the CN.
 Represents the current position of the MN on the Foreign 3.1.4. KEY MECHANISMS IN MOBILE IP
network & can be used by only one MN at a time. (MOBILE IP OPERATION STAGES)
 A co-located care-of address can be obtained by Dynamic a) Agent Discovery
Host Configuration Protocol (DHCP). b) Registration
3.1.3 IP PACKET DELIVERY c) Tunneling & Encapsulation
(HOW MOBILE IP WORKS?)

Steps used in the operation of mobile IP: 3.1.4.1 AGENT DISCOVERY

4 5

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

A MN uses a discovery procedure to identify prospective home b) Agent solicitation:

and foreign agents.  Rather than waiting for agent advertisements a MN can sen out
 Task of MN to determine its FA & HA: an agent solicitation.
i) Both HA & FA periodically broadcast Agent Advertisement  This solicitation forces any agents on the link to immediately
message. send an agent advertisement.
ii) A MN must discover a HA before it leaves to a home network.  If MN determines that it is connected to a foreign network, then
iii) A MN must also discover a FA after it moved to a foreign it obtains a COA.
network  Types of COA:
 Uses ICMP Router Discovery Protocol (IRDP). (i) Foreign Agent COA - The static IP address of a foreign agent
ICMP Router Discovery Protocol (IRDP) - Enables host to (FA) on a visited network
broadcast or multicast to discover the IP address (i.e., COA) (ii) Co-located COA - Temporary IP address assigned to the
of their neighbouring routers (i.e., FA) MN.
 Agent Discovery methods:  Represents the current position of the MN on the Foreign
(i) Agent Advertisement network & can be used by only one MN at a time.
(ii) Agent Solicitation.
 A co-located care-of address can be obtained by Dynamic
a) Agent advertisement Host Configuration Protocol (DHCP).
Functions:  Steps:
1. MA (HA, FA) broadcast agent advertisement message at regular
1. It allows the MN to find whether an agent is its HA or a FA.
intervals.
2. If it is FA then get the COA.
2. The MN receiving the agent advertisement message observes
3. It allows the MN to know the type of services provided by the FA.
whether the message is from its own HA & determine whether
4. It allows the MN to know about the allowed registration lifetime
it is on the home network or on the foreign network.
or roaming period for visiting foreign network.
3. If the MN does not wish to wait for the periodic advertisement,
it can send out agent solicitation message that will be
responded to by a MA.
After these steps of advertisements or solicitations the MN can
now receive a COA, either one for an FA or a co-located COA. The
MN knows its location (home network or foreign network) and
the capabilities of the agent.
The next step for the MN is the registration with the HA if the
MN is in a foreign network

NOTE: Upper part represent ICMP while lower part represent 3.1.4.2 REGISTRATION
extension needed for mobility.  If the MN discovers that it is on the home network, then it
operates normally without Mobile IP
6 7

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 If the MN has moved to a new network & obtain the COA from  The registration process involves the exchange of registration
a FA, then this address should be registered with the HA. requests and registration reply messages.
 When the mobile node registers by using a foreign agent, the
 Registration – A MN uses an authenticated registration registration process takes the following steps, which is shown
procedure to inform the HA of its COA. in the figure.
 Registration messages uses UDP Protocol.
 Registration can be done in two different ways:
(i) Registration of the MN through FA

If the COA is at the FA; 1. If MN travels to foreign network, it registers with the FA by
 MN sends its registration request containing the COA to the
FA which then forward the request to the HA. sending a registration request message, which includes
 Now HA will do the mobility binding containing the mobile permanent IP address of the MN & IP address of HA.
node’s home IP address and the current COA.
 Then finally the HA Acknowledges via FA to MN. 2. The FA in turn performs the registration process on behalf of
ii) Directly with HA the MN by sending the registration request message to HA,
which includes permanent IP address of the MN & IP address
of FA(i.e., COA)
3. When the HA receives the registration request, it updates the
“mobility Binding Table”.
4. Then HA sends an acknowledgement (registration reply) to the
FA.
If the COA is co-located; 5-6. The FA in turn updates its “Visitor list” & relays the reply to
 MN sends the request directly to the HA and vice versa.
the MN.
 Also, a registration procedure for MNs returning to their home
network.
REGISTRATION PROCESS:

8 9

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Maps MN’s home address with its current COA

Visitor List:
 Maintained on FA.
 Maps MN’s home address with its MAC address (address of
NIC) & HA’s address.

3.1.4.3 TUNNELLING AND ENCAPSULATION

 Tunneling (data transfer) – Mechanism used to forward IP
datagrams from a home address to a care-of address i.e.,
sending a packet through a tunnel
 A tunnel establishes a virtual pipe for data packets between a
tunnel entry and a tunnel endpoint.
 Two primary functions:
 Encapsulations – Mechanism of taking a packet consisting of
packet header and data and putting it into the data part of a
new packet.
HA encapsulates all the packets addressed to MN & forward
them to FA.
 Decapsulation - The reverse operation, taking a packet out of
the data part of another packet
Mobility Binding Table: FA dencapsulates all the packets addressed to MN & forward
 Maintained on HA of MN. them.

10 11

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Full IP header added to the original IP packet.

 The inner IP header source and destination address identify the
original sender and the receiver.
 The new(outer) header contains HA address as source & COA
Fig. IP encapsulation as destination.

(2) Minimal Encapsulation :

 It is an optional method for mobile IP
Steps in Encapsulation:  In IP-in-IP several fields are redundant.
1. When a HA receives a packet addressed to a MN, it forwards  Minimal Encapsulation will remove these redundancy.
the packet to the COA using IP -within -IP encapsulation
2. Using IP -within -IP , the HA inserts a new IP header in front
of the IP header of any datagram.
3. Destination address is set to the COA.
4. Source address is set to the HA’s address.
5. After stripping out the 1st header, IP processes the packet
again.
There are different ways of performing the encapsulation. They
are:
1. IP-in-IP Encapsulation
2. Minimal Encapsulation
3. Generic Routing Encapsulation
(3) Generic Routing Encapsulation (GRE) :
(1) IP-in-IP Encapsulation:
 This is the mandatory method for Mobile IP.

12 13

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Minimal Encapsulation & IP-in-IP only works for IP while GRE  rec – recursion control field. This field represents a counter
also supports other network layer protocols. that
 Allows the encapsulation of packets of one protocol suite into shows the number of allowed recursive encapsulations.
the payload portion of a packet of another protocol suite.
 rsv – reserved for future use. Must be zero.
 The packet of one protocol suite with the original packet
header and data is taken and a new GRE header is prepended.  ver = 0 for GRE version.
 Together this forms the new data part of the new packet.  Lay 4 protocol specifies the protocol of the packet following
 Finally, the header of the second protocol suite is put in front. the GRE header.
 The outer header is the standard IP header with HA as source
address and COA as destination address. 3.1.5 OPTIMIZATIONS (ROUTE OPTIMIZATION)
 One of the problem with the mobile IP - "Triangular Routing"
 Triangular Routing:
 An inefficient behavior of a non- optimized
mobile IP
 The triangle is made of the three
segments,
 CN to HA
 HA to COA/MN
 MN back to CN.
 Involves two IP routes - Causes unnecessary network traffic
overhead & higher latency
 To optimize the route ;
 Enable direct notification of the CN.HA informs a sender
about the location of MN
 Direct Tunnelling from the CN to MN.
 Binding cache maintained at the CN. Binding cache which
is a part of the local routing table for the CN
 The optimized mobile IP protocol needs four additional
messages:
1. Binding request:
 Any node that wants to know the current location of an MN can
send a binding request to the HA.
 key – used for authentication.  The HA can check if the MN has allowed broadcasting of its
 K bit - if set indicates if authentication key is present. current location.
 S bit - if set indicates if the Sequence number field is present.

14 15

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 If the HA is allowed to reveal the location it sends back a  DHCP is used to merge the world of mobile phones with the
binding update. internet and to support mobility.
 Automatically assigns a unique IP address to each device that
2. Binding update: connects to a network.
 This message sent by the HA to CNs reveals the current  Used to simplify the installation and maintenance of networked
location of an MN. computers.
 The message contains the fixed IP address of the MN and the  If a new computer is connected to a network, DHCP can
COA. provide it with all the necessary information for full system
integration into the network, e.g., addresses of a DNS
 The binding update can request an acknowledgement.
server and the default router, the subnet mask, the
3. Binding acknowledgement: If requested, a node returns this domain name, and an IP address.
acknowledgement after receiving a binding update message.  DHCP is based on a client/server model.
4. Binding warning: If a node decapsulates a packet for an MN,
but it is not the current FA for this MN, this node sends a
binding warning to the HA of the MN.

Fig. Basic DHCP Configuration

1. DHCP clients send a request to a server (DHCPDISCOVER)
to which the server responds.
2. A client sends requests using MAC broadcasts to reach all
devices in the LAN.
3. A DHCP relay might be needed to forward requests across
inter-working units to a DHCP server.

Fig. Client initialization via DHCP

Reverse tunneling is a tunneling from mobile host to home
 The above figure shows one client and two servers.
agent, and makes it possible for the mobile host from foreign
1. The client broadcasts a DHCPDISCOVER into the subnet.
network to communication in the network 2. Two servers receive this broadcast and find the configuration
3.2 DHCP - DYNAMIC HOST CONFIGURATION PROTOCOL they can offer to the client.

16 17

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

3. Servers reply to the client’s request with DHCPOFFER and  Used to simplify the installation and maintenance of
offer a list of configuration parameters. networked computers.
4. Then the client can choose one of the configurations offered.  MANET are formed dynamically by an autonomous system
5. Then the client in turn replies to the servers, accepting one of of mobile nodes that are connected via wireless links.
the configurations and rejecting the others using DHCP  No existing fixed infrastructure or centralized
REQUEST. administration
6. If a server receives a DHCP REQUEST with a rejection, it can  Mobile nodes are free to move randomly i.e., network
free the reserved configuration for other possible clients. topology changes frequently.
7. The server with the configuration accepted by the client now  Each node work as a router.
confirms the configuration with DHCP ACK. This completes
the initialization phase.
8. If a client leaves a subnet, it should release the configuration
received by the server using DHCP RELEASE.
9. The configuration a client gets from a server is only leased for
a certain amount of time, it has to be reconfirmed from time to
time.

3.3.1 MOBILE AD-HOC (MANET)

 Types of wireless network:

 Infrastructured:
 The MN can move while communicating
 The BSs are fixed
3.3.2 FEATURES OF MANET
 As the node goes out of the range of a BS, it gets into the
range of another BS.  MANET can be formed without any pre-existing infrastructure.
 It follows dynamic topology where nodes may join and leave the network
at any time and the multi-hop routing may keep changing as nodes join
and depart from the network.
 It does have very limited physical security, and thus increasing security
is a major concern.
 Every node in the MANET can assist in routing of packets in the network.
 Limited Bandwidth & Limited Power

 Infrastructureless or Mobile ad-hoc (MANET): 3.3.3 CHARACTERISTICS OF MANET

 The MN can move while communicating
1. Lack of fixed infrastructure
 There are no fixed BSs.
– bring new n/w designing challenges.
 All the nodes in the network need to act as routers.

18 19

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

– Pair of nodes can either communicate directly when they are in within the Dynamic topology membership may disturb the trust relationship
range or can communicate via multi-hop communication. among node.
2. Dynamic topologies : 3) Routing Overhead:
– n/w topology can change unpredictably because of the mobility of devices Unnecessary routing overhead since nodes often change their location
in MANET within network.
– Rate of topology change depends on the speed of mobile movement 4) Hidden terminal problem:
3. Bandwidth constrained, variable capacity link: The hidden terminal problem refers to the collision of packets at a
– Wireless link have lower capacity compare to wired link receiving node due to the simultaneous transmission of those nodes that
– Factors affecting Bandwidth: Noise, Interference……. are not within the direct transmission range of the sender, but are within
4. Energy constrained operation: the transmission range of the receiver.
– Nodes depends on battery power
5) Packet losses due to transmission errors:
– Small battery – limited amount of energy
Much higher packet loss due to factors such as increased collisions due
– Need more energy during Routing
to the presence of hidden terminals, presence of interference, uni-
– “Energy Conservation” – important objective of MANET routing protocol
directional links, frequent path breaks due to mobility of nodes.
5. Increased vulnerability:
– New type of security threats 6) Mobility-induced route changes:
– Increased the possibility of eavesdropping, spoofing, DOS attacks. The network topology in an ad hoc wireless network is highly dynamic
– Difficult to identify the attacker because: due to the movement of nodes; hence an on-going session suffers
• Devices keeps on moving frequent path breaks. This situation often leads to frequent route
• Do not have global Identifier changes.

7) Battery constraints:
Devices used in these networks have restrictions on the power source in
order to maintain portability, size and weight of the device.

8) Security threats:
Brings new security challenges to the network design. As the wireless
medium is vulnerable to eavesdropping.

3.3.4 CHALLENGES / CONSTRAINTS / DESIGN ISSUES OF MANET

1) Limited bandwidth: 3.3.5. APPLICATIONS OF MANET

Limited bandwidth because of the effect of multiple access, fading, noise,
and interference conditions, etc.,
2) Dynamic topology:

20 21

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

– LSP (Link State Protocol)

– DVP (Distance Vector Protocol)
Both of these needs to find the next hop along the shortest path towards the
destination

 LINK STATE ROUTING

 Link – connection of one router to its neighboring router

 Each router maintains;

 LSPDB (Link State DataBase) - Router store its local connectivity

information & flood this through “Link state advertisement”
 Routing Table

 Content of (LSP) Link Sate Packet or (LSA) Link State Advertisement:

 Identity of the router originating the message

 Identities of all its neighbors
 Delay along various link to its neighbors
 Unique seq.no, which is formed by increasing the count every time the
router forms a new link state advertisement.

 Procedure:

1. Exchange of HELLO messages to find the neighbors.

2. Compute the cost between the neighbors
3. Build up LSP.
4. Flooding LSP – Broadcast the LSP
5. Compute the new path using Dijkstra’s algorithm

3.3.6 AD-HOC MOBILE ROUTING PROTOCOLS

 Routing is a process of finding an efficient, reliable and secure path from

a source node to a destination node via intermediate nodes in a network.
 Efficiency of the path is measured in various metrics like, Number of
hops, traffic, security, etc.

3.3.6.1 TRADITIONAL ROUTING PROTOCOLS  Exchange of HELLO messages - to learn its direct neighbors

• Not suitable for MANET.

• Popularly used in packet switching n/w

22 23

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Flooding LSP – for example Router E sends its LSP on all its links and
routers D, B and C insert the LSP in their LSDB and forward it over their
other links.

 Each router computes the spanning tree by using Dijkstra’s shortest path
algorithm

 Link state databases received by all routers- By combining the received

LSPs with its own LSP, each router can compute the entire network 2. DISTANCE VECTOR ROUTING (DV) Protocols
topology.
• Manipulates vectors (distance, direction) of distances to other nodes in the
network.
• Distance – no. of hops b/w 2 nodes
• Direction – Next hop router to which the packet is forwarded
• Other name: Distributed Bellman-Ford algorithm or RIP(Routing
Information Protocol)

24 25

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

• Each router maintain routing table. 3.3.6.2 PROACTIVE PROTOCOLS (Table-driven routing protocol)
• All available destination (Dest)
 Maintain the global topology information in the form of tables at every node.
• Next node to reach to destination (Next)
• No. of hops to reach the destination (Metrics)  These tables are updated frequently in order to maintain consistent and

1. Periodically advertises its routing table to its neighbors accurate network state information.

2. Neighbors updates its own routing table by examining the received  EX: DSDV, WRP, and STAR.
information, which in inform its neighbors.
DESTINATION-SEQUENCED DISTANCE-VECTOR ROUTING (DSDV)
3. Computes shortest path to each host based on the information advertised
by its neighbours.  Based on Proactive method

 Enhanced version of the distributed Bellman-Ford algorithm or Distance

Vector(DV) Routing Protocol

 DSDV adds two things to the distance vector algorithm

 Sequence Number:
 Each routing advertisement comes with a sequence number.
 Within ad-hoc networks, advertisements may propagate along many
paths.
 Sequence numbers help to apply the advertisements in correct order.
 This avoid the loops in the network.
 Damping:
 Transient changes in topology that are of short duration should not
weaken the routing mechanisms.
 Unstable changes in the topology are not forwarded

Example Ad-hoc network

26 27

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 2 step process

 Route Discovery

 Route Maintenance

 Route discovery is expensive

 Example: Dynamic Source Routing (DSR), Ad hoc On-demand Distance

Vector (AODV)

(a) DYNAMIC SOURCE ROUTING PROTOCOL (DSR)

 For each node N1 maintain a table that contain;
 The next hop toward this node  DSR is a source initiated on-demand(or reactive) routing protocol for ad-hoc
 The metric (number of hops) network
 The sequence number
 The time at which the path has been installed first.  Designed to restrict the bandwidth consumed by packets by eliminating the
 Important steps in the operation of DSDV: periodic table-update messages i.e., the nodes do not need to exchange the
1. Each router(node) in the network collects route information from its routing information periodically, which helps to reduce the bandwidth
neighbours. overhead.
2. After gathering information, the node determines the shortest path to the  Each mobile node participating in the protocol maintains a “routing cache”
destination based on the gathered information. which contains the list of all routes that the node has learnt
3. Based on the gathered information, a new routing table is generated.
4. The router broadcasts this table to its neighbours. On receipt by  DSR works in 2 phases:
neighbours, the neighbour nodes recompute their respective routing
(a) Route Discovery:
tables.
 Allows any host to dynamically discover the route to any destination in
5. This process continues till the routing information becomes stable.
the ad-hoc network.
 Advantages
 Route Discovery Process takes place by :
 Simple
1. Broadcasting a route request (RREQ) packet to all its neighbours.
 Loop free through destination seq. numbers
 The Route request (RREQ) packet contains the
 No latency caused by route discovery
i) Source address
 Disadvantages
ii) Request id
 No sleeping nodes
iii) Route Record, in which the sequence of hops traversed by the
 Overhead: most routing information never used
request packet before reaching the destination is recorded.
3.3.6.3 REACTIVE PROTOCOLS (On-demand routing protocol) 2. A node after receiving RREQ
2.i. If the node is an intermediate node then
 They execute the path-finding process and exchange routing information  If the message has the same ID i.e. has seen it before, then the node
only when a path is required by a node to communicate with a destination. discards this message,
 i.e., a route is discovered only when it is necessary.  If not, the node appends its own address to the route record in the
ROUTE REQUEST message then propagates the message to the next
 Source initiates route discovery hop neighbours.

28 29

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

2.ii. If the node is the Target (Destination) then o RREP – Route reply
 Returns a Route Reply (RREP) message to the sender o RERR – Route error
 Copies the accumulated route record from RREQ into RREP o HELLO – For link status monitoring
 Advantages:
 A perfect route is discovered always.
 Highly efficient.
 Low bandwidth Consumption.
 Drawback:
 Packet header size (Non Uniform Packet Size) grows when intermediate
node increases.
 Flood of route requests may potentially reach all nodes in the network
(b) AD HOC ON-DEMAND DISTANCE VECTOR ROUTING (AODV)
Fig. Broadcasting the RREQ packets
 Based on Reactive method
 DSR vs AODV:
 Major problem of DSR is its non-uniform packet size because it includes
source routes in its packet header which degrades the performance. If a
packet is large, it has to be split into smaller packets.
 The packet size in AODV is uniform unlike DSR.
 AODV attempts to improve on DSR by maintaining routing tables at the
nodes, so that data packets do not have to contain routes.
 AODV holds the desirable feature of DSR that routes are maintained only
Fig. Propagation of RREP packets back to source between nodes which need to communicate.
(b) Route Maintenance:  Route is established only when it is required by a source node for
 A known route can get broken due to the movement of some node or the transmitting data packets
battery of a node getting exhaused.  Make use of hop-by-hop routing, sequence numbers and beacons.
 Route maintenance : The process of monitoring the correct operation of  Steps:
a route in use & taking corrective action when needed. 1. The node that needs a route to a specific destination generates a route
 Steps: request(RREQ).
1. When a node detects that one of its next hop neighbour node is not 2. The route request(RREQ) is forwarded by intermediate nodes which also
responding, it sends back a route error(RERR) packet containing its learn a reverse route from the source to themselves.
own address and the address of the hop that is not working 3. When the request reaches a node with route to destination, it generates a
2. As Soon as source node receives the RERR message it deletes the
route reply(RREP) containing the number of hops required to reach the
broken link route from its cache.
destination.
3. If it has another route to the destination, it starts to retransmit the
packet using the alternative route. 4. All nodes that participate in forwarding this reply to the source node
4. Otherwise it initiates the route discovery process again. create a forward route to destination.
The basic message set consists of: 5. This route created from each node from source to destination is a hop-
o RREQ – Route request by-hop route.

30 31

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Example: Suppose Node S needs a routing path to Node D

1. Node S creates a RREQ packet & broadcasts to its neighbours.

RREQ [D's IP addr, Seq#, S's IP addr, hopcount]

2. Node A rebroadcasts RREQ to all its neighbours. 6. Set forward path in S's routing table

3. Since, Node C known a route to Node D

 Node C creates a RREP & unicasts RREP to A.
 Set forward path in C's routing table.

Difference between DSR, DSDV & AODV

Property DSR DSDV AODV

Loop Free Yes Yes Yes
Multicast Routes Yes No No
Unidirectional Link Yes No No
Periodic Broadcast No Yes Yes
4. Node A creates a RREP & unicasts RREP to S
Routes maintained Route Cache Route Table Route Table
5. Set forward path in A's routing table Reactive Yes No Yes

32 33

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

3.3.6.4 HYBRID PROTOCOLS  Interior nodes - Nodes A-F

 Peripheral nodes - Nodes G-J
 Combines the best features of both proactive & reactive routing protocols.  Node K is outside the routing zone
 Eg: ZONE ROUTING PROTOCOL (ZRP)  Within the zone table driven is used
 Outside the zone On demand Route Discovery is used
ZONE ROUTING PROTOCOL (ZRP)
 Procedure:
 It is Hybrid Protocol 1. The source sends a Route Request packet (RREQ) to the border nodes of its
zone, containing its own address, destination address and the unique
 Based on the concept of zones.
sequence no.
 A routing zone is defined for each node separately and zones of 2. Each border nodes checks its local zone for the destination.
neighbouring nodes overlap. 3. If the destination is not a member of local zone, then the border node adds
 The routing zone has a radius expressed in hops. i.e., Zone radius: Number its own address to the route request packet and forwards the packet to its
of hops own border nodes.
4. When the destination node is reached in this process, a route reply (RREP)
 Key concept in ZRP to:
is sent on the reverse path back to the source.
 Use a proactive routing scheme within a limited zone 5. The source saves the path which is mentioned in Route Reply to send data
 Use a reactive routing scheme for nodes beyond this zone.
packets to the destination
 Routing is divided into two parts: 3.3.7 MULTICAST ROUTING PROTOCOL
o Intrazone routing: 1st the packet is sent within the routing zone of  Multicast is the delivery of a message to a group of destination nodes in a
the source node to reach the peripheral nodes single transmission.
 Multicast Protocols are
o Interzone routing: The packet is sent from the peripheral nodes
towards the destination node Tree based Protocol and Mesh based Protocol
a) Tree based Protocol
 This establishes a single path between any two nodes in the multicast
group.
 Example: AMRoute, AMRIS
 The tree consists of root node(r), three intermediate nodes (p,s,t) and seven
group members.
 For node u, the packet transmission is relayed through two tree links, that
is, from r to q and then q to u.
o To maintain the tree structure even when nodes move, group members
 In the diagram the routing zone of S includes the nodes A-I, but not K. periodically send Join Request message.
 The nodes are divided into peripheral nodes and interior nodes.
 Peripheral nodes: Nodes whose minimum distance is less than the radius.

34 35

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

ON-DEMAND MULTICAST ROUTING PROTOCOL (ODMRP)

 Provides richer connectivity among multicast members using a mesh based

approach.
 Supplies multiple route for one particular destination.
 Helps in case of topology changes & node failures.
 Use the concept of Forwarding Group - A subset of nodes forwards multicast
packets.
 Operation of ODMRP:
1. A sender node wishing to send multicast packets periodically floods a JOIN
REQUEST to entire network.
b) Mesh Based Protocol
2. A Node receiving a non-duplicate JOIN REQUEST, stores the upstream node
o This establishes a multiple path between source - receiver pair. ID (i.e. backward learning) into routing table & rebroadcasts the packet.
o Example: ODMRP, CAMP
o Tree based protocols, may not perform well in the presence of highly mobile
nodes because multicast tree structure is fragile and needs to be frequently
readjusted.
o Each node in a mesh can have multiple parents.
o Multiple links exist and other links are immediately available when the
primary link is broken due to node mobility. This avoids frequent
reconfigurations.
o Sending a Packet from R to U involves three transmissions(R,Q,U) &
fourteen receives(5 neighbours of R,6 neighbours of Q and 3 neighbours of 3. A multicast receiver getting the JOIN REQUEST creates or updates the source
U). entry in its member table.
4. As long as valid entries in receiver's member table, JOIN TABLE are
o For eg, the transmission from node Q is received not only by U but also be
broadcasted periodically.
neighbour nodes R,S,T,W and X; the redundant link from Q to W may be
useful when the path from P to W is broken

o Drawback of this scheme is that multiple copies of the same packet are 5. An intermediate node, receiving the JOINT TABLE, compares it's Node ID with
forwarded through the mesh. the entries of that table.

36 37

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

6. If there's a match, it is a member of the forwarding group. Then it sets FG- The term VANET became mostly synonymous with the more generic
FLAG & broadcasts its JOIN TABLE. term inter-vehicle communication (IVC).
7. This process is going to create a mesh between all forwarding group
members. VANET is an application of mobile ad hoc network. More precisely a VANET
8. JOIN TABLE is propagated by each forwarding Group member until it reaches is self-organised network that can be formed by connecting vehicle aiming to
source via a shortest path. improve driving safety and traffic management with internet access by drivers
9. Routes from source to receivers builds a mesh of nodes called "Forwarding
and programmers.
Group"
WORKING OF VANET

VANET turns every participating car into a wireless router or node, allowing
cars approximately 100 to 300 meters of each other to connect and, in turn,
create a network with a wide range.

As cars fall out of the signal range and drop out of the network, other cars can
join in, connecting vehicles to one another so that a mobile Internet is created.

It is estimated that the first systems that will integrate this technology are police
and fire vehicles to communicate with each other for safety purposes.
3.4 TYPES OF MANET COMMUNICATION IN VANET
 VANET - VEHICULAR AD HOC NETWORKS: Used for communication between
vehicles and roadside equipment. Two types of communication are provided in the VANET.
 SPANET - SMART PHONE AD HOC NETWORKS : Used to create peer-to-peer  First a pure wireless ad hoc network where vehicle to vehicle without
networks without relying on cellular carrier networks, wireless access points, any support of infrastructure.
or traditional network infrastructure.  Second is communication between the road side units (RSU), a fixed
 i MANET - INTERNET BASED MOBILE ADHOC NETWORKS : Used to link infrastructure, and vehicle.
mobile nodes and fixed Internet-gateway nodes.
 Military / Tactical MANET : Used by military units with emphasis on security,
range, and integration with existing systems.
3.4.1 VANET: VEHICULAR AD - HOC NETWORK
The Vehicular Ad-Hoc Network, or VANET, is a technology that uses moves
cars as nodes in a network to create a mobile network.

Vehicular Ad Hoc Networks (VANETs) are created by applying the principles

of mobile ad hoc networks (MANETs) - the spontaneous creation of a wireless
network for data exchange - to the domain of vehicles. They are a key
component of intelligent transportation systems (ITS).

38 39

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

ARCHITECTURE OF VANET  Rapidly changing network topology: Due to high node mobility and
random speed of vehicles, the position of node changes frequently. As a
Each node in VANET is equipped with two types of unit i.e. On Board result of this, network topology in VANETs tends to change frequently.
Unit(OBU) and Application Unit (AU). OBU has the communicational
capability whereas AU executes the program making OBU‘s communicational  Unbounded network size: VANET can be implemented for one city,
capabilities. An RSU can be attached to the infrastructure network which is several cities or for countries. This means that network size in VANET is
connected to the Internet.
geographically unbounded.

 Frequent exchange of information: The ad hoc nature of VANET

motivates the nodes to gather information from the other vehicles and
road side units. Hence the information exchange among node becomes
frequent.

 Wireless Communication: VANET is designed for the wireless

environment. Nodes are connected and exchange their information via
wireless. Therefore some security measure must be considered in
communication.

 Time Critical: The information in VANET must be delivered to the nodes

with in time limit so that a decision can be made by the node and perform
action accordingly.

APPLICATIONS OF VANET

Safety Related Application:

TECHNOLOGY USED IN VANET These applications are used to increase the safety on the roads. These
applications can be further categorised in following way.
 To establish a VANET, IEEE has defined the standard 802.11p or 802.16
(WiMax). A Dedicated Short Range Communication (DSRC) is proposed  Collision Avoidance: If a driver gets a warning message on time then the
which is operating on 5.9GHz band and uses 802.11 access methods. collision can be avoided.
 It is standardized as 802.11p which provides short range communication
with low latency.  Cooperative Driving: Drivers can get traffic related warning signals & these
signals can co-operate the driver for an uninterrupted and safe driving.
CHARACTERISTICS OF VANET
 Traffic optimization: Traffic can optimized by the use of sending signals
 High Mobility: The nodes in VANETs usually are moving at high speed. like jam, accidents etc. to the vehicles so that they can choose their alternate
This makes harder to predict a node’s position and making protection of path and can save time.
node privacy
User Based Application:
40 41

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

These applications provide the user infotainment. A VANET can be utilised to  Lack of physical boundary: Each mobile node functions as a router &
provide following services for the user apart from safety: forwards packets from other nodes. AS a result, network boundaries become
blurred. So it is difficult to deploy firewalls or monitor the incoming traffic.
 Peer to peer application: These application are useful to provide services
like sharing music, movies etc. among the vehicles in the network.  Low power RF transmission: It if possible for a malicious node having high
power RF transmission capability to continuously transmit & monopolise
 Internet Connectivity: People always want to connect with the Internet all
the medium & cause its neighbouring nodes or the entire targeted MANET
the time. Hence VANET provides the constant connectivity of the Internet
to wait endlessly for transmitting their messages. Also signal jamming can
to the users.
lead to denial-of-service(DOS) attack.
 Other services: VANET can be utilised in other user based application such
 Limited computational capabilities: Nodes in an ad hoc network usually
as payment service to collect the tall taxes, to locate the fuel station,
have limited computational capabilities. It therefore becomes difficult to
restaurant etc.
deploy compute-intensive security solutions such as setting up a public-key
CHALLENGING ISSUES IN VANET cryptosystem. Inability to encrypt messages invites a host of security attacks
such as spoofing as well as several other forms of routing attacks.
 Network Management: Due to high mobility, the network topology and
channel condition change rapidly.  Limited power supply: Since nodes normally rely on battery power, an
attacker might attempt to exhaust batteries by causing unnecessary
 Congestion and Collision Control: The unbounded network size also
transmissions to take place at the targeted node or might cause excessive
creates a challenge. The traffic load is low in rural areas and night in even
computations to be carried out by the targeted nodes.
urban areas. In rush hours the traffic load is very high and hence network is
congested and collision occurs in the network.  Real time Constraint: VANET is time critical where safety related message
should be delivered with 100ms transmission delay. So to achieve real time
 Environmental Impact: VANETs use the electromagnetic waves for
constraint, fast cryptographic algorithm should be used. Message and entity
communication. These waves are affected by the environment.
authentication must be done in time.
 MAC Design: VANET generally use the shared medium to communicate
 Data Consistency Liability: In VANET even authenticate node can perform
hence the MAC design is the key issue.
malicious activities that can cause accidents or disturb the network. Hence a
 Security: As VANET provides the road safety applications which are life mechanism should be designed to avoid this inconsistency. Correlation
critical therefore security of these messages must be satisfied among the received data from different node on particular information may
avoid this type of inconsistency.

 Low tolerance for error: Some protocols are designed on the basis of
probability. VANET uses life critical information on which action is
performed in very short time. A small error in probabilistic algorithm may
cause harm.
SECURITY ISSUES IN VANET
MANET Vs VANET

42 43

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

UNIT IV
MANET VANET
Collection of mobile nodes that Nodes(vehicles) can communicate MOBILE TRANSPORT AND APPLICATION LAYER
communicate with each other over with certain roadside infrastructures
Mobile TCP - WAP – Architecture – WDP – WTLS – WTP – WSP – WAE - WTA -
bandwidth constrained wireless links or base stations. Architecture - WML
without any infrastructure support.
The node movement is more random The node mobility is constrained to
MOBILE TRANSPORT LAYER
in nature the road topologies. 4.1 Traditional TCP improvements
Power is a major constrained The battery power available in a There are several mechanisms of the Transmission Control Protocol (TCP) that
vehicle is quite adequate. influence the efficiency of TCP in a mobile environment.
Cost of production is cheap Expensive Improvement in TCP: TCP was initially designed for wired (traditional)
networks
Change in network topology is slow Frequent & very fast
4.1.1 Slow start
Node lifetime depends on power depends on lifetime of vehicles 4.1.2 Congestion Avoidance
resource 4.1.3 Fast retransmit/fast recovery
Multi-hop routing is available. Weakly available. 4.1.1 Slow start
Attribute based addressing scheme Location-based  The behaviour TCP shows after the detection of congestion is called slow
start
 Instead of starting transmission at a fixed transmission window size, the
transmission is started at the lowest window size and then doubled after
each successful transmission.
 If congestion is detected, the transmission window size is reduced to half of
its current size.
 The sender always calculates a congestion window for a receiver.
1. The start size of the congestion window is one segment.
2. The sender sends one packet and waits for acknowledgement.
3. If this acknowledgement arrives, the sender increases the congestion
window by one, now sending two packets.
4. After arrival of the two corresponding acknowledgements, the sender again
adds 2 to the congestion window, one for each of the acknowledgements.
5. Now the congestion window equals 4.
6. This scheme doubles the congestion window every time the
acknowledgements come back, which takes one round trip time (RTT). This
is called the exponential growth of the congestion window in the slow start
mechanism.

44 1

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 It does not wait until the timer expires it retransmit a packet whenever
sender is getting 3 duplicate acknowledgements.
 After retransmitting a packet it sets the window size is reduced to its half

4.1.2 Congestion Avoidance

 Drawback in slow start: It is too dangerous to double the congestion
window each time because the steps might become too large
 Solution:
 Window size is doubled until it reaches a threshold level.
 When it reaches a threshold level, then window size is increased linearly. 4.2 Classical TCP Improvements For Wireless NETWORK
 If congestion is occurred, then the window size is reduced to half of its
size. Mechanisms to increase TCP’s performance in wireless and mobile
 If it reaches zero then again slow start begins environments:
 Congestion avoidance start when slow start stops
4.2.1 Indirect TCP (I-TCP)
4.2.2 Snooping TCP (S-TCP)
4.2.3 Mobile TCP (M-TCP)
4.2.4 Fast retransmit/fast recovery
4.2.5 Transmission/time-out freezing
4.2.6 Selective retransmission
4.2.7 Transaction-oriented TCP (T-TCP)
4.3.1 Indirect TCP (I-TCP)
 Two competing insights led to the development of indirect TCP:
1) TCP performs poorly together with wireless links
2) TCP within the fixed network cannot be changed
 Working:
 I-TCP segments a TCP connection into a fixed part and a wireless part.
4.2.3 Fast retransmit/fast recovery  Mobile host connected via a wireless link and an access point to the ‘wired’
 The sender can retransmit the missing packet(s) before the timer expires. internet where the correspondent host resides. The correspondent node
could also use wireless access.
2 3

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 The FA tries to retransmit this packet locally to maintain reliable data

transport.
 Case2: If the packet is lost on the wireless link:
 The MN notice this much faster due to the lower round trip time and
can directly retransmit the packet.
 Packet loss in the wired network is now handled by the FA.
 Advantages with I-TCP:
1. TCP does not require any changes in the TCP protocol as used by the hosts
in the fixed network.

 Standard TCP is used between the fixed computer and the access point. 2. Due to the strict partitioning into two connections, transmission error
 The foreign agent (access point) acts as a proxy and relays all data in both cannot propagate into the fixed network.
directions. 3. Partitioning into two connections allows the use of a different transport
 Packet delivery: layer protocol between the FA and the MN.
 If CN sends packet, FA acknowledges packet and forwards packet to MN 4. Different solutions can be tested or used at the same time without
 If MN receives packet, it acknowledges disturbing the stability of the Internet.
 This acknowledgement only used by CN  Disadvantages of I-TCP:
 Similarly if MN sends packet, FA acknowledges packet and forwards it to CN 1. The loss of the end-to-end semantics of TCP might cause problems if the
FA partitioning the TCP connection crashes:
2. Increased handover latency may be much more problematic
3. The FA must be integrated into all security mechanisms.
4.3.2 Snooping TCP (S-TCP)
 The segmentation drawback of I-TCP is eliminated by Snooping TCP.
 "The FA buffers all packets with destination MN and additionally ‘snoops’
the packet flow in both directions to recognize acknowledgements"
 Reason for buffering: To enable the FA to perform a local retransmission in
case of packet loss on the wireless link.

 Packet Loss:
 Case1 : If a packet is lost on the wireless link due to a transmission error:  Data transfer to the MH ( Mobile Host)
 Then the CN would not notice this.  FA buffers data until it receives ACK of the MH
 FA detects packet loss via duplicated ACKs or time-out
 Data transfer from the MH (Mobile Host)
4 5

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 FA detects packet loss on the wireless link via sequence numbers, FA  Prevent the sender window from shrinking if bit errors or disconnection.
answers directly with a negative acknowledgement (NACK) to the MH
 MH can now retransmit data with only a very short delay  Improve overall throughput
 Lower the delay
 Maintain end-to-end semantics of TCP
 Provide a more efficient handover
 Adapted to the problems arising from lengthy or frequent disconnections
 The M-TCP splits up the connection into two parts:
 An unmodified TCP is used on the Standard host-Supervisory Host
section
 An optimised TCP is used on the Supervisory Host- Mobile Host section.

 Advantages:
1. The approach automatically falls back to standard TCP if the
enhancements stop working.
2. The CN does not need to be changed since most of the enhancements are  The SH is responsible for exchanging data to both the Standard host and

in the FA. the Mobile host.

3. It does not need a handover of state as soon as the MH moves to another  In this approach, we assume that the error bit rate is less as compared to

FA. other wireless links.

4. It does not matter if the next FA uses the enhancement or not. If not, the  So if any packet is lost, the retransmission has to occur from the original

approach automatically falls back to the standard solution. sender and not by the SH.

 Disadvantages: 1. The SH monitors the ACKs being sent by the MH.

1. Snooping TCP does not isolate the behaviour of the wireless link as good 2. If for a long period ACKs have not been received, then the SH assumes that

as I-TCP. the MH has been disconnected.

3. If so the SH blocks the sender by setting its window size to 0.
2. Additional mechanism for negative acknowledgements (NACK) between FA
4. Then the sender goes into persistent mode i.e. the sender will not try to
and MH.
retransmit the data.
3. Snooping and buffering data may be useless if certain encryption schemes 5. Now when the SH detects a connectivity established again with the MH,
are applied end-to-end between the correspondent host and mobile host. the window of the sender is restored to original value.
 Advantages of Mobile TCP:
4.3.3 Mobile TCP (M-TCP) 1. M-TCP maintains the TCP end-to-end semantics.
 I-TCP and S-TCP does not work well, if a MH is disconnected. 2. If the MH is disconnected, it avoids useless retransmissions, slow starts or
breaking connections by simply shrinking the sender’s window to 0.
 The M-TCP has the same goals as I-TCP and snooping TCP 3. M-TCP does not buffer data so, no forwarding.
 Goals of M-TCP:  Disadvantages of Mobile TCP:
6 7

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

1. The SH does not act as proxy 2. Independent of any other TCP mechanism, such as ACKs, sequence
2. M-TCP assumes low bit error rates, which is not always a valid numbers etc.
assumption.
 Disadvantages:
3. Requires new network elements like the bandwidth manager.
4.3.4 Fast retransmit/fast recovery (i) The software on the MN and CN needs to be changed.
 Change of FA often results in a packet loss. TCP reacts with slow start
(ii) Depends on MAC layer
although there is no congestion.
 Solution: Fast retransmit method. 4.3.6 Selective retransmission
 Fast retransmit method: When a MH moves to a new FA, it transmits the  TCP acknowledgements are cumulative.
ACK of the last packet was received.  ACK n acknowledges correct & in-sequence receipt of packet up to n.
 If a single packet is lost quite often a whole packet sequence beginning at
 It is indication for the CN to continue transmission at the same rate it did
the gap has to be retransmitted.
before MH moves to another FA.
 Bandwidth wastage.
 This approach puts the CN to fast retransmission mode.  Solution: Selective Retransmission
Advantages:  Allows the receiver acknowledge a single packets
1. It is simple.  Now the sender can retransmit only the missing packet.
2. Only minor changes in the MN software results in performance increase.  Advantage:
 The sender retransmits only the lost packets.
3. No FA or CN host has to be changed.
 Much higher efficiency. Lowers bandwidth requirement
Disadvantages: Increased time delay in the retransmitted packets to move
 Disadvantage: More complex software on the MH.
from CN to MH.
4.3.7 Transaction-oriented TCP (T-TCP)
4.3.5 Transmission/time-out freezing
 TCP requires several trans reception of packets for:
 In normal TCP, a disconnection takes place when the connection is lost for  Connection setup
a longer time.  Data transmission
 Example: When a MN moving through a tunnel or passing black out areas,  Connection release.
the connection is lost and it needs to make connection once again, when it (-) Even a short message needs minimum of 7 packets leads to connection
comes back. overhead.
 TCP freezing:  Solution: T-TCP
 MAC layer is often able to detect interruption in advance  Connection setup, Data transmission, Connection release can be
 MAC can inform TCP layer of upcoming loss of connection combined, thus only 2 or 3 packets are needed.
 TCP stops sending, but does not assume a congested link.  Reduces the total overhead.
 Advantage: Reduction in overhead.
 MAC layer signals again if reconnected.
 Disadvantage: Requires changed TCP, Mobility not longer transparent.
 Advantages:
COMPARISON OF VARIOUS TCP
1. Offers a way to resume TCP connection even after longer interruptions
of the connection.
Approach Mechanism Advantages Disadvantages

8 9

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

Splits TCP connection Isolation of wireless Loss of TCP  Features:

into two connections link, simple. semantics.
 Interoperable: Allowing terminals and software from different vendors to
Higher latency at
Indirect TCP communicate with networks from different providers
handover,
security  Scalable: Protocols and services should scale with customer needs and
problems.
number of customers
Snoops data and Transparent for end Insufficient  Efficient: Provision of QoS suited to the characteristics of the wireless
acknowledgements, to end connection, isolation of
Snooping TCP and mobile networks
local retransmission MAC integration wireless link,
possible security problems  Reliable: Provision of a consistent and predictable platform for deploying
services
Splits TCP Maintains end to Bad isolation of
connection, chokes end semantics, wireless link,  Secure: Preservation of the integrity of user data, protection of devices
sender via window handles long term processing and services from security problems.
M-TCP
size and frequent overhead due to
disconnections bandwidth mgmt, WAP Architecture:
security problems  WAP is designed in a layered fashion, so that it can be extensible, flexible,
Fast Avoids slow start ate Simple and efficient Mixed layers, not and scalable. The WAP protocol stack is divided into five layers −
Retransmission roaming transparent.  Layers of WAP Protocol:
/Fast Recovery
 Application Layer (Wireless Application Environment (WAE))
Freezes TCP state at Independent of Changes in TCP  Session Layer(Wireless Session Protocol (WSP))
Transmission / disconnection, content, works for required,MAC
Time out freezing resumes after longer interruptions dependent  Transaction Layer(Wireless Transaction Protocol (WTP))
reconnection  Security Layer(Wireless Transport Layer Security (WTLS))

Retransmits only lost Very efficient Slightly more  Transport Layer(Wireless Datagram Protocol (WDP))
data. complex receiver a) Bearer services
Selective
software, more
retransmission  The basis for transmission of data is formed by different bearer services.
buffer space
needed WAP uses existing data services and will integrate further services.
Combines connection Efficient for certain Changes in TCP  Example:
setup-/ release and applications required not  Message services such as short message service (SMS) of GSM, Circuit-
data retransmission transparent, switched data such as high-speed circuit switched data (HSCSD) in GSM
Transaction
security
oriented TCP  Packet switched data such as general packet radio service (GPRS) in
problems.
GSM.
 Many other bearers are supported, such as CDPD, IS-136,PHS.
 No special interface has been specified between the bearer service
b) Transport Layer (Wireless Datagram Protocol (WDP))
 The transport layer with its wireless datagram protocol (WDP) and the
4.4 WIRELESS APPLICATION PROTOCOL (WAP)
additional wireless control message protocol (WCMP) offers a bearer
 WAP is used to enable the access of internet in the mobile phones or PDAs. independent, reliable datagram-oriented service to the higher layers of the
 The wireless application protocol forum (WAP Forum) was founded in
June 1997 by Ericsson, Motorola, Nokia, and Unwired Planet. WAP architecture
 WAP is independent of OS that means WAP can be implemented on any OS

10 11

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Communication is done transparently over one of the available bearer

services.
 Transport layer service access point (T-SAP) - The common interface to be
used by higher layers independent of the underlying network.
c) Security Layer (Wireless Transport Layer Security (WTLS))
 The security layer with its wireless transport layer security protocol offers
its service at the security SAP (SEC-SAP).
 WTLS is based on the transport layer security / secure sockets layer
(TLS/SSL)
 WTLS has been optimized for use in wireless networks with narrow-band
channels.
 It can offer data integrity, privacy, authentication and denial-of-service
protection.
d) Transaction Layer (Wireless Transaction Protocol (WTP))
 Transaction layer with its wireless transaction protocol (WTP) offers a
lightweight transaction service at the transaction SAP (TR-SAP).  Integration of WAP components:

 This service efficiently provides reliable or unreliable requests and

asynchronous transactions.
e) Session Layer (Wireless Session Protocol (WSP))
 Session layer with the wireless session protocol (WSP) currently offers two
services at the session-SAP (S-SAP):
 Connection-oriented
 Connectionless
 A special service for browsing the web (WSP/B) has been defined that offers
HTTP/1.1 functionality, long-lived session state, session suspend and
resume, session migration and other features needed for wireless mobile
access to the web.
f) Application Layer (Wireless Application Environment (WAE))
 The application layer with the wireless application environment (WAE)  On the left side, different fixed networks, such as the traditional internet
offers a framework for the integration of different www and mobile and the public switched telephone network (PSTN), are shown.
telephony applications.  Several new elements will be implemented between these networks
 It offers many protocols and services with special service access  WAP-enabled wireless, mobile devices in a wireless network on the right-
hand side.
 To browse web pages with handheld devices, a wireless mark-up language
(WML) has been defined in WAP.
 Special filters within the fixed network can translate HTML into WML, web
servers can already provide pages in WML, or the gateways between the fixed
12 13

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

and wireless network can translate HTML into WML. These gateways not  WCMP (Wireless Control Message Protocol):
 Provides error handling mechanisms for WDP.
only filter pages but also act as proxies for web access.
 Contains control messages like the internet control message protocol
 WML is additionally converted into binary WML for more efficient
(ICMP) messages.
transmission.  WCMP can be used by WDP nodes and gateways to report errors.
 Wireless telephony application (WTA) server translates all incoming signals  WCMP messages are:
into WML events displayed at the handheld device  Destination unreachable (route, port, address unreachable)
 Parameter problem (errors in the packet header)
4.5 Wireless datagram protocol (WDP)  Message too big
 WDP operates on top of many different bearer services capable of carrying  Reassembly failure
data.  Echo request/reply.
 At the T-SAP WDP offers a consistent datagram transport service  WDP management entity :
independent of the underlying bearer.  Vendor-specific
 To offer this consistent service, the adaptation needed in the transport layer  Supports WDP and provides information about changes in the
can differ depending on the services of the bearer. environment, which may influence the correct operation of WDP.
 If the bearer already offers IP services, UDP is used as WDP.  Important information:
 WDP offers source and destination port numbers used for multiplexing and - Current configuration of the device
demultiplexing of data respectively.
- Currently available bearer services
 Service primitive:
- Processing and memory resources etc.....
i. TDUnitdata.req : To send a datagram
Parameters: destination address (DA), destination port (DP), Source
address (SA), source port (SP), and user data (UD) 4.6 Wireless transport layer security (WTLS)
ii. T-DUnitdata.ind : Indicates the reception of data.  The wireless transport layer security (WTLS) can be integrated into the WAP
Parameters: Destination address and port are only optional parameters. architecture on top of WDP.
iii. T-DError.ind: Indicates error.
 Supports datagram and connection-oriented transport layer protocols.
Parameters: An error code (EC) indicating the reason for the error to the
 Based on TLS/SSL protocol.
higher layer.
 Provide different levels of security for:
 Privacy
 Data integrity
 Authentication
 Optimized for low bandwidth, high-delay bearer networks.
 Takes into account:
 Low processing power
 Limited memory capacity
 Before data can be exchanged via WTLS, a secure session has to be
established.
 Both originator & peer can interrupt the session at any time.
 Steps in the Session establishment:
 Step 1: Negotiation of the security parameters and suites:

14 15

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

1.1. Initiate the session with the SEC-Create :  Step 5: User datagram can be exchanged using SEC-Unitdata:
 Same function as T-DUnitdata on the WDP layer
 The parameters are the same here:
source address (SA), source port (SP), destination address (DA), destination
port (DP), and user data (UD).

1.2. The peer answers with parameters:

 Step 2: Peer also issues SEC-Exchange:

Indicate that peer wishes to perform public-key authentication i.e., peer
requests a certificate from the originator. 4.7 Wireless transaction Protocol (WTP)
 WTP is on top of either WDP or, if security is required, WTLS.
 WTP has been designed to run on very thin clients, such as mobile phones.
 Advantages of WTP:
 Improved reliability over datagram services
 Improved efficiency over connection-oriented services
 Support for transaction-oriented services such as web browsing.
 Three classes of WTP transaction service:
 Class 0 provides unreliable message transfer without any result message.
 Classes 1 provides reliable message transfer without any result message.
 Class 2 provides reliable message transfer with one reliable result
message.
 WTP achieves reliability using:
 Duplicate removal
 Retransmission
 Acknowledgements
 Unique transaction identifiers.
 No class requires any connection set-up or tear-down phase. This avoids
unnecessary overhead on the communication link.
Fig. WTLS establishing a secure session
 Allows for
 Step 3: The originator issues SEC-Commit.req:  Asynchronous transactions
 The originator answers with its certificate.  Abort of transactions
 Indicates that the handshake is complete.  Concatenation of messages
 Step 4: SEC-Commit.ind :  Report success or failure of reliable messages.
 Indicates that the certificate is delivered  The three service primitives offered by WTP are:
 Concludes the full handshake.  TR-Invoke - to initiate a new transaction

16 17

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 TR-Result - to send back the result of a previously initiated transaction  Sender on receipt of ACK will close the connection.
 TR-Abort - to abort an existing transaction.  Responder maintains the connection for sometime in case it receives the
 Types of WTP PDU: duplicate TR-Invoke.req indicating the loss of ACK.
 Invoke PDU – used to convey a request from an initiator to a responder
 ACK PDU – used to acknowledge an Invoke or Result PDU
 Result PDU – used to convey response of the server to the client
 Abort PDU – used to abort a transaction
 Segmented invoke PDU and segmented result PDU – used for
segmentation and reassembly
 Negative acknowledgment PDU – used to indicate that some packets did
not arrive
 WTP Class 0 : Unreliable Message Transfer without result message
 In this class the responder does not ACK & initiator does not perform any
retransmission.
 The transaction is stateless and cannot be aborted.
 Requested with TR-Invoke.req primitive.
 Parameters are: (SA, SP, DA, DP, A, UD, C=0, H)
SA - source address
SP - source port
DA - destination address
DP - destination port
A - acknowledgement flag, if the responder WTP should generate an ACK or
if a user acknowledgement is used.  WTP Class 2 : Reliable Message Transfer with one result message
UD - User data  Reliable request/respond transaction.
C - class type which is 0 for this class.  Depending on user requirements, many different scenarios are possible
H - handle simple index to uniquely identify the transaction for initiator/responder interaction
 WTP class 2 transaction, No user Ack & No hold on:
1. Initiator requests the service using TR-Invoke.req and the WTP entity
sends the invoke PDU to the responder.
2. Responder request with the TR-Invoke.ind.
3. The responder sent back the result PDU to the initiator using TR-
Result.req.
4. The initiator indicate the successful transmission of the invoke message
and the result with the two service primitives:
 TR-Invoke.cnf
 TR-Result.ind.
Basic Transaction: WTP class 0 5. A user respond with TR-Result.res.
 WTP Class 1 : Reliable Message Transfer without result message 6. An acknowledgement PDU is then generated which finally triggers the
 Sender send a TR-Invoke.req TR-Result.cnf primitive on the responder.
 Parameters are: (SA, SP, DA, A, UD, C=1, H)
 C is class type which is 1 for this class.
 Responder signals the incoming TR-Invoke.ind & ACK automatically

18 19

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

Fig. Basic transaction of class 2 without-user acknowledgement

 WTP class 2 transaction, user Ack:
1. The responder explicitly responds to the Invoke PDU using the TR-
Invoke.res.
4.8 Wireless session protocol (WSP)
2. Then the initiator triggers the TR-Invoke.cnf via an Ack PDU.  WSP has been designed to operate on top of the datagram service WDP or
the transaction service WTP.
 Provides a shared state between a client and a server.
 WSP offers the following needed for content exchange between cooperating
clients and servers:
1. Session management:
 WSP introduces sessions that can be established from a client to a server.
 The capabilities of suspending and resuming a session are important to
mobile applications.
 Assume a mobile device is being switched off – it would be useful for a
user to be able to continue operation at exactly the point where the device
was switched off.
2. Capability negotiation:
 Clients and servers can agree upon a common level of protocol
functionality during session establishment.
 Example parameters to negotiate are:
 Maximum client SDU size
 Maximum outstanding requests
 Protocol options
 Server SDU size.
 WTP class 2 transaction, hold on & no user Ack:
 Content encoding:
If the calculation of the result takes some time, the responder can put the
initiator on “hold on” to prevent a retransmission.  WSP defines the efficient binary encoding for the content it transfers.
 WSP offers content typing and composite objects.

20 21

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Wireless Session Protocol/Browsing (WSP/B) - comprises protocols and  Goal: To minimize over-the-air traffic and resource consumption on the
services most suited for browsing-type applications. handheld device.
 WSP/B offers the following features:  WAE: Logical model:
o HTTP/1.1 functionality:  Model is close to WWW model but assumes an additional gateway.
 WSP/B supports the HTTP/1.1 functions, such as  Client: Issues an encoded request for an operation on a remote server.
 Extensible request/reply methods This is usually a WAP browser
 Composite objects  Encoding: Used to minimize data sent over the air and to save resources
 Content type negotiation. on the handheld device
o Exchange of session headers:  Decoders: Translate the encoded request into a standard request as
 Client and server can exchange request/reply headers that remain understood by the origin servers. This could be a request to get a web page.
constant over the lifetime of the session.  Gateway: Transfers the request to the appropriate origin server.
 These headers may include: Content types, character sets,
languages, device capabilities, and other static parameters.
 WSP/B will not interpret header information but passes all headers
directly to service users.
o Push and pull data transfer:
 Pulling data from a server is supported by WSP/B using the
request/response mechanism.
 WSP/B supports three push mechanisms for data transfer:
i. A confirmed data push within an existing session context
ii. A non-confirmed data push within an existing session context
iii. A non-confirmed data push without an existing session context.
o Asynchronous requests:
 Optionally, WSP/B supports a client that can send multiple
requests to a server simultaneously.  Origin server: Standard web servers running HTTP and generating content
 This improves efficiency & latency using scripts, providing pages using a database, or applying any other
technology. Origin servers will respond to the request.
4.9 Wireless application environment (WAE)  Then the gateway encodes the response and its content & then transfers
 WAE is used to create a general-purpose application environment based the encoded response with the content to the client.
WWW.  Push services: The WAE logical model also includes push services.
 Allow service providers, software manufacturers, or hardware vendors to  Then an origin server pushes content to the gateway.
integrate their applications.  The gateway encodes the pushed content and transmits the encoded push
 WAE has already integrated the following technologies and adapted them for content to the client.
use in handheld devices.  User Agent: Several user agents can reside within a client.
 Integrated technologies: HTML, JavaScript, and the handheld device mark-  User agents include such items as: browsers, phonebooks, message
up language HDML form the basis of the wireless mark-up language (WML) editors etc.
and the scripting language WMLscript.  WAE does not specify the number of user agents or their functionality.
 The exchange formats for business cards and phone books vCard and for  User agent handles access to, and interaction with, mobile telephone
calendar vCalendar have been included. features.
 URLs from the web can be used.
 A wide range of mobile telecommunication technologies have been adopted
and integrated into the wireless telephony application (WTA)

22 23

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

4.10 Wireless Telephony Application (WTA) architecture  The client may have voice and data connections over the network.
 WTA is a collection of telephony specific extensions for call and feature
b) Firewall: Firewall is useful to connect third-party origin servers outside the
control mechanisms, merging data networks and voice networks.
trusted domain.
 It is an extension of basic WAE application model
 Features: c) WTA server: One difference between WTA servers and other servers besides
 Content push: A WTA origin server can push content to the client. A push security is the tighter control of QoS.
can take place without prior client request. The content can enable the
client to handle new network events. d) Other servers: Other origin servers can be connected via the WAP gateway.
 Access to telephony functions: The wireless telephony application  Other servers located in the internet, may not be able to give as good QoS
interface (WTAI) provides many functions to handle telephony events such guarantees as the network operator.
as call accept, call setup, change of phone book entries etc....
 Repository for event handlers: The repository represents a constant e) Network operator: A network operator knows the latency, reliability, and
storage on the client for content required to offer WTA services. Content are capacity of its mobile network and can have more control over the behaviour of
either channels or resources. the services.
 Examples for resources: WML decks, WMLScript objects, or WBMP
f) WTA user agent: The WTA user agent has a very rigid and real-time context
pictures.
management for browsing the web compared to the standard WML user agent.
 A channel comprises references to resources and is associated with a
lifetime. Interaction between a WTA client, a WTA gateway, a WTA server, the mobile
 Within this lifetime, it is guaranteed that all resources the channel points network and a voice box server:
to are locally available in the repository.
 The motivation behind the repository is the necessity to react very quickly  WTA server to generate new content for pushing to the client.
for time-critical events.  The server sends a push message containing a single URL to the client.
 Security model: Mandatory for WTA is a security model.WTA allows the  The WTA gateway translates the push URL into a service indication and
client to only connect to trustworthy gateways and check if the servers codes it into a more compact binary format.
providing content are authorized to send this content to the client.  The WTA user agent then indicates that new messages are stored.
 If the user wants to listen to the stored messages, he or she can request
a list of the messages. This is done with the help of the URL. A WSP get
requests the content the URL points to.
 The gateway translates this WSP get into an HTTP get and the server
responds with the prepared list of callers.
 After displaying the content, the user can select a voice Powered by TSS
message from the list.
 Each voice message in this example has an associated URL, which can
request a certain WML card from the server. The purpose of this card is
to prepare the client for an incoming call.
 As soon as the client receives the card, it waits for the incoming call.
 The call is then automatically accepted.
 The WTA server also signals the voice box system to set up a voice
a) Client connection to play the selected voice message.
 Setting up the call and accepting the call is shown using dashed lines, as
 The client is connected via a mobile network with a WTA server, other these are standard interactions from the mobile phone network, which
telephone networks and a WAP gateway. are not controlled by WAP.
 A WML user agent running on the client.
24 25

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com

 www.studymaterialz.in www.studymaterial

 Either these decks can be static files on the server or they can be
dynamically generated.
 WML describes the intent of interaction in an abstract manner. The user
agent on a handheld device has to decide how to best present all elements
of a card.
 Features of WML:
 Text and images: WML gives hints how text and images can be presented
to a user. However, the exact presentation of data to a user is up to the user
agent running on the handheld device.
 User interaction: WML supports different elements for user input.
Examples: text entry controls for text or password entry, option selections
or controls for task invocation.
 Navigation: WML offers a history mechanism with navigation through the
browsing history, hyperlinks and other inter card navigation elements.
 Context management: WML allows for saving the state between different
decks without server interaction so state can be shared across different
decks.

WML HTML
Mark-up language for wireless Mark-up language for wired
communication communication
Makes use of variables Does not use of variables
WML script stored in a separate file
JavaScript is embedded in the same
HTML file
Images are stores as WBMP(Wireless Images are stores as GIF, JPEG or
Bitmap) PNG
4.11Wireless mark-up language (WML)
WBMP is a 2 bit image Size of the images are much larger in
 The wireless mark-up language (WML) is based on the standard HTML and
HTML
on HDML. Case sensitive Not Case sensitive
 WML is specified as an XML document type. WML has fewer tags than HTML HTML has more tags than WML
 Constraints of wireless handheld devices when designing WML : A set of ‘WML cards’ make a ‘DECK’ A set of ‘HTML pages’ make a ‘SITE’
 Wireless link will always have a very limited capacity compared to a wire. WMLScript:
 Current handheld devices have small displays
 Provides a general scripting capability in the WAP architecture
 Limited user input facilities
 Offers several capabilities not supported by WML:
 Limited memory
 Validity check of user input: Before user input is sent to a server, WMLScript
 Low performance computational resources.
can check the validity and save bandwidth and latency in case of an error.
 WML follows a deck and card metaphor.
Otherwise, the server has to perform all the checks
 A WML document is made up of multiple cards.
 Access to device facilities: WMLScript offers functions to access hardware
 Cards can be grouped together into a deck.
components and software functions of the device.
 A WML deck is similar to an HTML page.
 Local user interaction: WMLScript can directly and locally interact with a
 A user navigates with the WML browser through user, show messages or prompt for input.
a series of WML cards, reviews the contents,  Extensions to the device software: With the help of WMLScript a device can
enters requested data, makes choices etc.
be configured and new functionality can be added even after deployment.
 The WML browser fetches decks as required from origin servers.

26 27

Download Useful Materials @ www.rejinpaul.com Download Useful Materials @ www.rejinpaul.com