‭MODULE 5‬

‭IoT‬
‭PYQ‬
‭ಕರ್ನಾಟಕ‬
‭1.Explain the crucial points influencing the physical layer of WSN.‬
‭●‬ ‭Some of the most crucial points influencing physical design in wireless sensor networks‬
‭are:‬
‭○‬ ‭Low power consumption.‬
‭○‬ ‭As one consequence: small transmit power and thus a small transmission range.‬
‭○‬ ‭As a further consequence: low duty cycle. Most hardware should be switched off or‬
‭operated in a low-power standby mode most of the time.‬
‭○‬ ‭Comparably low data rates, on the order of tens to hundreds kilobits per second,‬
‭required.‬
‭○‬ ‭Low implementation complexity and costs.‬
‭○‬ ‭Low degree of mobility.‬
‭○‬ ‭A small form factor for the overall node‬

‭ . Explain the SMAC protocol and explain how it handles the major sources of energy‬
2
‭inefficiency in WSN.‬

‭●‬ ‭S-MAC (Sensor MAC) is a low-power, duty-cycled MAC (medium access control) protocol‬
d‭ esigned for wireless sensor networks.‬
‭ ‬ ‭It tries to save energy by reducing the time a node spends in the active (transmitting) state and‬
●
‭lengthening the time it spends in the low-power sleep state.‬
‭●‬ ‭S-MAC achieves this by implementing a schedule-based duty cycling mechanism. In this system,‬
‭nodes coordinate their sleeping and waking times with their neighbors and send the data only at‬
‭predetermined time slots.‬
‭●‬ ‭As a result of this mechanism, there are fewer collisions and idle listening events, which leads to‬
‭low energy usage.‬
 ‭●‬ S
‭ -MAC (Sensor MAC) is designed specifically for wireless sensor networks and has several key‬
‭features, including:‬
‭●‬ ‭Synchronized sleep schedule: To minimize the overhead and power usage related to MAC‬
‭protocols, it adopts a synchronized sleep schedule. To save energy, nodes alternately take‬
‭turns sleeping and waking up, which reduces idle listening and maximizes battery life.‬
‭●‬ ‭Packet aggregation: Packet aggregation is a feature of this protocol that combines multiple‬
‭data packets into a single larger packet to reduce the quantity and frequency of‬
‭transmissions in the network. This improves the network’s scalability and hence decreases‬
‭overhead.‬
‭●‬ ‭Route discovery: The S-MAC protocol has a route discovery mechanism that enables‬
‭nodes to select the fastest and most efficient path for data transmission. This improves the‬
‭network’s overall efficiency and lowers the energy use associated with data transmission.‬
‭●‬ ‭Low overhead: It is because S-MAC limits the amount of data carried through the network‬
‭and lowers the number of transmissions, it has a low overhead. This increases the‬
‭network’s effectiveness and helps to conserve energy.‬
‭●‬ ‭Robustness: S-MAC is designed to be resilient and robust in the face of failures and‬
‭changes to the network. It has tools and mechanisms for handling failures, identifying‬
‭them, and adjusting to network changes like node mobility and changes in network‬
‭topology.‬
‭●‬ ‭Security: To protect against unauthorized access and malicious attacks. This makes it easier‬
‭to guarantee the security and privacy of data sent across the network.‬

‭3. What is geographical routing and explain about Greedy Perimeter Stateless routing for wsn.‬
‭●‬ ‭Sending data to arbitrary nodes in a given region is referred to as geographical routing.‬

‭‬
●
‭●‬ G ‭ reedy Perimeter Stateless Routing (GPSR): GPSR is a protocol designed for wireless networks.‬
‭It employs two main routing modes - greedy forwarding and perimeter routing.‬
‭●‬ ‭Greedy Forwarding: In this mode, a packet is forwarded as far as possible toward the destination‬
‭using the "most forward" rule. If the packet cannot make further progress, it switches to perimeter‬
‭routing.‬
‭●‬ ‭Perimeter Routing: When a packet switches to perimeter routing, it moves around a face defined‬
‭by a set of nodes, using the right-hand rule. The face can be exterior or interior, representing a‬
‭region of the plane not cut by any graph edges.‬
 ‭●‬ D ‭ ecision Criteria: The packet carries information about the face it entered. The decision to leave‬
