Page 9 - 2023-Vol19-Issue2

5| Leabi

for making energy consumption balance as mentioned before.
Fig.8 demonstrates networks simulation time. simulation time
for the proposed algorithm is less than the other three routing
methods, and this prove that this suggested algorithm does
not affect the operation of optimal path computation. And
this demonstrates the ability for realizing the suggested FFA
methods in practical sensor nodes networks. And also, this
ensures that the low capability sensor nodes hardware can
process this routing algorithm in ease.

TABLE II.
NETWORK THROUGHPUTS

Routing Method Zone Lifetime Partition PDR
Time
Dijkstra Routing A1 1001
Fuzzy Routing A1 1932 2452 1
ACO Routing A1 2259
2400 1
Suggested FFA
Routing 2260 1

A1 2781 2782 0.993

Fig. 1. Generic framework of suggested methodology

balanced energy consumption but the suggested FFA beat Fig. 2. Zone Area A1 of scattered nodes
them in energy usage.
Fig.5 demonstrates the average consumed energy. The sug- VI. CONCLUSION
gested algorithm consumes more energy than Dijkstra, Fuzzy,
and ACO methods due to the efficient in energy consumption Wireless sensor networks involve low power resources in their
balance. Network partition time support this result, as the net- life cycle. The process of maintaining energy consumption
work partitioned more than time for the proposed algorithm. using new routing algorithms meet crucial issue. This paper
And this improves the suggested idea. proposes a firefly routing algorithm to ensure energy consump-
Fig.6 demonstrate the packet delivery ratio (PDR) that give tion balance and overall energy preservation so as for increase
the meaning of how many success packets that the sink re- the lifetime of the networks. Two metrics has been used for
ceived. The suggested algorithm shows a PDR value of about simulation which are the residual energy and shortest hop
0.993 for the zone area. Although the unity PDR value for to sink. The proposes algorithm used network throughputs
Dijkstra routing, Fuzzy Routing, and ACO routing but the to maintain energy exhaustion. Outcome offer an improve-
lifetime increased in the suggested algorithm and beats the ment within lifetime equals to (2781 round) for the zone area.
other three methods.
Fig.7 demonstrates hops max number that involved by net-
work. Within this figure, proposed algorithm involves usage
of more hops for assuring energy balance and this results
in lifetime maximization. This figure demonstrates the max
number of hops for the suggested FFA method is greater the
other three methods, and this is how the suggested method
adapt itself and distribute energy consumption on more nodes