ENERGY EFFICIENT ROUTING FOR LIFETIME

MAXIMIZATION IN MOBILE WIRELESS SENSOR

NETWORKS BASED ON OPTIMIZATION
ALGORITHM

A SYNOPSIS

Submitted by

MALARVIZHI P

in partial fulfillment of the requirements for the degree of

DOCTOR OF PHILOSOPHY

FACULTY OF INFORMATION AND

COMMUNICATION ENGINEERING
ANNA UNIVERSITY
CHENNAI 600 025

APRIL 2024
 1

1. INTRODUCTION
Extending the lifetime of Mobile Wireless Sensor Networks (MWSN)
is essential for improving the cooperative wireless network communication.
Since these networks are frequently employed in areas with limited resources
and high dynamic activity levels, energy efficiency must be the main priority.
Various energy routing protocols have been created to overcome the
difficulties of MWSN. These protocols are designed to maximize energy
efficiency, increase network longevity, and guarantee dependable data
transfer. Enhancing energy stability in Mobile Wireless Sensor Network
systems has gained popularity. Effectively managing available energy inside
the network involves creating energy-aware routing algorithms. In specific,
optimization algorithms take part to solve the routing overheads and energy
level problems by improving the communication approach.
The majority of optimization protocols, such as the Ant Colony
Optimization Routing Protocol (ACO), Particle Swarm Optimization (PSO),
Spider Optimization Algorithm (SOA), and Whale Optimization estimation,
focus on features inspired by reducing non-relation features and
dimensionality problems to improve routing. These protocols use energy-
efficient level-based learning approaches. The Low-Energy Adaptive
Clustering Hierarchy is another widely used technique that creates clusters to
reduce energy consumption and increase network longevity.
By implementing energy-efficient routing protocols and leveraging
renewable energy sources, MWSN architectures can achieve optimized
energy utilization, prolonged network lifetime, and improved reliability. To
conserve energy and prolong the network operations energy consumption
during periods of low activity should be minimized. Additionally,
advancements in energy-efficient hardware design and the utilization of ultra-
low-power components contribute to further enhancing the energy
sustainability of MWSN. Data transmission volume significantly affects
communication overhead, which causes Mobile network to dissipate more
 2

energy. Network stability must be improved to guarantee successful data

transfer between source and destination nodes in wireless networks.
The first approach introduces a routing method that efficiently selects
stable nodes for packet forwarding, minimizing energy consumption. Node
stability is evaluated based on the CBS principle and various indicators with
routing metrics and PSO employed to identify stable pathways, ultimately
improving network stability by adjusting the ranking of stable nodes to
balance energy usage and minimize hotspots.
Further to improve the performance of MWSNs clustering and routing,
the second approach introduces a Cooperative Self-Scheduling Routing
Approach (CS2RA) based Energy Efficient Optimal Link Stability Routing
Allocation (EOLSRA) for a lifetime to improve Quality of Service (QoS) for
MWSN. The energy level is optimized under the routing level and network is
stabilized under scheduled performance. The proposed system achieves high
performance compared to the other method to stabilize the route and lifetime
maximization.

2. LITERATURE SURVEY
This literature review discusses the different routing techniques for
MWSN. In these dynamic and demanding network environments, an
overview of the state-of-the-art routing techniques and protocols is provided
through a thorough assessment of the existing literature. In addition, the study
will examine the performance metrics such as packet delivery ratio, end-to-
end delay, network overhead, and energy efficiency used to assess the routing
protocols. It will also investigate how different mobility patterns, application
contexts, and network characteristics affect these protocols performance.
An analysis of a modified version of the Artificial Bee Colony (ABC)
method is possible in addition to improving cluster head selection. However,
choosing the best cluster head is a complex optimization problem [11].
Similarly, employing an Adaptive Immunity-Induced Energy-Efficient Cross-
 3