‭the face is based on the current node, the connecting line between the current node and the‬
‭destination, and whether the edge to the next node intersects this connecting line.‬
‭●‬ ‭Return to Greedy Forwarding: The packet can return to greedy forwarding if the distance to the‬
‭destination and the node where it entered the face has been effectively reduced.‬
‭●‬ ‭The above example: Illustrating the routing from node A to Z, the packet initially greedily‬
‭forwards to node D. When greedy forwarding fails at D, the packet follows the perimeter of the‬
‭face defined by nodes BFGCD, routing through B, F, G, E, I, H, K, J, L, and finally reaching Z.‬
‭●‬ ‭Applicability to Planar Graphs: GPSR's face-based approach is specifically designed for planar‬
‭graphs. However, since wireless network graphs may not be planar, the protocol requires the‬
‭construction of a planar subgraph first.‬
‭●‬ ‭Subgraph Construction:Relative Neighborhood Graph (RNG) and Gabriel graph are used as‬
‭subgraph. These subgraphs can be constructed in a distributed fashion.‬

‭4. Explain Mediation Device Protocol with advantages and disadvantages.‬

‭‬
●
‭●‬ T ‭ he Mediation Device Protocol is compatible with the peer-to-peer communication mode of the‬
‭IEEE 802.15.4. It allows each node in a WSN to go into sleep mode periodically and to wake up‬
‭only for short times to receive packets from neighbour nodes.‬
‭●‬ ‭There is no global time reference, each node has its own sleeping schedule, and does not take‬
‭care of its neighbors sleep schedules. Upon each periodic wakeup, a node transmits a short query‬
‭beacon, indicating its node address and its willingness to accept packets from other nodes.‬
‭●‬ ‭The node stays awake for some short time following the query beacon, to open up a window for‬
‭incoming packets. If no packet is received during this window, the node goes back into sleep‬
‭mode.‬
‭●‬ ‭When a node wants to transmit a packet to a neighbour, it has to synchronize with it. One option‬
‭would be to have the sender actively waiting for query beacon, but this wastes considerable‬
‭energy for synchronization purposes only.‬
‭●‬ ‭The dynamic synchronization approach achieves this synchronization without requiring the‬
‭transmitter to be awake permanently to detect the destinations query beacon. To achieve this, a‬
‭mediation device (MD) is used.‬
 ‭●‬ T ‭ he mediation device is not energy constrained and can be active all the time; this scenario is‬
‭illustrated in Figure 3.4. Because of its full duty cycle, the mediation device can receive the query‬
‭beacons from all nodes in its vicinity and learn their wakeup periods.‬
‭●‬ ‭Suppose that node A wants to transmit a packet to node B. Node A announces this to the‬
‭mediation device by sending periodically Request To Send (RTS) packets, which the MD‬
‭captures.‬
‭●‬ ‭Node A sends its RTS packets instead of its query beacons and thus they have the same period.‬
‭Again, there is a short answer window after the RTS packets, where A listens for answers. After‬
‭the MD has received A’s RTS packet, it waits for B’s next query beacon.‬
‭●‬ ‭The MD answers this with a query response packet, indicating A’s address and a timing offset,‬
‭which lets B know when to send the answering Clear To Send (CTS) to A such that the CTS‬
‭packet hits the short answer window after A’s next RTS packet.‬
‭●‬ ‭Therefore, B has learned A’s period. After A has received the CTS packet, it can send its data‬
‭packet and wait for B’s immediate acknowledgment.‬
‭●‬ ‭After the transaction has finished, A restores its periodic wakeup cycle and starts to emit query‬
‭beacons again. Node B also restores its own periodic cycle and thus decouples from A’s period.‬

