scholarly journals Deep Reinforcement Learning for Collaborative Computation Offloading on Internet of Vehicles

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Yureng Li ◽  
Shouzhi Xu ◽  
Dawei Li
Keyword(s):  
Optimization Problem ◽  
Resource Constraints ◽  
Computation Offloading ◽  
Time Varying ◽  
Internet Of Vehicles ◽  
System Cost ◽  
Q Learning ◽  
Simulation Results ◽  
Feasible Solutions ◽  
Cloud Network

With the increase of Internet of vehicles (IoVs) traffic, the contradiction between a large number of computing tasks and limited computing resources has become increasingly prominent. Although many existing studies have been proposed to solve this problem, their main consideration is to achieve different optimization goals in the case of edge offloading in static scenarios. Since realistic scenarios are complicated and generally time-varying, these studies in static scenes are imperfect. In this paper, we consider a collaborative computation offloading in a time-varying edge-cloud network, and we formulate an optimization problem with considering both delay constraints and resource constraints, aiming to minimize the long-term system cost. Since the set of feasible solutions to the problem is nonconvex, and the complexity of the problem is very large, we propose a Q-learning-based approach to solve the optimization problem. In addition, due to the dimensional catastrophes, we further propose a DQN-based approach to solve the optimization problem. Finally, by comparing our two proposed algorithms with typical algorithms, the simulation results show that our proposed approaches achieve better performance. Under the same conditions, by comparing our two proposed algorithms with typical algorithms, the simulation results show that our proposed Q-learning-based method reduces the system cost by about 49% and 42% compared to typical algorithms. And in the same case, compared with the classical two schemes, our proposed DQN-based scheme reduces the system cost by 62% and 57%.

An Algorithm for Resource Optimum Scheduling for Virtual Machine Services on Clouds

2013 ◽  
Vol 427-429 ◽  
pp. 2473-2476
Author(s):  
Yue Li Dong ◽  
Quan Guo ◽  
Bin Sun
Keyword(s):  
Resource Management ◽  
Virtual Machine ◽  
Optimization Problem ◽  
Resource Constraints ◽  
Optimal Solution ◽  
Spare Time ◽  
Simulation Results ◽  
Management Issues

Resource optimum scheduling with resource constraints is a complicated optimization problem. In this paper, in order to address complex resource management issues, some optimizations are adopted, such as, making use of the spare time between two subtasks which are on the same node, optimizing the order of executing subtasks, and so on. The algorithm can approximate the optimal solution quickly and stably. The simulation results demonstrate that the algorithm works effectively for this class of problems.

scholarly journals Computation offloading through mobile vehicles in IoT-edge-cloud network

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Jun Long ◽  
Yueyi Luo ◽  
Xiaoyu Zhu ◽  
Entao Luo ◽  
Mingfeng Huang
Keyword(s):  
Reinforcement Learning ◽  
Energy Consumption ◽  
Low Cost ◽  
Computation Offloading ◽  
Mobile Edge Computing ◽  
Challenging Problem ◽  
Learning Technique ◽  
Cloud Network ◽  
The City ◽  
Task Offloading

AbstractWith the developing of Internet of Things (IoT) and mobile edge computing (MEC), more and more sensing devices are widely deployed in the smart city. These sensing devices generate various kinds of tasks, which need to be sent to cloud to process. Usually, the sensing devices do not equip with wireless modules, because it is neither economical nor energy saving. Thus, it is a challenging problem to find a way to offload tasks for sensing devices. However, many vehicles are moving around the city, which can communicate with sensing devices in an effective and low-cost way. In this paper, we propose a computation offloading scheme through mobile vehicles in IoT-edge-cloud network. The sensing devices generate tasks and transmit the tasks to vehicles, then the vehicles decide to compute the tasks in the local vehicle, MEC server or cloud center. The computation offloading decision is made based on the utility function of the energy consumption and transmission delay, and the deep reinforcement learning technique is adopted to make decisions. Our proposed method can make full use of the existing infrastructures to implement the task offloading of sensing devices, the experimental results show that our proposed solution can achieve the maximum reward and decrease delay.

scholarly journals Blockchain-Based Solutions for UAV-Assisted Connected Vehicle Networks in Smart Cities: A Review, Open Issues, and Future Perspectives

Telecom ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 108-140
Author(s):  
Paulo Álvares ◽  
Lion Silva ◽  
Naercio Magaia
Keyword(s):  
Traffic Congestion ◽  
Resource Constraints ◽  
Smart Cities ◽  
The Internet ◽  
Connected Vehicle ◽  
Sensitive Data ◽  
Internet Of Vehicles ◽  
Smart Vehicles ◽  
Security Properties ◽  
Vehicle Networks

It had been predicted that by 2020, nearly 26 billion devices would be connected to the Internet, with a big percentage being vehicles. The Internet of Vehicles (IoVa) is a concept that refers to the connection and cooperation of smart vehicles and devices in a network through the generation, transmission, and processing of data that aims at improving traffic congestion, travel time, and comfort, all the while reducing pollution and accidents. However, this transmission of sensitive data (e.g., location) needs to occur with defined security properties to safeguard vehicles and their drivers since attackers could use this data. Blockchain is a fairly recent technology that guarantees trust between nodes through cryptography mechanisms and consensus protocols in distributed, untrustful environments, like IoV networks. Much research has been done in implementing the former in the latter to impressive results, as Blockchain can cover and offer solutions to many IoV problems. However, these implementations have to deal with the challenge of IoV node’s resource constraints since they do not suffice for the computational and energy requirements of traditional Blockchain systems, which is one of the biggest limitations of Blockchain implementations in IoV. Finally, these two technologies can be used to build the foundations for smart cities, enabling new application models and better results for end-users.

