3

,., CONTENTS ,

UNI"F-1 : INTRODUCTION (4 J—54 J)

Introduction, issues in mobile computing, overview of wireles8

telephony: cellular concept, GSM: afrinterlace, channel structure,

location management: I-ILR-VLR, hierarchicaL handoffs, channel
aliocaÔon in cellular systems, CDMA, GPRS.

UNIT-2 : WIRELESS NETWORKIhlG (55 I

—104 I)
Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11,

Blue Tooth, Wireless multiple accegs protocols, TCP over wireless,

Wireless applications, data broadcasting, Mobile IP, iVAP:
Architecture, protocol stack, application environment,
applications.

UNIT-3 : DATA MANAGEMENT ISSUES HOW I

—133 I)
Data management issues, data replication for mobile computers,
adaptive clustering for mobile wireless networks, File system,
Disconnected operations.

UNIT-4 : HOBILE AGENTS COMPUTING (134 J

—164 I)
Mobile Agents computing, security and fault tolerance,
transaction processing in mobile computing envñonment.
VERY SHORT ANSWER TVPE QUESTIONS (197 J—240 J)
UNl1T-S : ADHOC NETWORK (t66
SOLVZD
M I 9 6 JIPAPZRG (2011-12 TO 2017- (241 J—256 J)
18) Ad-hoc networks, localization, MAC issues, Routing protocols,
global state routing (GSR), Destination sequenced distance vector
routing (DSDV), Dynamic source routing (DSR), Ad Hoc on
demand distance vector routing (AODV), Temporary ordered
routing algorithm(TORA),QoS in Ad Hoc Networks,
applications.
 Mobile ComputJg

MObÎle computing eau be deÏined as a compntlng envlronment

* PhYaical nsobility,
>>u*8 iH m0blle cp npj3tj tg g2•e ;
< Toïtware iaaue
b. caliuaue
'P Network isaue
User interface issue
e. i$eeurity issue
The wireleas telephony is a telephone service baeed on
aignallng
ystem siawithout
° over radio frequencie a hi8h capacity
using wires. land mobile ayatemin
which
8vsüeNefæqaencygedrœnñpœöhonÆioto‹Læætediæinde

Whieh are ag8igned in groupa to geographie celle.

EîspÎalo tbe æord °'fl¥ob1Ie Coæputîzz8" aod aleo give

azzttable êtes emæaple æ1tb æezñts oC æoblîe ooæputîzzg.

1. bïobile computing can be defined as a computing enviroñment over

p jæicalmobility.
The computing environment is mobile and movea along with the iiaer.
the uaer of mobile computing environment will be able to ac*eBs data
or information froc any device in any network while on move.
'Phs mobile computing allows a user to perform a task from anywhere
and anytime by computing device.
Hobils com:iputing is the faatest growing aector of computing.
&,
OF 8 ZDObilO d8V1fl0B 8f0 ° ZfiOIji]g p}j t2gg ]p p
p@@ gtp
 ab\e IO
B k a t az'e tbe vneJeea e0craedsgdstfcs of' - e h ! ! •

OD s t i n g environment

a}1tke tbae.
: It zs EAeOszzozu:oegt
t]jg

. j\$g}tJog a service portable

szt§

of zn• tbe exazople ofzaobiJe cTouJ • Des4 m bSli@ : Uaer aheold be deriee to
. while e citys. Jdo'bñe e•zoai\ ehle to anot2mr and or the aazus service.
allows
p e-jttg¡j itbout ever
actesaiag
fl„ Bâa¢ mofsMty:'g'/se user deeice cao ei¢}zer be a
real estate btiaine a8, for example,
yospective homebuyers to eTfazst or ae¥ver- IO caae of'1zoat zoobtlTty the mobñTty oEZP oeeds
a uaer initietei to be tabezt caze oB.
eatel1itoepp. E •w w e
zaote 8erver
Bad
the niobi}pdevice
ueed out in tit
and co8tfoI ’Ibid is the important aspect ofmobile computing. but there are °°
^ challenges that, it h•s to face, theae are :
field
its en9irunment. Ifence, it hua to configure ita•lr > tbe
gpd even for preaentati ^ environment Gantt time.
c tâ›n ag•in due to toobiiity m a t i o n ent
wpuld be one of the m becomes a eiiallange. Aa the following Casks H8 t8 dun
in order to° X°*

is available for
' • ' If ttf9da%a uaer's position and/or data)
m yguâ ea AAgc%m ote l e m e t ” ’
pp eeveral mpbile devices or even PCs at }m:ne. ’” ty is aleo a challenge.
 „„,bite tb••^• tbe ’”*’ a'obi!°
tbe

L
Qg pp er
zestrw6
and noiae levela. ü tbe raoge fros

acity. Tht

th (ezBaP!*
e „, Boe ¢oAoestt«Ïty betweaa zneläÏs d••Ice •••a w*r*l*** 1oc•!
**e•
gise of fipgers and

. Ihie te amall aize >e deeic ®

gp,*gtbDygqo{rad acjotoabor
Iodo#pitÊc#rIn3s
 ezattoaa tke

IJke tke the evolution

the electronic Mxn &on

both a speaker or transmitter

t,›jjiq and -«die beset

telephony.

fqgg. to a gewxa a e
Compare the theoe generations of wirele•a t eP °ne »aw•e•*a•a •**u•••••e-=z'—'
ceiegezy
epataxa oa Ake baais of Keefazee, tacba g$r uaed aad BPP ”’”
t°
 pt the
g TheTD
tbe edel. ’f'eIepboae Eeryiee) bagt§
ple jt-g9 aod CDMA-2000
e. F•r exa

8G+ jqtj-oduceB tbe concept

not a'replaces tbe TDJyt-based

OtOCO
Neéia Gateway COOtrnl {

Give BoB¥e o'e'ez-eie¥g o§ gg§ .

of tbe wtz'e\6B8 *= w•eture 7
Describe vaziou.B zazzTtiptez1og teotmtga , §,y . gtyyq
baxtAwidtfz ie tweed zaost eJ•Igeiyzttjp ixt $}@

lephones, each oe g pgdy Jmmunication

2
a mobile subvert Q
@ eatabliaheB a camention with a land
. Ovezviaw of' wizeteaa tzaaazaTeaioo :
telephone through tbe bfobile telephone Exehan$e fMTX) and Pubfi9 L An electromagnetic wavea are tho baaiu for xsireless
commnnicatipq anteruias are needed for the transmission and
3. Therefore wired network is ugly considered as « part of wireless reception of waves.
fl. While have stations of mobile phenes often use directed antenna, as
omni-directed antennas are the choice for mobile devices.
& There are severalachemeg that eanhappen to electromagnetic wgvea
pin izu›derateIy difficulty easier, but tnterfereace during wirelena tranumisaion, auch ae fading, modulation and
multiplexing on the wajr frum asndef to receiver.
L Blgon2n
s n 8ignuts an the physical re t«tâoos of
Pezforzoao•e very good gooé
data.Isia aa aIe<tzowagae‘ta¢ hand asedto co••ey d•ta loo o•e place
Secuz{ty reasonably good reaaooably good b
 F•ding m :i either b«.due > multipath propagation, referred as
due to Shadowing from pint
mttltiJ2Bth fading or ]es
t!»a •'ave P w•8atido, ref'• zeA•• ss«dow raai .

.*° m Ntérf8rcncc. There are four typea of inultiplexing:

$p••a n i « • i o n u « i t i p i m n g i8oHi:
i-. In 8fiM'each:eet offender end reofriver is given a apace
that

.Jti• The apace betsree triterfereooe ranges is celled guard

„>of.»axoneqr piore properties of a

c - i e t atgoa\,with

b. It i8
tbe a aigos\.
c. Fpr exa jilple : a
@ tal*bit
i;,ree kinds of q p d u l a t i o n tche ieo : Amplitude

tran e Of
any DtediD= for the
electro •gnetii waves.. ace aad

gpd from a wire or coaxial cable.

g t yqna and sectorized antennas.

a.
that a cazciez oxo‹t z\ated te\eoozaot'aoicatioDair ”e
over certain propagation media.

e
c. A fading channel ia. a communication chpnpel that esM* i e
 17 fIT-8) I

1. Considerable efFort» should be made so themaximttttt use of available

uitipleaing scheme,ofatime,
channel bandwidth is used in the moat e&icient vim te •cmmmplate more and
i.e., more usera and to Jm ahle to provide as many cert-ieea ag promised
by
2
needed which represents tint g p, There is a need tc use larger bandwidth and a higher side of the
. ¡ divided into ilots and a spectrum to accommodate new services more users, high-speed
communications, and multimedia eezyice. A variety of problems will
g gsta the entire1.8.4,
y ‹ t r u m for a tizag 8l0t gez”iodica]ly. be encountered inhigh-frequency range. For example, m Kgs-
frequency baztda tbe eigaxl becozoes distorted or attenuated due to
rain aod other atmospheric conditions.
8. Powerful 8ignal proceaaing techniques are required to nverccme these
* pmMerci

B'hat la cellular ayatezo 7 Wztte tke edeaxttngea azt4

CeBulnr ayetem :
1. Cellular system for iziobile communication implements SDM tspace
Diviaipn 2ttultiplea3ng) where each transmitter, typically called a base
station, covcro a certain area, called a cell.
R Iñ.‹rt1wr words, *A cellular system is high capacity land mobile
Byetem In wlticJs aeeilgble frequency spectrum is partitioned ioto
discrete
”' cégzapbt« ceryt•e azea (aeA). 3'be dts•zete cbaooels are
ex p el s ofbo4ng rouand in differont colla, within the mercies area.”
B›t :J&øpf4 øtplø feøllalar øjratøm isto divide s large geographical
RU4}c with diameter from 2 km to bO km, each of
srâihhJfli e ted a number of Radio frequency (RP) channele.
 g j•y,gj ,y
F by Mobile Computing
acb
intently Beparated.
4.
i power than the current New Matts. But energy i» a serious problem for
n each adjacent mobile handheld devices.
9pJq{ °W • Witb small celle, mobile stations, and
on )› base stations only have to deal with ‘l0caJ’ interference.
di wbicb iB called a •
q cientl§ far euee
6. however intsrferen‹›e. tm aBai ^t o!^iogTe ¢0zapo•eat. If one aateooa Nabla, tJzia
on)y
without when the group of„ iIIf]UeDCe8of0Oj jI£1t1QjCg@gj$
$py Te Drawbacks email cell: $yjy/\{Q g g gg'
of mque0 4•.
1. rence
ca0 interference.
to connect all base stations. This jncludes many antennas. ewitrhes for call
ent cells
forwarding, location registers to find a mobile station etc., Winch makB8
the whole ajrstem qttite .
overoeeded:TbemAbdestatieubsetopeflbmoabsnd0ver
R trap called aize Of
f calle the other and the Public when changing from one cell to another. Depending on the cell size and the
•» d e speed of movement, thin can happen quite of
fivi
S• Frequency planzxing: To avoid interference between
On the one hand, interference ahnuld be avoided, on the other, only
Telephone i'ietw tranamiHeri
(Id5CJ a limited nuinlmr of frequencies is available.
stem Should a between cello.

tbe mobile

HLR HLR
OR

to other
HbCe

limited, so 4be ef£inient use of required fze9uencisa was needed for

qpJ tgg e s of keep . into azoan according tospecific prmrisinning guidelines.

: There are several ad•
all auch sa amount of cell splitting and ceu
sniajJ cella in the eeiio« •yatems. Some of them aze : by Tffghieors experienced in cellular system
L ementiDg SD6t

8 >
s. one
leo»transmitter is farja›wer:
trunamisgion awed frnm°nother *^-•
The power anpeM
°*t°ide
for baae stations, they are indeed proble mobile sett
range, it can reuse the
*'* same
°* frequencies.
 ,.;, °›, r,.r.. --.r.›
•»°'•‘•
If we uae
ezt i
t s '.
.

” ...z;z'.•::t"=-//»° •a=-= °*”“*

%
*'•@'¥0tw§g--«§yg
@
°,

xsansf'oniIa taaatladfl›otg«tog.7Ida f’oet$Nñast is Uzatted

"° eo thnt th aazaa gzoup of ¢baooela eta be uaed ia
' pa{{s tbgt •ra Gg eeou@ls aseay Doza eafib otksr so
that tkotr
 reus
fre Mobile Compuimg
e

tbe

Bteza operatoE'^ d e o e t o a a
’“’*&

H o m e full of uuera,
onen.

vide

8O¢t 8g8tGZEt8, BP€tDE¥Dg IB ÖOSO IO

ZgÖUCe t{ze CO-
channsl interferaneo.
2. In GOM there are in tntal 1000 channels diatribntedbetween multiple
operators, sectors and cells.
3. The trunking efficiency of theae eyutema deeroaaeu due to
eeetoring.

4. On the other hand, ssctorication inereaaes the capacity ob CDMA

systems.

(seetarized antenna) tu three eectcra.

1. ’f1' ie last robl8o2 in the developasent of Use cellular network is rd

i
when a mobile subscriber travellad from one cell to another dur
2 da a@aceat area do aot ua• töte Bazoe radio cJjannels, a tall ß*
. either be droppod or tranaferred on° * °ha°ne1 to
8 u ß t r CT'ose4a tE8 l i n e b 8 t « 8 « n a d j 0 ß • ' t Cell8•
8. Beeauae dropping tbs call is iuiacoeptable, the proceg5 0§h8né °"
enated.
4 During a call, when too parties on avoiee
out
coveraJe area 0f given cell s i t e , th e
OT aler
Channel in a new aite without in£errupting the
The folloying ttetyork e}ej2tpnta ar8 the part of a tP9ical cellulttr
5. ,° > tinues as long as the user is talkinß• 1:e1ecommunication eystflm :
°ot'c• the hanöofr at
uine J p .p»•« *’
u• '°“'*“' ‹i«si'=*"•
x‹røm: ° “‘ '
° æ' that interconnect telephone
who ørø
Information shout the mobile aubucribers

miles Of
øunh øn eay diøg
for

b location updatø8 and en eachcall aettıp xequøst l'roæ the US.

information, ^ EZRtaażataÎoa iofòzzaatîaato autóænżcatetetaăaa{eguźpœeot

°t1 *a I at 6auduleßt, atolea, or æo-typø approved temúoals cazt
tions to baøe ßtationø bøidentilîeg aag genieg æz•eżca.
1
h The information is in thø fòrm ofæhite, grey, black liøtø tgat
møy be Onøulted by the network provider.
øøøiponsnt
øir interface

j,ø., channel encoding and deck' æ A calłar eateza a 10-dtgit eode (pbooe ouzałær) aaé
pzesaee tke
b. Thø 2dS ocans the band ta øølœt a £ree channel and øendø a
oWong signøl to øønd the numbør entørød.
« Tbø BS reløpø thø numbør to the HSC.
‹L The C$C in turn dispatches tJfø roąuøat to all thø Haaa atatinn
in
e. Thø mubile idøntifioation numbør (MI2't) iø then broadcøøt
over nil thø foræørd control ‹äiannela tbeoughaut tbø eøllulør
øyatem,

channsi.

intlM
b. Tbs BLtt øtores •pennanent" ® * * inforiØätl0

mobile uærø ønd ØdbI (Intørnnt¡¡ øøJ Mobil

R Visitor Locntten Bøglct r tYl.•Bl : to detætæe¥saga«directed at tbeæ.

& Tòe VLR repregøptø a tøøtporary datb 8tore. ø

ge
 station, ä Mebile Coæputłng

current
gøe ss
c
.

e. b. Lăœitad apectz1Aat ía requżreg

æ. e. 9a+ae *pectru+a æay be allocated to otber oetwazk
the
pJion* 1. The increased capacity in a cellular network, compared Frith a
tbe network th • a e trø°ømitter, comøe from the fact that the aøme
ttd;5cl that the radio frequency can be r•viøed in a different area for a completeIy
,
øtøyjzúoed level. diKerent
eiteø neighbours of the flrit «p
1. If there is a single pløin trnnßmitter, only one trenømisaion can be
need pn øny given frequency.
3. Unfortunately, there is some lesrel of interference from the aignal
aelect the síte receivi»a ti‹ and from thø othør eells. which use thø aøme frequency.
tall from the weøk ••l1 n 4. So, in a standard PDCA ayßteni, there must be atleast one call gap
e. thaß between cells which reuøe the søme frequency.
strmf°st
aøcond and th• cdlei i,
f.

U g l y t ę æoat ceüútør law c• p ovden

aørvàce travelling

Outside their h°> e serr+ce

b. the cellular
• Gi52d is the moøt aucceøaful digital mobile telecommunication
and it renømød aø, Global 8yatøm for Hobile
ęrÛI eeek øørvice hoixi the same Communications.
C. • GBM de ïve thrøø díØürent categories of øerx'icea :
e they 6*øøcribe to at holhe.
b. Teb mÆœa
c SuØ#eæaohuyaenfibes
pą; çe gon-h o m e type sy6tem. T' ere is ar
ä
a Radio øub-aystem (RSS)
p\cued wkile zosarh 8• b. Netu4rh and ø'nitćhingaub-øystem tN88)
Bxplaln tke e œ œ p t of ^
thi
*p *t e n to øe1in'lgz i
communications. Why
 e
qtruae more than 2
biJjÎt2 be ’

that beth aig•ali & 8uppoxt fOr a rao8e ofBew eewtœa agî¥}
ppidered a eemnd f9CAitiea.
7. IgDN oompatibility.
unication was ea8y to bud d,

of OSld permita the iDtegration of different voim and date aervieœ and the
OpBpg{¡j ’ ( b0
d'or cuatoæeza.

TekeæmAoæ
} p ppgæncy number.

1. In this reference model, a mobile station MS is connected to the

GSM public land mobfle network (PLHN) la the Up interface.
&. G86t-PLBΠis the infFasteucture needed for the GR2d network.
GSbt foræed & 3ñzîaoatæozk iacooaacteô to tzaoait oetwe}ca, for ezazop1e :}otegrated
aareI¢esdIgttaIoetworkftSDN)ortzadiöaaatpabIicawîtùIuxItetepbmte

’ ’ n of data lætereen t2ie interfaces to the network.

1989 Validation of GS •P°>^ *” ère spplicstion ajæeiBc and may thua need all
preoperatiooal @yBteoi aeven
42'liæu
ers services
of the I8ŒO8I reference
aze a æcific nsodel.
end-to•end from one terminal TE to
another.
199 Coverage oflarger ' °
2 Coverage of main ®
' 'Searer services permit transparent and non-transparent,
199
3
t995
 ices Mobile Go• puting st (Ir-8i J

b. p¡t data'
b. A GSM system cnnsisto of three aub-systems; the radio cub-
JjP0tOTOl8 OF lhye systems I t8S), the network and asritchiog aib-ejratsny 9fSE), rind the
er operation aub-syetema (OSS).
adoption arid flow control.
for interwor Radio mili•eyetoms (R88) : The RS8 Contains a11rad¡o gpecific
data networks entities, Le., the mobile station (MB) and the bane station aub-
system (BSiS). The BSS is connected to Ngg by tse 'A' interface
Synchronous with and oss by ‘o’ interface. RS8 basically contains three entities:
e. ® **•”q * ** *®
gQd 9.6 k
(t.2,2.4, &.8 300t‹ i A GS3I network comprises many BSS, each
p
controlled by a
qq¡ pg¡gpted tele aervicea. TAeB88perAmmssllfrmfloswoe‹ewmY1o
tdoreflo
cqzmectiooa to aé dB (eodiag/deoodtag ofeoieeJ.
anel°g itL Besides a BSC, BSS coztta?aa ee9erél Bg'9e.
P by c S M i• tbe emergency nuntbtt i A BTS comprises all radioequipments, in., antennas,
gyt providers end free of aignal processing amplifiers neeeaaary for radio
¡s Short message service (SMsi trannmiasion.
e. o t h e r u»eM • g J c e of G SMchafgt,
aaage of upto 180 A BTS can firm a radio cell, or several cells (uoin8 aeet
rized antennas) and ia connected to Up interface and to
0cterG,chunnele. the B£iC
ty signaling
q dard data channels of GSM é The main function of BSS is to look carer a certain number
@ of BI’S to eoeure propar operation.
It taheacare ofbaadaBbaot ooe ITS to aootbez aod oza*ot^
telephony aerviors. *a appropriate power lerels of the aignal.
aL The BSC also multiplexer the radio channels onto the fixed
network connections at the A interface.
$f ongoing
calla. of two main aaaential compenpnta lcneWn as Mobile Equipment
Module i8IM). Any M8 can b« identified bx m iI tlnt
nat*onal
6xptaio tke wozktag of f?8bg (gtobol ejra6ez• €or -ob
e*. aa li4ted hmm :
I• A Furnpnâld4fazitlty Humher (PINt : The PM ' ® *sed
to

' &gk the SIM, in sunts cauea the PUK *" neede
to
7aubecñber tsidentKad by t Number.
a.
G8u network era c a p tu re d as a hierarchical, Durifl8
etton this number ia transmitted river 8ir.
 Mobile Computing
jzrerent
, - ^ mveml BTS's in a geographicai region.
goinnbe ite œaj o r job ia
itor
it tlty) : lt ia , r°gi®tration, handœiarfl, autbenticatipn, rnuting
ueed aod haadovers alcalin to æove f'roæ one hts to another.
6. A gateway MDC (oMfiC) ia need to connect other tixed
networks such ac P8TN and I8DN.

1. Tbe HLR ia a d ' f'4 8î42Z g g22d

f22&ï2AgpD2fZtÎ
of subscriptionx.
- ® >P ^®8 otatic information such as MSISDN

roaming restrictions, s P e s a n d t h • c i e l numberl.

8. The dynamie information auch as location area (LA)
of MS, MSRN tMobile 8ubscriber Roaming NnmberJ,
the

4. Htdt atnres permanent data •fput aubocriberu,

incbiding
a eubscriber profite, location information and activité

IM. v i e i ‹ o r I o a a t ‹ o « R e Btœwzs):
L VU iB a datab8Ee tbat c0nt&in8 tempo try
information allnut eubocribers that is oeeded by the
bti5C M8C.
each in order to
ö. When a mobile station marne into a nsw W£SC area,
the VLR connected to the USG will reQueat data about
the mobile station from the HLR Later, if the mobile
srtatinn (2tf8) makes a call, the VLR will have the
, lBg information needed for the ealt aetup without
NMær ü Ba mNcb* ®t*°**dD•*
gpn{Aobîl*8œHoxzInterosWo••4 *e disturbing the HLR
B
. x t orLwitb
«ztdcount ry code as well as national code.
8æitehi•a s • b • W « • - (Non) : @ ŒBzLa.Ëi¥« Î6e « 0 c 0 e s s c y Ï'«0Cti0AS Exr IletWOFk OjÆEatTOaS

a This is the heart of GSld 8yatcttï.

h lt is reapooiible for
connecting the wireless etandarä put:nir
networks. performs handover•
B5Se aod soœe otber fuactioos tîke roaaztog. !
•*®*;’at’o”etc’
c. l'be N5'•8 œataioe fotlowiog awitclzes aztd
ôatBb®æ*'
* *€obile 8œeiees Bwttebtzzg ®
2. (DGC
Ceoter M @
• quiva)ent of aji excbange e d
L ’l'bc ÏdSC performa the telephony gwit‹mg
ofthe syatem.
 i Mobile Computing 3g
„ (j'j•.g) ,J
i t e d ¡nas *al 3. Data or signaling meaaagea can travel over different phyaica) channels.
4. Logical channels can bs
that contaioa gjJ
about the identity a. Traffic channels carrying uaer apoech •r into
i.
pr e v e a t s t h e m f The full rate channel tTCH/FS) haa a net rate of lS kbit/s.
Th® half*"• e ch®n°el ( <H/HS) haa been under discussion
tsaa f0P 8. 10Dg ti2nB.
-
pbones e
obilecould t b e gtofexi Eds. EIR -8, 4.8 and 2.4 provideB data and far
d) devices.
R
ebaoaeT,communication
hut tbe etr6ogtb or emor protectiozt diff'eza.
iv. TC H4• nd B.4 c d8t8 £f'Rer aha I rEte
#*" b.
sgc. channel. Control channels carrjring network measngea.Brnadcaat
the
i.channels apply only
Broadcast to communication
Control Gbamel tBCTH) from base station to
2 mobile.
iL Frequency Correction Channel (PCCB)
. iiL Synchronisation Channel fBT£f)
3 c. Common Control Ghannela tGGGiD supJa›rt the set-up of a link
. between mobile terminal and base abattoir.
grid b '

ii. The basa station can initiate a calluaing the Paging Channel

iii. The baae atatian informs mnbilen about which channel to

““ Dedicated C9ntral Channels tDCCH} carry control messages

Air int•rfa • °• r•do ' between network and mobile.
1.
necessary for gJreleas

dat». It i» specified by GSM anig: rb slow Aseo*iated Control Channel (SAGCH) is mainly
used
. for meooage to maintain a link.
ggp3 dp for alj manufartm°*®-
A : Tbe interface
® ’ aei3QccnJrut hasmure data capacitor. This is particularly
which is s t a n d > GSM. The A interface uat$
n between!4f('c ,pegdad whenever the mobile mâkes a handmrer from one
8B
BSC. The fi interface 8ll0ws provider
aswitching equipment made by different oia•uf *• 5. The baae elation can aceeaimndate these logical channels onto radio

O : ‘0‘ interface connects OMS to BSC to

OSS. By using O interface OMC •io
>** entities.

l
. Channels.
2. Logical channels carry user apeech or data _
'
 ,kg, Page 36d, Llait.t,
gefer
QBM : GSM seetjj•ity i Mobil'C mput'ng St t1T-81
7. The 8REi$ ganeratsd I
j2ocW’fition ’ compared witb the $RE8 generated br the AuC,
wateri and is

ey,
"
wel1••iotbeSIM. x 9. Note

proceae, tbe bojjtg dona at the wiki

called R@yJj, 10. Algorithm A3 is dependent the oerire
11. Since the
authentication reeult CREB in generated a4 the hnme ayatem of
tbeJdS.
produce a signed H. In 15-41, the authentication p r a y s jjjpy dppg
yg{j;
13.If the M5 is accepted for aeceas, an e cryptipn pwy i• g r a c e d by

14. Like A3, A8 •s specific to the gp q.

lfi. After the home aystem has generated Q. this encr;rption key is sent tp
the visited eystem.
I8. and the TDMAframe number encoded in the data bits are used by
82i a1a°riihm, AT, tocipheT and d pfiRf t@• dJt• •mbgtwp
tote MS and the visited ayatem.
17. The aame Ab algorithm may be used in all eyatema participating in
GRbf service,

Za context to oefIa1az• oetworka, esplajx tbe locatiozs

zoaaagezaeot wttb IZLR-VIII

AutAMt
fl0°

Encryption Location munngement : Location management in G8M is performed

with the help ot tz databm : home Location Register fHLR) and Visitor
Location Register (VLR).
1. £foma location register tHI•R) :
a The HLR represents a centralized database that haa the semi-
permanent mobile subscriber information abeut the mobile

b. It is referenced uaing the SS'f aignalipg capaliilitie8 for every

dain incoming call to the G86f nstvrork for determining the current
• mention of the subscriber.
g Ths HLjt ia kept updnted with the current locations of all ita
mobile subscriber», including tlioae who mgy have roamed to
ggt4thp2’ network operator within or outaide the country.
 Mobile
Coøtputing
7. In 8- 1.20 <, handoff may begin when the aignal strength at the
rni the mobìle re
jqere both x s c • » Ød from bøßø station 2 fBfl2) is greater than that of baøe
handover. statio n 1 tBSl).
(¡¡j) 8. TH8 aignal strengí;h møaauree øre aignal level averaged over a
chosen amount of time.

resides.
l0. Now a znøjor problem with this approach is høndolfdeciaion, i.e., the
received signølø of both bøsa atøtinn oftmi ßectuate.
BT BTS 11. When a mobile exist between the base stations, the effect ia ho c a s e
ß thextiobilø te widely avritch linkø with any of thø łæse station.
BSC BB The baøø station bounces thø link with the x obîle back ønd forth. Thia
G phenomenon iø called "Ping-Ponging".