‭●‬ ‭Advantages‬
‭○‬ ‭It does not require any time synchronization between the nodes, only the mediation device‬
‭has to learn the periods of the nodes.‬
‭○‬ ‭The protocol is asymmetric in the sense that most of the energy burden is shifted to the‬
‭mediation device, which so far is assumed to be power unconstrained.‬
‭●‬ ‭Disadvantages‬
‭○‬ ‭The mediation device is energy unconstrained.‬
‭○‬ ‭Need sufficient mediation devices to cover all nodes.‬

‭5. Explain Energy problems in MAC.‬

‭●‬ ‭Collision:‬
‭○‬ ‭A collision is a wasted effort when two frames collide with each other and are discarded‬
‭because the receiver has to drop the overlapped information.‬
‭○‬ ‭A collision usually results in retransmission and drains more energy in transmitting and‬
‭receiving extra packets.‬
‭○‬ ‭The half-duplex nature of the wireless medium precludes collision detection, thereby‬
‭increasing the responsibilities of the MAC protocol.‬
‭○‬ ‭Hence, collisions should be avoided, either by design or by appropriate collision‬
‭avoidance/hidden-terminal procedures in CSMA protocols.‬
‭●‬ ‭Overhearing: An overhearing occurs on the wireless broadcast medium when the node receives‬
‭and processes a gratuitous packet that is not addressed to it. In the dense network and under heavy‬
‭traffic situations, this could lead to a serious problem.‬
‭●‬ ‭Control packet overhead:‬
‭○‬ ‭An increase in the number and size of control packets results in overhead and unnecessary‬
‭energy waste for WSNs, especially when only a few bytes of real data are transmitted in‬
‭each message.‬
‭○‬ ‭Such control signals also decrease the channel capacity. A balanced approach is required so‬
‭that the required number of control packets can be kept at minimal.‬
‭●‬ ‭Idle listening:‬
 ‭○‬ S‭ ince a node in a WSN usually does not know when it will be the receiver of a message, it‬
‭keeps its radio in ready-to-receive mode, which consumes almost as much energy as in‬
‭receive mode.‬
‭○‬ ‭In low traffic applications, this is considered one of the major sources of energy waste.‬
‭The idle listening consumes significant energy. Hence, need Periodic listen and sleep.‬
‭ ‬ ‭Complexity: Computationally expensive algorithms might decrease the time the node spends in‬
●
‭the sleep mode.‬
‭●‬ ‭Over-emitting: An over-emitting or a deafness occurs due to the transmission of the message‬
‭when the destination node is not ready to receive it.‬
 DD MMY Y Y Y

nchaoxk

nhsawk
TOHA bad MA Qatocalchutenas
clus tes
h cuc hah a dhcad chhhia

TOMA ah

pen to pen cammnfeaion

to thesink

hecama CN

confdufag
Patot anencta fn vounds each ath Sehup cnd cstad stk
phagn.
ehiton

Aatu

Th poocal
 D D MMY Y Y Y

Balanes erang b/owensfon

AssUMN
Rundhaut
Aln

Bxoasa scedale
Hanmbens Compet
Ath cSMA

CSMA ultfop nehuuek

han
Rnfcda
Nodun
afvah, lm an
etsnadfagn
colkfbnn.
 DD M MY Y Y Y

Neda to aend
Sectal
Nodun ugheam

qutumaten
Ak ertng

Cantßen
Rondam

hackal paat based

 D D MM Y Y Y Y

As Aumak : =0

Ronlem dob
A --

Aset Rven

C*noa
A:foluu
Ait ank
teigta A>Ahon
 DD M M YY Y Y

ctñng pakaa

stup penrtd

pat
ehunn to slsh

A smal Meauy thet

Auaaup co
DD MM Y Y Y Y