%0 Journal Article
%A ZHU Hong-bo
%A ZHU Xiao-rong
%A TIAN Xing-peng
%T Distributed Wireless Node Task Allocation Method Based on KM Algorithm
%D 
%R 10.13190/j.jbupt.2020-089
%J Journal of Beijing University of Posts and Telecommunications
%P 96-102
%V 43
%N 6
%X Aiming at the fact that a single node cannot meet the delay or energy consumption requirements of various novel applications,a distributed wireless node task collaborative allocation method is proposed to reduce the total delay or total energy consumption of all node processing tasks by utilizing the idle resources of surrounding nodes. Firstly, according to the analytic hierarchy process (AHP),the priority of task execution is determined according to the multi-dimensional attributes of tasks, such as calculation load and latest completion time. Then, the optimization model of time delay and energy consumption is established, which is transformed into the problem of maximum weight matching of bipartite graph. The optimal solution of task allocation is obtained by using Kuhn Munkras(KM)algorithm, which realizes the efficient cooperation of terminal nodes at the edge of network. The simulation results show that the algorithm can effectively reduce the time delay and energy consumption of task processing.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2020-089