Generic placeholder image

International Journal of Sensors, Wireless Communications and Control

Author(s): Mohammad Sedighimanesh*, Hesam Zand Hesami and Ali Sedighimanesh

DOI: 10.2174/2210327909666190129154802

DownloadDownload PDF Flyer Cite As
Routing Algorithm based on Clustering for Increasing the Lifetime of Sensor Networks by Using Meta-Heuristic Bee Algorithms

Page: [25 - 36] Pages: 12

  • * (Excluding Mailing and Handling)

Explore Articles
About Journal
For Authors
For Editors
For Reviewers

Abstract

Background: Nowadays, the use of wireless sensor networks is developing rapidly. these networks are applicable in many fields, including military, medical, and environment. these networks use hundreds or thousands of cheap sensor nodes with low power-low and low energy to perform large tasks. These networks have limitations that can lead to inefficiency or not cost - effective. Among these limitations, consumption of energy and issues related to the lifetime of the network. One of the solutions that can assist the load balancing between sensor nodes, increased scalability, improving energy consumption and consequently, increasing network lifetime, clustering of sensor nodes and placing a suitable cluster head in all clusters. Choosing the right cluster head, significantly reduces energy consumption in the network and increases network lifetime.

Objective: The purpose of this paper is to increase network lifetime by using the efficient clustering algorithm, which is used in Meta-heuristic bee colony to select the cluster head. Simulation of this paper is performed by MATLB software and the proposed method is compared with LEACH and GACR approaches.

Conclusion: The simulation findings in this study show that the intended study has remarkably increased the length of the network lifetime by LEACH and GACR algorithms. Due to the limitation of energy in the wireless sensor network such solutions and using Meta-heuristic algorithms can give rise a remarkable increasing in network lifetime.

Keywords: Bee algorithm, routing and clustering algorithms, wireless sensor network, LEACH, reliability, lifetime.

Graphical Abstract

[1]
Jadhav P, Satao R. A survey on opportunistic routing protocols for wireless sensor networks. Procedia Comput Sci 2016; 79: 603-9.
[2]
Sedighimanesh A, Sedighimanesh M, Baqeri J. Improving wireless sensor network lifetime using layering in hierarchical routing.Conf Proc 2nd Int Conf Knowledge-Based Engr Innovat (KBEI) 2015; 201.
[3]
Xia H, Zhang R, Yu J, Pan Z. Energy-efficient routing algorithm based on unequal clustering and connected graph in wireless sensor networks. Int J Wirel Inf Netw 2016; 1-10.
[4]
Akkari W, Bouhdid B, Belghith A. LEATCH: low energy adaptive tier clustering hierarchy. Procedia Comput Sci 2015; 52: 365-72.
[5]
Mottaghi S, Zahabi MR. Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes. AEU Int J Electron Commun 2015; 69(2): 507-14.
[6]
Pei E, Han H, Sun Z, Shen B, Zhang T. LEAUCH: low-energy adaptive uneven clustering hierarchy for cognitive radio sensor network. EURASIP J Wirel Commun Netw 2015; 1: 1-8.
[7]
Gupta Sk, Jana PK. Energy efficient clustering and routing algorithms for wireless sensor networks: GA based approach. Wirel Pers Commun 2015; 83(3): 2403-23.
[8]
Tyagi S, Kumar N. A systematic review on clustering and routing techniques based upon LEACH protocol for wireless sensor networks. J Netw Comput Appl 2013; 36(2): 623-45.
[9]
Kuila P, Jana PK. Energy efficient clustering and routing algorithms for wireless sensor networks: particle swarm optimization approach. Eng Appl Artif Intell 2014; 33: 127-40.
[10]
Lonare S, Wahane G. A survey on energy efficient routing protocols in wireless sensor network. Fourth Int Conf Comput Commun Netw Technol (ICCCNT) 2013; 1-5.
[11]
Aseri TC. Comparison of routing protocols in wireless sensor network using mobile sink- A survey. In EngrComputat Sci (RAECS), 2014 Recent Adv 2014; 1-4.