10. Discuss different techniques involved during dat.

gathering and dissem ination while building n

IoTM2M applications. (2021-2:2;

M2M and loT Sensor Networks

Build Wireless
:
Data Dissemination Data dissemination is the prov
by which queries or data are routed in the sensor netwok
The data collected by sensor nodes has to be communicate
to the BS or to any other node interested in the data. Th
node that generates data is called a source and the
information to be reported is called an event. A node which
is interested in an event and seeks information
about it is

called a sink.
Traffic models have been developed for sensor
networks such as the data collection
and data
dissemination (diffusion) models. In the data collectio
model, the source sends the data it collects
to a collection
entity such as the BS. This could be
periodic or on demand.
The data is processed in the central collection
entity.
Data diffusion, on, the other hand,
consists of
two-step process of interest propagation and data
propagation. An interest is a descriptor for a
particular
kind of data or event that a
node is interested in, such as
temperature, intrusion, or presence
ofbio-agents.
For every event that a
sink is interested in,
broadcasts its interest to
its neighbors
refreshes its interest. and periodically
The interest is
network, and every propagated across the
node maintains an
eventsto be reported. interest cache of all
This is similar to a
the sink. When multicasttree
an event is formation, rooted at
interested nodes detected, it is
after referring reported to the
Intermediate to the
nodes maintain interest cache
aggregatethe data or
a
a data cache and can
The paths modify the rate
used for data of reporting
pro data
preferring the propagation
shortestpaths are modified
longer paths. and by

The basic idea deselecting the

weaker or
of diffusion
ismade efficien
 (A.15]

td nlellgent by different algorithms for interest and

data routing.
Flooding: In flooding. each node which receives a packet
broadcasts it if the maximum hop-count of the
packet is not
reached and the node itself is not the
destination of the
packet. This technique does not
require complex topology
maintenance or route discovery algorithms. But
flooding
has the following

are sent to
: disadvantages:
Implosion This is the situation when
duplicate
the samne node. This 0ccurs whenmessages
a node
receives copies of the same
message from many of its.
neighbors.
Overlap: The same event may be sensed
by more than
one node due to overlapping regions
of coverage. This

same event.
Resource Blindness

many redundant
:
resultsin their neighbors receiving
duplicate reports of the

The flooding protocol does not

consider the available energy at the

transmissions.
nodes and results in
Hence, it reduces the
network lifetime.
:
Gossiping Gossiping is a modified version of flooding.
where the nodes do not broadcast a packet, but send it to
a
randomly selected neighbor. This avoids the problem of
iimplosion. but it takes a long time- for a
message to
propagate throughout the network. Though gossiping has
considerably lower overhead than flooding, it does not
guarantee that all nodes of the network will receive the
message. It reies on the random neighbor selection to
eventuallypropagate thê message throughout the network.
Rumor Routing:Rumor an agent-based path
routing is
creation algorithm. Agents, or "ants," are long-lived
entities created at random by nodes.. These are
basically
packets which are circulated in the network to establish
shortest paths to events that they encounter.

They can also perform 'path optimizations at nodes

that they visit. an agent finds a node whose path to
When
an event is longer than its own, it updates the node's
routing table. Figur: beow tllutrates th working of the
rumor routing algorh
 (Figure :Rumor Routing)
In Figure (a), th agent has initially recorded a path
of distance 2 to event El, Node A's table shows that it is at
adistance 3from event E1 and a distance 2from E2. Whe
the agent visits node A,updates its own path state
it
information to include the path to event E2. The updating
is with one hop greater distance than what it found in A, to
account for the hop between any neighbor. of A:that the
agent will visit next, and
(1), It also optimizes the path to El recorded at node A to
the shorter path through node
(2) The updated status,of the agent and node table is

shown in Figure.
When a query is generated at a sink, it is sent on
random walk with the hope that it will find a path
(preestablished by an agent) leading to the required event
This is based on the high
probability of two straight lines
intersecting on a planar graph, assuming the
network
topology is like a planar graph, and the paths establishe
can be approximated by straight lines owing to high
density of the nodes.
If a query does not find an event path, the sink
times
out and uses flooding as a last resort to
propagate the
query,suppose a query
for event Elis generated by
P. node
Through a random walk, it
reaches A, where it finds th
previously
established path to El. Hence, the
directed to El query 18
through node B, asindicated by A's
table.
INTERNET OF THINGS (A.17]

Sequential Assignment Routing : One solution to this

problem is the use of a set of algorithms which performs
organization and mobility management in eensor networks
is proposed. This sequential assignment routing (SAR)

algorithm creates multiple trees, where the ront of each

tree is one-hop neighbor of the sink.

šink,

Sensornode -Tree rooted at node A

One-hoplinks of sink --.Treerooted at node B
(Figure:Sequential Assignment Routing)
Each tree grows outward from the sink and avoids
nodes with low throughput or high delay. At the end of the
procedure, most nodes belong to multiple trees. An
instance of tree formation is illustratedin Figure below.
The trees rooted at A and B, and two of the one-hop
neighbors of the sink, are shown. Node C belongs to both
trees, and has path lengths of 3and 5, respectively,to the
sink, using the two trees. Each sensor node records two
parameters about each path through it: the available
energy resources on the path and an additive QoS metric
such as delay. This allows a node to choose one path from
among many to relay its message to the sink.
The SAR algorithm chooses path with high estimated
energy resources, and provisions can be made to
accommodate packets of different priorities. A weighted
QoS metric is used tohandle puoritized packets, which is
The
computed as a product of priority level and delay.
routing ensures that the same weighted
QoS metric is
maintained.
Thus, higher priority packets take lower delay paths,
and lower priority packets have to use the paths of greater
of priority 3.
delay.For example, if node generates packet
(A.18] KPH

it follows the longer path along tree B) . oacket IN

