COURSE CODE

(P15CS743)

P.E.S COLLEGE OF ENGINEERING, MANDYA-571 401

(An Autonomous Institution under VTU, Belgaum)
Seventh Semester B.E (CS&E)
Model Question Paper
Wireless Sensor Network (Elective-IV)
Time:3 hrs Max.Marks:100
Note: Answer Five full questions selecting ONE full question from question from each Unit
UNIT – I Mark Levels
s
1a List and explain any five the characteristics that are shared among 10 L1
most of the applications.
b Explain the mechanisms that form typical parts of WSN. 10 L4
2a What is transceiver? List the characteristics of a transceiver and 10 L1&L
explain any 4 of them. 4
b Explain inadequate programming models for WSN operating system 10 L4
with a neat diagram.
UNIT II
3a Explain types of mobility for a sensor network. 6 L2
b Discuss the different optimization goals and figures of merit for a 14 L6
WSN.
4a List and explain the basic wave propagation phenomena 10 L2
b Discuss the different synchronization problems that are associated 10 L6
with receivers in WSN.
UNIT III
5a Describe the hidden terminal and exposed terminal problem s in 10 L2
wireless networks
b . Differentiate between contention based protocols and schedule 10 L4
based protocols.
6a Discuss how LEACH protocol is energy efficient protocol 10 L6
b Explain the link management by the link layer protocol 10 L2
UNIT IV
7a Explain in detail Gossiping and agent-based unicast forwarding 10 L2
b Discuss how a unicast routing can be energy-efficient 10 L6
8a Explain prim’s minimum cost spanning tree algorithm for broad 10 L6
routing in WSN
b List and explain the different categories of aggregation operations and 10 L2 &
discuss their advantages and disadvantages L5
UNIT V
Define
9a Localization. List and explain different Possible approaches to 8 L2
determine a node’s position
Three
9b anchors with known positions (x, yi ), i = 1, . . . , 3, and a node at 12 L6
unknown position (xu, yu), and perfect distance values ri , i = 1, . . . , 3
are given derive the expression to get the position of the unknown
node. Using the derived equations compute the position of a node
with 3 anchors at given position as (x1, y1) = (2, 1), (x2, y2) = (5, 4),
 and (x3, y3) = (8, 2) with the distances between anchors and node of
unknown position r1 = √10, r2 = 2, r3 = 3.
Define
10 a topology control. Explain the different approach to the problem of 10 L2 &
topology control. L4
Define
b Critical Transmitting Range (CTR) and explain the different methods 10 L2
to fix CTR.