1. Aaoft baodoftie one îoækżcbtkø chaooełîa the aoazce œß ia xelzńaed

MBC aødueed for a ækżłe ża paxelłel witłs the čbaaoeł tatbo taxget æü
In t@iø csse ths ronnscfion to the target is eøtablialied before the
connection to tbø source ia breken.
BeaídøøaEtheselourtypewofhøndoNtheycæosleobeduideâ
g. bolt bandoff røfera In the wørlapping ofrepeater cœreragø zonee, so
tbat evezy ceü pbooe aat ia a1'eaf'a 'eêlł æitbżo I 'e za•e• •!
!• ooe baae etatźoz
1. A hard handoØ is one in æhieh the channel in the øource cell is 4. In aeme oases, moJztle. setø transmit &gnøJs t•. and be ®ign°ls
reloøaed ønd only tbøn channel in the target cell ig engaged. from, morø than one bøsø station øt a tbne.
2. Thuø the connection to the eource is broken before the connection to Soft hand£iver røfe£ß to a fØatme A try the GD n øn WCD
the target ia møde. A staodsrüe, wkere • ceB pbo se źa •úau!taaeo a!P eaaaacte
° °*
the nøw cøll's base atntion, i.e., mobile is linked
i. th MB sands its pœiodi• mø•nurement ^p° > '°
It is Rt
h•k connection between the mobile ønd its initial baee the
whicn ít is connøctød at the moment, •** P
.ia
3 jtjj;eø øziølyzing røportß and current trøØžn
°ario• <»id tøf*e" thø deciaioB f‘or a
baztdWW•
BBC , an da a regug0t to tbe BsC tkat a baodovar Îa r•‹p r•d.
by
iript øøøjlajiïlø thøn it øctivatee a new
. .aæs«aæw =•
›. =æ,+ ••=••**="•'=
***.•'ea*'*=
 Mobile Computing 4.3 I IT•8)
I
Discuss code divlsion multiple accesa ICDMA).

Anateen
Various multiple aeceaa protccola worked on media acteae control layer are
as follows :
1. a SDMA :
Space Division Multiple Acceas (SDMAI ia used for allocating a
separated space tn uaers in wireless networks.
b. A typical application involvea assigning an
optimal baae station to a mobile phone user.

a. frequency Division Multiple Access(f"D tA) comprises all

algorithms
9. On receiving HO acknowledgement the MSC iaaues an HO command
to the old BSC, the old BMC forwards this to the old BTS and the old frequency division mult .plex B (FDMl scheme
10. BTS forwards it to the MS.
11. Lastly,
After receix'ing a HO complete
a linb is established message is
and handover from the new BTS, a clear
done.
command is iesued to the old BSC and B7'Qf0rre1iev1ngall the resource held by
the MS. not tune to right frequency
12. Finally, a clear complete message is sent to the blSC a notify about the
release of the resource.

DtecttgeCDIWA 41m•xxsam
r og OR
multiple aceeae p
peqppib e the foIl0 p.
^
O.
T'DMA
 Mnbile Computing

960
MHz a. Codea with certain charaeteriaticseau be applied to the °^ to
095.2 ensble fihp use of*code div3aion midtiplexing tCDM)"•
200 KHz
MHs
Code dimaion multiple acees8 fCDMA) eyetenis uae exactly thèse
codes to separate different uaere in code space Grid tO 9nö lP•
access to a sbared medium without interference.
t. The main problem is how to find geparate
“good" codea and hop the signal from noiae * and the
generated by othe8 8*f8 ens ironmenf.
The code directly controls the clipping sequence. A ends fOF
£t certain user should have a good aut p q p p]atipn azid should be
ortMgooaJ to other codea.
à. Time Dfvisi0n Multiple •• (COMA) oRers a e. We tan demonstrate the orthogonal br taking an example
tPCÖnO]ôg'Îe8 t}igt g]) g{p of a ayatem of coordinate a and vectors starting at origin (D, 0, 0)
titrie elota for comQiunÏcation, i.e , control ›ns TDM then two vectors are called orthogonal if their inner product is 0
b. as is the case for the two vectors i2, S, 0) and t0, 0, 17) : (Z, Si,
a certain freqtiency is
l'tot f+fiCe 8ariry, Oi* IO, 0,
c.
r e c e i v e r east kay at the sam e frequency the whole time. L'AI -- O + O + D -- D
f. Now for auto-correlation, for example : the Barker code t e l , - 1 ,
+l,+1, -1, +1, +l, +l, —1, —1, -1) has a good auto-correlation,
tening to diffCP nt frequericiea at i.e„ the inner product with iLself is large, the reault is 11. This
code is uaed for ISDN and IEEE 808.11.
flthieved in the time
e. ieehaniam. Compare the SDbtA, T D M A , F D M n a n d C D M n
dong by usin8 ä e d pattern similar ri FDHA
uaîag a <°< MA› WMAi PDbIA and GDbIn in terme of
transmission technique, signal separation, advantagea,
The aimplest disudv unta g p s ä n d
g THM i« ai¡••ti22g tifrie
alots for appLoeGoam

h,
’edd•T*Y
one*
the aame i• I d e A : Se gme nt spa ¡ttt9 ce]Jg/g @yg

" ' O°l I one t°rminal can be active in otie cqll/one aector.
* * r I o8 : cell structure dir @d antqqn
' ’ ‘° M : Very simple, iacreaae capasity per

tfm8 i@{tf disjoint time-slota, d em an d

driven
 Mobile Computing

g, tweeD the se«OEtd-

, Sypg GPRB became the first-stepping•atnne on the path
nization in the time domain. generation GBM cellular teehnpkigy and the
Jy digitgJ, very flexible. I S - 136
p
g. GPRS ia mobile d a t a service available to use2’gof GSM and
, Synchronization digi J t
: Staa d ia fixed networks, together with FD $p
gtohile oetworka. 4. Q P R S data transfer in typically charged per m e g a b W pf t r a n s f e r r e d
data, while data communication via traditio°^l ° ; > u i t
billed per minute of connection t i m e , inde pende nt of whether the
user has actually transferred datB-
¡nto disjoint sub-bands, g.
i i d • • : Segment the frequency b
OPRB can be utilized for «novices auch as aec*••, sts.MM;S, but
also for internet communication aer•eices ^*°
> e-z art and web

c P R 8 has the «unity to otter data •peed• of 4.4 kbp• 171.Z

*‘
v, pp@vnntnges: InBezible, frequenCiea are a ecarce resouree. It 8 } | O w e foz' B}›0¥'t ’ 6 u ¥ ' B t y * tz'8@iC, B u C b B a g'•Zaa*! gg¥d e *'0 B
p¡ C o . i n e p t : Typi «fly ‹ombined with TDHA «ne eDi›iA. well pa large volume of data.
CD tA:
8. Per GP@b, np dial-up modem connection in necBs8arP.
” < ^• Y•
a. It otfere tant not-up mechanism ta offer a perception °*
on".

i, OPR8 uses the GBM

architecture
In orderfor
to voice. â
o}'fer packet data service ougk GPRS, a neW claaa nf
v. Dioadwantegeu:Co nci;work nodTi need to be introduced as an upgrade to existing GSM
control for a dt .

expect•tiona, intngrated with TD , lowered

fiPR8 support nudes are responsible for the delivery and r outing of
data packets between the mobile stations and the external packet

L GRT9iepBmihewd
 SIGSX, ta)ces care Mobile Computing
muéA& kaodover azzd IP
gggigtttttent. a The HlJt or Home Location Register is a
to the GRPS devine. database that • subscriber information, when a device
b’ e 'f;fiN W a logic cp2jj3getS to t12e D8 * their HSISD2'1 number
C an example, Ml on a longjourn9y ie aameiated with aerrices, account information, preferences and

0
t on a cese device, you wiJ] p3gg anxnetimeo IP addresses.
a. A mobile device ia programmed with one or ttiore Acceoo
Names which ar• commonly referred to as the API'*.
¡g {jj gijfe the T£tBD8Cti0zl is
Qtte j0b of 1 8 b Aa APt'f coosiata of' a I' tip gua1i0ed DXB aP1e'
p0{
* * guaotuzopage.co.izu
g The t;gp «ork» Out whicb BSC In ‘ ate” your connection
the BG8N does a DN8loukup and re-free the

e. lft}e uger moves yit0 a g e n t of the net@orh It i8 mBflaged

by adi{ferept $GSy ¡t pts a bgndoffof tp the nflW d. I° the
Ynu could have multiple APH'a p • P •°
9GRN, this i done entreqely qqiekly aq1ge r fly the u•er will P
at nntioe this ypu arc net limited to a alngie service or €i
.
g. Aoy packets tbat azeboat duriag tbta process aze zetzanxaitted.
Easagtioa azaoagezaeNt : Befer 1. 1.1B, Paae 37•I•
g. 'I'tie SGflN converts mobile data intu IP and ia connected to the
GG8N via a tunnelling protocol. *•

n Appâlontfenn of OPg;N s There are many applications suitable for

GPBB. Hany of them are of generic type, aome of them nre speeific
which
L Gazzezzc appltccttooo I Oaoexñc application aze app1icatiooa IiJte
’ ’ izzfoxzaatiozs eex-eTcea, la.teraet aaceea, e-zsaT1, Beeb-hrowefag, w}ricb
nraye txeef'ttL
R i T oS is a rery popular mrvice in internet end GSM.

curds and pmentutions; ctatic web pagea can be

"” .»+N€ Hk › GP8B xætæork cæ be u re t to aber

7 +æz tænk ATB ›a rkfiwa oae +BAT f å e t Bæaa
’” Idé tbeATbt @aMosadtb thøbank
aezyør.
 ñfobde CoæputÎng 61 (II'-81
t •f
s a u v aipforz
g e‹€t m P e r e s o n a l
etc. are very ueeLul for a mobile i S. gpeed ]oæ+z• io reality
n d , • a Achieving the thenretical niaaimum C•PRS d a t a transmission speed
#|j raessages, including voice m
ail, fax, e-tpail, smg,p p
of 172.2 kbps would require a single user takin g OV fiF @ ) eight
m I boxea in one place, un¡fiqd n„,
i3j
æessgges with the various time slota without any error protection.
mari tx • f access methods to recover b.
It is unlikely that a network operator will allow all time alots tO
different types.
be uæd by a sîagie GPTtfii user.
# 6uppor4ofGPÆfl*ooböeierœioatecoooecfioo f o r u m
p gavaotages of GPRS i fl* serveruotsupporied:
y. Gpeed:
a. GPRS terminal can only act aa a client device.
z GPRS is pgc]tet swirrhed. b. There are mtmy services for which the server needa to be mobile.
b.
Higher connGction speed a are s tt ni n abl‹• bt
5b-118 kbps, a vast improvement on rifiCtiit sWitchqd gt.t, c. An example could be amobile healthcare centre for rural Population.
„„
„,;
of 9.6 kbps. ErpainŒgA€peedCûwtütRPü*ohedDaa(BSCSD).
R Always on connectivi ty :
a. GPRS ia an always on ser vict•.
b. There is no need to dial up like you have to on a horr i
for inctance. straight forward improvement of GHMs data transmission capabilities
speed circuit switched data (HSCéiD), which is available with
$.
New and Better apPlication« :
0Ction and always on connectii-
a. Due to rte high * r • e d ••
G P R S enabtes
fulÎ intern e t a ppJi C a t io n g and services r
asvdeo
d e s k t u p or
device.
mml..
G8Moperat
orcost#,
8. a1tocat'oa caa be aeyEaæetrfcal, i.e'. æore s]ote cao be aJJocatecj
GUM network Providets
do not have to start from sera
to deploy GPRS.
Pgzode to requirea software
sideGtheS M netwqtpthe exist@g netwqrk that. site fi
Ltmit8tiona où GPR5i • There I l
e melim
c a n be s u m m a r i z e d a s : itations wlth GPRS, .
so
a
There are only limited r
different uses. required tO seziü
b. Both
for one d a t a precludes gi eo
mu t
Jf fihe tai•iffand b
oo reveoue.
 Mobile Coinputing

ggttqg.orieoted ozeeb8oi8otB ofG°^• " ‹k s•sn‹••ta•ta,s sae aww

1 P*¢ally
uot at all efficient for
.
d ymuietrical.
u=•••uui•s
{gpgey 6le mgy rgquire aTt cbaonels 0, 1hits usiog CDATA eyeteza witb f'oIlowbsg aequezsce
2. white a
the channels idle most of
•e A < t-1 -1, —1, +1, +1, -1, +1, +1),
B = t-1 -L, +1, +1, -1, +1, +1, -1),
cbazzrte treated
eetnp C = (-t. +1, -1, +1, +1, -1, -z, -1'),
tion increaaes dunq
t0 čheclt resource for
ha idover, as tri this case a BSC What is tbe reetdtttsg cktp sequence ?
o«tjust one.
@y gj}, H8C8D majr bt 9tt gttractive 8olution for hlgher band ¿ty When 0 bit ia transmitted using CD6fA eystem, then the sequence Will
andy «tber c»aztaat u&ffic tfor eaazap!e : ft!e download). It is q t
gggd for b u re t $ bttezaet trelfic. = (+ 1, + 1, + 1, — 1, —1, + 1, —
Di«tinguish between ¥t8GBD and GPRB. 1, — l)
#=(+1, l,-I,+I,-L-1,-2,+l]
OR
(+ 1, — 1, + 1, — 1, —1, + 1, + 1, + l)
Disting*i•h bit een Sh Bpeed Ci smrt Bwitched D a l e
tHBCSDl On adding A, B, C, we get reoulting chip aequence,
•ad General Paa\ret Sadto 8e•vice tGPB8) oyG8 g etaoqarg.
^ u (+ 8, + 1, - 1, — 3, + 1, — 1, + 1)
't$fltezz 1 bit is tza oa mitte d uatag CDbtA Bjretezn, tbezz tke reeu1tiog cbip
1. HSCSD is coooectiozt-oztegte¿l w b e p pgg
fully packet oriented
i n which data tran8fer foF gpplications thqt exhibit traffic patterns -(—3,—1,-1,+1,+3,—1,+1,—1)
auch as frequent transmission of ' oluzoea or iofrequent
što t]ze zequ}rezoebt
apecification.
2. Ae compared to HSC£iD, t}ze e x i stž o g aetwor*
resourcea more effieiently for packet n 5q¿ °PP ieatipne and shoulb
provide a selection of QQŽ 9arametere
° tvice
s. Network providers typically requeaters.
and not on connectinn time as in HSOgp,
Unlike HSCSD, GPRS doee not only
allow for the bundling of cbazmels, tt
t o w a r d Ubf'l’s aa tbe zoažo e
&r£erQ 1.1 and Q. 1.2.
is exactly what GPRS uses. UM WS

BeBz@
1.4.
 Data gg
e
' " ' ‘, * ° „ ; ° c ° = r ° ' aJ•••
I•ART- 1 'os'"°”

C D H D E IT D LiT L.I M • PA RT- j

E

• Soois of the l u c e of '

g.
data

'°' "
t°• Ind »

\g a
bM stati

•p{j pp ( tg @trt,duce neW mechaAi8m for data e$nqpt

g
 jg file Co P* ng
b. * or ezaT0pte, B ueto b
t
int tconnetting a g q

'nfrgte
IEEE B02.11, Blmtaoth, Nirelesc Multip distributed method tF
and usually pj•pyi
wider internet.
b.
• Wireless network refers to any type of computer network t§
is wirele2g gyd i8 commoaly 8s8'oC-iatedwith at a
This provides ustt the
coverage area ao# atill
telecot1jjjjt@y{jpg network.
• ,q pireleps LAN is linking of two or more c, For example :
oomputt›t u5ipg 8pread spectrum or picked up by adi
OFDM modulation. or mobile homes. o °*#
• Bluetooth is open wireless technology standard for exehang¡qg Fixed wirelesa d•‹• : It a t
’
data ovet short distapya froos fixed or mobile devite creating PAN extend or
with high levels of security. share g, ${firelesa MAN :
g
Wireless hletropoli ^t='orL
b. For example, 9fi-b{ a a tr cry
evered
g Wireless Widewirel
Area Network (WPfJ)
typically coveress
l8rge outdoor artgt.
b
¢
as a public internet access system
c. They are usually deployed On 2,{$ d,
A tyDital syate°i c°°tains base 8tatlon gateways, access points
ink wireless bridging relays.
e ilxplain the usea, proc and tona of wireless network

Wireless network: What 8z’e the advantages and disadvantages °f '* 8 a •••
1. Wireless network refers toany type of computer network that is tmneniiasion as compared to a fiber °r wire a•® i°ai°n
and is common]y associated with a telecommunication network
wireless
whose interconnectipn between nodes are implemented without
the use of
e
2 Wireless telecommunication netwprka are generally implemented
Ueea of
with SOmP txt of remote information transmission ayatem 1. With theireleaa networklnfl:
help of wirele6s
q0rkb,¡ofor°iation c° ld“ ^ “ ” ” “ “
that me8 el•ctromagnetie
implernenbatipp waves, aucb as radio wavee for the ff0t with efficiency and more
pdjjy takea place at physical layer of network.
carrier and IN 2. reliability.
Efficient cervixes such 8B the P° ^ ’ .
ragi8
a A Wireless Personal Area Networks (WPANJ interconnect devi«e® 3. Another impo
within a relatively bmal{yeg way to b'0 COflDected *°
•
 Wireless Netwoçyøg
Mobile Computing 68 (Z'I'-B) J
Pros: 2. Installation difficulties :
ø¡gy t o set u p as °*>°. as a. Because wireless network øre øo commonly uøed, you may find
e d n
that other wireless nete'orkø øetup inyour medical building
ithe netwOTk•
interfere Frith your wirelese signal.
b. need t0 IU es and users cøn move around b. There are a limited number ofchannele and if the incorrect channel
@thża the gig0al ^+V at tht•İr discretion. is used, you osay end up with inconsistent networh
connection or no network connectivity at all.
Mobiie devices enemyøs phones and* ¡j t;;tgøøj øtøtt¡jjj;y ,
Coverage • a. Users cam experience black epots within the coverage range
j where the wireless signal has ‹hffieulty passing through eertairi
ø. øgø teiøøjfnology
Though coverage > limited, wireless høs improved
available within a specified• building materials or if the area has sigxiificant radio
the past detade and gO8d Cry
interference.
can be used if wider b. Users may need to do some experimenting to obtnin optimal
b. Beyond tha t, Extender and range boosters
coverage is required. A signal
Speed:
Unlimited øaers: a. While wireless networks øre føster than dial-up connection, the
a Wired routers will typically •me with three or fuur connection port average speed tends tn be slower than as ethernet
and require a switch fOl' additional expansion.
b. With a wireleßø network you can add øiore uøera without the
coruiection as an issue to be ceneidered if you or your
organization will be relyiisg solely on a wireless
need to change hardware, throughbandwidth and speed may become an network.
issue if there are too many users.
Cnnuenienee, flexibility øod efficiency: Give the bràet diseusøinn on wireless LAT. t h a t are the
a A wireless network can be invaluable for companies that hot
desk or have other office-sharing practices.
Wiraleøe LAN :
b. If you need mobility around the workplace, a wireless network
2. A wireless LAN is linking of two or more computer or devices
help you move around without worrying about access points or
mines. using spread spectrum or OFDM modulation.
2. WLAN are typically restricted in their diameter to buildings,
Coøt :
college campus, single rooms etc. and are operated by individuals,
a. Wirełees routers have become very affordable in the past few years not a large- scale network providers.
so Sfte costs a•aocïated vrfth setting up a wireless network will not 3. The global goal of N's is to replace oifice cabling, to enable access
necessarily be prohibitive. to the internet ønd, to introduce a higher flexibility for adhoc
b. communication in public places and group meetings.
It zrtay even cheaper tn jystall a wireleaß network
'°”' in some situations. 4. The wireless LAN technology is based on 1' EE 802.11 standard.
L Security :
5. It is a member of IEEE 802 fømily, which is a series ct specification
8 Wireless networl;ø are more d
networks, ifficult to secure than wired local for LAN technologies.
6. The primary component of a WLAN is the wireless interface card that
b. As a reault, they are more vulnerabl to haø an antenna.
users. e attack by unautjaorized 7.
c. This interface card can be connected to the mobile unit øs well as to íìxed
a ÏOCff tİOn near the network.
PïHtjT t¡9i j•¡g M i n i n g software to identify 8
available
. There are mønr pt ducts Which used unlicensed IBM bands along with
9.
WLAN, for Example microwave over cordless phone etc.

There øre three band8 within the UM bandfi.

80 tIT•a› J Wireless Netwot g
te
10. There are 000 I8M band, which r,„ge«2.4853
from 9oz io s2a 8.4
GHz aad 5.4
oHz ISM hands which Bt ' the
wöii:b reagac b'oœ 6.276 to
ranges b. iztteTfezeztce.
6.86
11. WLAN uses 2.4 GHz and S.4 GHn The s
" °' ” " are
band. l2. WLAN works both in i^fr °
L Flezäbility: °
P&tÛ tàYeuto
Advantages
a. ot wLAH :
coverage, nodes can 6Ç0 lÑ0ut
Within radio W The open radio intty¢p gy
her K ’8, this leada t cahie
b.
As radio caves •a» penetrate wells, so aendera and receiversep r
be placed enyvrhere. @ppaniea ha o'ke y
fvctionality
a. W'irelesa adhoc netxvorA *!!°^ °**° municati°° ' t ‘ ° u t Prey °
^s planning, any wired network neede wirinfl P!

ce Wireless networks alloW foz' th0 d•sisp nfgmall, independent devis

which can be put into a pocket. i. Global, aeamleas opération : It
gl
b. terminals and the operatioïf shoujd be faultlegs $
For exemple : email PDAs,»ot•pads, mobile phones etc. ball
g
a Wireless netv'orks can a l ' ; ' £ • d i m s . For
example, earthquakes, floods or uaera pulling a plug. 2. z w p o w e r for Battery
o* power thus, it should consume
b. If the wireless devices survive, people can still c0mmunicate.
9 Networks r•qu¡r¡pg a wired infrastructure erill usually 8 No special permiesiona:
or license to uze the hAX. All the users ig the
breakdosrn ¢, Robugt transmiasie• technolo$y : The tracsmissio0
WLAN should
echnology usedbeshould
able tobe
atteas the that
robust LAN is easy to uae and
‹x›mpletely. castle.
imp}tgtgt.
aAfter providing wirele88 access to the infrastructure via an
actess point lñr the firet user, adding additional users to a wireless 5. iseeurity: WLAiK should ensure security that is auœt must te ensurvd that no
netw0rk will not increase the cost. one should bc able to read his'her data.
P r i v a c y : WLAN ahould also enswe privary i e., no one should be able
Disadvantages of W£AN:
to collect user profilés.
L Quality of Bernice :
7. 8 a fe ty : WLAN should be gate i.r., it should have low radiatio
a. WLANs typically offer lower quality than their wired
counterparts. 8. Simplified spontaneous cooperation et ° ir
b. The eiain reasons for this are the lower bandwidth due 9. Easy
10. Protection of everyone,
to use for investment inmana
simple wiredgem0ftt.
oeteor>
to limitations in radio transmission, (for example, 1-10 Mbps 11. Transparency tonceroing CPP °°**°°° " " ""’ pro
uaer date rate instead of 100-1ŒD Mbpe), higher error rates due cols but
to interférence and higher deley due to extensive error al9o }ocstion awareness if •*^W
correction and detection iechanis is. {}u D * ecribe the beiie 'ÔJ
t

a All wireleœ produits have to oomply with national regulati0n9.

Several government and non-govemment institutions worldwidt
 Mobile Computing

' the various fype• of WLAN † nat the parions

applications of wieeless LnN.

reftected at wally, fiirnitutt p/

^° : ere tre different tu of B'LAN’s. Score où the
a line-of-sight (LÖSJ exiats between sendet 3jjq popular ones are : iiiost
ttceiver.
h ,p f i c h u }ight emitting diodes tLEDs) wei r,p
Sender0 $ pgp d t as receivers. a. lu June 1997, fEEE iinalized the initial spécification for WLAH's
t
photodiode
a logy : :
a v a n t a g e s of d *'“ ° IEEE ms.11.
j. ft a simple and extreiiiely cheap. b. This standard speeifîes a2.4 GHz frequency bond witb data rate
ared daté dflB tion of 2 Mbps aod 2 j\fbpa.
2 s» t i the devises hfl*
¡nterface. îJxD§j c. Today, thèse atandard8 offer a local area netwoyk of
e ol h g 2, bandwidtb going upto a maximum of 54 Mbps.
Ne li•• 9$ are needed for infrar d * tW oW and s ielditg
£i
3, p ;
is ver 8 P e

Ele‹trir»l deviœe do not interfere vrith infrared transnü rio»

taper ben r.way io ‹S96 by
4. shi broadb«d radio accea8 oetworÏ group.
ni•advantages °* '•• °° '
t. d. Hyper LAN/1 the current version works at the S CiHz band
Low bandwidth coœpared to other IAM technologies. and offer upto 24 Mbps bandwidtb.
2. I n f r a data association devises ar£• interf1ally connectedto e. Next version Hyper LANf2 will support a bandxeidth of
q pip limiting transfer
a S4 Mbps with QoS support.
rates to 115 Mbit/s. ThiB is not a bigii data rate.
8 will be able to carry Ethernet frames, ATM cells, &
3. One of the main driiwbacka of infrared is that it tan be easily packets: and support data, video, voice and images.
3. Bluetmth
a Bluetooth was named after Harold Bluetootb, King of
Denmark during 952 t° 995 AD, who had a vision ofa wotld
g Rad¡o tranamiesion : It includes long-term experiences made with with cooperation and interopembility.
radio transmission for wide area networks and mobile cellular
phoned, b. It is now promoted b b’ induatry leaders like IBM,
1. It tan cover larger areas. Erimson,
2. It can penetrate walls, furniture, plants etc.
BlJ4e oth is a Wireless personal area network (PANS operating
3. It does not need line-of-sight fUSJ if the frequencies are not t°o at
Ïtigh,
2.4 GHz band and offers 1 Mbps data rate.
4. Radio based pr‹jducts have higher transmi8einn rates. Fpr examP °. 54 It ljses frequency boppiog apread spectrum (FHSS1
Mbit/s, i00 Mb:tes. modulation and offers 1 Mbps and 2 Mbps at 2.4 GHz
Dl8Bdvantages qt ppdip tp •y @ • j p n : frequency band.
l• 1.
4. MANET:Office/campus
Manet is a working group within the IETF to investigate
ifÎ0 tï nfrmis8ionca» ùiterfere with other senders.
’ E’ irica’ ee°c°° destroy data transmiaaion via environment
and develop the standard for iriobile adhoc networks.
radio. Verrous
2 applications
Hotoe of xvireleas LAN M :
3. Radio trans gi•j•t ; $ P £ • t t e d in certain frequency ba°
Yery limited • 3. Public plaœs
4. of vice t•-8*eebands are available w r]dwide'
4. War/Defense 8ites
 Wireless Ne t
$4 (II'-B) ”’kg

therefore›
mechan;gq of cpÏli8iofis that he
mize the
occur5, gpd
g teredehveredBnccessfuhy

(j l ) sensu oultip]e
gy p with collision detection (Cg
, p e p ccess cont‹O1 i•y r Contr0l8 medium access through
A
. It also •r» ¢ j p g , authentication and power eonservat¡py medium if, a c4llision occurs it atops t 85 ffW lt lieten into the'.

3. p c of
’Fhe basis aervicea ppoVided by the MAC layer are the m•ndato he
wireless network, t¡gnal
4. strength decreases p
The syn 8p wice f'acket and 8, jpw when the aender would apply CS
(Carri•* Sen ei and cD fC llision
ppteetion) if a eollision occurs at the receiver it Cht be the case thgt
aender cannot ‘bear" the collisiori due weakening ofa the mgnals,
1. The MAC 81$0* used in wired netxeork often fail Wirelee# cD does not furtfier move, CS might not work if,i.e.,
for example,a terminal
network due to rome reaaons- ¡g Ndden". Collision detcction in ertreless is a difficult taak as the
2. O» of the ‹x›mmoniy p agnitude of the signai varies with distante.
gtgpJthm for wired networks ia es which worhs »c followa : If a jin context to eellular network, diaeugy the
eender Wanta to •end aomething, it aepdaq 8eon as the medium
i8free, ä libteD iOtO thB ïDedium if a t0lliaipn pag it atnps zending following : i Cell aplittine
¡y }steuz• and far problem
3. end sends
1"fow, a jainioing
in case aignal.
ofwireleo network thia echeme faila, 8s in wireIe8s
netqot$ the stgnal strength decreases proportional to the square o*the ¡¡¡. BidAen terminal problem
4. d¡atgn
Now when the eendef wpuld apply CS lCarrier Sense) and CD
tcollispn Detection) ifa colliaion oceurs at the reeeiver it might bB the
case that a sender cannot ”hear" the collision due to weakening of the
eigngl, i. •„ CD doen not further inove, CS mlght not werk. For
example, a terminai

5. Colli8ion detection in urireleaa ia a difficult task as the Iit8gnitude of

the
aignal Varies with diatance.

&oa*•8• ] "CBMAfCD ie •ot auttab1e protocol yor wizelett £ N’.

"” eaaoos üB favoux of or agaüost tbe matemeQt t
0 14 0
Anawer ‘]
1 Whenever iritiltiple tiyj•p 0 0 M 0
ia a danger of aignp}a overlappijjg
d Hatroring each other.
2. Such overlapp which
t
t e t0 nu8able noiae are talled
'' A '"“' "'“ °°“ “ " Pl e - a c c e a a no do
eolliaiona.
 Wire]eeg jqet„

