An Energy-Aware Joint Routing and Task Allocation Algorithm in MEC Systems Assisted by Multiple UAVs

Author(s):  
Hui Xiao ◽  
Zhigang Hu ◽  
Kun Yang ◽  
Yao Du ◽  
Dongwei Chen
2013 ◽  
Vol 823 ◽  
pp. 439-444 ◽  
Author(s):  
Ya Wei Li ◽  
Bao An Li

This paper makes a research on multiple UAVs task allocation in cooperative combat. The control target is presented and the model is built of the problem. By introducing load factor, the traditional task allocation algorithm based on contract net is improved. With considering the mission capability of UAVs, a task allocation algorithm based on improved contract net is given. The improved algorithm can significantly reduce the communication between UAVs, and can optimize the task allocation process. The simulation results show that compared with the traditional task allocation algorithm based on contract net, the improved algorithm can improve the efficiency of UAVs task allocation and balance the task load between the UAVs, it can solve the problem of multiple types of tasks allocation effectively.


2010 ◽  
Vol 56 (2) ◽  
pp. 197-202
Author(s):  
Marcin Markowski

Resource and Task Allocation Algorithm for WAN-based Distributed Computing EnvironmentIn the paper an approximate algorithm for optimizing of distributed computing WAN network is proposed. Distributed computing systems become the common tools in different kind of business, science and even entertainment. In order to minimize processing time of data and utilize spare resources available on remote systems, many companies and institutions decide to build and maintain own wide area networks (WAN) for ensuring reliable and secure distributed processing of data. Design of WANs in concerned with solving different optimization problems, like routing assignment, capacities of channel selection, resource (i.e. servers, management centre) allocation. Due to peculiar structure of wide area networks and nature of protocols, proper optimization methods and algorithms should be constructed for WAN-based distributed computing systems. In the paper the model of the distributed environment, built on WAN infrastructure is presented. Then, the optimization problem for routing assignment, channel capacities assignment and grid management center (data repository) allocation is formulated. Finally, an approximate algorithm is presented for formulated problem. Proposed algorithm, observations and conclusions should effect in improving of distributed computing systems design.


Author(s):  
Phanish Puranam

Division of labor involves task division and task allocation. An extremely important consequence of task division and allocation is the creation of interdependence between agents. In fact, division of labor can be seen as a process that converts interdependence between tasks into interdependence between agents. While there are many ways in which the task structure can be chunked and divided among agents, two important heuristic approaches involve division of labor by activity vs. object. I show that a choice between these two forms of division of labor only arises when the task structure is non-decomposable, but the product itself is decomposable. When the choice arises, a key criterion for selection between activity vs. object-based division of labor is the gain from specialization relative to the gain from customization.


Sign in / Sign up

Export Citation Format

Share Document