International Journal of Trend in Scientific Research and Development (IJTSRD)

Volume 8 Issue 3, May-June 2024 Available Online: www.ijtsrd.com e-ISSN: 2456 – 6470

ACO Based Optimizing Power Consumption

(ACO-OPC) Protocol for WSN
Pooja Kamboj1, Meenakshi Arora2
1
PG Student, Department of CSE, Sat Kabir Institute of Technology and Management, Haryana, India
2
Assistant Professor, Department of CSE, Sat Kabir Institute of Technology and Management, Haryana, India

ABSTRACT How to cite this paper: Pooja Kamboj |

Energy efficiency in networks of sensors is a major and challenging Meenakshi Arora "ACO Based
subject. Consequently, a number of protocols have been created, all Optimizing Power Consumption (ACO-
aimed at improving network energy efficiency. When data packets OPC) Protocol for
are directed, most of the energy is consumed. In this paper, we have WSN" Published in
International Journal
routed data streams among sensor motes using the swarm cognition- of Trend in
based ant colony optimization (ACO) algorithm. Depending on the Scientific Research
number and placement of sensor motes, a small number of them may and Development
also enter sleep mode, extending the network's lifespan and (ijtsrd), ISSN: 2456- IJTSRD64889
conserving resources. Reducing the energy consumption of a sensor 6470, Volume-8 |
network while routing can extend its lifespan. An ideal route for data Issue-3, June 2024, pp.330-337, URL:
delivery to the destination node is provided by the ant colony www.ijtsrd.com/papers/ijtsrd64889.pdf
optimization approach. By choosing the quickest route to the sink,
routing can use less energy. In addition to optimization, sleep Copyright © 2024 by author (s) and
scheduling among sensor nodes is crucial for obtaining long lifetime International Journal of Trend in
Scientific Research and Development
and effective energy conservation. Certain nodes may occasionally
Journal. This is an
turn off their radios if there is a high node density in the vicinity. Open Access article
Many nodes in a network with high node density waste energy distributed under the
overhearing or idle listening. In order to maintain network power, we terms of the Creative Commons
have employed a threshold energy-based sleep-awake scheduling and Attribution License (CC BY 4.0)
ant colony optimization method named ACO based Optimizing (http://creativecommons.org/licenses/by/4.0)
Power Consumption (ACO-OPC) to preserve the power in the
network. KEYWORDS: WSN, ACO, Energy
efficient Routing, TDMA Scheduling

INTRODUCTION
The rapid advancements in wireless communications, networks are the two main categories into which
microfabrication, and motorized MEMS technologies clustered sensor networks fall. Every sensor node in a
have made it possible to create tiny, inexpensive, low- homogenous network has the same hardware
power nodes for sensors. These nodes have the ability complexity and battery life. In a homogeneous
to collect data, process it, and exchange it with other network, it is obvious that the cluster head nodes will
sensors via wireless radio frequency (RF) technology be overwhelmed with long-distance transmissions to
[1]. Numerous sensor nodes that are densely the distant base station and the additional processing
distributed throughout an area of interest make up a required for data aggregation and protocol
wireless sensor network (WSN). The process of coordination if static clustering is used (cluster heads,
monitoring the external and physical environment, once elected, serve for the entirety of the network the
gathering data, and transmitting the processed data to lifespan). The cluster head nodes therefore die before
the sink node or base station can all be triggered by other nodes. To ensure that very little remaining
the network of sensors. energy is lost when the system expires, it is preferable
Since clustering enables MAC and routing scalability, to make sure that each node runs out of battery at
around the same time. As suggested in [2], rotating
we take into consideration sensor networks that are
clustered. In order to decrease the quantity of data the cluster head position randomly and sporadically
that is actually sent to the base station (BS), cluster throughout all nodes is one method to be sure of this.
heads (CH) also operate as fusion points for data The disadvantage of adopting role rotation and a
homogeneous network is that each node must have
aggregation. Homogeneous and heterogeneous sensor

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 330
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470
the required hardware in order for it to function as a efficiency[3]. The (ACO) algorithm is a popular and
CH. effective way to determine the best communication
However, two or more distinct types of nodes with channels. Nevertheless, the entire network
varying battery energy and functionality are dependability (both before and after failures), which
employed in heterogeneous sensor networks. The idea is crucial in the context of WSNs, is ignored by the
is to lower the hardware expenses of the remainder of conventional ACO-based routing algorithms, which
the network by embedding the more sophisticated solely take energy efficiency into account. A unique
hardware and additional battery energy in a small (E-RARP) for WSNs is proposed by the authors. In
number of cluster head nodes. Role rotation is no regard to energy efficiency, the suggested protocol
longer feasible, though, due to the cluster head nodes not only assures reliable communication but also
needing to be fixed. The sensor nodes that are distant provides excellent communication pathways. Reliable
from the cluster heads always expend greater amounts transmission is necessary for critical events in delay-
of energy than the nodes that are nearer to the cluster intolerant applications (such as forest fire detection)
heads when the cluster heads are reached by single so that choices can be made with confidence and
hopping. Conversely, the nodes nearest to the cluster relevant actions may be taken promptly. According to
head have the biggest energy load because of relaying the simulation outcomes, E-RARP performs
when nodes employ multihopping to get there. As a significantly better in terms of network endurance and
result, the network constantly exhibits a non-uniform time to response (30.55%) than both Load Balanced
pattern of energy draining. As a result, a sensor Cluster-based Routing using ACO and Enhanced Ant-
network should have both consistent energy drainage based QoS-aware routing protocol for Heterogeneous
and a lower hardware cost. Wireless Sensor Networks.

Homogeneous networks accomplish the latter, According to authors in [4], In order to fulfill
whereas heterogeneous networks accomplish the hardware and resource limits and overcome inherent
former. Nevertheless, the same network cannot have obstacles, (WSN) protocols must be designed with
both properties. This research compares efficient routing. Here, we describe an energy-
homogeneous and heterogeneous sensor networks efficient scalable routing algorithm for (WSNs) based
based on the total cost of the network, accounting for on ant colony optimization (ACO). This algorithm
the energy-hardware tradeoff mentioned above. finds the best data transmission channel while using
Another way to categorize clustered sensor networks the least amount of energy, extending the network's
is as single-hop and multi-hop. A single hop network lifespan. The majority of ACO-based routing
is one in which sensor nodes communicate with the algorithms now in use are built with the premise that
cluster head by single hopping. Nodes in a multi-hop sinks and sensor nodes are immobile. As a result, they
network hop across nodes to get to the cluster head. do not account for the overhead of mobility or the
Since we assume a remote base station in both energy consumption of the present node, which may
scenarios, the cluster heads utilize single hopping to cause some nodes to pass suddenly. An ACO based
get to the base station. The sensor nodes in a single WSN routing algorithm has been suggested and
hop network use a single hop transmission to connect investigated in this research to address the current
directly with the cluster head. In order to regulate issues with accommodating node mobility, decreasing
their transmit power, it is expected that the nodes initialization time for ant based routing algorithms,
have power control characteristics. In general, it and maintaining scalability in WSN for time-sensitive
might not be the best option to use single hop applications. MATLAB has been used to simulate and
communication within a cluster for communication verify the suggested technique. Compared with the
between the cluster heads and the sensor nodes. This conventional ACO and an existing ant-based routing
is probably going to be the case if the sensor nodes algorithm, the assessment findings show that it has
are placed in areas with a lot of vegetation or uneven reduced energy consumption, about 50% less spent
ground. To contact the cluster head in such energy even with the increasing number of nodes.
circumstances, multi-hop communication between Additionally, it lengthens the lifespan of the network
cluster nodes may be advantageous. and the nodes.

RELATED WORK In order to effectively decrease energy consumption,

The writers tackle the issue of dependability and an energy-efficient sleep scheduling mechanism with
energy efficiency for forest fires tracked by a a similarity gauge for WSN (ESSM) is suggested [5].
dispersed (WSN) with limited bandwidth. In the This mechanism would schedule the sensors into
context of WSNs, data routing is a crucial strategy either the active or sleep mode [6]. In order to balance
that is being investigated to increase energy energy usage, all sensor nodes are first grouped into

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 331
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470
many clusters using the ideal competition radius that energies. When using multi-hop routing, nodes send
has been computed. Second, a fuzzy matrix data to a neighboring node. However, if there isn't a
measuring the degree of similarity can be produced node close by, data is sent to the next closest node.
based on the data collected by member nodes, and the
At first, there is sufficient energy for each sensor
correlation function based on fuzzy theory may be
node to send data over the whole transmission range.
constructed to categorize the sensor nodes. In order to
A sink node determines how much energy a node
protect the network's overall data integrity, the
needs for the specified transmission range and sends
redundant nodes will then be chosen to enter a sleep
this data to other units. The energy used by the sink
state in the following round. Simulations and findings
node during processing has no effect on the network's
demonstrate that, with data accuracy guaranteed, our
lifespan because it is not a power-constrained node.
method may do better in both optimizing the energy
The threshold energy (Th_energy) is the amount of
efficiency of the networks and ensuring optimal
energy required for transmission. Following a few
cluster dispersion.
network connection cycles, a sensor node's energy
Instead of using LEACH's fixed sleep/wake-up mode, level varies based on its function and location within
Wu et al. [7] created a dynamic sleep scheduling the network. In comparison to other nodes, it uses
mode that significantly extends network lifetime. The more energy if it is a cluster head node. A node enters
aforementioned issues were looked at by the authors active mode and is ready for data transmission and
in [8], who also suggested an unequal clustering communication if its residual energy exceeds the
algorithm for inter-cluster multi-hop routing that threshold energy; otherwise, it enters sleep mode. The
separates all nodes into unevenly sized clusters. More node density affects the proportion of nodes that are
compact clusters will be those that are closer to the in sleep mode. Our chosen sensor network is
base station. As a result, the "hot-spots" issue may be hierarchically clustered, in accordance with the
successfully resolved and the CHs of those clusters LEACH protocol [11]. A small number of nodes are
can save a little more power for the inter-cluster relay chosen as the cluster head nodes during the cluster
communication. A distributive energy efficient setup phase and are re-established after each round.
adaptive clustering protocol (DEEAC) was suggested To accomplish load balancing across the sensor
by Sajjanhar et al. [9]. It picks the sensor node to be a nodes, the cluster head role is rotated among the
CH based on its residual energy and hotness value, nodes during each round. A cluster head collects
and it owns spatiotemporal differences in data summaries after selection and sends data to the sink.
reporting rates across various geographic areas. As a result, the cluster head uses up its energy more
Advanced LEACH routing strategy for WSNs was quickly than other nodes. But since the cluster head's
suggested by Ali et al. [10]. It uses the general position shifts after each round, the network's nodes'
probability and the current state probability to choose consumption of energy is fairly distributed.
which CH to select in each round.
Data packets are transmitted from member nodes to
METHODOLOGY the cluster head over many hops. Within a cluster, a
We have planned for the sleep-wake scheduling construction graph is created. Ants move on the
technique, which extends the network's lifespan. A construction graph and construct solutions employing
sensor node can go into sleep mode and switch off its stochastic creative approaches. ACO combines
radio for a brief period of time in order to save domain knowledge (referred to as heuristic
energy. whereas if a sensor frequently flips between information) with search experience (referred to as
the awake and sleep states, it may fail and cease to pheromone) to expedite the search process. Ants are
operate, which could result in energy holes in the initially placed at random members of the cluster. In
network. A specific portion of nodes, or p1% of all this case, member nodes select the best route for data
nodes, are always kept in sleep mode in order to transmission after the ants identify the best path from
prevent this scenario. The following describes the members to the cluster head.
requirements to maintain a node in sleep mode. An
For heterogeneous sensor networks, the suggested
active node enters a sleep state when its energy drops
technique ACO based Optimizing Power
below a certain point, at which point another node
Consumption (ACO-OPC) offers a sleep/wake
from the sleep mode enters awaking mode. A node
scheduling strategy that utilizes clustering and ant
becomes active in this manner only when required.
colony optimization. It determines which path is the
Each sensor node inside the network has an identical
shortest and most efficient between the cluster head
communication transmission range. At first, sensor
and its node members.
nodes react to the sink node's Welcome packet by
sending it information about their precise location and Step 1: P1% of all nodes in the network are initially
maintained in the sleep mode.

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 332
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470
Step 2: At first, there is sufficient energy for every residual energy varies based on its function and
node to carry out every task. The calculation of the location within the network. For instance, a cluster
nodes' threshold energy takes into account each head will use more energy than remaining nodes,
node's transmission range and power expenditure for while the nodes chosen as the intermediate nodes in
various functions. the best path in the earlier phase will use less energy
Step 3: When the clustering procedure is carried out, than the former. The next cycle begins if the total
certain nodes are chosen to be the cluster heads and remaining energy of all the nodes exceeds the
others to be the cluster members. threshold energy. This occurs during the first several
rounds. Some nodes' energy gradually drops under
Step 4: An ideal connection between the cluster the threshold level.
leader and its members is selected for each cluster.
Step 7: A node enters sleep mode and one node from
Step 5: Every member of the cluster uses the best the group of sleep nodes is woken when its energy
path to send data to the cluster head. After compiling drops below a threshold value. Wake up two nodes
the received data, the cluster head sends it to the sink. from the sleep cluster if two are in the sleep mode,
Step 6: If sufficient energy remains, determine the and so on. No beyond P1% of nodes may be in sleep
total node's residual energy. After that, each node's mode at any given moment. The procedure can go on
residual energy is compared to the threshold energy until the network has enough energy provided.
before the next round starts. Currently, each node's
Figure 1 shows the ACO based optimal route selection between an active node and sink node. The red line
shows a chain of active nodes towards sink node.

Figure 1: ACO Based optimal route selection

The network's remaining power has been assessed by taking into account the energy left in each node after each
network cycle. There are enough live nodes for a significant number of rounds because of sleep-wake
scheduling. The suggested approach results in roughly 10 cluster heads every round in a network with 100 nodes
if we take the probability of choosing a cluster head to be 0.1. Five of the ten cluster heads are advanced nodes,
and the other five are standard nodes. The network has an adequate number of cluster heads available. In order to
reduce energy, every connected cluster also employs the ACO technique. Up until the first node dies, the
network uses incredibly little energy. Figure 2 shows the process flow of the proposed method.

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 333
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

Figure 2: Process Flow of the Proposed Method ACO-OPC

SIMULATION RESULTS ANALYSIS
When comparing the ACO-OPC protocol to the LEACH protocol, more packets are transferred. The cluster's
effective utilization of energy is the cause of this. Every member node automatically chooses the best
transmission route. Arriving at the CH, a packet does so with little to no delay. Member nodes may choose a
different course in subsequent rounds in the event that an intermediary node dies. Additionally, advanced nodes
use a lot more energy and stay connected to the network for extended periods of time. In subsequent rounds,
there are very few available nodes in a homogenous network. The quantity of packets sent to the cluster head
consequently decreases dramatically. Table 1 shows the parameters used in Simulation Setup.
The total amount of live nodes for the ACO-OPC and SEP protocols is shown in Figure 3 for each round. The
clustering process is the foundation for the SEP protocol's operation. The nodes' main strength is not uniform,
though. In comparison to the other nodes in the WSN, a certain fraction of nodes have more energy.
Table 1: Simulation Parameters

The number of live nodes in the network per round determines how long a WSN will last. The entire region is
still covered when every node is operational. Nodes begin to lose power over time, and as a result, they start to

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 334
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470
die. Eventually, the network's lifecycle ends when there are no more nodes. As a result, we may state that the
round number at which every node dies (AND) indicates the network's termination. The round number at which
the network's first node fails serves as an expression of the network's durability span.

Figure 3: Nodes Alive in 2500 rotations

Figure 4: Dead Nodes in 2500 rotations

Figure 5: Remaining Energy in Network in 2500 rotations

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 335
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

Figure 6: Throughput of Network in 2500 rotations

Figures show that when the number of rounds increases, the number of packets transmitted to the CH decreases.
The ACO-OPC protocol transmits more packets than the other protocols combined. This is due to the cluster's
effective usage of energy. Each member node selects the optimal transmission path at all times. A packet arrives
at the CH with little or no wait. In the case that an intermediary node dies, member nodes may decide to take an
alternative path in later rounds. Advanced nodes also consume a lot more energy and maintain a constant
connection to the network. In a homogeneous network, there are very few available nodes in succeeding rounds.
As a result, the number of packets transmitted is rapidly declining.
CONCLUSION “Optimizing Coverage and Clustering
In the ACO-OPC protocol, every node in a cluster Techniques for Mobile Wireless Sensor
sends data to the cluster head via an optimal Networks,” IJIRSET, vol. 13, no. 4, pp. 6067–
transmission method. This method is chosen to 6075, 2024.
distribute the workload evenly among all member [3] N. Moussa, E. Nurellari, and A. El Belrhiti El
nodes based on a number of factors, including Alaoui, “A novel energy-efficient and reliable
distance, pheromone trails, residual energy, and ACO-based routing protocol for WSN-enabled
others. Furthermore, whereas a node in ACO-OPC forest fires detection,” J. Ambient Intell.
enters sleep mode when its remaining energy is less Humaniz. Comput., vol. 14, no. 9, pp. 11639–
than the energy needed for transmission, there is no 11655, 2023.
sleep state in LEACH, which results in significant
consumption of energy. Sleep-wake scheduling is [4] A. Sharmin, F. Anwar, and S. M. A.
determined by the nodes' threshold level of energy. Motakabber, “Energy-efficient scalable routing
The ant colony optimization methodology finds the protocol based on ACO for WSNs,” in 2019 7th
best path between a cluster member and its cluster international conference on mechatronics
head to minimize energy consumption in the cluster. engineering (ICOM), 2019, pp. 1–6.
Setting ACO-OPC's parameters, such as ρ,α, β, and μ, [5] R. Wan, N. Xiong, and N. T. Loc, “An energy-
will enhance the efficiency of the algorithm. We have efficient sleep scheduling mechanism with
determined the ideal values for these variables, and similarity measure for wireless sensor
we have simulated the network using these values. networks,” Human-centric Comput. Inf. Sci.,
The simulation's findings show that ACO-OPC uses vol. 8, pp. 1–22, 2018.
less energy than the LEACH technique.
[6] R. S. Gopal Sharma, Sumit Dalal, “Sleep-
REFERENCES Awake and ACO based Resource Saving
[1] R. S. Ankur Sharma, Princy, Kirti Bhatia, “A Protocol for WSN,” Int. J. Innov. Res. Comput.
Detailed Overview of Life Cycle Enhancing Commun. Eng., vol. 11, no. 6, pp. 8456–8462,
Approaches for WSN,” MIDDLE Eur. Sci. 2023, [Online]. Available:
Bull., vol. 25, pp. 492–499, 2022, [Online]. https://ijircce.com/get-current-
Available: issue.php?key=MTQ1
https://cejsr.academicjournal.io/index.php/journ
al/article/view/1425 [7] Y. Wu, S. Fahmy, and N. B. Shroff, “Optimal
sleep/wake scheduling for time-synchronized
[2] R. S. Harish Kumar, Meenakshi Arora, sensor networks with QoS guarantees,”

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 336
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470
IEEE/ACM Trans. Netw., vol. 17, no. 5, pp. [10] M. S. Ali, T. Dey, and R. Biswas, “ALEACH:
1508–1521, 2009. Advanced LEACH routing protocol for
wireless microsensor networks,” in 2008
[8] R. Z. Wan, J. J. Lei, Q. W. Xu, and X. M. Gou,
“An energy-efficient unequal clustering international conference on electrical and
algorithm in wireless sensor networks,” Adv. computer engineering, 2008, pp. 909–914.
Mater. Res., vol. 629, pp. 801–807, 2013. [11] W. R. Heinzelman, A. Chandrakasan, and H.
[9] U. Sajjanhar and P. Mitra, “Distributive energy Balakrishnan, “Energy-efficient communication
efficient adaptive clustering protocol for protocol for wireless microsensor networks,” in
wireless sensor networks,” in 2007 Proceedings of the 33rd annual Hawaii
International Conference on Mobile Data international conference on system sciences,
2000, pp. 10-pp.
Management, 2007, pp. 326–330.

@ IJTSRD | Unique Paper ID – IJTSRD64889 | Volume – 8 | Issue – 3 | May-June 2024 Page 337