Adhoc Question Bank EC2050

8/17/2019 Adhoc Question Bank EC2050

http://slidepdf.com/reader/full/adhoc-question-bank-ec2050 1/31

Format : QB06 Subject Code / Name:EC2050 Mobile Ad hoc Networ!

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

QUESTION BANK ( MOBILE ADHOC NETWORKS)

Sub.Code : EC!"! B#$%&'e$#Se*Se&:

ECEI++III A , B

Sub.N$*e : Mob-e Ad'o& Ne/0o#12 B$/&' :

!334!3"

S/$5 N$*e: M#.P.R$6$ P-#-$% M#2. D. +e%%-$ A&$de*-& e$# :

!374!3"(E8e%)

UNIT 9 I INTRODUCTIONPART A

1. What is fading? List the dierent types of fading? (AU-

April/May 2014

!he ter" $d-%;# or# s"all-s$ale fading# "eans rapid %&$t&ations of the

a"plit&des# phases# or "&ltipath delays of a radio signal o'er a short period or

short tra'el distan$e. !his "ight e so se'ere that large s$ale radio

propagation loss ee$ts "ight e ignored. !he dierent types of fading are )ast

)ading and *lo+ )ading.

2. ,ene *$alaility. (AU-April/May

2014

t is the aility of a $o"p&ter appli$ation or prod&$t (hard+are or soft+are to

$ontin&e to f&n$tion +ell as it (or its $ontet is $hanged in sie or 'ol&"e

in order to "eet a &ser need.

. ,ene ad ho$ net+ors? (AU- 3o'/

,e$.201

A "oile ad ho$ net+or (MANET is a $ontin&o&sly self-$ong&ring#infrastr&$t&re-less net+or of "oile de'i$es $onne$ted +itho&t +ires.

MANET *tands for Moile Ad 5o$ 3et+or. A MA36! is a type of ad ho$

net+or that $an $hange lo$ations and $ong&re itself on the %y. 7e$a&se

MA36!* are "oile# they &se +ireless $onne$tions to $onne$t to 'ario&s

net+ors. !his $an e a standard Wi-)i $onne$tion# or another "edi&"# s&$h

as a $ell&lar or satellite trans"ission.

4. Write any t+o $hara$teristi$s of Wireless $hannel? (AU- 3o'/

,e$.201 ,yna"i$ topologies

Li"ited $hannel

and+idth

6nergy-$onstrained operation

Li"ited physi$al se$&rity

Mobile Ad hoc 9 "CE/ECE/QB/#$ %&/

A' ()C

http://en.wikipedia.org/wiki/Computer_network

http://en.wikipedia.org/wiki/Wireless

http://www.techterms.com/definition/adhocnetwork


http://www.techterms.com/definition/wi-fi

http://en.wikipedia.org/wiki/Computer_network

http://en.wikipedia.org/wiki/Wireless



http://www.techterms.com/definition/wi-fi




8ariale $apa$ity lins

9. List the trans"ission i"pair"ents of +ireless $hannel. (AU-

May / :&ne 201

!he "ain trans"ission i"pair"ents in $ell&lar +ireless $o""&ni$ations are $o-

$hannel interferen$e# ti"e-'ariation and fre;&en$y sele$ti'ity.

<. Write the e;&ation for "ai"&" data rate a$$ording to *hannon=s theore".

(AU-May/ :&ne 201

Mai"&" data rate > 1 log2(1 @ 0.9 > 1 log2(1.9 > 0.9 Mps. (or

!he "ai"&" infor"ation trans"ission rate# C# +ill e

B > 27 Log2 C(1@*/31/2D > 7 Log2 C1@s/nD

!his epression represents the "ai"&" possile rate of infor"ation

trans"ission thro&gh a gi'en $hannel or syste". !he "ai"&" rate +e $an

trans"it infor"ation is set y the

and+idth# the signal le'el# and the noise le'el. C is therefore $alled the

$hannelEs infor"ation $arrying Bapa$ity.

F. ,ierentiate an ad ho$ net+or and a $ell&lar net+or +ith respe$t to

and+idth &sage and

Bost effe$ti'eness. (AU-3o'/

,e$.2012

S.N

O

CELLELAR NETWORKS AD HOC WIRELESS

NETWORKS1. )ied nfrastr&$t&re - ased nfrastr&$t&re - less

2. *ingle G hop +ireless lins M&lti - hop +ireless lins

.H&aranteed and+idth (designed

for 'oi$e traI$

*hared Jadio $hannel ("ore

s&itale for est G eort data

traI$4. Bentralied Jo&ting ,istri&ted Jo&ting

9.Bir$&it- s+it$hed ( e'ol'ing

to+ard pa$et s+it$hing

Ka$et- s+it$hed ( e'ol'ing

to+ard e"&lation of $ir$&it

s+it$hing

<.Je&se of fre;&en$y spe$tr&"

thro&gh geographi$al $hannel

re&se.

,yna"i$ fre;&en$y re&se ased

on $arrier sense "e$hanis"

. *tate *hannon=s theore". (AU- 3o'/

,e$.2012

*hannonEs !heore" gi'es an &pper o&nd to the $apa$ity of a lin# in its perse$ond (ps# as a f&n$tion of the a'ailale and+idth and the signal-to-noise

ratio of the lin.

Mobile Ad hoc 10 "CE/ECE/QB/#$

%&/ A' ()C




!he !heore" $an e stated as C < B = o;(3> SN)

+here B is the a$hie'ale $hannel $apa$ity# 7 is the and+idth of the line# * is

the a'erage signal po+er and 3 is the a'erage noise po+er.

. Why ad ho$ net+ors are needed? (AU-May/:&ne

2012

Ad-ho$ net+oring is often N&stied y s$enarios +here yo& do not +ant or+here yo& $annot deploy O "anage an infrastr&$t&re.

*pontaneo&s "eetings (at +or# airport e$hange les# play ga"es

*pe$ial $ir$&"stan$es disaster relief

Pr si"ply $aling $osts# "anage"ent o'erhead old &ilding# Q+earale

LA3R# +ireless headset

10. What are the $hallenging iss&es in ad ho$ net+or "aintenan$e?

(AU-May /:&ne 2012

5ost is no longer an end syste" $an also e an a$ting inter"ediate syste".

Bhanging the net+or topology o'er ti"e

Kotentially fre;&ent net+or partitions

6'ery node $an e "oile

Li"ited po+er $apa$ity O +ireless and+idth

Kresen$e of 'arying $hannel ;&ality

11. ,ene 3y;&ist theore".

!he 3y;&ist !heore"# also no+n as the sa"pling theore"# is a prin$iple that

engineers follo+ in the digitiation of analog signals. )or analog-to-digital$on'ersion (A,B to res&lt in a faithf&l reprod&$tion of the signal# sli$es# $alled

sa"ples# of the analog +a'efor" "&st e taen fre;&ently.

12. .,ene path loss.

P$/' o22 (or ?$/' $//e%u$/-o% is the red&$tion in po+er density

(atten&ation of an ele$tro"agneti$ +a'e as it propagates thro&gh spa$e. Kath

loss is a "aNor $o"ponent in the analysis and design of the lin &dget of a

tele$o""&ni$ation syste".

!his ter" is $o""only &sed in +ireless $o""&ni$ations and signal

propagation. Kath loss "ay e d&e to "any ee$ts# s&$h as free-spa$e loss#

refra$tion# dira$tion# re%e$tion# apert&re-"edi&" $o&pling loss# and

asorption.

1. List the Appli$ations of ad ho$ net+ors.

Military appli$ations

6"ergen$y res$&e

Mesh net+ors

Wireless sensor net+ors

M&lti hop $ell&lar net+ors

Wireless $o""&nity net+ors.

14. ,ene ,oppler shift.


%&/ A' ()C

http://en.wikipedia.org/wiki/Attenuation_(electromagnetic_radiation)

http://en.wikipedia.org/wiki/Electromagnetic_wave

http://en.wikipedia.org/wiki/Link_budget

http://en.wiktionary.org/wiki/signal

http://en.wikipedia.org/wiki/Wave_propagation

http://en.wikipedia.org/wiki/Free-space_loss

http://en.wikipedia.org/wiki/Refraction

http://en.wikipedia.org/wiki/Diffraction

http://en.wikipedia.org/wiki/Reflection_(physics)

http://en.wikipedia.org/wiki/Aperture_(antenna)

http://en.wikipedia.org/wiki/Transmission_medium

http://en.wikipedia.org/wiki/Coupling_loss

http://en.wikipedia.org/wiki/Absorption_(optics)

http://en.wikipedia.org/wiki/Attenuation_(electromagnetic_radiation)

http://en.wikipedia.org/wiki/Electromagnetic_wave

http://en.wikipedia.org/wiki/Link_budget

http://en.wiktionary.org/wiki/signal

http://en.wikipedia.org/wiki/Wave_propagation

http://en.wikipedia.org/wiki/Free-space_loss

http://en.wikipedia.org/wiki/Refraction

http://en.wikipedia.org/wiki/Diffraction

http://en.wikipedia.org/wiki/Reflection_(physics)

http://en.wikipedia.org/wiki/Aperture_(antenna)

http://en.wikipedia.org/wiki/Transmission_medium

http://en.wikipedia.org/wiki/Coupling_loss

http://en.wikipedia.org/wiki/Absorption_(optics)




!he ,oppler 6e$t (or ,oppler shift is the $hange in fre;&en$y of a +a'e (or

other periodi$ e'ent for an oser'er "o'ing relati'e to its so&r$e. n $lassi$al

physi$s (+a'es in a "edi&"# the relationship et+een the oser'ed fre;&en$y

f and the e"itted fre;&en$y fo is gi'en y

f > C( v ± vr) / ( v ± vs )} * f 0+here v is the 'elo$ity of +a'es in the "edi&"# vs is the 'elo$ity of the so&r$e

relati'e to the "edi&" and vr is the 'elo$ity of the re$ei'er relati'e to the"edi&".

19. List the $hara$teristi$s of ad ho$ net+ors

Pperating +itho&t a $entral $oordinator

M&lti- hop radio relaying

)re;&ent lin reaage d&e to "oile nodes

nstant deploy"ent

Bonstraint reso&r$es (7and +idth# $o"p&ting po+er# 7attery life ti"e

PART B

1. (i ,ierentiate et+een $ell&lar net+or and Ad 5o$ 3et+or. (

(AU- April/May 2014

,ierentiation ((iiWhat is replay atta$? 5o+ it $an e pre'ented?( (AU-

April/May 2014

Jeplay atta$ (2

Kre'ention "ethod (<

2. (i List o&t the "aNor ad'antages of Ad ho$ +ireless nternet.(< (AU-

April/May 2014

Ad'antages (<

(ii,is$&ss the Kros and Bons of a ro&ting proto$ol that &ses HK* infor"ationfor an Ad ho$

+ireless 3et+or for sear$h and res$&e operation. (10 (AU-

April/May 2014

Kros and Bons (<

6planation (4

. ll&strate the $hara$teristi$ feat&res of Moile ad ho$ 3et+ors and state

its

appli$ations.(1< (AU- 3o'/,e$.201

,iagra" (4

$hara$teristi$ feat&res (


%&/ A' ()C

http://en.wikipedia.org/wiki/Frequency

http://en.wikipedia.org/wiki/Wave

http://en.wikipedia.org/wiki/Observer_(physics)

http://en.wikipedia.org/wiki/Frequency

http://en.wikipedia.org/wiki/Wave

http://en.wikipedia.org/wiki/Observer_(physics)




appli$ations (4

4. Write in detail ao&t ndoor and P&tdoor "odels in Ad ho$ "oility "odels.

(1<

(AU- 3o'/ ,e$.201

,iagra" (4

ndoor "odels (<

P&tdoor "odels (<

9. 7rie%y dis$&ss ao&t path loss and fading. (1< (AU-

May/:&ne 201

,iagra" (<

Kath Loss (9

)ading (9

<. (i 6plain the t+o "ain for"s of interferen$e# ,oppler shift and 3y;&ist

theore". (10

(AU-May/:&ne 201

)or"s of interferen$e (2

,oppler shift (4

3y;&ist theore". (4

(ii List the "aNor ad'antages of 5yrid +ireless 3et+ors.(< (AU-

May/:&ne 201

Ad'antages (<

F. 5o+ "oility $an e s&pported in today=s internet? 6plain &sing the

WAK "odel. Bo""ent

Pn its $hallenges in "aintaining ad ho$ net+ors that are $onne$t to internet.

(1<

(AU-3o'/,e$.2012

,iagra" (

Moility (

WAK "odel (9

Bhallenges (9

. (i List the enets +hen deploy"ent of a $o""er$ial ad ho$ +ireless

net+ors $o"pared to +ired net+or. (

(AU-3o'/,e$.2012

,iagra" (

7enets (2

Bo"parison (

(ii Bo"pare Ad-ho$ 3et+ors and Wireless LA3. ( (AU-

3o'/,e$.2012

Bo"parison (


%&/ A' ()C




. (iWhat are the $hara$teristi$s and feat&res of ad ho$ net+ors?(<

(AU-May/:&ne 2012

Bhara$teristi$s (

)eat&res (

(ii,is$&ss in detail ad ho$ indoor "oility "odels. (10 (AU-

May/:&ne 2012 ,iagra" (4

Moility "odels (<

10. (i 6plain the appli$ation areas of ad ho$ net+ors. (

(AU-May/:&ne 2012

Appli$ation areas (4

6planation (4

(ii ,is$&ss in detail the $hara$teristi$s of +ireless $hannels. ( (AU-

May/:&ne 2012 ,iagra" (4

Bhara$teristi$s (4

UNIT4II MEDIUM ACCESS PROTOCOLS

PART A

1. What is "eant y 5K6JLA3? (AU - 3o'/ ,e$.201#

April 2014

5K6JLA3 is a 6&ropean (6!* standardiation initiati'e for a 5igh

Kerfor"an$e +ireless Lo$al Area 3et+or.

Jadio +a'es are &sed instead of a $ale as a trans"ission "edi&".

6ither# the radio trans$ei'er is "o&nted to the "o'ale station as an add-

on and no ase station has to e installed separately# or a ase station is

needed in addition per roo".

!he stations "ay e "o'ed d&ring operation-pa&ses or e'en e$o"e

"oile.

2. What are the iss&es to e $onsidered +hile designing a MAB proto$ol for

Ad-5o$ 3et+ors?

(AU- April / May

2014

!he "ain iss&es need to e addressed +hile designing a MAB proto$ol for ad

ho$ +ireless net+ors

Bandwidth

Quality of service Synchronization

Hidden and exposed terminal problems:

Error-Prone Shared Broadcast hannel

!istributed "ature#$ac% of entral oordination


%&/ A' ()C




&obility of "odes'

. What are the goals of "edi&" a$$ess proto$ol?

(AU- 3o'/ ,e$. 201

nitialiation O )airness

Kriority Li"itations to one station

Je$eipt

6rror Li"itation

Je$o'ery

Je$ong&raility

Bo"patiility

Jeliaility

4. ,ene syn$hrono&s proto$ols. (AU-May/ :&ne 201

*yn$hrono&s is a $o""&ni$ations proto$ol &sed to send and re$ei'e data

a$ross high-speed "ainfra"e net+ors. ,ata is syn$hronied and trans"itted

&sing $onstant inter'als et+een data its.

9. Blassify the $hannel of ,-KJMA. (AU-

May/ :&ne 201

A si"ple slot reser'ation "e$hanis" for 'oi$e traI$ at the le'el of Qtal

sp&rtR +itho&t relying on any $entral entity and A si"ple sol&tion for the hidden and eposed ter"inal prole"s &ni;&ely

present in +ireless ad ho$ en'iron"ents.

<. Bo"pare the eI$ien$y of the pa$et ;&e&ing "e$hanis" adopted in

MABA and MABAW.

(AU- 3o'/ ,e$.2012

MABA MABAW


%&/ A' ()C




( When a node +ants to trans"it

a data pa$et# it rst trans"it a

RTS (Re@ue2/ To Se%d) fra"e.

( !he re$ei'er node# on re$ei'ing

the J!* pa$et# if it is ready to

re$ei'e the data pa$et#

trans"its a CTS (Ce$# /oSe%d) pa$et.

( Pn$e the sender re$ei'es the

B!* pa$et +itho&t any error# it

starts trans"itting the data

pa$et.

( f a pa$et trans"itted y a

node is lost# the node &ses the

inary eponential a$-o

(767 algorith" to a$ o a

rando" inter'al of ti"e efore

retrying.

!he inary eponential a$-o

"e$hanis" &sed in MABA "ight

star'e %o+s so"eti"es. !he

prole" is sol'ed y MABAW.

MABAW (MABA for Wireless is a

re'ision of MABA.

( !he sender senses the $arrier to see

and trans"its a RTS (Re@ue2/ To

Se%d) fra"e if no neary station

trans"its a J!*.

( !he re$ei'er replies +ith a CTS (Ce$#/o Se%d fra"e.

3eighors see B!*# and then eep

;&iet.

see J!* &t not B!*# then eep ;&iet

&ntil the B!* is a$ to the sender.

( !he re$ei'er sends an ABS +hen

re$ei'ing an fra"e.

3eighors eep silent &ntil see ABS.

( Bollisions !here is no $ollision dete$tion.

!he senders no+ $ollision +hen they

don=t re$ei'e B!*.

!hey ea$h +ait for the eponential a$

o ti"e.

F. What are the $lassi$ations of MAB proto$ol? (AU-

May/ :&ne 2012 Bontention-ased proto$ols

Bontention-ased proto$ols +ith reser'ation "e$hanis"s

Bontention-ased proto$ols +ith s$hed&ling "e$hanis"s

Pther MAB proto$ols


%&/ A' ()C




. List the design goals of MAB proto$ol for ad- ho$ net+ors.

Kro'ided To* s&pport for real-ti"e traI$

Lo+ a$$ess delay

7and+idth (7W eI$iently &sed

)air allo$ation of 7W to nodes

Lo+ $ontrol o'erhead

*$alale to large net+ors

*&pport po+er $ontrol and ti"e syn$hroniation

Adapti'e data rate $ontrol

. List the iss&es of designing a MAB proto$ol for ad ho$ net+ors.

7and+idth 6I$ien$y

To* s&pport

*yn$hroniation

5idden and 6posed !er"inal Krole"s

6rror-Krone *hare 7road$ast Bhannel

,istri&ted 3at&re/La$ of Bentral

Boordination O Moility of 3odes

10. List the 'e phases of )KJK.

)KJK is a single-$hannel !,MA-ased road$ast s$hed&ling proto$ol

Jeser'ation re;&est send reser'ation re;&est (JJ pa$et to des.

Bollision report if a $ollision is dete$ted y any node# that node road$asts

a BJ pa$et

Jeser'ation $onr"ation a so&r$e node +on the $ontention +ill send a JBpa$et to destination node if it does not re$ei'e any BJ "essage in the

pre'io&s phase


%&/ A' ()C




Jeser'ation a$no+ledg"ent destination node a$no+ledge re$eption of

JB y sending a$ JA "essage to so&r$e

Ka$ing and eli"ination &se pa$ing pa$et and eli"ination pa$et

11. Hi'e the $lassi$ation of $ontention ased proto$ol.

*ender initiated

*ingle Bhannel G MABAW# )AMA M&ltiple Bhannels G 7!MA# 7!MA# B*MA

Je$ei'er initiated GJ-7!MA# MABA-7# and MAJB5.

12. Hi'e the $lassi$ations of MAB proto$ols.

MAB proto$ol for ad-ho$ net+ors "&st e $lassied into

Bontention-ased proto$ols +itho&t reser'ation/s$hed&ling

Bontention-ased proto$ols +ith reser'ation "e$hanis"s

Bontention-ased proto$ols +ith s$hed&ling "e$hanis"s

Kroto$ols that do not fall to any of these $ategories

1. What do yo& "ean y ,- KJMA?

,-KJMA ,istri&ted Ka$et Jeser'ation M&ltiple A$$ess Kroto$ol

!he $hannel is di'ided into ed and e;&al sied fra"es along the ti"e

ais.

!he J!*/7 and B!*/7 are &sed for slot reser'ation and for o'er$o"ing the

hidden ter"inal prole"

f a ter"inal +ins the $ontention thro&gh "ini-slot 1# the etra (" G 1 "ini-

slots of this slot +ill e granted to the ter"inal as the payload )or 'oi$e node# the sa"e slot in ea$h s&se;&ent fra"e $an e reser'ed

&ntil the end of its pa$et trans"ission

n the other $ases# the etra (" G 1 "ini-slots are $ontin&o&sly &sed for

$ontention# and the +inner of this $ontention +ill e granted the

reser'ation of the sa"e slot

14. What do yo& "ean y 7!MA?

!he &sy tone "&ltiple a$$ess proto$ol +as the rst proto$ol to $oalt the

hidden ter"inal prole"s of B*MA.7!MA is designed for station ased net+ors and di'ides the $hannel into a

"essage $hannel and the &sy tone $hannel.

!he 7ase station trans"its a &sy tone signal on the &sy tone $hannel as long

as it sense $arrier on the data $hannel e$a&se the 7ase station is in line of

sight of all ter"inals# ea$h ter"inal $an sense the &sy tone $hannel to

deter"ine the state of the data $hannel.

19. 5o+ 7!MA $hannel is separated?

7&sy tone "&ltiple a$$ess proto$ol (7!MA

M&lti$hannel proto$ol +here the $hannel is separated into

• $ontrol $hannel &sed for data trans"ission

• ,ata $hannel &sed for &sy tone trans"ission.


%&/ A' ()C




PART B

1. (i What are the ad'antages of reser'ation ased MAB proto$ol o'er $ontention

ased MAB

proto$ol? ( (AU- April/May

2014 Ad'antages (4

Jeser'ation ased (2

Bontention ased (2

(ii What are the ad'antages and disad'antages of MAB proto$ol &sing

dire$tional antennas?

( (AU- April/May

2014

Ad'antages (4

,isad'antages (4

2. (i 3a"e the three MAB ser'i$es pro'ided y the 666 02.11 that are not

pro'ided in the

traditional LA3=s s&$h as 02.. (< (AU-

April/May 2014

MAB ser'i$es y 666 02.11 (2

Jeason ehind LA3 02. (4

(ii ,is$&ss the 'ario&s 5K6JLA3 standards dened for +ireless 3et+ors y

6!*.(< (AU- April/May

2014

5K6JLA3 standards (

6planation(

(iii 5o+ are dire$tional antennas s&perior to MABAW? 6plain +ith an ea"ple.

(4

(AU- April/May

2014

6planation(2

6a"ple (2

. 6plain in detail ao&t $ontention ased proto$ols +ith reser'ation.(1<

(AU-3o'/ ,e$.201

,iagra" (4

6planation (12

4. ,es$rie 666 *tandards 02.19 in detail.(1< (AU- 3o'/

,e$.201

666 standards (4

,iagra" (4

6planation (


%&/ A' ()C




9. List and eplain the iss&es in designing a MAB proto$ol for ad ho$ +ireless

net+ors.(1<

(AU- May/ :&ne

201

,iagra" (4

6planation (4

ss&es in MAB proto$ol design(

<. (i List the i"portant goals of designing a MAB proto$ol for ad ho$ +ireless

net+ors.(12

(AU- May/ :&ne

201

Hoals of MAB proto$ol (<

6planation (<

(ii Blassify and dene sender- initiated proto$ols. (4 (AU-

May/ :&ne 201

,enition (2

Blassi$ation (2

F. 5o+ is s$hed&ling "e$hanis" a$hie'ed in distri&ted +ireless ordering

proto$ol? 6plain in

detail. 5o+ are nfor"ation sy""etry and per$ei'ed $ollisions handled?(1<

(AU- 3o'./,e$.

2012

*$hed&ling Me$hanis" (

nfor"ation sy""etry (4

per$ei'ed $ollisions handled(4

. ll&strate 'ario&s steps in'ol'ed in 'e phase reser'ation proto$ol +ith its

fra"e for"at.(1<

(AU-

3o'./,e$2012

*teps in phase reser'ation proto$ol (

,iagra" (4

)ra"e for"at (4

. (i ,is$&ss in detail $ontention ased proto$ols +ith s$hed&ling and

reser'ation.(12

(AU- May/ :&ne

2012

,iagra" (4

6planation (

(ii6plain the 5K6JLA3 standards in detail. (4 (AU-

May/ :&ne 2012 5K6JLA3 standards (4


%&/ A' ()C




10. 6plain 02.11g 666 standard in detail.(1< (AU-

May/ :&ne 2012

,iagra" (4

02.11g 666 standard (4

6planation (

UNIT III NETWORK PROTOCOLS

PART A

1. ,ierentiate proa$ti'e and rea$ti'e proto$ol. (AU- 3o'. /,e$.

201# April/May 2014

P#o$&/-8e #ou/-%; Re$&/-8e #ou/-%;

a. Blassi$ ro&ting strategies lin

state# distan$e 'e$tor

. Seep tra$ of ro&tes to all possile

destinations

$. Bhanges in lin $onne$tion

&pdated periodi$ally

d. Mini"al delay &t s&stantial

fra$tion of $ontrol infor"ation

e. 6.g. ,*,8# WJK# !7JK)# PL*J#

et$.

a. Pnly dis$o'er ro&tes to

destinations on-de"and

. Bons&"e "&$h less and+idth

&t eperien$e s&stantial delay

$. 6.g. ,*J# A,P8# !PJA# et$.

2. What are the ad'antages and ,isad'antages of hierar$hi$al ro&ting

proto$ol?

(AU- April/May 2014

Ad8$%/$;e:

Using hierar$hy infor"ation it red&$es the ro&ting tale sie

D-2$d8$%/$;e:

!he pro$ess of e$hanging infor"ation $on$erned all the le'els of the

hierar$hy as +ell as the pro$ess of leader ele$tion in e'ery $l&ster "aesit ;&ite prole"ati$ for ad ho$ net+ors

. What is "eant y 5ierar$hi$al ro&ting? (AU-

3o'. /,e$. 201

!he idea is to gro&p the net+or into a hierar$hy of $l&sters... e.g. $l&sters and

s&per $l&sters.

!+o types of hierar$hi$al ro&ting

$. S/#-&/ '-e#$#&'-&$ #ou/-%;:

6a$h node learns ao&t the net $l&ster at the sa"e le'el to &se# in order torea$h ea$h $l&ster at the sa"e le'el# +ithin its net an$estral $l&ster.

b. Qu$2- '-e#$#&'-&$ #ou/-%;:


%&/ A' ()C




6a$h node learns ao&t the net node to &se (typi$ally the $l&ster head the

ne+ $l&ster# in order to rea$h ea$h $l&ster at the sa"e le'el# +ithin its net

an$estral $l&ster.

4. What does po+er a+are ro&ting ai"? (AU-

May/ :&ne 201

!o "ae $o""&ni$ation "ore eI$ient

!rade-o et+een ro&ting o'erhead and data trans"ission $ost

*trategies in$&r diering le'els of $o""&ni$ation and storage o'erhead

5yrid approa$hes are possile

9. What is sheye state ro&ting proto$ol? (AU-

May/ :&ne 201

!he fre;&en$y of e$hanges de$rease +ith an in$rease in s$ope.

!he path infor"ation for far-a+ay nodes "ay e ina$$&rate.

)*J is s&itale for large and highly "oile ad ho$ +ireless net+ors. !he n&"er of hops +ith ea$h s$ope le'el has signi$ant in%&en$e on the

perfor"an$e.

<. What are the "aNor $hallenges of Tos ro&ting? (AU-

3o'. /,e$. 2012

,yna"i$ 'arying net+or topology

"pre$ise state infor"ation

*$are reso&r$es

Asen$e of $o""&ni$ation infrastr&$t&re La$ of $entralied $ontrol

Ko+er li"itations

5eterogeneo&s nodes and net+ors

6rror-prone shared radio $hannel

5idden ter"inal prole"

nse$&re "edi&"

Pther layers

F. AMJ* "ay to ehiit high pa$et deli'ery ratio e'en +hen all nodesrestri$t their "oility

to a s"all region. Why? (AU- 3o'./

,e$.2012

AMJ* Ad 5o$ M&lti$ast Jo&ting Kroto$ol Utiliing n$reasing , 3&"ers

3ational Uni'ersity of *ingapore

Heorgia nstit&te of !e$hnology

3o'e"er 1 Vdraft

P,MJK Pn-de"and M&lti$asting Jo&ting Kroto$ol

Uni'ersity of Balifornia at Los Angeles

:an&ary 2000 Vdraft


%&/ A' ()C




AMRIS ODMRP

B-; d-5e#e%&e

!opology *hared ,eli'ery !ree Mesh of 3odes

M$-% S-*-$#-/Moility s&pport Xes# ased on MA36!

,ri'en "ode Pn-de"and# do not store +hole net+or

topologyAd8$%/$;e2 si"ple topology

lo+ o'erheads

"oility

ro&stness

D-2$d8$%/$;e2 sensiti'e to "oility $o"ple topology

high o'erheads

. ,ierentiate proa$ti'e and rea$ti'e proto$ols. Write ea"ples for ea$h.

(AU- May/ :&ne

2012

7oth proa$ti'e and rea$ti'e ro&ting has spe$i$ ad'antages and

disad'antages that "ae the" s&itale for $ertain types of s$enarios. *in$e

proa$ti'e ro&ting "aintains infor"ation that is i""ediately a'ailale# the delay

efore sending a pa$et is "ini"al. Pn the $ontrary# rea$ti'e proto$ols "&st

rst deter"ine the ro&te# +hi$h "ay res&lt in $onsiderale delay if the

infor"ation is not a'ailale in $a$hes. Moreo'er# the rea$ti'e ro&te sear$h

pro$ed&re

"ay in'ol'e signi$ant $ontrol traI$ d&e to gloal %ooding. !his# together +ith

the long set&p delay# "ay "ae p&re rea$ti'e ro&ting less s&itale for real-ti"e

traI$. 5o+e'er# the traI$ a"o&nt $an e red&$ed y e"ploying ro&te

"aintenan$e s$he"es.

. 5o+ does energy a+are ro&ting +or? (AU-

May/ :&ne 2012

Mai"ise net+or lifeti"e (no a$$epted denition

Bo""&ni$ation is the "ost epensi'e a$ti'ity

Kossile goals in$l&de

i. *hortest-hop (fe+est nodes in'ol'ed

ii. Lo+est energy ro&te

iii. Jo&te 'ia highest a'ailale energy

i'. ,istri&te energy &rden e'enly

'. Lo+est ro&ting o'erhead

,istri&ted algorith"s $ost energy

Bhanging $o"ponent state $osts energy

10. List the ad'antages and disad'antages of +ireless ro&ting proto$ols.

Ad'antages


%&/ A' ()C




• *a"e as ,*,8

• 5as faster $on'ergen$e and fe+er tale &pdates

,isad'antages

• 3eed large "e"ory and greater $o"p&ting po+er e$a&se of the

"&ltiple tales

• At high "oility# the $ontrol o'erhead for &pdating

• !ale entries is al"ost the sa"e as ,*,8

• 3ot s&itale for highly dyna"i$ and large ad ho$ net+or

11. What are the iss&es in designing ro&ting proto$ol?

Moility

• Ad ho$ is highly dyna"i$ d&e to the "o'e"ent of nodes

• 3ode "o'e"ent $a&ses fre;&ent path reas

• !he path repair in +ired net+or has slo+ $on'ergen$e

7and+idth Bonstraint

• Wireless has less and+idth d&e to the li"ited radio and

• Less data rate and diI$&lt to "aintain topology infor"ation

6rror-prone shared road$ast radio $hannel

• Wireless lins ha'e ti"e 'arying $hara$teristi$s in ter"s of lin $apa$ity

and lin-error proaility

• !arget ntera$t +ith MAB layer to nd etter-;&ality lin

5idden ter"inal prole" $a&ses pa$et $ollision

5idden and eposed ter"inal prole"s

•

J!*-B!* $ontrol pa$et $annot ens&re $ollision freeJeso&r$e Bonstraints

• Li"ited attery life and li"ited pro$essing po+er

• !arget opti"ally "anage these reso&r$es

12. What are the ad'antages and disad'antages of dyna"i$ so&r$e ro&ting

proto$ol?(,*JK

Ad'antage

3o need to &pdating the ro&ting tales

nter"ediate nodes are ale to &tilie the Jo&te Ba$he nfor"ationeI$iently to red&$e the $ontrol o'erhead.

!here are no QhelloR "essages needed (ea$on-less

,isad'antage

!he Jo&te Maintenan$e proto$ol does not lo$ally repair a roen lin

!here is al+ays a s"all ti"e delay at the egin of a ne+ $onne$tion

1. 7ased on the ro&ting topology ho+ the ro&ting proto$ols are $lassied?

Moile ad ho$ net+ors ro&ting proto$ols are $hara$teristi$ally are s&di'ided

into "ain $ategories. !hey are Kroa$ti'e ro&ting proto$ols# Jea$ti'e ro&ting


%&/ A' ()C




proto$ols and 5yrid ro&ting--proto$ols. .

14. Hi'e the dieren$e et+een Ad ho$ on de"and ,istan$e 'e$tor ro&ting

proto$ol(AP,8 and dyna"i$ se;&en$e ro&ting proto$ol (,*J

Ad 'o& o% de*$%d D-2/$%&e

8e&/o# #ou/-%; ?#o/o&o(AOD+)

D%$*-& 2e@ue%&e #ou/-%;

?#o/o&o (DSR)

K&re on-de"and proto$ol

3ode does not need to "aintain

no+ledge of another node &nless

it $o""&ni$ates +ith it

AP,8 in$l&des ro&te dis$o'ery and

ro&te "aintenan$e.

AP,8 "ini"ies the n&"er of

road$asts y $reating ro&tes

on-de"and

AP,8 &ses only sy""etri$ lins

e$a&se the ro&te reply pa$et

follo+s the re'erse path of ro&te

re;&est pa$et

AP,8 &ses hello "essages to no+

its neighors and to ens&re

sy""etri$ lins.

on-de"and

A node "aintains ro&te $a$he

$ontaining the ro&tes it no+s

!+o "ain phases

• Jo&te dis$o'ery

• Jo&te "aintenan$e

7asi$ Pperation is si"ilar to

AP,8.

Main dieren$e

• !o &se ro&ting $a$he for lin

fail&re.

• When ro&te dis$o'ery phase#

node send ro&te re;&est"essage +ith its o+n

address.

19. What is hyrid ro&ting proto$ol?

Yone Jo&ting Kroto$ol or YJK is a hyrid Wireless 3et+oring ro&ting proto$ol

that &ses oth proa$ti'e and rea$ti'e ro&ting proto$ols +hen sending

infor"ation o'er the net+or.

1<. List the ad'antages and disad'antages of ,*,8 ro&ting proto$ols.

Ad'antages


%&/ A' ()C




!he a'ailaility of the ro&ters to all destinations at all ti"es i"plies that

"&$h less delay is in'ol'ed in the ro&te set &p pro$ess.

!he "e$hanis" of in$re"ental &pdates +ith se;&en$e n&"er tags "aes

the eisting +ired net+or proto$ol adaptale to ad ho$ net+ors.

5en$e +ired net+or proto$ol $an e applied to the ad ho$ net+or y less

"odi$ation.

,isad'antages A s"all net+or +ith high "oility or a lar4ge net+or +ith lo+ "oility

$an $o"pletely $hoe the a'ailale and+idth# 5en$e this proto$ol s&ers

fro" e$essi'e $ontrol o'erhead that is proportional to the n&"er of

nodes in the net+or.

n order to otain infor"ation ao&t a parti$&lar destination node# a node

has to +ait for a tale &pdate "essage initiated y the sa"e destination

node.

PART B

1. ,es$rie ho+ the pa$ets are trans"itted in "&ltiple a$$ess $ollision

a'oidan$e proto$ol.

(1< (AU- April/May 2014

,iagra" (4

!rans"ission (

6planation (4

2. 6plain the s$hed&ling tale &pdates "e$hanis" in distri&ted priority

s$hed&ling. (Z<

(AU- April/May

2014

,iagra" (4

6planation (<

*$hed&ling tale (<

. ,is$&ss in detail ao&t Uni$ast ro&ting Algorith".(1<(AU- 3o'./,e$ 201

,iagra" (

6planation (

Algorith" (9

4. Write *hort note on.

(i 6nergy A+are ro&ting algorith".( (AU- 3o'./,e$

201

,iagra" (4

6planation (4


%&/ A' ()C




(ii TP* A+are Jo&ting. ( (AU- 3o'./,e$

201

,iagra" (4

6planation (4

9. (i ,is$&ss the "aNor $hallenges that a ro&ting proto$ol designed for ad

ho$ +ireless net+or

fa$es. (10 (AU- May

/:&ne 201

MaNor $hallenges (4

6planation (<

(ii ,is$&ss the types of ad ho$ net+or ro&ting proto$ols ased on ro&ting

infor"ation

&pdate "e$hanis". (< (AU- May/:&ne 201

,ierent types (

6planation (

<. (i List the $hara$teristi$s of ideal ro&ting proto$ol for ad ho$ +ireless

net+or. (10

(AU- May /:&ne

201

Bhara$teristi$s (4

6planation (<

(ii Blassify and eplain ad ho$ +ireless net+or ased on ro&ting topology. (<

(AU- May /:&ne

201

Blassi$ation of ro&ting topology(

6planation (

F. (i With s&itale tra$e# eplain the ro&te estalish"ent in lo$ation aided

ro&ting. ( (AU- 3o'./,e$

2012

,iagra" O tra$e (4

6planation(4

(ii,e'i$e a pse&do $ode that present 'ario&s steps in'ol'ed in neighor

,egree- 7ased

preferred lin algorith". ( (AU- 3o'./,e$

2012

8ario&s steps (4

6planation (4


%&/ A' ()C




. 5o+ is ro&ting tale $onstr&$ted in sheye state ro&ting proto$ol? 6plain

in detail. (1<

(AU- 3o'./,e$

2012

Bonstr&$tion (4

,iagra" (4

6planation(

. (i 6plain on de"and ro&ting proto$ol in detail. (12 (AU-

May /:&ne 2012

Jo&ting proto$ol ,iagra" (4

6planation (

(ii Whi$h TP* "eas&re de$ides TP* a+are ro&ting? (4 (AU-

May /:&ne 2012

6planation (4

10. (i Why 5yrid ro&ting algorith" is &sed. :&stify.(< (AU-

May /:&ne 2012

5yrid ro&ting algorith" (<

(ii 7rie%y dis$&ss ao&t "&lti$ast ro&ting algorith"s.(10 (AU- May

/:&ne 2012

,iagra" (

"&lti$ast ro&ting algorith"s(F

UNIT I+ END4END DELI+ER AND SECURIT

PART A

1. What are the ee$ts of ind&$ed traI$ in Ad ho$ net+or? (AU-

April/May 2014

Ad ho$ +ireless net+ors &se "&lti-hop radio relaying# and a lin-le'el

trans"ission ae$ts neighor nodes of oth sender and re$ei'er of the lin.

!his ind&$ed traI$ ae$ts thro&ghp&t of the transport layer proto$ol.

2. ,ene Wor"hole atta$. (AU-

April/May 2014

An atta$er re$ords pa$ets (or its at one lo$ation in the net+or# t&nnels

the" to another lo$ation# and retrans"its the" into the net+or at that

lo$ation.

!he +or"hole atta$ is ;&ite se'ere# and $onsists in re$ording traI$ fro" one

region of the net+or and replaying it in a dierent region. t is $arried o&t y

an intr&der node X lo$ated +ithin trans"ission range of legiti"ate

nodes A and B# +here A and B are not the"sel'es +ithin trans"ission range of

ea$h other.


%&/ A' ()C




. Write ao&t ad ho$ transport proto$ols. (AU-

3o'. / ,e$ .201

Ad ho$ transport proto$ol (A!K is a proto$ol designed for ad ho$ +ireless

net+ors# it is not ased on !BK. A!K diers fro" !BK in "any +ays A!K &ses

$oordination et+een dierent layers# A!K &ses rate ased trans"issions and

assisted $ongestion $ontrol and nally# $ongestion $ontrol and reliaility are

de$o&pled in A!K.

4. What are the iss&es in ad ho$ net+ors? (AU-

3o'. / ,e$ .201

*e$&rity

Jo&ting

5idden ter"inal prole"

7and+idth

Ko+er li"itation

Borrooration of "oile de'i$es

9. List the oNe$ti'es of transport layer proto$ol. (AU-

May/ :&ne 201 !he follo+ing are the i"portant goals to e "et +hile designing a transport

proto$ol for ad ho$ +ireless net+ors

!he proto$ol sho&ld "ai"ie the thro&ghp&t per $onne$tion.

t sho&ld pro'ide thro&ghp&t fairness a$ross $ontending %o+s.

t sho&ld ha'e "e$hanis"s for $ongestion and %o+ $ontrol in the net+or.

<. Why does !BK-) pro'ide a si"ple feeda$ ased sol&tion? (AU-

May/ :&ne 201

!BK-) pro'ides a si"ple feeda$ ased sol&tion to "ini"ie the

prole"s arising o&t of fre;&ent path reas in ad ho$ +ireless net+or. At the

sa"e ti"e it per"its the $ongestion $ontrol "e$hanis" to respond to

$ongestion in the net+or. !BK-) depends on the inter"ediate nodes to dete$t

the ro&te fail&res and ro&ting proto$ol in order to re-estalish the roen path

+ithin a reasonaly short d&ration.

F. What are the iss&es in designing transport layer proto$ol? (AU-

3o'./ ,e$ 2012

!he iss&es in designing a transport layer proto$ol for Ad ho$ +ireless net+ors

are listed elo+. !he transport layer proto$ol needs to tae into a$$o&nt# nd&$ed traI$

nd&$ed thro&ghp&t &nfairness

*eparation of $ongestion $ontrol# reliaility# and %o+ $ontrol

Misinterpretation of $ongestion

Bo"pletely de$o&pled transport layer

Ko+er and and+idth $onstraints

,yna"i$ topology

. Bo""ent on the &se of nat&ral lang&age pass+ords dire$tly for$ryptographi$ algorith"s.

(AU- 3o'/ ,e$

2012


%&/ A' ()C




5&"an eings tend to fa'or nat&ral lang&age phrases as pass+ord# o'er

rando"ly generated strings. *&$h pass+ords# if &sed as eys dire$tly d&ring

session# are 'ery +ea O open to atta$ e$a&se of high red&ndan$y# and the

possiility of re&se o'er dierent sessions.

. Why does !BK not +or +ell in ad ho$ net+or?

(AU- May/ :&ne 2012 !he !rans"ission Bontrol Kroto$ol (!BK raises a n&"er of iss&es +hen

re;&ired to +or in a +ireless en'iron"ent. n parti$&lar# +ithin an ad-ho$

net+or# +here $hanges $an happen so"e+hat ;&i$ly and &npredi$taly# it

has to deal +ith ne+ to&gh $hallenges s&$h as high proaility of oth net+or

partition and ro&te fail&res d&e to "oility.

10. What is yantine atta$? (AU-

May/ :&ne 2012

A 7yantine fa&lt is an aritrary fa&lt that o$$&rs d&ring the ee$&tion of

an algorith" y a distri&ted syste". t en$o"passes oth o"ission fail&res

(e.g.# $rash fail&res# failing to re$ei'e a re;&est# or failing to send a response

and $o""ission fail&res (e.g.# pro$essing a re;&est in$orre$tly# $orr&pting lo$al

state# and/or sending an in$orre$t or in$onsistent response to a re;&est. When

a 7yantine fail&re has o$$&rred# the syste" "ay respond in any &npredi$tale

+ay# &nless it is designed to ha'e 7yantine fa&lt toleran$e.

11. What are the types of atta$s in ad ho$ +ireless net+ors?

!here are t+o +ays in +hi$h fa&lt "ay o$$&r in ad ho$ net+or# they are#

3. D$/$ /#$& $//$&1

7la$-5ole

Booperati'e 7la$-5ole

Hray-5ole

:ellysh atta$

. Co%/#o /#$& $//$&1

Wor"-5ole # 56LLP )lood # 7og&s Jegistration

Man in Middle # J&shing # Ba$he Koisoning

7la$"ail # Booperati'e 7la$"ail # *yil atta$

12. What do yo& "ean y passi'e atta$s?

A passi'e atta$ does not disr&pt the nor"al operation of the net+or

the atta$er snoops the data e$hanged in the net+or +itho&t altering it. 5ere

the re;&ire"ent of $ondentiality gets 'iolated. ,ete$tion of passi'e atta$ is

'ery diI$&lt sin$e the operation of the net+or itself doesn=t get ae$ted. Pne

of the sol&tions to the prole" is to &se po+erf&l en$ryption "e$hanis" to

en$rypt the data eing trans"itted.

1. What do yo& "ean y a$ti'e atta$s?

An a$ti'e atta$ atte"pts to alter or destroy the data eing e$hanged in

the net+or there y disr&pting the nor"al f&n$tioning of the net+or. A$ti'e

atta$s $an e internal or eternal. 6ternal atta$s are $arried o&t y nodes


%&/ A' ()C




that do not elong to the net+or. nternal atta$s are fro" $o"pro"ised

nodes that are part of the net+or.

14. ,ene ,enial of atta$.

,enial-of-Messages (,oM atta$s. Mali$io&s nodes "ay pre'ent other

honest ones fro" re$ei'ing road$ast "essages y interfering +ith their radio.

,enials of *er'i$e (,o* atta$s are $o""on pla$e in the nternet.H&arding against ,o* atta$s is a $riti$al $o"ponent of any se$&rity syste".

While ,o* has een st&died etensi'ely for the +ire-line net+ors. ,&e to

deploy"ent in ta$ti$al attleeld "issions these net+ors are s&s$eptile to

atta$s of "ali$io&s intr&ders.

19. ,ene se$&re ro&ting.

Q*e$&re ro&ting ens&res that +hen a non-fa&lty node sends a "essage to ey

k # the "essage rea$hes all non-fa&lty "e"ers is the set of repli$a roots Rk

+ith 'ery high proailityR

Krole"s in ad-ho$ +ireless net+ors

• La$ of ed infrastr&$t&re s&pport

• )re;&ent $hanges to net+or topology

• Koor prote$tion to proto$ol pa$ets at physi$al layer

PART B

1. (i,is$&ss the ee$t of "&ltiple reas on a single path at the !BK- ) sender. (

(AU- April/May

2014

,iagra" (

6planation(<

(iiWhat is the i"pa$t of the fail&re of proy nodes in split- !BK? ( (AU-

April/May 2014

"pa$t fa$tors (4

6planation (4

2. (i 6plain ho+ the se$&rity pro'isioning in ad ho$ net+or diers fro" that in

nfrastr&$t&re ased net+or. ( (AU-

April/May 2014

,iagra" (4

6planation (4

(iiList o&t and eplain ho+ so"e of the internet properties of the +ireless Ad

ho$ net+ors

introd&$e diI$&lties +hile i"ple"enting se$&rity in ro&ting proto$ols. (

(AU- April/May

2014 nternet properties (4

6planation (4


%&/ A' ()C




. What are the design iss&es in transport layer? (1< (AU- 3o'./,e$

201

,iagra" (4

6planation (<

,esign iss&es (<

4. (i6plain in detail ao&t net+or se$&rity atta$s. ( (AU-3o'./,e$ 201

,iagra" (

6planation (9

(ii6plain the signi$an$e and design goals of transport layer proto$ol for ad

ho$ net+or.

( (AU- 3o'/,e$

201

,iagra" (4 *igni$an$e (2

,esign Hoals (2

9. 6plain the iss&es in designing a transport layer proto$ol for ad ho$ +ireless

net+ors. (1<

(AU- May/ :&ne

201

,iagra" (4

6planation ( ,esign iss&es (4

<. Why does !BK not perfor" +ell in ad ho$ +ireless net+or? 6plain. (1<

(AU- May/ :&ne

201

,iagra" (4

6planation(

:&sti$ation(4

F. With any 'e "aNor reasons# analye +hy !BK is eposed to signi$ant

thro&ghp&t

,egradation in ad ho$ net+ors. (1< (AU- 3o'/,e$

2012

,iagra" (4

MaNor reasons (

6planation (4

. 6plain 'ario&s net+or and !ransport layer se$&rity atta$s in detail. (1<(AU- 3o'/,e$ 2012

,iagra" (4


%&/ A' ()C




3et+or layer se$&rity (

!ransport layer se$&rity (

. (i ,is$&ss in detail feeda$ ased !BK and !BK 7U* in detail. (12 (AU-

May/ :&ne 2012

,iagra" (4

)eeda$ ased !BK (4 !BK 7&s (4

(iiWhy se$&re ro&ting proto$ols are needed? (4 (AU- May/

:&ne 2012

6planation (4

10. (i ,is$&ss rie%y ad ho$ !BK states and e'ent a$tion "apping. (

(AU- May/ :&ne 2012

,iagra" (2

6planation ( 6'ent a$tion "apping (

(ii,is$&ss in detail 'ario&s net+or and appli$ation layer se$&rity atta$s. (

(AU- May/ :&ne

2012

,iagra" (2

8ario&s net+or (

appli$ation layer atta$s (

UNIT 9 + CROSS LAER DESIGN AND INTEGRATION OF ADHOC FOR 7G

PART A

1. What the needs are for $ross layer design? (AU- 3o'./,e$ 201 #

April/May 2014

P* net+oring "odel# stri$t o&ndaries et+een layers are enfor$ed# +here

data are ept stri$tly +ithin a gi'en layer. Bross layer opti"iation re"o'es

s&$h stri$t o&ndaries to allo+ $o""&ni$ation et+een layers y per"itting

one layer to a$$ess the data of another layer to e$hange infor"ation andenale intera$tion. )or ea"ple# ha'ing no+ledge of the $&rrent physi$al

state +ill help a $hannel allo$ation s$he"e or a&to"ati$ repeat re;&est (AJT

strategy at the MAB layer in opti"iing tradeos and a$hie'ing thro&ghp&t

"ai"iation

2. What are the para"eter opti"iation te$hni;&es a'ailale? (AU-

April/May 2014

8ariational adNoint (8A te$hni;&e

Mi$ro geneti$ algorith" (Mi$ro HA

. What is $ross layer feeda$? (AU-

3o'./,e$ 201


%&/ A' ()C






. What is +ireless internet? (AU-

May/:&ne 2012

Wireless nternet enales +ireless $onne$ti'ity to the nternet 'ia radio +a'es

rather than +ires on a personEs ho"e $o"p&ter# laptop# s"art phone or si"ilar

"oile de'i$e. Wireless nternet $an e a$$essed dire$tly thro&gh pro'iders.

. ,ene Wireless datagra" proto$ol (W,K (AU- May/:&ne

2012

Wireless ,atagra" Kroto$ol denes the "o'e"ent of infor"ation fro" re$ei'er

to the sender and rese"les the User ,atagra" Kroto$ol in the

nternet proto$ol s&ite. !he Wireless ,atagra" Kroto$ol (W,K# a proto$ol in

WAK ar$hite$t&re# $o'ers the !ransport Layer Kroto$ols in the nternet "odel.

10. What do yo& "ean y ti"e to li'e (!!L?

!i"e to li'e denes the n&"er of 5ops a parti$&lar pa$et $an tra'erse.

11. ,ene t&nneling.

!&nneling is a proto$ol that allo+s for the se$&re "o'e"ent of data fro" one

net+or to another. !&nneling in'ol'es allo+ing pri'ate net+or

$o""&ni$ations to e sent a$ross a p&li$ net+or# s&$h as the nternet#

thro&gh a pro$ess $alled en$aps&lation. !he en$aps&lation pro$ess allo+s for

data pa$ets to appear as tho&gh they are of a p&li$ nat&re to a p&li$

net+or +hen they are a$t&ally pri'ate data pa$ets# allo+ing the" to pass

thro&gh &nnoti$ed. !&nneling is also no+n as port for+arding.

12. Hi'e the $ategories of hando.

5andos "ay e $lassied into t+o types

5ard 5ando Bhara$teried y an a$t&al rea in the $onne$tion +hile

s+it$hing fro" one $ell or ase station to another. !he s+it$h taes pla$e

so ;&i$ly that it $an hardly e noti$ed y the &ser. 7e$a&se only one

$hannel is needed to ser'e a syste" designed for hard handos# it is the

"ore aordale option. t is also s&I$ient for ser'i$es that $an allo+ slight

delays# s&$h as "oile roadand nternet.

*oft 5ando 6ntails t+o $onne$tions to the $ell phone fro" t+o dierentase stations. !his ens&res that no rea ens&es d&ring the hando.

3at&rally# it is "ore $ostly than a hard hando.

1. What is proto$ol opti"ier?

Kroto$ol Ppti"iation is the &se of in-depth proto$ol no+ledge to a$$elerate

&ser response ti"e. 7y &nderstanding the intri$a$ies of ho+ spe$i$ proto$ols

f&n$tion# )or appli$ations in +hi$h re;&ests are typi$ally serialied (5!!K# B)*#

or for traditionally Q$hattyR appli$ations originally designed for LA3s (B)*#MAK# the perfor"an$e i"pro'e"ent gained y Kroto$ol Ppti"iation.

14. Why ad ho$ net+or is integrated +ith "oile K?


%&/ A' ()C

http://www.webopedia.com/TERM/W/wireless.html

http://www.webopedia.com/TERM/S/smartphone.html

http://www.webopedia.com/TERM/W/wireless.html

http://www.webopedia.com/TERM/S/smartphone.html




Users +ith portale de'i$es# lie laptops and personal digital assistants (K,A#

$onne$ting to foreign net+ors in the nternet +ant the sa"e f&n$tionality as

+hen $onne$ted to the ho"e net+or# as +ell as a$$essiility thro&gh the

ho"e K address. Ad ho$ net+oring is also of "aNor i"portan$e for

$onne$ti'ity et+een $o""&ni$ating "oile hosts +itho&t a$one

infrastr&$t&re and for $onne$ti'ity to a$$ess points. ,&e to this reasons ad ho$

net+or is integrated +ith "oile K.

19. What are the fa$tors that ae$t ee$ti'e $ross layer design?

3et+or perfor"an$e.

3et+or and en'iron"ental $ondition.

nfor"ation sharing et+een the $ross-layers.

3on-adNa$ent layer $o""&ni$ation.

PART B

1. ,es$rie ho+ to integrate Ad ho$ +ith "oile K. What are the ad'antages?

(1<

(AU- April/May

2014

,iagra" (4

6planation (

Ad'antages (4

2. (i 6plain any one of the $ross layer opti"iation "ethod and ho+ it i"pro'e

the

perfor"an$e of the ro&ting Ad ho$ net+ors. (10 (AU-

April/May 2014

,iagra" (2

Ppti"iation "ethod (4

Kerfor"an$e (4

(ii6plain the operation of opti"iing s& syste" (P**. (< (AU-

April/May 2014

,iagra" (2

Pperation (4

. Hi'e detailed des$ription of Bross layer opti"iation.(1< (AU-

3o'./,e$ 201

,iagra" (4

6planation (12

4. 6plain in detail ao&t integration of ad ho$ +ith "oile K 3et+ors.(1<

(AU- 3o'/,e$

201

,iagra" (4


%&/ A' ()C




6planation (12

9. (i7rie%y dis$&ss ao&t $ross o'er ti"e predi$tion.(10 (AU-

May/:&ne 201

,iagra" (4

6planation (4

!i"e predi$tion (2

(iiList the iss&es of &t"ost i"portan$e in "oile K. (< (AU-

May/:&ne 201

ss&es (

"portan$e (

<. 6plain BPA# re'erse t&nneling and ro&te opti"iation.(1< (AU-

May/:&ne 201

,iagra" (4

6planation of BPA (4

re'erse t&nneling (4

ro&te opti"iation (4

F. 6plain the signi$ant $hallenges of generi$ $ross layer design.(1< (AU-

3o'/,e$ 2012

,iagra" (4

6planation (<

*igni$ant $hallenges (<

. (i 6plain the feat&res of a $ross-layer "odel designed for "&lti&ser

s$hed&ling. Also

5ighlight ho+ eI$ien$y is i"pro'ed thro&gh this "odel. ( (AU-

3o'/,e$. 2012.

,iagra" (2

6planation (2

)eat&res (2

6I$ien$y i"pro'e"ent (2

(ii 5o+ lin/MAB layer opti"iation is a$hie'ed +ith respe$t to its higher

layers and

Khysi$al layer? Also +rite its i"pa$t on it rate and po+er $ontrol. (AU-

3o'./,e$ .2012

,iagra" (2

6planation (4

Ppti"iation (2

. ,is$&ss in detail the integration of ad ho$ +ith "oile K net+ors. (1<(AU- May/:&ne

2012

,iagra" (4


%&/ A' ()C




6planation (4

ntegration +ith "oile K (

10. (i ,is$&ss rie%y $ross layer opti"iation te$hni;&e in detail. (10

(AU- May/:&ne 2012

,iagra" (4

6planation ( Ppti"iation te$hni;&e (

(ii:&stify the need for $ross layer design. (< (AU- May/:&ne

2012

,iagra" (2

:&sti$ation (4

SUMMAR:

UNIT

NO.

NO. OF

QUESTIONS IN

MARKS

NO. OF

QUESTIONSIN 3 MARKS

19 10

19 10

19 10

8 19 10

8 19 10

TOTAL " "!

No. o 2$*?e u%-8e#2-/ @ue2/-o% P$?e#2:


%&/ A' ()C




STAFF INCHARGE HODECE

Documents

Adhoc Question Bank EC2050