Lodhi final viva voce

Energy-Efficient Routing Protocol for enhancing network
lifetime and performance in Wireless Sensor Networks
Amairullah Khan Lodhi (121PG05201)
Research Scholar
Under the Esteemed Guidance of
Dr. M. S. S. Rukmini (Supervisor)
Prof. ECE, VFSTR, Vadlamudi, Guntur.(A.P.)
(Deemed to be University)
Dr. Syed Abdul Sattar (Co-Supervisor)
Principal & Prof. ECE,
Nawab Shah Alam Khan College of Engineering & Technology, Hyderabad.

Year of Registration April 2013
Pre-Ph.D. Pass Percentage 67%
No. of DRCs completed 10
No. of Research publications 18
Journals 07 Scopus Index (6 Unpaid + 1 Paid)
Conferences 07 (1 IEEE+ Springer)
Communicated Journals 02 (1 SCIE + 1 Unpaid Scopus)
Communicated Conferences 02 (1 Springer + 1 )
Workshops/Seminars/FDPs
Attended
08
9/10/2020
Ph.D. Details
2

Outline
• Introduction
• Objectives and scope of the Research
• Literature review
• Research gaps identification based on literature review
• Proposed Methodology
• Proposed models and results
• Conclusions & Future Scope of research
• Action Taken Report
• Details of publications in Journals & Conferences
• References
9/10/2020
3

It is all about that, how well the sensor field be monitored
• Worst-case: In which path is avoided by the sensors detection
• Best-case : In which path is best monitored by the sensors.
Introduction
Routing Path Cases
9/10/2020 6

Introduction
Applications
9/10/2020 7

Objectives & Scope of the Work
Objective1 (a):- Computing high energy packet forwarding path: - It is achieved by the
computation of routing path which is free from packet drop due to constrained
energy.
Objective1 (b):- Finding non-congest node for communication: - It is achieved by the
selection of neighbor node which is free from packet drop due to the buffer
overflow.
Objective 1 (a) + Objective 1 (b) = EBRS ( It removes the Bottleneck Issue)
Objective2:- Determining sink mobility: - It is achieved by selecting the neighbor node
to the sink in such a way that the packet drop due to constrained energy and buffer
from the neighbor node should not happen.
9/10/2020 8

Literature Review
Energy & Buffer Residual Status
Authors Title Work Applications/Limitations
Nikolaos A.
Pantazis, Stefanos A.
Nikolidakis and
Dimitrios D.
Vergados, Senior
Member, IEEE
“Energy-Efficient Routing
Protocols in Wireless Sensor
Networks: A Survey.”
IEEE Communications
Surveys & Tutorials, Vol. 15,
No. 2, Second Quarter 2013.
An analytical survey on energy efficient
routing protocols for WSNs is provided.
The classification initially proposed by Al-
Karaki, is expanded, in order to enhance all
the proposed papers since 2004.
It better describes which operations is to be
used in each protocol to enhance the energy
efficiency issues.
It uses a mobile agent
which migrates among the
nodes of a network to
perform a task based on the
environment conditions
autonomously and
intelligently.
 Not discuss about the
mobile agents energy &
Buffer Status.
DiTang, Tongtong
Li, Jian Ren,
SeniorMember,
IEEE, and Jie Wu,
Fellow, IEEE
“Cost-Aware SEcure
Routing(CASER) Protocol
Design for Wireless Sensor
Networks”
IEEE Transactions On Parallel
And Distributed Systems, Vol.
26, No. 4, April 2015 1045-
9219.
Presented a secure and efficient Cost-Aware
SEcure Routing (CASER) protocol for WSNs.
 It balance the energy consumption and
increase network lifetime.
Have to investigate the
impact of node buffer.
9/10/2020 9

Literature Review
R. Saranya and R.
Dhanalakshmi
“Balancing Energy
Consumption to Maximize
Network Lifetime Using
Particle Swarm Optimization
in Wireless Sensor Networks”
Middle-East Journal of
Scientific Research 23 309-
313, 2015 ISSN 1990-9233©
IDOSI Publications, 2015
This work divides the network into small
grids.
 Each grid has a relative location based on
the distance between the neighboring grid
information.
The node in each grid with the highest
energy level is selected as the head node for
message relative location forwarding.
Finds Neighbor node
distance for
communication
But not deals with
nodes residual status
about energy and buffer.
Biyu Zhou, Fa Zhang,
Lin Wang, Chenying
Hou, Antonio Fernández
Anta, Senior Member,
IEEE, Athanasios V.
Vasilakos, Senior
Member, IEEE, Youshi
Wang, Jie Wu, Fellow,
IEEE, and Zhiyong Liu
“HDEER: A Distributed
Routing Scheme for Energy-
Efficient Networking”
IEEE Journal On Selected
Areas In Communications,
Vol. 34, No. 5, May 2016
HDEER is a two-stage routing scheme
where a simple distributed multipath finding
algorithm is firstly performed to guarantee
loop-free routing
 Then a distributed routing algorithm is
executed for energy-efficient routing in each
node among the multiple loop-free paths.
Extensive simulations
shows that this scheme
faces traffic delay &
overhead issues compared
to shortest path routing.
9/10/2020
10

Literature Review
Jian Shen,
Member, IEEE,
Anxi Wang,
Chen Wang,
Patrick C. K.
Hung, Member,
IEEE, and Chin-
Feng Lai, Senior
Member, IEEE
“An Efficient Centroid-based
Routing Protocol for Energy
Management in WSN-
Assisted IoT”
IEEE Access 2017
It gives the cluster formation technique that
enables the self-organization of local nodes.
A new series of algorithms for adapting clusters
and rotating the cluster head (CH) based on the
centroid position to evenly distribute the energy &
load among all sensor nodes
A new mechanism to reduce the energy
consumption for long-distance communications.
Residual energy of nodes is considered in EECRP
for calculating the centroids position.
Can be improve further by
finding the multi-hop path
from the CH nodes to BS.
We hope that our protocol
can perform well when the
BS is located outside of the
network.
Halil Yetgin,
Kent Tsz Kan
Cheung,
Mohammed El-
Hajjar, Senior
Member, IEEE,
and Lajos
Hanzo, Fellow,
IEEE
“A Survey of Network
Lifetime Maximization
Techniques in Wireless
Sensor Networks”.
IEEE Communications
Surveys & Tutorials, Vol. 19,
No. 2, Second Quarter 2017
It reviews the recent developments in WSNs,
including their applications, design constraints, and
lifetime estimation models.
Commencing with the portrayal of rich variety
definitions of NL design objective used for WSNs
The family of NL maximization techniques is
introduced and some design guidelines with
examples are provided to show the potential
improvements of the different design criteria.
Robust optimization can
be used for mitigating the
effects of unavoidable
errors imposed.
9/10/2020 11

