UNIT –III

KCA-043 IOT
Network and Communication Aspects In IOT :=>

Wireless Media Access Issues in Internet of Things:=>

When it comes to communication using a wireless medium there is always a concern about
the interference due to other present wireless communication technologies. Wireless means
communication and message transfer without the use of physical medium i.e., wires.
Different Mobile stations(MS) are attached to a transmitter/receiver which communicates via
a shared channel by other nodes. In this type of communication, it makes it difficult for the
MAC design rather than the wireline networks.
The very important issues which are observed are:
1. Half Duplex operation
2. Time-varying channel
3. Burst channel errors.
1. Half Duplex operation:=>
 Half-duplex transmission means when the sender and receiver both are capable
of sharing data but one at a time.
 In wireless transmission, it is difficult to receive data when the transmitter is
sending the data because during transmission a large amount or a large fraction
of signal energy is leaked while broadcasting.
 The magnitude of the transferred signal and received signal differs a lot. Due to
which collision detection is even not possible by the sender as the intensity of
the transferred signal is large than the received one.
 Hence this causes the problem of collision and the prime focus should be to
minimize the collision.

2. Time-varying channel :=>

Time-varying channels include the three mechanisms for radio signal propagations they
are Reflection, Diffraction, and Scattering.
 Reflection –
This occurs when a propagating wave carrying information intrudes on an object that has
very large dimensions than the wavelength of the wave.
 Diffraction –
This occurs when the radio path between the transmitter and the receiver is collided by the
surface with sharp edges. This is a phenomenon which causes the diffraction of the wave
from the targeted position.
 Scattering –
This occurs when the medium through from the wave is traveling consists of some objects
which have dimensions smaller than the wavelength of the wave.
 3. Burst Channel Errors :=>
Burst channel errors are called as a contiguous sequence of symbols, which are
received in a communication channel, in which the first and last symbols has an error
and there is no evidence of contiguous sub-sequence of corrected received symbols.
When time-varying channels are used then signals strengths are introduced due to
which errors are observed in transmission. For these channels in wireline networks, the
Bit rate is high as 10 -3.
MAC Protocol Survey:=>

MAC protocol is the first protocol layer above the Physical Layer in ad hoc .The primary task
of any MAC protocol is to control the access of the nodes to shared medium.

Classification of MAC protocols :

These are as following below.
1. Contention-based protocols without reservation/scheduling –
 Bandwidth is not reserved.
 No guarantees.
2. Contention-based protocols with reservation mechanisms –
 Bandwidth is reserved for transmission.
 Guarantees can be given.
3. Contention-based protocols with scheduling mechanisms –
 Distributed scheduling is done between nodes.
 Guarantees can be given.
4. Other protocols –
 Combine multiple features of other protocols.
 It can also use a completely new approach.

SURVEY ROUTING PROTOCOLS FOR IOT:=>

There exist lots of routing protocols each having a unique operating standard with significant
performance for Wireless Sensor Networks that can be deployed for IoT with few
modifications for bandwidth and power consumption.

A.Naive Routing :=>The idea deployed in naïve routing is flooding. Each node can overhear
its neighbors within its range. The source node floods the network with route request packets
called as beacons. Destination nodes respond with a route reply message to the beacon and
communication link is established between these nodes. Beaconing is typically utilized for
location tracking, discovering routes to destinations and tracking neighbors through keep-
alive requests. One of the most important factors that affect performance is the beacon
interval in the route discovery process. If the beacon interval is too small, the number of
beacons generated becomes huge. On the other hand, a higher beacon interval incurs a lesser
number of generated beacons. Popular routing protocols such as DSR, DSDV and AODV fall
under this category.

B.Hierarchical Routing:=> Nodes form clusters based on polling. The cluster head is
responsible for all communications on behalf of the members of the cluster. Group mobility
can be achieved by the cluster head following some metric to devise the mobility pattern of
the nodes in the cluster. LEACH is a common example, where the cluster head is rotated
among the members to facilitate load balancing that can be deployed for IoT environments.

