Beruflich Dokumente
Kultur Dokumente
3 In wireless sensor networks, some of the compile run time Ideal time Setup B
information defining the objective time time
function and constraints is available only
at___________
4 To ensure the ___________of the system, responsive scalability both a and neither A C
the communication and computation ness b nor B
should be localized to relevant sensors
only
11 periodic D
The S-MAC protocol includes following collision overheating all of
listen and
major components avoidance avoidance above
sleep
13 Examples of data attributes may include node's node's type certain all of D
location of sensors range of above
values in a
certain type
of sensed
data
17 This is what happens if two devices on the Overlap crossover collision None of C
same Ethernet network determine the the above
network is free, but attempt to transmit
data at exactly the same time.
18 Carrier A
Sense Discontinu
This describes how the Ethernet protocol
Multiple ous Wait and
regulates communication among Aggregator
Access/Col transmissio response
connection points.
lision n
Detect
21 In ________ each station sends a frame pure slotted both (a) neither (a) A
whenever it has a frame to send. ALOHA ALOHA and (b) nor (b)
23 In __________, each station is forced to pure slotted both (a) neither (a) B
send only at the beginning of the time ALOHA ALOHA and (b) nor (b)
slot.
24 In ________, a station monitors the CSMA/CA CSMA/CD either (a) both (a) B
medium after it sends a frame to see if the or (b) and (b)
transmission was successful. If so, the
station is finished. If, however, there is a
collision, the frame is sent again.
25 To avoid collisions on wireless networks, CSMA/CA CSMA/CD either (a) both (a) A
________was invented. or (b) and (b)
26 In _______, collisions are avoided CSMA/CA CSMA/CD either (a) both (a) A
through the use of three strategies: the or (b) and (b)
interframe space, the contention window,
and acknowledgments.
30 In the ______ method, all data exchanges reservation polling token none of B
must be made through the primary device passing the above
even when the ultimate destination is a
secondary device.
35 In _____, each station transmits its data in FDMA TDMA CDMA none of B
its assigned time slot. the above
37 You have 5 information signals and only Frequency Multiplexin Amplificati Amplitude B
one transmitter. What technique will help modulatio g on modulatio
in transmitting all the 5 signals? n n
45 What is the term used to identify the RFI RFID FCC ISM A
broadcast or generated electrical signals
that can disrupt wireless
communications?
48 Which one of the following RF band is 4.9 GHz to 824 MHz 174 MHz 2.4 GHz to D
allocated to the Industrial, Scientific and 5.825 GHz to 849 to 220 2.4835
Medical industry? MHz MHz GHz
49 Since a wireless ad-hoc network is Forwarding Protocols Switching Range A
decentralized and its topology is dynamic,
each of the wireless nodes must perform
its own message __________.
50 What is the networking device used to Hub Lan switch NAP Router D
forward packets on a packet-switching
network?
52 What is the term used to describe the Frequency Amplitude Wavelengt Modulatio B
height of a radio wave? h n
60 What is the receive signal strength The SSID of The The The C
indicator used to measure? the access weakest strongest channel
point with signal on signal on a which the
the any particular least
strongest channel channel at signal to
signal. within the a specific noise
range of an location. ratio.
access
point.
62 Which of these is not true for Time- TDD uses Single It increases A C
Division Duplex (TDD)? different radio the battery Duplexer
time slots frequency life of is required
for can be mobile
transmissi used phones
on and
reception
paths
77 select the correct statement Since the For time A and B neither A A
nodes synchronizat Both nor B
operate ion, the
independen wired
tly, their protocols
clocks may assume the
not be existence of
synchronize highly
d with one accurate
another master
clocks on
some
network
nodes such
as skew
clock
78 select the correct statement Since the For time A and B neither A C
nodes synchronizat Both nor B
operate ion, the
independen wired
tly, their protocols
clocks may assume the
not be existence of
synchronize highly
d with one accurate
another master
clocks on
some
network
nodes such
as atomic
clock
79 The latency in channel can be decomposed send time access time propagation alln of D
into following components and receive time above
time
80 The latency in channel can be decomposed Send time Receive A and B neither A C
into following components and access time and Both nor B
time propagation
time
81 The Send time is This is the This is the This is the This is the A
time taken delay time for time for
by the incurred message to the
sender to while travel across network
construct waiting for the channel interface
the access to to the on the
message the destination receiver
transmission node side to get
channel due the
to message
contention, and notify
collisions etc the host of
its arrival
82 The Access time is This is the This is the This is the This is the B
time taken delay time for time for
by the incurred message to the
sender to while travel across network
construct waiting for the channel interface
the access to to the on the
message the destination receiver
transmission node side to get
channel due the
to message
contention, and notify
collisions etc the host of
its arrival
83 The Propagation time is This is the This is the This is the This is the C
time taken delay time for time for
by the incurred message to the
sender to while travel across network
construct waiting for the channel interface
the access to to the on the
message the destination receiver
transmission node side to get
channel due the
to message
contention, and notify
collisions etc the host of
its arrival
84 The Receive time is This is the This is the This is the This is the D
time taken delay time for time for
by the incurred message to the
sender to while travel across network
construct waiting for the channel interface
the access to to the on the
message the destination receiver
transmission node side to get
channel due the
to message
contention, and notify
collisions etc the host of
its arrival
85 Fading Reflection & Scattering & all of D
(frequency refraction diffraction above
dependent) depending
Receiving power additionally influenced by
& on the
shadowing density
86 Incorrect statement about Time and Better Protection Higher data No precise D
frequency multiplexing in combination is protection against rates coordinatio
against frequency compared n required
tapping selective to code
interference multiplex
89 Throughput is defined as the number of bits Received Lost per Transmitted Retransmitt C
or bytes successfully per time time unit T per time ed per time
unit T unit T unit T
90 Design Criteria for Medium Access Protocols Maximize Maximize Minimize Maximize A
the the the the
throughput throughput throughput throughput
by by Maximize by by
minimizing the delay minimizing Maximize
the delay and the delay the delay
and energy minimizing and energy and energy
spent. energy spent. spent.
spent.
91 Design Criteria for Medium Access Protocols Maximize To minimize To maximize Avoid the B
the the time in the time in switched
throughput listening listening off devices
by Maximize mode as mode as handling
the delay much as much as
and energy possible. possible.
spent.
95 When a node has a packet to send, it listens If the If the If the If the C
for traffic on the channel. channel is channel is channel is channel is
free, it free, it free, it free, it
initially initially initially initially
sends waits for sends waits for
message, message, message, message,
CTS. CTS. RTS. RTS.
99 An inherent problems with S-MAC is It does not Internal The internal The C
allow sensor clocks are clock of the internal
nodes to not present. nodes are clock of the
sleep for not nodes are
extensive synchronize synchroniz
amounts of d. ed.
time.
100 Timeout-MAC (T-MAC) letting the nodes During their During their Before the After the B
timeout when nothing happens sleep active active active
periods. periods. period. period.
101 Berkeley MAC (B-MAC) was developed to T-MAC S-MAC LPL All of above B
tackle the problems of
102 Long preamble used in Berkeley MAC (B- Application Other Has fixed Has D
MAC) has long preamble consist of data payloads length and variable
may carry length and
sender, may carry
receiver, sender,
and packet receiver,
size and packet
information size
information
103 Long preamble used in Berkeley MAC (B- Wakeup Less than Sleeping Less than C
MAC) has to be send at least for duration of time wakeup time sleeping
time time
106 The packet reception ratio (PPR) is depicted At long At short At long PPR is C
against the distance distance distance distance independe
between between between nt of
nodes, the nodes, the nodes, the distance
PRR PRR PRR between
increases decreases decreases nodes
109 Backward Error Control – Should not Should try Should try None of A
try to to prevent to prevent the above
prevent errors errors and
errors but avoid
only discovery of
discover errors
errors.
110 Forward Error Control- Should not Should try Should try Attempts D
try to to prevent to prevent to prevent
prevent errors only errors and errors
errors but avoid instead of
only discovery of only
discover errors detecting
errors. them
111 Select correct statement for naming Name Name reveal Name does Name does C
reveal a about the not reveal not reveal
about the position of anything anything
position of the node, about the about the
the node but not position of position of
and its role. about the the node. the node as
role. Reveal well as its
something role.
about the
role.
112 Select correct statement for addressing of Address Address Address Address B
node reveal a reveal about does not does not
about the the position reveal reveal
position of of the node, anything anything
the node but not about the about the
and its role. about the position of position of
role. the node. the node as
Reveal well as its
something role.
about the
role.
113 Centralized Topology Control Is very hard Requires React well in All are B
to perform significant case of leading
communicat changes. nodes
ion
overhead
114 Distributed Topology Control Is very simple Requires less More flexible, Less precise C
to perform time to situation- than
stabilize aware centralized
control.
117 What device is the wireless equivalent of a Bridge Repeater Antenna Access- D
wired hub? point
118 The type of access used in GSM technology TDMA CDMA OFDMA None of A
is the above
119 34. Uplinks are also knowns as Reverse BS link Forward link MS link A
link
120 The RTS and CTS frames in CSMA/CA ____ can; cannot cannot; can can; can cannot; A
solve the hidden station problem. The RTS cannot
and CTS frames in CSMA/CA ____ solve the
exposed station problem.
121 A one-to-all communication between one unicast multicast broadcast none of the C
source and all hosts on a network is classified above
as a _______ communication.
122 A one-to-many communication between one unicast multicast broadcast none of the B
source and a specific group of hosts is above
classified as a _______ communication.
123 A one-to-one communication between one unicast multicast broadcast none of the A
source and one destination is classified as a above
_______ communication.