To Design Lightweight Routing Algorithm for Improving

Data Communication in IOT Based Network

1. Background study

Advancements on the Internet of Things (IoT) can help smart sensors, RFID, the Internet, and
communication protocols. Sensor nodes are seen as smart devices and commonly utilized to
acquire and transmit data. Although sensor nodes have their own inherent limitations, they are also
exposed to a wide range of security risks. Anonymous sharing is used in this paper's energy-aware
and secure multi-hop routing (ESMR) protocol, which combines data security with energy savings.
A three-part protocol is being suggested as a first step, the network field is divided into two parts
based on the position of each node. Clusters emerge in each zone depending on how close nodes
are to one another. In the second phase of the proposed architecture, this efficient secret sharing
technique is employed to protect data transit between cluster heads in each zone and the sink node.
Data linkage quantitative analysis is examined to reduce routing disruptions in the last step of this
procedure. This study for constrained wireless sensor networks (WSNs) based on the Internet of
Things describes a lightweight solution with safe data routing in a multi-hop technique (IoT). The
results of the experiments demonstrate that the designed energy-aware and secure multi-hop
routing protocol is more effective in terms of network lifetime by 38 %, network throughput by 34
%, energy consumption by 34 %, average end-to-end delay by 28 %, and routing overhead by 36
% than the previous work [1].

2. Research methodology

This section contains the techniques and proposed methodology. A detailed description of various
techniques used in the methodology is described below.

2.1 Technique used

2.1.1 Layer configuration phase

A fuzzy-based multipath routing system creates layers of varying widths depending on the
distances between sensor nodes. Fuzzy-based multipath routing protocol layer layout is shown in
Figure 1 [2].
 Figure 1: Fuzzy-based multipath routing protocol layer [2].

The sensor node's unique ID is included in messages forwarded to the central station (BS). The
relative distance between each sensor node and BS is calculated based on the intensity of the signal
from each node, and the identification of the sensor is saved. The BS creates layers of varied sizes
based on the distance between the nearest and farthest sensors. The sensor nodes that are closest
to the base station are positioned on top, while the nodes that are farthest away from the base
station are on the bottom. This decreases from the upper layers to the lowest layers in sensor node
density. Several sensor nodes in layer (i) are referred to as Ni in Equation (1).
𝑘−(𝑖−1)
𝑁𝑖 = 𝑁 × ∑𝑘
(1)
𝑗=1 𝑗

Network nodes are counted as N (number of sensors), k (number of levels), and I (number of
layers).

2.1.2 Source approaches towards 3 nodes in the next layer based on node optionality
energy.

WSNs [3] energy efficiency has a substantial impact on the functioning of IoT systems, which are
primarily reliant on sensors. A fuzzy-based multipath routing system aims to improve energy
efficiency by considering the path of data transfer. This section compares the performance of a
fuzzy multipath routing system to that of LEACH and MH-LEACH. The sensors were tested in a
square field with a fixed number of sensors. The performance of a fuzzy-based multipath routing
system was evaluated using (MATLAB 2014a) by placing 100 sensor nodes across networks of
varied sizes. No matter what the scenario, the sensor node's initial energy is always 0.5 J. The BS
is located at the bottom left-hand corner of the screen (0, 0). The results of the simulation are
shown in Table 1. Each network was simulated 20 times in 3500 cycles.

Table 1: Parameters of the recreation.

Parameter Value

Amount of Gadget connections 100 points

Early Power 0.5j

Information Volume 2000 bit

Transport Power (Eelec) 50 nj/bit

Source Amp Power (Efs) 10 pj/bit/m2

Receiver Amp Strength (Emp) 0.0013 pJ/bit/m4

Combine Force (Eda) 5 nJ/bit

Quantity of Coating 4 Coating

time of Recreation 3500 turns

System Range 100 × 100 m2, 200 × 200 m2, and 300 × 300
m2

The examined routing approach has five presuppositions.

• Sensor nodes are randomly dispersed across the network, while the position of the deployed
sensor node remains constant.

• No matter what technology is used by the sensors, they all communicate with each other in the
same way.
• Uncharged sensor nodes have a limited supply of energy.

• If a packet transfer fails because of a link fault, retransmission is not an option.

• The sensor node transmits data following the routing algorithm after receiving a periodic start
message from the BS.

3.1.3 Hill climbing algorithm

It is possible to apply the hill-climbing algorithm to discover the highest point on a mountain or
the best answer to a problem [4]. This kind of local search raises the height and value of search
results. The game is done when it reaches a maximum value and there is no other neighbor with a
greater value. The hill-climbing method is a tool in the mathematical toolbox for locating the
optimal solution to a problem. An example of a Hill-climbing algorithm is the traveling salesman.
They have a problem that necessitates limiting the number of miles salespeople travel. Due to its
focus on nearby states, it is sometimes referred to as a "greedy local search." Hill-climbing
algorithms use state and value to construct nodes. In situations when a relevant heuristic is
unavailable, Hill Climbing is often utilized. This method does not need the upkeep and
management of a search tree or graph since it just remembers the currently active state. The hill-
climbing algorithm has certain features that are detailed below.