Literature Review
Gaukhar
Yestemirova, Sain
Saginbekov
“Efficient Data Aggregation
in Wireless Sensor Networks
with Multiple Sinks”
2018 IEEE 32nd
International Conference on
Advanced Information
Networking and Applications
It defines the data aggregation problem in
WSNs with multiple sinks.
It proposes two data aggregation algorithms
for a WSN with multiple sinks that minimize
the number of data packet transmissions
during data collection.
Not focusing on developing
node-failure tolerant
algorithms that solve the above
problem .
Have to conduct experiments
on real test beds.
Ahc`ene Bounceur,
Madani Bezoui,
Massinissa Lounis,
Reinhardt Euler,
Ciprian Teodorov
“A New Dominating Tree
Routing Algorithm for
Efficient Leader Election in
IoT Networks”
15th IEEE Annual Consumer
Communications &
Networking Conference
(CCNC) 2018
Presents a new algorithm, which is based
on a tree routing protocol.
This algorithm turns out to be low energy
consuming with reduction rates that can
exceed 85%.
 It is efficient and fault-tolerant since it
works in the case where any node can fail
and in the case where the network is
disconnected.
It talks about the Leader
selection but bottleneck issues
were not dealt.
9/10/2020 12

Literature Review
Salim EL KHEDIRI,
Adel THALJAOUI,
Adel Dallali, Souli
HARAKTI,
Abdennaceur
KACHOURI
“A novel connectivity
algorithm based on
shortest path for wireless
sensor networks”
IEEE 2018
A new centralized hierarchical cluster-
based routing algorithm is proposed.
It aims to mitigate energy consumption
and prolong the lifetime of WSN’s.
There remains a great need
for further research for buffer
for the nodes having high
energy capacity.
Niwat
Thepvilojanapong,
Yoshito Tobe, Kaoru
Sezaki
“On the Construction of
Efficient Data Gathering
Tree in Wireless Sensor
Networks”
2005 IEEE.
 Proposed an Efficient Data GathEring
(EDGE) protocol which satisfies
requirement by avoiding both flooding and
periodic updation of the routing packets.
Tree created by EDGE will be
reconstructed upon node failures or adding
of new nodes.
It is more robust against high
offered loads than the existing
solutions.
Application in sensor
networks that incurs high traffic
load is structure health
monitoring (SHM).
9/10/2020 13

Literature Review
Millad Ghane, Amir
Rajabzadeh
“Remaining Energy
Based Routing Protocol
for wireless sensor
networks” IEEE 2010
Presents an energy efficient routing
protocol called as Remaining Energy
Based Routing (REB-R).
The idea behind REB-R is to broadcast
the remaining energy of the node along
with the data in the data packet instead of
calculating a parameter related to
remaining energy.
Many protocols were offered
for minimizing the networks
total dissipation of energy.
This work will effect the
application of wireless sensor
networks.
9/10/2020
14

Literature Review
Mobile Sink Node
Kyung Tae Kim,
Man Youn Kim, Ji
Hyeon Choi, Hee
Yong Youn
“An Energy Efficient
and Optimal
Randomized Clustering
for Wireless Sensor
Networks”
2015 IEEE
The proposed scheme decides optimal number of
clusters by employing a new approach for setting
threshold value, including the probability of optimum
number of cluster heads and residual energy of the
nodes.
It also introduce a new approach for maximize the
network lifetime by tree construction in each cluster.
Mobility in sensor
network is an ever-growing
requirement in recent
applications.
Extension of the proposed
scheme to cope with the
mobility and the related
challenges is yet another
important issue remaining as
future work.
Hiren Kumar
Deva Sarma,
Member, IEEE,
RajibMall, Senior
Member, IEEE,
and Avijit Kar
“E2R2: Energy-
Efficient and Reliable
Routing for Mobile
Wireless Sensor
Networks”
IEEE Systems Journal,
Vol. 10, No. 2, June
2016
Ensures a specified throughput level at the BS.
Depending on Considering the reliability aspect of the
protocol.
It puts best effort for the topology of the network.
 The data transmission from the CH node to the BS is
carried out either directly or in multi-hop fashion.
Moreover, alternate paths are used for data
transmission between a CH node and the BS.
This work can be
extended to improve the
throughput even in the high-
data-rate situation.
The proposed protocol can
be also tested under the
influence of highly mobile
sensor nodes.
9/10/2020 15

Literature Review
Mobile Sink Node
Z. Maria Wang,
Stefano Basagni,
Emanuel
Melachrinoudis
and Chiara
Petrioli
“Exploiting Sink
Mobility for
Maximizing Sensor
Networks Lfetime”
Proceedings of 38th
Hawaii International
Conference on System
Sciences-2005.
The objective is to maximize the overall lifetime of
the network rather than minimizing the energy
consumption at the nodes.
 This model presents sink movement patterns and
simulation time leading to a network lifetime up to
almost five times that obtained with a static Sink.
Have to investigate the
impact of mobile sink on
network performance such
as network lifetime
enhancement.
9/10/2020 16

Research gap identification
1. None of the existing protocols consider the Bottleneck issue.
What is Bottleneck ?
Case I: If nodes residual energy is less than threshold value, Then
i. Node will drop the packet and unable to process the packet
ii. Node becomes bottleneck node.
Case II: If a node is accepting heavy traffic due to its high current energy, it will drop
the packets because of its limited buffer and processing capacity and hence lose its
energy instantly and becomes bottleneck.
2. None of the existing protocol calculates the Packet processing capacity of the node
with respect to residual energy and the buffer.
3. None of the existing protocol discusses about the EBRS of the mobile sink
(Neighbour node) and its EBRS.
9/10/2020 17

Research Gap Identification
9/10/2020 18

Problem Formulation
The Performance of the Existing work can be enhanced by doing following
improvements.
1. Mitigating the Packet drop due to energy and buffer.
2. Detecting the Intermediate nodes becoming bottleneck.
3. Exploiting sink mobility
 Thus the aim is to combine both the prevention of bottleneck node and the sink
mobility in a single process to design and implement the proposed routing
protocol “Energy-Efficient Routing Protocol for enhancing network lifetime and
performance in Wireless Sensor Networks” to enhance the Network Lifetime
and improve the Performance in WSNs.
9/10/2020 20

Proposed Methodology
9/10/2020 21

Proposed Model-1(a)
Mathematical Presentation of Residual Energy
9/10/2020
22

Proposed Model-1(a)
9/10/2020 23

Proposed Algorithm-1(a) for Node Residual Energy
Parameters for computing Node Residual Energy for high
packet forwarding path are (E, )
Algorithm:
Packet must in process == true
If ( )
Compute ( )
If ( )
Include the Node in routing process
Else
Node can not participate in routing process
9/10/2020 24

Proposed Model-1(b)
 This model is used to control the input traffic of an intermediate node
and to decide the node to become part of the route or not
 It will also give,
i. The Average queue length at the input buffer
ii. The Average waiting time in the buffer
9/10/2020
25

Proposed Algorithm1(b): Prevent Packet Drop Due to Buffer
The average packet waiting time at buffer can be computed as follows
Where,
1. Preventing Packet Drop due to buffer overflow ( Qavrg, Qthre, Tavrg )
2. If ( ))
3. Node is not allowed for communication
4. If ( )
5. Node is not allowed for communication
6. Else
7. Node is allowed for communication
9/10/2020
26

Calculating Node Current Residual Status
To meet Objective-1, that is avoid the packet loss and For calculating the
EBRS value of the node
By combining the Model 1 (a) & Model 1 (b)
“EBRS of the node” with respect to
 Current Traffic at Node Buffer
 Residual Energy of the Node
9/10/2020
27

Proposed Algorithm 2 (1(a)+1(b)) for Node Selection
Based on Current Residual Status
9/10/2020
Procedure for the Calculation of the Current Residual Condition of
the Node
( CR, CRmax, CRmin )
{
Compute the CR from the Previous Algorithm
If ( CR > CR max)
Node will participate in Routing
else if
( CRmax < CR < CRmin )
Node acts as a backup node
else
(CR < CRmin )
Node does not participate in routing
}
28

Simulator & Metrics Used
 The Comparison of the Proposed work is done for getting Performance Outcomes
by considering the following metrics
1. Throughput
2. Packet Delivery Fraction
3. Remaining Energy
4. Overhead
5. Lifetime
 All these metrics are related to the performance and lifetime of the WSNs [Nikolaos
A. Pantazis, et. all.] [Reference 1]
 The Improvement in these metrics leads to Networks Lifetime Enhancement
[DiTang, Tongtong Li, et.all.] [Reference 2]
Implemented the Proposed Work on Network Simulator (Version NS-2.34 / 2.35)
9/10/2020
29

Simulation Parameters
Network Parameters Values
Simulation Duration 1000 sec
Number of Nodes 10 to 400
Link Layer Logical Link
MAC 802.11
Mobility
Network layer
Communication
Random way point
SKA, ACK, Proposed
Two-Ray Ground
Queuing Technique Drop-Tail priority
Energy of the battery 10jouls
Network Traffic Constant bit rate
Area of Network 1000m x1000m
9/10/2020 30

Performance Analysis
Packet Delivery Fraction: It is the percentage ratio of packets successfully received at
the destination to the total packets sent by the source.
Table 1: Packet Delivery Fraction (PDF) analysis of existing & proposed methods
Number
of nodes
Existing-1
(Nikolaos et. all.)
%
Existing-2
(Di Tang et. all.)
%
Proposed-1
with Bottleneck
%
Proposed-2
without Bottleneck
%
10 14.1400 45.4950 90.0693 91.091
20 18.5024 50.4950 92.0396 93.042
30 25.8514 52.0752 93.9901 96.009
40 30.148 75.247 96.0604 99.640
9/10/2020 31

Throughput : It is the number of data packets processed within a specified amount of
time.
Table 2: Throughput analysis of existing & proposed methods
Number
of nodes
Existing-1
(Nikolaos et. all.)
Kbps
Existing-2
(Di Tang et. all.)
Kbps
Proposed-1
with Bottleneck
Kbps
Proposed-2
without Bottleneck
Kbps
10 0.1178 0.2311 0.3466 0.3910
20 0.1834 0.2923 0.3672 0.4351
30 0.2248 0.3154 0.4178 0.5311
40 0.3560 0.4865 0.5697 0.7910
9/10/2020
32

Overhead: It is the amount of the control packets transmitted for routing to the actual
data packets transmitted in the network.
Number of
nodes
Existing-1
(Nikolaos et. all.)
Existing-2
(Di Tang et. all.)
Proposed-1
with Bottleneck
Proposed-2
without Bottleneck
10 520 359 48 17
20 785 483 55 28
30 807 929 70 41
40 1075 1142 92 50
9/10/2020
Table 3: Overhead analysis of existing & proposed methods
33

Energy Efficiency: It is the ratio between total amount of data delivered and
total energy consumed.
Number of
nodes
Existing-1
(Nikolaos et. all.)
%
Existing-2
(Di Tang et. all.)
%
Proposed-1
with Bottleneck
%
Proposed-2
without Bottleneck
%
10 77.372 51.236 79.711 96.9583
20 51.6144 47.316 72.089 89.9108
30 34.8575 31.4207 68.124 82.4479
40 26.7283 20.6939 66.2662 78.6497
9/10/2020
Table 4: Energy Efficiency analysis of existing & proposed methods
34

Simulation Results
Packet Delivery Fraction: It is the percentage ratio of packets successfully
received at the destination to the total packets sent by the source.
9/10/2020 35

Simulation Results
Throughput: It is the number of data packets processed within a specified
amount of time.
9/10/2020 36

Simulation Results
Remaining Energy: It is the available energy of the node after processing
the data packets.
9/10/2020 37

Simulation Results
Remaining Energy
9/10/2020
38

Simulation Results
PDF vs Average Remaining Energy
9/10/2020
39

Simulation Results
Throughput vs Average Remaining Energy
9/10/2020 40

Network Lifetime Enhancement
9/10/2020
41

Proposed Algorithm 3 for Sink Mobility
9/10/2020 42

Packet Delivery Fraction: It is the percentage ratio of packets successfully received at
the destination to the total packets sent by the source.
Table 5: PDF analysis of existing & proposed methods
Number of
nodes
Existing
(Kyung et. all.)
%
Proposed-1
EBRS
%
Proposed-2
Mobile Sink
%
10 45.4950 91.091 93.01
20 50.4950 93.042 95.202
30 52.0752 96.009 98.23
40 75.247 99.640 99.863
9/10/2020 43

Throughput : It is the number of data packets processed within a specified amount of
time.
Table 6: Throughput analysis of existing & proposed methods
Number of
nodes
Existing
(Kyung et. all.)
Kbps
Proposed-1
EBRS
Kbps
Proposed-2
Mobile Sink
Kbps
10 0.2311 0.3910 0.421
20 0.2923 0.4351 0.741
30 0.3154 0.5311 0.610
40 0.4865 0.7910 0.8134
9/10/2020 44

Overhead: It is the amount of the control packets transmitted for routing to the actual
data packets transmitted in the network.
Table 7: Overhead analysis of existing & proposed methods
Number of
nodes
Existing
(Kyung et. all.)
Proposed-1
EBRS
Proposed-2
Mobile Sink
10 159 17 13
20 283 28 21
30 329 41 37
40 442 50 42
9/10/2020
45

Energy Efficiency: It is the ratio between total amount of data delivered successfully
and total energy consumed.
Table 8: Energy Efficiency analysis of existing & proposed methods
Number of nodes Existing
(Kyung et. all.)
%
Proposed-1
EBRS
%
Proposed-2
Mobile Sink
%
10 79.711 96.9583 97.583
20 72.089 89.9108 90.9108
30 68.124 82.4479 84.4479
40 66.2662 78.6497 81.6497
9/10/2020 46

Simulation Results
Packet Delivery fraction (PDF):
9/10/2020
47

Simulation Results
Remaining Energy: It is the available energy of the node after
processing the data packets.
9/10/2020
48

Simulation Results
Overhead: It is the amount of the control packets transmitted for routing
to the actual data packets transmitted in the network.
9/10/2020
49

Simulation Results
Throughput: It is the number of data packets processed within the
specified amount of time.
9/10/2020
50

Simulation Results
Remaining Energy
9/10/2020
51

Simulation Results
Life Time : It is the time until the first node energy runs out
In the network.
9/10/2020 52

Simulation Results
Over Head: It is the amount of the control packets transmitted for routing to the
actual data packets transmitted in the network.
9/10/2020
53

Simulation Results
Throughput:
9/10/2020
54

Conclusion (Objective-1)
The Proposed work
 Improves the network performance
 Reduces the packet loss by removing the congested nodes
 It avoids the constrained nodes from the routing path.
 It works on Energy as well as Buffer Residual status (EBRS) of the node.
9/10/2020
55

Conclusion (Objective-2)
 In this work, a routing protocol is designed for lifetime enhancement in WSN
with mobility consideration.
 It improves the network performance and reduces the packet loss by removing
the congested and constrained nodes from the routing path.
 It elaborates network performance by making sink node mobile based on the
load status of its neighbor node.
9/10/2020 56

FUTURE SCOPE Of The WORK
 This work may be used in Intrusion Detection And Prevention Systems to
enhance the security in WSN.
 In future by doing Battery-less Sensing this work can improve the performance of
WSN with Energy Harvesting Concept.
 It can be implemented with Nano-scale Wireless Nodes in future due to which it
can Elaborate The Networks Lifetime and Minimize The Power Consumption
in broadways.
9/10/2020 57

Papers Published in International Journals
1. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “Lifetime and
Performance Enhancement in WSN by Energy-Buffer Residual Status of Nodes and
The Multiple Mobile Sink” TEST Engineering and Management (Unpaid Scopus),
Vol.82, pp. 3835-3845 on 20th January2020.
2. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “Energy efficient
Routing Protocol for Life Enhancement in Wireless Sensor Networks” Recent
Patents on Computer Science (Unpaid Scopus), Vol.12, no.1. pp. 01-10, 2019.
DOI : 10.2174/2213275912666190619115304.
3. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “Energy-Efficient
Routing Protocol Based on Mobile Sink Node in Wireless Sensor Networks”
International Journal of Innovative Technology and Exploring Engineering
(Scopus), Vol.8, Issue-7, pp 1788-1792, 2019.
4. Amairullah Khan Lodhi, M. S. S. Rukmini “Energy-Efficient Routing Protocol for
Node Lifetime Enhancement in Wireless Sensor Networks” International Journal of
Advanced Trends in Computer Science and Engineering (Scopus), Vol. 8. no.1.3. pp.
24-28, 2019.
9/10/2020 58

Papers Published in International Journals
5. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “ Efficient Energy
Routing Protocol Based on Energy & Buffer Residual Status (EBRS) for Wireless
Sensor Networks” International Journal of Engineering and Advanced Technology
(Scopus), Vol. 9. Issue no. 1S5 pp. 33-37, in December 2019.
6. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “Design technique for
head selection in WSNS to enhance the network performance based on nodes
residual status: An extension to EBRS method” International Journal of Advanced
Science and Technology (Unpaid Scopus), Vol. 9. Issue no. 1S5 pp. 33-37, in
December 2020.
7. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “Performance
improvement in wireless sensor networks by removing the packet drop from the
node buffer ” Materials Today: Proceedings, 2019
9/10/2020 59

Papers Published in International Conferences
1. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “Energy Efficient
Wireless Sensor Networks: A Survey on Energy-Based Routing Techniques” IEEE
3rd International Conference on Electrical, Electronics, Communication,
Computation Technologies and Optimization Techniques (ICEECCOT), conducted
by GSSSIETW, Mysuru, on14th & 15th Dec 2018.
2. Amairullah Khan Lodhi, M. S. S. Rukmini “Energy-Efficient Routing Protocol for
Node Lifetime Enhancement in Wireless Sensor Networks” International
Conference on Modern Technology in Engineering Research & Management
(ICMTERM–2019), conducted by Siddhartha Institute of Engineering and
Technology, Hyderabad, on 1st & 2nd May’ 2019.
3. Amairullah Khan Lodhi, Syed Abdulsattar “Energy and Security Aware Reactive
Routing for Wireless Sensor” 73rd International Conference on Science,
Engineering & Technology (ICSET), Medina, Saudi Arabia, conducted by
Researchfora on 25th & 26th September 2017.
4. Amairullah Khan Lodhi, Syed Abdulsattar “Cluster Head Selection by optimized
ability to restrict packet drop in Wireless Sensor Networks” 1stInternational
Conference on Soft Computing in Data Analytics (SCDA 2018), conducted by
SSCE, Srikakulam.
9/10/2020 60

Papers Published in National / International Conferences
5. Amairullah Khan Lodhi, Syed Abdulsattar “Energy Efficient and Secure Intrusion
Detection Algorithm for Maximum Coverage in WSN” in CAS Ph.D. forum,
Organized by CAS IEEE / EDS Societies, Hyderabad Section, on 16th July 2016.
6. Amairullah Khan Lodhi, Syed Abdulsattar “Performance Improvement In Wireless
Sensor Networks By Removing The Packet Drop From The Node Buffer” is
accepted in ICMPC-2020 (GLA University).
9/10/2020 61

Papers Published in National Conferences
1. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “ Efficient Energy
Routing Protocol Based on Energy & Buffer Residual Status (EBRS) for Wireless
Sensor Networks” National Conference on Vlsi, Signal Processing &
Communications (NCVSCOMS-2019), conducted by ECE Dept, VFSTR,
Vadlamudi, Guntur, on 6th & 7th Sept’ 2019.
9/10/2020 62

Papers Accepted/Communicated in International Journals
1. Amairullah Khan Lodhi, M. S. S. Rukmini, Syed Abdulsattar “Performance
Enhancement by Cluster Head Selection Based On Residual Status of Energy and
Buffer in WSNs” is accepted in INTERSCIENCIA (SCIE Journal) on 16th
December 2019.
2. Amairullah Khan Lodhi, M. S. S. Rukmini “Network Lifetime Enhancement in
WSN Using Energy and Buffer Residual Status with Efficient Mobile Sink
Location Placement” is accepted in Solid State Technology (Unpaid Scopus
Journal) on 2nd August 2020.
9/10/2020 63

Papers Accepted/Communicated in International Conferences
1. Amairullah Khan Lodhi, M.S.S. Rukmini, Syed Abdulsattar
“Lifetime Enhancement Based On Energy And Buffer Residual
Status Of Intermediate Node In Wireless Sensor Networks” is
accepted and presented in iCASIC-2020 (VIT, Vellore).
2. Amairullah Khan Lodhi, M.S.S. Rukmini “Lifetime Enhancement in
Bio-Sensor Networks with Efficient Placement of Mobile Sink Node
for Bio-medical Applications” is accepted in ACCES-2020 (GRIET,
Hyderabad).
9/10/2020 64

ENHANCEMENT OF THE WORK
1. Amairullah Khan Lodhi, M.S.S Rukmini, Syed Abdulsattar, Sayyad Ajij, Mazher Khan
“A Feasible Model for a Smart Transportation System using a
Vehicular Ad-Hoc Network” Published in TEST Engineering & Management
(Unpaid Scopus), Volume, 83, Issue, March-April 2020, Pages, 7341-7348,
Publication date, 7th April 2020.
9/10/2020 65

Courses Attended
1. National Level Workshop on “Simulation and Emulation of Self
Organized Networks (SEASON-2015)” conducted in association with
IIPC from 10th to 12th Sep., 2015 at Kongu Engineering College,
Perundurai, Erode.
2. Five Days Course on “Opportunities, Challenges and Research Trends
in Wireless Sensor Networks” Sponsored by MHRD, Govt. of India
under ‘GIAN’ from 11th to 15th Dec 2015 organized by Dept. of ECE,
University College of Engineering, O.U., Hyderabad.
3. Two Days State Level STTP on “WSN Fundamentals and Protocol
Design using NS-2 & 3 (WPN-16), hin 20eld at SIT, Lonavala, during
Jan 23rd & 24th 2016.
4. One Week National Level FDP on “Network Simulator (NS2 & NS3)”
conducted by SKSSITS, Lonavala, held on 7th to 11th October 2016.
9/10/2020 66

Courses Attended
5. A Two Weeks Course on “Wireless Sensor Networks and Underlying
Characteristics” Conducted by GIAN, MHRD, at JNTU, Hyderabad,
during 14th to 23rd Dec, 2016.
6. Three days hands on workshop on “ Set up of Internet of Things (IoT)
Lab” conducted by ECE Dept., MJCET , Hyderabad from 25th to 27th
March 2019.
7. Two Days National Level FDP on Network Simulator (“NS2 &
NS3”), conducted Dept., of ECE, SCET, Hyderabad on 19th & 20th
July 2019.
8. DST Sponsored National Level Seminar on “ Sensor Networks,
Internet of Things (IoT) & Internet of Everything” Organized by dept.
of ECE, VJIT, from 8th to 10th Aug 2019.
9/10/2020 67

References
[1] Pantazis, Nikolaos A., Stefanos A. Nikolidakis, and Dimitrios D. Vergados.
"Energy-efficient routing protocols in wireless sensor networks: A survey." IEEE
Communications surveys & tutorials 15, no. 2 (2012): 551-591.
[2] Tang, Di, Tongtong Li, Jian Ren, and Jie Wu. "Cost-aware secure routing (CASER)
protocol design for wireless sensor networks." IEEE Transactions on Parallel and
Distributed Systems 26, no. 4 (2014): 960-973.
[3] Saranya, R., and R. Dhanalakshmi. "Balancing Energy Consumption to Maximize
Network Lifetime Using Particle Swarm Optimization in Wireless Sensor
Networks." Middle-East Journal of Scientific Research 23 (2015): 309-313.
[4] Zhou, Biyu, Fa Zhang, Lin Wang, Chenying Hou, Antonio Fernández Anta,
Athanasios V. Vasilakos, Youshi Wang, Jie Wu, and Zhiyong Liu. "HDEER: A
distributed routing scheme for energy-efficient networking." IEEE Journal on
Selected Areas in Communications 34, no. 5 (2016): 1713-1727.
[5] Shen, Jian, Anxi Wang, Chen Wang, Patrick CK Hung, and Chin-Feng Lai. "An
efficient centroid-based routing protocol for energy management in WSN-assisted
IoT." IEEE Access 5 (2017): 18469-18479.
9/10/2020 68

References
[6] Yetgin, Halil, Kent Tsz Kan Cheung, Mohammed El-Hajjar, and Lajos Hanzo
Hanzo. "A survey of network lifetime maximization techniques in wireless sensor
networks." IEEE Communications Surveys & Tutorials 19, no. 2 (2017): 828-854.
[7] Yestemirova, Gaukhar, and Sain Saginbekov. "Efficient data aggregation in wireless
sensor networks with multiple sinks." In 2018 IEEE 32nd International Conference
on Advanced Information Networking and Applications (AINA), pp. 115-119. IEEE,
2018.
[8] Bounceur, Ahcene, Madani Bezoui, Massinissa Lounis, Reinhardt Euler, and
Ciprian Teodorov. "A new dominating tree routing algorithm for efficient leader
election in IoT networks." In 2018 15th IEEE Annual Consumer Communications &
Networking Conference (CCNC), pp. 1-2. IEEE, 2018.
[9] El Khediri, Salim, Adel Thaljaoui, Adel Dallali, Souli Harakti, and Abdennaceur
Kachouri. "A Novel Connectivity Algorithm Based on Shortest Path for Wireless
Sensor Networks." In 2018 1st International Conference on Computer Applications
& Information Security (ICCAIS), pp. 1-6. IEEE, 2018.
[10] Thepvilojanapong, Niwat, Yoshito Tobe, and Kaoru Sezaki. "On the construction
of efficient data gathering tree in wireless sensor networks." In 2005 IEEE
International Symposium on Circuits and Systems, pp. 648-651. IEEE, 2005.
9/10/2020 69

References
[11] Ghane, Millad, and Amir Rajabzadeh. "Remaining-energy based routing protocol
for wireless sensor network." In 2010 15th CSI International Symposium on
Computer Architecture and Digital Systems, pp. 67-73. IEEE, 2010.
[12] Kim, Kyung Tae, Man Youn Kim, Ji Hyeon Choi, and Hee Yong Youn. "An energy
efficient and optimal randomized clustering for wireless sensor networks." In 2015
IEEE/ACIS 16th International Conference on Software Engineering, Artificial
Intelligence, Networking and Parallel/Distributed Computing (SNPD), pp. 1-6.
IEEE, 2015.
[13] Sarma, Hiren Kumar Deva, Rajib Mall, and Avijit Kar. "E 2 R 2: Energy-efficient
and reliable routing for mobile wireless sensor networks." IEEE Systems Journal 10,
no. 2 (2015): 604-616.
[14] Wang, Z. Maria, Stefano Basagni, Emanuel Melachrinoudis, and Chiara Petrioli.
"Exploiting sink mobility for maximizing sensor networks lifetime." In Proceedings
of the 38th annual Hawaii international conference on system sciences, pp. 287a-
287a. IEEE, 2005.
9/10/2020 70

References
[15] Bhargava, Peyakunta, and Singaraju Jyothi. "Big Data and Internet of Things for
Analysing and Designing Systems Based on Hyperspectral Images." In Environmental
Information Systems: Concepts, Methodologies, Tools, and Applications, pp. 621-641.
IGI Global, 2019.
[16] Cacciagrano, Diletta, Rosario Culmone, Matteo Micheletti, and Leonardo
Mostarda. "Energy-Efficient Clustering for Wireless Sensor Devices in the Internet of
Things." In Performability in the Internet of Things, pp. 59-80. Springer, Cham, 2019.
[17] Kharat, Prashant, and Muralidhar Kulkarni. "Congestion controlling schemes for
high-speed data networks: A survey." Journal of High-Speed Networks 25, no. 1 (2019):
41-60.
[18] Bhushan, Bharat, and G. Sahoo. "Routing Protocols in Wireless Sensor Networks."
In Computational Intelligence in Sensor Networks, pp. 215-248. Springer, Berlin,
Heidelberg, 2019.
[19] Begum, Shaik Rehana, G. Jaisankar, Suribabu Boyidi, B. Ravi Kumar, K. M.
Ganesh, T. Sridevi, N. C. Anil, U. Sailaja, and K. Dileep. "Road Network for Disaster
Guide in Rural Area, East Godavari District, AP, India—A Case Study of Spatial
Approach." In Proceedings of International Conference on Remote Sensing for Disaster
Management, pp. 683-691. Springer, Cham, 2019.
9/10/2020 71

References
[20] Linguaglossa, Leonardo, Dario Rossi, Salvatore Pontarelli, Dave Barach, Damjan
Marjon, and Pierre Pfister. "High-speed data plane and network function virtualization
by vectorizing packet processing." Computer Networks 149 (2019): 187-199.
[21] Al-Turjman, Fadi. "Cognitive routing protocol for disaster-inspired internet of
things." Future Generation Computer Systems 92 (2019): 1103-1115.
[22] Mehmood, Amjad, Nabil Alrajeh, Mithun Mukherjee, Salwani Abdullah, and
Housing Song. "A survey on proactive, active and passive fault diagnosis protocols for
wasns: network operation perspective." Sensors 18, no. 6 (2018): 1787.
[23] Salehi_Panahi, Morteza, and Mortaza Abbaszadeh. "Proposing a method to solve
energy hole problem in wireless sensor networks." Alexandria engineering journal 57,
no. 3 (2018): 1585-1590.
[24] Gomathi, R. M., and J. Martin Leo Manickam. "Energy efficient shortest path
routing protocol for underwater acoustic wireless sensor network." Wireless Personal
Communications 98, no. 1 (2018): 843-856.
[25] Rahim, Saqib Shahid, Sheeraz Ahmed, Nadeem Javaid, Adil Khan, Nouman
Siddiqui, Fazle Hadi, and M. Ayub Khan. "Scalability Analysis of Depth-Based Routing
and Energy-Efficient Depth-Based Routing Protocols in Terms of Delay, Throughput,
and Path Loss in Underwater Acoustic Sensor Networks." In Recent Trends and
Advances in Wireless and IoT-enabled Networks, pp. 171-185. Springer, Cham, 2019.
9/10/2020 72

References
Heidelberg, 2019.
[27] Arini, Arini. "EVALUASI KINERJA JARINGAN DMVPN MENGGUNAKAN
ROUTING PROTOCOL Ripv2, OSPF, EIGRP DENGAN BGP." JISKA (Jurnal
Informatika Sunan Kalijaga) 2, no. 3 (2018): 143-150.
[28] Ramezan, Gholamreza, Cyril Leung, and Zhen Jane Wang. "A Survey of Secure
Routing Protocols in Multi-Hop Cellular Networks." IEEE Communications Surveys &
Tutorials 20, no. 4 (2018): 3510-3541.
[29] Jan, Mian Ahmad, Syed Rooh Ullah Jan, Muhammad Alam, Adnan Akhunzada,
and Izaz Ur Rahman. "A comprehensive analysis of congestion control protocols in
wireless sensor networks." Mobile networks and applications 23, no. 3 (2018): 456-468.
[30] Yu, Wei, Fan Liang, Xiaofei He, William Grant Hatcher, Chao Lu, Jie Lin, and
Xinyu Yang. "A survey on the edge computing for the Internet of Things." IEEE
access 6 (2018): 6900-6919.
[31] Ilyas, Mohammad, and Imad Mahgoub. Smart Dust: Sensor network applications,
architecture, and design. CRC Press, 2018.
9/10/2020 73

References
[32] Zafer, Murtaza, Anand Srinivas, S. M. S. Hossain, and Balachander
Chandrasekaran. "System and method for client network congestion detection, analysis,
and management." U.S. Patent Application 10/200,267, filed February 5, 2019.
[33] Menon, Abilash, Robert Penfield, Hadriel S. Kaplan, and Patrick Timmons. "Link
status monitoring based on packet loss detection." U.S. Patent Application 10/200,264,
filed February 5, 2019.
[34] Wong, David, Qian Chen, and Francois Chin. "Directional medium access control
(MAC) protocols in wireless ad hoc and sensor networks: a survey." Journal of Sensor
and Actuator Networks 4, no. 2 (2015): 67-153.
[35] Kim, Hyung-Sin, Hongchan Kim, Jeongyeup Paek, and Saewoong Bahk. "Load
balancing under heavy traffic in RPL routing protocol for low power and lossy
networks." IEEE Transactions on Mobile Computing 16, no. 4 (2017): 964-979.
[36] Ahc`ene Bounceur, Madani Bezoui, Massinissa Lounis, Reinhardt Euler, Ciprian
Teodorov "A New Dominating Tree Routing Algorithm for Efficient Leader Election in
IoT Networks". 15th IEEE Annual Consumer Communications & Networking
Conference (CCNC) 2018.
9/10/2020 74