midder >- >""‘'

jjt

are three
the i•
see thai Ranges.
$ isaion range of A reached g •t tf0t

grea,hesbQthL
$pp that bothq d 5 want to transmit to B then the {pp i, csv •enses the state of tbe e v e r ••i •t ‹ t ,»i ,
g Lead to hidden node problem.
yppleoi occurs :
g , 2, pa not iiae carrier sensing.
A aends to cannot receive A as it is not in the tr
range of A. Y,. Node a start tranamittirtg after a random },typqjy
N•w, c a x i s tn aend t0 B,
b. 3 j\4nCA usea RTS and CTS tO 0V£rrcome hidñen nod• problems
it cannot detect A- node problems.
.
g Node which only hears CTS tbut no R'’S8, stop from transmitting
A is hiddpp for C. thidden node).
b. Node which only heara RTS (but no TT8), is traflgmit
(expoapd node).
9. RTS and GTS carry the expected duration of data
4. trammisaion.
When there is a collision, it us'es binary exponential backotf
tBEBl before retrying.
B where RTC standa for request to send
ñ.OF. Hidden node probletii. CTS stands for clear to send.
Pa cket tranemieaion in MACA : The packet transnisaion in MACA
4. 3uch temñaals like A aod 0 are called hidden terminals n• t „,
is shovm in Pig. 2 10.1
terminate cau89 collisiozt. Neighbour Sender Receiver
5.
An0ther effects ia there Neighbour RTS - ItTS
iuinecessary delay.
6. ’’’’ CTS
The situation i8 as
.-’
follows :
another termipgJ tn send data tn seem
ange of A and Inot A or B) wJ Ch ie outside tlte interferenit
b. B. Pig. 8.i0.i• Pa•k•t CTS DATA NN
C senice the channel but finds it busy
( d i e bo B'e transmission),so A-ppjQpn }iidjjpn tel-@J@ TiAin8 MAIN: MAMA 8VttitlS the
9roblelD8°8°^® '
of hidden terminals ’’’’•
But A j9 0tlt8ide the radjo 2• acrid to B.
necessaj;y. ange of C, therefore, waiting is not 1. Suppose A I'd
2. A
W&Rt gay started the transmi86i8A but is hidden for C, C also starta
COl lisio n at B.
exposed” to B. in
o. win c c x , ñdoe8 not 6tart its transmission at once, but sends a BT8

n
° ° • = d exposed node p bleeii 4. B receives !@g RTS tbgthe
contains the nnme of sender and receiver, as
future transmission.
 g g s . I I etaxt - Tbe WÏAî'f
p t
g i n e thé yes Of bender (Ap) and defined bytheŒEE
g,gg.1t pt dgrde. There are c u n e ° t I y f°ur camions in

7. C he r8 receivet the le
agi p i got ajlowed to send anything for t},t
got dy$m at B It uses the 2.4 GHS ISM band }g ¡f¿g1udes ipfrar co $qunicatiop
durin8 all
ptx›b}em is solved. it usee either frequency PP spread (pjjgs) qt
diq,•t
sequence spread spectrum fDSSfi),

g.
upto 54 Mbps in the S GHz band.
b. a02 1l• >•• - orthogo° tfrequem di i en mulaplen•g
CT9 ‹OPDMi eneoding echeme.
The r'rotocol also supports dits rates of 6, g, 12, l8, 24, 36 and 48

gÎte B02.11a specificaLtoos is app\ied to sñzelesB ATîd sjsterræ æd is

used to access hubs.
qppid ce of exposed terminal problem using MACA •
MAPAavoiö the problem of exposed terminal m 8º °>" :
i. With HAcA, B hm u› ransmit an RTS first containing the name ort£‹ g jt ¡s aj¢o referred to as 802.11 high rate or Wi•Pi.
t receiver
b. This standard uees DSS and uaes 2.4 GHn ISM band and
lA) and the sender ‹B).
provides maximum data rate of 11 Mbps and Frith fall buk to
C does not react to this message as it ia not the receiver, but A 5'5 Ffbr^
acknowledges using a CTMS which identifies B as the sender and A as the
receiver of the folloeñng data transmission. g. lt off !rs wirelese transmission over relatively short distances at
3. C does not receive this CTS and concludes that A E outside the 20.54 Mbps in the 2.4 GHG ba•d'
detection range. G can start rte transmission aasuming it will not eauæ a
collision at (A). b. The 802.11g also uses the OFDM encoding scheme.
4. The problem with expoerd terminals is solved without fixed c. It uses the data rates of 6, 9, l2. !8 *
access patterns or a base station.
‹£ It provides coDspatibilitJ enth km.us equipment. of B02.II
#tb
oe''•A*•b.°**•”’
OB
and e z p l a i n ito M A *• yngs„ñsgtbefe’o
RTS D c aw a nd define 88*• p *ocol
CTS g 'g
A CTS g iü ]Fbyet*gÎ1ayer
c
kg.2d0 °" Ovoid
exposedtecminels üi. T"'mæe etcuct
 mobile Computing 7S (Z’t'-8)
ble J
80 16 8 8 l6 16 Variable bits

PUP preamble
r¡g. g.iz8, Poimat of PUP preamble PLCP header
IEEE r i g . s.2B.a Formai Of t a i n 8 0 s a1 PaYe’«m• ñßi•i oØsS•
pøøi;tioao of frøme :
1, Synohmnizøtion :
p£ łP
æ preazable :
Syn«hronigation : The PLCP preamble øtartp œ The firøt 128 bits are ueed for synchronization, for gain setting,
tb 80 for energy detection Ifor the CCA) and frequency offaet
bit pattern. Thia pattern ie used atlernate0s' az›d1s' (0j0Țof
0j compensation.
receivers
for and signal detection by the b. The synchroniaation field consists Of strings of 1's which are
CCL
Staz”t E‘zaase De1iœiŁer (6FD):‘l'tie fôłlowtpg y6 b›g scrambled.
Stsrt Fraæe De limiter ISPDI : This 16 bit field iß ueed for
start Of the frame and provide frnme aynchrø tips, The synchronization at the beginning of a frame apd consists of the
i6 bit p«tternŒzxl11õo1011i101aodit pattern jt11Œi1J10200000.
d
P£ PLCP_PDU
a. P Re•óer : Length Word ïPL& : The field specifies
the kapLg a. Two values have been defined f0r the fiełd to indicate the data rate of the
of the PSDL in octets and is used bytheMAC
payload. The binary value in this field is equal to the data
rate multiplied by 100 kbit/8.
b.
LCP Signaling Field (PßF) : Tbiß 4 bit field iziôicates the 4 A Service: This field is reserved for future uße.
TØA OÎ payload.
rate off dhiŁ/s.All bitø sets to zero (000o) í»dicat the l o p„ t S. length : 16 bits are used for length indication of the payload
Øeader Bzzor CsÎeck I C I : T h i s field conłõinß the resuJtø p{ø
in microseconds. The MAC layer uses this field to determine the epd
of the frame.
CklClzlated frame check sequence front the sending station.
& ReadezRmorChec¥(HEC):
a. Signal, service and Ïength fields are protected by this
a- checksum using the ITU-z cRc-i6 tankard
The spectrum is separated by code but not by frequency.
b. polynomial.
IEEE 802 11 DSSSp uß6s 2.4 GHz ISO l jjqd and offers beth 1 b. The CitC-16 algorithm is represented by the following poljmomiai
:
e dßtĄtTØØgnti6fiiort is control br the DSSS p i I D øpØ țøy;-.
bitø of information from the a The PHA layer based on infrared uses visible light at 850 9S0
pmtocolhči PMU
data unittakeg the b
(PPDUi PbtjP rim.
^'W Brrier It does not require LOS between the sender and receiver ,but
b. should alSO W0fk with diffuse light.
e. oioclulation.
The PDU +r8o e co Bistg or a
preamble, PLCP header, • °*• *° point-to-multipoint communication.
MAC P°otoco] d ata''it Mr'D I›. °
and
d. The infrared PHY operation is restricted to kdoor enviroozaents
and PLCP header øre alwøyø trønømittefi at within the range of 10 m.
lMbps. ítød hiPDU
Prame of IEEE 802.11 PHY freme using infrared : It i9 sbown in
Fratce of IEEE go ii oss .„ø, .-«Fi,. rig. 2.12.5.
Z.12.4.
 '?7 ‹IT'-
bi p B)
3. Uw pewer that the d e v i s
2. JQt be facingeach other, and it Ù ni8°
possible to pat trnnafers xehen beth the devices are in separaR
Characteristics of btuetooth : rooma.
n r a t t n a t this i• hn•iogy requires no cables and e g Q@Bt
1. 3. £ •
@
Bluetooth operates in unliceosed GSM band at 2.4 GHz l2d00-2dg3 5
that has made it°° p°Puiar.
8. The range of bluetootli device is power elasa depen:dent l raettt the maximum ra•g• int i‹ • •> ** me*rs, but this range i° n‘t
10 meter, 100 njeter. thé aame for all simil £•<'°

3. Devicea coueected using blueteeth fiequeney link f • - ^ • p'oonet. lt• deperids o• th'• t ofthe devises and Ue *•rsion that they operate
Cl888e8 of bluetootb :
6. The processing pewer and bstt£•J gO P ttlat it requires in order to
operate is very low.
this maâ-es it mi ideal to'£i1for so many electronic devicce, as the
technology tan be implemented P > much anysrhere.
z. One jqt g,jvantege is ils aiæplicity of use. Anyone
Clas» 3 l mW f0 dBi ) - l meter
can figure out how to set up a cenneftion Tnd sync te o deuiœs with
ease.
Moreover, the technology is completely i'ree to use and requires no
1. Wireless control and communication between a mobile phone and a ehazgea to be paid to any service provider.
1. Though the transfer speeds are impressive at around 1 Mbps, certain
handa-free headaet.
other technologies like infrared can offer speeda upto 4 Mbpe.
2. Wireless communication between PC'a input and output devises. For
2. Even though the security is good, it is even better on infrared.
exemple mouae, keyboard and printer.
3. T'rensfer of files between deviœs with O B m . 3. This is because ot the comparatively larger range of bluetooth and also
the lack of a line of sight.
4. Replacement of traditional wired serial communication in
the test equipment, GPS receivers, medical equipment, barcode 4.
Someone who knowa hoer to heck sueh networks can do so eventually.
scanner and traffic control devices. 5.
Tbe ba€tery usage Burùog a single transfer is negligible, but there are
S. OiaÎ-up internet acceas on personai computers or PDA*a usùig a data• some people Who leave the device switcbed on in their devices.
capable mobile pbone as a æodem. Que 8.1s. | Explairi bluetooth a r c h i t e c t e .
6. Wireless bridge between two iædtistrial ethernet networks.
OR
7. Allowing a DECT pbone to ring and anawer calls on behalf of a
nearby cellpbone. Bxplai• theer* Cf bhiet otln system. Wïxat wilt be the im
on pieonet " " ” " ’ d e ce° gwe °°- e "Ced Co
8. For low bandwidth applications where higher USB bandwidth is œobî]
nOl
reguiced and cable-Free coooectioa deeired.
Bluetooth œ'ekjtect
Oiecuee tbo advaatagoa aod ÎiaziCa€iooa oi‘ ,
The arrhitNture of a bluetooth device
Îz10etoo8h• is d0H£›bed by the two terminology :
P!8°n •t and 8catternet.

A piconet
Advanfieges of bluetooth : fashion. is a collection of bluetnoth devices conneetcd in ari pd pt
1. Bluetooth does not require a clear line of sight between the gyn88d b. One device
devises. >e pieonet act as master (M) and all ot1›er devises
80nnected *° the °'•stcr act ce staves (g).
 Wirele8s Networking {,
az\et,
c. Each piconet has exactly one maater and •P to seven aimultaneou¢ jJ a device acta
ela•ea, i.e., a meeter bluetooth devi*° ° °° "® with upto aynchronize with
aeven devices. g.
join.
The master determinea the hopping pattf•rn in the piconet and the "’ P* net.
slavea has to syjiehrorùze to this pattern. h. Before leasing one pitOnet, aa]p e

M=M=er
5 =Sgve

SB = Standby

pat is bluetootb 2 Wà•t

F'ia. i .ts.i . siapio biueiooth pim••i.

e. Each piconet has a unique hopping pattern-
OR U ' 16, Mar
f. At any green time, dato can be tt¢nsferred between the mester and p’
j§rbpt are the funetiena • fferent Iaye>
one other device, however, the device San swit0h Notes and Of bluetoot§ py
the alave can beoome the master at any time. staek †
g. The master awitches rapidly froci one device to another in a }
round- robin fashion. gluetonth : Refer Q. 2.13, Page 7M, Uoii-z.
2. Scstteroet: hitecture of bluetaoth: Refer §, 2.15, Page 77a, 2.
a. Group of pitoneta form a sc0tternet.
b. Scattemet consists of two piconets in wbich one device Ult gluetooth prntoc•l stack :
participates in two different piconeta. J. Bluetnoth is defined as a layered prototol arrhitectutv co
tiyp{ptt protocols, cable replacement
e. Both piconetu use a different hopping Bequenee and it is always
determined by the mauter ot the piconet. protocols, telephonf eor;tt•i p>t°‹•ls and
Piconecs (each with a ¢epBcity of < 1 5tbit/a) adapted protocols.
2. A simple bluetooth
Auéo8Dp hWa ps protocols
lvCJvC*dstack iatelpho
shown in
’apFig. 2.16.#^1. m
U = DIaster n'opps
S = Slave @ s TCP DP
“” DBEX
SB = Standby
k BxEr
\
£PP
Audio

d_ Solliaicn occuis if tuo or more premete u8e the aome earrier

frequency at the same tine.
e. If a device wants to participate in more than one pitonet, it has
to 8ymhronize to the hopping sequence of the piconet it wonts
to tahe
 Wireless Networki;jg
smb&ndlayer offers q different ®
3, gq p•ction-oriented link gd
Here, AT: Attention Sequence °fl
gp it
OBER: Object Exchange flF0q#g set-up
U
aager
TCG BIN : Telephony Control ProtocolSpecification-Binary B N E P : an
Aii ent between devises
ggpagem
d
neg0t1IIt1OII.
¿ e u r s{,j\,Ir has to conhol tôle
Bluetooth Network Encapsula{jon PfiQg0CO1 exc
signed reaponsez,
SDP : Service Discovery Protocol
por pairing, it
4. The bluetooth protocol atatk can be divided into a core specification,
RFCQMjY£ : Radio Prequency Commtll2jCfftlffH y y p t e d OE rejeeted.
which describes the protocols from p§y5;@d} lgyer to the data link control
together witlt management functipns, and profile apetifitatipns, For encryQtGOll, acte tue e
Core epeeifteationa of bluetooth comprise of the following layaru : point-to-point, or broadtpt),
1. Radio layer (Physical layer) : Thia layerincludes specification of air
interface, i e., frequencies, modulation and transmit power.
netwofk
a. The radio layer operated in the unlicensed IBM
p
band at 2.4 GHz. b, Power consumption i8 very low due to battery
operated devices. Ae
z. Frequency batid f2400-2483.5MHz), s3.5 MHz bandwidth. exchatnged
h but also informationabout tbe su
P@
IÏ f¢atulœ su¢b
cL Bluetooth usee frequency hoppingfTDD echeme at a rate of e
ae multi-slot patkets, enwypt'o , °C° , moite
1600 hops/sec to avoid narrow band interference. ppapili e•coding
i. A bluetooth devite can measure the receivtd sp yt
e. Within a piconet, all devises uae the same hopping sequence. ty
ii.negot
Depending on this signal level the devieetu direct the
f. Transmitting power is upto 100 mW and minimum is 1 mW. sender of the measured signal to increase
iation
R g. Range is
Baaeband between
layer IMAC!10layer)
m - 100
: In. : or d ease its transmit power.
a It included description of basic connection establishment, packet e. Llnh supervision : UP has to oontrol the activityofa liak, it
formats, timing and basic Qofi parameters. may set up new SCO links, or it may declare tht failure of a
b. The funetions of baseband layer are quite complet as it not only link.
performa hequency Jiopping for interferenœ mitigation and £ State and transmission mode change : Devices might
medium acceas, but aleo defines physical links and many packet ssritcb the master/slave role, detach themselves from a
c. formats.
It enables the physical radio frequency link between the coonettion, or
bluetooth devicea to form a piconet. change the operating mode.
d. Bluetooth also definea 1 slot, 3 slot and 5 slot packeta for Service Discovery Protocol (fiDPl:
SDPis used to show deriees todistover what services eac between R'o
other*up
higher data rates. services can be queried and after that, a connection
x'*' and What parameters to use services and tht•or
68(72s 54 0-2745 bita more bltietooth devicee may be established, t.
acceas code packet header payload For exemple : When we t0rmect a m0bilt phone to a blutto0th bà
•" 4 _l_ 8 bit8 /SDyP l l be used to determine which ‹Jfree gpd the pr0t0£0l
, 64 (4f • 3 4 1 ”1*
the headset ithe headset profile }t profîlel
bluetoothp ’des
" {trai1er)J AM
predittble Sync type f1 w ARQN 8 EQN HEC ° ÙDlexer settings are oeeded all
addrees theae, some other terms are al8o descri
btdîJlQ

e. A bluetooth panket (1 sl0t) baeeband layer RFcoMM: Radio frequenc¥

consists three fields : acceaa code, patket header, ppyJpgd, replacement protocol used to ÇJgtB
aasparent thf0lt$
Replacement of’ cable technologies R

modification otesisting device®

 Wi gqJ,ile ;oæputi°8

i8 u8ed by the remote control profîle to *8tiafer t;atîpn deaigners and vendons tan impleaient aim8 from the
over an L2CAP channel. ey p t pgy9 tt ing different cooiponen
BNEP ‹Bluetooth Network Eneapeulatipp
h $api g l a c e s ,
i. BNEP is used to transfer another pr t••ol 3. 'T'a tpvide coIB ätlbilitr among tbe devises offering t e £i
pblueto0th 6 p e c n n rofiles in addition to the core pptftocola.
L2CAP channel. Q§Q@y p a J e t e r 8 bluetooth <8Nd make
;tsptyt t]jt proflles turers
i£ Ils main purpose is the transmis g. y i y
personal area networking profite. pgroperation between devîcea from diffe rent
possible. Q6t
Telephnny control prntoeol : Telephonycon certain usage model.
lTCP-BDf) is the äit oriented proto‹x›l @pfiles repreaent default solutions for a t;g8is for
sigoaling for the establishtrient of voice and8data
defineathe tgj{ 5. ey e Q gg] ion of protocole and par9meter aet to f o r t
bluetcioth devices. ¡jiteroperabilitY
6. ri t • i• be been a8 horizontal layers
Object Rechange Protocol fOBEX) : Sessio nlayer ptq sliœa.
the exchange ofoJ:jeeta, providing a model for ob'e >
repreaentation, bdj;it profiles have been spffifi& : generic aœess, s working,
h eadset, d i t - " P net
L'ogica1i.ànk Control and Adaptation Protoeol y cordlesgtelephony, iflt0I't° i ^8* & '
f àcceas, generis object exchange,
object push, file tiansfer and
a(L2C The bluetooth L2CAP layer provides
connection-oriented data eervites to upper layer prof «i. files are : ad*8fKBd äUai• distribution,
8 extended servite disœ very,
b. It also supports pp
. control, basit printing, basic
reasaembly of packets, (QoS)
h•nds-free and hardcopy cable replacement.
c. communication. q 9.
This layer does not provide any reliability and usee Each profite aeleets a set of protocole.
SDP, LMP, and
the 10. For ezample, the serial port profîle needs N O N ,
à MCAP transmite and receives L2CAP
ensuredata
reliability. L2GAP. Basebaxidand radio are alwaya requiN•d.
patkets upto 64 Mbitd length. Applications
e. L2CAP proñdea three different types of local thannel9 ;
E Conneetionleas : Theee unidirectional channels are
typ¡ used for broadcast from master to its slaves.
ik Co n n e c t i o n - or ie n te d : Eaeh channel of thi8 type
is bidirettional and supports Qo£i flow specifications for
eacli
iii. Signaling :'Ibis type of logical channel is uaed for
exclnnging signaling meaaagea between L2CAP entities.
What is bluetooth ? What are the functions ct diffe*e°
layer bluetooth protocol etsek? Also, discuss the concept of bluetm> Write ehort note ou wireless riiultiple an°°°* P ' °

Bluetooth: Refer Q. 2.t9, Page 75J, Unit-2.

1. If many uaera share a channel and two or store
Functions of different taper of protoeol gtack : Refer 8 uaers transmit packets simultaneously, collision may eceur.
" Page 79J, Unit-2.
3.
There are variptj9 multiple access protocole
COmntt1OiT8tÎOn.S.
4. Oa the Oasis ofchaf acterisLicg, multiple acœss protooo} y9 yt
¿
Multiple access protocol

Seheduled aœesa
Statit Demand Repeat random ygti
assignanenl assÎgnment suceaa random g

SDMA Polling Aloha

FDMA 8lotted alo
TDMn CAMA

a. i$cbe•duied excès protoml: By adjustiiig eachiuær'a trapgqi

time a•d frequency, it avoids simultaneously data t
p¡ttipp between two or store usera.
Random access protocol :Aithough collision occurs becky yq
er more iisera acce8a a eternel simultane0usly, collision eq @
redured.

7’UP oi'er lYirefe.ss, WireJyzx A ppfitatioiiz, Dole

Brondroating, fobite IP. IYAP . Architecture,
Protocol lstacb,
gppIic«Ii ti Environment, Apptitotinm
t Et O III C E PT O UTLI H E : PART- Z
• TCP is de.ôgneä to provide reliabte data transfer between
hosto connected by s serbes of routere.
• Mobile IP protoeol all0ws location indepnndent routing of IP
datagram‘s on the internet.
• Broadcast cisterns are cteaeified a» unidirectional
distribution 8yatems.
• W ize\ess Applicatioo Protocol fWAf') provides internet
Beruices
for mobile and wireless devises.

48VHe1îons•Amanver
e
<°ng ^^°° < M and 88edluoi Anewer Type
Que•tioas
 Jpøeeø :
øørried by wireless nied¡ø ø„
ce from other ai e

9. Before a ll2•I’P request in be transmitted tbe TCP tØ < f i n has tøg

ted by tnt
the
10. Tfiiø requires three neaaages. the tink layer,
and invokes the
11. If GPRS is used aø wide area trnn490< Ç$telDi 0ßß-Wã2
Ț08C.
delays mø and more tabe place. dtk:
12. The setup of a TCP connection already takee far more than ø
d9vidth
ø„ ; y q
CheracterlMõceofTCPover fNe8s:
a. Tire data ratea of 2.5G systeæß are 10-2ß Rbİt/8 wou °P&ô 6t the best
øjtd ld lead
ups I0üY,dmeo ,aGaod Vtume2X teooBoBe,d 20-5g
t0
tgratee 64kNUsupiokeAdl35-E84#böAdownlMA.
b. Data rates are a8ytnmetric ø.s İt iß expected that uøerß Sri]) d0w, jp $ gy Jpg : Fading typÛally occun Attn a wìttltp b t
more døta compared to uploading, i$mobde CkPt8 bed
c. In cellular networks, øsymmetrjr does not ezceed 16 times andq eleøs host involves adducing œonection
}p ]jjgh
M • m i t y of a
satellite systems asymmetry way reach a factor of l00p, observed handoff,
To support multiple users within a cell, a st•heduler may have llDd tfi link layer øtate that lfas to be bandedofl, the
tø repeatedly allocate and de-allocate reßoureeß for each uøer. tİmtg. bm
«i» h n:gbt iieed to be handed oä.

Wîreleøa systems provide algorithms for error correction

d pmtectíon, such aø forward error correction IFEC), checb g }teso1ving chøi pet contnntİ0D is usually iuytometfic.
summing and interleaving etc. b,
b. FEC and interleauing let the round trip time (RTT) grow to J'}' ae sending em.ity getßnt0°•
ø, øt;- jødgenenti §øîag queued for
several hundred oiilliaecnndiupto some eecondø. ¡s could lead to pțjp ø
tyøøsmission at the linb layer of the receiving < 7 to
t
The GPRS standard specifies an average delay of less than two
aeoonds for the transport claøs with tbe highest quality. by tb•.
back when enamel actess TCP
q'y¡ø ø reduces tht
l e ød tø
a. Wireless ayatema auffer large delay variation or delay spikes.
b. Beaøonø for sudden increase in latericy are link outages larger round sender and to
due to temporal loas of radio coverage, blocking due to high- bursty t r y ° .
priority traffit, or handovers. delayø are a ßigníÿjßRt fï& °
t Ø{ sion time oi
the retrøns
TCP, throughpu
4. Pøcket foes: subsequently s e c t s TCP peñ8 "
a. Packets migbt be lost during handnvera or due to corru9tio8
b. The loss rates of 2,6G/3G ßystemø due tø corruption are f•ß1fftí96Í$

What ørø the ractarø sheeting the perfprmø icø of !. A TCP

TcP 7 ofc
the
3. The sender caØ ØĘ Ę d
A number of inherent char••t»rißtİeg of wireless media affect ’
TCP advertiaad window *
 irelea¢ cet {dobile Computing
tries to reach equiiibrittm by ope

5.
Performance of TCP over w'ireleaa network : Refer Q. 2.20,
Page 86‹I, Unit-2.
8 r each AcK that it receivee, the cwnd is nc aaed Different approaohes for TCP improve tent : The vari0us models
'n°*°asin&by one for proposed to improve TCPs performance over mreless networks are es
Ind over round trips. follows :
8
• 1. æ Indirect
WithTI-TCP
C P : a transport layer connection between a mobile host
TCP uses another variable asthreah,
indicatee thethe
right wi8doJ 9ize dpptpd¡jj$ g and fixed host is establiahed as two aeparate corme9tiona:
88W€'Ttt Network )oad.
i. One over the wirelesa Ïink and
10. e
a10w 9tart ph£iar continues as long a• cwnd il i ,gé t5 ü. The other over the wired link with a “mobile support routes”
l1. serving as the center point.
88 46 it
12. In congestionCrosees sethresh, IP goee int0
avoidance, for eaeh ACK COOgeetion avoidaoct
b. Packets from the sender are buffered at the mobiie support router
! mnd segments. received, cqqd " '. .^sed by until tmnsniitted acr0ss the wireless coonection.
13 • '• °PP*0x matelr esu:valant to c. A handoffmechanism is proposed to handle the situation when
plan additive increase), if eqvan cwnd
ps bye ne the wireless host moves across different cells.
e t
¡$p d A consequence of using I-TCP is that the TC'PAHKs ere not cad -
" TCP aender assures congestion to-
f i n ( c w n d L. g, g§)) end thereby violaling the end-to-end semantics of TCP.
°
W out Of order segment the
Indirect TCP or I-T C P segments the cormectiortwith no changes to
back ri duplicace ACK (d0 8Ck) to the sender. TCP prototol for hosts connected to the wired internet, millions
of computers use (variants of) thia protocol.
"’ ”he ' ' re f ransm j al gorit hm uses t
h««e 8' lt usesin
Hosto anthe
optimized
reed pu TCP protocol
of the net dofor mobile
not noticehost .
the characteristics of
the wireles8 part.
17 fi.
U n e acnder receives dupack6 it o a s e u••and retransmits the {opt
Segment , •
*• aiting for the retranamit tlrrier to gO Off.
!t aiso updates »stlueah.
!8
f'art retovory keeps tra‹k er the number of dtl9ncks receivpd
and trice
o retimate Ute •zn0unt of’oUtstanding üata in
the network
20s l@ Ç/0t0s cwnd f by one scxnent)
(or each 8lipack received, thiis
n*aintaining the ow of traître. 8 One of the drtiwbacks
6O IûtnA WhOBE
TCP connection r›f the si•gie
esulted ' 1065
'heduPlcateACKeixoct,0wlodg,¿ b.
then deflatns the •iRdow by returning it t0 s8f1tpes h, gnd enters g8loser the original end to end TCP
semantic.
congestion aYoidance phaae. *'
Rn0O9*ng TCP works trangparently and hence dppt
not lose end to
on"1 TCP not perf°rm w'ell in wireless
‘’ The moi£l pp@pjqt
ûf08B tO the fuDction pf the
mobile host p
tu perr•rm !8 9ffering Of packets
e faat
0 15 Si 0_ Lost pec ket a on the wire leBs link t beth dit•ctionai will
bc
retranamitted immediately by the mobile holt or foreigïi agent,
respectively (ao called “loca)” retransmission) the fo 6jgn agent,
 t]sere f o r k , ”*8oops” t he pacÎtet