• Generate and Test variant: Generate and test strategy is a version of the Hill Climbing
technique. The Generate and Test technique delivers decision-supporting input in the search
region.

• Greedy approach: The search direction of a hill-climbing algorithm is the one that
maximizes cost.

• No backtracking: It doesn't go back and retrace the search area because it can't remember
its prior states.

The process of compiling a list of the devices that have volunteered to join the network is
followed by the gathering of information about each of those devices. Using the hill-climbing
method, which constantly moves ahead in the rising elevation to discover the ideal solution and
stops when there are no other neighbors with a higher value, these characteristics are enumerated
to determine the capable device that should be assigned as the cluster head. This is done by using
the hill-climbing method. The remaining network devices are either assigned to serve as relaying
 devices or as members of node devices until the required degree of connectivity is achieved. This
process is carried out regularly to ensure that the device with the highest level of productivity is
selected to take charge of the cluster.

3.1.4 Blum Blum Shub Algorithm

In 1986, Lenore Blum, Michael Shub, and Manuel Blum introduced the probabilistically secure
pseudo-random number generator known as the Blum Blum Shub (BBS) method [24]. The BBS
technique uses two prime integers, p, and q, to create random numbers in such a way that both p
and q have a value that is less than three (mod 4) and the gcd(p,q) value is equal to one. The
following Equation (2) is the calculation that is used to determine these primes, along with a
random seed:

𝑏𝑛+1 = 𝑏𝑛2 𝑚𝑜𝑑𝑀 (2)

Where:

• b is a random seed value

• M is the product of two large prime numbers p and q

• p and q are congruent to 3 (mod 4).

3.2 Proposed methodology

Figure 2 describes the proposed methodology step by step with the following techniques and the
techniques are layer configuration, fuzzy system, hill-climbing algorithm, and Blum Blum Shub
algorithm. The steps of the proposed methodology are given below:

Step 1: Start node deployment

In this step, the deployment of one node (a device) is the starting point for the network because
the subsequent steps cannot be completed successfully without this start node. Several nodes relate
to this start node, and the data transmission is carried out from the start node in the role of a source
node to the destination in the role of an end node. According to the flow diagram, an end node
would be represented as the point at which the process comes to an end.

Step 2: The source device initiates the transmission request toward the destination.
The transmission request is initiated by the source device toward the destination. There are so
many levels between the source device and the target device, and these layers include so many
associated devices. And when the source device attempts to commence a transmission request, the
source device sends the request to each device of linked layers, and typically, three devices are
ready to connect with the source device simultaneously.

Step 3: Layer configuration

Use layer configuration to configure several layers. If data transfer between these levels is
successful, then the layer setup has been completed successfully. This approach is used to identify
the defective layer during data transfer if present.

Step 4: Source approaches towards 3 nodes in the next layer based on node optimality
energy.

After layer setup, if no faulty layers are discovered, the source can approach three nodes in the
subsequent layer based on node optimality energy. Node optimality energy is defined as follows:
if a node has the most accurate energy for data transmission, then this is known as the optimal path
for data transmission; with this optimal path, the source node can easily determine the best path
for data transmission, and this is known as node optimal energy.

Step 5: If reached: If the optimal path is found successfully.

If it is determined that the optimal route has been chosen, then the Blum Blum Shub algorithm
would be used to encrypt and decrypt the data before it is transmitted. In any other case, the
following action would be taken.

Step 6: Iterate the process layer-by-layer fields.

If the previous step, step 5, was not carried out correctly, the subsequent step is to repeat the
procedure using the layer-by-layer field format.

Step 7: Route establishment using layer-wise structuring and fuzzy system.

Now the path for data transmission from the source node to the destination would be regenerated
with the aid of a fuzzy system and layer-wise structuring approach, and this process would repeat
the preceding phases.

Step 8: Select the optimal route based on hill climbing.

In this phase, the ideal route is determined using a hill-climbing algorithm, and step 4 would be
repeated as a loop; however, in earlier stages, the best route was determined using node optimality
energy.

Step 9: Process end

This step displays the result of step 5, which indicates that, if the criteria in step 5 are met, the
Blum Blum Shub method would be used to encrypt and decrypt the data before transmission, and
the procedure would end. Figure 2 shows the flow diagram of this proposed methodology.

Figure 2: Flow diagram of research methodology.

References
1. Haseeb, Khalid, Naveed Islam, Ahmad Almogren, Ikram Ud Din, Hisham N. Almajed, and Nadra
Guizani. "Secret sharing-based energy-aware and multi-hop routing protocol for IoT based
WSNs." IEEE Access 7 (2019): 79980-79988.

2. Noh, Kyeong Mi, Jong Hyuk Park, and Ji Su Park. "Data transmission direction based routing
algorithm for improving network performance of IoT systems." Applied Sciences 10, no. 11
(2020): 3784.

3. Smys, S., and Jennifer S. Raj. "Performance optimization of wireless adhoc networks with
authentication." Journal of Ubiquitous Computing and Communication Technologies
(UCCT) 1, no. 02 (2019): 64-75.

4. Delima, Allemar Jhone P., and Jan Carlo T. Arroyo. "An enhanced nihilist cipher using blum
blum shub algorithm." International Journal 9, no. 3 (2020).