scholarly journals Resource pooling in vehicular fog computing

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Chaogang Tang ◽  
Shixiong Xia ◽  
Qing Li ◽  
Wei Chen ◽  
Weidong Fang
Keyword(s):  
Genetic Algorithm ◽  
Resource Allocation ◽  
Task Scheduling ◽  
Optimization Problem ◽  
Fog Computing ◽  
Energy Reduction ◽  
Resource Pooling ◽  
Computing Services ◽  
Time Optimization ◽  
Go Model

AbstractVehicular fog computing (VFC) provisions computing services at the edge of networks by fully exploiting the idle resources of vehicle loaded computer systems. Task scheduling and resource allocation revolved around VFC have gained tremendous attention recently. Currently, most of these works in VFC have focused on response time optimization or energy reduction. Computing services are provisioned in a pay-as-you-go model and vehicles as resource contributors are stimulated by the benefits obtained by leasing these resources. How to maximize their own benefits is one of big concerns but few of current works have recognized its importance in VFC. We in this paper introduce the notion of resource pooling into VFC where the computing resources of vehicles are pooled together to jointly provision computational services in a community. A genetic algorithm based strategy is proposed to solve the optimization problem for the sake of benefit maximization. Extensive experiments have been carried out to evaluate the approach and the numeric results have demonstrated that our strategy outstands other approaches with regards to the optimization objective.

scholarly journals Fog Computing-Assisted Energy-Efficient Resource Allocation for High-Mobility MIMO-OFDMA Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Lingyun Lu ◽  
Tian Wang ◽  
Wei Ni ◽  
Kai Li ◽  
Bo Gao
Keyword(s):  
Resource Allocation ◽  
Energy Efficient ◽  
High Speed ◽  
Optimization Problem ◽  
Fog Computing ◽  
High Mobility ◽  
High Speed Train ◽  
Efficient Resource ◽  
Energy Efficient Resource Allocation ◽  
System Configurations

This paper presents a suboptimal approach for resource allocation of massive MIMO-OFDMA systems for high-speed train (HST) applications. An optimization problem is formulated to alleviate the severe Doppler effect and maximize the energy efficiency (EE) of the system. We propose to decouple the problem between the allocations of antennas, subcarriers, and transmit powers and solve the problem by carrying out the allocations separately and iteratively in an alternating manner. Fast convergence can be achieved for the proposed approach within only several iterations. Simulation results show that the proposed algorithm is superior to existing techniques in terms of system EE and throughput in different system configurations of HST applications.

Secure Computing Resource Allocation Framework For Open Fog Computing

2020 ◽  
Vol 63 (4) ◽  
pp. 567-592
Author(s):  
Jiafu Jiang ◽  
Linyu Tang ◽  
Ke Gu ◽  
WeiJia Jia
Keyword(s):  
Resource Allocation ◽  
Data Storage ◽  
Fog Computing ◽  
Computing Time ◽  
Matrix Multiplication ◽  
Computational Cost ◽  
Collusion Attack ◽  
Computing Resource ◽  
Computing Services ◽  
Secure Computing

Abstract Fog computing has become an emerging environment that provides data storage, computing and some other services on the edge of network. It not only can acquire data from terminal devices, but also can provide computing services to users by opening computing resources. Compared with cloud computing, fog devices can collaborate to provide users with powerful computing services through resource allocation. However, as many of fog devices are not monitored, there are some security problems. For example, since fog server processes and maintains user information, device information, task parameters and so on, fog server is easy to perform illegal resource allocation for extra benefits. In this paper, we propose a secure computing resource allocation framework for open fog computing. In our scheme, the fog server is responsible for processing computing requests and resource allocations, and the cloud audit center is responsible for auditing the behaviors of the fog servers and fog nodes. Based on the proposed security framework, our proposed scheme can resist the attack of single malicious node and the collusion attack of fog server and computing devices. Furthermore, the experiments show our proposed scheme is efficient. For example, when the number of initial idle service devices is 40, the rejection rate of allocated tasks is 10% and the total number of sub-tasks is changed from 150 to 200, the total allocation time of our scheme is only changed from 15 ms to 25 ms; additionally, when the task of 5000 order matrix multiplication is tested on 10 service devices, the total computing time of our scheme is $\sim$250 s, which is better than that of single computer (where single computer needs more than 1500 s). Therefore, our proposed scheme has obvious advantages when it faces some tasks that require more computational cost, such as complex scientific computing, distributed massive data query, distributed image processing and so on.

Learning-Based Task Scheduling Using Big Bang Big Crunch for Cloud Computing Environment

2020 ◽  
Vol 13 (2) ◽  
pp. 137-146 ◽  
Author(s):  
Pradeep Singh Rawat ◽  
Priti Dimri ◽  
Punit Gupta
Keyword(s):  
Genetic Algorithm ◽  
Resource Allocation ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Low Cost ◽  
Big Bang ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
Big Crunch ◽  
Resource Cost

: Cloud Computing is a growing industry for secure and low cost pay per use resources. Efficient resource allocation is the challenging issue in cloud computing environment. Many task scheduling algorithms used to improve the performance of system. It includes ant colony, genetic algorithm and Round Robin improve the performance but these are not cost efficient at the same time. : Scheduling issue and resource cost resolve using improved meta-heuristic approaches. In this work, a cost aware algorithm improved using Big-Bang Big-Crunch based task mapping is proposed which reduces the execution time and cost paid for the resources at the time of execution. The cost aware meta-heuristic technique used. Results show that the proposed algorithm provides better cost efficiency than the existing genetic algorithm. The proposed Big-Bang Big-Crunch based resource allocation technique evaluated against the Genetic approach. Results: Performance is measured using an optimization criteria tasks completion time and resource operational cost in the duration of execution. The population size and user requests measures the performance of the proposed model. : The simulation shows that the proposed cost and time aware technique outperforms using performance measurement parameters (average finish time, resource cost).

scholarly journals Computation Offloading and Scheduling in Edge-Fog Cloud Computing

2019 ◽  
Vol 1 (1) ◽  
Author(s):  
Dadmehr Rahbari ◽  
Mohsen Nickray
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Energy Consumption ◽  
Task Scheduling ◽  
Fog Computing ◽  
Edge Computing ◽  
Computation Offloading ◽  
Test Environment ◽  
Iot Devices ◽  
And Task

Resource allocation and task scheduling in the Cloud environment faces many challenges, such as time delay, energy consumption, and security. Also, executing computation tasks of mobile applications on mobile devices (MDs) requires a lot of resources, so they can offload to the Cloud. But Cloud is far from MDs and has challenges as high delay and power consumption. Edge computing with processing near the Internet of Things (IoT) devices have been able to reduce the delay to some extent, but the problem is distancing itself from the Cloud. The fog computing (FC), with the placement of sensors and Cloud, increase the speed and reduce the energy consumption. Thus, FC is suitable for IoT applications. In this article, we review the resource allocation and task scheduling methods in Cloud, Edge and Fog environments, such as traditional, heuristic, and meta-heuristics. We also categorize the researches related to task offloading in Mobile Cloud Computing (MCC), Mobile Edge Computing (MEC), and Mobile Fog Computing (MFC). Our categorization criteria include the issue, proposed strategy, objectives, framework, and test environment. 

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

Sign in / Sign up

Export Citation Format

Share Document