directions.
f. Data tyøp5J e j• ¿ pfeßerves end toend se iønrics, preserves t6e sender
t0 the mobile hoat İn apøøpiøg t e
8 place timeout eøtimata baaed on the whole round trip time, and
(FA) bÆerødata untit it receiv handles mobility of the hoßt with minimal ßtate transformation,
°f the •p{jp
while ed

H‹iøt ;ø What f l n d of problem may ariøe, if TCP is

netwpt§. pos«ib
implemented
ppøy wireleøø networks † Eapløiø. U 1 1 0
^9ßmißsion p e i
°'veepondeqt M
agønt host
Wired
internet
MOb e
host *"”'“’“* •=•«.a «. The wired networks are relatively reliable aø compared to the wireless links and so
TCP aøsumea congestion to be the ihøin cause of any packet loss, And
invokes congestion control measures at the source. Wireless linkø (part
>ßnsfer ofa heterogeneous network) bring aome serious problems with them :
Packet log on the'vrirelese place as EA detects
la sequence
Õrectly with • NACK a. Wireless hßøts use radio trønømiøsion or ínharedwave
with only a very short now rettani»i tapp transmiøaion for communication.
h. delay. b. Tłte BEit of wireless links is typicaHy higher than thøt cf
Hoblems°°°Pwith
8 Rßoppjdjg
P does not isolate the Wireless )ir t wired
gøød
Jp I-AP nøtwoikø.
c. Also the wireless environment changes quickly, and so the
a might be useless depepdijqa on encryption øchemtø BRR also varies by a large amount.
R d. The bit error
Bandwidth : rates of 10 or worse are common on wireless linkß.
a split connection b•s•d PPP ach a. Wireless lirik.ß offer very less bandwidth (2 Mbps) as compared
but tries to preserve end to end mantic•. M.TCP «Ampt8 Q three
level hierarøĘy. to the wired links IU-lOOMbps).
b. At the loweet level, mobile hoøtß ßOØØj b. Outžæum use of avaiTable bandwiÂtb is e æajor issue in
8tationø in each cell, which are R With ID°bileauppø;•t.
heterogeneounestworÏŁ8 that bas to be taken care of-
host”.
c.
The supervisor host İ8 COllflpĘted In the wired network and aerves a. The wireless øsedia eahibits longer latencies than wired media in
m the point whim the connection i8 øplit. A tłie case of Satellite networks.
b.
e. TCP client exiøta at the supervisor hoax lt iß ølmost the øame as inwired networks since radio waveø travel
It tbe speed of Iigbt which íß same aø the transmissíon speeds ín
wired
T. The TCP client receives the segment Çøy the T(jP tender and media.
Since the bønawidth is lower in wireless networks a packet takes
paß8ee
*8 It łQwhile
980d, 8n MM-TCP
- TCP client to øend
iø uøed longer to get tranßmitted in wireless networks.
wireleaø device. it to the
between theeuperviøor
wireless device.
host ønd the
Tliua, between the sender and the aVPerv for hoßt, standard TcP
8 e. !8 8W overall throughput and İncreases interactive
M-TGP íß deøígned to recover
diøconnectionø and tø limiøøttquicİtly
øe froøs wireless loßsee due to
tioteouts.
f. delays.
h &CPgt ASK packets it
. Different versions of TCP pour data
until the wireless device received
the incoøliøg acknowledgements, which depends on RTT. networks
le8pecia1)y WANs) with high bandwidth-deluy
Ø°88°t are severely affected.
92 (F£'.g) J
WirelessNetwø
$ { g{jjj 9jdpø Broadcasting (DVB)
Addí b.
0Õ Of rßobile deviœs iiitroduces
Ø0bility in rather a stationary network.
j. Je sender of date does ty0t kn0>
8 teflds tO introduce some tr mission.
of impß< information such as trøgiø or weather
* ount of time.
l88S hogt6 may move from one cell to anotlyø; d
••
ed
Døriltg this movement the data sent to the The «y¢Jic repetition of
g adcast disk".
8 At i o n is lost, since the n the hO8f
oia bw
aseas støtiøø
° Simiiar y, data •ent by mobile hot mobile moved
'*«»i»t are three different btoádeast pay! •r88
ßß iț}B Gas of range of the old base station. 4, gir l

Power eøø•iønøtion :
b. Ske9'ed dißk
Mobite host has limited power and smaller processing
*ompared to baøe stations, which tend I° introduce q,
the network,
5 e Ay B md e i» ø tyele.
8. Solutions that takø power consumption into account bac
after ønother.
k a ciear. Multi
Cut advantage over the otherwise designed y{qti ø &fnOllDt of
, Every bleak M transmitted for an eqns
[' e sender time.
block
&^^ • '.xplain data broadcasting. 6 repeats the three
The average Waiting time for receBiving is søme for A, B and C.
than others
often
da*ß b l u distribute b1•cks that are repeated rnore
Multi-disks
Anøwer evenly over the cyclİc pattern.
@ @ access. For example, blockA.
io. m• minimizes tA
hedelay
B CJø Ause*B^ C
1. Broadcast systems are claßaified as
unídirectíoR£tl distribution These are considered as a A. Flat diskdisk
Skewed
2. aøymeietric communication systøøtø. B. Multi disk
The reason for being aaymaietric íø bandwidth ljmifiätíons, differences ø C A A B
3. in tranøoiisaion power and cost factors. Explain mobile IP. Liet the entities of mobile IP.
A C
Symmetrical communicaCion system provides communication in
both directions. e
4. the channel characteristics sutb as bandwidth and delay from Mobile IP : A
A tc B is same as B to A. 1. Mobile IP for IP mobility) is standard communication protocol that
5. For example, symixietrical communication .system is the is designed to allow mobile device users to move from one
telephone line in v'hich the bandwidth is same for the subscriber network to
and receiver, 2. 0t 8° hİ18 m8intainíng a permanent IP address.
6. Asymmetric communication syßbent provides one way The mobile IP protocol was developed by the Mobile-IP Internet
communication. 3. Enginee g’8ask Porce tlETFJ workíng group.
7. Examples are pagers, radio system etc., in which device or the user This protocol allows location-ifidependent routing Of IP datagram's on the
4. internet.
can only receive iriformation.
8. A special case ofasymmetrita) communication systems are Each mobile node iS identified by its hoirie address disregarding of its
5. current location in the ihternet.
unidirectional broadcast system there high bandwidth exìsta
One important døue of unidirectional broadcasting is cyclic rcpetiti0nof data.
10. from one œnder to manf receivers. While away from its home network, a mobile node ís associated with a care-of-
Brpadcaøt systems are claaaified into two categories: addresswhich identifies its current location axed its home address is
9. fior example, client/ærver environment.
ûS9ociated with the local end point of a tunnel to its home agent.
 Wi:rz•leos Networ/pg
j obile Ge putiria
8 I•tnbile IP epecifiea hna' a mobi)e node rcgtater• 2 ’l‘o make the size and t@ •
with iL8 home agent zm§ No+• The keme age»L zoutea detagzam to the
raohiJe oode through t
8. Mobiie IP pmvides an effizient, ecalable niechertium Vor roami•a thin
the Internet. 4. Toavoüdooludoostbat*eQuüeg q gig gg
8 tIsing mobile IP, nodes may chenge their
point-of-attaehment to tqg internet without ctmnging tjioir home fP
adzfress. the connection oF a dev¡y to ty ¿,
S Thfu a1loß'a them to wiaintein transport and higher layer corinectippg
10. Code mobility ls realized without the need to prepagate hoat•speygg 8. They are unique in the aentt that
one connection te the internet.
11. Mobile IP is a protocol which provided TP mobility to tufiure devices.
4. T'wo devicea on ibe internet cao
1i'.ntlt1es of mobile I P i Following are the important entities of mobile Ip . aa<ne tizzte.
5. On the other band,
connectiorio to

6* > t b ac Pted bY •nr h•at that wents to be oonneeted tothe

mg

1. Moblle oode (ñgNy : A ayatom Anode) thac can chango the point of
connection to tt›e network without ckeziging ita IP addreae.
ñ Home agent fttAl: A system in tha home network of the MN, typically OR
n rrvte›r rrgistera the mention of the MN, tumiels IP datagrema tu the Liat töte ezttitieu oF zoobi\e IP eod dea<zibe data tzaaa£ez fzozs • zaob\
COA. Ie
d. Foreign eg•ait IFC) : A syateai in the cunent foreign network of the \s•de to a Fsxed oode aodwioe-s'ezea Wby aod sebeee i• eacapsatatioa
MN, typically a router. It forwards the tunneled datagrcrna H tho MN,
typicelly alao the default router Vor the }yfJ I.
4• £Iare•of-oddreas fCOAf: Address of the current turret end-poi•t ter
the MN let f"A or MN) ectual location of the MN from en IP pnint of uiew, E • i t t i • s of mot›ile IP : Refer Q. z . u . P•ge 9zJ, Unt-2.
it cen h'u chosen, for example, via DHCP.
Working of mobile IP pr paoltet drliueey >° •
1. ¢ q@nt nodel Giants t dato
A8 ahoWn in Fig. 2.27.1GN ‹•
> to MN (mobile node1, the follo & • H• "
'
dleousu tha fe itures of iPv4.
b.
AN docs not Know whother MN i8 *8 8^ ° e

deetinatio• •ddr"••the the IP headtf.

IP »ends
Thereforf•, CN
1. Mobile 1 wnu devoloped
prpbloiiia ob mobile usera, 2. At the bfhl'8 home network, tö" ' °< “
the home agent.
 W irelesg Networ
g
tp pqulati•n
gp yqçgggpgçyetsbetoeenatunnel
a.
entrf d ° tun0eÏ
e forwarded inside the
tuiinel and
b. t} 9panged.
e the
t

of taking a packet cons et sg OM

ot
8• • •!• Packet delivery to sud born the m obile n ode pw and potting it into the dat# p of a new
3.
The honqc agent discnvers that MN is in roreigtt network,
4. A "-°8•°dòre8s has been anoiJ e• p *ket, i*
this isallocated
av;tilab1e to the home agent.
5. MB hOfD6 agent encapsulates the p c r fo - when à 9geket is traosferr "“ ‘ higher protocol
dategram, with MN’e caze-of-adóres6 as deetinatiort D-' adóress anó tbts
ntW dhtagraxii ia retransmitted by the home agent.
6.
At the f0reign network the foreign agent. intercepts the i u co n J g tp
the applioast!o ° W<P•
7. The foreign agerlt strips off the outer IP header, arid delivcrs the origen

8. lvfN intends to respond to this oseseage and sends a meazage to CB .

9. Prince CU ia fixed in this example, therefore ii bas a llxed IP nddress. 1. d°°¡oternet r a c e s for mobile and wirelcse
deviccs.
WMp
g. obóng the internet content soch as web paper and
lo. MN sends the packet through the foreign agent óirectly to the static tlephoocserücestD'
'ThegoW°## qjjya r phone and oiber wireless termio*s
IP address of CN, ib
E'uzrctioo Of zaobite SP : 3. lo 1997, Emeten, Moto »1«, Nokia founded WAP foruei to frame
t. Mobile ageat diecovery :
a. The process of detecting a mobility agent is quite similar to 4.
WAP integrates a light weight web browser into hand-held dcvi *
that by internet rtodes to detect muters rurming Internet Control
"• t,Cc1tO I, r«mi with 1im;iea computing and memory
Message Protocol t1CMi'i messages according to R°o'er capacitx.
D›*°••ew ( 125C›)
Sevcral comstfoints in mobile wimless network in order to access
b. The b&sit operation involves periodic broadcasts of a Side msd weight of rno1›ile equipment (port.sble).
interriet
advertisements by the routers onto their directiy attached b. Ttcstrictcd usen iztterfcce(smaIJ kcypad cd displeys, loweï
2. sub•networks,
Pegistratioii : znemory).
a Hav'ing rcceived a COA, the MN has t register wtth HA. c. Limited bandwidth and }ower reliability due to high error 4ata.
d. different WAP ents Idifferent screen size and features).
b. The r•aifypttrpose of the regi6tfiation is to inform the HA of thC
current locatioo for co°rect to e*dinfi p^ck*t e. Different voiceless bearer vretwurL like CRM, CDMA, GP88.
c. Regietration con be do•e in two differúnt witJ8 dflP°^ ° n the
I›. f. Heeiirity
’the’basic atld integrity
objectives of user
of the WAP is to data,
bringprotection of services.
divers internet content Ifor
locatknoftheCOA:
example, web pages, push services) and other data services (for example,
i If thn COA is et FA
 88 tI'F-8) Wireless Netwq
J de]§nes
temiîaaJs m
md nette
stock quotes) to digital cellular phone8 and other wireleBa, o »b J
terminale (for exemple, PDAs, leptops). 9iand• l namina model
8- Moreover, a pr0tocol auit ahould enable global air eless
atrosa different wireleas netw0rh technologies, for exam gd to identify
CDPD, UMTS etc.
fupCtfon8•
8. The f0rum is epibr acing and extending eai8tin
technologies of the internet wherever possible and 18
framecord
creatiqg g foi the development of contents and that
acros8 a very wide range of wireless bearer Pca; tire content based on ito type.
networks deviœ types.
SAP applications : y@W tel hnology and include
calendat
1. ifandiing intormation cleft lyyes. p piatioii, electronic bunineæ
2. Access to e-snail and chat.
3. Weather information. gtgadard communication
pJ@C:obs enable the
4. Information about currency rates. mobile terminal to the net ork web
S. Online music support of WnP multimedia etc. strver,
r}'t,ç 9/Ap conteat types and protocole haye beea o p t i o n forg
6.
,narket, land-held»fie1essdeviœs.

Q,tP utilizes pmxy technology to connect between the

1. Tlse WAP prograasming model as shown in Eg S.29. l ie similar to t e wireless‹iomain grid the
WWH pr0grammiAg model. g. The WA 9fOX$ typically is comprised of tbe following
2. This provides several benefits to ttie application developer g. Protocol gateway : The protocol gateway translated
functionality:
community including a familier pr0gramming model, a requeata from the WAP prot0ool stack(WSP, WTP, , and
proven architecture, ¢pd the ability to leverage WDP) to the WWW protocol statk trtTTP and TCPnP).
existing tools (for example web servers, tools, ett.).
Content enœ›ders anddecoders:M •^! W& *•
3. Optimizations and extensioris have been made in Order to match * WAP content into compact
the cbaracteristics Of the wireless environment. encoded formats to rehuce the s °! data over the network.
4. Wherever possible, existing standards have been adopted or have
been used as the storting p0int for the WAP
Diaeuaa the f•llnwing :
technology.
é ŒRE
80&11
Origine Server
Request Request y
—
WAE + Encoöers
User and
Agent Encoded Decodera Responae IBEE e0s.tt : Refer q. 2.t2, P•ge 69*. *°it-*
Reapoaee (content) Content CAP appücaCiony • ÏLefer Ç!. 2.28, ^8^ "
"''
 8) »ele9 N ing

Discuss the basic pri icip1e of WAP protocp} g y b j q p

t0 HTML, but opti pj¡jpq
Writn dow• the applieatinna o$ &A¥•. 6
p o p t : A 1ightweights,r,p¡ g]
OR
Explain the architecture and protocol stack of c i r c l e s qpp[¡qg jpg p i g l e t telephony apsli0atioii

ppntent formats : A set of we1l•defint

i¢iagea, QhOflDbOOk £QC0fidS and caltpdp

y y eeegjgg protocol ($ 'gP):

g coneisteTlt mterface for Lr,o tess,op

/ gttj ;y ]pyer protocol WfP. operates above the

t
"”t WAP
A- the second is a connectioaiess s e t C e that operates abovt a ,p
TMJ SAf' Application layer IWAEi Additio»giU
„
pbe wireless session protocols currently ‹oviit i o y ‹ „ , p
fication layer lWfiP) , applications
HTTP it-SAP t „ bropsipg applications fWSPfBL
D C - Snp’’‘o'‘''"o’ layer {WTP qsp¿B provides the following functionality:
Security facet tWLS1 g I I. I functionality and eemantirs in a compact „et.tjie-
T.SAP a¡r
TCP/IP, Transport layer IWDPI w0jsp
b, encodin8 session state.
Long-lived
c. Session suspend and resume with session migration.
a A common facility for reliable and umeliable data
push.
Wieeleuu application environment tWAE) : e. Protocol feature negotiation.
I, WAE is a general-purpose epplitation envir0nment based On
9 }jgbt-w8 ht
a combination of World Wide Web (WWW) and in0bile L \¥'TP nuts on top of a datagram service and pr0V ld£•S
telephony transaction-oriented protocol that is suitable for P • °>°°° “
clients (mobile stations).
2. The primary objective of the WAE effort is to establish ari
interoperable 2. WTP operates efficiently Over secure or non-3>
8nv*ro nnient tllBt Will SHOW op9ratorS end 8pNice pf Oviders th build **> " ‘£t' networks and provides the
applications and services that can reach a wide variety of • Three classes or transactio° semi°°.
different vreless pletfurms in an efficient and useful munner. f0]lowing IB&US* '
b. U rireliable one-way requPStS.
3. WAE included a mitre-browser environment containing the
fol1•**88 ‹ Reliable one-way requests.
Reliable two-we)' request-reply transact
°"'
 e
ygchruaou8 trao8actions, dÎffegÎQ /@yQ|g
throughput, errn p
p yggç tz¿agport layer Bec+zxñty (WT'LB) :
3, The WAP pré }$
} qrj}y i¢g c i t y protoeol based upon the indp¢tty.
° 1°ve1° °f
layer a e c Jt y (TU) protocol, forinerly knowq qt aec aervlte.
(SSL›. clteta 1ey„
4. The list of suppl d bt
g y/g' is jzjtended for use witb the /AP g
OI\mer eez”vioee aa4 appÏ¡çgtjqmg ,
tranBpqtt being added es the wirelegs
3. WTLS providea the followirig 1. The WAT' Îayered pg t
feature8 : eoableg
° Utili» the features ef the
a. Daia iot•gri¢y : 9/TL2 contaizta facilities to erisur e wAp înterfaœs.
between the terminal and en app1'°® °° 8°rver
2. External application may aœess qp q
the ge sion p q
c. Authentication : WTLS contains facilities to
authenticity of the terminal and applicati0 >rver. 3. •• t
This alloæs tbe WAP stack td be used for applicationps a nmd
cor¢eatTy gpectfied by SAP, hut deelxecl to be valuable for tbe
Dsni•l-ot-service protection : WTLS makes market,
nanyt pt-yrvice attache harder to ace0mplieh a'ireleBs
and protocol lsyers. 4. F0r exampie, appticaÔons, such as electronic maj, calezidar, pypq¢ #
notepad, end electronic eoetnerfe, or services, sucfi ai white and yt|
$p pages, may be developed to use tire WAP protorsla.
for exemple, for authentieation of electronic
business Application of WAP: Refer Q. 2.28, Page 9†J,
Uoit•2.
Wireless d a t e s pr 8ocnl (WDP) :
t. The ttanaport layer protocol in the
WAP the wireless datagram protocol
IWDP). YgRy Ï tI’OR'I' \J"rT' qUgS'rtON8 '
The WDP layer operates above the data
capable by the varient network types.
2. As a general transport Bernice, WDP offere a conaist•nt nqrviu tg
upper }aygr prot0e0ls of WAP and communicate transparent]y qvp
pp
of the available bearer services.

4. 8iuce, ü\e WOP pcoLocoLs provîde acoœœo0-interfacefa Lhe u9pcr \ sgg Refer Ç{.
2.1.
a protomls the security, session and application layers are abh to
q ind•r•ndently of the underlying i Ce1)spüWiog
1. The WAP pro terola are designed to operate over e variety of di8ereet ii. Near and tar pr°ble°
wirelesa network.
Jgj•pt yryicgg, tnc]uding ghort rAû8S8$b, Cifittiit•8Wikb6d dAt6, FAd üi. Bidden teræind p °b!e-
packet datft. Asg Refer Ç!. 2.9.
104(IT#8)•
Wireleas Network
I
Q. 3. What is bluetooth ? Defioe tecboicaJ Big@^tÉicatIo
bluetoeth. Describe the bluetooth stack ope t{
Refer @. 2.16.

Q. d. £fow TCP over wireleas worhe ?

Refer Q. 2.19.

Q, fi. Explain mobile IP.

Refer ¢}. 2.25.

Q. 6. Diseugs wireleas
applieatàon protoool
arehiteeture.
Refer Q. 2.31.
 Data Management >suee 10'f fI'f-8)
Mobile GO P< t '°$

i. Mobility tL tion Management)

2 ñsessmeñ
.
Cache coo8i6teD•y and data replicattoo
g

• Data management ig a process of maDaging datf2• as a resource

organization nr business.
p,
@ i r e l e a f l 8eCl2fjty i e s u e e
tnat is valuable to 7
Some of the issues of d a t • manegement are : pq ty of mobile devices pf Service)

jf fft of attachment
b. The lot;tttion of mobile elements and therefore ement
CA
Wireless medium to the {'ixed n e t °

s e c t i o n management
‹L Portability of mobile b. Where t4 BtOT pcation inform
devices p should be respottsible for
• Data replication generates and maziage8 multiple copies of data
ia
at one or more sites. nf¡guration of a sys>< ‹act a l lu d e s o1obiIe e\eaent
4mtñbuted

mpre rely on a fixed top0I8gY

Dtaczkae tbe ds 'teeeot data zoaoxgeosent iaauea witb locate uaer
respect to mobile computing enwironmente. uery
b. tIOO
d e a d for
OR q e g the lo
• ^ the issues and challenges of data management in third
g. Location
8°aeraGoo noAleatmodsrd*. 1 6 prmation.

ii. p t p9Jqrmance and

maF have to re ¥
b tgnee, ouMoo"s"”’”e client
. ’vit
pfferod reliable
In mobile com utin , « • • i i m bile technplogy support broadcast data ofdei‹ ®
tbe arid
load at
°
A 8rver broadcast information to all mohile clients in ita cell.
iv. Wireless °
Theae
° two
different ° •8mt8 introdu
er hand, ce ngOnly
clients acceas datfl when data
w mechanism management
needed.
for traditional client leas reliable
server distributeddatabase 8yg@
 Data Management laauea
Mobile Computing
e. -Ëved træsactżone due to æobîîtt
The mobile
;ø,¡ş, data ædusers æid e• e tO frequent diaconiiectiooa.
O gppport æid hæidle concurrency
f The
. øgve,q„ą¡8COæectio d æ^ ual consistency of replicated data
n 1. Mobile transactions are, in general, distributed tranaactiooa
where some actions are performed in mobile computers æid
otbese lv fixed hoate.
2. It follows tbe ACID propezżiæ, be., atoozioțy, conaîatezu r, żsołaŁioo
æ Who is the attacker ? æd durability.
M«t are the vulnerabilities ? What are the weak linl£ø in the These properties are hard to enforce, especially when the mobile
gygt
coæputexB are disconnected.
What could be the possible exploitationn of theee vulnerabilities by
4. In the disconnected case, techniques like two phaae Iøćkipg øod
the resulting attack ? two phaøe commit may seriously affect the availability of the
What need special protection? database system.
e. To prote c t ouz aeseta front a t t a č k h o w æ u c b d o e s t b e sectLrÎty
S. for example, when a disconnected mobile computer ownø a lock
over datøbaøe itemø or if other are waiting for the mobile

8
aysteæ cost żo tezœs of æooey resources and t î œ e ?
computer to know ifàt ia ready to perform a commit or not.
When security øystem is deployed, to what extent will it affect the 6. Therefore, it ia necessary tø provide transaction support for mobile
openness and add to inconvenience ? environments.
a. Is prevention better than cure ? If prevention is expensive or Thua, trønøaction management is a core component of modern
impractical, what iø the strategy to recover from the loss following database øyatems.
attack ?
& Isøues relatżny to Quality of Sen•eżce . h. Data dźøøe atiozn :
a- Quality of Service (QoS) in a mobile network is affected due to 1. Cienerally data dissemination is done by using broadcasting.
network cooziectivity. 2. Broadcasting consists of the delivery of data from a sezver
b. POS toolø measures the bandwidth availability, which controls data to a large set of c•lienR.
traziefer rates, connection reliability and data-loss risks. Soæetiæes, It ie slso called push based. Îa pusb kased, tžte sewer
avoids żatezzzzptiooa caused by zequeats o€cheota tbe

e
’
c. Mobile device applications adapt TO POS. POS is impurtæit
›zse oftžze baødwidtÎz żo tbe upstzeaœ dżrectźoo.
consideration in distributed multimedia atreamø.
4. The main aa ts of the broadeøsting system are the clients
d• QoS iø importæit for adaption of visual dísplaysonsœøHscreento need and whether to send the data peNodically or aperiodicølly.
a certain sustainable level in caae of loss ofeounectìvity and lone of
5. Periodic push meøne allowing clients to discoiniect for certain periods
and Ttill not miss out items.
"'" of æo ice ^•æputžoB ozs tz•aoaactźoo Aperiodic dissemination means effective way of uaing hazidwidth
available.
tžte OR
processing. &WBtÏCØBtiØQ Chi be achieved by using multicast addreasea.

The aevver sends data to a group of clients using the address.

9.
n pullalso
There baaedexist pull based
operatíone, øod explicitly
clients push based approach.
request item bg e n d i n g
*^• ^tabaøe o''ezźžoæ meneages to the s e w e r, which th to
the clients. ßønd the information back to

m Query eoeeaaiwg :
1.
Q12er¡y prOcesaiog iø affected when mobility is considered.
 Data
kid
ri meth h ob
@ H h n io m iz e CPU, i n pufoutput att Mobile Computing
pli
3. 2. The client and server have wireless connections.
z a mobile dixtributed environment, the COM
m a c h more dilficult to e s t i m a t e because the &Obile hoats
e Bld 3. A cache is maintained to ho]d frequent data and transactions so that
suited in different locations. they are not lost due to connection failure.
4. The work related to query processing in mobile 4. A database is a structured way to organize information.
lh 5. This could be a list of contacts, price information or distance traveled.
how to deal with guerres with location constr , r.e.,
involve the individuel locations of users. •int
6. In mobile databaee, user would requise to aeœse and update
5. Berause the location of users is not exact information from filea in the home directories on a server or customer
more dynami0- records from a database.
& CaekJ•g • 7. This type of access and workload generated by such uners is
different from the traditional workload seen in client server systems of
1. Cachñig is a widely
today.
used mechanism performance and
8. With the advent of mobile database, usera can load up th•.ir amart
2. availability. phonee or PDA with mobile database to exchange data remotelywitliout
The fozmer
main difference between
occure after caehing and
tbe retrievaJ nnd nue of the date worrying about time or distance.
latter in a priori way.
3. replicatioq WeedInformation
9. for mobilecan be synchronized with a aerver database at a later time.
databases:
Especiatly in a wireless mobite environment, eachin@ 0 freq tI3
f uen 1. Mobile users must be able to work without a wireless connection due to
aeeessed data in a mobile node's local Storage cp reduce eoergy poor or even non-existent connections.
and bande'idth COnsumption es weli as queeg de7ayg, #bü
same time increasing the system's the S. Applications must provide significant interactivity.
e 0/
4. lfowever, a fundamental issue when considerin caehing P°8Ôes R Applicatioris must be able to access local device/vehicle hardware such
data oonsistency. g as printers, barcode acannera or GPS units.
5. @
 clieot æuat aJa'ays ezzsure Abat data la ice 4. Bandwidth must be conserved.