References
9/10/2020
[37] Darji, Harsh, and Hitesh B. Shah. "Genetic algorithm for energy harvesting
wireless sensor networks." In 2016 IEEE International Conference on Recent Trends
in Electronics, Information & Communication Technology (RTEICT), pp. 1398-
1402. IEEE, 2016.
[38] Hasan, Mohammed Zaki, Hussain Al-Rizzo, and Fadi Al-Turjman. "A survey on
multipath routing protocols for QoS assurances in real-time wireless multimedia
sensor networks." IEEE Communications Surveys & Tutorials 19, no. 3 (2017):
1424-1456.
[39] Wang, Jin, Yiquan Cao, Bin Li, Hye-jin Kim, and Sungyoung Lee. "Particle swarm
optimization based clustering algorithm with mobile sink for WSNs." Future
Generation Computer Systems 76 (2017): 452-457.
[41] Wang, Jin, Jiayi Cao, Sai Ji, and Jong Hyuk Park. "Energy-efficient cluster-based
dynamic routes adjustment approach for wireless sensor networks with mobile
sinks." The Journal of Supercomputing 73, no. 7 (2017): 3277-3290.
75

References
Heidelberg, 2019.
[43] Pantazis, Nikolaos A., Stefanos A. Nikolidakis, and Dimitrios D. Vergados.
"Energy-efficient routing protocols in wireless sensor networks: A survey." IEEE
Communications surveys & tutorials 15, no. 2 (2012): 551-591.
9/10/2020 76

