Final Take Home Exam for Wireless Sensor Networks

October 2007
Note: o! are re"!ire# to finis$ t$e exam in#e%en#entl&' (n& form of
collaboration wit$ ot$ers is strictl& forbi##en)
Name: ***************************

St!#ent +,: ***********************
-roblem . /0!lti%le 1$oices2 20 %oints2 2 %oints eac$3: For each question, please select all
the correct choices out of the five choices. Note that the answer(s) to each question may not be
unique.
(1) Which of the following statement(s) are true for a wireless link over sensor net?
Your choice !!!!!!!!!
(") #he percentage of as$mmetric links is ver$ small% (&) 'ink as$mmetries are mainl$
cause( )$ har(ware cali)ration% (*) time varia)ilit$ is not correlate( with the (istance from
the transmitter% (+) time varia)ilit$ is correlate( with the mean reception rate% (,) wireless
channel is isotropic.
(-) Which of the following is the most (ominant factor in energ$ waste of a sensor ."*?
Your choice !!!!!!!!
(") long i(le perio(% (&) collisions% (*) retransmissions for corrupte( packets% (+)
overhearing all transmitte( traffic% (,) control packet overhea( such as /#0 an( *#0.
(1) 2ow (oes (irecte( (iffusion select a high3qualit$ path? Your choice !!!!!!!!!!!!!!
(") 4t floo(s the interest to ever$ no(e to learn the )est3qualit$ path% (&) 4t can onl$ select
one gra(ient at each no(e to its (ownstream no(e% (*) 4t positivel$ reinforces the high3
qualit$ path% (+) #he high3qualit$ path self3recovers from no(e failures% (,) 4t can never
eliminate route loops.
(5) Which statement is true? Your choice !!!!!!!!!!!!!!!!!!!!!!!!!
(") *onnectivit$ (oes not ensure coverage% (&) coverage ensures connectivit$ when /c 6
-/s% (*) **7 alwa$s ensures )oth connectivit$ an( coverage% (+) **7 has to )e use( with
07"N together when /c 8 -/s% (,) #he )oun(ar$ (oes not nee( to )e covere( )$ enough
sensors to ensure connectivit$ an( coverage.
(9) Which statement on :ig)ee stan(ar( is N;# true? Your choice !!!!!!!!!!!!!!!
(") 4t can support multiple (ata rates% (&) 4t can operate at (ifferent frequenc$ )an(s% (*) 4t
onl$ supports star topolog$% (+) 4n the contention perio(, it uses a reservation3)ase( ."*%
(,) 4t can onl$ support perio(ic traffic.
(<) Wh$ is the relia)ilit$ notion in ,0/# (ifferent from that in #*7? Your choice !!!!!!!!!
(") ,0/# (oes not support application3specific relia)ilit$ notion% (&) ,0/# is the same as
=+7 an( (oes not support relia)ilit$% (*) ,0/# supports application3(efine( partial
relia)ilit$% (+) ,0/# (oes not support en(3to3en( relia)ilit$% (,) ,0/# (oes not measure
event reports at the sink.
(>) Wh$ is a simple ."* not secure for wireless )roa(cast? Your choice !!!!!!!!!!
(") "ttackers can generate false messages an( )roa(cast to others% (&) "ttackers can overhear
the message% (*) "ttackers can (elete the )roa(cast message% (+) "ttackers can (ela$ the
(eliver$ of the )roa(cast message% (,) "ttackers can (ecipher all the secret ke$s )etween the
)ase station an( each sensor.
(?) 2ow (oes 03."* ena)le in3network processing? Your choice !!!!!!!!!
(") through perio(ic sleeping% (&) through a(aptive listening% (*) through coor(inate(
sche(ule% (+) through message passing% (,) through /#03*#0 control packets.
(@) Which of the following time components (oes reference )roa(cast s$nchroniAation (/&0)
remove from the critical path? Your choice !!!!!!!!!!!!!!!!
(") sen( time% (&) access time% (*) propagation time% (+) receive time% (,) all of the a)ove.
(1B) Which of the following statement(s) are wrong on localiAation?
Your choice !!!!!!!!!!!!!!!!
(") (ifferent applications ma$ have (ifferent requirements on localiAation in terms of
granularit$ an( scale, accurac$ an( precision, etc. (&) 4n active localiAation, s$stems (erive
location from o)servation of signals that are alrea($ present% (*) 4n cooperative target active
localiAation, target sen(s a signal with unknown characteristics% (+) 4n passive self3localiAation,
a no(e estimates (istances to a set of )eacons% (,) 4n )lin( localiAation, s$stem estimates
location of the target with some priori (omain knowle(ge of the target.
-roblem 2 /S$ort answer: 40 %oints2 4 %oints eac$3: 7lease briefly answer each question.
(1) Wh$ is the en(3to3en( transport consi(ere( harmful for sensor networks? What is the
possi)le solution?
(-) +escri)e three spatial characteristics of a wireless link in a sensor network.
(1) 2ow to avoi( overhearing unnecessar$ traffic in 03."*?
(5) +escri)e what is the )asic i(ea to han(le sink mo)ilit$.
(9) +escri)e how (ata is manage( in a sensor network through naming.
(<) 4s the 074N0 securit$ solution ro)ust to packet loss when performing )roa(cast (ata
authentication? Custif$ $our answer. You can Dustif$ it via a simple eEample scenario.
(>) You are require( to use :ig)ee har(ware no(es to construct a static wireless sensor network.
2ow (o $ou (esign the network topolog$ to achieve highest level of energ$ savings among
all no(es in the sensor network?
(?) When /c 8 -/s (/c is the communication range of a sensor no(e, an( /s is the sensing
range), how can $ou ensure )oth k3coverage an( k3connectivit$ (i.e., each area is covere( )$
k sensing no(es an( each no(e has k neigh)or no(es for communications)?
(@) +escri)e the main steps in (efen(ing against fa)ricate( event attacks. "ssume that there are
at most F compromise( no(es that are working together in the network.
(1B) +escri)e two metho(s on )uil(ing gra(ient3)ase( routes for wireless sensor networks.
-roblem 4 /.0 %oints3: ,irecte# ,iff!sion an# to%olo5& control' 4n the following Figure, ,
is the source sensor that generates sensing reports, an( 0 is the sink no(e that nee(s the sensing
reports from ,.
0ensor no(es "1, "-, "1, G, "-B can communicate with each other% 0ensor no(es &1, &-, &1,
G, &-B can also communicate with each other. "n( no(e "i can N;# communicate with &i (iH1,
-, G, -B).
"1 G "@ "1B G "1@ "-B
"1 "-
&1B 0
, &1
&- &1 G &@ &11 G &1@ &-B
*
(1) 4nitiall$, "ll no(es "1, G "-B an( &1, G, &-B are all active, )ut other no(es are
sleeping. +escri)e how (irecte( (iffusion )uil(s up the gra(ient an( sets up the path.

(-) 0uppose the path from , "1"- G "-B0 is worse than the path , &1&-G
&-B0, how (oes (irecte( (iffusion select the )etter path?
(1) Now &1B fails (ue to lack of energ$, another no(e * starts to work after the topolog$
control algorithm works. "ssume that the path , "1"- G "-B0 is not use(.
+escri)e how (irecte( (iffusion inclu(es * in the path (that is, the current path )ecomes
,&1G&@*&11&1- G &-B0) without using IinterestJ floo(ing.
(5) Now )oth * an( &1B are waking up (&1B is repaire( now). #here is a route loop
&@*&1B&@. 2ow (oes (irecte( (iffusion eliminate the route loop?
-roblem 6 /.0 %oints3: Trans%ort' "ssume that the (esire( event relia)ilit$ / is -BKsecon(.
"ppl$ ,0/# in the following cases.
(1) "ssume that there is no congestion in the sensor network at #1. 4f the o)serve( event
relia)ilit$ is 1BKs at #1. 2ow (oes ,0/# up(ate the reporting rate at the source sensor?
(-) "ssume that there is no congestion in the sensor network at #-. Now the o)serve( event
relia)ilit$ is 1BKs at #-. 2ow (oes ,0/# up(ate the reporting rate at the source sensor?
(1) "ssume that there is congestion (etecte( in the sensor network at #1. Now the o)serve(
event relia)ilit$ is -9Ks at #1. 2ow (oes ,0/# up(ate the reporting rate at the source
sensor?
-roblem 7 /.0 %oints3: 1onnecti8it& an# 1o8era5e' 4n the connectivit$ an( coverage
protocols we talke( a)out in class, the authors assume that wireless communication has isotropic
connectivit$ (that is, the communication is possi)le in all 1<B3(egree (irections when the range is
less than a single value /c). +escri)e a solution that can ensure )oth connectivit$ an( coverage
when the wireless communication is non3isotropic. (You can mo(if$ the solution (iscusse( in the
paper)
-roblem 9 /.0 %oints3: Sec!rit& 4n the hash3chain )ase( (ata authentication scheme (escri)e(
in 074N0, the sen(er an( the receiver are one3hop awa$ in wireless communications. *an $ou
eEten( the solution to the multihop wireless sen(er3receivers case (that is, the )roa(cast sen(er
an( the receivers are multile hops awa$)?
-roblem 7 /.0 %oints3: Time S&nc$roni:ation #he reference )roa(cast s$stem (/&0)
s$nchroniAation assumes that all no(es are static. 2ow well (oes the /&0 solution works for a
mo)ile receiver? "ssume that onl$ one receiver is mo)ile, while the sen(er an( other receivers are
all static.