HMADSO: a novel hill Myna and desert Sparrow optimization algorithm for cooperative rendezvous and task allocation in FANETs

Cooperative task allocation and decision are important aspects of networks that involve heterogeneous nodes operating in ad hoc mode like flying ad hoc networks (FANETs). The task allocation can be either mission based or simple utilization of available resources. In networks, including mission critical resources, cooperative task allocation and rendezvous are the key factors that drive the mission as well as optimize the performance. Many optimization algorithms have been designed and developed which focus on the cooperative behavior of nodes and also handle resources efficiently. Cooperative allocation and rendezvous both can be achieved by taking an example from biological world. In this paper, a new hill Myna and desert Sparrow optimization algorithm, namely HMADSO, is proposed for cooperative rendezvous and efficient task allocation. The application and analysis of proposed algorithm are shown for FANETs. To validate the proposed HMADSO, onboard processors, as well as simulation-based analysis, are carried out. The libraries for the proposed approach are provided at http://bit.ly/HMADSOcode.