Action Taken Report On
Energy-Efficient Routing Protocol for enhancing network lifetime and
performance in Wireless Sensor Networks
Summary of the modifications:
There are some valuable and specific comments given
by the External Experts to be incorporated in the
thesis report as well as at the time of defendant.
9/10/2020 77

Summary of the modifications:
The dissertation has been substantially revised, taking adjudicator's
(Foreign examiner) comments into account. As suggested, we revised
the chapters to fulfil the dissertation's motivation. Care has been
taken to avoid typos in the entire dissertation. The page numbers and
section numbers are quite different from the previous submission. As
suggested, all the said chapters have been completely revised. We
think that the current dissertation report is very easy to understand
with the inclusion of the methodology flow chart about the proposed
work.
9/10/2020 78

[A] Necessary recommendations need to be incorporated in the Thesis:
Chapter-1
1) There is a typographical mistake in pages 4 and 7 at the fig
numbers, modify them as fig1.1 and fig 1.2?
• Answer to the comment: The chapter-1 of the dissertation
has been substantially revised, taking adjudicator's
comments into account. As suggested, the figure numbers
are revised as figure 1.1 and figure 1.2. We put the revised
content in red colour for ease of finding (please refer to
page numbers 5 and 8).
9/10/2020 79

Chapter-3
1) The repetition rate is high in the thesis, try to avoid the majority. On
page 56 references [71] repeated in the first paragraph as well as in
second. Remove either one?
Answer to the comment: The chapter-3 of the dissertation has been
substantially revised, taking adjudicator's comments into account. As
suggested, the repetition rate is reduced in the thesis to avoid the
majority. The references [71] on page 56 are removed in the second
paragraph. We put the revised content in red colour for ease of
finding.
9/10/2020 80