cache is up-@-dätt y
order to be able to provide valid responses in submitted queriea. 5. Ueers do not require access to truly live data. but only recently modified

6. Limited life of power supply.

1. °a& 8 c0mmunication service (PCS) network, mobile data
]ppgyjon registers
tlOK d$tà( Vy
andL 9the
g ) elocation
ut¡j¡zed to temp t y
cælleÖvthe
store ûy)#psubscri 7. The changing topology of network.
•* g users. Mobile Database æxcbitectuze :
2. 1. In mobile computing, the network consists of fixed hosts (FHs i, mobile
Becauee abuser ntob* *É)t I IS O6aible that the VLR
mobile user arrives. Bull when a units IMUs) and base stations (BSs) or mobile support station
8- Under such (MSS).
the inc pg user has nO VLR record
and thus * M o t reeeive 2. MUs are connected to the wired network components oniy through BS
4. #CSservüce.
8 i asue is ealled VLp overflow via wireless channels.
cOmput¡ or database overflow in mobüe
3. Here MUs are battery portable computers, which move around
freely in a restricted area.
Alsp dippppp th e 4. The cell size restriction is mainly due to the limited bandwidth ofufieless
- o b i l e database. cozdmunication channel.
•8 base. 5. At any given instant a MU communicate only Frith the BS responsible of
its cell.
° ile datgbgt e
• y A fDObiJe databaBe a. A mobile unit (MU) changes its location and network connection
isg
dàtHbage that eau b. while computations
While in motion, a are being
mobile processed.
host retains its network eonneetions
oœputing device over a be coonected to a mobile
mobile netwp@ through BS with wirelees connection.
 lid(IT l
c. BSs and dat a
function8 with the help of datBbase system (DBS) Mobile Computing llfi (IT-B) ‹J
incorporat e database processing capability bt
8hout
aspects oftbe generic mobile network. 8. In mobile enviroriment, the user may alao change his device to
access a service.
9. Sio, the diversity of deviceB and cnosequenttythe context ofuse of services or
an application must be taken into account.
DB 10. Intact the mobile environments are characterized by a frequent change
in their resources which cozries from various sources auch ae the nature
A ofwireleas network itself, the mobility ofuaer8 and multi-terminal access.
11. This change may influence data replication because the creation of and
accese tn theae data may need a eet of resources.
12. For example, confidential dntn like credit card number may not rue
replicated and exchanged acrpes non-secure nodea and link.s
13. Thus, variation in the level of security may prevent the user from
accessing this data.
14. So, a traditional aystem is not able to satisfy the client's request.
Fig. fl.S.l. Mobile databaae ar•hit8Cture.
15. To eouure service continuity, the replication ayutem functionalities like
creation, placement, read, write and consistency operation must be
Wbat is dat a replieatiozi 7 adapted tn all variations in resources that data may need.
OR
Bow the d a t a replioation wo rks 7
[email protected],
OR p
EÏoæ does
plieating on o:iobile

• Data
liL8ti0n generates and copiea of data gtp
fr more sites, whieh allowt an e nterp rise
°*8nziization. to 8 h a r e corporate data
2. It provides• back» ' J ‘ O t
cQBe of 8x8tg2fj failure
that iflitf8lly used in traditional
nvironment R increase availability and tu improva
4.
the Oharacterized b •d infra tru tur»
P°manentyl ••nnect d In the network. whenresources and are
t h ä t Î2jkve suflicient

mobile environments.
• fr devicea such

7
. z preven pt athe
œ , ba*>w power and processor capacité.
ri t P +8Ôo£t Bystezzt from creating and
he uaer device.
 g sponsible for the creation a td plã‹;ø $g$ Mobile Computing l l ' 7 UT-ßł I
e. Aløo, a large nu mber of messages re q u i re d t o coordinate
5 synchronization.
te• pe forrøs these er locates Phc-forreaĄ” ’ ” ” M
ensures replica y b2
6 a. Asynchronous replication isa technique for replicating data
. and update message after each svri£e resp) between databases (or fíleø systems) where the øystem being
conßict6-
replicated does not wait for the data to have been recorded on
2. The dupłicatf sj'StOfD before proceeding.
appJİCźtti» interface and iøt b. Here the target database is updated after the source database
$. tion they store this change in
Next
respectively.
required context they n0tify different modules C Alsp, the delay in regaining consistency may range from few seconds
tion . to several hours or even days.
freplica Pla n n e r,
tOCa] consistency nsønager) of this Aøynełironous replication has the advantage of speed, a I the
Change. iiicreased riøk of the data loss during communication or duplicate
q. To improve the performance and øystezzi failure.
e. It ia ttie latest technology to provide fault tolerance for server
11. 'the systeæ state ment tor parameters and network storage.
e t,
and notifies the replic£t pt consistency 9bOD bese f. Unlike previously used replications technology,
Țpø
12. manager of this cbangø. asynchronous replication technology works by cept uring changes
tiœe d O¥¥t It in files at the operating syøfem level Ibyte level).
applieatiø* deplo • t
. g. As previous technology like iàQL transaction, replication works
the within applications or at hardware layer.

the btPfltegy jØanager ehooe single updsfer forzzi of replication where only the publishing sites
aø°
C•Onsiøtency PIGmentøet the adapted bitrat egy, ensurøø
cha upda te tbe da ta ) axed n e a r re a l t i m e re p l i c a t i o n s c b e æ e s .
same or øJj
b.
Ön&pSItot data repÍicatiQns @ leØt suited tp applicatioj2ø i n c h are
In t i n i i ee d of current data.
appIieaÒons are found iii data wørøhousing pr dsta minizig
eeZ ^s -r e a l **œ• ecżsżoa suppoz”t ByGtOŒ S.
A '•&P real tim e replication employø triøøers that are stored at each
fOr °'* Rd combin ations. There are local ttatahase and executed each time a part of replicated database
mtunly t h r e e s y p y
is updated, P"OPb^üngtAecAœigeaMtheotberreœoœ
databases iS a e
. M datø are to update Wnnnparently and rudeprudent
theaodusere.
the data Avebeen the system g zeplieated dœ8 he P
zecprded o„ tile dupy cø øyø@ø f. tit ORpush
procedures stPãtOØ3f, the BOurce d a t a c o n t r q t ø the data replication
scbeæes, the \ocat
to aM a e determine the replication processes.
*Pdateø are applied g.
The d a t a b l e rep repJiøøtjqp••py$t,p push replication, a publisher SltR COntPOl5 when replication is tn
pli ept ' ‘ state ° øYncbronization.
are that hold replicas wisżi 'npuüfrepÜratiogCgesøb pp sites determin when they
Whfle e
 9
a
e
â
Ë
e
8
i Tune in broadcast, obtain pthe te ppral offset of tlae ne eontrol index
. be'+ct ••d go to nose mode.
«¿«p«m»t ihe tu»e »Cih°•Pe‹°e«W mA*.0ear
target data zd.
wbetfier
mns,ou ‹he
to : #.
tbe requested data bad already paeaed oyer, go
q@g mode again un tfi the be g of the next broadeMt And proceed
 Data Management Issues
Mobile Computing
Applications areas of clustering:
• C]ustering is a process of organizing data Objects into 1. Biology: Gasaificationofplantsand according to their
groupe whoae members are similar in spme manner. features.
• Adaptive Clustering works on wireless network infrastructure, which 2. Library: Ordering of books.
is fast and deployable. 3. Mariceting: Finding groups of customers with similar behaviour
• The CODA (Constant Data Availability) file system helps to given p ]arge database of customer data containing their properties
maximize the client/server ratip. and past buying records.
Jity•PIgnming: Identifying groupa of houses according to their
house type, value and geographical location.
QueaÖonsAoswers WWW : Classification of documenta and clustering the web data to
discover groups ot similar access patterns.
Lung Answer Type and Medium Answer Type Questions
Wbat do
is used for æobxle you
eee uzsderataad
seizet ztetworlce 7 by cJuatezîog 7ITow clustPxtog
Discues.

e €xplain cJustering. What are the requirements and OR

application areas of oluatering 7 Explain adaptive clvtstering for mobile wireless networks.
je 0 4
Cluatering :
1. Clug@ring i8 the proceed of organising data
objects into groupa whose æembers ai-e similar in some manner. CJustering: jtefer Q. 3,g, Pege 120J, Unit-3.
A cluster is therefore a collection of si iilar type of objects and the
2. Adaptive cluøtering:
objects that are dissilnilar of them belonglng to other clusters. 1. Adaptive clustering works on wireless network
3. The criteria for infrastructure, which is fact, and deploysble.
simiÏUty in clustering can be distance i.e., two or more
The first infrastructure of this type was the Patket Radio Network
o@ects belong to the same cluster if they arc "CiO8e" according to a given IPRNET).
4. geoinetrical distance. It was totally asfne hroro ua and based on a completely distributed
5. This kind of clustering ie cafled di9tanœ-ba.sed clustering. architecture.
objects belong to the sacre cluster if one de6nes a concept common to all One of the features of adaptive clustering is multihopping.
that objecta.
Another kind of clustering is conceptual clustering, in this two or more
5. Multihopping means the ability ofthe radios tu relay pacheta froc one
6. to another without the base stations.
•t oieans that objects are grouped according to their fit to descriptive
concepts, not Recording to simple aieiilarity measures.
equ re•ienta ofclustering: 6. Most of the nomadic comptitÎng applications are based on a single-hop
radio COnnectiOn to the wifed netw°*k
Due main requireeients that a clit8tering algorit{im should satisfy
1. are: We may ahow eingle-hop and multihop with the help of following
Minijjml ri2qtlirements for domain knou'ledge to deteraiine input diagram :

B
D
3. DifiPovering clusters with arbitFlt Pxshape.
4. Mabitity. î 2” 4 6
P•ig. 8.9.1. Conventional cellular networks (single-hop).
5. Dealing with dÏfferent types of attribuées.
g.
In the Fig. 3.9.1, a mobile node is only one hop away fri3fFla base StHtiOD.
6. InterpFetabilitÿ and usabÎlity.
 D a t a M a o a g e z a e nt Iasue Mobile Computing

otobtle n o d ee t o u a t b e t b z o u g b f t x e t Page 11. The system topology is divided into clusters with independent control.
12. A good ctusterTag echezae wdl tend to preserve its structure wbezs a few
in ed backbone.
nodea are moving and the topology is slowly changing-
situation.
a mobile node may not be a b l e to acceee tbe wired 13.
ll. If a base •t^+ ••wetg¡jt,
ng.3/l2ghO tbe za\aft Og Otherwise, high processing and communications overheads will be U
oetworRi°# giagte-bop. 14. to re-construct clusters.
.8
B wi t i ›? a a c l u s t e r, it s b o u l d b e e a s y t o s c h e d u l e paclcet traoeaziBsioW
. ', ' D to allocate the bandwidth to real time traffic.
15.
Across clusters, the spatial reuse of codes must be exploited.
16.
Since there ia no notion of clusterhead, each node within a clusttf
iH is permits us to avoid vulnerable centers and hot spots of packet
17. qtreated equally.
traffic dow.

wt,at i» «iCiei • t e • a • b i t e • t • = e t o i • c • • • aas' °°e

1. A major challenge in multihop multimedia networks is the ability to algozitboz required to paztitioo tke zzeto'orL izzCo several rttxB¢eM•
account for resources so that bandwidth reservations can be placed on
them.
2. In cellular (single-hop) networks such accountability is made OR
easy by the fact that all stations learn of each other‘s
requirements, either directly, or through a control station (for example, Explain clustering algori** w••
buse station in cellular
3. This solution can be extended to multihop networks by creating clusters
o! • oB, B*Ch 8 WSG t h a t flccesa can be controlled a n d b a n d w i d t h
can
Nulticluster arch itectu re : Refer Q. 3.10, Page 12M, Unit-3.
4. b e a notion
The ocate8of
iztcluster
e a c b cluster.
has been used in earlier packet radio nets, but Clustering algorithm :
fOZ• hierarchies-l r•outing rgther thap fpr resource allocation.
1. The objective of the clustering algorithm is to partition the network into
5. MO8t bieKBrC@iCBI C1ug@ s e v e r a l clu st ers.
architect deg f;gy zaobite radio networks
are based oo tbe concept of clueterbead.
2. Optimal cluster size ia dictated by the tradeoff between spatial reuse of
6. The clusterhead acts aa a locaj tp td¡pqtpt of transmissions within the the channel (which drives toward small sizes), and delay -inimization
cluster. (which drives towards large size).
7.
It difers fromDOI
thebgve
basegstation 3. Cluster size is controlled through the radio transmission power.
t BI it bOe8 cial conce t in c urrent cellular systems, in
and in fact is dynamically selected
4. For the cluster algorithm, we have so far assumed that transmission
§@ power is fixed end is uniform across the network.
among the aet of stations. respettoonñnwy s t a t i o n s , Brad
t h e r e f o r e it zaay becorae the %tt1eneck of the cluster. 5. Within each cluster, nodes can communicate with each other in at most
8. However, it does estra p¢tjt two hops. The clusters can be constructed based on node ID.
9. To overcome these âW6ci5ties,we elimina requizeraente for a
te tbe
clu st erb ea6 alto g e t b e r a a d approach for cluster 6. The following algorithm partitions the multihop network into some
non-overlapping clusters.
10. The objective of the propose d 7. We make the following operational assumptions underlying the
Clusteringgtgqritbpt
tercoonected set of clusters cove tgto find an
the entire node population. construction of the algorithm in a radio network.
 1S4 (IT-81 J Data Management Issues
Mobile Computing
8. These assumptions are common to most radio data link prot00OlS. b. In a cluster, any two nodes are at most two hop away.
a. Al : Every node has a unique ID and knows the IDs of itfi I- c. The algorithm terminates.

hpp neighbours. This can be provided by a Distributed Clustering Algorithm in

physical layer for mutual location and identification of radio G : the set pf ID's of my one-hope neighbours
nodes.
c. A8 : Network topology does not change during the algorithm
A2 : A message sent by a node is receiving correctly within a finite if Amy id == simon›
execution.
time by all its l-hop neighbours.
9. We can find trem this algorithm that each node only broadcasts one
cluster message before the algorithm stops, and the time complexity is my_cid = my_id;
Ot | V I) where V is the se* of nodes. broadcast cluster (my id, my_cid);
l0. The clustering algorithm converges very rapidly. r -- r — fmy_id);
11. In the worst case, the convergence is linear in the total number of
nodes. Consider the topology in Fig. 3.11.1.
y¿ I3
1
14
f
1 1•i on reeeiving cliistered (id, cid)
t0 6 1
4 2
19 18 6 7 set the cluster ID of node id to cid;
if(id == aid and (my_cid == UNKNOWN or my_cid > cidl i
tab System
topoiogy my_cid > cid;
r = r — tidi;
C3 14 15
iflmy_id == maintU))
1
10 66 1
4 20 if(my_cid == UNKNOWN) my_cîd = my_id;
î9 5 7
18 broadcast cluster (my_id, my_cidJ;
8 9 G = G — ]my_id};
Ib) Cluster formation
Pig. 8•ll.1.

12. After clustering in Fig. 3.11.1(b), eve CitR field Six clusters in the system, if(r --o›
which are fl, 21, (3, 4, 11), (5, 6, 7, a, 9|, (10, 12, 13|, (14, 15, 16. 17Î, lt8,
19,20} stop,
13.
To prove the correctness of the algoElthITt we have to show
that :
a.
Every node eventtially determines its cluster ••a OI2I2 One
cluster.
 D • t a Man agem e n t lasues Mobile Computing l<> f -
13. Like Venus, a file server runs as a user-level process. lu addition, tru6te8
; g ; 3 3 r ] W h . t Was „i. m o t i v a t i o n f o r d e • i g n i » « ‘*•• CODA Vice machines are allowed to run an authentication aerver. Finally.
update proceseea are used to keep meta information on the file system
gBtem t piscu«s CoDA file syutem in detail.
consistent at each Vice server.
14. CODA appears to its users as a traditional UNIX-baaed file system , lt
supports most of the operations that form part of the VFS 8peCifîC£tt1OO•
OR
15. Unlike NFS, SODA provides a globally ahared name space t h at is
Expla in CODA file Bystem. maintained by the Vice servers. Clients have acceas tn thia
namesp ace by means of a special subdirectory in their local
namespace.
1. CODA was designed to be a scalable, eecure, and higMy available 16. Whenever a client looks up a name in this subdirectory, Venus ensures
distributed file eystem. that the appropriate part of the shared namespace is mounted locally.
2 Mobile client
An important goal was to achieve a high degree of namin g Bfid locatloil
. Application Cache Ste e
tranaparency so that the system would appear to its uaers very similar
to a pure locnl file aystem.
3. By also taking high availability into account, the designers of CODA
have also tried to reach a high degree of failure transparency.
4. CODA is a descendant of version 2 of the Andrew file system (AFS), and
inherits many of ite architectural features.
S. CODA follows the Bame organisation as APS.
6. Every Virtue workstation hosts a user-level process called Venua, whose
7. rale is similar to that of an NFS client.
A Venus Process in responsible for providing access tt, the files that are
8. maintained by the Vice file servers.
In CODA, venus is also responsible for allowing the client to continue
9 operation even if accees to the file servers is (temporarily) impossible.
. This additional role ia a major difference with the approach followed in
10. The important iasue ia t h a t Venus PtjnB as a user-level process.
11. AgBI•, there is a eepazaLe Virtual EJle ¿ g y m gag) layer that intercepts
all celle from client applications, and forwards t h è s e calls e i t h e r to the
local fde ayatem or to Venus .This organisation with VFS ia the same ac in
NPE. e D1B42UBB the co mmunica tio n of CODA file Bystem.
12. Venus, in
°› °° 88b9s With Vice file oervera using a user- level
System. The RPC system ie constructed on top of UDP datagrams
and provides at-must-once aemantics. There are three different server-
side promesses. The great majority of the work ia done by the actuel Communication in CODA te done through remote procedure call (RPCJ
Vice file servers, which areres$onsible for maifttaining a local 8nd RPC2 systeme.
of files. coliection
2. In the call, each time a remote procedure called then RPC2 client code
starta a new thread that sends an invocation request to the server and
get8 block until receives an answer.
 $ y g) I ssues
Mobile Coniputing 199tEY-8) J
t Data u anagerne n

3. £i a n d s e rver
Jn this case r e q u e s t i n g process stay take arbftr8Pÿ 8i
sends message tu cl ont reful ® rlY
4. Reply

5. If server fails to give response then side effects work.

A side effect is B mechani s œ by which the client a n d s e r v e r c a n
communi Cate using an application specific pPOtOCOl.
RPC8 allows fihe client and the serve r to set up a separate connection for
7. transferring the video data to the client on time.
Connection
Venus runs setup
as a isuser-level
done as aprocess.
side eïfect of enis RPC
There cell to thevirtual
a separate server.file
8.
system (VFS) layer that intercepts all eallu frnm client applications, and Time r Time
forwards these calls either to the focal file syatem or to venua an shnwn Ïad Lending an invalidation (b1 Lending invalidaLion
message one at a time message in parallel
:g .. ...
9. Venus communicates with nice file servers using a user-level Remote
Procedure Call (RPC syetem).
Prnceasea in CODA : In CODA file system, clients are represented by
20. The RPC System ia consirueted on top of UDP dptggram$ aad provides venus proceaaea whereas s e r v e r s a p p e a r a s vice processes. Both
at-most-once semantics. processes are organized es a collection of concurrent threads. Threads
in CODA are not preemptive.
N a m i n g in CODA : In CODA file system, all files are grouped into units
Client referred to as volumes. Generally, a volume corresponds to a collection
of files associated with a uger.

nrc Applieatipn-epecific File Identifiers : T h e collection of shared files are replicated and
distributed across multiple vice servers. CODE contains physical as well
effect as logical volume. A logical volume contains replicated physical volume
i nfe ct and replicated volume identifier (RVID). Each physical volume has its
owm volume identifier I VID). CODA aasigns 96-bit file identifier to the
RPC tlient file 8ystem.
Stub RPC server
stub
y D•scczes tbe seo= iw in CODA• A1ao, exptaizs tbe feat«res

11.
A• important de8ign issue in CODA is t h a t 8erver keepg track of which
clients h av e a local cfipy pÇ ¿t j5jg.
12. Whezi file is modified, a server invalidates Generally, the security in CODA is divided into t wo parts :
•• a1 copies by notifyjng the
8*ppropri -tte clients through an RPC. 1• A u t h e • i t i c a t i o n a n d s e c u r e c o n n e c t i o n : I n this case, RPC2 package
13. If a server can notify only one client at a time, i n v a J d a Jg works. This package has a mechanism for security authenticating clients
nsay talte some time i t all clients to Berver and vice-versa.
ta F'ïg. 3.13.Spa).
14. shnwn
Henee the problem is •au•8d by the fact th&t A c c e s s c o n t r p l a n d p ro t ect i o n Database : The directory access
Bn RPC may fail. To
overco me this problem , the server rendu Control list protects the files on coda aerver.
invalidation m essag e tu all
clients in parallel as shown ioFig.S1l2fbt
 Data Management IBsuee
Mobile Computing
F'eatures of CODE :
6. The CODA
1g1 (FP-B) J namespace ia mapped to individual fde servers at the
t. It ia freely available under a liberal license. granularity of sub-trees called volumes.

2 Server replication. At
7. each client, a cache manager (venus) dyna3nically obtaina and cachee
volume mapping.
S. 5ieeurity model for authentication, encryption, azid acceaa control.
4. Well defined semazitics of sharing, even in the presence of 8. CODA uses two &ietinet zaechaos
izoe to achieve bigh avatIabi1ity-
networà friture. 9. The 6rBt ¥lteckardsza is aerver replication, wbich a1IowB veTuzaea to have
5. Goed scalability. read-write replicate at more th an one server.

y 6. Continued operation during partial network failures in aerver network.

What do you menu by C O D A f i l e ayetem and also explain
l0.

ii.
Th e set of replication sites for a volume is known as volume storage
group fVSG).
The aubaet of a V8G that is eurreotly accessible is a client's accessible

