Using Metaheuristic OFA Algorithm for Service Placement in Fog Computing

被引:0
作者
Altunay, Riza [1 ,2 ]
Bay, Omer Faruk [3 ]
机构
[1] Gazi Univ, Dept Informat Syst, TR-06680 Ankara, Turkiye
[2] Ondokuz Mayis Univ, Dept Comp Technol, TR-55100 Samsun, Turkiye
[3] Gazi Univ, Dept Elect Engn, TR-06560 Ankara, Turkiye
来源
CMC-COMPUTERS MATERIALS & CONTINUA | 2023年 / 77卷 / 03期
关键词
Internet of Things; cloud computing; fog computing;
D O I
10.32604/cmc.2023.042340
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The use of fog computing in the Internet of Things (IoT) has emerged as a crucial solution, bringing cloud services closer to end users to process large amounts of data generated within the system. Despite its advantages, the increasing task demands from IoT objects often overload fog devices with limited resources, resulting in system delays, high network usage, and increased energy consumption. One of the major challenges in fog computing for IoT applications is the efficient deployment of services between fog clouds. To address this challenge, we propose a novel Optimal Foraging Algorithm (OFA) for task placement on appropriate fog devices, taking into account the limited resources of each fog node. The OFA algorithm optimizes task sharing between fog devices by evaluating incoming task requests based on their types and allocating the services to the most suitable fog nodes. In our study, we compare the performance of the OFA algorithm with two other popular algorithms: Genetic Algorithm (GA) and Randomized Search Algorithm (RA). Through extensive simulation experiments, our findings demonstrate significant improvements achieved by the OFA algorithm. Specifically, it leads to up to 39.06% reduction in energy consumption for the Elektroensefalografi (EEG) application, up to 25.86% decrease in CPU utilization for the Intelligent surveillance through distributed camera networks (DCNS) application, up to 57.94% reduction in network utilization, and up to 23.83% improvement in runtime, outperforming other algorithms. As a result, the proposed OFA algorithm enhances the system's efficiency by effectively allocating incoming task requests to the appropriate fog devices, mitigating the challenges posed by resource limitations and contributing to a more optimized IoT ecosystem.
引用
收藏
页码:2881 / 2897
页数:17
相关论文
共 33 条
[1]   Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network [J].
Abdulrazzak, Hazem Noori ;
Hock, Goh Chin ;
Radzi, Nurul Asyikin Mohamed ;
Tan, Nadia M. L. ;
Kwong, Chiew Foong .
MATHEMATICS, 2022, 10 (24)
[2]  
Adrian R., 2021, International Journal of Computer Networks & Communications, V13, P79
[3]  
Al-Jameel HAE, 2016, JORDAN J CIV ENG, V10, P403
[4]   A comprehensive survey on clustering in vehicular networks: Current solutions and future challenges [J].
Ayyub, Muddasar ;
Oracevic, Alma ;
Hussain, Rasheed ;
Khan, Ammara Anjum ;
Zhang, Zhongshan .
AD HOC NETWORKS, 2022, 124
[5]  
Bayless S., 2015, Recommended Practices for DSRC Licensing and Spectrum Management: A Guide for Management, Regulation, Deployment, and Administration for a Connected Vehicle Environment
[6]   A Self-Adaptable Angular Based K-Medoid Clustering Scheme (SAACS) for Dynamic VANETs [J].
Bijalwan, Akhilesh ;
Purohit, Kamlesh Chandra ;
Malik, Preeti ;
Mittal, Mohit .
ELECTRONICS, 2022, 11 (19)
[7]   On the Connection Availability between Relay Nodes in a VANET [J].
Cardote, Andre ;
Sargento, Susana ;
Steenkiste, Peter .
2010 IEEE GLOBECOM WORKSHOPS, 2010, :181-185
[8]  
Chai R, 2014, 2014 14TH INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES (ISCIT), P233, DOI 10.1109/ISCIT.2014.7011907
[9]   A Comparative Survey of VANET Clustering Techniques [J].
Cooper, Craig ;
Franklin, Daniel ;
Ros, Montserrat ;
Safaei, Farzad ;
Abolhasan, Mehran .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (01) :657-681
[10]  
Elira B., 2021, INT J INTELL NETW, V2, P148, DOI DOI 10.1016/J.IJIN.2021.09.006