2) On page 61, fig 3.5 is similar to fig 1.4 of page 15; hence the author
can quote the same fig1.4 in this chapter also instead of repeating.
Similarly on page 66, fig3.6 & fig3.7 both are similar, if there is any
reason give the justification if not remove anyone?
substantially revised, taking adjudicator's comments into account.
The figures presented at page numbers 61 & 15 explains about the
node’s buffer internal mechanism about packet operation. The figure
presented gives the idea about Packet loss due to Buffer overflow on
both pages (61 & 15), that’s why we presented the figure in both
sections. So as suggested, we quoted the same as figure 1.4 from
page 15 (Chapter-1) in this chapter also instead of repeating.
Similarly, on page 66, out of the figures 3.6 and 3.7, one figure is
removed (please refer page 61).
9/10/2020 81

3) On page 67, the explanation is according to fig 3.8, need to correct
this instead of fig 3.7?
The explanation on page 67 is according to figure 3.8 (Now figure
3.6), it is corrected as recommended.
9/10/2020 82

Chapter-4
1) The description of 4.2.2 on page 75 & 76 is the same as the description of 3.2.2
from page 63 & 64. Similarly equations 4.5, 4.7 are similar to equation 3.6 of page
65 also table 4.3 on page 80 is the same as table 3.1 from page 68, if there is any
justification author needs to incorporate or else repeated matter should be
removed?
Answer to the comment: The chapter-4 of the dissertation has been substantially
revised, taking adjudicator's comments into account. The description presented at
page numbers 75 and 76 explains the multi-objective mechanism about packet
operation which is removed. Similarly equations 4.5, 4.7 are similar to equation 3.6
which is also removed. The table presented at 4.3 also removed, because it seems
that the information given in that table is previously there in table 3.1 (from
Chapter-3). So as suggested, we quoted the same instead of repeating the content.
9/10/2020 83

