2018 2nd International Conference on Micro-Electronics and Telecommunication Engineering

Energy Efficient PEGASIS Routing Protocol for

Wireless Sensor Networks

Vinod Kumar Ajay Khunteta

Department of Electronics Engineering Department of Electronics Engineering
Rajasthan Technical University Rajasthan Technical University
Kota, India Kota, India
vinodkumargits@gmail.com akhunteta@rtu.ac.in

Abstract— Wireless Sensor Networks (WSN) for communication and sink. The leader node controls the communication order
between the nodes uses a different type of protocols. This paper by transitory a token between the nodes.
proposed improved Power-Efficient Gathering in Sensor
Information System (PEGASIS) chain based routing protocol.
The protocol are sensor nodes connected with next near nodes
and selects the leader node for communication to the base station
but this causes some problem when used for a long distance
between nodes and base station. Such problem causes large
transmission delay, selection of a leader, scalability, and
unbalanced energy consumption. For enhancing the performance
improved PEGASIS protocol is proposed which provides better
energy efficiency and good lifetime sensor networks as compared
to the unique PEGASIS protocol .

Keywords- WSN, Routing Protocol, PEGASIS protocol.

I. INTRODUCTION
The Wireless Sensor Networks are most popular
technology in the wireless communication field, it contains
two important components: first is multi-functional smart
sensor node and second base station. The multi-function, low
cost, low power consumption sensor nodes consists of more
than one the sensor, radio transducer, microcontroller, and
power supply. The nodes measure environmental, vibration,
sound, temperature, pressure, and noise to send all information
to the base station and motion at the different location.
The PEGASIS protocol is cluster chain based routing protocol
in which sensor node closed to the next neighbor node and
select leader node for information transmitted to a base
station. The one node information transmitted to the next
nearby neighboring node and this process continued two nodes
to fifty nodes, between these node selected leader nodes
transmit information to base station nodes. The PEGASIS
routing protocol is designed by the greedy algorithm. The
main working of greedy algorithm in a chain formation. The
design of chain that depend on the base station and broadcasts
to all the sensor nodes. So all nodes will transmit data and
received at the neighboring node and select a leader node for
data transmit to the base station.
The construction of PEGASIS protocol are divided into two
part, first is formation of chain by using greedy algorithm and
second is selection of leader for communication between node
Figure.1 Architecture of PEGASIS protocol for Wireless
Sensor Network.
This paper proposed that the better-quality of PEGASIS
protocol that selects leader node are accessible, stable, sink
node and which is perfectly located to all the nodes. The
communication between the nodes, leader, and sink are very
good, control on the unbalance energy consumption, easy to
scalability, needs very low maintenance and good lifetime of a
sensor networks. The paper structured as follows section II
include Greedy algorithm. Section III is the explanation
PEGASIS Protocol. Section IV is proposed works in we
explain theory and design of improvement PEGASIS routing
protocol. Section V simulation parameter and results and
sensation VI includes conclusion and acknowledgments.
II. GREEDY ALGORITHM
The greedy algorithm follows problem solving approach of
making the locally optimal choice at each stage with the hope
of finding a global optimum. So at each stage we select a
locally optimal value with the hope of getting to the best
possible solution. This is a useful programming methodology.

978-1-5386-6918-1/18/$31.00 ©2018 IEEE 91