Layer Routing (AIEECR) protocol to select the most effective clusters can
improve network performance [13]. Likewise, the multi-strategy Grey Wolf
Optimization (GWO) algorithm may be employed to increase energy
efficiency. However, node mobility significantly impacts the overall lifecycle
and integrity of the network [15]. Furthermore, the GWO approach can
overcome the over and under-coverage problem by using simulated annealing
to estimate model sensor nodes [14]. Accordingly, the Multi-Pheromone Ant
Colony Optimization (MBACO) method can channel economic energy
consumption to the optimal path and extend the network lifetime [2].
Furthermore, when analyzing gateways, a rooted tree-based sort can be
run to reduce broadcasts using Quantum-Inspired Ant Colony Optimization
(QACO) [4]. The Multipath Adaptive Balancer Routing-Based Particle
Swarm Optimization (MABR-PSO) technique, aims to enhance range by
determining path average delay and routing link quality [6]. Accordingly,
traditional mutation operations can be improved with Energy-Aware
Location-Aided Routing (EALAR) protocols by utilizing Particle Swarm
Optimization (PSO) in conjunction with a reactive MANET routing protocol
[1]. Afterwards, energy efficiency can be enhanced using a straightforward
and reliable Optimal Clustering-ABC (OCABC) algorithm [5]. Furthermore,
an ACO algorithm could be suggested for optimizing the pheromone update
mechanism's evaporation parameters and the ants' search range [12].
The optimal data transmission channel is chosen with the assistance of
the offered Energy-Efficient Perspicacious Ant Colony Optimization-based
Routing Protocol (EEPACORP). This approach lowers each node's energy
usage while transmitting data [8]. Similarly, the Spider Monkey Optimization
(SMO) algorithm can optimize its position by creating an ideal routing cluster
by combining the benefits of chaotic and genetic operators [3]. Spider social
behaviour in cluster sensor networks can be examined using the Social Spider
Optimization (SSO) algorithm. On the other hand, incorrect clustering in
sensor networks might result in a load around the sink [9]. Thus, an enhanced
 4

ACO algorithm can be used to achieve inter-cluster routing. It can be used to

calculate variables like angle, distance, and energy and to develop heuristic
algorithms that ensure an objective next-hop selection [10]. The Improved
SMO (ISMO) algorithm using the cluster head may determine the optimal
path to the base station. The suggested ISMO technique can optimize fitness
functions through traffic routes, distance, and residual energy [7]. It is
essential to have the best routing protocol for particular deployment situations
and spur the creation of new protocols specifically designed to meet the needs
of MWSN.
2.1. PROBLEM IDENTIFICATION
The problems of routing stability and energy efficiency in MWSN
applications have grown more important in the past few years. Because of the
large amount of data being transferred, communication overheads are greatly
affected, which causes MWSN to dissipate more energy. In MWSN, ensuring
network stability is essential to successful data transfer between source and
destination nodes.
 The increasing dynamic nature of MWSN topology causes routing
instability and more energy losses during the transmission.
 Existing Neighbor-based routing schemes and protocols failed to
analyses the behavioral concerns to optimize the energy levels in route
propagation.
 The existing Hop count-based algorithms choose the shortest route, but
there is a massive interruption due to the traffic in the route selected for
communication.
 Higher energy consumption leads to routing failures, links broken due
to instability of node communication, and poor lifetime performance.
 Previous traffic-based approaches select a route with the most minor
traffic, which in turn increases the hop count and latency. Also, it
affects the throughput performance.
 5

 A higher packet drop ratio is because of routing overhead, which

increases traffic, and high latency increases the transmission overhead,
causing more degradation.
 Lower throughput performance due to communication overhead,
traffic, delay, packet drop ratio.
2.2. OBJECTIVE OF THE RESEARCH
This research aims to tackle the important issues of energy
conservation and routing stability in MWSN applications. Its growing data
transfer volume has increased energy dissipation and communication
overheads. Network stability must be guaranteed for data to be sent
successfully between source and destination nodes in MWSN.
 The main goal is to provide a model for an efficient and effective
stable routing technique that chooses stable nodes for packet
forwarding while consuming less energy.
 The suggested model uses particle swarm optimization to locate stable