• Chapter-5
1) The description quoted from ref. [94] on page 91 is similar to ref. [82]
from page 74. Is both the references are the same or different?
The description presented at page numbers 91 and 74 explains about
the LEACH Protocol is the same. As suggested, the reference section
has been completely revised and arranged as per the comment given.
9/10/2020 84

2) In equation 5.1 from page 91 the P = required percentage of for
becoming cluster head?
The description presented in equation 5.1 is mistakenly written as
“required percentage of for becoming cluster head” on page number
91. As suggested, it is corrected and written in the report as “ P =
required percentage of power for becoming cluster head” on page
number 91.
9/10/2020 85

3) Need to correct the typographical mistake of fig 5.7 as fig 5.2, fig 5.8
as fig.5.3, and fig 5.9 as fig 5.4 on pages 99, 100, and 101
respectively?
suggested, the figure numbers are revised as figure 5.2, figure 5.3,
and figure 5.4. We put the revised content on pages 100, and 101
respectively.
9/10/2020 86

4) From fig 5.15 to 5.23 it is compulsory to indicate the y-axis (ordinate)
scale unit whether it is in sec or min or hrs or years so that it could
help the reader to understand the comparisons clearly?
suggested, from fig 5.15 to 5.23 the y-axis (ordinate) scale units are
indicated as Seconds(S) and Joules(J), so that it could help the reader
to understand the comparisons clearly.
9/10/2020 87

