What is WSN?

• Wireless Sensor Networks are networks of spatially distributed sensors that

communicate with each other wirelessly to monitor physical or environmental
conditions.

• The various aspects of WSNs, including their definition, applications,

architecture, challenges, and solutions.
 Introduction to WSN
• The Wireless Chemical Sensor Network (WCSN) detects small substances in the
surrounding environment
• To detect, determine, and transmit while using low energy
• In comparison to conventional wireless sensor network scenarios, battery-powered
intelligent WCSNs consume a lot of energy quickly.
key features that make WSNs unique
and valuable
•Scalability: Ability to scale the network size according to requirements.

•Flexibility: Adaptability to different environments and applications.

•Cost-effectiveness: Lower deployment and maintenance costs compared to

traditional wired systems.

•Real-time data: Continuous monitoring and timely data collection.

•Self-organization: Ability to self-organize and reconfigure in response to changes

or failures.
Advantages of WSNs
•Remote Monitoring: Ability to monitor remote or hazardous environments
without human intervention.

•Data Accuracy: High-quality, real-time data collection for better decision-

making.

•Cost Efficiency: Lower installation and maintenance costs compared to wired

systems.

•Versatility: Wide range of applications across various industries.

•Rapid Deployment: Quick and easy deployment in diverse environments.

 Multi-driven Clustering Algorithm (MCA)

• That employs the EDT (Energy, Distance, Time) Strategy

• Employs the CH Rotation Algorithm

• After receiving the parameters values (n, ε, k, and s), the Base Station (BS)
calculates the best possible outcome for the cluster at all layers using the formula.

+P
Architecture
 CH Rotation Strategy
Start

Cluster
Setup
Sensor Node calculates the
ratio of RE-D

Yes If No
NREB
-NRE
It will
check
TDRE

Yes Else if N
TDRE O
It will take > RNRE
Check Check
substitute as TNSD for TNST for
Cluster Head all the nodes all the
nodes

Yes Else N Yes Else N

TNSD o TNS o
> T>
Data RNSdist Data RNSti
deduplication deduplicaton me

Data Data
Transmission Transmission
 Data deduplication process

• Data de-duplication is an optimisation approach for eliminating duplicate

data. This process selects each data owner and sends relevant data.
• The duplicate data is then shared in a single copy, and all the duplicate
copies in memory are removed.
Simulator result
 Network Lifetime
500
450
400
350
300 LEACH[4]

Alive Nodes
250
200 DECSA [10]
150
100 NEAP [15]
50
0 PROPOSED (EDT)
0 0 0 0 0 0 0 0 0 0 0
20 40 60 80 100 120 140 160 180 200
Simulaton TIme

• Approach comprises of a data deduplication procedure.

• Redundant data and energy balancing are employed so the life time of node
increases.
• Extends the network lifetime by 40% when used with the EDT strategy
 Throughput (without data deduplication)

EDT NEAP DESCA LEACH

30

N.O OF PACKETS
25

RECEIVED AT bs
20
15
10
5
0
0 200 400 800 1200 1400 1600 1800 2000
Rounds

Throughput (with data deduplication for EDT)

30
Total no.of data packets

25
PROPOSED
received at BS

20 (EDT)
15 NEAP [15]
10 DECSA
[10]
5
LEACH[4]
0
0 200 400 800 1000 1200 1400 1600 1800 2000
Rounds
 Lifetime of sensor nodes

500
450
400

Lifetime of participating nodes

350
300
250
200
150
100
50
0
LEACH[4] DECSA[10] NEAP[15] PROPOSED(EDT)
 PMTCO‑based EDT Clustering Method
• The proposed PMTCO-based EDT clustering method aims to improve the efficiency of
energy and increase the lifespan of networks in WCSNs

• The clustering problem might be solved by a variety of optimisation algorithms, but TCO
seems to be the method that is most efficient.

• The clustering problem might be solved by a variety of optimisation algorithms, but TCO
seems to be the method that is most efficient.

• TCO is a dynamic decision-making system that analyses nodes existence and rotational.

Tr max is decreased to Tr minimum by default in every iteration. The used heuristic data was
determined as follows:
MOO Pareto Optimization
Cluster Head Rotation
Energy efficiency can be defined as

‘e’ denotes energy efficiency, detects and transmits data, selects cluster head and
cluster formation. To compute energy efficiency of TDRE

Where indicates the energy limits of the main CHs in every round of
transmission of data. The threshold is expressed as ß = c.RE where 0 < c < 1.
The TDRE’s energy efficiency is evaluated utilizing the equation (3) = ; When
not using TDRE, TNST or TNSD are substituted by Eq. (8)
 Simulation Parameter

Parameters Description

Protocol for routing PMTCO based EDT clustering

Node with chemical sensors 50

Range of transmission 36m

Data traffic Constant bit rate

Initial energy 2.2j

Sleep power, Transmitted power, Received power, Ideal power 0.70, 0.56, 0.56, 0.34

Simulation times 10ms

Simulator result
 Network Lifetime

• PMTCO-based EDT method outperforms existing strategies in terms of durability

and longevity. The suggested PMTCO-based EDT technique produces efficient
outcomes while increasing the network lifetime by 41.2%.
 Through‑Put

• If the number of nodes rises from 5 to 10, the overall load of the PMTCO-based EDT
clustering method gradually increases from 0.49 to 0.58, which is lower than that of
other methods
 Energy Consumption

• The energy consumption of PMTCO-based EDT clustering falls from 38.28 J to

36.38 J as the number of nodes increases from 0 to 10.
Load Balancing
Modified k-means (Mk-means) algorithm for clustering

K-Means is intrinsically based on paired Euclidean distances between the points

of data.

Assume two locations in the two-dimensional plane, like (x1, y1) and (x2, y2).
The Euclidean distance formula is as follows,

d=
 Cluster heads Selection

Position of Random selection of Find distance among

nodes cluster head CH and nodes

Cluster Calculate centroid Grouping of nodes based

head position on distance and energy
 Firefly Algorithm
• Fire-Fly algorithm's objective function

 I=I0

I0 is the intensity of original fluorescence, 𝛾 is the fluorescence absorption

coefficient.

• Next-hop residual energy

• Euclidean Distance
 Load balancing Factor

Load Balancing Factor

50
45
40
35
30
25
20
15
10
5
0
1 2 3 4

k-means AODV IPC-KMAN proposed

 Packet Delivery Factor

Packet Delivery Factor

90

80

70

60

50

40

30

20

10

0
1 0.5 0.2 0.077

K-means AODV IPC-KMAN Proposed

 Throughput

Throughput
600

500

400

300

200

100

0
1 0.5 0.2 0.077

K-means AODV IPC-KMAN Proposed

 conclusion

• Clustering improves the performance of the network as only cluster heads

take part in the routing process.

• To decrease the energy loss during CH rotation, the Cluster Head was
also replaced

• The various technique enhances the network's performance in terms of the

load balancing factor, PDF, and throughput.