E. Heidari, A. Movaghar, H. Motameni, Behnam Barzegar
{"title":"REDUCING ENERGY CONSUMPTION IN IOT BY A ROUTING WHALE OPTIMIZATION ALGORITHM","authors":"E. Heidari, A. Movaghar, H. Motameni, Behnam Barzegar","doi":"10.22452/mjcs.vol35no2.4","DOIUrl":null,"url":null,"abstract":"The Internet of Things is a new concept in the world of information and communication technology, in which for each being (whether it be a human, an animal or an object), the possibility of sending and receiving data through communication networks such as the Internet or Intranet is provided. Wireless sensors have limited energy resources due to their use of batteries in supplying energy, and since battery replacement in these sensors is not usually feasible, the longevity of wireless sensor networks is limited. Therefore, reducing the energy consumption of the used sensors in IoT networks to increase the network lifetime is one of the crucial challenges and parameters in such networks. In this paper, a routing protocol has been proposed and stimulated which is based on the function of the whale optimization algorithm. Clustering is performed through a routing method which is based on energy level, collision reduction, distance between cluster head node and destination, and neighbor energy. Furthermore, the selection of the cluster head node is performed based on the maximum remaining energy, the least distance with other clusters, and energy consumption, where energy consumption for reaching the base station is minimized. By de-creasing the level of cluster head energy from the specified threshold value from among the nodes in the same cluster, a node with an energy level above the threshold would be selected as the new cluster head. Moreover, four conditions (i.e. the shortest route, the leading route, the least distance to the source node, and destination node) are applied for routing. The proposed method was compared to LEACH, EEUC, EECRP, BEAR and CCR algorithms, and the results indicated the superiority of the proposed method to other methods in terms of the number of dead nodes.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2022-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Malaysian Journal of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.22452/mjcs.vol35no2.4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The Internet of Things is a new concept in the world of information and communication technology, in which for each being (whether it be a human, an animal or an object), the possibility of sending and receiving data through communication networks such as the Internet or Intranet is provided. Wireless sensors have limited energy resources due to their use of batteries in supplying energy, and since battery replacement in these sensors is not usually feasible, the longevity of wireless sensor networks is limited. Therefore, reducing the energy consumption of the used sensors in IoT networks to increase the network lifetime is one of the crucial challenges and parameters in such networks. In this paper, a routing protocol has been proposed and stimulated which is based on the function of the whale optimization algorithm. Clustering is performed through a routing method which is based on energy level, collision reduction, distance between cluster head node and destination, and neighbor energy. Furthermore, the selection of the cluster head node is performed based on the maximum remaining energy, the least distance with other clusters, and energy consumption, where energy consumption for reaching the base station is minimized. By de-creasing the level of cluster head energy from the specified threshold value from among the nodes in the same cluster, a node with an energy level above the threshold would be selected as the new cluster head. Moreover, four conditions (i.e. the shortest route, the leading route, the least distance to the source node, and destination node) are applied for routing. The proposed method was compared to LEACH, EEUC, EECRP, BEAR and CCR algorithms, and the results indicated the superiority of the proposed method to other methods in terms of the number of dead nodes.
期刊介绍:
The Malaysian Journal of Computer Science (ISSN 0127-9084) is published four times a year in January, April, July and October by the Faculty of Computer Science and Information Technology, University of Malaya, since 1985. Over the years, the journal has gained popularity and the number of paper submissions has increased steadily. The rigorous reviews from the referees have helped in ensuring that the high standard of the journal is maintained. The objectives are to promote exchange of information and knowledge in research work, new inventions/developments of Computer Science and on the use of Information Technology towards the structuring of an information-rich society and to assist the academic staff from local and foreign universities, business and industrial sectors, government departments and academic institutions on publishing research results and studies in Computer Science and Information Technology through a scholarly publication. The journal is being indexed and abstracted by Clarivate Analytics'' Web of Science and Elsevier''s Scopus