RAJIV GANDHI COLLEGE OF ENGINEERING

AND TECHNOLOGY
DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

SOCIAL SPIDER OF OPTIMIZATION BASED ROUTING

PROTOCOL FOR AN ENERGY EFFICIENT WSN
COMMUNICATION

Under the Guidance of Presented By,

Mr.A. Alexander, Arunkumar S (20TC0052)
Assistant Professor, Yuvaramji S (20TC0072)
Dept of ECE. Sathish Kumar V (20TCL004)

Date: 19.09.2023
 CONTENTS

 Abstract
 Introduction
 Existing System
 Drawbacks
 Workplan
 References
 ABSTRACT
 WSNs are integral to daily life services, but their heterogeneous nature makes them
vulnerable to attacks, leading to issues like low throughput, high network delay, and
increased energy consumption.

 To proposes the use of four deep learning (DL) techniques and a real-time message
content validation (RMCV) scheme based on blockchain to detect malicious nodes
(MNs) within the WSN. DL models.

 To address single points of failure, a decentralized blockchain is deployed on cluster

heads (CHs) and the base station (BS) within the WSN.

 The results of routing with various protocols, including LEACH and HMGEAR are
compared, demonstrating improved accuracy through DL and blockchain-based
security measures.
 INTRODUCTION
 WSNs collect data from the environment and are applied in various domains such as
healthcare, smart cities, and the military. These networks operate autonomously,
transmitting data without human intervention, and employ different communication
protocols.

 WSNs face several challenges, including limited storage capacity and resource
constraints in sensor nodes.

 In the context of WSNs, blockchain serves as a secure storage mechanism and

facilitates data security, privacy, authentication, non-repudiation, and efficient
routing.
 The absence of mechanisms for detecting malicious activities within the network
allows malicious nodes (MNs) to potentially infiltrate and disrupt the network's
operation.
 EXISTING SYSTEM

 In existing, a Particle Swarm Optimization (PSO) Cluster Routing

Algorithm in WSNs was proposed.
 The PSO algorithm gives the basic concept of graph kernel,
discusses the principle of optimizing graph kernel and multi-
graph kernel, and proposes the basic principle based on d-hop
graph kernel.
 PSO algorithm uses shortest path (SP) to connect different
cluster head nodes for packet transmission.
 EXISTING SYSTEM

 In WSN, each node has information about relative speed. The

cluster-head algorithm can contain two parts: the cluster-head
mechanism based on c means selection and the cluster-head
maintenance mechanism.
 The proposed algorithm compares the structural information of
nodes to obtain their similarity and uses these similarities to predict
links and cluster-heads.
 The input is the entire WSN. The output is the predicted link and
cluster-header. The proposed method includes three stages:
subgraph generation, kernel calculation and kernel classification.
 DRAWBACKS

 Energy optimization remains one of the most important

challenges since it is directly related to the network life- time.
 Existing system uses the fuzzy c means algorithm for the
purpose of delay minimization.
 The fuzzy c means algorithm will be complex when we are using
more no of nodes in multiprocessor system.
 Energy consumption is high is the uncovered regions.
 Delay occurs while data is transmitted in the uncovered area.
 WORKPLAN

Phase-1
 Literature Survey
 Implementation of Existing System
 Journal Publication-1
Phase-2
 Implementation of Proposed System
 Comparison of Existing & Proposed System
 Journal Publication-2
 REFERENCE
 L. Gerstein, “Integral quadratic forms and graphs,” Linear Algebra and Its Applications, vol. 585, pp.

60-70, 2020. DOI: 10.1016/j.laa.2019.09.032.

 B. L. Sun, C. Gui, Y. Song, H. Chen, “Network Coding-based Maximum Lifetime Algorithm for Sliding

Window in WSNs,” KSII Transactions on Internet and Information Systems, vol. 13, no. 3, pp. 1298–

1310, 2016. DOI: 10.3837/tiis.2019.03.010.

 Q. F. Zhang, Y. Song, B. L. Sun, Z. F. Dai, “Design of Routing Protocol for Opportunistic Network

Based on Adaptive Motion,” IEEE Access, vol. 8, pp. 18228 – 18239, 2020. DOI:

10.1109/ACCESS.2020.2968598.
 T. Rahman, I. Ullah, A. U. Rehman, R. A. Naqvi, “Clustering Schemes in WSNs: Performance

Evaluation, Open Challenges, and Proposed Solutions,” IEEE Access, vol. 8, pp. 25135–25158, 2020.

DOI: 10.1109/ACCESS.2020.2970481.
 Y. Z. Wang, H. B. Sun, Y. Zhao, W. G. Zhou, S. F. Zhu, “A Heterogeneous Graph Embedding

Framework for Location-Based Social Network Analysis in Smart Cities,” IEEE Transactions on

Industrial Informatics, vol. 16, no. 4, pp. 2747-2755, 2020. DOI: 10.1109/TII.2019.2953973.