Wireless Sensor Network Protocol With PEGASIS GA To Enhance The Network Lifetime
Wireless Sensor Network Protocol With PEGASIS GA To Enhance The Network Lifetime
Volume 5 Issue 2, January-February 2021 Available Online: www.ijtsrd.com e-ISSN: 2456 – 6470
@ IJTSRD | Unique Paper ID – IJTSRD38645 | Volume – 5 | Issue – 2 | January-February 2021 Page 1075
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
Location-based Protocols It is self-adaptive and self-organized. LEACH protocol uses
Sensor nodes are named by means of their locations in round as unit, each round is made up of cluster set-up stage
location-based protocols. The distance of position and steady-state stage, for the purpose of reducing
information sensor networks between two unique energy unnecessary energy costs, the steady stage must be much
consumption nodes can be determined. longer than the set-up stage.
Hierarchical Protocols Advantages
Clustering is an energy-efficient communication protocol in Outperforms conventional routing protocols
the hierarchical Clustering protocol that can be used by the LEACH is completely distributed, requiring no control
sensors to circulate their sensed data to the sink. information from the base station
Nodes do not need global topology information
Data Centric Protocols
Data is delivered from source sensors to the sink in data- Disadvantages
centric protocols, as the source sensors circulate. Their data Nodes must have data to send in the allotted time
to the sink; some form of aggregation can be done by Perfect correlation is assumed, which might not be true
intermediate sensors on the data originating from several always
source sensors and the aggregated data can be sent into
PEGASIS
the[5] sink. Due to lower transmission needed to transmit
PEGASIS is Power-Efficient Gathering in Sensor Information
the data from the sources to the sink, this process will result
Systems. PEGASIS form open chain staring from node which
in energy savings.
is farthest from Base Station .PEGASIS assume that global
LEACH information is available. This algorithm uses greedy
LEACH is the first network protocol that uses hierarchical algorithm for chain construction. Before first round of
routing for wireless sensor networks to increase the life time communication chain formation is done. During formation of
of network. All the nodes in a network organize themselves chain care must be taken so that nodes already in chain
into local clusters, with one node acting as the cluster-head. should not revisited .When a node die then chain is
All non-cluster-head nodes transmit their data to the cluster- reconstructed by bypassing that node. In data gathering
head, while the cluster-head node receive data from all the cycle each node forms a[8] data packet of its own in network.
cluster members, perform signal processing functions on the For each data gathering cycle leader is elected among all
data (e.g., data aggregation), and transmit data to the remote nodes in network. Each node in network receives a data
base station. Therefore, being a cluster-head node is much packet and fuses it with its own data and forwards it to other
more energy-intensive than being a non-cluster-head node. neighbouring node. PEGASIS uses a simple token passing
Thus, when a cluster-head node dies all the nodes that approach which is initiated by leader to start data
belong to the cluster lose communication ability. transmission from ends of chain.
LEACH incorporates randomized rotation of the high-energy GENETIC ALGORITHM
cluster-head position such that it rotates among the sensors The Genetic Algorithm is a heuristic search algorithm
in order to avoid draining the battery of any one sensor in focused on natural selection and evolution principles.
the network. In this way, the energy load associated with Genetic algorithms are evolutionary algorithms (EA) that use
being a cluster-head is evenly distributed among the nodes. genetic operators, such as mutation, selection and crossover,
Since the cluster-head node knows all the cluster members, to solve optimization problems. In a genetic algorithm, the
it can[6][7] create a TDMA schedule that tells each node candidate solution (fitness value) is created by developing a
exactly when to transmit its data. In addition, using a TDMA population of chromosomes. The chromosome population is
schedule for data transfer prevents intra-cluster collisions. generated randomly.
The operation of LEACH is divided into rounds. Each round
Results and Discussion
begins with a set-up phase when the clusters are organized,
The work performed requires applying the PEGASIS
followed by a steady-state phase where several frames of
protocol. The protocol is implemented using the traditional
data are transferred from the nodes to the cluster-head and
PEGASIS implementation form, Greedy Chain. The Genetic
onto the base station. Hierarchical protocols are defined to
Algorithm is then used to execute it. From the farthest node
reduce energy consumption by aggregating data and to
from the base station, the greedy chain initiates the creation
reduce the transmissions to the Base Station. LEACH is
of the chain. The next node, at a smaller distance from the
considered as the most popular routing protocol that use
others, is picked. So the inter-nodal distances are
cluster based routing in order to minimize energy
determined and the nodes are chosen. During this process,
consumption.
the distances start to increase towards the end of the chain,
Low Energy Adaptive Clustering Hierarchy (LEACH) protocol resulting in further dissipation of energy. All simulations
is a TDMA based MAC protocol. The principal aim of this were performed on an area of 100m*100m and nodes were
protocol is to improve the lifespan of wireless sensor distributed randomly in this field. Using 100 nodes, the
networks by lowering the energy consumption required to implemented protocol PEGASIS is simulated. PEGASIS uses a
create and maintain Cluster Heads. LEACH Protocol is a greedy approach and a Genetic Algorithm to construct the
typical representative of hierarchical routing protocols. chain. Each node has an initial energy level that is the same.
1. First energy is .5
Protocol 10 20 30 40 50 60 70 80 90
LEACH 1500 1560 1610 1700 2000 2250 2310 2450 2650
PEGASIS 2260 2320 2360 2420 2460 2500 2570 2630 2740
PEGASIS (GA) 2930 2990 3225 3420 3500 3610 3790 4250 4800
@ IJTSRD | Unique Paper ID – IJTSRD38645 | Volume – 5 | Issue – 2 | January-February 2021 Page 1076
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
@ IJTSRD | Unique Paper ID – IJTSRD38645 | Volume – 5 | Issue – 2 | January-February 2021 Page 1077
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
International Journal of Engineering Research & Monitoring Alerting and Controlling System”,
Technology, Vol 3, Issue 10, October 2014. International Conference On Information
Communication And Embedded Systems IEEE, on 25-
[6] Md. Golam Rashed and M. Hasnat Kabir, “WEP: an
26 Feb 2016, pp. 978-1-5090-2552- 7/16/
Energy Efficient Protocol for Cluster Based
Heterogeneous Wireless Sensor Network”, [13] Anwar, Raja & Bakhtiari, Majid & Zainal, Anazida &
International Journal of Distributed and Parallel Qureshi, Kashif. (2015). A Survey of Wireless Sensor
Systems (IJDPS), 2011. Network Security and Routing Techniques. Research
Journal of Applied Sciences, Engineering and
[7] Ashok Kumar and Narottam Chand, “Location Based
Technology. 9. 116-1026. 10.19026/rjaset.9.2595.
Clustering in Wireless Sensor Network”, World
Academy of Science, Engineering and Technology, [14] Xunpeng Rao1, Panlong Yang1,2,3, Yubo Yan1,
2011. (Student Member, Ieee), Hao Zhou2, (Member, Ieee),
And Xuangou Wu4 China, in “Optimal Recharging
[8] F Bai, H. Mu and J. Sun “Power Efficient Zoning
With Practical Considerations in Wireless
Clustering Algorithm for Wireless Sensor Networks”.
Rechargeable Sensor Network”, date of publication
In the proceedings of the Information Engineering
February 8, 2017, date of current version April 24,
and Computer Science, 1-4, 2011.
2017, pp. 4401-4409
[9] W. Yang and W. T. Zhu “Voting- o n Grid Clustering for
[15] Beihua Ying, School of Information Science and
source localization in Wireless Sensor Networks”, in
Engineering, Ningbo Institute of Technology, Zhejiang
the proceedings of International Conference on
University, Ningbo, “An Adaptive Compression
Communication, 1 -5, 2014.
Algorithm for Energy-Efficient Wireless Sensor
[10] Xiaohan Li, Fengpeng Yuan and JanneLindqvist Networks” in Advanced Communication Technology
Rutgers University, “Feasibility of Software-Based (ICACT), 2017 19th International Conference
Duty Cycling of GPS for Trajectory-Based Services”, in Bongpyeong, South Korea on 19-22 Feb. 2017, pp.
2016 13th IEEE Annual Consumer Communications & 861-868
Networking Conference (CCNC) on 9-12 Jan. 2016, pp.
[16] Farooq, Umer. (2019). Wireless Sensor Network
293-306
Challenges and Solutions.
[11] MassinissaSaoudi, AhceneBounceur, Reinhardt Euler, 10.13140/RG.2.2.22191.59043.
TaharKechadi and Alfredo Cuzzocrea in,
[17] Kumari, Usha & Padma, Tatiparti. (2019). Energy-
“EnergyEfficient Data Mining Techniques for
Efficient Routing Protocols for Wireless Sensor
Emergency Detection in Wireless Sensor Networks”,
Networks: Proceedings of ICSCSP 2018, Volume 2.
in 2016 Intl IEEE Conferences 2016, pp. 766 – 771
10.1007/978-981-13-3393-4_39.
[12] K. Lokesh Krishna, J. Madhuri, Dr. K. Anuradha, “A
ZigBee based Energy Efficient Environmental
@ IJTSRD | Unique Paper ID – IJTSRD38645 | Volume – 5 | Issue – 2 | January-February 2021 Page 1078