A task scheduling algorithm based on improved NSGA-II for wireless ad hoc networks

To solve the problem the lower efficiency of task-performing caused by the mobility and failure-prone of ad hoc nodes, a multi-object optimization task scheduling algorithm (MOTA) is proposed for wireless ad hoc networks. This algorithm tries its best to make less Makespan, but meanwhile, it also pay much more attention to the failure probability and the energy-consuming of nodes. MOTA avoids the task assigned to the failure-prone node, which effectively reducing the effect of failed nodes on task-performing. Simulation results show that the proposed algorithm can trade off these three objectives well. Compared with the traditional task scheduling algorithms, simulation experiments obtain better results.