Routing Algorithm based on Clustering for Increasing the Lifetime of Sensor Networks by Using Meta-Heuristic Bee Algorithms

Author:

Sedighimanesh Mohammad1,Hesami Hesam Zand2,Sedighimanesh Ali1

Affiliation:

1. Young Researchers and Elite Club, Tehran Branch, Islamic Azad University, Tehran, Iran

2. Department of Industrial Management, Qazvin Branch, Islamic Azad University, Qazvin, Iran

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.

Publisher

Bentham Science Publishers Ltd.

Subject

Electrical and Electronic Engineering,Control and Optimization,Computer Networks and Communications,Computer Science Applications

Reference11 articles.

1. Jadhav P.; Satao R.; A survey on opportunistic routing protocols for wireless sensor networks. Procedia Comput Sci 2016,79,603-609

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-372

5. Mottaghi S.; Zahabi M.R.; Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes. AEU Int J Electron Commun 2015,69(2),507-514

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3