C.Query based Routing:=> The underlying principle of query based routing is data
dissemination within the network. A querying node can retrieve data from any node in the
network. Common examples are SPIN and Direct Diffusion.

D.Multipath routing:=> Protocols employing multipath routing seek to and use alternate
paths towards every destination. This distributes the cost of forwarding packets among more
nodes, saving the energy of individual, highly-frequented nodes.

E.Probabilistic routing:=> Routing decision is based on the calculated probabilistic value. A

primitive method to compute these values is by gossiping. Data packets are flooded into the
network like a rumor with a probability p. Unlike other flooding mechanisms, these packets
are forwarded only once and thereby the traffic overhead is reduced. A highly structured
approach is to refer the prior history of packet delivery and mobility pattern, based on this we
can decide which nodes can form a route to the destination.

F.Ad-hoc On-Demand Distance Vector (AODV) :=>AODV computes a loop free single
path on demand. A mobile node discovers and maintains a route to another node only when it
needs to communicate. One observation of AODV is that, though the source actually
discovers multiple paths during the route discovery process, it chooses only the best route and
discards the rest. Also, frequent route breaks cause the intermediate nodes to drop packets
because no alternate path to the destination is available. This reduces the overall throughput
and the packet delivery ratio.

G. Adhoc On-Demand Multipath Distance Vector (AOMDV) :=>In order to route with
low overheads even under highly dynamic conditions, Adhoc On-Demand Multipath Distance
Vector was introduced. AOMDV computes multiple loop free and link disjoint paths
providing fault tolerance and efficient recovery from route failures. Each node maintains a list
of its next hop neighbors that are sorted based on the hop count. When failures occurs during
routing an alternate path is chosen, if there is no alternate path a route error message is given.

H. Routing Protocol for Low Power and Lossy Networks (RPL):=> RPL is based on IPv6
and is a link independent routing protocol which supports routing with minimal requirements
by building a robust topology over lossy links. This routing protocol achieves multipoint-to-
point, point-to-multipoint and point-to-point communication for simple and complex traffic
models. The core of RPL is represented by a Destination Oriented Directed Acyclic Graph
(DODAG), which is a directed acyclic graph with a single root. Each node knows its parent
but has no information about its related children. RPL maintains at least one path for each
node to the root along with a preferred parent to pursue a faster path establishment to increase
the performance.

SENSOR DEPLOYMENT IN WSN :=>

In WSN, the nodes are deployed in different ways based on their applications. The
deployment methods are nearly based applications of the wireless sensor networks. The two
main classification of the deployment methods in the wireless sensor networks are:

1. Deterministic-based deployment
2. Random deployment.

In deterministic-based deployment method where the application status of the environment

known, the sensor node can be fixed at the selected area of the application and the operation
status can be fixed in the selection area of WSN.

In random deployment method, the full coverage of particular environment is difficu lt. The
random deployment is also known as the economical deployment. In order to achieve the full
coverage of the selected environment by the random deployment method, numerous amounts
of the nodes should be deployed in the sensor network.

Random Deployment:=>

In random deployment, sensors are randomly scattered over the region of interest to gather the
target information. Figure 2a shows an example of random placement. It is suitable for regions
where human existence is difficult (e.g., disaster areas, battlefields, air pollution, and forest
fires). Random sensor deployment is preferred in many WSN applications due to the simplicity
of the sensor distribution. As a drawback, however, this method leads to uneven connectivity
with critical sensors, which results in a network which is non-robust to sensor failure.

Deterministic Deployment:=>

In deterministic deployment, sensors are placed on the region of interest based on a certain
geometrical structure. Examples of this type of deployment are square, triangle, and hexagon
grids, and tri-hexagon tiling (THT), as shown in Figure 2 b–e, respectively.