DOI 10.1109/ICMETE.2018.00031
So this approach is simple, easy to code and implement, and leader node and leader node data transmission to the sink.
have reasonable running complexity. However the main During the working of a PEGASIS sensor networks, data
drawback for this method is, that there are very few cases fusion occurred. By the help of data fusion reduces the
wherein we end up getting the globally optimal value. quantity of data transmission between the nodes and base
With this example we will see how the algorithm makes station. Fusion data combination of one and additional data
locally optimal choices however ending up at an optimal packets form dissimilar sensor amounts to produce a signal
solution. packet. Gathered data transfers from node to node, get fused,
and eventually, a selected leader node transmits to the base
station.
IV. PROPOSED ENERGY EFFICIENT PEGASIS PROTOCOL
The construction of an original PEGASIS protocol based
on three steps: 1. Chain formation, 2. Leader selection, and 3.
Data transmission. But construction of proposed EE-PEGASIS
protocol are designing by following step. Firstly all PEGASIS
sensor network field divided into four part, In a first part node
Figure 2. The structure of Greedy Algorithm distribute in network field, example out of 100 node, 25 node
are distribute in one part of XY coordinate, than provide
So in this tree are required to get the largest root to leaf sum. energy and apply the greedy algorithm for chain formation,
That is starting form this root node here, we have to fine a than select the leader node that is nearest to the all nodes and
path ending at a leaf node and having sum of nodes as sink node. Apply energy and distance formula for
maximum. There are two possible path, 6 and 9 however here communication between the node and select sink node from
we make a greedy choice the one that is maximum i.e 9. The energy and distance to complete PEGASIS sensor network
total now is 15. Now once at 9 we have to choose between 11 formation. Remaining sensor node follow all process and
and 13. A greedy choice would be to select the larger of the formed (100 100) PEGASIS sensor networks.
two. We select 13 and end up having a path with sum as 25. If
we start form 5, go to 6 and then to 22, this path would give us
a sum of 33. Which is greater than the one we have achieved
through greedy method. So here we conclude that making START Calculate the sink dis
locally optimal greedy choices don’t always give us a globally form all nodes in 1
region
optimal value. Initial value
So, when are we supposed to use greedy methods. All problem ERX,ET X,EDA,EO ,
which are generally solution using greedy algorithms satisfy The chain formation
two properties between the alive
Distribution of sensor nodes in each round
node (25,50,75,10)
1. Greedy-Choice: The greedy-choice property, ie
making the best choice at a moment leading to a Find the nearest node
Flag operation for
global optimal. dead and Alive
not connected in chain
2. Optimal Substructure: The optimal Substructure,
problem whose optimal solution can be constructed Calculate energy of
efficiently form optimal solution of its sub problems. Find the average
Energy all stage node
This property may look similar to one in dynamic
programming however one thing to note here is that greedy Find most optimal
algorithm never reconsider its choices. This is the main Find the average energy
leader with highest
of Statistics round of all
difference form dynamic programming. Finally we look at four part
some application which uses greedy algorithms.
Calculate energy of
III. THE PEGASIS PROTOCOL The distribution of child nodes
energy in all nodes in
The PEGASIS protocol is modern part of LEACH four stage
protocol. The PEGASIS protocol best performance as equated Apply Counter for bit
to the LEACH protocol. In LEACH protocol wireless sensor transmitter
network cluster head formation. The simple nodes data Movement of sink, and
transmit to the cluster head and cluster head data transmit to chain formation by
Greedy algorithm End
the sink and vice versa in each round. But PEGASIS routing
protocol is a chain based protocol. The chain formed by the
greedy algorithm. The nodes are connected to the nearest
neighbor among unconnected nodes and so on. Than selected Figure 3. Flow chart of proposed Energy Efficient PEGASIS.
lead node for communication, the node data broadcast to the

92
Following Mathematical formula are applied for Emp (Multi path space routing 0.0013pj/bit/m
implementation of proposed EE-PEGASIS protocol energy displace )
Eda 5 nj/bit/signal
1. Distance between sink and nodes.
Efusion 5 nj/bit/message
D= (1)
do (maximum distance between the 78m
nodes)
Where A and B is the number sensor nodes in X and Y
coordinate respectively and xd and yd represent X and Y
coordinate.

2. Find the nearest node for any node not connected in the
chain.
DN=

(2)
Where i and j number of remaining sensor nodes in after
formation of chain

3. Selection of leader node

Q=S(i).Eo / D (3)

S(i) is represent sensor node of network field and Eo is initial

energy of nodes

4. Energy formula of Child node

S.E=S.E-(ETX×datanum)+(datanum × Emp)× (D)4 if D>do

S.E=S.E-(ETX×datanum) + (datanum × Efs) × (D)2
(4) Figure 4. Distribution of sensor nodes in Proposed
Energy Efficient PEGASIS Sensor Networks field.
V. SIMULATION PARAMETERS AND RESULT

The simulated proposed EE-PEGASIS routing protocol

with simulator MATLAB 2016b for performance analysis.
Simulation parameter taken are shown in the table.
Table I Simulation Parameters

Parameters Value

Network Size (100, 100) m

Number of Nodes 100

Eo (Initial Energy of Nodes) 0.5j

Number of Data/ Data Packet 2000 Bit

Eelec (Energy consumption for ETx 50 nj/bit

and ERx of the signal)

Efs (Free space routing energy 10 pj/bit/m

displace)
Figure 5. Energy Consumption per round in nj