paths in the network and rank and identify stable nodes using the
Centrality Betweeness based Stability concept and quality parameters.
 Additionally, a Cooperative Self-Scheduling Routing Approach based
Energy Efficient Optimal Link Stability Routing Allocation is
proposed to enhance Quality of Service for Wireless Sensor Networks.
 Considering energy constraints and optimal link stability, this approach
aims to improve routing efficiency and network stabilization, achieving
high performance and lifetime maximization.

3. CONTRIBUTION OF RESEARCH
This research presents a model of a stable routing technique that is
successful and efficient in choosing stable nodes for packet forwarding while
consuming less energy. A node's stability is assessed using the CBS principle
and a quality factor considering various indicators, including residual energy,
link quality and the node's reach over its target node. The suggested model
 6

considers routing metrics in addition to using PSO to identify stable pathways

throughout the network. It is possible to balance node energy consumption,
minimize hotspots, and enhance overall stability by lowering the ranking of
stable nodes.

Routing Begin Node response

Transmission
routing overhead in
MWSN
CBS-PSO CS2RA -EOLRSA

Centrality Betweenness-based
Stability Node response behavior rate

PSO optimal Routing PSAC Clustering

Routing Logs (RT)

Route expression and route Lookup Energy Constraint

repairing Duty Cycle

Optimal Routing Log Cooperative Self-Scheduling Routing Approach - EOLSRA

Updation

Optimal route Parameter and

construction performance evaluation KHC-OLSR

Figure 1: Proposed architecture

To enhance the QoS of MWSN, a Cooperative Self-Scheduling

Routing Approach based Energy Efficient Optimal Link Stability Routing
Allocation is proposed. Initially, the Node Response Behavior Rate (NRBR)
estimation was carried out to find the optimal link based on route optimality
by considering the energy, delay, transmission, drop ratio, and latency
depending on the total mean rate. Then, relative nodes are formalized using
the Petal Spider Ant Colony Cluster (PSAC2). The Lookup Energy Constraint
Duty Cycle (LECDC) consider the routing energy limit to construct routing.
Then Cooperative Self-Scheduling Routing Approach (CS2RA) is applied to
 7

make efficient routing using Energy Efficient Optimal Link Stability Routing
Allocation (EOLSRA).
The proposed Energy efficient K-Hop Clustering and Optimal Link
Stability Routing (KHC-OLSR) uses first approach PSO-CBS in K-hop
clustering and second approach CS2RA- EOLSRA for cooperative routing to
reduce and energy consumption in MWSN is shown in Figure 1.
3.1. Finding a Stable Path with PSO - CBS
Routing paths, transmission power levels, and frequency allocations
are just a few network elements that PSOs can optimize in self-configured
networks. PSO can find the best configuration by repeated probing of stable
node through the information available with the nodes. This is achieved by
seeing the network as a swarm of particles, each representing a possible
configuration. PSO's capacity to swiftly converge to near-optimal solutions in
complex and dynamic network contexts is a benefit when utilizing it for self-
configured networks. PSO can enhance network performance, reliability, and
efficiency without requiring manual configuration by continuously
responding to shifting network conditions. The Centrality Betweenness based
Stability in the suggested model uses Particle Swarm Optimization to find the
best stable path throughout the network. This method enables the source node
to determine an effective and dependable path for forwarding data nodes to
their corresponding stabilized forwarding node and eventually to the
destination by taking into account a variety of routing metrics to create a
stable path.
3.1.1. Centrality Betweenness based Stability
In network analysis, centrality betweenness refers to a metric that
determines a node's significance according to its location on the shortest paths
connecting other nodes. High betweenness centrality nodes are essential to
preserve network connectivity and information flow. Finding and
safeguarding crucial nodes with high betweenness centrality is necessary to
improve the stability of a network based on betweenness centrality. Even if
 8