, t he clients in C O D A 7 Tfow -
in CODA †
fil"oonnected operationa p e r fo r ni e d
01
VSG (AVSG).
The second high availability mechanism used by CODA, takea effect
when the AVSG becomes empty.
l While disconnected, venus services file syatem requests by relying solely
on the contentB of its cache.
cOÔ8 AÏe ByfiÈe¥Œ: RÆjez' @, a.12, Pgge \g , jyty- 14. Since cache zniasea cannot be serviced or m asked , t h e y a p p e a r a s failures to
g replication programs and users.
Disoooaected
1. Oisconnect edoperatiozsa
operations isizs coq.Æ
a mode :
ofoperationa t h a t enablea a client to When disconnection ends, venus propagates modifications and reverts
Continue acceesing critieal date during tempor toserver replication.
y failures of ahared
data repoeitory.
ü Desig n the CODA file s y s t e m a n d ex p l a i n the
2. lt is a teæporary deviatioa froæ ooztoaj operation as a client ofa ahared
different s t a t e s • Dz‘Bw t5ze atBte t z a o s i t î o o d i a aæ
3- aztô diacozszteeted
operation in C O D A file aystem. U P T U S0k4-ïfi, M a r k s 1 0
Disconnected operation in a file sy stem is indeed feasible, efHcie nt and
usable.
OR
4. The central idea behind tliis is t h a t t h e caehing of d a t a , widely used tu E a p l a i n t h e variouB venus states for diaooonected operations.
improve Performance, can a18o be exploited to enfance avaüability.
Clients in C O D E :
1. CODA contairie a far
Be uOCtiOl3 Of‘ïîTttrusted £I]{ Y clients ao d a szgalÏ
C o l a file system and its states : Refer Q. 3.12, Page 126J and Q. 3.13,
° u m b e r of t r u s t e d UNfX file servers.
2. Page l27J; Unit-3.
Each CODA euent has With the aervera
Dis0onriected operations : Refer Q. 8. l5, Page l30J, Unit-3.
over a high bandWidth network.
Ve n ua sta tes :
At certain times, a client may temporariJy unable to eommunicate
or al l
CS b£ty be due to a serv i r o r network fritur e, or due to the detachment Ofä
some of the servers. 1. Hoarding, e m u l a t i o n anA r e - i n t e g r a t i o n a r e t h r e e s t a t e s i n th e
4. disconnected operation in the CODA file system.
portable client from the network.
2.
These three atates co n e under venus states o r i n other words it also comes
Clients view CODA as e 8ingle, location-trang under discoruiected operation in CODA file syatem.
system. parent s h a r e d UNIX file
 Data Management Iøøues
Mobile Computing
L Boarding :
a to this stat•, venus hoardø the uøeful data in anticİpatİon
It o2&HSBB lts cache in such a way that balances the needs of
VERYIMPORTAWTØ g o
b.
cpnnected and disconnected operation. EofoMfiMf gØa M # H o o a Ø r e u e y £ nqŒwfo o € 7 7 m a e qmieafźoøm
zzs•т 6e aeAed ›z y o u - s B S s i O W x z л a a x eżż a
c. Many factors complicate the implenientatinn of hoarding:
i. Disconnections and reconnections are often unpredictable.
Activity at other clients muøt be accounted for, so that the
latest version of an object iø in the cache at disconnection.
1. What are the various data management iøømeø 7
Since cøche øpaœ iø finite, the availability ofless critical ofjecta Refer Q. 3.1.
may have to be BBcrifieed in favor of more critical objects.
Ø. 2. Oiemxas Łbe zseed o£ æobżže database.
œ It is a trønøitory state through which venuø paaøes in changing Refer Q. 3.3.
roles b•om pseudo-eerver to cache manager.
Q. ß. Write short note on døta replication.
b. Re-integration is performed a volume at a time with all update
Refer Q. 3.4.
activity in the volume suspended until completion.
c. During re-integration, conflicts are detected and, where possible, Q.4. ĄRatdoyoumeæobyoluetering?
automatically resolved. ŒWn ReferØ.38.
Q. 5. Det'ine multicluster architecture.
ø. When the number of eerverø in the clients AVSG(Accessible Volume
Storage Group) drop to zero, bringing in into an emulation state, mmn ReferØ.110.
the behaviour of server for the volume will have to be emulated on QE. jilain C O D A life system ølong wàth ita operations in
the client's machine. 8. disconnected moAe.
b. It meønø that øll file requests will be directly serviced uøinø the Refer Q. 8.12 and Q. 3.15.
locally cached copy of the ο.
e. When a client ia in itø emulation øtøte, it møy
still be able tn contact servers to mønage other volumes.
Venuø statøs ønd tranøitiona are shown in Fig. ß. t6.1.

Hoarding

Logical
reconnection
Disconnected
R e-íategra-
Emulation tion
Physical
reconnection
 MGbíIe A g e n t
c i•ttpu
ø bije agent is a comp Mobżłe C'oæputżag
5
e a b l e t o move frt› m o n e cp m p t t ț p tp
. £

d continue its execution Øn th e destination

İt8 at Advazstageø of' æobt1e agezste :
ppm one gzaobúe age nt is a p ro cess t h a t c ø n tr 1. Tżiey itate high quality, high
W61e
another, wit6 its d at a żzttact, performance, economical mo bile applications.
where o æove. O
y. Idobíle a g eo t p decide u'ben and tbenewteAvir onooeot.
j\fpvement is often evolved from nPC iztethods. a. Oietributed systems oftezi rely on communications protocols that
8
jybøn ø mobiíe agent d ecid es to move, it s a v e s i t s øwn state involve z0uitiple interactions to accomplish a given taøk
9
ture saved state t o t h e n ewh o st and r e s u m e B e xecuti o n front the sgøøą b. This ia especially true when security measures are enabled.
.
c. The result is a lot of network t r i t e .
q IL Mobile agenta øllow packaging a conversation and diapatchizi$ it to
3pft;wøre øgents can be claøaified aa a t a t i c a g e n t s « n d Õb @
a destination hoat where the interactions can tame piece locally, aa
ii. s t a t : • øgents achieve the goal by e x e c u t i n g on a sin gle mø•aizi•.
flgentølz. shown in f•ig. 4.2, 2.
On the other hand. mobile ngents migrate from one e. Mobûe agents are also useful when it comes to reducing the
in the netwoPk and execute on eevezaJ machines. flow of raw data in the networlt,
13. Mobility increases the fiinctionality of the mobile agent and
f. When very large volumes of data are stored at remote hosts,
mobile agent to perform taøkø beyond the scope of static agents,
these data should be proceseed in the locality of the døta rather
Char oteGeties cif m o b i l e agezit : that transferred over the zietwork.
Following are tLe eharacteri8ticø of mobile agent :
L Situatødneøø: tt means that øn agent receives sensopy inpvit from ¡tø
environment and it can perform actioria which c h a n ø e t h e environment Host A HœtB
inaoœeway
Service
Autonomy : It means that am sgent is øbJe tD i£fCT Without the direct
Mobz/e Ageot-Baøed approach
intervention nt‘bumanø for other øgentsl and it has control over i t e » w F@. 4.A¥. Mobile agentø redxicø network loød.
actions ønd internal states. g. The motto is simple : move the computations
His : t can be dafined to include the following properties : to the data ratlner th an the data to the computations.
8• H8aj3onøiv.o It refers to an agent ability to perceive ita environment IN I•atøney : By migrating to the łocstion of the resource, a mobile agent
and reapntid in a timely fashion to changes thag occur zzt ›t. caD interact with the resource muehfaøtsr thøn from across the network
OM &Dd I&IfiB tj2B Initiative where appropriate.
4. Aøjmchronouø taøk execution
Sooźní:
otber Agents a bould
buœao zizbeorder
abletotosolve
interact,
th eirwownproblems 82td with
h e n apprnpriatø, R Fault tolerance
’P with tb6Îr activities. 6. They eoable uaø of portable, low cost personal communications.
d• 4• aøaumption that an agent will not act in ø 7. Peer to peer communication
Rationøyty •
* cranny 8. They permit aecurø intranet style communicatíoriø on public networks.
a* ievźogits goaje. @áBBÓvazttøgøa of' æobčłe agezsts :
dífførent hoata 8Rlfill ita goal. 1. The main drawback of mobile agents is the
security risk involved in uøing mobile øgents.
’“ t e ° v•zzta«e° aod daøad a tag'e of æ0»•
2 Aviruscanbedfi æWasmobUeagentsømd&aübuœdшŒeDehvork
. caching damage to the host mechinee that execute the agent.
 Mobüe Agent Co n r u t Mobile Computing

3. Mobile agent toolø ø2íu men ønd may have security' bugy and s. Dispatch : An agent travels to nexv hoat.

vuinerahilitiee thøt are yet unJrnown. g, Gleaning: A twin agent fø bor» and the current øtate of
the original iø duplicated in the clone.
4. Network teøt øuiteo tend to be relatİvely large. 6lønaging many líøht deactivation : AZi øgent iø bmugÒt back from a p@ ]jj3g{ øjø
wit]q
5. weigbt agents introduced additional communication and coptøp]
Mnłrile agentø are not a mature technology and moøt øgent development itø state to the øource møchżne.
overhead.
loose are alpka or beta vereion.
Dłøpoøøl: An øgent iø terminated ønd itø atøte iø loøt forever.
Bxpłaio tbe æorłcîzsg aa 1žf'eeycfe of' a æobiJe ageztt. C;omtaiunication : Notifies the agent to handle meøøages incoming
from other agents, which is the primary means of inter-agent
correspondence.
1. The mobile agent iø created in the home machine. Diøeusø the vøeiouø mobile øgent øyøtpmø,
2. The mobile agent iø dispatched to the hoøt machine ‘A’ for execution
3. The agent ezecuteø on hoøt machine ‘A’. MobHesgeotsyete-:
4, After execution the agent ia cloned to create two The following øyatemø are the moøt prevalent øyatemø which are currently
copies, one copy iø c a t c h e d to hØßt machine Band the other iø øvøiløble :
diøpøtched to hoøt iøø
g Høøt Agent TCL, a product of Dartmouth Coßege, prnvideø an agent
execution environment that allowß agents implemented in secure
machine language like Safe-TCL and java to trønøport themselves over the
M.A MA network and communicate with local azid remote agentø.
b. The agent TCL øyøtem iø a model of øuppurtingtranaportable sgent.
MA c. The architecture of agent TCL iß based upon the øerver
model which cunaistø of four levels øs shown in Fig. 4.4.1.
Hoot machine A Mobile agentø

M.A ” M.A Interpreter Interpreter Interpreter

M.A MA
Server

O° % TCPflP E-mA
Host machine B
Host machine C
Mobile agent : All the services that øre available within the
system are provided by øgents, transportable or stationary.
B
Thø cloned copiea execute •» their respective hoøta. $n'teryr Lør : The execution of agents is handled by an
. interpreter that ia appropriate to the øource language of the
B Î20ßt ïMachinø B and C send the mobile agentreceived mobile agent.
by them back to the home tjqachine.
.
7. Server : It handlee the management of locøl øgents and
The home møchif2ø interactø With the agents ønd
thø aøents is analyzed. the d a ta brought by izscoming agents. The server alao provides mechanism for
enforcing security, providing ahierørehieal namespace in which
A £Dobile a g e n t experienceø the fo agents cøn be referenced ønd allowing agents to address each
llowing eventa in itø life cycle :
!• C r o a t i a n : A brsnd nøW agent is bom and its other locally.
t«R ia initialized.
 MobûeAgeotCODiputin Mobile Coniputing 141 HT-8) J

iiL
File cahinete : F'ile cabinets are local storage units 8sSociated
p. : Thèse are fiie
wluch agent each o t h e r. Agents move with a place. By this way, agents can ppmmljj jpate with other
agents that are not yet at that place. For example - agents
between aitea in st ate-orie nted faahion by i s s u l n g t h e xu•bility
implementing a divide and conquer algorithm can mark places
gpmmands lik e agsnt_jump. The a g e n t a e x e c u t e i n the already visited by leaving a folder in a file cabinet at that place.
înterprete P8 and os e the ÿgpilities provided by the setv e r t p
th c. 'I'he TACOMA system uses a firewall type mechanism between the
q ¡ g r a t e from machine to machine and to communicat t l
agent execution and the host system to protect the host from malicious
other agents. agent a. In this marmer agents do not need tn be implemented in a safe
2. TACOMA : language.
Connell Moving Agenta) is
wi 4 Discute Une requirenienta for the deBigzi of mobile
b. T COMA syatem ofdefines agent
developed by University Tromosoanand agent based system with
Connell.
The abstraction s of agents, places, briefcases, folders a n d ñ ie C£tbinets.
ù Poldera : Poiders are named objects th at
cpntain a Qt p¿ element in raw data form.
ii. Briefease : Briefcase are containers that 1, There are many tecbnical challenges to Amplement mobile agent systems.
each agent owns Briefcaae contains folders and is need for 2. Most ofthese problems are izi the structure of the oomputational medium,
the environment the agents operate in.
comm unication . Fo2’ ezample - an ageal h i g h t zzieet another 3. S e r v e r s must be designed, implemented, aad deployed t h a t n o t only
agent by p resen tJg that agent with a briefcase. The briefcase in allow mobile agenta to run, but allow them te run safely.

thia example might contain a message for the other agent. a. Portability :
é Mobile agent cnde itself must be portable; when an agent arrives
at a server the server needs to be able to execute that agent.
ii. Most mobile agent sxstems under development now rely, at
least in part on virtual machines to standardize the ezecurion
environment.

i. In order for mobile agenta to be successful they need access to

many different computer resources.
ii. Servers for agents must be at common place; there needs
to be a widely accepted framework for executing mobile
agents deployed on many machines across the internet.
Briefea8e$ c NetworkcoecnuzücaGoo:
i. Mobile agents that live in the net ork need to be writtcn
Mobile Agent, in a language that makea network access simple.
ii. It must be easy to transfer objecta across the network end to
invoke methode of remote objects.

i A major eoncern specific to mobile a g e n t s îa the protection of the

servers running the agents.
ii- Running arbitrary programs on a machine is dangerous, a
hostile prx›gram could destroy the hard drive, ateal data, or do
”g all sorta of other undeairable things.
4.4.2• TACOSA stotnge objectu,
 Mobile Agent Computing

Ofsecurity are p o s s ib le I n Prnteet servera from ii- These denial of service attacks caxi be launched intentionally
by running attack scripts te exploit ayste vulnerabilities, or
glpinctioninä and hostile a g e n t s : physical
8OÖ S O C I O .
unintentionally through programming errora.
1. Physical se•u•*‹y refers tO b ¥l din g server s for agents in
am agents ca 23OOÊharm the server. iii. As a mobile computing paradigm requires 8n ngent platform to
awayt%attbe
s using aocial ££ccept and execute an ag e n t whose code may haut &e
to s r v r s e Co r i t y i
›'v second approach e e
developed outaide ita organisation.
eement mec haHl92OS tp pixnish the creator s of
enfor
p agents. iv. Tbia type of agent may carry malicious code t t W ed
m Agent si P disrupt the services offered by the agent platform, degrade the
performance of the platform, or extract tutor i anos for which it
•
The complement of server security is agent security; whether has no authorization to access.
the agent con bust the aerver on wÏiiChit is executing.
O fätÎo¥l SNCF
ii. A m o b i l e a g e n t migl2t COntf1ÎH e pe t
CS
proprietary dBt8 algorithm*. i. In this, an agent can obtain access to sensitive data y exp1°itin8
security weakness.
i. If economic control BOd incentive are going to be factors in tL Applying the proper acceas control mechanism requires the
netwide reaource, use some mechanism tO account for the platform or ngent to first authenticate a mobile agent's identity
resources that an agent uses and a way for receiving payment for before it is instantiated on the platform.
those resources is neceBsary. iii. An agent that has access to platform and its services without
Wh£kt IB m o b i l e a g e n t 7 seusa the server a r c h i t e c t u r e having the proper authorization can harzn other agents and
&2a tO & ZZkOO platform iteelf.
w i t h t h e h e l p o f diagram. Also, list the seeu ty t
lB R Agent-to-Agent: Agent-to-Agent category represents the eetofthreats
ag e nt aystem. 1 • . in which agents exploit security weakness of other agents or launch
attacks against other agents. This set of threats includes the foMowing:
œ Masqoerade.
Mohile agent : Refer Q. 4.1, Page l35J, Unit-4.
Server architecture : Refer Q. 4.4, Page l39J, Uzrit-4. i. Agent-to-Agent communication can take place directly between
two agents or may require the participation of the underlying
Security threats :
platform rind the agent services it provides.
1. Agezit-to-Platform : The agent-to-platform category represents the
set of threats in which agenta exploit security weakness of an agent In either case, an agent may attempt to disguise its identity in
platform or launch attacks against an agent platform. an effort to deceive the agent with which it is communicating.
Following are the act of threats : For example, an agent may pose as a well-known vendor of
m Masquerading . goods and services, and try to convince another unsuspecting
i. When an unauthorized agent claims the identity of another agent to provide it with credit card numbers, bank account
agent it is said to be masquerading. information and digital cash or other private information.
ii- The masquerading agent may pose as an authorized agent in an fe. DezziaÎ oC
aezwîce
i. : Agents can also launch denial of service attacks against other
effort to gain access to services and resources to which it is
not entitled. ageztts.
iii. The
masquerading agent m ay also pose as a n o t h e r For example, repeatedly sending messages to another agent,
unauthOriZ¡ed agent in an effort to shiff the blame for any
fiCtionsi fOP which it does not want to be held accountable. or spamm ing agents with messages, may place undue burden on the
Ïz. DezzîaÎ o€ sezwîce . message handling routines of the recipient.
i-
In thia, an agent may attempt to consume or corrupt a host AgontS that are being spammed may choose to Stock messages from
resource to preclude other agentn from accessing the host'a
serviœs. unauthorized agents, but even this task requires some
processing by the agent or its communication proxy.
 Mobile Agent Computin$

ftepudîatzozz • Mobile Computing

Re p u d ia tio n occurs when an a g e n t , p a r t i c i p a t i n g i n a äi. Since the platforœ has accesg to the agent'a code, s t a t e aOd
tranaactiOn or commuxñcation, later claims that the transaction
data, the visiting agent must be wary of the fact that it m B J b9
or communication never took place. exposing proprietary al g o r it hm s , t r a d e s ecret s , negotiati on
strategies o r other sensitive information.
Whetber the cause for repudintion is deliberate or accidentel, @ozz
information, the platform may be ahle to îofer æeaoîo
i d e n t i t y s eocf rtethe
repudiation cao lead to verrous disputes that may not be easily the types
iv. Even thoughof services requested
the agent may notand be from the exposing
directly t
agents with which it communicates•
resolved imless the proper couuter measures are in place.
L If he agent
t platform he weak or no control mechanisms in
place, æi agent eau directly interfere with another agent by i. When an agent arrives at an a g e n t platform it is exposin& &
invokiog its public methods (for exemple, attempt buffer code, state æid data to the platform-
overflow, res et to in it i al s t a t e e t c . ) , o r b y a c c e s s i n g and iL Sioce an agent may visit several platforms uiider cartons
R Platform-to-Agent the. agent'a
The platform-to-agent
data or code. category represents the
set of threats in which platform compromise the security of agents. This security domains throughout its.lifetime, mechnniaZ£tBZODBt
set of threats includes the following : be in place to eoeure the integrity of azi agent's code, s t a t e and
œ NBœquerade: iiL A compromised or malicious platform muet be prevented from
modifying an ogent's code, atate or data without being detected-
i. One agent platform can masquerade as another platform in
effort te deceive a mobile agent as to its t r u e destination iv. Modification of agent's code, and t hus t he subsequent
and eorresponding security domain. behaviour of the agent on other platforms, can be detected by
having the original author digitally sign the agent's code.
ii- An agent platform masquerading as trusted third party may
& able to cheat unsuspecting agents to the platform and Otfiemto-Ageznt : The other-to-agent platform category
extract sensitive information from these agents. representethe set of threats, in which external entities, including ogents
and agent platforms, threaten the security of an agent platform. This
The
iii. masquerading platform may f o r m both the visiting agent
set of threats includes the following:
and the platform whose identity it has assumed.
m Maaqoerade :
b. Dexrinl of service .
L Agents can request platform services both remotely and locally.
i. When a n agent ar r ives at æi agent platform, it expeets the iL An agent on a remote platform can masquerade another
platforni to execute the agent's request faithfu lly, provide fair agent and request services and resources for which it is not
authorized.
allocation of resources and abide by the quality of service
agreements. Agenta masquerading as other agents may act in conjunction
A UO p l ä t f o r m however may ignore ag en t service
ejqt with a malicious platform to help deceive another remote
requests, introduce unacceptable delays for critical tasks such platform or they may act alone.
CS àQÎQg m
k e t O r d er s in a etocîi market, simply not exeeute .
tbe agent’s code or even terminate the a g e n t w ith o u t lY. A remote platform can also masquerade as another platform
Notification. and mislead unsuspecting platforms or agents about its true
m identity.
Æavesdropping; ñ Îs• Îzzazzt€tozîzeÔ a c c e a a :
The ea ves‹iropping threat involves
monitoring of aecret communication». the nterception
i L Remote users, processes, and agents may
In and
ea veadropping , agent request resources for which they are not authorized.
coiztniunications, but ® C Remote access to the platform and thR host machine itself
ID D Î t 2’ o e2•y instructio n
executed by thep agent, a l l the unenc
b ingn to the latform, 8Od 811 Ue rypted must be carefully protected, since conventional attack scripts
or public data it
on the platform. subsequent d a t a generated freely available on the internet can be used to subvert the
operating system and directly gain control of all resources.
 Mobile Agent Compute
Mobile Computing 14Y (IT-8) I
¡¡y q p t e administrati on of the platform's attributes
poucy may be desirable for gn administrator that ia responsible 3. Increased use of wireless communications further increases the cMnxs
for s e v e r a l d i s t r i b u t e d platforms, but allowing remote of eaveedmpping and Of compromising tire integrity of information
transferred between sources and destinations.
pd;ti¡ni*tration may make the system ad miniS tFfttOP‘Sa «unt 4. Whil£• it in possible to tap a wired connection also, wireless corrections
are easier tn intercept by using 8imple antennas.
c. Denial of sa the target
or session • of an £ttt8ck.
both s. while the Wi-Fi systems are quite p o p u l a r, many
£ Ag nt platform services can be accessed For example,
e remotely end ofWi-Fi have been well documented.
vulnerabilities
Ioca1ty.
The agent services offered by the platform and inter-platform
sru ted by common denial of service
attacks.
Agent platforms are also suscepiible to all the conventional
tyrequyrementsiomobHee8
denial of 8ervice attacks aimed at the underlying operating security
e°t
gjrStpt¥t or c o m m u n i c a t i o n J3FOtOCOIB. 1. The users of networked computer system have fo u l I2iain
iv. These attacks are tracked by organizations 8uch as the requirtiments : confidentiality, integrity, accountability and av8ilabiLty.
Computer Emergency Response Team (CERTS at the Carnegie The users of agent and mobile agent frameworks also ha'ife these same
MeHon University and the Federal Computer Incident Response security requirements.
Capability (FedCmC). 3 This section provides a brief overview of these securi
ty requirements
Wby aemzxñty cozscezma ?zz txad?¢iooBf ByBteoss aze aizople . and how th ey apply to agent ff8££tBWOF

than those in mobile systems 7 Discuss.

' Any private data stored on a platform or carried by an agent
must remain confidential.
e ii. Agent frameworks must be able to eneure t h a t t h e i r intrit-
and inter-platform communications rema in confidential.
Traditional systems vulnerabilities : about an agen t's
1. A«tire internetia increasingly becoming part of the corporate Eavesdroppers can g a t h e r information
network, the organizations information eyatems have become vulnerable to activities not only frpm the content of the messages exchanged,
actions fi-om outsiders. but also from the message flow fypm one agent to another
2. The architecture of traditional web-based application typically agent or agents.
includes a web client, a server and corporate information systems linked h. Integrity :
to back- end databases. ¡_ The ag e nt platform m j3I•O ROtH from imauthorized
f•t modification of their code, state, and d£itB 8Rd eosure tbaC o ily
3. Each of these components is exposed to security challenges or processes carry Ot2t
authorised agente aux mpdification of
and vulnerabilities due to their cormection to the internet. shared data.
4. For example, a database that has been uaed internally for several yeara i The agent itself cannot prevent a malicious agent platform
but is now connected to the internet. {i-om tampering with its code, state, and d a t a , but the agent can
L
6. This new connection will expoae the database tn a much larger azid tak e measures to detect this tampering.
more varied eet of users (deluding hackers) than ever before.
Wiz•eless aad osobffe syetezae : i. Each proce6s, human user, or agent on a g iv e n platform m e
t
be
1. The security in a mobile code environment cannot rely on
trust relationship between the server and an agent because they are i held accountable for their actions. user, or
In order to be held accountable, each process, hum8H
generally not p a r t of the s a m e adm inistrativ e domain. L agent must b0 uniquely identified , authenticated and
audited.
2. In addition, the problem of protet ; ing the agent and ita results
from malicious and faulty servers ariaes.
 Mobile Agent COmputing Mobile Computing
c. Rely on a trusted third party to timestamp & digit&1
pxarnples of the action8 for whlch t h e y m u a t be held
fingerprint of the result.
accountable include : access to an o ject such as a file, or
making adæinistrstive changes to a platform security ji. Mutual Itinerary recording :
mechanism. 1. One interesting variation of path histories is a general acheme
iv. for allowing an agent's itinerary to be recorded and tracked by
Accountability required maintaining an audit log of security, another cooperating agent and vice-veraa, in a mutually
relevant events that have occurred and listing each event and supportive arrangement.
&. the agent or process responsible for that event.
Availability: 2. When moving betseeen agent platforms, an agent
i The agent platform must be able to ensure the availability of conveys the last platform, current platform and next platform
both data and services to local and remote agents. imfDf•fZlBt1On to the cooperating peer through an
autÏienticated clxannel.
The agent platform must be able to provide controlled
concurrency, support for simultaneous access, deadlock 3. The peer niaintains a record of the ftinerary and takes
management and exclusive aceeas as required. appropriate action when inconsistencieB are noted.
Agent platform muat be able te deteet and recover from 4. Attention is paid en that an agent avoids platform akeady
syatem soRware and hardware failuree. visited by its peer.
iv. While the pTatforzn can provide mozne level off fau)t-tojprgijpp 5. The rationale behind this acheme is founded on the assumption
and fa ult-recovery, agents may be required to assume that only a few agent platforms are malicious and even if an
reapon8ibility for their owxi fault-recovery. agent encounters one, the p]atforzn is not liireiy to cnlJnf›urate
with another malicious platform being visited by the peer.
What are the security measures fpr mobile agents 7 6. Therefore, by dividing up the operations of the application
between twp ageuts, certain malicious behaviour of an
agent platform can be detected.
Security oieaaurea for mobile agent: 1. Execution tracing is a technique for detecting unauthorized
niodifieatioris of an agent through the faithful recording of the
The followirig available technologies and research efforts addressea the agent's behaviour during its execution on each agent platform.
security isauee arising from the mobility pyp rty of mobile agente
Z. The technique requires each platform involved to create and
P1r. p t e e t i c g ugezits : r e t a i n a n o n - repudistabl e log or tr a c e of the operations
a- e an
This is due to the fact that an agent Îs Completely susceptibl to performed by the agent while executing on the platform to
agi-•nt platform and C8anot present malicious behaviour from eubmit a cryptographic hash of the trace upon conclusion as a
b. trace Summary or fingerprint.
Some more general purpose techniqjjeg J'qp p•otecting an agent
include the follpy@g • 3. A trace is composed of a sequence of statements identiDers
and platform signature information.
i. •u t eneapsulation :
1. 4. The Bignature of the platform is needed only for those
Jflcapsulation may be dont• fOF different p urposea with inatructiona that depend on interactions with the computational
different raechanioms, such as P° ding confidentialit envirorunent maintained by the platforxti for instructions that
encryption or for lntegrity £tndg•••Untability rely only on the value of interval variables, a signature ie not
using digital
required and therefore, is omitted.
2 Protecting the agent platform :
In general , there are three alternativ e waya
partial results : to eIj pppsula t e a. One of the main concerns with an agent system implementation is
8• PFovide the ensuring that agents are not able to interfere with one another or
infoFmation. with the underlying agent platform.
b. Rely 9n the b. One common approach for accomplishing this ia to establish separate
platforwi. isolated domains for each agent rind the platform, and control all
 MobUe
MobfeComputmg 161(IT-8)J
. ot Cottiputing

t Security threat ® mc*bile

In traditional terrors, thiB concept iB re fe r re d tn as a reference
L Communication :
1 9£icurity system is a ayate» to d •lferid our asseta from
j, Jtdevised
Techniquea g method ofisolating
for prote 0ting the application includeintn
modules
agent platfnrm thedistinct attaehe or threats. z, attacks are carried out at the point
fault domains enforced by software.
ofvulnerability.
be technique allows untrusted programs written in an
unsafe language, such as C, to be executed safely withiit 4.
y Wliszi the vulnerabilJtyia expJo ted for sozne internet
the single virtual addresB space of an application. 6, or aelfiah motive, it is an attack on the syatem.
3. Untrua£ed machine interpretabJe cpde or oduleo Where the vulnerability is exploited, there i8 a loss.
are transformed ao that all memory accesses are This loas can be either of atatic information anset Istatic aaset) or an
confined to code and data segments within their fault information aaset in tranait (dynamic aeaet).
domain. i. An unauthorized party gaining accesa to an aaset wiB be a part
4. Accesa to system resourees can also be controlled through 6. Attacke on dynamic assets can be of the foHowing types :
ofthis attack.
a unique identifier associated with each domain.
iL 5. The teclmique
Signed eoAe : is commonly referred to as sandboxlng. of filea or Mapping a oonversation between parties.
1. A fundamental tschnique for prntecting an agent system ilL 8nme of the anitDng attacks fall in
is siguing code or other objects with a digital signature. R thiß category.
ModiHcation :
2. A digital a atzzz”e sez°ves zfa a meaos p/conJirza?zzg the ñ An unauthorized party gaining control of an asset and
autheoticity otwa object, ita origio, aztd ita Iotegr?ty. tampering with it is part of this attack.
3. Typicallythe code Eigner is either the creator of the agent, iL Thia ia an attack on integrity like changing the content of a
the user of the agent, or anme entity that haa reviewed message being transmitted through the network
the agent. iii Different types of man-in-the-middle attaeke are the part of
4. Because an agent operates on behatf of an end-user or
organization, mobile agent systems commonly use the
signature of the user an indication of the authority ñ An authorized party inserts counterfeited objects into the
uoder wkich the agezztaaoperates.
system, for example, impersonating *omeone nd
epurious meaaage in a network.
. D gpQygggÄ OfPFOO#°‹avying code obligates the code
pcm4urers(forermope,authorofso a g e n t ) t u fnrj•ttg}}y prove é An ausat ia destroyed er made unueable.
t h a t t h e progr ani possesses s a f e t y properties previously ii. Thia i« an att«ck on av•il•hility.
stipulated by the code consumer ffor example, This aHack can je on a °tatic a^•et °° ^ dy "*nic "
Z. aeeurity policy of the agent platform). iv. An example could bo cutt ng a,QsxnurücaÖODUgeOrsmAiog
lt is a prevention techniqtjj=, while the code togat1ier, ty pppter pp buoy that a uaer cenj2Dt l2gB a aerver in a network.
prevent
authenticity and the ezecqtion
identific ation of i2Haafe
techniqu £•gcode. 7. Attack on atatic aasete •an be ° *>• r°ii° type'
EKpf&in the "”"'”^" aee’z"ity * * 8ta dzt izsg data
B] * 9Uit8bleex np}e fi TkeBe are a ¢ype o azo t]aat replieates aad Propagates ftozo
one ayotom t0 8nDtb8f
of •
destructive fuzictions in the system.
ü Moat of the virue
do < °'°
 Mobile Agent €iomput
Mobüe Computing

je ottack» on the aystem tu prevent legitimäR lteers frpjj-t

using the service -t36
D-
ifiptiter systezttg &RPs
Theae
ttttd aref opeople •• ftpf};ware,
r m fïinctioos
which enter iiito
without the knowledge of owner of the
IM DS
zu Tbeae axe aJao ca}led NTRAFDDflWCDMA
kackeI'B.

trying to analyse the content. 1595

•Im000 IMTÖAC
IL AU a @Œr Öœe È@a aaœB M ua În The a a œ e aæpÆDce M ÎœpææQzmgQ edma On cdms200 1KEVDO
æn eveot amü &ifin uoauŒojdzed acœga w yægotume. IXEV-DO