93
 Where all protocols taken from reference PEGASIS[7],
PDCH[8] EPEGASIS[9].

VI. CONCLUSION
This paper present proposed EE-PEGASIS protocol.
Describe the idea of our protocol in detail, and simulate the
results in MATLAB. The better performance of proposed EE-
PEGASIS protocol uses the greedy algorithm to construct the
chain. The proposed EE-PEGASIS protocol provide short
distance between nodes and leader nodes. The performance of
leader nodes are very high as compared to the unique
PEGASIS and the selected sink is reachable to the all leader
nodes, these causes transmission delay very low, high
scalability, low power consumption, good lifetime , good
scalability, low maintenance and provide overall 55% better
performance than the original PEGASIS routing protocol.

ACKNOWLEDGMENT
Figure 6. Normalized Average Energy versus no. of rounds.
I would like to thanks a lot my supervisor, Dr. Ajay
Khunteta for his patient guidance, valuable, and constructive
suggestion. I would also like to thanks my friends and family
for their valuable suggestion and support.

REFERENCES

[1] Zheng Jun and jamalipour Abbas “Introduction of Wireless Sensor

Networks” Copyright form 2009 IEEE.
[2] Shraby Kazem, Minoli Danie “Wirel ess Sensor Networks Technology
Protocol and Application” Wiley ISBN 978-0-470-16763-2.
[3] Akyildiz F. Lan, Varan can varan “Wireless Sensor Networks” Wiley
2010.
[4] Zheng Jun and Jamalipour Abbas “Wireless Sensor Network A
Networking Perspective ” ISBN: 227-2834 Mar-App 2015.
[5] Gupta Shwtea, Marriwala “Improved Distance Energy Based LEACH
protocol for Cluster Head Election in Wireless Sensor Networks ” Signal
Processing, Computing and Control (ISPCC), 2017 4 th International
Conference, Solan , India. Page no: 91-96.
[6] Das Abhijeet and Rishikesh “ A Relative Survey of LEACH Based
Routing Protocol in Wireless Sensor Networks” International Conference
on Computing communication and and Automation (ICCCA) 2017
IEEE, Greater Noida, India . Page no 360-336.
[7] Misra Shreshtha and kumar Rakesh “ An Analytical Study of LEACH and
Figure. 7 Lifetime comparison Alive node versus no. of rounds. PEGASIS protocol in Wireless Sensor Network” International
Conference on Innovations Embedded and Communication System
(ICIIECS) 2017
[8] Nehra Vibha “PEGASIS-E Power Efficient Gathering in Sensor
Table II Comparison between PEGASIS, PDCH, EPEGASIS, Information System Extended” Global Journal of Computer Science and
PEEPEGASIS Technology Network, Web & Security USA Online ISSN: 0975-4172
January 2013
[9] Linpin Wang Cai Zhen Bi Wu and Wang Zufeng “Improved algorithm of
PEGASIS protocol introducing double cluster head in wireless sensor
Parameter PEGASIS PDCH EPEGASIS Proposed
networks” International Conference on Computer, Mechatronics, Control
(Rounds) EE-PEGASIS
and Electronis Engineering (CMCE) 2010 PP no: 148-151
First Node 1000 600 250 1450 [10] Guo Wenjing, Zhang Wei and Lu Gang “PEGASIS protocol in Wireless
Dead sensor Network based on an Improved Ant Colony Algorithm”. 2010
Second International Workshop on Education Technology and Computer
Half Nodes 1300 100 1500 2000 Science, IEEE Page no: 64-67.
Dead [11] Mahakud Rina and Rath Styanarayan “Energy Management in Wireless
Sensor network using PEGASIS” 2nd International Conference on
All Nodes 2000 2200 2800 4500 Intelligent Computing, Communication & Convergence (ICCC-2016) by
Dead ScienceDirect Bhubaneswar, Odisha, India Page no: 207-211.
[12] Sharama Ishu, Singh Rajvir and Khurana Meenu “Performance Evolution
of PEGASIS Protocol for WSN using NS2 ” International conference on

94
 Advances in Computer Engineering and applications (ICACEA) 2015