any central nodes are compromised, the network can continue to function by
providing redundancy or backup channels for these nodes.
Optimizing the network structure or rerouting traffic to minimize
dependence on a few highly central nodes can also improve the network's
stability. This can involve redistributing traffic flows, adding new
connections, or reconfiguring the network topology to reduce the impact of
node failures. Node stability depends on several factors, including the amount
of battery power left, the quality of the connection, and the number of hops
needed to reach a destination. Each adjacency matrix node is assigned a
weight based on factors including bit error rate, link expiration time, link
failure rate, signal-to-noise ratio, and remaining battery power.
3.1.2. PSO Optimal routing
Stable nodes form links that gradually allow the ideal path to evolve
from the source to the destination. The criteria above are used to sort each
path of the created CBS. Using particular criteria, including minimizing
latency, maximizing throughput, and balancing network load, Particle Swarm
Optimization (PSO) optimizes data transmission path selection in the network
to locate the best routing option. The search time of the algorithm is the
amount of time it takes to locate a stable node. Additionally, the calculating
technique is dynamic.
3.2. Cooperative Energy Efficient Optimal Link stability routing
protocol for quality of service Lifetime improvement in Wireless Sensor
Network
This work introduces an innovative CS2RA-EOLSRA approach aimed
at extending the lifetime and enhancing the Quality of Service within Mobile
WSN.
3.2.1. WSN Node Response Behavior Rate (WSN-NRBR)
WSN-NRBR is used to identify each node's total mean rate based on
the location, energy and behaviour. In this case, the received Node Signal
Strength Indicator and neighbors estimate the location of all other nodes.
 9

Because this is based entirely on local broadcasts and irrelevant location

information calculated by timing cycle, packet handled rate, and energy
consumption by every node has a low level of maintenance to maintain a
probability distribution using NRBR technique.
3.2.2. Petal Spider Ant Colony Cluster
The natural behavior of bees foraging inspired the ABC technique, a
swarm intelligence optimization technology. Compared to other intelligent
algorithms, the Petal Spider and ABC algorithms have the advantages of
powerful optimization capabilities, fewer configuration parameters, string
strength and reduced complexity. This includes feature selection models
based on the spider food foraging model to reduce the non-relational feature
dimension.
3.2.3. Lookup Energy Constraint Duty Cycle
Lookup Energy Constraint Duty Cycle to improve the network's
lifetime. In a heterogeneous situation where a certain fraction of the node
population has more energy than the typical nodes in the network. Threshold
calculation helps segregate the normal, super, and advanced nodes for energy-
efficient transmission.
3.2.4. Cooperative Self-Scheduling Routing Approach
A Cooperative Self-Scheduling Routing Approach used in to self-
balancing cooperative communication in MWSNs. Wolf attacks and fuzzy
strategies in this algorithm used for high-quality route selection.
3.2.5. Energy Efficient Optimal Link Stability Routing Allocation
This approach uses cooperative self-scheduling to optimize the routes.
Based on execution time, routing is assigned at the lowest energy usage
levels. The duty cycle system assigned to each routing is distinct concerning
connection stability. The energy consumption is predicted to assign routes
with the maximum support factor acquired from execution to transform load,
end-to-end service, and execution time of communication in each routing
iteration. By presenting the node population from the spider cluster layer,
 10

clusters are viewed as petal dependencies that collaborate to maximize

pathways.

4. RESULT AND DISCUSSION

The suggested approach is evaluated using an NS2 simulator. The
factors like energy, delay, and temporal complexity can efficiently design
dynamic paths. This volume provides a descriptive account of the outcomes
and discussions of the suggested methodologies. Table 1 illustrates the
simulation settings.
Table 1: Simulation parameters for quality of service improvement
Parameters Values
Simulations are at a distance 1100m
Ideal node coverage 100m
Bandwidth utilization 5MHz
Simulator NS2
No.of.nodes 500
Pause Time 30sec

The novel characteristics estimate the routing performance, throughput,

packet drop rate, delay, and security performance, which are considered to
evaluate the energy level compared with different methods.

Energy Consumption in Joules

40
30
20
10
0
100 200 300 400 500

EALAR AIEECR PSO-CBS

CS2RA- EOLSRA KHC-OLSR