5) The methodology flow chart about the proposed work should be
included. So that the reader may go through the steps and analyzed
the work easily?
suggested, the methodology flow chart about the proposed work is
included on page number 63 in chapter-3, so that the reader may go
through the steps and analyzed the work easily.
9/10/2020 88

[B] Necessary recommendations need to be addressed at the time of
Defendant:
Chapter-3
1) According to which standardization, selection of various parameters
like a Packet lifetime as 200ms, departure & arrival rate as 0.02 and
0.0166, and average packet number arrived as 25-50 has made?
Answer to the comment: According to ITU G.114, acceptable real-time
traffic end to end delay is about 150ms and practically 200ms.To get a
better understanding of the proposed algorithm, we consider the
different attributes to each intermediate node such as battery power
and buffer capacity, input packet arrival rate, and output departure
rate. Other attributes such as receiving power and transmission
power kept as constant.
9/10/2020 89

2) How can the power or energy of a proper intermediate node be computed or
determine, which is capable of handling the traffic without loss of data packet or
mitigation of packet loss throughout the transmission process?
Answer to the comment: A designed routing protocol, i.e., "Energy- Efficient Routing
Protocol for enhancing network lifetime and performance in Wireless Sensor
Networks.," is developed by considering some assumption and network model.
One of the assumptions that made are, the nodes in a network consisting of
hardware to provide its residual energy information at any given time. The working
process of the hardware is out of the scope of our work. Further, the hardware of
the node needs to support the information as follows:
– Provide remaining energy information
– Suitable low pass filter to compute the weighted moving average
– RED gateway provides queue information.
9/10/2020 90