IMS Engineering College Ghaziabad, Indian, In IEEE Page no: 926-929.
[13] Boulhares Imane and Omari Mohhammed “Hybridizing PEGASIS with
LEACH-1R Protocol in Wireless Sensor Networks” 8 th International
Conference on Modelling, Identification and Control (ICMIC-2016)
Algiers, Algeria-November 15-17, 2016 IEEE, Page No: 1037-1042.
[14] Arati Manjeshwar and Dharma P. Agrawal “TEEN: A Routing protocol
for Enhanced Efficiency in Wireless Sensor Networks” Parallel and
Distribution Processing Symposium., Proceedings 15 th International.
IEEE, San Francisco, CA, USA.
[15] Samaragdakis Georgios, Matta Ibrahim “SEP: A Stable Election Protocol
for clustered heterogeneous Wireless Sensor Networks” Computer
Science Department Boston University.
[16] Ayood Muhammad, Zhen Qian and Adnan Adna “Research of
Improvement on LEACH and SEP Routing Protocol in Wireless Sensor
Networks” 2016 IEEE International Conference on Control and Robotics
Engineering (ICCRE). Singapore.
[17] Eibhiri Brahim, Rachid Saadane and Sanna E1 Fkihi “Developed
Distributed Energy-Efficient Clustering (DDEEC) for Heterogeneous
Wireless Sensor Networks” 2010 5 th IEEE International Symposium on
I/V Communication and Mobile Network. Rabat, Morocco. Page No. 1-4.
[18] Mr. Chuhan Tushar and Ms. Nayyer Meenakshi “Review on Energy
Efficient Protocol Based on LEACH, PEGASIS and TEEN” Emerging
Trends in Communication Technologies (ETCT), International IEEE
Conference. Dehradun, India.
[19] Webdi B.Heinzelman, Anantha P.Chandrakasam “ An Application
Specific Protocol Architecture for Wireless Sensor Networking” IEEE
Transaction on Wireless Communication, vol, 1 No.4 0ct0ber 2002.
[20] Raj Kummar tripathi “Base Station Positioning, Nodes Localization and
Clustering Algorithms for Wireless Sensor Networks” IIT Kanpur, India.
[21] Paril Saini and Ajay .K.Sharma “ Energy Efficient Scheme for Clustering
protocol prolonging the lifetime of Heterogeneous Networks”
International Journal of Computer Application Valume 6-No-2, sep 2010.
[22] C.S Raghavendra, Krishna M.Sivalingam Wireless Sensor Networks
eISBN 1-4020-7884-2006 Conference on Environmental Science and
Information Application Technology, vol2, pp.646-649.
[23] Xie.H, Zhang. Z.G, Zhou.X.G “A Novel Routing Protocol in Wireless
Sensor Network based on Ant Colony Optimization.” 2009 International
Conference on Environmental Science and Information Application
Technology, vol2, pp.646-649
[24] F. Ye et al. “A scalable solution to minimum cost forwarding in large
scale sensor network” In: Proceeding of International Conference on
Computer communication and Networking (ICCCN), Dallas, TX,
October 2001.
[25] Arman Anuja, Manth Nimisha and Kher Vansha “PEGASIS and Its
Descendent protocols: A Survey” International Journal of Electrical and
Dta Communication, ISSN:2320-2084 Volume-2 Issue-12, Dec.-2014 pp
15-19.
[26] Lindsey Stephanie and Cauligi S. Raghavendra “PEGASIS: Power-
Efficient Gathering in Sensor Information System” IEEE Aerospace
Conference.
[27] Lim Se-Jung and Myong-Soon Park “Energy-Efficient Chain Formation
for Data Gathering in Wireless Sensor Networks” Hindawi Publication
Corporation International Journal of Distributed Sensor Networks
Volume 2012, Article ID 843413, 9 pages doi:10.1155/2012/843413.
[28] Hsu Yen-ching Peng Kuan-Li and Huang Chin-Yu “ A study of Applying
Severity- weighted Greedy Algorithm to Software Test Case
Prioritization During Testing” Industrial Engineering and Engineering
Management (IEEM), 2014 IEEE conference ” Bandar Sunway,
Malaysia.
[29] MeGovern Seamus M and Gupta Surendra “Greedy Algorithm for
Disassembly Line Scheduling” System, Man and Cybernetics, 2003.
IEEE international Conference Washington, DC, USA.
[30] Kodaganallur Viswanathan and Sen Anup Kumar “Greedy By Chance-
Stochastic Algorithms Aotonomic and Autonomous System (ICAS), 2010
Sixth IEEE International Conference Cancun, Mexico.

95