A theoretical analysis in proved that a hexagonal structure can provide a high coverage area with
low energy consumption using a minimum number of sensors. Tri-hexagon tiling deployment
was proposed to combine the advantages of the triangle and hexagon deployment methods. In
terms of energy consumption, the THT deployment outperforms the square and hexagon
deployments
Figure 2:

NODE DISCOVERY:=>

Node discovery is the process of identifying and adding new devices to an IOT network. It is
essential to ensure that new devices can join the network seamlessly and begin
communicating with other devices without disrupting the existing network. Node discovery is
also critical for maintain the scalability and flexibility of IOT networks.

 Sensor nodes are used to monitor environmental conditions like temperature, pressure,
humidity, sound, vibration, position etc.
 Each and every node is capable to perform data gathering, sensing,processing and
communicating with other nodes.
 The sensing unit senses the environment
 The processing unit computes the confined permutations of the sensed data
 The communication unit performs exchange of processed information among
neighboring sensor nodes.
 Mostly ATMEGA 16, ATMEGA 128L, MSP 430 controllers are used in commercial
motes.
 It is Capable of :
 executing data processing
data gathering
communicating with additional associated nodes in the network

Components of a wireless sensor node

 Components of a wireless sensor node

 sensing unit
 processing unit
 communication unit
 power unit

Sensor Nodes Functions

 Effortlessness installation
 Fault indication
 Energy level diagnosis
 Highly reliability
 Easy coordination with other nodes in the network
 Control protocols
 simple network interfaces with other smart devices
 sensor node is often not only responsible for data collection, but also for in-
network analysis, correlation

Data Aggregation: =>

Data aggregation is the process of collecting and aggregating the useful data.

The data aggregation is a technique used to solve the implosion and overlap problems in data
centric routing. Data coming from multiple sensor nodes are aggregated as if they are about the
same attribute of the phenomenon when they reach the same routing node on the way back to the
sink. Data aggregation is a widely used technique in wireless sensor networks. The security
issues, data confidentiality and integrity, in data aggregation become vital when the sensor
network is deployed in a hostile environment. Data aggregation is a process of aggregating the
sensor data using aggregation approaches. The general data aggregation algorithm works as
shown in the below figure1. Figure 1 illustrates that data aggregation is the process of
aggregating the sensor data using aggregation approaches. Then the algorithm uses the sensor
data from the sensor nodes and then aggregates the data by using some aggregation algorithms
such as centralized approach, LEACH( Low Energy Adaptive Clustering Hierarchy), TAG( Tiny
Aggregation) etc. This aggregated data is transfer to the sink node by selecting the efficient path.
 Figure 1: Architecture of data aggregation.

Data Dissemination:=> Data Dissemination is a procedure where the server initiates and
manages transfer of data as well as updates. It also helps in maintaining data consistency and
cache management. It is defined as “Pushing data to mobile devices from a server or some
other computer.” Mobile devices can select time and cache required data. In ad-hoc network,
traffic is peer to peer. Multi-hop routing is used to communicate data. In wireless sensor
network, other traffic models are possible which are as follows:
 Data Collection Model: The source sends data to a collection periodically on demand
 Data Diffusion Model: A sensor node that generates data based on its sensing
mechanism’s observation.
Data dissemination has two different entities:
 Source: Generating data.
 Event: Something that needs to be reported for example, in target detection, some
abnormal activity.
 Sink: A node randomly located in the field, that is interested in events and seeks such
information.
Event in the below diagram indicates the information to be reported or sent. After source
receives an interest from the sink, the event is transferred from the source to the sink. Data
dissemination is a two step process. First, the node that is interested in some events,
broadcasts its interests to its neighbors periodically. Interests are then propagated through the
whole sensor network. In the second step, nodes that have requested data, send back data after
receiving the request. Intermediate nodes in the sensor network also keep a cache of received
interests and data.