é In a buffer overflow attack, the vulnerability of an executable

program ta exploited tO fu rc e B a t a n k OVe2•f1OW c o n d i t i o n , ineIu‹jjj g
the program pq @p of the process to change, which fufther work
for attacker. Deeo¥'1be f'ault to1ez'azsce 1ts æobile coæpsstîxtg

1. ÏÙ-64 and IS-136 OR

2‘$ gecond
J•- a• digital AMPa (D- generation (2tà) mobile phone Systems, De8 be :EazztC tofetæooe iaeuee tovolve 1a æobî1e eoæpts WbaC
). once prevalent throughoutthe
erica,
>>• nd C•nada in the 19808.
- is considered end-of-lire
1. Tone ability of mohile agezi£r to reart dynamically to
C D M A 2000 technologies. unfavourable situations and eventa, maka it eaaier to build robuat and
4. •p ig p p
8tofteil referred to ag fault tolerant distributed syetema.
•p O
(Time Division Multiple 2. For example, if a hoat is bed Shut down, all agents executing
Aoceas). on that machine are warned, whenever poaaible and given time to
uae exiating AMpq e
b. D-
between di °* smooth transition dispatch and continue their nperatiooe on another boat in the network.
and £tl2alog gygmms In the
aame area. 9. The ability of the mohile agetite to move from one platform to another in
8.
over the a intern ne«ua eiiviron next b•• been made posaibla by the use of
30 KHz c design by dividing
pj Pair mtOprecediog
th4•ee time
voice datg, three timae the virtual machine and interpreters.
yip} eompres aing the 4. Virtual machines and interpreters, however, can offer only limited
7. A digital pytJ ngls call. support for preservation and reBumption of the execution s t a t s in
could not aeceaa digital
Æ€t ègràBÏOg B c a n n e r s
Z%
heterogeñcou» environmenta because of diflèring representations in
6. the underlyin g hardware.
For example, although a number of research efforts are underway to
ug g t jp¡grue, the full execution state ofan object cannot currently
be retrieved in java.
 M o b i l e A g e n t £jOO¥9UtiHg jyfobfie Cozaputiog 165 fET'-BJ a

6 u» s»<h es the statua ofthe progf n counter a n d f r a m e otack iii. TheBe agents mpjjjtor the aodgatber
°' of ezchanging mesaagea.
. is currently offlijjfjts for java p r ° &
7. t mobile agents poase9s • the friture of the home plofforzn or b MmoagerAgeo* ,
wellio disoonnected that °P°* °
the ®agents rely OU £t ° * f research projecta, £ ThïBremdeaattAel g ç¡ç e;and controle the agents during
° university of West Fl orida ar8 u8ing modified ÎÊ {t OBD LOf2’C'•late different lneaJ e v e n t s from v¿tpip monitppgd
auch as NDfDads at the
Java v irtu a l J p c h i n e s t o capture tïze fï aœe stack, to provide Becurity hoeta in time.
s £ i ry} C e s tha t pgj3 ge ptisly teduce m Alert Agent tAL4d :
Even a mobile agent can becoxne more fault tolerant
thoughmachine, by moving
to another the mobile agent's reliance on the safe operation of i. It in made up ofmany blocks like time stamps that include
g q ti p p e or t e d platforin places restrictio ns o n it g the alert message creation time, threshold event detection
q fuZiC,t*OOR1ig3f.
joe ers of mobile agent platforms are time, aJert case of aDy faizit and alarm infprziiation es
8lsofaœd with trade-off between Security and fault toler8oCe. TPell.
l0. For example, in order to addreau the security risks involved in “multi- ii. But this works under the MaM.
hop” agent mobility, come agezit arehitectureB have been built on
centralized client-serx er models requiring agenta to return to a central
aerver before mqving on to another host machine.
11. Clearly, addressing the security riakg in this manner renders all the
mobile agents vulnerable to a failure of the central server aDd raises
• A mobile transaction is a distributed transaction where aome
parta of the computation are executed on mobile hoat and some
1. A prediction mechanism ie built to identify critical 1 pama on non-mobile hosts.
host agents so aa to prevent failure. • Transaction proceaoingie information proceaaing tnat in divided
Therefore, updatizig of information in the system can be done in a
2 intn individual and invisible operations called transaction.
constatent fashion.
3 H°",dâsmedmofiæioNudest6eweigRMgMsWaCooie{bewéghn
. Of&oataœecooMdered.
4. The mobile agents which aet au monitoring agenta detect the unexpected
situations and then help in recovery.
5. Further the host dependence calculation ta proposed by the use of an
W Qto1 to Update weigbtB.
I Ot
2’WDPff$ critically oflioet8 in mobile system is heJng tgJpttJgtgd
7
. the boat agents are mo tored dyttamically which will result in
improvement of reaponae of 8ystem. Œ¥£BBCttOEt :
8.
Hence, proposedmonitoring mechanism bas the 1. The transaction is a mod8eling ° ' ¡ ° ° that &°uf'a 'u tiPle datsbsse
follOwing eomponente : accessea es an atomic unit fpr the purpose ofrecovezy, concurre»cyamd
i. In the whole modul
é of m»tYitOfîDg, thèse are at the lower const tency.
level i.e., they reaide
x Tbesa service 2.
A mobile transaction ia a distributed tr8n Bction where some parta of
o/dog Cables oats keep a record of i n f •=n tJOO in the form the computation are executed on mobile host rind some parts on non-
mobile hosto.
 Mob*øAgeDtC° P
etezs•y øn tiiem.
records when multiple
L Rapid-spoose:
' uøerØ°° procesmMM pgøjpple, database on different
gg-tø aocees af dißtríbuted ¡ø cølled a t r ø n • 8 f t i O O fOF
4 tnbuted
9rithin distributed traDB8ØtİOO b. B ażaeaa c a ø n o t • ï ' f • • d t o h ave euøto ierø w r i t i n g f o r a T P S
. the
’nate via “ eco oomüt protoCo1ł2PC)* (Tranßaction Proceaøing Syatøjjjj ø ppppond, the turnaround time
t Ą K
g’ oŒez's the poBBtbilżty zô tÏse pzoductîozt for tbe output
s. gprocesB
Reżźabžżity :
OODØpOÌt € state ofs øpxnputing deviceB g ț t g @ LIB Ț8Ț¥ÈO@B,
6. At Present, œ Many organizationB rely heavily on their TPS; a breakdown will
’tøJ øøsietant (PDA) øre available. ® Tyre powerÏ'uI. disrupt operations or even øtop the buaineøB.
7. mobile oevàces b. For a TPS to be effective, itø failure rate muøt bø very low.
e-
gspeedgodlODgeF#peratî g *› c. Y8'IP9doesf
f o r work proceBBíag
9. ypbile coØiptltina devi
®
theAquirkœmdemcsrat,ereooverymuetbe
tivity.
eqjjipments in every die <
of the g. I n f l e x i b i le.
ity:
10. Combinìog œ i t b tbe ezpa o Ą.speednetworkGke tbe
d.
a. Thia A T PmakeB wellevery
S wants designed backup and
transaction to recovery pppeeÕureØ
be processed eøgentiaL
izi the same way
in tern et, æoJaûe
regardlesB of the u s e r, t h e cuatoa ier or the t i m e f o r day.
b. If a TPS were flexible, there would be too many opportunities for
proceøsin łİtfŁt is ttivided into non-standard operations,
1. Transaction processin8 i» :•r orniation
y d j y d ø ø ț ønd mvisible øpoFźttions cølled transacti°-
s. Trønsaction processing iø deBigned tnœ taindetabaeeshoal° a. Tbe processżag ża aPPE æuet aupgozt aa ozgaożzaÒazt’a operatżoœ-
consistent state, by ensuring tha t any operatioo carried out on the b. For example, iføn organization allocates rxiles and responsibilities,
, all øpmpleted successfully
d£ftybøg£p'• t ei tttøpdependent and either
th ey muøt be able tø procesB and accomplish it.
or all caocelÏed successfully.
m u l t i p l e individual operations o n a Øtż Deacz•i6e Isoæ tz•aoeactśozs pzxzceøeîog oazs be doxse la
automatically aø a single, individual

4. The tran saction processing system enøurøs that either ølloperations in

a tran saction are completed xeithnut err r, or none of t h e m are. ’š'ż'aasaaotioxs p zoo eaažo g 1zt æ o b i l e coœputżog:
5. If some of the operations are completed but errors occur when the 1. A æo bú e traoøøctżoo iB defined as a transactiozt submitted ó o æ a
ottiøra are øŁtempted, the transaction prOCRBB øxatem"rolls back" øll æobîte boet.
of the operations of the trønøaction, thereby erasing all traces of the The mobile most, which issuøa transaction an d the æobile host, which
trønøaction and restoring the database to the consistent, known statø receives the result, c a n b e different.
that it waø in before processing of the transaction began. y A transaction in mobile envirozunent ia different thøn the transactions
6. If all operatiORB Of & tr8fŁB&Ction are completed successfully, the in the centralized or distributed database performed in the following
transaction iø “committed" by the øystem and all chøngee to the datahaøe w8yB :
øre made pørmønent; the tzønøøntion cannot be rolled bøck once this ia
a. T h e mobile transaction might have to øplżt their computations into
donø.
øetø of operations, øome of which execute on a mobile host while
7. ïf the computer system crashes o th ers execute ozt Bt8tiooary Tzoat.
in the middle of a transaction the
b. A mobile transaction ahareø itø øtateø ønd partial results with other
trønøaction prnceaaing system guaxanteea t h a t a l l operations in any
traneøction due to diøcpnneetion ønd mobility.
uncommitted transaction are cancelled.
e. The mobile transactions require computations ønd mmu**icøt °°ø
to bø supported by Bt8tiozzszy Jzost-
 Mobile Agent Com UtiHg Mobile Computing 1B0 (ET'•8j
one cell to W8 ther, the state of h. Second
œobûe hQgt uipve from and the location i : In the
objects, phaøe it t
tran ø ac t f o D s t a t e of aceeøøed dät£t
g ç t aløo move. results
tİ n due to mobility the other n perz anent; or rollhøøJt'
Changes) °to transactio d ø)]
e. long-lived trønsac* the receipt. partners, ^ M subsequently confirm
The m0bile , the frequent dißCOllØectionø. for the communication
of beta the d ata ønd users due to p øjyd J andle c oncurrency, indütńbutedøyøą
ølPPconsistency of replicated
O
f. data
The mobile transBßtLOO shoul ønd mutu
re co very, di ø¢onnectiori

OR
4 PJjøøtød t øn the conventional tranaat:tion Dżacuea tbe aebeæeB
Mnbile transac£iOEtİS m8 <° OF æobżłe tzaoøømtø• œaoag¥•æezzt.
states. OR
. in both tlïe design and execution
5. When mobile host moves from one t2
ø jj t ø ø n o t h e r cell, m a n y computirig
activities like e8tablish ing new epmmunicatio n channel, forwarding the vazžotse æobżłe traoaactiozs æoğeja. OU U
atøte of transaction to new mobile support station are involved.
but aløo ï e
6. The execution of mobile tran8BCtİon in not only u
Øj3redictable
location dependent. Oolžae tmmaactioo pzX¥eagaíng ;
Coordinator Participant
1. Online
Can_‹ximmit ? transaction proces•ina, •r OLTP, refers tc a class ofsystenis that
facilitate and manage trønøac tion-oriented applicøtip
Phaøe 1 : , typically for data
en try a n d retrieval tra nsaction prnceøsing.
Voting
in ease of 2
OLTP has also been used to refer to processing in which the syøtem
failure .
Ante responds immediately to user requests. An automatic teller machine
datato Rollback
øJ1 votes = DO_C t per- fATM) for bank is an example of a commercial transaction prnceesing
œœment 3. O n l i n e t r a n s a c t i n n processing increasingly requires support for
yes 0 t r a n s a c t i o n s that spøn a network and may include more than one
storage

4. For this reason, new OLTP software uses elient/øerver processing and
Phase 2 : brokering software that allows trønsactiooe to run on different computer

e
Ha_v
commited completion platforms in a network.
a8 participants sent 5 In large applications, efficient OLTP may depend on sophisticated
Have_eømmitted . transaction management software (such as CICS) ønd/or database
forget transaction optimization tactics to facilitate the proceeøing of lørge numbers nf
concurrent updates to an OLTP-oriented database.
6. For even more demanding decentralized database systems, OLTP
7. Some of the techniques developed in conventional transaction such as brokering programs can distribute transaction proceseing among
two phasø eømmit ‹SPC) protocol, are a1eo apply in mobile multiple computers on a network.
transaction. OLTP iø often integrated into OA serVice-Oriented arcÒitectl 'e fund
8. For committing the result in a distributed transaction, the peerø web services.
involved in a trønøaction usually communicate via the 2PC protocol.
8. Because there is a need for tranßøctions you wit{need online prœessing.
æ i. •žrøt pbaBe : ofa trønsøction takes the role o íth e coordinator,
The initiator 9. Online trønøaction processing has two key benefits: simplicity and
wlxích in the firat phaøe collects the votee about the røøult of ef'ficiency.
transaction from different partners. 10 Reduced pøpef trøilø and the føster,
. and expenßea are both examples of how OU makes things simpler for
businesses.
 COmQlnt y p b i l e ØeœpuGog 181
M•bile s e n t
iv. and are
Upon loca]ofa
initiation to a bdØe station.
r a stable orgøjqiZãtion because a JT for its eaecution.
DHä, base øtøtion
11. creates
of the timely uW* ' v.
of a l l o t øppøumer the choice of
ø A KT, when initiate by a MU (mobile unitl, the initial BS dbase
uch pior t • e n t r y tcmøke station) immediately created a JT with a unique identity and
become responsible for ita execution.
broadens the consumer baøe
Bfiother cell, the BS of this cell
1S. & ’ent because and it’B HVøiløble
takes control of the execution pt thiø tranøøetiøq
vii. Wheii a MU encounterø
thuø the mobility of ét MU is captured by splitting ø Ky.

1, ,q qøbije trønaaction is a iüøtributed trønøaetion where some partø of O ż e c u e e tbe g c b e æ e a of'æob{ł e trø øøøtjqg øtø ø g ą m Egt,
g øjjt,ød 022 mobile host and øonte pørtø on non-
the computation are £• e
Mobile
hoøtø. medium and the mobilit2f If d a ta consumers ønd
Tt›.. uøe of wireleøa
producerø øjȚøøt trønøøction proce8ain8 * ° ^ ® ways.
that af'Feet jj;øøqøø various issues whieh øre related to tZ’øØ8£t On QrØ4•
Location ønd time of fØobile hoøt øre the two major facto••
mobile transaction processing. BBÎDØ
aø follows :
Two mobile trønøaetion modelø are available ;p mobile computing. UPTU s011-l2, s0l2•i3, Markø lo
é The execution model is mainly for Processing aggregate data Mobile twanøftction Bchemes : Refer Q. 4.14, Page l5Rl, Unit-4.
stored in a dftta warehouse which resides in mobile units.
ä. Is ø ue s o f transaction procesBiog izi mobile computing ezivironment:
Since the data warehouse resides in mobile urits, HiCoMo 1. Mobile environments can be considered to be øiœüar tø
trønsactipns are alwayø initiated on mobile unit where they hig envirofijnents in many respects.
are processed in a disconnected model. 2. But unlike in distributed environments, locations ofsome hoste are not
iiL Aø a result transaction commitments are quite fast. permanent in mobile environments.
iv. The baße database resides on the fixed network. This along with the low communication bandwidth, frequent
disconnections ønd high vulnerability throws up manjr challenges to
v. The structure of HiCo Mo transaction is based on nested reBearchera.
transaction model.
ø. D a t ø consistency ancl concurrency control :
vi. It ia manipulated by transaction called base or source
tranøactiona. é In mobile environments, data could be replicated on a number
vií. To install updates These transactions
of HiCoMo initiated
transaction at must
they the feed
be nf servers throughout the network.
network. to source transactions.
coriverted
vüi. This conversion is done by a transaction transformation Some of t h e y servers could be MUe. Moreover, a MH might
function. operate on cached data while being diemnnected from the
k Kangaroo mobile trønaaetion model : fixed network.
The data oorif1icts arising in mobile environments could partly
i. It captured bøth data and the movement of mobile unit. be due to the locality of the users acceaeing the data.
iv.
ii. The modøl baøed on a øplit tranßäCtion and enforces the ACID The execution of a mobile transani8 øøJd aløo be distributed
properties.
iíL A global or parent Kangaroo tranaacGon,K' and relocated among fixed hosts 8Ød the mobile nodes.
ígcomposedofa
number of øubtransactions. Each øubtrans» ti» is «i»iiiar to
»r «æ ønd Thenoodeters:únistíc lifetime of a mobile transaction ønd the
an ACID transaction, which İS composed of • at
ønøaction (âT) low bandwidth »f»•mmunieation links arø other factors that affèct
writes. These subtransaetiona are called JØpy concurreficy HtttFol ønd ca•æ =øfjagement.
 Mobile Agent Comp
mobile Cor iputing

izoportaat tÏzat jt b. In mobile networks, however, • **°8e >^ °ceurs more frequently.
-” i • pJoypÖ îa tbe reaj
. Foxsmymo#° t. For exemple, if the sender 8 fflceiver n›oves out of scope, if the
reseaz'ch Î8 8 • d
moved from the channel suffers from ¡£iterference, if Ob8tacles hamper the
transmissiOn,
battery drains suddenly
in place, it duringznessgge
in plaœ.
required for h• ving a mobile to t he movezuept O f partigipant8 occurs
Netwo rk partitlofiiDg due
Th e e e respurces
in mobile environment more fpeqjjejqtly t}iajq in fzxed -wired
eeositive servic e access t o mechanisms for optimized q
netwoFks, in which this ement i9 Very sg{dp .
zaazsageœeot id t p n t rolled query release mechanisms. ;g, Me ssa g e reception model:
a. fn mobile adhoc networks, a dge that is sent is not pnly
,ommunication by the destined recipient. received
'' b. Each participant that ie cloae to the sender can hear the message.
is one of the maj#,
E1'ficient u t i l i • • t j • n of b an d wid t h iS thus an important facbtt c. When a routing strategy ie uaed, participants those are
‹»t evaluating
on • i n o inmobile environments.
a tFaFiS£tfltfOO model• located close to the path that the message takes will get the
# y message.
DevicecootnM*b1uty:
awo»œecbœüamœoduserPrnf#ea•
i Mobile agents are promesses or set of promesses th at perfprtt a, Distributed databaaeg in fiaed-wired networks are usually used for
an aetivity on the fïxed network on behalf of the MU. performance and availability reasons.
ü. T h è s e a ge nts will typiC8lljf bU ÎfBOS8CtiOO DfÉiEÎ ät a C C J
b. Thus, there is often a single database owner that eontrols atl of rte
several databasea and report some results to the mobile not,
databascs.
iiL Relocation of transaction execution or mobile agents c. In mobile networks, however, eaeh user nwns and controls
ii necessary to improve reaponae t i m e s i n mobile environments
only a single device.
iv. Performance can atiII be improved if the user profiles or user
directives can be used to effect anticipatory relocation or b In case of wireless network, we cannot guarantee that alt individual
avoid unnecessary relocations usera cooperate and do not move away, since there is no central
inaranee that controls the devices.
e ScMxbJ•ty:
i. As mohile computinggrnwa to be more affordable and popii]af, Compensation applieability :
the numher of MUs handled by every base station could te a. Tr an sact io n processing models th at apply the
large. concept of compensation, explicitly allow databases to run intn
ü Hence, it is very important that a mobile a possibly iztconsistent etate that ie compensated later.
transaction model scale up effîciently. b. However, the models using compensation assume that
databases are somehow connected to a single site th at
e D i a o u a s tbe c b a t l o a g e s i l s t r a o a a c t i o o p ro ressing . controls the compensation.
W tab azw the ooaatez"zaeaBaz:t'es to seozu• ty tfzz•eat la coznputîog c. T h u s , participants having inconsistent states wilt not per-ticipate in
e nv i ro n me n t 7 proceeding transactions with different participants as Jongas their
inconsistent states have not been compensated.
C a p a b i l i t i e s : The mobile devices had limjted pspab'ilities litre memory,
processing, and storage constraints.
CAæHeo8eaiotrxosaclfooproceswing:
I n p u t mechanisoifa) :
l. Eohæg€e#Ésüuremode1: built-
a. Compared to flxed-wïr ed networks, mobile environments suf a. The moat sommon input mechanisms for mobile devices are
in keypads, pens d tpiich screen interfaces.
from a variety £'s : Message loss occurs in fixed wif b.
netivorksdue 88 f8iltl
° P ob ° libe buffer over-flows or data pack Usually, PDAe contain software keyboard s, some PDAs may also
support +zteroaJ ïreyboards-
t°F
164 LIT-8) I Mobile Agent Coippqt
Network stack
M e a s u r e s to s e c u r i t y t h r e a t s i n c o m p u t i n g e n v i r °nment ; ¿
. 4.‹I, Page 142J, Unit-4. ”

VERYIMPORTANTQUESTIONS

What do you understand by mobile agent †

Refer Q. 4.1.

Explain the working and lifecycle of mobile

agent.
Refer Q. 4.3.

State the security threats to mobile agent.

Refer Q. 4.6.

Q . 4 . What are security r e q u i r e m e n t s a n d

m e a s u r e s fo r mobile
agent system 7
Refer Q. 4.8 and Q. 4.9.

Discuss the various mobile transaetion

Q. 6. models.
* CtnBS ¥ 8 Z ' I O IS issues related to t r a n s a c t i o n processing.
Refer
Refer Q.
Q. 4.15.
4.14.
 ggdes
Deetlnatias 3equenced.

(joos^cuti•e M " >8 *ith a Sive• mmeage mm take

diiTerent
• ,tu »+iwork i« a peer-to•peer wireleas networ£ tttpt r‹yu M to deaŁioetion.
t p $pQyj{;g /py computpr tO cOmput4•r’ With0ut £d2e usye Of gd2i neLWork hab limited coojputationa] powet
controt base station. y¡¡¡ pestricted rango and lack of i•fr•structure together indicgte tbe np
• Mapet ¡s a sef£-con;figziratjon wireless adhoe netwoIiofmob1e fqr g iritdtihop *AVting.

• DSD s9proacdyedistgnrevedorreuCingpmMo 4.

I•one ń.oa•eer‘¥3rpe und Mediuo+ 4aen'er 'I'ype ęueacj pt ” ^

B Deam ibe tbe c1eeai€teatioo o€ wźcefess adbo•s

ttetw'oz'k.

Po!Jowing az'e chu tłrree tjrpes o/wźz’e7eas adhnc aete'ot1

’ " '°°"*'# 'n#'°s'ruttu'e baaed » , * + /

° A hŁfiJ"lET ix an a ul ono uious colleeł ion of mo bite users tim

Al' ° •w'ai°tenance
d e • of these a oftwork
routers&i aw as *outers and take p« •t jn óiscovecy fi
8
AdhQc networks are b. II ii o su\7 configurźng network of’ mobite deńces ronnected by
wimless Jinks.
kl inhospitable tematu. e. Each device in a MAiVET ia free to move independently in °ny
" ‘ ° “ ‘ . " net^'°*‘°m*^**8Be't her łn itolatiou direct ion and u'ill Lherefore change its links to other evi*es

””no*°”’ *#'°*y°nem#Gn tsince Łhe nodca ore n\obi}e, £he netsvor1

copo
node aerves as o route ondnetworft.
ii tthe fprwards pacitets e Thenetworkisdecen€roJf*ed.*6mn °5 m°'w"'L °"" ¥ °'° B
. AiwsverngChe *Odd#ve""a* ® '*°"°*'*e'ecoted
b,1he,odstbcm,eve, w..'°"G"s*"""'"°*'*""'#
oo retedtotomobJtnodcs
" * ' " ° " ‘° '
u e
' "* ^ "" eeeded.
 AdhOU Netwqtp
Mobile Cotitputing

o. A WMN ia a s
coonecbvi
communication network orgonised
in a irieah topo]ogy. acazeft
B£ Code
b. WMN ofien tonsist of neah clients, D
me8h roiatere and gqtegp$g F
devises while aieah routers forward traffit j;q gd q9p the gapp
c. may eorinett
whithiriesh
The to the
clients are internet.
often laptops, tell Bea80y 8 de **’!'PoiutreÏay
phone gltd tbej.
Rooter R, -• _
e. A wireless mesh network oflen h8s a more p l u s
and may be deployed to provide dynami9 ^^4 coet effective
conrieetivity over a certain geographic area. Hand-helfi ^ e station
ri ode OTgg{,y,gç -----
f. Mesh networks may involve either fixed or mobilt• de p,t9¢, '' àtobiie node
p portant possible application for wireles2
mfl8h uetworlu ii Baae station Pouter
h. By using a quality of service echeme, the B
^•eh may support
]ocal telephone calls to be routed through
wirele8a
R aieeh.Sensor Network (W8N) :
Wireless
a. WSN conaiata of spatially distributed autonomous ¢en#pr Description :
tq cooperatively monitor physical moti0n or conditions 1.
such
i. ae, temperature of wireless sector network was motivated by D,E,FædO
Tag.5.fl.ldeœo
military applications auch as battle field swveillante and 2, It showa that each mobile device or sensor functi0Q8 aS a •ode with a
art, switch or rooter.
ü. now uaed in many in3ostrial and civi]ian application 3. i port nt characteristic of adhoc network srtbitecture is that its
1. industrial process trionitoring and control, machine areas, org8ni8ation can change due to moveelent of a device or sensor.
4. In other words, the adhoc networks ate self-organizing.
2. health monitoring environment and habitat
monitoring 5, The folloeririg points illustrate how MâETa are established and
how the *e
3. health care application aetheReetvta
a. The network organisation wili change if D and Eeieve away
4. house automation and from eathother aich that they reath out of the °!
5. tramc control. b. ! *
Que fi&. JWhat dO you under8tand by Pfobile Adhoe Two neie adhoc networlts will then be form°8 W !i) A, C a°d . *
j letworhs
'}') 2 Depcribe gpyg gj @ egjnariQg wh9r'f• Et 0Bfn be @ j, p• jed E. The devises on te'o networks W 2 @ t tO B&b
V8ed•
Real lite zother
cenej•i0•
through thé COmmOn O0de A
i Comider ¢ bluetooth-en8bled mobile devite, a blt1etootb•enabled
, œnnettionat Rome.
computer, and @@JBt W’ith 9'
2, There i6 8 blUfltooih-ennbled col£iputerconn9n!"
i.
MANE'f i• a seF configuration wireleS9adhoc network ofmobile node? »rl aso to c›*ent prï•te'Bt° '°
home
2. 3 When thg user e ^g tire and
3. The node has
Each union a router or atsswitch
of connections connefttdIQJlogy.
in an arbitl’8J by the wireless . handbeld PD mobile devis oæe aa adhoc
the
4. connecti•8in function indepondently or connect to internet IPV4 0! network
Networlt c
 C h o c NetworL¢

b.
Table Driv+n
reflect these changes, Hybñd

DSDV GFRP AODV BIGRP ERP

I I
HsR CGSR
smt#B
*
PDAS and the increasing of
2. w
e rapid advertta oF tDobile telephony.
adhoe networks.

g ppt qg the gpplieatiW "