Placement of Digital Microfluidic Biochips via a New Evolutionary Algorithm

2021 ◽  
Vol 26 (6) ◽  
pp. 1-22
Author(s):  
Chen Jiang ◽  
Bo Yuan ◽  
Tsung-Yi Ho ◽  
Xin Yao
Keyword(s):  
Evolutionary Algorithm ◽  
Resource Constraints ◽  
Scheduling Algorithm ◽  
Search Space ◽  
Placement Problem ◽  
Heuristic Scheduling ◽  
Microfluidic Biochips ◽  
Feasible Solutions ◽  
Digital Microfluidic ◽  
Operation Scheduling

Digital microfluidic biochips (DMFBs) have been a revolutionary platform for automating and miniaturizing laboratory procedures with the advantages of flexibility and reconfigurability. The placement problem is one of the most challenging issues in the design automation of DMFBs. It contains three interacting NP-hard sub-problems: resource binding, operation scheduling, and module placement. Besides, during the optimization of placement, complex constraints must be satisfied to guarantee feasible solutions, such as precedence constraints, storage constraints, and resource constraints. In this article, a new placement method for DMFB is proposed based on an evolutionary algorithm with novel heuristic-based decoding strategies for both operation scheduling and module placement. Specifically, instead of using the previous list scheduler and path scheduler for decoding operation scheduling chromosomes, we introduce a new heuristic scheduling algorithm (called order scheduler) with fewer limitations on the search space for operation scheduling solutions. Besides, a new 3D placer that combines both scheduling and placement is proposed where the usage of the microfluidic array over time in the chip is recorded flexibly, which is able to represent more feasible solutions for module placement. Compared with the state-of-the-art placement methods (T-tree and 3D-DDM), the experimental results demonstrate the superiority of the proposed method based on several real-world bioassay benchmarks. The proposed method can find the optimal results with the minimum assay completion time for all test cases.

scholarly journals Latency-Optimal Computational Offloading Strategy for Sensitive Tasks in Smart Homes

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2347
Author(s):  
Yanyan Wang ◽  
Lin Wang ◽  
Ruijuan Zheng ◽  
Xuhui Zhao ◽  
Muhua Liu
Keyword(s):  
Queue Length ◽  
Optimization Problem ◽  
Time Slot ◽  
Smart Homes ◽  
Back Pressure ◽  
Smart Devices ◽  
Smart Device ◽  
Simulation Results ◽  
Computational Offloading ◽  
The Stability

In smart homes, the computational offloading technology of edge cloud computing (ECC) can effectively deal with the large amount of computation generated by smart devices. In this paper, we propose a computational offloading strategy for minimizing delay based on the back-pressure algorithm (BMDCO) to get the offloading decision and the number of tasks that can be offloaded. Specifically, we first construct a system with multiple local smart device task queues and multiple edge processor task queues. Then, we formulate an offloading strategy to minimize the queue length of tasks in each time slot by minimizing the Lyapunov drift optimization problem, so as to realize the stability of queues and improve the offloading performance. In addition, we give a theoretical analysis on the stability of the BMDCO algorithm by deducing the upper bound of all queues in this system. The simulation results show the stability of the proposed algorithm, and demonstrate that the BMDCO algorithm is superior to other alternatives. Compared with other algorithms, this algorithm can effectively reduce the computation delay.

scholarly journals Nonconvex constrained optimization by a filtering branch and bound

2020 ◽  
Author(s):  
Gabriele Eichfelder ◽  
Kathrin Klamroth ◽  
Julia Niebling
Keyword(s):  
Constrained Optimization ◽  
Optimization Problem ◽  
Feasible Solution ◽  
Constrained Optimization Problem ◽  
Numerical Tests ◽  
Nonconvex Constrained Optimization ◽  
Objective Value ◽  
Feasible Solutions ◽  
Quality Guarantee ◽  
Single Objective

AbstractA major difficulty in optimization with nonconvex constraints is to find feasible solutions. As simple examples show, the $$\alpha $$ α BB-algorithm for single-objective optimization may fail to compute feasible solutions even though this algorithm is a popular method in global optimization. In this work, we introduce a filtering approach motivated by a multiobjective reformulation of the constrained optimization problem. Moreover, the multiobjective reformulation enables to identify the trade-off between constraint satisfaction and objective value which is also reflected in the quality guarantee. Numerical tests validate that we indeed can find feasible and often optimal solutions where the classical single-objective $$\alpha $$ α BB method fails, i.e., it terminates without ever finding a feasible solution.

Trajectory Optimization Applied to Space Rendezvous

2013 ◽  
Vol 756-759 ◽  
pp. 3466-3470
Author(s):  
Xu Min Song ◽  
Qi Lin
Keyword(s):  
Simulated Annealing ◽  
Optimization Model ◽  
Trajectory Optimization ◽  
Optimization Problem ◽  
Optimization Method ◽  
Nonlinear Constraints ◽  
Design Variables ◽  
Adaptive Simulated Annealing ◽  
Simulation Results

The trajcetory plan problem of spece reandezvous mission was studied in this paper using nolinear optimization method. The optimization model was built based on the Hills equations. And by analysis property of the design variables, a transform was put forward , which eliminated the equation and nonlinear constraints as well as decreaseing the problem dimensions. The optimization problem was solved using Adaptive Simulated Annealing (ASA) method, and the rendezvous trajectory was designed.The method was validated by simulation results.

Sign in / Sign up

Export Citation Format

Share Document