Figure 2 Result of Energy Consumption Performance

In the simulation analysis, a speed of 0 m/s was assigned to all nodes,
and the KHC-OLSR routing performance regarding energy consumption was
compared. Comparative analysis is done with other previous and proposed
 11

techniques like EALAR, AIEECR, PSO-CBS and CS2RA-EOLSRA. Figure 2

compare energy consumption performance. The proposed work consumes less
energy than other methods.

Packet Drop in Sec

50
40
30
20
10
0
100 200 300 400 500

EALAR AIEECR PSO-CBS

CS2RA- EOLSRA KHC-OLSR

Figure 3 Result of Packet drop ratio

The competence and efficiency of the imminent KHC-OLSR based
packet drop analysis is done in the network by comparative analysis with
other previous and proposed techniques like EALAR, AIEECR, PSO-CBS
and CS2RA-EOLSRA nodes are dedicated to implementing communications
to decrease the packet drop using KHC-OLSR. Figure 3 compares packet
drop ratio of MWSN.
As a result, the delay in executing packet transmission decreases and
the proposed method has a lower impact than other algorithms. In relative
terms, the proposed technique KHC-OLSR minimizes the delay required to
implement communications with a significant difference from existing
methods.

Delay in Sec
60
50
40
30
20
10
0
100 200 300 400 500

EALAR AIEECR PSO-CBS

CS2RA- EOLSRA KHC-OLSR

Figure 4 Comparison of Delay performance

 12

Figure 4 denotes the delay comparison with various algorithms like

EALAR, AIEECR, and PSO-CBS and CS 2RA-EOLSRA. Due to the resource
limitations of existing algorithms, it takes longer to implement the number of
allocated connections. The proposed method attains 35 seconds of delay for
500 nodes than other methods.
The result of throughput performance with 100, 200, 300, 400 and 500
nodes are simulated. The proposed KHC-OLSR has a 96.43% throughput
performance compared to other methods. Also, the proposed method aims to
transmit nodes from sender to receiver with maximum efficiency, ensuring no
packet drop or failure in routing. Thus, the proposed method attained 96.18%
of the network lifetime compared to previous methods.
5. CONCLUSION
The results of this study indicate that a stable routing model is helpful
for efficient packet forwarding and stable node identification. First approach
uses CBS to optimize energy utilization during stable node identification and
PSO-based stable path identification to achieve efficient packet forwarding.
This model efficiently establishes node stability through quality indicator
monitoring, facilitating stable path establishment and effective packet
forwarding. According to simulation findings, this model has been verified
and achieves incredible packet transmission speed, reduced delay, and lower
congestion rate in PSO-CBS compared to existing centrality methods. The
second approach CS2RA-EOLSRA energy optimization technique is essential
to increase the network lifetime further. MWSN technology necessitates high-
speed data transmission, and intelligent algorithms are crucial in energy-
efficient service optimization. The proposed CS2RA method is designed based
on resource utilization concepts for efficient route selection in data
transmission. The CS2RA-EOLSRA technique optimizes energy resources in
MWSN networks to improve lifetime maximization. The combined KHC-
OLSR algorithm’s evaluation indicates a significantly reduced computation
time at 20.91 seconds, with minimal energy consumption of up to 97%
 13

achieved to improve lifetime maximization and lower delay. Future work