i g Qty p table veo rnutlsg p otonl, each node
b£obile adh c network i i¡. mginta¡tts opt nt
'iore table °°^ * i^f°rroation to
Bicester Ttelief every other node in the network
b.
i¡i. Home Networking Ajl nodea update their tables en o to maintain a coruistent and
is-. Conferencing up- to-data vie * of the network.
v Habitat When the networJc topolo changes, the oode pzopagace ugdste
Monitoring zeesrage tbzougbout the network fa order ro raaJotato consistent and
tip•to-date venting information shout ttie wjio1e netu'ork.
Warebouap
Inventory T'lse adhoe protocols, If At fofloezs the proactive routing protocol ar•
MortitofiR8 é Destination Sequence Distance Vw€n r Routing Protocol
(DGDV)
vii. Personal Area
Network wireie»s Routing proi°•oi iWePi
ciob»i st i4 Routing icG.Ri
ftp' viii.Ships
In adhe need to
networks, dOnOt hose a priori krit'e'1edge of topology Of iv. Fiehere fitate Routing t PSRi
net orhmunieate
around with
thent, they have to discover it.
••m Hiezorciiical State 8uuiins tHfiR)
3'he basic idea ie that a new zu>te togtioost\y\ ntee itB pzeaeoee
aad e£gjh pth to
Iist4n8 i'. bPo8dea8t 8onOuo€eE0entg how itB neTghb0Ur8. zone.be ed Hierafchic i ci e state seuii°i
The noda leazaa abo+zt new near nodea azut s‹syo to zeaeh t6ezzz, ao6
rod annouoee that it eaa a!ao res¢lz tfioae nodes.
As time goea Sri. each node knewa about all othee nodes end eye or

are not maintained at even ne'de. instead the end W °*

6. These routing protocols can be divided into three 9gtegpt,¢a by
p¢ W¥ en anñ You' the routea are
diernvered : Whes a eource w•nte to head to a deat*^ation. I Evo e* I*" ro"te
a- Pre-active routing or tabie driven protocols diaeovezy mechanisms {,o tbe path to the aeetioatzo-

- e Hrbrid lPro•aetive/Yeaet¡ve)
 Adfioc Netu/otg

p route rcm *g;d Bill the destination jg reanbab e or

until Q

p jjjpt¢ pt pgyg on-demend fO0tiflg

9f0tocols as di6tussed be}p¢ . i a « O -
sLration.
demanfi ^ g5 /@t0E Adding (AODV)
pju ter Bg ed g„qttng Protocol (CBltPJ
¡¡¡ p„ „ qurce goui¡ng Protocol fDsit)
iv, Tensporaliy 0idef6d R4tltñlg ›°!°°°! § MOb3itvMO ssdh0CneCw0,# g

v. As,o<i,t:vity a se4 Rout*•e fA *II there are multiple wireless gem q

,i. S,pai stability no»tins‹s9ii› 6. Flexible adhor 5Q/
RmPorarily setup at ayjytime,in ajs)' p{¢tt
7 power gett ng-stazted toefs due t#
ppp gf rab1e-dgi•aa a@
Companion t¢j,j and roUtioc p
@ of-dez¥t8¥t@ degeoprgjgyy
'I'he oodes in sd we netaop qp/
o•.demand r0uti•gpzoioce and
¢o€ocoig : g snflwAre. 8o,ztc8mbeconnectegjqgqp ,g
q
&I'fo. 'lable-dci eo _ O•-de•ia•d
1. Attempts to maintain A route is beilt onfy wlien
consistent, tip-to-dsle e
infomiR Link IrtMf eaclt
Globai State Routine fGgR1 :
node
to every other node in the
'' j. Ciobai State Routing l m B i is b8Sed oti fmk state fLSJ roijtyg
network. to perrodit updates. Control 2. It takes the idea of link state rouHpg-but ippr,7tes,t by.p,t
d
2. Co nst ant even
periodically pro pat;ation
when of unless there is a change in the la routing
of ltnk staLe routing method, each node gr›ods tf\e jgoys
meaaages. #
t•polog› •ban8e docs no‹ ‹opo*ozr directly
t,pg into the whoie uet•»r2 Iglobai fI»oaingi oqtt a }J t ¿ y y
oocur, between itse)fnd ite ireigfibour.s is delerteA
3. future a«tistantiN traffic and Does not incur sulrstantial traffic 4. /•'0r cach dea!ineLioo oode, the topo]og}' and tag]e contsta |i,dt srate
pnwer consumption, whicb is and power consumption infoLmatio0 ts reported b}’ the destination and fiJzic
generallr scarce in mobile compared to able-drii'eo routing staapofi/ifozz0ari0n.
S. If Iittks change quickl)' at high. mobility, frequent gJohaf Pooling- oil
lead Lo huge control overhead llazEeanm»ni. at szaaJ) packets/ •'bcre
when co mpar ed with on compared to tab1e•driven 6. CSR could be described as bring based oo hnJs state routiJsy. whic6
• demaad protocols. because a route needs to tye W the advantage of routing accuracy, and the 8 maaiion zarthod
f'ui t, used in Diatri buyed Better p-ord fDBFI to acid nef!icir"t i!
5. A route to every other oodi°i; li! e i° link state rooting.
node in adâoc iiefe'orâ is Not evadabfe.
'! In Ûîih ever aoüt maintains -
always svaitaLJe.
g A neigjtbçut j,st ,'y§t peigîtôour îirt ada ncde romains the Ut nf

Name the main dif1•erencet be+u'ruri adboo ueti*'or1r und

•8ber •otvork. S¥Tiat advaa¢agea do sztAoc oetw rjcB pjygg? Table : Foy each §88tinatioo node, tbe togoJg@ table
contains
Eypjs¿a
the
i• de‹aii sy xi ‹»z eu«aue esa„,pie, 0
 Adhoc Networky
178 tIT-81
the next hop table contains
t h i s destination Ifluat bg noóes
t wh ch '° tables in order
the nez hO 8 t°Pology knowledge throughp„t the oetwork.
tiiis P tran8misuion, a
forwarded.
q dj,q nce table cofiteift8theshorfestdistsmte ¢ignific£int change o etjya itt tppo]pgy,
ce table: The diata t • b l e if8
•n
to each a£••tinati node.
• a p u i itd npighbours by examining oaeh
q,ixe ptppagation of routing table'a
8 Lfitighr. each n°de type8 of updates acedeFtned:
i h
reecived packet and then builds np it8 neig bour
list. q p•tjjJ dtunp update
9. O D receiving Link s t a t e zneesage ppqy its neighbourg, every node q j p y e m e n t a l update
,pdates the linh take information itd tnpology table.
g Łsble. S nce
lO. Link stylu packets with <a° r sequenee nurnbers replace the older onea uQdate typi 'y io olve, o e thao ooe
node learris the entire ypptijjg table is large, a fuli
with emaller sequence numb£•ł•'5. SO, B 8W
aetwor)c topol^gY
6. Inc niental updates m•e tranamit8'ng between full dumpa and convey
Advazitagee of' GSR :
i. C¡Sn reduces the control overhead as it nvoids flooding ION dieconnects/
reconnects acid m a t e s are time triggered than event triggered. que sequence number ie ali 88Bign9d by the transmitter after
In a network of a 8loWly chgngiog to logy,
2. The routing accuracy of GSR ie euperior to the traditional DBF. } dump p
p ę;y used, Vince the iocremenłsl dumps are able ta convey the slow
1. Its testu diead• ntae ia large size of'the routing message.
j It is tpi table for creating adhoc network with small
2. Entire topology table ie brondcmsted wnth each update, considerable
amounL of bandwidth in consumed. nuzpber
S i n of
c e nodes.
n o IO* 2. *P••°ifi€Btlo9 Of US Algorithm is present, so there is no
coctixrie.rciBl i££iplementation of this aigorithm.
Write s h o rt no te ozi doetisntiori a e q u e n c e d d i et an ce pi«»o »nm « «r nsDV:
i. D S D V requires a regular update of its routing tabies, which user up
battery power and a small amount of bandwidth even when the network
is idle.
Deetinetion goqunnee distenee vector rc›uting (D8DW : HSDV is the 2. D S D V is notsuitable for highly djrDBmie netwoyks.
ex*"r'"io° to Bellman-Ford routing algorithm. This routing pyotocol way Eaamplea •r D s n v m « »ti«» :
#°"°*° i°l#94bYC.Perkinsendit;sapro»ttxed;tsntevecto,npg¿ g
groto u1. Thig protoeol guarantees loop freeness. 1. Corisider MH in Fig. 5.11.1. Table 5.11. l
shoers a possible structure of the f'orw arding Łable which is
mainteined at MH .
E'BcÓ nede I£taintairigg Pouting tpble thnt containg t h e iriformation 2. Suppose the address of each mobile host is represented as .
reg rding at1 possible routea wit Suppose f u r t h er that all sequence numbers are denoted as SNNN
pptqp p, the number of' hops od
g route and the sequence of each node.
eaeh MH, where MH, specifies the cozriputer that created the sequence
2. number and 8 N N N is a eequenee number value.
This oequence n u m e r asaigned by the destinationĘ
showa hovv old therout e tą. q ° B of the route, zo 8tnppose that there are entriez for all other uiobile h••tS with
the aequenee n u m J p , th4° older
tbe *ep
l@p ute te. Whens node A needs to select a route ta nede B it 8equenee numbees SNNN_MH„ before MH, uioves away fr0 i ,
•R ¥0uting table. II mo re t h a n oc h such
checka
• routes.
reute ia l'otlnd, the newer one te Th£• iiir•tall ti rne Geld helps to determine when te delete the st&e
• " °£• t e
Wi t h thi£; prntocol, the deletiop Of' stale routes, rarely ccc
d e t e e t i o n od link breakages should propagate tnrough tĘg adhoc network
 r•'iø

’ °#" #'°
*°steвœoooвùüemвbteøono-t
MHZ 3. tøøtøjjque wæi ueeA to ceduce the size oFiníí›rmstion requir*›d to
eye of a fish cøPtueee with' high detail of the pixeÍa near the focal
poipt.
edetmü decreesesaethedisteDceheœtbefeczüpDiotiocreese*
p p p t i n g , t h e F l a t e ye approach translates to maintain, the
ggø øtø diøtønce and pøth quality information about the immediate
gp jgpt,øurhoodø of •0de. W th progressively less detaźl as the
di9 ¢-s i n t o
6.
y j q ¢ d $røtø neiøtsbouring nodea, æiò periodically exchange ït with
Łheir long ĘØighbour8 rich.
.q406_SfH, T00l ïidH *’ S Ptrt_ßDj,
s ing_uYL, To0i_BiH 1 Pte 1_MH, 7 y ş everyup-to-dateœeesæge‹keenotœnUûnñüonoaõooebeut
g gj; ,g„ggg ip the netveopR. łłere tbe üoforooatïon e6out eloser
node is j•t,mged æore fzeqzzeotly Łha• ›t is éone about úu•ttrec uodes,
Lizs
t ç . ą øtag tbe update æeøaage size.
bIHĘ hDI, 9*28_Ntl1, 2 PTr]_bt
TOO2_MIH, 9 Pp* Tt•te centze aode kaø œosL up-to-date iof‘orœøtioa about aL tbe nodes in
ßO5O_MH, îoaer circîe anA tbe xcmaacy ofiiofôzœBÒoa deoeases as tke dietaoœ
TOO2_ØH, * &,oœnodeùorreaaes.
mmd sway Ø•eni others eøpeeiøjIy í ASH }. T'tie new i iterøal p -oœAere ot clividing rietworh into differeiit scope levels is done at
MØ theas a p p e a r s n e e h o - z s I- T'abye s . I t . g . $o. pen
epch node if a æeøxxiog
xyoAe Aces not
that it base accurate i:øforixiation
iø independent a£'out
on the neutral far •^ay
entity.
nodes, time packets wiLt Inn routed cor-rectly becauee tfi mute *•°
becomes more anA more accurate •° the pac t geŁ* cŁe*°t *° ' °
destination.
11. When network nice grovrø lexge, the updatø æeesaCt• 8 °*
cor aiderable nrvioumt of bandwidth, ^hie depends °° * *W P"* •
M* S884 _MH TYt0l MH 12. ïn orcler tø reAuce the aize oropdate e eges without'*eriousl af ecti ¢
EH, G890 afH 'T'0O1 routing accuracy. FSR uses Łhe Pin eye techr'iq"e.
_łdSt
TOOS fi4H 13. Fig . 5 ,12. t illustrates Łhe application of Fisheye in • Iriobiłe, wireless

84. The nunabør o£ tøvels ønd the radiuø of each $ e o J Will @@pend on Îh8
y tø;ing different
15. ’l'he red uctiol of’routizig update oyerhead to o
*' ° • •••• f i v e tŁ•e øAvæitegeø
exehœogcperigdsto,dîAere°tent esie

*° e
 jg•»iJe Co"'P” i8s ‹y'z aja

at.j,«j gcate ¥toutżog (G6R7

qe
ve diacover tbe route
tp gpy degtixiation in the ^& oc oetwor}c.

jqp up ita z'oute ceu-he to d a te r - ile if‘it aJready contażne a route

Głotisi stsłe ro u t i • g : Refer Q.S.10, Page I7S J , Uqit-5. to che desti•aŁic*n.
jr›t jizids that szt unexpired zoute to tbe dectinatioo existb, tbeo it
1. Xoazoic •o• ce outźog ia a source z”cu¢ed oo-dezaaad xoutfttg pp usesrtehi•ute to send the pacLet.
adłtoc aetworks. If t does not haue a valid route. then it sqeodg pppj;g
ggt p ł y t bybroadc sting it to the
a tec6olqueio w]b]cJ, t 6 e y g q e , o f a neighbour¢.
The route 8+9W88 I QJ Ł OOotBżaB tbe
packet determioes the cemplete sequence of nodes through w itp e.
node has travel. Bource addreae. I-equest id And s route record ia wbicb the
S. aequence of hops traversed by the request pacixet before reaching
every esaa8e, ce nodea on £fte pgth the destination aj-e ooted dowa as showri I z £’ig. 5.14. I.
^' • ibe e8aage to Lhe oeat aode.
theroae!ves
. the nodee do 'ioŁ oeed to exWenge the
=' °!!:r • 8 tkua educes Lha
ba•dvriąth
n t a i - Lhe
EN’oob“e,node list od pati
TODtHB
gzaŁhat
tle apro‹oci
oede learnt.
- ®neve

r the
“
king tequest id” to
requesLg geaerated by the zaobile hoaŁ.
eaehe°.
8.
7. Eaehgnode
oetwork.
Tbe
g. It does not append its address to the route record of the packnt and
orwards the paciret to its rieighbours.
h. To limit the number of reute requesta propegated, a node
age l76d,
processea tile route request packet ooly init has aot already seen
° ° *-* *• m. the pac/ret 8ztd ita addreea as aot present ia the route record of
: vi1. Lhe paclcet.
° A route reply iRREP) ia generated when either the destination or
a• intermediate node with current information about the
destinat'on receives the route request packet.
! 'the route repły is generated by the deeŁinst‹oo th• 'I6•res th•
k.
°oute record £zoaz route requesŁ packot into tbe rouŁe repfy peckeL.
On the other hand, if the node generating the route reply te an
 the roue remrd fi zouM guet P^k*t * Pu8 that
iqy qg epy pmkeC sbœm in ÏNg. S 14 2 AODYmiÆmiæeŒm
f. 'ro send tite ro'ne rep/r P AODY ta desi$ned to imProve q n t1t¢ ¢
°>*› > ce •
rocte to the source. If it has a route to the source in psDY in tbe creation and u• of
rte roue
The pHmnW °@&tiYT8Of AODV }
b, o di8t ingcliùh between tocel c••ne‹tivi ty æenagevient
(neigfi boiu'hœd detecti0Dl and general toppJ ttqgpq

those neighbouring mobile nodes tbnt are likely to need

the information.
AODV deais with routing table.
£vety nnde han a roufi0g table.
7. Wyen a nnde knows a route to the destination, it ends a rouk reply
a. Route maintenance is the procedure of monitoring the tu t}q¢ gpurc¢ node.
c p operation of route in use. 8 Its entrie6 are :
b. The hoet thnt use8 the route doe8 this iiiaintenance. .
c. DSR uses two type Of pacltets for route maintenance :
Route error packet c. }je¢tination sequence
ii. Acknowledgements Number text hop IP
d Whets a node encounters a fatai e. adde
transmi8aion problem at its data link layer. it generatc8 a Lt{etitae (expiratioo or
Route Error Patket (RERfi). detectio• titre o!tbe 8!•’
6'
e. When a riode receive8 a route error packet, it rem0vea the hop J•{pp h u n t (Number of
h.
f.in AH r°utes that contain the hop in error are truncated at that hops }¡p patti tbe deetinatio•i
point. Acknowledgement packete ere used to verify the correct gd Network
tiges interface
nf AODY:
operation of the rotite lioks. g p g g ([pç
!t. h!8 leo incfudes passive acknowiedgementsin wttich a rude
hean 2. opuo»al aaac•at
pj9, jtREQ for rente
3. request. REP for
Reduced contrat
!8• Ext h0p f0rwarding the packet along the route.
overheaô
route reply ar'd %°
°^ p°r°r)
1. Delay caused by ^ ” * ^ ” ’” ”
er

0 h
_
 AODV u»s ›roadcm t e discovery mechanism.
1. precess is initiated whene a node requises to communicate with a nid,
Palm
for whicb it has no route by br'tt a route request
(RREQ)jp
ttt ing the sourte addreas, courte sequence number, broadcut
lo
degt¡nat¡p• address, destination seQtierice number, trop count. tp jtt
2, }{op Mount ie initially 0 and is incremented by each node aa it
forw the RRSQ to'vards the destination. - - - - -r Reptesents tr missi0n t{p9yQ
P. An intemediste node upon receiving a RREQ first checks that
RPM was received oter a bidireftionai link.
4. Ifit hactben it tbecks ifit han alteady pruceased a similarRRaQp c
ri and ifit has tben the RREQ packet is diacarded.
5. Otherwise, the node checks if it hes a route entry for the
destination. If it has a routing Able e«trjr for the destination then
it replies to the source ooly if the destruction sequence number in
RREQ is greater than the destination sequent pumber in its route
tuNe ntheruñse it rebroadcasts the RREQ packet.
6. Reverse path is established as the nRSQ traverses t0wards the

7. Tbe üestioation or tfre interzoerfiaLe aode responüs to RREQ pacltet Repre8eats links ou reverse patb
sritb aroute reply(RREP) packet ftavîog giorîJar fîglde a4 tüa¢ 0I°RRgQ
packet, RREP travels back to the aource using the reverse paths.
Reverse peth aetop in<ODV '
Ttoute request in AODv:
 jr¢ gre aetup when R R E P rave
Repreeentu a link on the forp a1ong the rever e path.
pg@

t
H

p tj ng tsble entries ia used t» m l a d data panket. Boute is not

y p } u d e d i n packet header.

Wr i te sbc›rt n o t e o n Tez pora lly Oraere,j

Rput;pg

OR
eeržžse x”oute dšecoveW 8zsd woute zztačoteoaooe zaecžsazriazo
of

e
A O D V : Hefer Q. 5 16, Page l86J, Unit-5.

1. Tlne T O R A is a source initiated on-demand routing algorithm.

2. lt is a highly adaptive, e&cient andscalable disD•ibuted routing atgorithnj
based on the concept of link reversal.
3.
4- s propns
T3tis protocol e d G ordesigned
is mainiy highly dynamic
to minimize l e, reacfion
iiiobithe iiiuitihoptowire lesa
topology
networks.
5 f - d c multiple routea froai a
eoiirce node to a destination node. 8• The mnin feature of TO R A is
thaC the eontml messages are loc'alized to
a very szziall set of nodea near the occurrence of a topological change.
N
7. To thie, t h e nodes maintain routing iriformation about eQjacent nodes.
• R8C h node hue a quint uple associated with it -. Logical time of a link
fmilure, a reference indicator bit, a propegetion ordering
paruixieter, the
* 9 * ° H3 of the node that delined new rel'erence level.
 gTs)
191
J a g¡eelly separate copy of TOE
i8 *In for eg
(f'T' ) ,j
2 f0,3)
of the network.
lily e
pppypp) }tq9 jjjgjnly three phases :
g py p ve y or route creation 5;purce 1
(0,3 S
b. n • • t e maintenance (0.0)
9 d a t e prasure
8
l1. These three types of packets used in the protocol are : Destinatj
q (0,2) (g y) q¢
QTY packets, used for creating routes.
b. 6
Update (UDP) packets, used for both creating and m a i n t a i n
roufes. p•ig. 2i.17.8. Height of each node updgg
c. g¡ Jn thia way a directed acyclic graph is
p CLR packets, used for e r a s i n g routes.
the destination. Fig. S.17.1 and s.17.2 i1]t1strates a routn cregjpq
protoeai has mainly three p h a s e s :
1. Route discov ery or Route creation :
a. Route discovery is tnitiated only when a node having no ,As shown ift Fig. 5,17.1, node 5 doea not pnpagQ Q
TY f1'0oi node
route to the destination requires a route, I as it h4fb alrea@ seen aHdprop;;gated Q}tY messageg Jp
b. Route creation is done using QRY and UDP packets. k. 2,
In F i g . •L17,2, the source (i.e., node 1) may have received a UDP e sch
c. A query packet consists of a Destination_ID. frc›m node 2 or node 3 but énce node 4 gives it lesser heigbt, it
d Ari UDP packet consists of D e s t i n a t i o n ID retails that height.
and the height of the node. y o o u t e a atate+saooe :
e. The route creation algorithm starta with the height (propagation g. When anode moves the DAG route is
ordering parameter) of destination set to 0 and all other node's broben and route maintenance is needed to re-establish a DAG
height set to NULL. for the game destination.
b.
When the la8t down stream link ofa ntide fails, jt genesrates ties
reference level.
T h i s resu/8s in the propagation of that reference level by
t-. 5 neighhauring nodes as sbow2t in Pig. 5.17.3.
—) (—, - g 5jriks are reversed to redect the ch6B89 i° gdgpting to the •ew
I
3 e. reference
T}sis has the game effercft • 6 8 9 9 J
level.
Destinntio n CQ t h e p u ofone or
f- . - ) links when a node has •° 8°
zn0re
b 1
eragtsz•e :
Route">°
'
*B- 6.17.1- P ropagetion of the QRY pnckef through the network. a. In the route erasure phase, TORA
¡¢tgJid routes.
t C L R l throughout the network to erm
e source broadcast a QitY packet with tire destination node ñ id
b. In TOR A th
i’. A node with a non-N U L L height responds with a UDP packet that when multiple
pIIiow.g* buildina routes based oo eacb
ha0 its height in it.
g. ingrou*®"
A node receiving a UDP packet sets its height to one more than other. ¡y }jqbi}jty problem
Bt Of the node that generated the UDP. c.
h. Because TORA um8
A node with higher height is considered up stream and a node with i3 g
er height down strewn.
to the * protocols,
except converBence
writ
 ppp¡}e ° “"‘

f0,1J

j rout1Q,g is simply the

d zzubing table via a that
C9'^
device st 8p-
(1,O
)
the r0utes
tgd{y,
3 Snee
(0, (0,1 .
1 d (unless
orting a human
is the simplest formchanges tbeail t
orr»utingh, ,t i
2
s S¿jtaöc
tad k the
the rOutAH
pig, 5,J2.g. d when 9£0bflbly never rhaygt
Uq ;naintenante in TORA.
. ¡ g also does not bandle fai}ures ¡p 9 pg{ppyy
geil
6.
joanualÏy to fÏx or repair aay]ogt co/t/tptt¿ty

i. Hybrid routing protocols combines the advantages of both table- th• ••»ting devioe whicb dynamimly ltarn netr t2
driven and on-demand routing. deatinät1O and bow to get to them and also advertLse tbost
2. In this the distance vector routing(DVR) works by sh8f'ing its definjti#ns
LnoWledgg of entire network with its neighbours and link 8tate tn other router*
Eis
routing (LSR) ltd every routar on the network about its closest adv8rtisement funeti0n allows all the routers to learn alout all
neighbours so it ia the combination of both DVfi and LSR. the d e stin a t i o n netw0r& th8t exist.
9 tpiiting vrill learn the routes to all
3. A rg uter tt8if g dyp
3. Hybrid routingprotocols use distance vectors for more accurate metrics to networks
eonnected to tbe
that are directly devite.
determine the best paths to destination networks and report routing frons Other routers that run the same
information only when there is a change in the topology of the 4 e
p utey will learn mutes
network. . rput¡ng protocol tR!P. RI1'z, BGP etc.1.
5. Each router will then sort through
its list of routers and select one or
4. Hybrid routingatiows forrapid convergence but requires lesa § destination thg j-ouifï k.AO 8
Someprocessing
examples ofpower
hybridand
routing protocols
memory as compared to link atate routing.
are : a. EIGRP(Enhanced Interior Gateway Routing Protocol), 6 djsfrjbute this ‘best 8°°
. inforDjatfon to other routers rim8!°8
developed by GISCO. n¢tworä exist and
thereby exteRding the
*
b. ZRP(2one Routing Protocol). reached.
7. This grves dynapic routing
jl Explain with example :
network to9O1Og'f c}\aztges, equip
é Praaetive routing and reactive routing pratoeole the fly.
tl• Stata aDd dynamio routing Source routing : Refer Q. s.13, Page 18 tUnit•5

üi. Source routing Url a

Isoues of QOB r° itin& '

Issues
 } should
pyy ie varying
p
3. netwoi'k t0pology precise state inf q e gpd
thetopo1Qgym@yç
edg e
j•ination5c unication infrastructure batt•riea.
zetœotk8 t
5. Lack of centralized cont€0l 3. w
there
Scarte resources
6. Power limitations {jveP Proviaionifig«°nsist8 of tg
of resources sueh that oPeñqga Dp
7. Heterogeneous nodes and networks ydipg
tu applications.
g. Error prone shared radio channel
jptead, network traître
9. Insecure
10. Hidden terminal
mediumproblem
Ç'w
pyopqg&{s b01O£-' gi7tg t0 t§Î8 c|gsg
Objectives and ‹n•iteria of QoS routing: 6 O jjgg teen done ¡ e tg
. ]gpgt-ated Service(ÏatGerv)
1. To meet QoS requirements of end usera.
f r y is a reservationoriented mq etbQ ”^ V 8 S t for
2. To optimize netwoyfl resoiirce usage. they need. the
Resource reservati0nprotocol l
8.
3. To gracefully degrade network perfornimice under heavy load, p
4. Diffitulties arise because node niobility can cause frequent neytt\ )
pp{j;gite to IfitServ, Oiff8erv is a r-ratio»-in « i r a
9. p t pp resouree reservations for hit5erv.
topology changes.
10.
different
Channels applications canerror
can have high be sharing
rates, thethejitter
userate
of the tomm
ig high and ‹•ti‹
medium. {pv6 true:b t ass octet is useJ. to mark a paeket to rertive¢pp
8eseral
Criteria of QoE eouting classification : 11 ¡ pos class.
1. Routirig information update œechanism such as y,
proattive/tabIe@rIttp, reactive/on-demand and ‘ models n0t 8ppropriate for MANETs-
hybrid.
y •j-provisionirig, for instance, may mot de possible Cause
2. Proactive table based routing scheme ; It requirea each node
of t]jt network to maintain table8 to store routing information. resourcts
y i4.
3. Reactive on-demand source based routing : Routes are created and aignaling
pre scarce.
4. when necessary. Route will be maintained until it is overhead. mp yt tinaff0rdable aorage 8
15. DiffServ on the other hard, js a light weight overhea8 z<^! °
no longer needed. and prn°*<igfor Ns,
e
be more suitabl for MANETS'
Use of information for routing such as information of paat
history,
prediction. do eanot fit the distributed natuf9Of idANE
5 1 How can we obtain quality of service on MANET ?
s. State maintenance such as local, global.
OR QttgSTtORS
Explain the wiechanis is to address quality of services issues VERY IMPORTE
in
MANET. T 0 1
_
1. For obtaining QoS tQuality of Service) on a MANE7, it i8 not stiffitient t0
provide a baaic routing functionality, Q. 1. What do you ••° °* ^ “ ° c n e t " ° "
196 (IT-81 I

Refer Q. 5.1.

Q. 2. Explain the routing protocols and their types.

Refer Q. 5 6 and 5 7.

Q.a. Wnte a ehowtoote onfoHowiog:

m GSR
b DSDY
a. GSR : Refer Q. 5.10.
in D •iDV : Refer Q. 5.11.

Q. 4. r.xpIain the following:

DiSR
b. AODY

a. DSR : Refer Q. 5 18.

b. AODV : Refer Q. 5 15.
c. TOP :ReferQ. 5.17.

Q. What are the key issues, objectives and criteria of QOS

Mr. routing ?
Refer Q. 5.20.