Page 10 - 2023-Vol19-Issue2
P. 10
6| Leabi
Fig. 3. Network lifetime Fig. 5. Rate of consumed energy
Fig. 4. Rate of residual energy Fig. 6. PDR
The proposed algorithm is compared with classical Dijkstra REFERENCES
routing that has lifetime equals to (1001 round) and some
intelligent routing methods like Fuzzy routing that has life- [1] I. F. Akyildiz and M. C. Vuran, Wireless Sensor Network.
time equals to (1932 round) and ant colony routing that has John Wiley and Sons Ltd, 2010.
lifetime equals to (2259 round). Furthermore, outcome offer
good improvement of the suggested routing algorithm against [2] A. Hac, “Wireless sensor network designs,” John Wiley
the other three algorithms and can be introduced as one of the and Sons Ltd, 2003.
good routing algorithms that maximize lifetime.
[3] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and
CONFLICT OF INTEREST E. Cayirci, “A survey on sensor networks,” IEEE Com-
munications magazine, vol. 40, no. 8, pp. 102–114,
The author have no conflict of relevant interest to this article. 2002.
[4] J. N. Al-Karaki and A. E. Kamal, “Routing techniques
in wireless sensor networks: a survey,” IEEE wireless
communications, vol. 11, no. 6, pp. 6–28, 2004.
