Particle swarm optimization-based load balance-aware energy-efficient scheduling for mobile crowd computing

被引:0
作者
Pramanik, Pijush Kanti Dutta [1 ]
Biswas, Tarun [2 ]
Choudhury, Prasenjit [3 ]
机构
[1] Galgotias Univ, Sch Comp Applicat & Technol, Greater Noida 203201, Uttar Pradesh, India
[2] Indian Inst Informat Technol Ranchi, Dept Comp Sci & Engn, Ranchi 835217, India
[3] Natl Inst Technol Durgapur, Dept Comp Sci & Engn, Durgapur, India
来源
SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL | 2025年 / 101卷 / 02期
关键词
Crowd computing; mobile cloud; mobile computing; task scheduling; energy efficiency; load balance; particle swarm optimization; SCHEME; TASKS;
D O I
10.1177/00375497241298346
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Due to their increasing computational power and energy-efficient hardware, today's smart mobile devices (SMDs) are replacing desktops and laptops as casual computing devices. Moreover, a cluster of such powerful SMDs can garner substantial high-performance computing (HPC). Such an HPC is achieved by utilizing publicly owned SMDs in mobile crowd computing (MCC). Here, a large computing-intensive task is divided and scheduled for the available SMDs for execution, and the results are recollected. This approach provides an economical and sustainable HPC. However, battery-powered constrained energy is a great hindrance to achieving this goal. Therefore, in the MCC, it is crucial to minimize the overall energy consumption to complete the task. This can be achieved to some extent by optimizing task scheduling to the appropriate SMDs. However, considering only energy efficiency might lead to an enormous load imbalance among SMDs, i.e., the most energy-efficient SMDs would be overloaded most of the time. Considering this, in this paper, we present a modified particle swarm optimization (PSO)-based scheduling algorithm to minimize the overall energy consumption among a set of SMDs designated to execute a set of MCC tasks while maintaining a satisfactory load balance level. Extensive simulations with both synthetic and real data sets are carried out to analyze and validate the proposed method. The work was compared with popular heuristic (minimum completion time (MCT), MinMin, MaxMin, and preconditioned progressive iterative approximation (PPIA)) and metaheuristic (genetic algorithm (GA)) optimization algorithms, which yields significant improvements over others in terms of the considered objectives. In addition, an analysis of variance (ANOVA) test is conducted to provide further evidence regarding the distinctiveness of the proposed algorithm.
引用
收藏
页码:159 / 176
页数:18
相关论文
共 47 条
[1]   An Efficient Dynamic-Decision Based Task Scheduler for Task Offloading Optimization and Energy Management in Mobile Cloud Computing [J].
Ali, Abid ;
Iqbal, Muhammad Munawar ;
Jamil, Harun ;
Qayyum, Faiza ;
Jabbar, Sohail ;
Cheikhrouhou, Omar ;
Baz, Mohammed ;
Jamil, Faisal .
SENSORS, 2021, 21 (13)
[2]   CWC: A Distributed Computing Infrastructure Using Smartphones [J].
Arslan, Mustafa Y. ;
Singh, Indrajeet ;
Singh, Shailendra ;
Madhyastha, Harsha V. ;
Sundaresan, Karthikeyan ;
Krishnamurthy, Srikanth V. .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2015, 14 (08) :1587-1600
[3]   Secure Distributed Mobile Volunteer Computing with Android [J].
Bibi, Iram ;
Akhunzada, Adnan ;
Malik, Jahanzaib ;
Khan, Muhammad Khurram ;
Dawood, Muhammad .
ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 2022, 22 (01)
[4]  
Biswas Tarun, 2018, INT C COMPUTING COMM
[5]  
Bonan H., 2018, J SE U, V34, P430
[6]  
Carroll A., 2010, USENIXATC 10
[7]  
Chen WH, 2017, 2017 IEEE 19TH INTERNATIONAL CONFERENCE ON E-HEALTH NETWORKING, APPLICATIONS AND SERVICES (HEALTHCOM), DOI 10.1109/HealthCom.2017.8210846
[8]  
De D., 2015, MOBILE CLOUD COMPUTI
[9]  
Eberhart RC., 1998, EVOLUTIONARY PROGRAM, V1447, p611 616
[10]  
Fernando N., 2012, 2012 15th International Conference on Network-Based Information Systems (NBiS 2012), P660, DOI 10.1109/NBiS.2012.122