3) What is the reason behind, to compute the average queue size and
average waiting time to design a model for detecting the status of the
node regarding packet loss? Why not the maximum values?
Answer to the comment: Every node contains the RED gateway to
compute the average queue length of its buffer. It is a low pass filter
work on the principle of the exponential weighted moving average.
The algorithm for computing the average queue size determines the
degree of robustness that will be allowed in the gateway queue.
Instead of taking maximum values, we consider the average to
prevent the packet drop in advance by setting threshold value, as the
average queue size exceeds a preset threshold, the gateway drops
the packet.
9/10/2020 91

Chapter-5
1) How can threshold value be provided or chosen, decide the node
priority while running the algorithm during the routing process?
Answer to the comment: Threshold values of the nodes are computed
based on the sensitivity of network and initial network distribution
condition. We computed this value under energy with less traffic and
under energy with fewer traffic conditions. The TTL value is decided
by the type of communication traffic, and we are considering the TTL
value as 200ms since we use CBR (constant bit rate) traffic in our
proposed network.
9/10/2020 92

Lodhi final viva voce

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Was ist angesagt?

Was ist angesagt? (20)

Ähnlich wie Lodhi final viva voce

Ähnlich wie Lodhi final viva voce (20)

Mehr von Amairullah Khan Lodhi

Mehr von Amairullah Khan Lodhi (11)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

Lodhi final viva voce