priority 5
(higher pority) will follow th xhrter pat
along tree A, so that the priority x delay s metric
maintained. SAR minimizes the average weighted QoS
metric over the lifetime of the network. The sink
periodically triggers metric update to reflect the changes in
available energy resource aftersome transmissions.
Directed Diffusion : The directed diffuaion protocol i
useful in scenarios where the sensor nodes themselvee
generate requests/queries for data sensed by other nodes
instead of all queries arising only from a BS. Hence. the
sink for the query could be a BS or a sensor node. The
directed diffusion routing protocol improves on data
diffusion using interest gradients.
Each sensor node names its data with one or more
attributes, and other nodes express their interest
depending on these attributes. Attribute-value pairs can be
used to describe an interest in intrusion data as follows
where an interest is nothing but a set of descriptors for the
data in which the querying node is interested.
type =vehicle detect vehicle location "/
interval = 1s I* report every 1 second "/
rec {0, 0,600, 80 -/* query addressed to sensors within
this

rectangle'/
Timestamp'= 02:30:00 when the interest originated!
when the sink retains this data
expiresAt- 03:00:00 "/till

"The sink has to periodically refresh its interest

if it

8! requres the deta to be reported to it.

te
reverse path
Data is
of the interes
prpagated aong
with a gradient that
propagation. Each prh is associated
is formed at the time of interest propagation.
the data flo
positive gradients encourage
While
inhibit the distribution
along the path, negative gradients
ofdata along a particular path. The
is
stength of the interest
neighbors resulting i ,
different
source-to-sink
toward different
paths with different gradients,
The gradient corresponding to an
from the interval/data-rate
interest is derived
field specified in
the interest
|
gradients
For example, there are two paths formed with
if
0.8 and0.4, the source may send twice as much data along

the higher gradient path compared to the lower gradientsend

one. For the interest mentioned earlier, a sensor may
data of the following kind :
 INTERNET OF THINGS
[A.19]

type vehicle type of intrusion see I

instanoe car r particular instanceof the type /
Iocation "[200,25 *
location of node *
Oonfidence 0.80 = confidenceof match "/
timestamp 02:45:20 /
time of detection "/
The
diffusion model allow8 nodes to
cache or locally
transform (aggregate) data. This increases
the scalability
of communication and reduces the number of message
transmissions required.
The concept of reinforcement is used to
update a
node's interest along a particular
path. For example,
suppose the sink wants more
frequent updates from the
sensors which have detected an
event.
It reinforces the path by
sending an interest with a
higher data-rate requirement, in
effect increasing the
gradient of that path. On the other hand,
if the sink needs
only fewer updates, it
applies negative reinforcement by
sending an interest of lower required data-rate.
The directed diffusion model uses
data naming by
attributes and local data transformations to reflect the
data-centric nature of sensor network operations. The
local
operations of data aggregation are
application-specifc.
Gradients model the network-wide results of local
interactions by regulating the flow of data along
different
paths, depending on the expressed interest.

11, Describe the Vision of Internet of Things (loT)?

Internet of Things is a vision where things (wearable

watches, alarm clocks, home devices, surrounding objects)
become 'smart' and function like living entities by sensing.
computing and communicating through embedded devices
which interact with remote objects (servers, clouds,
applications, services and processes) or persons through
the Internet or Near-Field Communication (NFC) ete.

12. Why is 10T design important?

For lot to become

solutions widely adopted,
needs in order to
businesses need to dig deep into
users'
truly worth solving and what
find out where liesa problem
is the real end user value
of the lot soluton. Businesses
what the barriers might be in
also need to understand
in general and their iot
adopting the new iot technologies
solutions specifically.