could explore various swarm and artificial intelligence techniques to enhance
MWSN efficiency.
REFERENCES
1. Abdali, T.A.N., Hassan, R., Muniyandi, R.C., Mohd Aman, A.H.,
Nguyen, Q.N. and Al-Khaleefa, A.S., 2020, ’Optimized particle swarm
optimization algorithm for the realization of an enhanced energy-aware
location-aided routing protocol in manet’, Information, vol. 11, no. 11,
p. 529.
2. Arora, V. K., Sharma, V., & Sachdeva, M. 2020, A multiple
pheromone ant colony optimization scheme for energy-efficient
wireless sensor networks’, Soft Computing, vol. 24, no. 1, pp. 543-553.
3. Justus John, J., Muthukrishnan, A. and Soundaram, J., 2022, ’Energy‐
efficient model using optimal route discovery based on adaptive spider
monkey optimization model’, International Journal of Communication
Systems, vol 35, no. 14, p. e5256.
4. Khudair Madhloom, J., Abd Ali, H.N., Hasan, H.A., Hassen, O.A. and
Darwish, S.M. 2023, "A Quantum-Inspired Ant Colony Optimization
Approach for Exploring Routing Gateways in Mobile Ad Hoc
Networks," Electronics 2023, vol. 12, no. 5, p. 1171.
5. S. R, Deepa., 2021, ’Cluster optimization in wireless sensor network
based on optimized Artificial Bee Colony algorithm’, IET Networks,
vol. 10, no. 6, pp. 295-303.
6. Sakthivel, S., Manikandan, M. and Vivekanandhan, V., 2022, ‘Design
of efficient location‐based multipath self‐adaptive balancer router
using particle swarm optimization in wireless sensor network’,
International journal of communication systems, vol. 3, no. 4, p.
e5060.
7. Sanapala, R.K. and Duggirala, S.R., 2022, ‘An Optimized Energy
Efficient Routing for Wireless Sensor Network using Improved Spider
 14

Monkey Optimization Algorithm’, International Journal of Intelligent

Engineering & Systems, vol. 15, no.1, pp. 188-197.
8. Sumathi, K. and Kumar, D.V., 2022, ‘Energy-Efficient Perspicacious
Ant Colony Optimization Based Routing Protocol for Mobile Ad-Hoc
Network’, International Journal of Computer Networks and
Applications, vol 9, no. 2, pp. 240-250.
9. Tabatabaei, S., 2020, ’Clustering Method via Social Spider
Optimization (SSO) and Fuzzy Logic and Mobile Sink in Wireless
Sensor Networks (WSNs)’, International Journal of Computer Systems
Science & Engineering, vol 35, no. 6, pp. 477-494.
10. Wang, Z., Ding, H., Li, B., Bao, L., & Yang, Z. 2020, ‘An Energy
Efficient Routing Protocol Based on Improved Artificial Bee Colony
Algorithm for Wireless Sensor Network’, IEEE Access, vol. 8, pp.
133577-133596.
11. Wang, Z., Ding, H., Li, B., Bao, L., Yang, Z. and Liu, Q., 2022,
’Energy efficient cluster based routing protocol for WSN using firefly
algorithm and ant colony optimization’, Wireless Personal
Communications, vol 125, no.3, pp. 2167-2200.
12. Xiao, X. and Huang, H., 2020, ’A clustering routing algorithm based
on improved ant colony optimization algorithms for underwater
wireless sensor networks’, Algorithms, vol. 13, no. 10, p. 250.
13. Yarde, P., Srivastava, S., & Garg, K. 2020, ’Adaptive immune-inspired
energy-efficient and high coverage cross-layer routing protocol for
wireless sensor networks’, IET Communications, vol. 14, p. 2592-
2600.
14. Zhang, Y., Cao, L., Yue, Y., Cai, Y. and Hang, B., 2021. A novel
coverage optimization strategy based on grey wolf algorithm optimized
by simulated annealing for wireless sensor networks. Computational
Intelligence and Neuroscience, vol. 2021, pp.1-14.
 15

15. Zhendong Wang, Lili Huang, Shuxin Yang, Xiao Luo, Daojing He,
Sammy Chan, 2024,’Multi-strategy enhanced grey wolf algorithm for
obstacle-aware WSNs coverage optimization’, Ad Hoc Networks, vol.
152, p. 103308.

LIST OF PUBLICATION
International Journal
1. Malarvizhi, P. and Kavithaa, G., 2023. ‘Identifying Stable Path in Self
Configured Networks Using Particle Swarm Optimization with
Centrality Betweenness’, Journal of Electrical Engineering &
Technology, pp.1-13. https://doi.org/10.1007/s42835-023-01741-3
Impact Factor : 1.9